{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:W3E2K3VVM4JHKHHIKCKJ64VZRJ","short_pith_number":"pith:W3E2K3VV","canonical_record":{"source":{"id":"2605.16840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T06:56:45Z","cross_cats_sorted":[],"title_canon_sha256":"cdc74c16a9ac96038423aaa76fa385627ac6d6d1cc36a13c7d6295ea71c26ef0","abstract_canon_sha256":"a11a14c863538eb89704ea8f47606275e8bfe72de97a90a8372f847a0603364c"},"schema_version":"1.0"},"canonical_sha256":"b6c9a56eb56712751ce850949f72b98a4989be9c0df08b95cd61b2b0f3dd293e","source":{"kind":"arxiv","id":"2605.16840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16840","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16840v1","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16840","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"W3E2K3VVM4JH","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_16","alias_value":"W3E2K3VVM4JHKHHI","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_8","alias_value":"W3E2K3VV","created_at":"2026-05-20T00:03:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:W3E2K3VVM4JHKHHIKCKJ64VZRJ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T06:56:45Z","cross_cats_sorted":[],"title_canon_sha256":"cdc74c16a9ac96038423aaa76fa385627ac6d6d1cc36a13c7d6295ea71c26ef0","abstract_canon_sha256":"a11a14c863538eb89704ea8f47606275e8bfe72de97a90a8372f847a0603364c"},"schema_version":"1.0"},"canonical_sha256":"b6c9a56eb56712751ce850949f72b98a4989be9c0df08b95cd61b2b0f3dd293e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:25.530155Z","signature_b64":"MssHsMr2pPEGsVnRNxATWI0Bckx/C5CR+xt0zvGT9t8aBpf4emLCs69cOBKzKNDJ1B3rL0Fo01k4y9kaoiRpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6c9a56eb56712751ce850949f72b98a4989be9c0df08b95cd61b2b0f3dd293e","last_reissued_at":"2026-05-20T00:03:25.529370Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:25.529370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16840","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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzSlB9vDaKCMqaMOlf6o30n4we4hJ0r6mope5RQnu9l8YVmZCRYfrM57Xs+W5pUKEglgNYxFjGR+15f2JCh/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:20:06.190279Z"},"content_sha256":"f835e5e6dae678459501de4ae86a0022eb8347dc0e124afbf21caa84a6a521a1","schema_version":"1.0","event_id":"sha256:f835e5e6dae678459501de4ae86a0022eb8347dc0e124afbf21caa84a6a521a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:W3E2K3VVM4JHKHHIKCKJ64VZRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On $t$-edge-balanced graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"For t at least 4 no nontrivial t-edge-balanced graphs exist, while examples exist for t equals 3.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yeow Meng Chee","submitted_at":"2026-05-16T06:56:45Z","abstract_excerpt":"A graph $G$ on $n$ vertices with $k$ edges is $t$-edge-balanced if every graph on $n$ vertices with $t$ edges is contained in exactly the same number of subgraphs of $K_n$ isomorphic to $G$. Despite the existence of infinite families of $2$-edge-balanced graphs, no $t$-edge-balanced graphs were known for $t \\ge 3$. This paper resolves the existence question for $t \\ge 3$ in two directions. For $t = 3$, we derive necessary arithmetic conditions on the parameters $(n,k)$ and use a simulated annealing search to find the first known examples of $3$-edge-balanced graphs. For $t \\ge 4$, we prove tha"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For t >= 4, no nontrivial t-edge-balanced graphs exist. For t = 3, graphs satisfying the derived arithmetic conditions on (n, k) exist and were located by simulated annealing search.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The simulated annealing procedure correctly identifies graphs that meet the exact containment-count condition rather than merely satisfying the necessary arithmetic conditions; the abstract does not state verification steps or exhaustive enumeration.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"This paper proves non-existence of nontrivial t-edge-balanced graphs for t >= 4 and computationally discovers the first examples for t = 3 after establishing necessary conditions on n and k.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For t at least 4 no nontrivial t-edge-balanced graphs exist, while examples exist for t equals 3.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c8a80d37f87ff7f77c0c2b87d4a4bcf3f7745a9c3113689b3c7ee3ba68d2b16f"},"source":{"id":"2605.16840","kind":"arxiv","version":1},"verdict":{"id":"74ae6a5e-9b6e-4e16-9cb0-d4af6940456e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:56:11.937021Z","strongest_claim":"For t >= 4, no nontrivial t-edge-balanced graphs exist. For t = 3, graphs satisfying the derived arithmetic conditions on (n, k) exist and were located by simulated annealing search.","one_line_summary":"This paper proves non-existence of nontrivial t-edge-balanced graphs for t >= 4 and computationally discovers the first examples for t = 3 after establishing necessary conditions on n and k.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The simulated annealing procedure correctly identifies graphs that meet the exact containment-count condition rather than merely satisfying the necessary arithmetic conditions; the abstract does not state verification steps or exhaustive enumeration.","pith_extraction_headline":"For t at least 4 no nontrivial t-edge-balanced graphs exist, while examples exist for t equals 3."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16840/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T21:01:25.165958Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.244518Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.322518Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.395098Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ebfbc745444ba3e3e631a23381606d5b79736766095f4d5e1b51ed5dd669e5cc"},"references":{"count":6,"sample":[{"doi":"","year":1966,"title":"W. O. Alltop. On the construction of block designs.J Combin Theory, 1(4):501–502, 1966","work_id":"c880b600-7c0e-4a08-8f20-fe1f10560793","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Bollobás.Modern Graph Theory, volume 184 ofGraduate Texts in Mathematics","work_id":"024c5eb7-7c71-4c58-bfe3-2e846791695a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"C. Caliskan. New 2-edge-balanced graphs from bipartite graphs.J Combin Des, 24(8):343– 351, 2016","work_id":"12b3c467-4967-463d-9224-32c3d6240882","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"C. Caliskan and Y. M. Chee. New infinite families of 2-edge-balanced graphs.J Combin Des, 22(7):291–305, 2014","work_id":"0daae10e-9036-4e17-8beb-3159709fa1b0","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2007,"title":"Y. M. Chee and D. L. Kreher. Graphical designs. In C. J. Colbourn and J. H. Dinitz, editors,The CRC Handbook of Combinatorial Designs, pages 490–493. CRC Press, Boca Raton, 2nd edition, 2007","work_id":"19a2fa9c-65fe-4bf2-b22b-2493c8b93b4e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":6,"snapshot_sha256":"7f2915c82ce76fb3b3ab09c89c3ed0f308307278c3e49fcc90c241db741b01dc","internal_anchors":0},"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":"74ae6a5e-9b6e-4e16-9cb0-d4af6940456e"},"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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UUht62SlFoddnhm3SkH9wuqEVd+M2dB8sSetdbUY153vUSkZSHW261GjayOx8reh3X/YkZpRePjCAEgGg2iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:20:06.191643Z"},"content_sha256":"0bc779ede6a7049db88c723a9b938931b2234c64da568083af05300a89c8cb82","schema_version":"1.0","event_id":"sha256:0bc779ede6a7049db88c723a9b938931b2234c64da568083af05300a89c8cb82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3E2K3VVM4JHKHHIKCKJ64VZRJ/bundle.json","state_url":"https://pith.science/pith/W3E2K3VVM4JHKHHIKCKJ64VZRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3E2K3VVM4JHKHHIKCKJ64VZRJ/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-06-10T16:20:06Z","links":{"resolver":"https://pith.science/pith/W3E2K3VVM4JHKHHIKCKJ64VZRJ","bundle":"https://pith.science/pith/W3E2K3VVM4JHKHHIKCKJ64VZRJ/bundle.json","state":"https://pith.science/pith/W3E2K3VVM4JHKHHIKCKJ64VZRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3E2K3VVM4JHKHHIKCKJ64VZRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W3E2K3VVM4JHKHHIKCKJ64VZRJ","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":"a11a14c863538eb89704ea8f47606275e8bfe72de97a90a8372f847a0603364c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T06:56:45Z","title_canon_sha256":"cdc74c16a9ac96038423aaa76fa385627ac6d6d1cc36a13c7d6295ea71c26ef0"},"schema_version":"1.0","source":{"id":"2605.16840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16840","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16840v1","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16840","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"W3E2K3VVM4JH","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_16","alias_value":"W3E2K3VVM4JHKHHI","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_8","alias_value":"W3E2K3VV","created_at":"2026-05-20T00:03:25Z"}],"graph_snapshots":[{"event_id":"sha256:0bc779ede6a7049db88c723a9b938931b2234c64da568083af05300a89c8cb82","target":"graph","created_at":"2026-05-20T00:03:25Z","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 t >= 4, no nontrivial t-edge-balanced graphs exist. For t = 3, graphs satisfying the derived arithmetic conditions on (n, k) exist and were located by simulated annealing search."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The simulated annealing procedure correctly identifies graphs that meet the exact containment-count condition rather than merely satisfying the necessary arithmetic conditions; the abstract does not state verification steps or exhaustive enumeration."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"This paper proves non-existence of nontrivial t-edge-balanced graphs for t >= 4 and computationally discovers the first examples for t = 3 after establishing necessary conditions on n and k."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For t at least 4 no nontrivial t-edge-balanced graphs exist, while examples exist for t equals 3."}],"snapshot_sha256":"c8a80d37f87ff7f77c0c2b87d4a4bcf3f7745a9c3113689b3c7ee3ba68d2b16f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:01:25.165958Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.244518Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.322518Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.395098Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16840/integrity.json","findings":[],"snapshot_sha256":"ebfbc745444ba3e3e631a23381606d5b79736766095f4d5e1b51ed5dd669e5cc","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ on $n$ vertices with $k$ edges is $t$-edge-balanced if every graph on $n$ vertices with $t$ edges is contained in exactly the same number of subgraphs of $K_n$ isomorphic to $G$. Despite the existence of infinite families of $2$-edge-balanced graphs, no $t$-edge-balanced graphs were known for $t \\ge 3$. This paper resolves the existence question for $t \\ge 3$ in two directions. For $t = 3$, we derive necessary arithmetic conditions on the parameters $(n,k)$ and use a simulated annealing search to find the first known examples of $3$-edge-balanced graphs. For $t \\ge 4$, we prove tha","authors_text":"Yeow Meng Chee","cross_cats":[],"headline":"For t at least 4 no nontrivial t-edge-balanced graphs exist, while examples exist for t equals 3.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T06:56:45Z","title":"On $t$-edge-balanced graphs"},"references":{"count":6,"internal_anchors":0,"resolved_work":6,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"W. O. Alltop. On the construction of block designs.J Combin Theory, 1(4):501–502, 1966","work_id":"c880b600-7c0e-4a08-8f20-fe1f10560793","year":1966},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Bollobás.Modern Graph Theory, volume 184 ofGraduate Texts in Mathematics","work_id":"024c5eb7-7c71-4c58-bfe3-2e846791695a","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"C. Caliskan. New 2-edge-balanced graphs from bipartite graphs.J Combin Des, 24(8):343– 351, 2016","work_id":"12b3c467-4967-463d-9224-32c3d6240882","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"C. Caliskan and Y. M. Chee. New infinite families of 2-edge-balanced graphs.J Combin Des, 22(7):291–305, 2014","work_id":"0daae10e-9036-4e17-8beb-3159709fa1b0","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Y. M. Chee and D. L. Kreher. Graphical designs. In C. J. Colbourn and J. H. Dinitz, editors,The CRC Handbook of Combinatorial Designs, pages 490–493. CRC Press, Boca Raton, 2nd edition, 2007","work_id":"19a2fa9c-65fe-4bf2-b22b-2493c8b93b4e","year":2007}],"snapshot_sha256":"7f2915c82ce76fb3b3ab09c89c3ed0f308307278c3e49fcc90c241db741b01dc"},"source":{"id":"2605.16840","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:56:11.937021Z","id":"74ae6a5e-9b6e-4e16-9cb0-d4af6940456e","model_set":{"reader":"grok-4.3"},"one_line_summary":"This paper proves non-existence of nontrivial t-edge-balanced graphs for t >= 4 and computationally discovers the first examples for t = 3 after establishing necessary conditions on n and k.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For t at least 4 no nontrivial t-edge-balanced graphs exist, while examples exist for t equals 3.","strongest_claim":"For t >= 4, no nontrivial t-edge-balanced graphs exist. For t = 3, graphs satisfying the derived arithmetic conditions on (n, k) exist and were located by simulated annealing search.","weakest_assumption":"The simulated annealing procedure correctly identifies graphs that meet the exact containment-count condition rather than merely satisfying the necessary arithmetic conditions; the abstract does not state verification steps or exhaustive enumeration."}},"verdict_id":"74ae6a5e-9b6e-4e16-9cb0-d4af6940456e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f835e5e6dae678459501de4ae86a0022eb8347dc0e124afbf21caa84a6a521a1","target":"record","created_at":"2026-05-20T00:03:25Z","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":"a11a14c863538eb89704ea8f47606275e8bfe72de97a90a8372f847a0603364c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T06:56:45Z","title_canon_sha256":"cdc74c16a9ac96038423aaa76fa385627ac6d6d1cc36a13c7d6295ea71c26ef0"},"schema_version":"1.0","source":{"id":"2605.16840","kind":"arxiv","version":1}},"canonical_sha256":"b6c9a56eb56712751ce850949f72b98a4989be9c0df08b95cd61b2b0f3dd293e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6c9a56eb56712751ce850949f72b98a4989be9c0df08b95cd61b2b0f3dd293e","first_computed_at":"2026-05-20T00:03:25.529370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:25.529370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MssHsMr2pPEGsVnRNxATWI0Bckx/C5CR+xt0zvGT9t8aBpf4emLCs69cOBKzKNDJ1B3rL0Fo01k4y9kaoiRpDw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:25.530155Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f835e5e6dae678459501de4ae86a0022eb8347dc0e124afbf21caa84a6a521a1","sha256:0bc779ede6a7049db88c723a9b938931b2234c64da568083af05300a89c8cb82"],"state_sha256":"e07252f292e83dc8a2a5bbe880f0407b26e6fd931c25fa86db689ce2bfd442af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hoL4baeqLA5zXwK42c90Et/RP99L4DPav1aRWkxQSYYHJL7+FZAMgBbkKjrigPgG9nAPghz3BqWEGo1x2ZV5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:20:06.197280Z","bundle_sha256":"403d2f52dfe15a69e9f418d0c97d42216bfad8803393e457f392ab573885251a"}}