{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:D5UPXKKZ64HMJUYREGZQT2I2RK","short_pith_number":"pith:D5UPXKKZ","canonical_record":{"source":{"id":"2605.16828","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-16T06:15:41Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ME"],"title_canon_sha256":"33b69664fc71426d6bdaf25ea21999d4db44729cf40f913b92cd1d34d03d6662","abstract_canon_sha256":"d205b5646e4535d43ca1afb2dbcce8109a40573c2984fdb34d205508697204ac"},"schema_version":"1.0"},"canonical_sha256":"1f68fba959f70ec4d31121b309e91a8a932f284a6e896089e7bf2a05e9c6ead6","source":{"kind":"arxiv","id":"2605.16828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16828","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16828v1","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16828","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"D5UPXKKZ64HM","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_16","alias_value":"D5UPXKKZ64HMJUYR","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_8","alias_value":"D5UPXKKZ","created_at":"2026-05-20T00:03:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:D5UPXKKZ64HMJUYREGZQT2I2RK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16828","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-16T06:15:41Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ME"],"title_canon_sha256":"33b69664fc71426d6bdaf25ea21999d4db44729cf40f913b92cd1d34d03d6662","abstract_canon_sha256":"d205b5646e4535d43ca1afb2dbcce8109a40573c2984fdb34d205508697204ac"},"schema_version":"1.0"},"canonical_sha256":"1f68fba959f70ec4d31121b309e91a8a932f284a6e896089e7bf2a05e9c6ead6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:24.793086Z","signature_b64":"A9jHBgFpAqK5xKjE2+53koOrAkuUd06O5j2dAR9Lpl45x0GFfqoCWl2V5h48suajWpW6Y1269lrxAxd/rzHBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f68fba959f70ec4d31121b309e91a8a932f284a6e896089e7bf2a05e9c6ead6","last_reissued_at":"2026-05-20T00:03:24.792170Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:24.792170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16828","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:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZaiBt8rTJCtUWXID2gL0x3W2NsKweo54eEJSojIXxPZg2z6yLLmQXOa/tjvZ77abKKWg/xXCL6eTFMQOBHtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:44:23.730892Z"},"content_sha256":"8226d698dae62b652d8e77da3ba48d2d1266a144618c4d44606e0c288afb3c45","schema_version":"1.0","event_id":"sha256:8226d698dae62b652d8e77da3ba48d2d1266a144618c4d44606e0c288afb3c45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:D5UPXKKZ64HMJUYREGZQT2I2RK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prediction-Intervention Games and Invariant Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"In prediction-intervention games, stable-blanket predictors are always at least as good as causal-parent predictors for two common follower objective classes.","cross_cats":["cs.AI","cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Felix Schur, Jonas Peters, Linus K\\\"uhne","submitted_at":"2026-05-16T06:15:41Z","abstract_excerpt":"We consider the following two-player game: using observational data, the leader chooses a prediction function for a response variable $Y$ from given covariates. The follower then reacts with an intervention on some covariates in the underlying structural causal model to maximize their own objective. The leader knows the intervention targets, but may have limited knowledge of the follower's objective. We call this setup a prediction-intervention game, a special case of a Stackelberg game. Finding an optimal strategy for the leader is generally difficult. To avoid severe performance loss, the le"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove, for two common classes of follower objectives, that predictors based on the stable blanket, a specific invariant subset, are always better or as good as those based on the causal parents.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The leader knows the intervention targets but may have limited knowledge of the follower's objective; the proof relies on the follower objectives belonging to two specific common classes whose exact definitions are not given in the abstract.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"In prediction-intervention games, stable-blanket predictors are at least as good as causal-parent predictors for two classes of follower objectives and can be worst-case optimal under additional conditions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"In prediction-intervention games, stable-blanket predictors are always at least as good as causal-parent predictors for two common follower objective classes.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e7a1716a05475d683dc0b26796ebd9db5e76878989a42fdf168acc0c397366e9"},"source":{"id":"2605.16828","kind":"arxiv","version":1},"verdict":{"id":"a1c1f281-b98e-46ef-a899-38f9f0c4f6f9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:01:42.584525Z","strongest_claim":"We prove, for two common classes of follower objectives, that predictors based on the stable blanket, a specific invariant subset, are always better or as good as those based on the causal parents.","one_line_summary":"In prediction-intervention games, stable-blanket predictors are at least as good as causal-parent predictors for two classes of follower objectives and can be worst-case optimal under additional conditions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The leader knows the intervention targets but may have limited knowledge of the follower's objective; the proof relies on the follower objectives belonging to two specific common classes whose exact definitions are not given in the abstract.","pith_extraction_headline":"In prediction-intervention games, stable-blanket predictors are always at least as good as causal-parent predictors for two common follower objective classes."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16828/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:19.132077Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:10:48.174297Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.261040Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.404833Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f449842879132cdb04475f075eef9c24190c452810a2b91c7f17c04459a86f51"},"references":{"count":63,"sample":[{"doi":"","year":1907,"title":"Invariant Risk Minimization","work_id":"d76c6842-b84d-44ec-bcea-b80cd8d07981","ref_index":1,"cited_arxiv_id":"1907.02893","is_internal_anchor":true},{"doi":"","year":2026,"title":"Geometric and Computational Hardness of Bilevel Programming.Mathematical Pro- gramming, 215(1):539–574, 2026","work_id":"af8c7b5a-b625-4f98-8be3-3dbdc2b7e186","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Stephan Bongers, Patrick Forré, Jonas Peters, and Joris M. Mooij. Foundations of Structural Causal Models with Cycles and Latent Variables.The Annals of Statistics, 49(5):2885–2915, 2021","work_id":"c0058aec-0561-4ebe-9e02-7026dfdbf67f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"Stackelberg Games for Adversarial Prediction Prob- lems","work_id":"bb442095-64d0-4098-9fee-9463011b0f08","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Invariance, Causality and Robustness.Statistical Science, 35(3):404–426, 2020","work_id":"2d2b7b1a-2e50-4bd1-b2b4-0c5141c48b1a","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":63,"snapshot_sha256":"90d18e63dd57e88905198381fc38561d2f960fba95a5f244b391a869c9ed46a7","internal_anchors":3},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9ffc76cdbaaebed6bf5d00339fb191cdffab2c5cfd92ab0888323bb3d45c80e0"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"a1c1f281-b98e-46ef-a899-38f9f0c4f6f9"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"seOtC91NSvjiKClH0x1DT2HoSjNFIG7pW26z6yimm0fbwhbhtUYDxgZLN1HvzmyCRkxilbKWDALFz6EeEiFZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:44:23.732191Z"},"content_sha256":"8267257ea28de2aa8ddae3da03cd4ad24769f83dd88744fe2876e01a7de008e1","schema_version":"1.0","event_id":"sha256:8267257ea28de2aa8ddae3da03cd4ad24769f83dd88744fe2876e01a7de008e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5UPXKKZ64HMJUYREGZQT2I2RK/bundle.json","state_url":"https://pith.science/pith/D5UPXKKZ64HMJUYREGZQT2I2RK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5UPXKKZ64HMJUYREGZQT2I2RK/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-27T14:44:23Z","links":{"resolver":"https://pith.science/pith/D5UPXKKZ64HMJUYREGZQT2I2RK","bundle":"https://pith.science/pith/D5UPXKKZ64HMJUYREGZQT2I2RK/bundle.json","state":"https://pith.science/pith/D5UPXKKZ64HMJUYREGZQT2I2RK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5UPXKKZ64HMJUYREGZQT2I2RK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:D5UPXKKZ64HMJUYREGZQT2I2RK","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":"d205b5646e4535d43ca1afb2dbcce8109a40573c2984fdb34d205508697204ac","cross_cats_sorted":["cs.AI","cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-16T06:15:41Z","title_canon_sha256":"33b69664fc71426d6bdaf25ea21999d4db44729cf40f913b92cd1d34d03d6662"},"schema_version":"1.0","source":{"id":"2605.16828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16828","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16828v1","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16828","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"D5UPXKKZ64HM","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_16","alias_value":"D5UPXKKZ64HMJUYR","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_8","alias_value":"D5UPXKKZ","created_at":"2026-05-20T00:03:24Z"}],"graph_snapshots":[{"event_id":"sha256:8267257ea28de2aa8ddae3da03cd4ad24769f83dd88744fe2876e01a7de008e1","target":"graph","created_at":"2026-05-20T00:03:24Z","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":"We prove, for two common classes of follower objectives, that predictors based on the stable blanket, a specific invariant subset, are always better or as good as those based on the causal parents."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The leader knows the intervention targets but may have limited knowledge of the follower's objective; the proof relies on the follower objectives belonging to two specific common classes whose exact definitions are not given in the abstract."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"In prediction-intervention games, stable-blanket predictors are at least as good as causal-parent predictors for two classes of follower objectives and can be worst-case optimal under additional conditions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"In prediction-intervention games, stable-blanket predictors are always at least as good as causal-parent predictors for two common follower objective classes."}],"snapshot_sha256":"e7a1716a05475d683dc0b26796ebd9db5e76878989a42fdf168acc0c397366e9"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9ffc76cdbaaebed6bf5d00339fb191cdffab2c5cfd92ab0888323bb3d45c80e0"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:19.132077Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:10:48.174297Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.261040Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.404833Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16828/integrity.json","findings":[],"snapshot_sha256":"f449842879132cdb04475f075eef9c24190c452810a2b91c7f17c04459a86f51","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the following two-player game: using observational data, the leader chooses a prediction function for a response variable $Y$ from given covariates. The follower then reacts with an intervention on some covariates in the underlying structural causal model to maximize their own objective. The leader knows the intervention targets, but may have limited knowledge of the follower's objective. We call this setup a prediction-intervention game, a special case of a Stackelberg game. Finding an optimal strategy for the leader is generally difficult. To avoid severe performance loss, the le","authors_text":"Felix Schur, Jonas Peters, Linus K\\\"uhne","cross_cats":["cs.AI","cs.LG","stat.ME"],"headline":"In prediction-intervention games, stable-blanket predictors are always at least as good as causal-parent predictors for two common follower objective classes.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-16T06:15:41Z","title":"Prediction-Intervention Games and Invariant Sets"},"references":{"count":63,"internal_anchors":3,"resolved_work":63,"sample":[{"cited_arxiv_id":"1907.02893","doi":"","is_internal_anchor":true,"ref_index":1,"title":"Invariant Risk Minimization","work_id":"d76c6842-b84d-44ec-bcea-b80cd8d07981","year":1907},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Geometric and Computational Hardness of Bilevel Programming.Mathematical Pro- gramming, 215(1):539–574, 2026","work_id":"af8c7b5a-b625-4f98-8be3-3dbdc2b7e186","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Stephan Bongers, Patrick Forré, Jonas Peters, and Joris M. Mooij. Foundations of Structural Causal Models with Cycles and Latent Variables.The Annals of Statistics, 49(5):2885–2915, 2021","work_id":"c0058aec-0561-4ebe-9e02-7026dfdbf67f","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Stackelberg Games for Adversarial Prediction Prob- lems","work_id":"bb442095-64d0-4098-9fee-9463011b0f08","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Invariance, Causality and Robustness.Statistical Science, 35(3):404–426, 2020","work_id":"2d2b7b1a-2e50-4bd1-b2b4-0c5141c48b1a","year":2020}],"snapshot_sha256":"90d18e63dd57e88905198381fc38561d2f960fba95a5f244b391a869c9ed46a7"},"source":{"id":"2605.16828","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:01:42.584525Z","id":"a1c1f281-b98e-46ef-a899-38f9f0c4f6f9","model_set":{"reader":"grok-4.3"},"one_line_summary":"In prediction-intervention games, stable-blanket predictors are at least as good as causal-parent predictors for two classes of follower objectives and can be worst-case optimal under additional conditions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"In prediction-intervention games, stable-blanket predictors are always at least as good as causal-parent predictors for two common follower objective classes.","strongest_claim":"We prove, for two common classes of follower objectives, that predictors based on the stable blanket, a specific invariant subset, are always better or as good as those based on the causal parents.","weakest_assumption":"The leader knows the intervention targets but may have limited knowledge of the follower's objective; the proof relies on the follower objectives belonging to two specific common classes whose exact definitions are not given in the abstract."}},"verdict_id":"a1c1f281-b98e-46ef-a899-38f9f0c4f6f9"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8226d698dae62b652d8e77da3ba48d2d1266a144618c4d44606e0c288afb3c45","target":"record","created_at":"2026-05-20T00:03:24Z","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":"d205b5646e4535d43ca1afb2dbcce8109a40573c2984fdb34d205508697204ac","cross_cats_sorted":["cs.AI","cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-16T06:15:41Z","title_canon_sha256":"33b69664fc71426d6bdaf25ea21999d4db44729cf40f913b92cd1d34d03d6662"},"schema_version":"1.0","source":{"id":"2605.16828","kind":"arxiv","version":1}},"canonical_sha256":"1f68fba959f70ec4d31121b309e91a8a932f284a6e896089e7bf2a05e9c6ead6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f68fba959f70ec4d31121b309e91a8a932f284a6e896089e7bf2a05e9c6ead6","first_computed_at":"2026-05-20T00:03:24.792170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:24.792170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A9jHBgFpAqK5xKjE2+53koOrAkuUd06O5j2dAR9Lpl45x0GFfqoCWl2V5h48suajWpW6Y1269lrxAxd/rzHBCg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:24.793086Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8226d698dae62b652d8e77da3ba48d2d1266a144618c4d44606e0c288afb3c45","sha256:8267257ea28de2aa8ddae3da03cd4ad24769f83dd88744fe2876e01a7de008e1"],"state_sha256":"5e02dd8c3cfbaab51ee72ff381f0203986299c6e264290a02c318a7954f9f053"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SqCs2ecYoSTrOiFyTqzAreDI70nkCZWm2PzpS3XO3aJKaKVq8sTKmih3JmorMItXop/qzAUzRL97Ee0L7UxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:44:23.737659Z","bundle_sha256":"3c04621dd53e2998afe10a7d514c5d5ce0f5a41595515845d3551dd61da7a4bb"}}