{"_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_c5ecdfc727a8d2e1166930f66f8673519cd90b2293ce37b775264a066a63709b","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_c5ecdfc727a8d2e1166930f66f8673519cd90b2293ce37b775264a066a63709b","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"74a18d6c9efea317b3a3386a2f088a928e5d12f0c88c28d496eec8e7771b2624","published":"Tue, 26 May 2026 00:00:00 -0400","receipt_hash":"74a18d6c9efea317b3a3386a2f088a928e5d12f0c88c28d496eec8e7771b2624","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":"74a18d6c9efea317b3a3386a2f088a928e5d12f0c88c28d496eec8e7771b2624","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:2605.24926v1 Announce Type: new \nAbstract: Runtime fairness is not a one-time constraint but a dynamic property evaluated over a sequence of decisions.\n  To ensure fairness at runtime, it is necessary to account for past decisions, information neglected by conventional, static classifiers.\n  Traditional fairness shields enforce runtime fairness abruptly,\n  by intervening \\emph{deterministically} whenever a sequence of decisions violates the target for a running fairness measure. This motivates our \\emph{main conceptual contribution: \\textbf{energy shields}.}\n  An energy shield is a novel, lightweight, adaptive controller that monitors a sequence of decisions and intervenes \\emph{probabilistically} to ensure runtime fairness smoothly, by utilizing physics-inspired energy functions to nudge the sequence toward fairness:\n  the more unfair the decisions, the stronger the nudging force becomes. This makes energy shields the \\emph{\\textbf{first}} fairness shields to provide both \\emph{","title":"Energy Shields for Fairness","url":"https://arxiv.org/abs/2605.24926","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.24926v1 Announce Type: new \nAbstract: Runtime fairness is not a one-time constraint but a dynamic property evaluated over a sequence of decisions.\n  To ensure fairness at runtime, it is necessary to account for past decisions, information neglected by conventional, static classifiers.\n  Traditional fairness shields enforce runtime fairness abruptly,\n  by intervening \\emph{deterministically} whenever a sequence of decisions violates the target for a running fairness measure. This motivates our \\emph{main conceptual contribution: \\textbf{energy shields}.}\n  An energy shield is a novel, lightweight, adaptive controller that monitors a sequence of decisions and intervenes \\emph{probabilistically} to ensure runtime fairness smoothly, by utilizing physics-inspired energy functions to nudge the sequence toward fairness:\n  the more unfair the decisions, the stronger the nudging force becomes. This makes energy shields the \\emph{\\textbf{first}} fairness shields to provide both \\emph{","title":"Energy Shields for Fairness","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/2605.24926"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:7a482b53e958c1336ede31821b1c7f5d6f9dd37d42ff368f6e12edb91b31e5a36a69bfe4bbcbf6b9b553404d9a5cb00ec93b6b4b9092a7b2751c4af853916d09","signer":"crovia.substrate","subject":{"observed_at":"2026-05-26T04:43:39Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.24926"},"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":"0c661e1f4f062665cb430a5764bd869e3b41fa10bd8fa989dc2b1e139a7f3224","leaf_index":151395,"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":"f70a07126293729a12df5a3a5250c4474dab3b53e567af9b0ad667286cccdf01","side":"left"},{"sibling":"871efad11fd0f8c8f4a029aa82dab8896e773b0f1ec3013b83b71c7a5b155cf9","side":"left"},{"sibling":"bc70e28340610f8850e9b1438bf9de4cf35a53bcb9c9066a43c8067070e9b002","side":"right"},{"sibling":"3ab629da3241447f864729536b08339ca40be402b350eb2d3cb67f3c9170f554","side":"right"},{"sibling":"cf566670849b007886060a947d1fc15cafc6876e762e0e745c9af766b858ffcf","side":"right"},{"sibling":"ccb0d1ce6fe03ae447d77b1a5d403df935110ea0f0cacdaa2f110858f5bf0ce1","side":"left"},{"sibling":"0a5010458437ccad9c345d7808e550a19558e3d8585ebb9302d9493157ff7a12","side":"left"},{"sibling":"8d693959d4763b28b351e1bc64d35b03213077740e93193dee0f2ab1f6459eb7","side":"right"},{"sibling":"a808644c9a09dd75253c6c0ba9275dc94a6b6451ad5184ebdafda4a2722b36a5","side":"left"},{"sibling":"fdd22ebd87e5ba37d1153e47753a63818abb25df8fe45dbf735ba5c512c3355b","side":"left"},{"sibling":"cf593c482d17d202b94914915d0c65fb8713053548db64771d0ec5dbb404a07f","side":"left"},{"sibling":"134949308b15cffd6792ee2cf678119af34d69a64764d7c89cd47573c94e1cda","side":"left"},{"sibling":"e20a7391fed5b5f3b675af68344a3f5b050d6701e127b7db010af3941e59dfdb","side":"right"},{"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_c5ecdfc727a8d2e1166930f66f8673519cd90b2293ce37b775264a066a63709b"}}