{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SIYD6NTKN6333UTEQBTUDQ7XDO","short_pith_number":"pith:SIYD6NTK","canonical_record":{"source":{"id":"2605.16741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T01:37:54Z","cross_cats_sorted":[],"title_canon_sha256":"6488361d7b172340e479d2196d3e4cbc871526ed6956cabad8c6a0cb9320ac6f","abstract_canon_sha256":"3e461208e22b426c009818ec2b0a76d00bd3b2ce659643c0120de21541c15e5f"},"schema_version":"1.0"},"canonical_sha256":"92303f366a6fb7bdd264806741c3f71b886e4e226795959340dcd8100d861a31","source":{"kind":"arxiv","id":"2605.16741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16741","created_at":"2026-05-20T00:02:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16741v1","created_at":"2026-05-20T00:02:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16741","created_at":"2026-05-20T00:02:39Z"},{"alias_kind":"pith_short_12","alias_value":"SIYD6NTKN633","created_at":"2026-05-20T00:02:39Z"},{"alias_kind":"pith_short_16","alias_value":"SIYD6NTKN6333UTE","created_at":"2026-05-20T00:02:39Z"},{"alias_kind":"pith_short_8","alias_value":"SIYD6NTK","created_at":"2026-05-20T00:02:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SIYD6NTKN6333UTEQBTUDQ7XDO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T01:37:54Z","cross_cats_sorted":[],"title_canon_sha256":"6488361d7b172340e479d2196d3e4cbc871526ed6956cabad8c6a0cb9320ac6f","abstract_canon_sha256":"3e461208e22b426c009818ec2b0a76d00bd3b2ce659643c0120de21541c15e5f"},"schema_version":"1.0"},"canonical_sha256":"92303f366a6fb7bdd264806741c3f71b886e4e226795959340dcd8100d861a31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:39.287405Z","signature_b64":"3L4B7HH6vpqT5739eyAOR1reoZ1CoDs5QPFCtGPqqrivk5F6Cdp9oRSK3iSQ9fwZKqJtOwBm3tyogcj2k2F1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92303f366a6fb7bdd264806741c3f71b886e4e226795959340dcd8100d861a31","last_reissued_at":"2026-05-20T00:02:39.286520Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:39.286520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16741","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:02:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"roLDSXPZWEdx2IJBpMFt8tzi+ZxJvvmJKe9GJNSzV/jNImg+MIkl5qUtvbDrWadA51LksdoD2vjS4lnfEpWWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:58:09.027172Z"},"content_sha256":"c97bb7265ae76c72ddc293a81c84b0bef1d16f89732685dec06e94400fb7fd61","schema_version":"1.0","event_id":"sha256:c97bb7265ae76c72ddc293a81c84b0bef1d16f89732685dec06e94400fb7fd61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SIYD6NTKN6333UTEQBTUDQ7XDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hypermaps with hyperedges of length at most $3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"For hypermaps with hyperedges of length at most 3, the Whitney polynomial and spanning hypertree counts depend only on the underlying multi-hypergraph structure.","cross_cats":[],"primary_cat":"math.CO","authors_text":"G\\'abor Hetyei, Robert Cori","submitted_at":"2026-05-16T01:37:54Z","abstract_excerpt":"We study the computation of our recently introduced Whitney polynomial and the enumeration of the spanning hypertrees for hypermaps whose hyperedges have length at most $3$. This is a class of hypermaps where the computation of the above invariants depends only on the underlying (multi)hypergraph structure. We develop deletion-contraction formulas involving six types of generalized loops and bridges, and we prove results on special substitutions into our Whitney polynomial. We generalize the reliability polynomial and the random cluster model to hypermaps in general in such a way that they can"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We develop deletion-contraction formulas involving six types of generalized loops and bridges, and we prove results on special substitutions into our Whitney polynomial for hypermaps whose hyperedges have length at most 3.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The computation of the Whitney polynomial and the enumeration of spanning hypertrees for this class of hypermaps depends only on the underlying (multi)hypergraph structure rather than on the embedding.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For hypermaps with hyperedges of length at most 3 the Whitney polynomial and spanning hypertrees depend only on the underlying hypergraph and admit deletion-contraction formulas; explicit counts are given for spanning hypertrees in reciprocals of maximum-degree-3 plane graphs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For hypermaps with hyperedges of length at most 3, the Whitney polynomial and spanning hypertree counts depend only on the underlying multi-hypergraph structure.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b8630e42e5c94458637a4f2831acc07cbcbac4ac61208e08ea3c366f9d92a691"},"source":{"id":"2605.16741","kind":"arxiv","version":1},"verdict":{"id":"c045a9aa-54c5-424c-9e1b-a7cc4f96ebef","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:30:08.974253Z","strongest_claim":"We develop deletion-contraction formulas involving six types of generalized loops and bridges, and we prove results on special substitutions into our Whitney polynomial for hypermaps whose hyperedges have length at most 3.","one_line_summary":"For hypermaps with hyperedges of length at most 3 the Whitney polynomial and spanning hypertrees depend only on the underlying hypergraph and admit deletion-contraction formulas; explicit counts are given for spanning hypertrees in reciprocals of maximum-degree-3 plane graphs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The computation of the Whitney polynomial and the enumeration of spanning hypertrees for this class of hypermaps depends only on the underlying (multi)hypergraph structure rather than on the embedding.","pith_extraction_headline":"For hypermaps with hyperedges of length at most 3, the Whitney polynomial and spanning hypertree counts depend only on the underlying multi-hypergraph structure."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16741/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.861243Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:40:55.338358Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.334113Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.463470Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"1a1b77246434fe6dc6a91697723ac9373b800f8cacaa5533aa88897977d0ba36"},"references":{"count":25,"sample":[{"doi":"","year":2000,"title":"R. Arratia, B. Bollob´ as and G.B. Sorkin, The interlace polynomial: a new graph polynomial, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 2000),","work_id":"ad0e571b-f659-472b-9d42-982a7f5da113","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"Bernardi, A characterization of the Tutte polynomial via combinatorial embeddings,Ann","work_id":"358142f9-f826-491d-b700-b0da2da61592","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2002,"title":"Bollob´ as, Evaluations of the circuit partition polynomial,J","work_id":"dd89165a-d07f-4be9-81aa-1591a9173652","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1975,"title":"Un code pour les Graphes Planaires et ses applications,","work_id":"c8b3daf7-99a0-42d6-97c3-22b011c8e84c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1976,"title":"Cori, Codage d’une carte planaire et hyperarbres recouvrants, Colloques Internat","work_id":"4d64ea43-0464-41f3-8a4a-953930b21ad4","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"56201d9b76d4195724239339c513cbbbbc53630b241c1e6c8d77afed4b68b151","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"83434d8d8066eb570e9d9cf6a428918270f28199a5a8cc73094378a931fb6dbb"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"c045a9aa-54c5-424c-9e1b-a7cc4f96ebef"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:02:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XCegNbTa2Sr7qeTYG4blVkm9YFotpRGjFj8JCQPZRu8Xt34mVjPF6gsroZyjcE38fgTpW9Uhjrvkv7mnBVTvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:58:09.027888Z"},"content_sha256":"a6bb2418aab3bffd0ff29a8d7acd6b51be2984a5833fe6b11295a78257b5c3a5","schema_version":"1.0","event_id":"sha256:a6bb2418aab3bffd0ff29a8d7acd6b51be2984a5833fe6b11295a78257b5c3a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIYD6NTKN6333UTEQBTUDQ7XDO/bundle.json","state_url":"https://pith.science/pith/SIYD6NTKN6333UTEQBTUDQ7XDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIYD6NTKN6333UTEQBTUDQ7XDO/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-01T21:58:09Z","links":{"resolver":"https://pith.science/pith/SIYD6NTKN6333UTEQBTUDQ7XDO","bundle":"https://pith.science/pith/SIYD6NTKN6333UTEQBTUDQ7XDO/bundle.json","state":"https://pith.science/pith/SIYD6NTKN6333UTEQBTUDQ7XDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIYD6NTKN6333UTEQBTUDQ7XDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SIYD6NTKN6333UTEQBTUDQ7XDO","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":"3e461208e22b426c009818ec2b0a76d00bd3b2ce659643c0120de21541c15e5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T01:37:54Z","title_canon_sha256":"6488361d7b172340e479d2196d3e4cbc871526ed6956cabad8c6a0cb9320ac6f"},"schema_version":"1.0","source":{"id":"2605.16741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16741","created_at":"2026-05-20T00:02:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16741v1","created_at":"2026-05-20T00:02:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16741","created_at":"2026-05-20T00:02:39Z"},{"alias_kind":"pith_short_12","alias_value":"SIYD6NTKN633","created_at":"2026-05-20T00:02:39Z"},{"alias_kind":"pith_short_16","alias_value":"SIYD6NTKN6333UTE","created_at":"2026-05-20T00:02:39Z"},{"alias_kind":"pith_short_8","alias_value":"SIYD6NTK","created_at":"2026-05-20T00:02:39Z"}],"graph_snapshots":[{"event_id":"sha256:a6bb2418aab3bffd0ff29a8d7acd6b51be2984a5833fe6b11295a78257b5c3a5","target":"graph","created_at":"2026-05-20T00:02:39Z","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 develop deletion-contraction formulas involving six types of generalized loops and bridges, and we prove results on special substitutions into our Whitney polynomial for hypermaps whose hyperedges have length at most 3."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The computation of the Whitney polynomial and the enumeration of spanning hypertrees for this class of hypermaps depends only on the underlying (multi)hypergraph structure rather than on the embedding."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For hypermaps with hyperedges of length at most 3 the Whitney polynomial and spanning hypertrees depend only on the underlying hypergraph and admit deletion-contraction formulas; explicit counts are given for spanning hypertrees in reciprocals of maximum-degree-3 plane graphs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For hypermaps with hyperedges of length at most 3, the Whitney polynomial and spanning hypertree counts depend only on the underlying multi-hypergraph structure."}],"snapshot_sha256":"b8630e42e5c94458637a4f2831acc07cbcbac4ac61208e08ea3c366f9d92a691"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"83434d8d8066eb570e9d9cf6a428918270f28199a5a8cc73094378a931fb6dbb"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.861243Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:40:55.338358Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.334113Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.463470Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16741/integrity.json","findings":[],"snapshot_sha256":"1a1b77246434fe6dc6a91697723ac9373b800f8cacaa5533aa88897977d0ba36","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the computation of our recently introduced Whitney polynomial and the enumeration of the spanning hypertrees for hypermaps whose hyperedges have length at most $3$. This is a class of hypermaps where the computation of the above invariants depends only on the underlying (multi)hypergraph structure. We develop deletion-contraction formulas involving six types of generalized loops and bridges, and we prove results on special substitutions into our Whitney polynomial. We generalize the reliability polynomial and the random cluster model to hypermaps in general in such a way that they can","authors_text":"G\\'abor Hetyei, Robert Cori","cross_cats":[],"headline":"For hypermaps with hyperedges of length at most 3, the Whitney polynomial and spanning hypertree counts depend only on the underlying multi-hypergraph structure.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T01:37:54Z","title":"Hypermaps with hyperedges of length at most $3$"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"R. Arratia, B. Bollob´ as and G.B. Sorkin, The interlace polynomial: a new graph polynomial, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 2000),","work_id":"ad0e571b-f659-472b-9d42-982a7f5da113","year":2000},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Bernardi, A characterization of the Tutte polynomial via combinatorial embeddings,Ann","work_id":"358142f9-f826-491d-b700-b0da2da61592","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Bollob´ as, Evaluations of the circuit partition polynomial,J","work_id":"dd89165a-d07f-4be9-81aa-1591a9173652","year":2002},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Un code pour les Graphes Planaires et ses applications,","work_id":"c8b3daf7-99a0-42d6-97c3-22b011c8e84c","year":1975},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Cori, Codage d’une carte planaire et hyperarbres recouvrants, Colloques Internat","work_id":"4d64ea43-0464-41f3-8a4a-953930b21ad4","year":1976}],"snapshot_sha256":"56201d9b76d4195724239339c513cbbbbc53630b241c1e6c8d77afed4b68b151"},"source":{"id":"2605.16741","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:30:08.974253Z","id":"c045a9aa-54c5-424c-9e1b-a7cc4f96ebef","model_set":{"reader":"grok-4.3"},"one_line_summary":"For hypermaps with hyperedges of length at most 3 the Whitney polynomial and spanning hypertrees depend only on the underlying hypergraph and admit deletion-contraction formulas; explicit counts are given for spanning hypertrees in reciprocals of maximum-degree-3 plane graphs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For hypermaps with hyperedges of length at most 3, the Whitney polynomial and spanning hypertree counts depend only on the underlying multi-hypergraph structure.","strongest_claim":"We develop deletion-contraction formulas involving six types of generalized loops and bridges, and we prove results on special substitutions into our Whitney polynomial for hypermaps whose hyperedges have length at most 3.","weakest_assumption":"The computation of the Whitney polynomial and the enumeration of spanning hypertrees for this class of hypermaps depends only on the underlying (multi)hypergraph structure rather than on the embedding."}},"verdict_id":"c045a9aa-54c5-424c-9e1b-a7cc4f96ebef"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c97bb7265ae76c72ddc293a81c84b0bef1d16f89732685dec06e94400fb7fd61","target":"record","created_at":"2026-05-20T00:02:39Z","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":"3e461208e22b426c009818ec2b0a76d00bd3b2ce659643c0120de21541c15e5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T01:37:54Z","title_canon_sha256":"6488361d7b172340e479d2196d3e4cbc871526ed6956cabad8c6a0cb9320ac6f"},"schema_version":"1.0","source":{"id":"2605.16741","kind":"arxiv","version":1}},"canonical_sha256":"92303f366a6fb7bdd264806741c3f71b886e4e226795959340dcd8100d861a31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92303f366a6fb7bdd264806741c3f71b886e4e226795959340dcd8100d861a31","first_computed_at":"2026-05-20T00:02:39.286520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:39.286520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3L4B7HH6vpqT5739eyAOR1reoZ1CoDs5QPFCtGPqqrivk5F6Cdp9oRSK3iSQ9fwZKqJtOwBm3tyogcj2k2F1CQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:39.287405Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c97bb7265ae76c72ddc293a81c84b0bef1d16f89732685dec06e94400fb7fd61","sha256:a6bb2418aab3bffd0ff29a8d7acd6b51be2984a5833fe6b11295a78257b5c3a5"],"state_sha256":"849d69ca0847b68be5476ad31953d4b97ffef19ad6aee4f5943182f55101ef86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2db4LskQTvBvMxMGMO/q2T5qNVtemJi5nrsoHDUC6jyJYHq/2ohiQ+R8nOY6vKkUeeZ4Ccu/CiYGshUwM3DDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:58:09.030641Z","bundle_sha256":"4d748e7737982df6b38a4ad1b1d9b67db3a60b5908cacce6c2542bfbcbcb7a4d"}}