{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VPUYMYPBMGB2PBR76ZODRJ2PMC","short_pith_number":"pith:VPUYMYPB","canonical_record":{"source":{"id":"2605.15620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-15T05:02:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1cebe2e302eaee8d624a7f67f11397e57cbc39183447f338bc17e23d1dab15de","abstract_canon_sha256":"50373642908d5d2856918dfd4d66f73ac2a09880e82adcaf66f556428726e16e"},"schema_version":"1.0"},"canonical_sha256":"abe98661e16183a7863ff65c38a74f609acc3b4f5ba010438fe2c47f372b18ca","source":{"kind":"arxiv","id":"2605.15620","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15620","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15620v1","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15620","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_12","alias_value":"VPUYMYPBMGB2","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_16","alias_value":"VPUYMYPBMGB2PBR7","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_8","alias_value":"VPUYMYPB","created_at":"2026-05-20T00:01:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VPUYMYPBMGB2PBR76ZODRJ2PMC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-15T05:02:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1cebe2e302eaee8d624a7f67f11397e57cbc39183447f338bc17e23d1dab15de","abstract_canon_sha256":"50373642908d5d2856918dfd4d66f73ac2a09880e82adcaf66f556428726e16e"},"schema_version":"1.0"},"canonical_sha256":"abe98661e16183a7863ff65c38a74f609acc3b4f5ba010438fe2c47f372b18ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:08.570748Z","signature_b64":"tTFZXlpZYV0KC02UUuWo5/hLLF67tq5Tkk9uFLycaJ434ZV6HFb2AxESgHjKke4ETwBEa3RCGiOGsPUfS3mHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abe98661e16183a7863ff65c38a74f609acc3b4f5ba010438fe2c47f372b18ca","last_reissued_at":"2026-05-20T00:01:08.569800Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:08.569800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15620","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDQEho5jtUvXYcGKAZO5ce4fcfT5jJ+jILgcEgifz6zycQWNWyLJHUPHqChksr+pmQnKv9XTZC8BMHLh1MeeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:51:03.308792Z"},"content_sha256":"5a74583a109248ad2891adf7c3c2597ea0f438a6fc7ea25d8822519ff4fa6ccd","schema_version":"1.0","event_id":"sha256:5a74583a109248ad2891adf7c3c2597ea0f438a6fc7ea25d8822519ff4fa6ccd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VPUYMYPBMGB2PBR76ZODRJ2PMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pessimistic Risk-Aware Policy Learning in Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Optimizing general Lipschitz risk criteria in offline contextual bandits incurs no additional statistical cost beyond expected-reward optimization.","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Xianyi Wu, Yilong Wan, Yuqiang Li","submitted_at":"2026-05-15T05:02:39Z","abstract_excerpt":"We study risk-aware offline policy learning, aiming to learn a decision rule from logged data that is optimal under general risk criteria. This problem is crucial in high-stakes domains where online interaction is infeasible and adverse outcomes must be carefully controlled. However, existing literature on offline contextual bandits either centers on expected-reward criteria or restricts risk considerations to policy evaluation instead of optimization. In this work, we propose a unified distributional framework for optimizing Lipschitz-continuous risk functionals, a broad class of risk measure"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By developing novel empirical concentration inequalities for importance sampling-based distributional estimators, our analysis derives data-dependent suboptimality bounds with an Õ(1/√n) rate, without relying on restrictive uniform overlap assumptions. This rate is minimax optimal and matches that of risk-neutral offline policy optimization, indicating that optimizing general Lipschitz risk criteria incurs no additional statistical cost relative to the expected-reward.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The risk functionals under consideration are Lipschitz continuous (invoked to unify mean-variance, entropic risk, CVaR, etc.), and the novel empirical concentration inequalities for the importance-sampling distributional estimators hold under the paper's data-dependent conditions rather than uniform overlap.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A distributional framework for optimizing Lipschitz risk functionals in offline contextual bandits yields data-dependent suboptimality bounds of Õ(1/√n) that match risk-neutral rates and are minimax optimal.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Optimizing general Lipschitz risk criteria in offline contextual bandits incurs no additional statistical cost beyond expected-reward optimization.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"67433709bdf798a67057a2615b33ecdfd5ec33a451c17b25f89ba927c230f43c"},"source":{"id":"2605.15620","kind":"arxiv","version":1},"verdict":{"id":"59a36701-8fab-46d8-a810-5197b5946ea0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:55:02.621438Z","strongest_claim":"By developing novel empirical concentration inequalities for importance sampling-based distributional estimators, our analysis derives data-dependent suboptimality bounds with an Õ(1/√n) rate, without relying on restrictive uniform overlap assumptions. This rate is minimax optimal and matches that of risk-neutral offline policy optimization, indicating that optimizing general Lipschitz risk criteria incurs no additional statistical cost relative to the expected-reward.","one_line_summary":"A distributional framework for optimizing Lipschitz risk functionals in offline contextual bandits yields data-dependent suboptimality bounds of Õ(1/√n) that match risk-neutral rates and are minimax optimal.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The risk functionals under consideration are Lipschitz continuous (invoked to unify mean-variance, entropic risk, CVaR, etc.), and the novel empirical concentration inequalities for the importance-sampling distributional estimators hold under the paper's data-dependent conditions rather than uniform overlap.","pith_extraction_headline":"Optimizing general Lipschitz risk criteria in offline contextual bandits incurs no additional statistical cost beyond expected-reward optimization."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15620/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T20:01:32.540667Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.280114Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:34:34.614121Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:41:56.037474Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"87f730bfe9c9a9b492df9a6dde8d0da079e57cb4f63095ba879a3247b323f483"},"references":{"count":48,"sample":[{"doi":"10.1111/1467-9965.00068","year":1999,"title":"Mathematical Finance , volume =","work_id":"ad02250a-d8c8-4778-8728-47023c29ce1e","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Policy learning with observational data","work_id":"904aa1ed-af83-4258-8a65-18ef7e54e1ea","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Regret bounds for risk-sensitive reinforcement learning","work_id":"f88b16fa-83e0-49a1-bb5d-b1b2f8a69966","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Bellemare, Will Dabney, and R \\'e mi Munos","work_id":"01462f4b-76ea-4d24-8179-253f0c3ebeab","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1287/mnsc.2018.3253","year":2019,"title":"From predictive to prescriptive analytics","work_id":"6367a78c-7e2d-47a8-8ba7-fc75bf2341be","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":48,"snapshot_sha256":"1ad5bc460e8a33280dfe04a4bb4e05f7ef6acf0bf0dd461a17766df49f34f363","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"7829d69fc38279d2394ddd98d1ecb3e7d51e776e7a49e6f20f71f11409e22e38"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"59a36701-8fab-46d8-a810-5197b5946ea0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cayXWzwLyMGoAnGA6Q/GmEE0G6/uC8lXLFfVFTipcTMICzVplt2B42H3/HYmFefUUAQMMTWrILhoNAUabnFTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:51:03.309519Z"},"content_sha256":"f0d6cf8e145040eecc5dbbeb9e5600a51e227f0217524e40f185774b0dd197cf","schema_version":"1.0","event_id":"sha256:f0d6cf8e145040eecc5dbbeb9e5600a51e227f0217524e40f185774b0dd197cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPUYMYPBMGB2PBR76ZODRJ2PMC/bundle.json","state_url":"https://pith.science/pith/VPUYMYPBMGB2PBR76ZODRJ2PMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPUYMYPBMGB2PBR76ZODRJ2PMC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T04:51:03Z","links":{"resolver":"https://pith.science/pith/VPUYMYPBMGB2PBR76ZODRJ2PMC","bundle":"https://pith.science/pith/VPUYMYPBMGB2PBR76ZODRJ2PMC/bundle.json","state":"https://pith.science/pith/VPUYMYPBMGB2PBR76ZODRJ2PMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPUYMYPBMGB2PBR76ZODRJ2PMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VPUYMYPBMGB2PBR76ZODRJ2PMC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"50373642908d5d2856918dfd4d66f73ac2a09880e82adcaf66f556428726e16e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-15T05:02:39Z","title_canon_sha256":"1cebe2e302eaee8d624a7f67f11397e57cbc39183447f338bc17e23d1dab15de"},"schema_version":"1.0","source":{"id":"2605.15620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15620","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15620v1","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15620","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_12","alias_value":"VPUYMYPBMGB2","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_16","alias_value":"VPUYMYPBMGB2PBR7","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_8","alias_value":"VPUYMYPB","created_at":"2026-05-20T00:01:08Z"}],"graph_snapshots":[{"event_id":"sha256:f0d6cf8e145040eecc5dbbeb9e5600a51e227f0217524e40f185774b0dd197cf","target":"graph","created_at":"2026-05-20T00:01:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"By developing novel empirical concentration inequalities for importance sampling-based distributional estimators, our analysis derives data-dependent suboptimality bounds with an Õ(1/√n) rate, without relying on restrictive uniform overlap assumptions. This rate is minimax optimal and matches that of risk-neutral offline policy optimization, indicating that optimizing general Lipschitz risk criteria incurs no additional statistical cost relative to the expected-reward."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The risk functionals under consideration are Lipschitz continuous (invoked to unify mean-variance, entropic risk, CVaR, etc.), and the novel empirical concentration inequalities for the importance-sampling distributional estimators hold under the paper's data-dependent conditions rather than uniform overlap."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A distributional framework for optimizing Lipschitz risk functionals in offline contextual bandits yields data-dependent suboptimality bounds of Õ(1/√n) that match risk-neutral rates and are minimax optimal."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Optimizing general Lipschitz risk criteria in offline contextual bandits incurs no additional statistical cost beyond expected-reward optimization."}],"snapshot_sha256":"67433709bdf798a67057a2615b33ecdfd5ec33a451c17b25f89ba927c230f43c"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"7829d69fc38279d2394ddd98d1ecb3e7d51e776e7a49e6f20f71f11409e22e38"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:01:32.540667Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.280114Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:34:34.614121Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:41:56.037474Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15620/integrity.json","findings":[],"snapshot_sha256":"87f730bfe9c9a9b492df9a6dde8d0da079e57cb4f63095ba879a3247b323f483","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study risk-aware offline policy learning, aiming to learn a decision rule from logged data that is optimal under general risk criteria. This problem is crucial in high-stakes domains where online interaction is infeasible and adverse outcomes must be carefully controlled. However, existing literature on offline contextual bandits either centers on expected-reward criteria or restricts risk considerations to policy evaluation instead of optimization. In this work, we propose a unified distributional framework for optimizing Lipschitz-continuous risk functionals, a broad class of risk measure","authors_text":"Xianyi Wu, Yilong Wan, Yuqiang Li","cross_cats":["cs.LG"],"headline":"Optimizing general Lipschitz risk criteria in offline contextual bandits incurs no additional statistical cost beyond expected-reward optimization.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-15T05:02:39Z","title":"Pessimistic Risk-Aware Policy Learning in Contextual Bandits"},"references":{"count":48,"internal_anchors":0,"resolved_work":48,"sample":[{"cited_arxiv_id":"","doi":"10.1111/1467-9965.00068","is_internal_anchor":false,"ref_index":1,"title":"Mathematical Finance , volume =","work_id":"ad02250a-d8c8-4778-8728-47023c29ce1e","year":1999},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Policy learning with observational data","work_id":"904aa1ed-af83-4258-8a65-18ef7e54e1ea","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Regret bounds for risk-sensitive reinforcement learning","work_id":"f88b16fa-83e0-49a1-bb5d-b1b2f8a69966","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Bellemare, Will Dabney, and R \\'e mi Munos","work_id":"01462f4b-76ea-4d24-8179-253f0c3ebeab","year":2017},{"cited_arxiv_id":"","doi":"10.1287/mnsc.2018.3253","is_internal_anchor":false,"ref_index":5,"title":"From predictive to prescriptive analytics","work_id":"6367a78c-7e2d-47a8-8ba7-fc75bf2341be","year":2019}],"snapshot_sha256":"1ad5bc460e8a33280dfe04a4bb4e05f7ef6acf0bf0dd461a17766df49f34f363"},"source":{"id":"2605.15620","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:55:02.621438Z","id":"59a36701-8fab-46d8-a810-5197b5946ea0","model_set":{"reader":"grok-4.3"},"one_line_summary":"A distributional framework for optimizing Lipschitz risk functionals in offline contextual bandits yields data-dependent suboptimality bounds of Õ(1/√n) that match risk-neutral rates and are minimax optimal.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Optimizing general Lipschitz risk criteria in offline contextual bandits incurs no additional statistical cost beyond expected-reward optimization.","strongest_claim":"By developing novel empirical concentration inequalities for importance sampling-based distributional estimators, our analysis derives data-dependent suboptimality bounds with an Õ(1/√n) rate, without relying on restrictive uniform overlap assumptions. This rate is minimax optimal and matches that of risk-neutral offline policy optimization, indicating that optimizing general Lipschitz risk criteria incurs no additional statistical cost relative to the expected-reward.","weakest_assumption":"The risk functionals under consideration are Lipschitz continuous (invoked to unify mean-variance, entropic risk, CVaR, etc.), and the novel empirical concentration inequalities for the importance-sampling distributional estimators hold under the paper's data-dependent conditions rather than uniform overlap."}},"verdict_id":"59a36701-8fab-46d8-a810-5197b5946ea0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5a74583a109248ad2891adf7c3c2597ea0f438a6fc7ea25d8822519ff4fa6ccd","target":"record","created_at":"2026-05-20T00:01:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"50373642908d5d2856918dfd4d66f73ac2a09880e82adcaf66f556428726e16e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-15T05:02:39Z","title_canon_sha256":"1cebe2e302eaee8d624a7f67f11397e57cbc39183447f338bc17e23d1dab15de"},"schema_version":"1.0","source":{"id":"2605.15620","kind":"arxiv","version":1}},"canonical_sha256":"abe98661e16183a7863ff65c38a74f609acc3b4f5ba010438fe2c47f372b18ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abe98661e16183a7863ff65c38a74f609acc3b4f5ba010438fe2c47f372b18ca","first_computed_at":"2026-05-20T00:01:08.569800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:08.569800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tTFZXlpZYV0KC02UUuWo5/hLLF67tq5Tkk9uFLycaJ434ZV6HFb2AxESgHjKke4ETwBEa3RCGiOGsPUfS3mHCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:08.570748Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a74583a109248ad2891adf7c3c2597ea0f438a6fc7ea25d8822519ff4fa6ccd","sha256:f0d6cf8e145040eecc5dbbeb9e5600a51e227f0217524e40f185774b0dd197cf"],"state_sha256":"d70bcb4dd1043cd8e6422da28aca6a74e60cb9b4c94263c3f837a48d5f2711f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0YtO0qcrmuGSmrYra9MudIq2dvB0JBXX1UGWwCVMGY8Yd1RWFROmLE5xb0viAWBap/w2qLnCjToL17j5AjwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:51:03.312282Z","bundle_sha256":"3c30702cca0962aeb187f3029ded66dec96b78f959f725ab9337217e22170019"}}