{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5QTGG5GIUTOMOO3627CJGJOIE5","short_pith_number":"pith:5QTGG5GI","canonical_record":{"source":{"id":"2605.15552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-15T02:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"aa0bedc261916d8a5bb2c8000f5de86f94f0f0d5442a5c8d79df4f392270513f","abstract_canon_sha256":"03f0b047b7e37c223a63d7efbfb0e70c5d0122f7f26671a542bc064355980d96"},"schema_version":"1.0"},"canonical_sha256":"ec266374c8a4dcc73b7ed7c49325c8276ffba7165d211ba935fcd5b80a577049","source":{"kind":"arxiv","id":"2605.15552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15552","created_at":"2026-05-20T00:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15552v1","created_at":"2026-05-20T00:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15552","created_at":"2026-05-20T00:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"5QTGG5GIUTOM","created_at":"2026-05-20T00:01:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QTGG5GIUTOMOO36","created_at":"2026-05-20T00:01:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QTGG5GI","created_at":"2026-05-20T00:01:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5QTGG5GIUTOMOO3627CJGJOIE5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-15T02:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"aa0bedc261916d8a5bb2c8000f5de86f94f0f0d5442a5c8d79df4f392270513f","abstract_canon_sha256":"03f0b047b7e37c223a63d7efbfb0e70c5d0122f7f26671a542bc064355980d96"},"schema_version":"1.0"},"canonical_sha256":"ec266374c8a4dcc73b7ed7c49325c8276ffba7165d211ba935fcd5b80a577049","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:05.004497Z","signature_b64":"YNJGffjVX6qVsjMQ15iw0+VcpRvuLPirxIg53Bg4iwTRaiENaYcme4zClzbYpecBB6Sfl7DRELXdyQFcXAq5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec266374c8a4dcc73b7ed7c49325c8276ffba7165d211ba935fcd5b80a577049","last_reissued_at":"2026-05-20T00:01:05.003759Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:05.003759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15552","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:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDbjDfd8+GNq/swpnN4dVIkjNVW1+d9z5VUd/0usAbwDLfXMP+Clom3/DR6nBuQE/qFe///dRTLV4wUibXO6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:58:41.017902Z"},"content_sha256":"bf68d59ae79129ddab31880fddcfda11e4cda661497883eb39e43f0da67cb31c","schema_version":"1.0","event_id":"sha256:bf68d59ae79129ddab31880fddcfda11e4cda661497883eb39e43f0da67cb31c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5QTGG5GIUTOMOO3627CJGJOIE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Do CFLOBDDs Actually Make Use of Linear Structure?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Linear structure works with hierarchy in CFLOBDDs to enable efficient Boolean function compression.","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Meghana Aparna Sistla, Swarat Chaudhuri, Thomas W. Reps","submitted_at":"2026-05-15T02:45:02Z","abstract_excerpt":"Binary Decision Diagrams (BDDs) are a widely used data structure for efficient Boolean function representation. Context-Free-Language Ordered Binary Decision Diagrams (CFLOBDDs) are a recently introduced hierarchical data structure that can, in the best case, exhibit exponential compression over BDDs and double-exponential compression over decision trees. Roughly speaking, a CFLOBDD is a finite, acyclic, non-recursive hierarchical finite-state machine (HFSM) (with some additional restrictions). In this paper, we investigate the role of \\emph{linear structure} in CFLOBDDs -- a property that con"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We demonstrate that linear structure, in conjunction with hierarchical structure, plays a crucial role in enabling CFLOBDDs to achieve efficient function compression. Furthermore, we show that removing linearity from CFLOBDDs leads to a significant blowup in representation size, resulting in degraded performance in the domain of quantum-circuit simulation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That modifications removing linearity from CFLOBDDs isolate the effect of linear structure without altering other representational properties or implementation details that could independently affect size and performance.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Linear structure combined with hierarchy is crucial for CFLOBDD compression efficiency; its removal produces significant blowup and degraded results in quantum simulation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Linear structure works with hierarchy in CFLOBDDs to enable efficient Boolean function compression.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a4ee39fab8b9eff9bfc5f55d11ae3fd23f38b0995d2eba9003d08096f2648f06"},"source":{"id":"2605.15552","kind":"arxiv","version":1},"verdict":{"id":"b82384e1-ca0a-4ade-9688-0b57e369dc55","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:44:01.685786Z","strongest_claim":"We demonstrate that linear structure, in conjunction with hierarchical structure, plays a crucial role in enabling CFLOBDDs to achieve efficient function compression. Furthermore, we show that removing linearity from CFLOBDDs leads to a significant blowup in representation size, resulting in degraded performance in the domain of quantum-circuit simulation.","one_line_summary":"Linear structure combined with hierarchy is crucial for CFLOBDD compression efficiency; its removal produces significant blowup and degraded results in quantum simulation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That modifications removing linearity from CFLOBDDs isolate the effect of linear structure without altering other representational properties or implementation details that could independently affect size and performance.","pith_extraction_headline":"Linear structure works with hierarchy in CFLOBDDs to enable efficient Boolean function compression."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15552/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:34:36.245952Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:19.030538Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:52:17.685139Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:41:56.093985Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"48be86fae37609743341194b438de1cd5836eb5905077a546e4e549f5f8ef95f"},"references":{"count":21,"sample":[{"doi":"","year":2005,"title":"Reps, and Mihalis Yannakakis","work_id":"ecb306ee-6d8f-4c84-a028-100c1ce36787","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Rajeev Alur and Parthasarathy Madhusudan. 2009. Adding nesting structure to words.Journal of the ACM (JACM)56, 3 (2009), 1–43","work_id":"268cef0d-b9aa-4517-bb05-1976a8a8f1cb","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1995,"title":"Anuchit Anuchitanukul, Zohar Manna, and Tomás E. Uribe. 1995. Differential BDDs. InComputer Science Today: Recent Trends and Developments (Lecture Notes in Computer Science, Vol. 1000), J. van Leeuwen","work_id":"c5ce85d8-8779-473d-bbad-a42f58949ea0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Iris Bahar, Erica A","work_id":"0fdc3b47-6496-4e21-8744-fc5f6cfd4df1","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1023/a:1008699807402","year":1997,"title":"Des.10, 2/3 (1997), 171–206","work_id":"380584b7-f7dd-4277-8ad1-134bc579dce7","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":21,"snapshot_sha256":"7f0edb663e3f331243bd56425eb9a3c37c87483eedfef49fe920bd0ea6c344a2","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":"b82384e1-ca0a-4ade-9688-0b57e369dc55"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kUuJdzeg0JvMrpgDaTg0alk6qXjrSKBiW5UbFgi5Gty+cDhqTKydR50lQxnGkKr8cw4hhUMNLTZZGe7AemfRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:58:41.018574Z"},"content_sha256":"eab97afc53765cb61af6194348ca831aa566c42596b6f3775bba9bf0512dd00a","schema_version":"1.0","event_id":"sha256:eab97afc53765cb61af6194348ca831aa566c42596b6f3775bba9bf0512dd00a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QTGG5GIUTOMOO3627CJGJOIE5/bundle.json","state_url":"https://pith.science/pith/5QTGG5GIUTOMOO3627CJGJOIE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QTGG5GIUTOMOO3627CJGJOIE5/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-20T18:58:41Z","links":{"resolver":"https://pith.science/pith/5QTGG5GIUTOMOO3627CJGJOIE5","bundle":"https://pith.science/pith/5QTGG5GIUTOMOO3627CJGJOIE5/bundle.json","state":"https://pith.science/pith/5QTGG5GIUTOMOO3627CJGJOIE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QTGG5GIUTOMOO3627CJGJOIE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5QTGG5GIUTOMOO3627CJGJOIE5","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":"03f0b047b7e37c223a63d7efbfb0e70c5d0122f7f26671a542bc064355980d96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-15T02:45:02Z","title_canon_sha256":"aa0bedc261916d8a5bb2c8000f5de86f94f0f0d5442a5c8d79df4f392270513f"},"schema_version":"1.0","source":{"id":"2605.15552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15552","created_at":"2026-05-20T00:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15552v1","created_at":"2026-05-20T00:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15552","created_at":"2026-05-20T00:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"5QTGG5GIUTOM","created_at":"2026-05-20T00:01:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QTGG5GIUTOMOO36","created_at":"2026-05-20T00:01:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QTGG5GI","created_at":"2026-05-20T00:01:05Z"}],"graph_snapshots":[{"event_id":"sha256:eab97afc53765cb61af6194348ca831aa566c42596b6f3775bba9bf0512dd00a","target":"graph","created_at":"2026-05-20T00:01:05Z","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 demonstrate that linear structure, in conjunction with hierarchical structure, plays a crucial role in enabling CFLOBDDs to achieve efficient function compression. Furthermore, we show that removing linearity from CFLOBDDs leads to a significant blowup in representation size, resulting in degraded performance in the domain of quantum-circuit simulation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That modifications removing linearity from CFLOBDDs isolate the effect of linear structure without altering other representational properties or implementation details that could independently affect size and performance."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Linear structure combined with hierarchy is crucial for CFLOBDD compression efficiency; its removal produces significant blowup and degraded results in quantum simulation."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Linear structure works with hierarchy in CFLOBDDs to enable efficient Boolean function compression."}],"snapshot_sha256":"a4ee39fab8b9eff9bfc5f55d11ae3fd23f38b0995d2eba9003d08096f2648f06"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:34:36.245952Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:19.030538Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:52:17.685139Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:41:56.093985Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15552/integrity.json","findings":[],"snapshot_sha256":"48be86fae37609743341194b438de1cd5836eb5905077a546e4e549f5f8ef95f","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Binary Decision Diagrams (BDDs) are a widely used data structure for efficient Boolean function representation. Context-Free-Language Ordered Binary Decision Diagrams (CFLOBDDs) are a recently introduced hierarchical data structure that can, in the best case, exhibit exponential compression over BDDs and double-exponential compression over decision trees. Roughly speaking, a CFLOBDD is a finite, acyclic, non-recursive hierarchical finite-state machine (HFSM) (with some additional restrictions). In this paper, we investigate the role of \\emph{linear structure} in CFLOBDDs -- a property that con","authors_text":"Meghana Aparna Sistla, Swarat Chaudhuri, Thomas W. Reps","cross_cats":[],"headline":"Linear structure works with hierarchy in CFLOBDDs to enable efficient Boolean function compression.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-15T02:45:02Z","title":"Do CFLOBDDs Actually Make Use of Linear Structure?"},"references":{"count":21,"internal_anchors":0,"resolved_work":21,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Reps, and Mihalis Yannakakis","work_id":"ecb306ee-6d8f-4c84-a028-100c1ce36787","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Rajeev Alur and Parthasarathy Madhusudan. 2009. Adding nesting structure to words.Journal of the ACM (JACM)56, 3 (2009), 1–43","work_id":"268cef0d-b9aa-4517-bb05-1976a8a8f1cb","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Anuchit Anuchitanukul, Zohar Manna, and Tomás E. Uribe. 1995. Differential BDDs. InComputer Science Today: Recent Trends and Developments (Lecture Notes in Computer Science, Vol. 1000), J. van Leeuwen","work_id":"c5ce85d8-8779-473d-bbad-a42f58949ea0","year":1995},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Iris Bahar, Erica A","work_id":"0fdc3b47-6496-4e21-8744-fc5f6cfd4df1","year":null},{"cited_arxiv_id":"","doi":"10.1023/a:1008699807402","is_internal_anchor":false,"ref_index":5,"title":"Des.10, 2/3 (1997), 171–206","work_id":"380584b7-f7dd-4277-8ad1-134bc579dce7","year":1997}],"snapshot_sha256":"7f0edb663e3f331243bd56425eb9a3c37c87483eedfef49fe920bd0ea6c344a2"},"source":{"id":"2605.15552","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:44:01.685786Z","id":"b82384e1-ca0a-4ade-9688-0b57e369dc55","model_set":{"reader":"grok-4.3"},"one_line_summary":"Linear structure combined with hierarchy is crucial for CFLOBDD compression efficiency; its removal produces significant blowup and degraded results in quantum simulation.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Linear structure works with hierarchy in CFLOBDDs to enable efficient Boolean function compression.","strongest_claim":"We demonstrate that linear structure, in conjunction with hierarchical structure, plays a crucial role in enabling CFLOBDDs to achieve efficient function compression. Furthermore, we show that removing linearity from CFLOBDDs leads to a significant blowup in representation size, resulting in degraded performance in the domain of quantum-circuit simulation.","weakest_assumption":"That modifications removing linearity from CFLOBDDs isolate the effect of linear structure without altering other representational properties or implementation details that could independently affect size and performance."}},"verdict_id":"b82384e1-ca0a-4ade-9688-0b57e369dc55"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bf68d59ae79129ddab31880fddcfda11e4cda661497883eb39e43f0da67cb31c","target":"record","created_at":"2026-05-20T00:01:05Z","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":"03f0b047b7e37c223a63d7efbfb0e70c5d0122f7f26671a542bc064355980d96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-15T02:45:02Z","title_canon_sha256":"aa0bedc261916d8a5bb2c8000f5de86f94f0f0d5442a5c8d79df4f392270513f"},"schema_version":"1.0","source":{"id":"2605.15552","kind":"arxiv","version":1}},"canonical_sha256":"ec266374c8a4dcc73b7ed7c49325c8276ffba7165d211ba935fcd5b80a577049","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec266374c8a4dcc73b7ed7c49325c8276ffba7165d211ba935fcd5b80a577049","first_computed_at":"2026-05-20T00:01:05.003759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:05.003759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YNJGffjVX6qVsjMQ15iw0+VcpRvuLPirxIg53Bg4iwTRaiENaYcme4zClzbYpecBB6Sfl7DRELXdyQFcXAq5CA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:05.004497Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf68d59ae79129ddab31880fddcfda11e4cda661497883eb39e43f0da67cb31c","sha256:eab97afc53765cb61af6194348ca831aa566c42596b6f3775bba9bf0512dd00a"],"state_sha256":"7f26c929bc49fdcea532e9721456b40cacb3e8645bd78818e7905c43e9c22b48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mONpP3BInxhnjUtxLxjDJYa+BjZcv7h5AbPFvAsZ0CIvGJVq9Ai4ZB0HDOqsqFNZLTzoZbjfMFi+xgzraG32Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T18:58:41.021576Z","bundle_sha256":"20f2fdb760ae7bd77300932eac926d14d78dd26584928866dfd48cdeb320f5b2"}}