{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TLJIKKQSDBE2LQHUE663LB4R5J","short_pith_number":"pith:TLJIKKQS","canonical_record":{"source":{"id":"2605.17221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T01:54:28Z","cross_cats_sorted":[],"title_canon_sha256":"450c06ffb1ab9370cecc77088e9305b2e44f99b44e45ff2d1f9944bd48c96ab3","abstract_canon_sha256":"67d0e4eb3744e860406bc74d317df576c7b3cd06947f788c1ecfecc9df9aae98"},"schema_version":"1.0"},"canonical_sha256":"9ad2852a121849a5c0f427bdb58791ea57f356ef623551e7c1d18f49aa68ddc3","source":{"kind":"arxiv","id":"2605.17221","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17221","created_at":"2026-05-20T00:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17221v1","created_at":"2026-05-20T00:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17221","created_at":"2026-05-20T00:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"TLJIKKQSDBE2","created_at":"2026-05-20T00:03:45Z"},{"alias_kind":"pith_short_16","alias_value":"TLJIKKQSDBE2LQHU","created_at":"2026-05-20T00:03:45Z"},{"alias_kind":"pith_short_8","alias_value":"TLJIKKQS","created_at":"2026-05-20T00:03:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TLJIKKQSDBE2LQHUE663LB4R5J","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T01:54:28Z","cross_cats_sorted":[],"title_canon_sha256":"450c06ffb1ab9370cecc77088e9305b2e44f99b44e45ff2d1f9944bd48c96ab3","abstract_canon_sha256":"67d0e4eb3744e860406bc74d317df576c7b3cd06947f788c1ecfecc9df9aae98"},"schema_version":"1.0"},"canonical_sha256":"9ad2852a121849a5c0f427bdb58791ea57f356ef623551e7c1d18f49aa68ddc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:45.974921Z","signature_b64":"EolpwbImPUxFS0ML7faRdm0TGhvAyoyTM/T/3oSwrXjkRCgg75UCB3kru9oSvUK+RPq+XlbnzGZkXKlq+czaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ad2852a121849a5c0f427bdb58791ea57f356ef623551e7c1d18f49aa68ddc3","last_reissued_at":"2026-05-20T00:03:45.974008Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:45.974008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17221","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3uCvmoHJY5NAvUhyANaTA6kfDLIja/wg1k5pzglY9IIlhT+fdHg8kEHG3osRyKp/Pac8I/fbrUmXBdO5EWIsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:39:12.049144Z"},"content_sha256":"9cd5ea8ac34f176ec8a2cc0f4bfb05f369e4acecef168c4bd4f8e0b53fc3df58","schema_version":"1.0","event_id":"sha256:9cd5ea8ac34f176ec8a2cc0f4bfb05f369e4acecef168c4bd4f8e0b53fc3df58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TLJIKKQSDBE2LQHUE663LB4R5J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Mechanism Design in Diffusion Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks.","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hanpin Wang, Xinlun Zhang, Yongzhi Cao, Yu Huang, Zhechen Li","submitted_at":"2026-05-17T01:54:28Z","abstract_excerpt":"A diffusion auction refers to a selling process conducted over a social network, where each participant submits a bid and may invite other potential buyers to join the auction. Although various mechanisms have been proposed, none of them can simultaneously achieve incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound. In this paper, we propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties. We further extend PDM to general network structures through a m"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties: incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The base mechanism is defined only for path graphs and extensions rely on a map f that preserves key properties when the network is arbitrary; if no such f exists that simultaneously maintains IC, non-negative revenue, and the constant efficiency bound for general graphs, the general claim fails.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PDM and f-PDM achieve IC, non-negative revenue, and constant-approximate efficiency in diffusion auctions on paths and general networks, with further variants for Sybil attacks, collusion, and multi-unit cases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c91ebc1e43fb690c74a5dac6cfdc7a578de373e62cbfb3ba23f0b833a09836e8"},"source":{"id":"2605.17221","kind":"arxiv","version":1},"verdict":{"id":"8fe07f53-7c56-4e51-926b-a7a97a5305c2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:18:03.185591Z","strongest_claim":"We propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties: incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound.","one_line_summary":"PDM and f-PDM achieve IC, non-negative revenue, and constant-approximate efficiency in diffusion auctions on paths and general networks, with further variants for Sybil attacks, collusion, and multi-unit cases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The base mechanism is defined only for path graphs and extensions rely on a map f that preserves key properties when the network is arbitrary; if no such f exists that simultaneously maintains IC, non-negative revenue, and the constant efficiency bound for general graphs, the general claim fails.","pith_extraction_headline":"The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17221/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.380357Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:31:18.409623Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.918215Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.809007Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"b0356ae858acb04beb54c59a9b5fe4f55ab05afdbca42fabc1591838c32262b9"},"references":{"count":46,"sample":[{"doi":"","year":1999,"title":"SIAM Journal on Computing28(6), 2117–2132 (1999)","work_id":"a7274b49-dd5a-44ab-b16e-3f8639fdeb8d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2000,"title":"Proceedings of the National Academy of Sciences97(21), 11149–11152 (2000) 24 X","work_id":"acbbf70f-347a-4759-8ad2-1bbca10a7d00","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"Journal of Economic Theory100(2), 295– 328 (2001)","work_id":"81e1b9ae-afcd-49de-a2d2-eda87ee032f5","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Journal of Economic Theory144(2), 565–603 (2009)","work_id":"fcc20cce-6757-4187-8e88-bc8622dd1b99","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems","work_id":"04b9b44d-7c73-489f-abb3-4e29ff3253b6","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":46,"snapshot_sha256":"48be5b29d26c516649515eb637a5fc74cc5a3ab012ca2f4684aebdd100295a5e","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":"8fe07f53-7c56-4e51-926b-a7a97a5305c2"},"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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+yQdLA/GG1MYQ7rhyw5bJQBtIG5uVWeb2wyvpADDOkFCLVnsLFx/cFR/8T4BNcHXhdhAqpRmdZHF3Ey9++2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:39:12.049859Z"},"content_sha256":"acd5987e996b779ef24239b8291cdf0b238b497cb839aaf97a72956d591c4e69","schema_version":"1.0","event_id":"sha256:acd5987e996b779ef24239b8291cdf0b238b497cb839aaf97a72956d591c4e69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J/bundle.json","state_url":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLJIKKQSDBE2LQHUE663LB4R5J/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-20T16:39:12Z","links":{"resolver":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J","bundle":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J/bundle.json","state":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLJIKKQSDBE2LQHUE663LB4R5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TLJIKKQSDBE2LQHUE663LB4R5J","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":"67d0e4eb3744e860406bc74d317df576c7b3cd06947f788c1ecfecc9df9aae98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T01:54:28Z","title_canon_sha256":"450c06ffb1ab9370cecc77088e9305b2e44f99b44e45ff2d1f9944bd48c96ab3"},"schema_version":"1.0","source":{"id":"2605.17221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17221","created_at":"2026-05-20T00:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17221v1","created_at":"2026-05-20T00:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17221","created_at":"2026-05-20T00:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"TLJIKKQSDBE2","created_at":"2026-05-20T00:03:45Z"},{"alias_kind":"pith_short_16","alias_value":"TLJIKKQSDBE2LQHU","created_at":"2026-05-20T00:03:45Z"},{"alias_kind":"pith_short_8","alias_value":"TLJIKKQS","created_at":"2026-05-20T00:03:45Z"}],"graph_snapshots":[{"event_id":"sha256:acd5987e996b779ef24239b8291cdf0b238b497cb839aaf97a72956d591c4e69","target":"graph","created_at":"2026-05-20T00:03:45Z","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 propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties: incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The base mechanism is defined only for path graphs and extensions rely on a map f that preserves key properties when the network is arbitrary; if no such f exists that simultaneously maintains IC, non-negative revenue, and the constant efficiency bound for general graphs, the general claim fails."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PDM and f-PDM achieve IC, non-negative revenue, and constant-approximate efficiency in diffusion auctions on paths and general networks, with further variants for Sybil attacks, collusion, and multi-unit cases."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks."}],"snapshot_sha256":"c91ebc1e43fb690c74a5dac6cfdc7a578de373e62cbfb3ba23f0b833a09836e8"},"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-19T23:31:20.380357Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:31:18.409623Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.918215Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.809007Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17221/integrity.json","findings":[],"snapshot_sha256":"b0356ae858acb04beb54c59a9b5fe4f55ab05afdbca42fabc1591838c32262b9","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A diffusion auction refers to a selling process conducted over a social network, where each participant submits a bid and may invite other potential buyers to join the auction. Although various mechanisms have been proposed, none of them can simultaneously achieve incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound. In this paper, we propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties. We further extend PDM to general network structures through a m","authors_text":"Hanpin Wang, Xinlun Zhang, Yongzhi Cao, Yu Huang, Zhechen Li","cross_cats":[],"headline":"The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T01:54:28Z","title":"Probabilistic Mechanism Design in Diffusion Auctions"},"references":{"count":46,"internal_anchors":1,"resolved_work":46,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"SIAM Journal on Computing28(6), 2117–2132 (1999)","work_id":"a7274b49-dd5a-44ab-b16e-3f8639fdeb8d","year":1999},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Proceedings of the National Academy of Sciences97(21), 11149–11152 (2000) 24 X","work_id":"acbbf70f-347a-4759-8ad2-1bbca10a7d00","year":2000},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Journal of Economic Theory100(2), 295– 328 (2001)","work_id":"81e1b9ae-afcd-49de-a2d2-eda87ee032f5","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Journal of Economic Theory144(2), 565–603 (2009)","work_id":"fcc20cce-6757-4187-8e88-bc8622dd1b99","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems","work_id":"04b9b44d-7c73-489f-abb3-4e29ff3253b6","year":2023}],"snapshot_sha256":"48be5b29d26c516649515eb637a5fc74cc5a3ab012ca2f4684aebdd100295a5e"},"source":{"id":"2605.17221","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:18:03.185591Z","id":"8fe07f53-7c56-4e51-926b-a7a97a5305c2","model_set":{"reader":"grok-4.3"},"one_line_summary":"PDM and f-PDM achieve IC, non-negative revenue, and constant-approximate efficiency in diffusion auctions on paths and general networks, with further variants for Sybil attacks, collusion, and multi-unit cases.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks.","strongest_claim":"We propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties: incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound.","weakest_assumption":"The base mechanism is defined only for path graphs and extensions rely on a map f that preserves key properties when the network is arbitrary; if no such f exists that simultaneously maintains IC, non-negative revenue, and the constant efficiency bound for general graphs, the general claim fails."}},"verdict_id":"8fe07f53-7c56-4e51-926b-a7a97a5305c2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9cd5ea8ac34f176ec8a2cc0f4bfb05f369e4acecef168c4bd4f8e0b53fc3df58","target":"record","created_at":"2026-05-20T00:03:45Z","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":"67d0e4eb3744e860406bc74d317df576c7b3cd06947f788c1ecfecc9df9aae98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T01:54:28Z","title_canon_sha256":"450c06ffb1ab9370cecc77088e9305b2e44f99b44e45ff2d1f9944bd48c96ab3"},"schema_version":"1.0","source":{"id":"2605.17221","kind":"arxiv","version":1}},"canonical_sha256":"9ad2852a121849a5c0f427bdb58791ea57f356ef623551e7c1d18f49aa68ddc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ad2852a121849a5c0f427bdb58791ea57f356ef623551e7c1d18f49aa68ddc3","first_computed_at":"2026-05-20T00:03:45.974008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:45.974008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EolpwbImPUxFS0ML7faRdm0TGhvAyoyTM/T/3oSwrXjkRCgg75UCB3kru9oSvUK+RPq+XlbnzGZkXKlq+czaCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:45.974921Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cd5ea8ac34f176ec8a2cc0f4bfb05f369e4acecef168c4bd4f8e0b53fc3df58","sha256:acd5987e996b779ef24239b8291cdf0b238b497cb839aaf97a72956d591c4e69"],"state_sha256":"24cd2b031d5ad3ff1757526f5776649902bab91ae58e244b0cca4a970106d8a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AicIb9tSy1cEhiD1iARbKRcTZs+kvRldVkQhrS4hmWVCuFUP53d8iUaI7ZbRLY6ulpMeT8u5QZcfIot3MlGOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T16:39:12.052589Z","bundle_sha256":"c3c6535e7f926ded955665bd8161d676848e8de5dffda2e7f719f143d8775b89"}}