{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:D3AOF3LZKO63M3F7IX37ZMXWBS","short_pith_number":"pith:D3AOF3LZ","canonical_record":{"source":{"id":"2605.15331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-14T18:54:38Z","cross_cats_sorted":[],"title_canon_sha256":"12dfb11bd00188d03c973079b15126d34e3db6db0726ec8e04db99f0a9cf5429","abstract_canon_sha256":"7552019ea7011ef26f2b303835fbceae25b9a711598e73713188054f8d9e6359"},"schema_version":"1.0"},"canonical_sha256":"1ec0e2ed7953bdb66cbf45f7fcb2f60ca0ab0975dc4541f6da8a7a23dbc6d5a1","source":{"kind":"arxiv","id":"2605.15331","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15331","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15331v1","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15331","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"D3AOF3LZKO63","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_16","alias_value":"D3AOF3LZKO63M3F7","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_8","alias_value":"D3AOF3LZ","created_at":"2026-05-20T00:00:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:D3AOF3LZKO63M3F7IX37ZMXWBS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-14T18:54:38Z","cross_cats_sorted":[],"title_canon_sha256":"12dfb11bd00188d03c973079b15126d34e3db6db0726ec8e04db99f0a9cf5429","abstract_canon_sha256":"7552019ea7011ef26f2b303835fbceae25b9a711598e73713188054f8d9e6359"},"schema_version":"1.0"},"canonical_sha256":"1ec0e2ed7953bdb66cbf45f7fcb2f60ca0ab0975dc4541f6da8a7a23dbc6d5a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:52.978020Z","signature_b64":"KafAp7E++QtY6VSAIUc8012dsG4lHl2HJz3s+zw3BwYNi89T3kVkIsfh7aqvE3bGgyhwqkx31PP2DbSfIzHHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ec0e2ed7953bdb66cbf45f7fcb2f60ca0ab0975dc4541f6da8a7a23dbc6d5a1","last_reissued_at":"2026-05-20T00:00:52.977414Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:52.977414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15331","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:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zm+oem1FFCbASNXWJ2Ex9VTqh0sM3lJWq8hfQSe8EP3fV7eprR7ceg7NHNuSrlLeS1eHQ94piCXdYlFW0EERBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T04:08:10.740248Z"},"content_sha256":"bd1b6e20bf4b4eb22f556bad2737d51dcfe609a98fc3f683609dddef7277ee59","schema_version":"1.0","event_id":"sha256:bd1b6e20bf4b4eb22f556bad2737d51dcfe609a98fc3f683609dddef7277ee59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:D3AOF3LZKO63M3F7IX37ZMXWBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Persuade a Biased Receiver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A sender can learn a receiver's fixed bias in belief updating through safe exploration while achieving O(log log T) regret against a full-information oracle.","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Milind Tambe, Sadie Zhao, Yiling Chen, Yuqi Pan","submitted_at":"2026-05-14T18:54:38Z","abstract_excerpt":"We study a repeated information design setting in which the receiver, who is also the decision-maker, updates beliefs in a systematically biased way. More specifically, a distorted posterior in our model can be written as a convex combination of the prior and the Bayesian posterior, governed by a fixed but unknown parameter. Over repeated interactions, the sender chooses persuasive signaling schemes, observes only the receiver's realized actions, and seeks to minimize regret relative to a full-information oracle that knows the receiver's biased updating rule. We propose a safe exploration algo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For general finite state and action spaces and arbitrary bounded utilities, the safe exploration algorithm achieves O(log log T) regret relative to a full-information oracle that knows the receiver's biased updating rule, with a matching Omega(log log T) lower bound.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The receiver's bias parameter is fixed across all rounds and the only uncertainty is this single scalar; the model assumes the sender can perfectly observe the realized action after each signal but receives no other feedback.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A safe exploration algorithm learns an unknown receiver bias parameter in repeated information design and achieves O(log log T) regret with a matching lower bound.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A sender can learn a receiver's fixed bias in belief updating through safe exploration while achieving O(log log T) regret against a full-information oracle.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"731b2d951b4277acd333ff1cf1aceea3f43f1bd9e6c8e78f70948c04c91d0ee6"},"source":{"id":"2605.15331","kind":"arxiv","version":1},"verdict":{"id":"21bee8d7-6cdf-4135-8149-b5c4902e988b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:28:38.900846Z","strongest_claim":"For general finite state and action spaces and arbitrary bounded utilities, the safe exploration algorithm achieves O(log log T) regret relative to a full-information oracle that knows the receiver's biased updating rule, with a matching Omega(log log T) lower bound.","one_line_summary":"A safe exploration algorithm learns an unknown receiver bias parameter in repeated information design and achieves O(log log T) regret with a matching lower bound.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The receiver's bias parameter is fixed across all rounds and the only uncertainty is this single scalar; the model assumes the sender can perfectly observe the realized action after each signal but receives no other feedback.","pith_extraction_headline":"A sender can learn a receiver's fixed bias in belief updating through safe exploration while achieving O(log log T) regret against a full-information oracle."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15331/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.143323Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:41:05.086074Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.192500Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.761694Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"b7319e66ed443559cab13c11ac845fa7c971eb49d708a59da6bcf251d5f1feb7"},"references":{"count":47,"sample":[{"doi":"","year":1995,"title":"Robert J Aumann, Michael Maschler, and Richard E Stearns.Repeated games with incomplete information. MIT press, 1995","work_id":"6bc903ff-2e6a-457e-8a2f-6d93c47aca3c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Over-and underreaction to information: Belief updating with cognitive constraints","work_id":"5a2e79c2-639d-4128-81e5-d7fb86866a27","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Markov persuasion processes: Learning to persuade from scratch.arXiv preprint arXiv:2402.03077, 2024","work_id":"dd3d2a62-8ac1-4e50-b58a-ef728312677e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"A meta-analysis of the weight of advice in decision-making.Current Psychology, 42(28): 24516–24541, 2023","work_id":"a98006cc-3da2-4b76-b25b-98e9f98b50dd","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1980,"title":"The base-rate fallacy in probability judgments.Acta Psychologica, 44(3): 211–233, 1980","work_id":"fba1aa0d-12f0-40c1-8f70-3676f33cd293","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":47,"snapshot_sha256":"3d9df9314f9ad1e12ee72fcf924348aac792bbde02b43e9e2c69afa0d9cc7a9c","internal_anchors":1},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"21bee8d7-6cdf-4135-8149-b5c4902e988b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EG8WgVdsXh14D2pD8LFLbhAP3WYx490EB8I7S5V8LACIP/T/Nd0IxBsrG78v6nskqjJY90xTSS0PmOoxaRVRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T04:08:10.740962Z"},"content_sha256":"13e86e7687f03ceecbbd24c4d0d7d8204b5f4a296b65adb8e76eded206b88d73","schema_version":"1.0","event_id":"sha256:13e86e7687f03ceecbbd24c4d0d7d8204b5f4a296b65adb8e76eded206b88d73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3AOF3LZKO63M3F7IX37ZMXWBS/bundle.json","state_url":"https://pith.science/pith/D3AOF3LZKO63M3F7IX37ZMXWBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3AOF3LZKO63M3F7IX37ZMXWBS/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-21T04:08:10Z","links":{"resolver":"https://pith.science/pith/D3AOF3LZKO63M3F7IX37ZMXWBS","bundle":"https://pith.science/pith/D3AOF3LZKO63M3F7IX37ZMXWBS/bundle.json","state":"https://pith.science/pith/D3AOF3LZKO63M3F7IX37ZMXWBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3AOF3LZKO63M3F7IX37ZMXWBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:D3AOF3LZKO63M3F7IX37ZMXWBS","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":"7552019ea7011ef26f2b303835fbceae25b9a711598e73713188054f8d9e6359","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-14T18:54:38Z","title_canon_sha256":"12dfb11bd00188d03c973079b15126d34e3db6db0726ec8e04db99f0a9cf5429"},"schema_version":"1.0","source":{"id":"2605.15331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15331","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15331v1","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15331","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"D3AOF3LZKO63","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_16","alias_value":"D3AOF3LZKO63M3F7","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_8","alias_value":"D3AOF3LZ","created_at":"2026-05-20T00:00:52Z"}],"graph_snapshots":[{"event_id":"sha256:13e86e7687f03ceecbbd24c4d0d7d8204b5f4a296b65adb8e76eded206b88d73","target":"graph","created_at":"2026-05-20T00:00:52Z","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":"For general finite state and action spaces and arbitrary bounded utilities, the safe exploration algorithm achieves O(log log T) regret relative to a full-information oracle that knows the receiver's biased updating rule, with a matching Omega(log log T) lower bound."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The receiver's bias parameter is fixed across all rounds and the only uncertainty is this single scalar; the model assumes the sender can perfectly observe the realized action after each signal but receives no other feedback."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A safe exploration algorithm learns an unknown receiver bias parameter in repeated information design and achieves O(log log T) regret with a matching lower bound."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A sender can learn a receiver's fixed bias in belief updating through safe exploration while achieving O(log log T) regret against a full-information oracle."}],"snapshot_sha256":"731b2d951b4277acd333ff1cf1aceea3f43f1bd9e6c8e78f70948c04c91d0ee6"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.143323Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:41:05.086074Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.192500Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.761694Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15331/integrity.json","findings":[],"snapshot_sha256":"b7319e66ed443559cab13c11ac845fa7c971eb49d708a59da6bcf251d5f1feb7","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a repeated information design setting in which the receiver, who is also the decision-maker, updates beliefs in a systematically biased way. More specifically, a distorted posterior in our model can be written as a convex combination of the prior and the Bayesian posterior, governed by a fixed but unknown parameter. Over repeated interactions, the sender chooses persuasive signaling schemes, observes only the receiver's realized actions, and seeks to minimize regret relative to a full-information oracle that knows the receiver's biased updating rule. We propose a safe exploration algo","authors_text":"Milind Tambe, Sadie Zhao, Yiling Chen, Yuqi Pan","cross_cats":[],"headline":"A sender can learn a receiver's fixed bias in belief updating through safe exploration while achieving O(log log T) regret against a full-information oracle.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-14T18:54:38Z","title":"Learning to Persuade a Biased Receiver"},"references":{"count":47,"internal_anchors":1,"resolved_work":47,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Robert J Aumann, Michael Maschler, and Richard E Stearns.Repeated games with incomplete information. MIT press, 1995","work_id":"6bc903ff-2e6a-457e-8a2f-6d93c47aca3c","year":1995},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Over-and underreaction to information: Belief updating with cognitive constraints","work_id":"5a2e79c2-639d-4128-81e5-d7fb86866a27","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Markov persuasion processes: Learning to persuade from scratch.arXiv preprint arXiv:2402.03077, 2024","work_id":"dd3d2a62-8ac1-4e50-b58a-ef728312677e","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A meta-analysis of the weight of advice in decision-making.Current Psychology, 42(28): 24516–24541, 2023","work_id":"a98006cc-3da2-4b76-b25b-98e9f98b50dd","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"The base-rate fallacy in probability judgments.Acta Psychologica, 44(3): 211–233, 1980","work_id":"fba1aa0d-12f0-40c1-8f70-3676f33cd293","year":1980}],"snapshot_sha256":"3d9df9314f9ad1e12ee72fcf924348aac792bbde02b43e9e2c69afa0d9cc7a9c"},"source":{"id":"2605.15331","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:28:38.900846Z","id":"21bee8d7-6cdf-4135-8149-b5c4902e988b","model_set":{"reader":"grok-4.3"},"one_line_summary":"A safe exploration algorithm learns an unknown receiver bias parameter in repeated information design and achieves O(log log T) regret with a matching lower bound.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A sender can learn a receiver's fixed bias in belief updating through safe exploration while achieving O(log log T) regret against a full-information oracle.","strongest_claim":"For general finite state and action spaces and arbitrary bounded utilities, the safe exploration algorithm achieves O(log log T) regret relative to a full-information oracle that knows the receiver's biased updating rule, with a matching Omega(log log T) lower bound.","weakest_assumption":"The receiver's bias parameter is fixed across all rounds and the only uncertainty is this single scalar; the model assumes the sender can perfectly observe the realized action after each signal but receives no other feedback."}},"verdict_id":"21bee8d7-6cdf-4135-8149-b5c4902e988b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bd1b6e20bf4b4eb22f556bad2737d51dcfe609a98fc3f683609dddef7277ee59","target":"record","created_at":"2026-05-20T00:00:52Z","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":"7552019ea7011ef26f2b303835fbceae25b9a711598e73713188054f8d9e6359","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-14T18:54:38Z","title_canon_sha256":"12dfb11bd00188d03c973079b15126d34e3db6db0726ec8e04db99f0a9cf5429"},"schema_version":"1.0","source":{"id":"2605.15331","kind":"arxiv","version":1}},"canonical_sha256":"1ec0e2ed7953bdb66cbf45f7fcb2f60ca0ab0975dc4541f6da8a7a23dbc6d5a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ec0e2ed7953bdb66cbf45f7fcb2f60ca0ab0975dc4541f6da8a7a23dbc6d5a1","first_computed_at":"2026-05-20T00:00:52.977414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:52.977414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KafAp7E++QtY6VSAIUc8012dsG4lHl2HJz3s+zw3BwYNi89T3kVkIsfh7aqvE3bGgyhwqkx31PP2DbSfIzHHAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:52.978020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd1b6e20bf4b4eb22f556bad2737d51dcfe609a98fc3f683609dddef7277ee59","sha256:13e86e7687f03ceecbbd24c4d0d7d8204b5f4a296b65adb8e76eded206b88d73"],"state_sha256":"40393b53cc3936ed6bf201bd67eaa02ca2a1b040ee26e8f60799af0c621e610f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EB+I9TlRnPCwz6Mjs/R0JV5hbXElfSJ49bta8G3y7qCWkXkqAFnKVUGn7wwbliV+x0WPnMEiXPECTWb9vKgBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T04:08:10.743852Z","bundle_sha256":"474e4a9440999cda389e0cf16d98ea206d506c934bfb941c25257fcd4c2773c9"}}