{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:W3TQJMP7I4PQ4YINRZNV3P6ADW","short_pith_number":"pith:W3TQJMP7","canonical_record":{"source":{"id":"2605.16897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-05-16T09:17:23Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"dfdd2bdf86a480a79ae590402a8cc1e0bbb4ae4b9fb2f4fb79c918d000c5c70d","abstract_canon_sha256":"21155606edda4f7ef18b39fca88be4ec3ee32fc27b9cee64b9714ac4b8e9e16b"},"schema_version":"1.0"},"canonical_sha256":"b6e704b1ff471f0e610d8e5b5dbfc01da6ecb12c2504d1a148cc9bf44096dc29","source":{"kind":"arxiv","id":"2605.16897","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16897","created_at":"2026-05-20T00:03:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16897v1","created_at":"2026-05-20T00:03:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16897","created_at":"2026-05-20T00:03:28Z"},{"alias_kind":"pith_short_12","alias_value":"W3TQJMP7I4PQ","created_at":"2026-05-20T00:03:28Z"},{"alias_kind":"pith_short_16","alias_value":"W3TQJMP7I4PQ4YIN","created_at":"2026-05-20T00:03:28Z"},{"alias_kind":"pith_short_8","alias_value":"W3TQJMP7","created_at":"2026-05-20T00:03:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:W3TQJMP7I4PQ4YINRZNV3P6ADW","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-05-16T09:17:23Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"dfdd2bdf86a480a79ae590402a8cc1e0bbb4ae4b9fb2f4fb79c918d000c5c70d","abstract_canon_sha256":"21155606edda4f7ef18b39fca88be4ec3ee32fc27b9cee64b9714ac4b8e9e16b"},"schema_version":"1.0"},"canonical_sha256":"b6e704b1ff471f0e610d8e5b5dbfc01da6ecb12c2504d1a148cc9bf44096dc29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:28.983964Z","signature_b64":"KZkIslle7QklpkVa4oewC8fiChZDt9Trs440cFGNRZmDN0iYpI1yJYHhY5ahHeJ9xgrO3A38AJWt5Sc1/kULBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6e704b1ff471f0e610d8e5b5dbfc01da6ecb12c2504d1a148cc9bf44096dc29","last_reissued_at":"2026-05-20T00:03:28.983060Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:28.983060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16897","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:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTWF2c3GDszn6Y9dATVDsVIiss/Al+aj4IfpPOx1kgtyRUvHbKV/DaP9DgwKA0hkS1gv5wGtzZrHiuhuTAuBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:06:05.593902Z"},"content_sha256":"7b0f1c3a17ba6e6deb34ea9ec2a490e07b25cb113556ac8e7029c2b4b330d412","schema_version":"1.0","event_id":"sha256:7b0f1c3a17ba6e6deb34ea9ec2a490e07b25cb113556ac8e7029c2b4b330d412"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:W3TQJMP7I4PQ4YINRZNV3P6ADW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Escape from Callback Hell! A New Programming Paradigm for Network Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Coroutine-based discrete event simulation lets developers write network protocols as simple sequential code instead of callback tangles.","cross_cats":["cs.PL"],"primary_cat":"cs.NI","authors_text":"Sen Liu, Xin Ai, Yang Xu, Yuanyi Zhu, Zijian Li, Zixuan Chen","submitted_at":"2026-05-16T09:17:23Z","abstract_excerpt":"Network simulation plays a crucial role in both networking research and industry. Existing commonly-used Discrete Event Simulations (DES) are based on callback mechanisms for discrete event (DE). However, due to the inability of callbacks to naturally simulate network events, programs in network simulation cannot be written in a sequential workflow. This leads to inherent complexity and poor maintainability, resulting in stack ripping and callback hell. These problems significantly increase simulation development workloads and introduce substantial cognitive loads associated with programming a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We implement a new network simulation framework based on CoDES that is capable of naturally simulating network events and effectively address key system challenges related to correctness, functionality, compatibility, and overhead. ... achieving up to 62.3% and 82.6% reduction in code volume and structure complexity without sacrificing simulation accuracy, extending execution time or increasing runtime memory of simulation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That coroutines can be integrated into existing discrete event simulators like NS-3 while fully preserving event ordering, timing semantics, and correctness for arbitrary network protocols without introducing hidden overheads or compatibility breaks. This premise is invoked when the abstract states the framework addresses challenges related to correctness and compatibility.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CoDES replaces callback-driven discrete event simulation with coroutines to enable sequential network program workflows, demonstrated by 62.3% code volume and 82.6% structure complexity reductions in NS-3 implementations of MPI, HPCC, and RIP without accuracy or performance loss.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Coroutine-based discrete event simulation lets developers write network protocols as simple sequential code instead of callback tangles.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d54bb6c4cb36f686cc2dbfc7e78e689f04981ddb4ec96cbcc5d3652cad271fa9"},"source":{"id":"2605.16897","kind":"arxiv","version":1},"verdict":{"id":"ab153482-65f0-4a0c-98c5-6fa78a4b2060","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:22:07.801954Z","strongest_claim":"We implement a new network simulation framework based on CoDES that is capable of naturally simulating network events and effectively address key system challenges related to correctness, functionality, compatibility, and overhead. ... achieving up to 62.3% and 82.6% reduction in code volume and structure complexity without sacrificing simulation accuracy, extending execution time or increasing runtime memory of simulation.","one_line_summary":"CoDES replaces callback-driven discrete event simulation with coroutines to enable sequential network program workflows, demonstrated by 62.3% code volume and 82.6% structure complexity reductions in NS-3 implementations of MPI, HPCC, and RIP without accuracy or performance loss.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That coroutines can be integrated into existing discrete event simulators like NS-3 while fully preserving event ordering, timing semantics, and correctness for arbitrary network protocols without introducing hidden overheads or compatibility breaks. This premise is invoked when the abstract states the framework addresses challenges related to correctness and compatibility.","pith_extraction_headline":"Coroutine-based discrete event simulation lets developers write network protocols as simple sequential code instead of callback tangles."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16897/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T20:52:41.106959Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:18.953115Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:30:53.010837Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.278738Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.357609Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ce0865b3888c1cc6ade1cc1c404695fd74c307af7174c3aa68f8b3a97b4e2e15"},"references":{"count":47,"sample":[{"doi":"","year":2024,"title":"m3: Accu- rate flow-level performance estimation using machine learning,","work_id":"486958d3-0820-4105-a4eb-485a3a7284fe","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Unison: A parallel- efficient and user-transparent network simulation kernel,","work_id":"305f7543-df5d-4903-b41b-e9fb03e6c1df","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Dons: Fast and affordable discrete event network simulation with automatic paral- lelization,","work_id":"05af82f0-b269-48b6-8f36-ada8e44e4a88","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"Discrete event simulation system,","work_id":"ec74ced3-8aee-4077-b2e0-e06d18d6390c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"G. S. Fishman,Discrete-event simulation: modeling, pro- gramming, and analysis. Springer, 2001, vol. 537","work_id":"87956c9b-9fca-418e-b2e8-6193640bf2ca","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":47,"snapshot_sha256":"56eb47b5aca382960664413382ceca7a0657eef914ceaae407ade5dbf42107d3","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"259b254a46fa762986dee813cfb21d367a3c3eb20efd8fe3060c2ad84ebdb24f"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"ab153482-65f0-4a0c-98c5-6fa78a4b2060"},"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:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nuk43oOvvb4vivQOOWJ2WMOeeTsrz31exp5/bfD/rU/fnDIt5ZTlmIT4vDB7GQy+vvqPEqiVlaw4wUHIvqjjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:06:05.595080Z"},"content_sha256":"1bb04e93aa1ecf3f8ff7863c1e4f873e83232d643f01914d841b3b78955b43a0","schema_version":"1.0","event_id":"sha256:1bb04e93aa1ecf3f8ff7863c1e4f873e83232d643f01914d841b3b78955b43a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3TQJMP7I4PQ4YINRZNV3P6ADW/bundle.json","state_url":"https://pith.science/pith/W3TQJMP7I4PQ4YINRZNV3P6ADW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3TQJMP7I4PQ4YINRZNV3P6ADW/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-22T00:06:05Z","links":{"resolver":"https://pith.science/pith/W3TQJMP7I4PQ4YINRZNV3P6ADW","bundle":"https://pith.science/pith/W3TQJMP7I4PQ4YINRZNV3P6ADW/bundle.json","state":"https://pith.science/pith/W3TQJMP7I4PQ4YINRZNV3P6ADW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3TQJMP7I4PQ4YINRZNV3P6ADW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W3TQJMP7I4PQ4YINRZNV3P6ADW","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":"21155606edda4f7ef18b39fca88be4ec3ee32fc27b9cee64b9714ac4b8e9e16b","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-05-16T09:17:23Z","title_canon_sha256":"dfdd2bdf86a480a79ae590402a8cc1e0bbb4ae4b9fb2f4fb79c918d000c5c70d"},"schema_version":"1.0","source":{"id":"2605.16897","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16897","created_at":"2026-05-20T00:03:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16897v1","created_at":"2026-05-20T00:03:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16897","created_at":"2026-05-20T00:03:28Z"},{"alias_kind":"pith_short_12","alias_value":"W3TQJMP7I4PQ","created_at":"2026-05-20T00:03:28Z"},{"alias_kind":"pith_short_16","alias_value":"W3TQJMP7I4PQ4YIN","created_at":"2026-05-20T00:03:28Z"},{"alias_kind":"pith_short_8","alias_value":"W3TQJMP7","created_at":"2026-05-20T00:03:28Z"}],"graph_snapshots":[{"event_id":"sha256:1bb04e93aa1ecf3f8ff7863c1e4f873e83232d643f01914d841b3b78955b43a0","target":"graph","created_at":"2026-05-20T00:03:28Z","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 implement a new network simulation framework based on CoDES that is capable of naturally simulating network events and effectively address key system challenges related to correctness, functionality, compatibility, and overhead. ... achieving up to 62.3% and 82.6% reduction in code volume and structure complexity without sacrificing simulation accuracy, extending execution time or increasing runtime memory of simulation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That coroutines can be integrated into existing discrete event simulators like NS-3 while fully preserving event ordering, timing semantics, and correctness for arbitrary network protocols without introducing hidden overheads or compatibility breaks. This premise is invoked when the abstract states the framework addresses challenges related to correctness and compatibility."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CoDES replaces callback-driven discrete event simulation with coroutines to enable sequential network program workflows, demonstrated by 62.3% code volume and 82.6% structure complexity reductions in NS-3 implementations of MPI, HPCC, and RIP without accuracy or performance loss."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Coroutine-based discrete event simulation lets developers write network protocols as simple sequential code instead of callback tangles."}],"snapshot_sha256":"d54bb6c4cb36f686cc2dbfc7e78e689f04981ddb4ec96cbcc5d3652cad271fa9"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"259b254a46fa762986dee813cfb21d367a3c3eb20efd8fe3060c2ad84ebdb24f"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T20:52:41.106959Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:18.953115Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:30:53.010837Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.278738Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.357609Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16897/integrity.json","findings":[],"snapshot_sha256":"ce0865b3888c1cc6ade1cc1c404695fd74c307af7174c3aa68f8b3a97b4e2e15","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network simulation plays a crucial role in both networking research and industry. Existing commonly-used Discrete Event Simulations (DES) are based on callback mechanisms for discrete event (DE). However, due to the inability of callbacks to naturally simulate network events, programs in network simulation cannot be written in a sequential workflow. This leads to inherent complexity and poor maintainability, resulting in stack ripping and callback hell. These problems significantly increase simulation development workloads and introduce substantial cognitive loads associated with programming a","authors_text":"Sen Liu, Xin Ai, Yang Xu, Yuanyi Zhu, Zijian Li, Zixuan Chen","cross_cats":["cs.PL"],"headline":"Coroutine-based discrete event simulation lets developers write network protocols as simple sequential code instead of callback tangles.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-05-16T09:17:23Z","title":"Escape from Callback Hell! A New Programming Paradigm for Network Simulation"},"references":{"count":47,"internal_anchors":0,"resolved_work":47,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"m3: Accu- rate flow-level performance estimation using machine learning,","work_id":"486958d3-0820-4105-a4eb-485a3a7284fe","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Unison: A parallel- efficient and user-transparent network simulation kernel,","work_id":"305f7543-df5d-4903-b41b-e9fb03e6c1df","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Dons: Fast and affordable discrete event network simulation with automatic paral- lelization,","work_id":"05af82f0-b269-48b6-8f36-ada8e44e4a88","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Discrete event simulation system,","work_id":"ec74ced3-8aee-4077-b2e0-e06d18d6390c","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"G. S. Fishman,Discrete-event simulation: modeling, pro- gramming, and analysis. Springer, 2001, vol. 537","work_id":"87956c9b-9fca-418e-b2e8-6193640bf2ca","year":2001}],"snapshot_sha256":"56eb47b5aca382960664413382ceca7a0657eef914ceaae407ade5dbf42107d3"},"source":{"id":"2605.16897","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:22:07.801954Z","id":"ab153482-65f0-4a0c-98c5-6fa78a4b2060","model_set":{"reader":"grok-4.3"},"one_line_summary":"CoDES replaces callback-driven discrete event simulation with coroutines to enable sequential network program workflows, demonstrated by 62.3% code volume and 82.6% structure complexity reductions in NS-3 implementations of MPI, HPCC, and RIP without accuracy or performance loss.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Coroutine-based discrete event simulation lets developers write network protocols as simple sequential code instead of callback tangles.","strongest_claim":"We implement a new network simulation framework based on CoDES that is capable of naturally simulating network events and effectively address key system challenges related to correctness, functionality, compatibility, and overhead. ... achieving up to 62.3% and 82.6% reduction in code volume and structure complexity without sacrificing simulation accuracy, extending execution time or increasing runtime memory of simulation.","weakest_assumption":"That coroutines can be integrated into existing discrete event simulators like NS-3 while fully preserving event ordering, timing semantics, and correctness for arbitrary network protocols without introducing hidden overheads or compatibility breaks. This premise is invoked when the abstract states the framework addresses challenges related to correctness and compatibility."}},"verdict_id":"ab153482-65f0-4a0c-98c5-6fa78a4b2060"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7b0f1c3a17ba6e6deb34ea9ec2a490e07b25cb113556ac8e7029c2b4b330d412","target":"record","created_at":"2026-05-20T00:03:28Z","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":"21155606edda4f7ef18b39fca88be4ec3ee32fc27b9cee64b9714ac4b8e9e16b","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-05-16T09:17:23Z","title_canon_sha256":"dfdd2bdf86a480a79ae590402a8cc1e0bbb4ae4b9fb2f4fb79c918d000c5c70d"},"schema_version":"1.0","source":{"id":"2605.16897","kind":"arxiv","version":1}},"canonical_sha256":"b6e704b1ff471f0e610d8e5b5dbfc01da6ecb12c2504d1a148cc9bf44096dc29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6e704b1ff471f0e610d8e5b5dbfc01da6ecb12c2504d1a148cc9bf44096dc29","first_computed_at":"2026-05-20T00:03:28.983060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:28.983060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KZkIslle7QklpkVa4oewC8fiChZDt9Trs440cFGNRZmDN0iYpI1yJYHhY5ahHeJ9xgrO3A38AJWt5Sc1/kULBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:28.983964Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16897","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b0f1c3a17ba6e6deb34ea9ec2a490e07b25cb113556ac8e7029c2b4b330d412","sha256:1bb04e93aa1ecf3f8ff7863c1e4f873e83232d643f01914d841b3b78955b43a0"],"state_sha256":"a6aa57a06b5a639c4706bd374553d81acc96dff7f4c0ffc1fc63773f1f9f7d34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45E8+Udv8qCR7RYmAhs/6zoIuojLF6I5OeVHcn+zHP3M4wYtI8ZyvMapD5hVe+usnTKc9Jx1y2jT7ctA/NESCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T00:06:05.599639Z","bundle_sha256":"2e610e45ef6ff3336cc62205680dd5541d3f3f4188764d19c7e514318cb2d898"}}