{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_27269a72767d92106dd4c5a1c04033522313d7fbf2ee1427979e2540325a202e","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_27269a72767d92106dd4c5a1c04033522313d7fbf2ee1427979e2540325a202e","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"a42fe532be5208013cfed719c69589317d8f886deb1fe536e518f3e1ee1d2b49","published":"Tue, 26 May 2026 00:00:00 -0400","receipt_hash":"a42fe532be5208013cfed719c69589317d8f886deb1fe536e518f3e1ee1d2b49","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"a42fe532be5208013cfed719c69589317d8f886deb1fe536e518f3e1ee1d2b49","observed_at":"2026-05-26T04:43:39.018238Z","parent_run_hash":"dca8dedd754ad6a1772113d6b97ee4f4ab9a0afbdeb44aaace5ff2d2446b164b","published":"Tue, 26 May 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2510.15514v3 Announce Type: replace \nAbstract: Reinforcement Learning from AI Feedback (RLAIF) relies on LLM judges as preference measurement instruments, yet these instruments are fundamentally limited by  random measurement errors -- stochastic fluctuations that manifest as preference cycles (e.g., $A \\succ B \\succ C \\succ A$), occurring in 5-9% of evaluations across state-of-the-art models. While repeated sampling mitigates noise by averaging multiple judgments, it treats each comparison in isolation and fails to exploit the structural constraints that distinguish systematic signals from random noise. We introduce Topological Consensus Rewards (TCR), a framework that leverages transitivity as a denoising mechanism via topological majority voting: systematic signals reinforce each other through transitive chains, while random errors cluster into topologically exposed cycles. TCR approximates the Maximum Acyclic Subgraph to filter stochastic noise from preference signals. We als","title":"Voting with the Graph: Stable RLAIF via Topological Consistency Maximization","url":"https://arxiv.org/abs/2510.15514","vendor":"arxiv_cs_ai"},"summary":"arXiv:2510.15514v3 Announce Type: replace \nAbstract: Reinforcement Learning from AI Feedback (RLAIF) relies on LLM judges as preference measurement instruments, yet these instruments are fundamentally limited by  random measurement errors -- stochastic fluctuations that manifest as preference cycles (e.g., $A \\succ B \\succ C \\succ A$), occurring in 5-9% of evaluations across state-of-the-art models. While repeated sampling mitigates noise by averaging multiple judgments, it treats each comparison in isolation and fails to exploit the structural constraints that distinguish systematic signals from random noise. We introduce Topological Consensus Rewards (TCR), a framework that leverages transitivity as a denoising mechanism via topological majority voting: systematic signals reinforce each other through transitive chains, while random errors cluster into topologically exposed cycles. TCR approximates the Maximum Acyclic Subgraph to filter stochastic noise from preference signals. We als","title":"Voting with the Graph: Stable RLAIF via Topological Consistency Maximization","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-26T04:43:39Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2510.15514"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:a29a51b5941588090232cea8ee87ebdbf7deb38bd06398d299807cc0af1973ee0367b37e23b29bf689f39573d0f0e24b6fb08414410e3c1612aa1a350ef1a10f","signer":"crovia.substrate","subject":{"observed_at":"2026-05-26T04:43:39Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2510.15514"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"4cb717e9e170dab775ff4d295925cb9301079ddf997874f282790caf77a2fa4c","leaf_index":151781,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"d0f2158757e0361d13cac630ed86f57e9d3cad32968e14902e8f0e595a3611f8","side":"left"},{"sibling":"01f454281945906e1654c9b9e83d4d3a84f72832c608ba3db0b6348c2636dcb7","side":"right"},{"sibling":"0af7d53c9afbc66d5355f57e51cb4bc2ee263794f303c597b0f6bcb7443db3cd","side":"left"},{"sibling":"a4357445e942ee9bfe7d869201f4e465c2d8ce30b3e116a2c329b4b1071c6ff0","side":"right"},{"sibling":"6fda1e7335cc7f2be6732950fdb49de3ed156547da0318ce436d58640b7832be","side":"right"},{"sibling":"8965e40768d514c8e8a3dec700a2cc91e3f2453b9177636680106ba94d5756f3","side":"left"},{"sibling":"995c5183ae35c285c0b1b516f6ec38a4e2ea87b861f4feb17fe9bba32548c97d","side":"left"},{"sibling":"f9db7ff3c5db7011b2738b446bad7b165ec8fd162c800ba3bad08298201edaa3","side":"left"},{"sibling":"aff657821100efc777fe98abc63d25a13c2d813d2a00f85a278e295ee3a166b3","side":"right"},{"sibling":"879666fab72e779ab55d0564eaabd64b00534fd6bba7f18412c7f31f61ffd09f","side":"right"},{"sibling":"f40ccedd90c323817e961adc0a2e2db82b8aabe192b6c9d5a373ff988987b207","side":"right"},{"sibling":"b85ea61ae405eed84392a7b6b1eee5536f5a38d6b04070638e23ec7b71e3443a","side":"right"},{"sibling":"d415e6939aee710631f5062799379b547d2c3e3d9a68f263bbb5a693285ab2ca","side":"left"},{"sibling":"e5893793e3591ed7f5e58ca94ffcfba46bb30f69fb1c25d5ba8ef49eb99f9126","side":"right"},{"sibling":"35ca36cee447f0ef7064a25d55f59357c66901e31427729c4c1d8b14aa8adb6c","side":"left"},{"sibling":"e3eecaf996dbe7229a7bb1d234c97aea97a252c5f7c89f8547b6d091db0f0e40","side":"right"},{"sibling":"55bcbd4da3e20d93931f7e58673f10232e81a5b1514d7396cb4b71e8f95788d0","side":"right"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":152106,"merkle_root":"ac5182c6f3dd09931f2a689df5f4be36df7b55e55bcf106e195671f5ed55fd8f","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260526T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-26T05:37:34Z","sig_algorithm":"ed25519","signature":"a401243fbd2c077d29a623c6ef616c78fbd5c8ce1930afa7af7165b2386e5a8cf15d5094983a1c962e71b27b911a3f3ce09c8cfab9393be2ce5ce8ee6513da06","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_27269a72767d92106dd4c5a1c04033522313d7fbf2ee1427979e2540325a202e"}}