{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:773VP55VVQAC5MJAKJMKK7FLI5","short_pith_number":"pith:773VP55V","canonical_record":{"source":{"id":"2605.15476","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T23:34:01Z","cross_cats_sorted":[],"title_canon_sha256":"fdcfccc6975cd8f6f3e5cd82e3d0e824f9f208bc02b355302918c65c30aeba45","abstract_canon_sha256":"85dfa6a7916aa177775571608610b9263ea442bf66b0e0d1bc8a52513daf07e6"},"schema_version":"1.0"},"canonical_sha256":"fff757f7b5ac002eb1205258a57cab4758535c5c8148fe109b7a9b4350e74cb4","source":{"kind":"arxiv","id":"2605.15476","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15476","created_at":"2026-05-20T00:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15476v1","created_at":"2026-05-20T00:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15476","created_at":"2026-05-20T00:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"773VP55VVQAC","created_at":"2026-05-20T00:01:00Z"},{"alias_kind":"pith_short_16","alias_value":"773VP55VVQAC5MJA","created_at":"2026-05-20T00:01:00Z"},{"alias_kind":"pith_short_8","alias_value":"773VP55V","created_at":"2026-05-20T00:01:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:773VP55VVQAC5MJAKJMKK7FLI5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15476","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T23:34:01Z","cross_cats_sorted":[],"title_canon_sha256":"fdcfccc6975cd8f6f3e5cd82e3d0e824f9f208bc02b355302918c65c30aeba45","abstract_canon_sha256":"85dfa6a7916aa177775571608610b9263ea442bf66b0e0d1bc8a52513daf07e6"},"schema_version":"1.0"},"canonical_sha256":"fff757f7b5ac002eb1205258a57cab4758535c5c8148fe109b7a9b4350e74cb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:00.571949Z","signature_b64":"/VTWnlrGHnJNijf6KgAwWvoIz0gk807LUXUmZ3hz2pPV6SCps8x/T5q1VB7mPSzEx9EBkGAS0tk4wxfFr5xNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fff757f7b5ac002eb1205258a57cab4758535c5c8148fe109b7a9b4350e74cb4","last_reissued_at":"2026-05-20T00:01:00.571191Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:00.571191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15476","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:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZSGlIi1cvltX8JeNKUGvrFm3P+mZBjTBRl6MCUyVjv0abE3eqiVx2mrPt/0uavSXLAZZap5sBBobZhYxdAbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:16:19.586774Z"},"content_sha256":"84a60c833c49f20861aefbadbd86c8ce9cd0fe1a626a199087da108f2ac242e1","schema_version":"1.0","event_id":"sha256:84a60c833c49f20861aefbadbd86c8ce9cd0fe1a626a199087da108f2ac242e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:773VP55VVQAC5MJAKJMKK7FLI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Circuit Synthesis Using an Exact T Library","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Precomputing T-optimal implementations for Boolean functions of up to seven variables, after Clifford canonicalization, yields quantum circuits with substantially lower T counts than AND-count minimization.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hanyu Wang, Jason Cong, Mingfei Yu, Xinrui Wu","submitted_at":"2026-05-14T23:34:01Z","abstract_excerpt":"In fault-tolerant quantum circuit synthesis, T gates supplied via magic states dominate space-time cost, while Clifford gates incur negligible overhead. Conventional flows minimize AND count in an {XOR, AND, NOT} basis as a proxy for T, which neglects phase cancellation and can be far from T-optimal. We instead formulate an exact T synthesis problem and canonicalize Boolean functions under Clifford equivalence. By precomputing T-optimal implementations up to seven variables and developing a customized mapper, we reduce the T count by up to 14.3% on EPFL benchmarks and improve the T counts of s"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By precomputing T-optimal implementations up to seven variables and developing a customized mapper, we reduce the T count by up to 14.3% on EPFL benchmarks and improve the T counts of several cryptographic modules by up to 40%.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the precomputed T-optimal library for functions of at most seven variables, combined with Clifford canonicalization, is sufficient to cover the structure of practical benchmarks without introducing significant mapping overhead or missing better global optimizations.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Exact T-count minimization via precomputed optimal libraries up to 7 variables and Clifford canonicalization yields up to 14.3% T reduction on EPFL benchmarks and 40% on cryptographic modules.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Precomputing T-optimal implementations for Boolean functions of up to seven variables, after Clifford canonicalization, yields quantum circuits with substantially lower T counts than AND-count minimization.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f52d4cc3e96d019b72d0437cdf707ead9b4d43e8b8039fd9970ad1ca5fddeffc"},"source":{"id":"2605.15476","kind":"arxiv","version":1},"verdict":{"id":"9d951eb2-4be9-4d78-9221-ffe12a245f81","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T14:31:07.370423Z","strongest_claim":"By precomputing T-optimal implementations up to seven variables and developing a customized mapper, we reduce the T count by up to 14.3% on EPFL benchmarks and improve the T counts of several cryptographic modules by up to 40%.","one_line_summary":"Exact T-count minimization via precomputed optimal libraries up to 7 variables and Clifford canonicalization yields up to 14.3% T reduction on EPFL benchmarks and 40% on cryptographic modules.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the precomputed T-optimal library for functions of at most seven variables, combined with Clifford canonicalization, is sufficient to cover the structure of practical benchmarks without introducing significant mapping overhead or missing better global optimizations.","pith_extraction_headline":"Precomputing T-optimal implementations for Boolean functions of up to seven variables, after Clifford canonicalization, yields quantum circuits with substantially lower T counts than AND-count minimization."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15476/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T15:22:05.600175Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.559659Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:37:42.048959Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.083693Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.408077Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.659343Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ac301cd46e614227cdf7f31d649e1d839603a34cf686633c2e14803e011ed6c9"},"references":{"count":43,"sample":[{"doi":"","year":2015,"title":"L. Amarú, P.-E. Gaillardon, and G. De Micheli. The EPFL combinational bench- mark suite.Hypotenuse, 256(128):214335, 2015","work_id":"d516af39-0d65-4b3a-af0a-e17956ada11a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"M. Amy and M. Mosca. T-count optimization and Reed–Muller codes.IEEE Transactions on Information Theory, 65(8):4771–4784, 2019","work_id":"fc8048ad-f3d4-4661-98c8-611f58b9ab96","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"M. Amy and N. J. Ross. Phase-state duality in reversible circuit design.Physical Review A, 104(5):052602, 2021","work_id":"3d6bb738-ba29-4524-8e7e-5714c5ac595e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell, et al. Quantum supremacy using a pro- grammable superconducting processor.Nature, 57","work_id":"ed7b25bb-5681-44f2-a093-d0779980c8d7","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven. Encoding electronic spectra in quantum circuits with linear T complexity.Physical Review X, 8(4):041015, 20","work_id":"3a78ff91-57d2-4e77-be03-0e716b00724b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":43,"snapshot_sha256":"b2d8a5c45b73d4d50df5e0fa92b0d1f7699df672aa6c585a372718171db37374","internal_anchors":4},"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":"9d951eb2-4be9-4d78-9221-ffe12a245f81"},"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:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWZ3G0SDZ/FH8tOOzhAc6TRkbsH3aiwvDUb8eBoFX6bY6jO6a2NrcKNj8apeOAqUzUDRCXa+KqQqJiF5dPxSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:16:19.587550Z"},"content_sha256":"ea036eab005866597d6b9c4aecbddddf23ba3ea3661840535319adf2bc78db5b","schema_version":"1.0","event_id":"sha256:ea036eab005866597d6b9c4aecbddddf23ba3ea3661840535319adf2bc78db5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/773VP55VVQAC5MJAKJMKK7FLI5/bundle.json","state_url":"https://pith.science/pith/773VP55VVQAC5MJAKJMKK7FLI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/773VP55VVQAC5MJAKJMKK7FLI5/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-26T19:16:19Z","links":{"resolver":"https://pith.science/pith/773VP55VVQAC5MJAKJMKK7FLI5","bundle":"https://pith.science/pith/773VP55VVQAC5MJAKJMKK7FLI5/bundle.json","state":"https://pith.science/pith/773VP55VVQAC5MJAKJMKK7FLI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/773VP55VVQAC5MJAKJMKK7FLI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:773VP55VVQAC5MJAKJMKK7FLI5","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":"85dfa6a7916aa177775571608610b9263ea442bf66b0e0d1bc8a52513daf07e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T23:34:01Z","title_canon_sha256":"fdcfccc6975cd8f6f3e5cd82e3d0e824f9f208bc02b355302918c65c30aeba45"},"schema_version":"1.0","source":{"id":"2605.15476","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15476","created_at":"2026-05-20T00:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15476v1","created_at":"2026-05-20T00:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15476","created_at":"2026-05-20T00:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"773VP55VVQAC","created_at":"2026-05-20T00:01:00Z"},{"alias_kind":"pith_short_16","alias_value":"773VP55VVQAC5MJA","created_at":"2026-05-20T00:01:00Z"},{"alias_kind":"pith_short_8","alias_value":"773VP55V","created_at":"2026-05-20T00:01:00Z"}],"graph_snapshots":[{"event_id":"sha256:ea036eab005866597d6b9c4aecbddddf23ba3ea3661840535319adf2bc78db5b","target":"graph","created_at":"2026-05-20T00:01:00Z","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":"By precomputing T-optimal implementations up to seven variables and developing a customized mapper, we reduce the T count by up to 14.3% on EPFL benchmarks and improve the T counts of several cryptographic modules by up to 40%."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the precomputed T-optimal library for functions of at most seven variables, combined with Clifford canonicalization, is sufficient to cover the structure of practical benchmarks without introducing significant mapping overhead or missing better global optimizations."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Exact T-count minimization via precomputed optimal libraries up to 7 variables and Clifford canonicalization yields up to 14.3% T reduction on EPFL benchmarks and 40% on cryptographic modules."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Precomputing T-optimal implementations for Boolean functions of up to seven variables, after Clifford canonicalization, yields quantum circuits with substantially lower T counts than AND-count minimization."}],"snapshot_sha256":"f52d4cc3e96d019b72d0437cdf707ead9b4d43e8b8039fd9970ad1ca5fddeffc"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T15:22:05.600175Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.559659Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T14:37:42.048959Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.083693Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.408077Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.659343Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15476/integrity.json","findings":[],"snapshot_sha256":"ac301cd46e614227cdf7f31d649e1d839603a34cf686633c2e14803e011ed6c9","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In fault-tolerant quantum circuit synthesis, T gates supplied via magic states dominate space-time cost, while Clifford gates incur negligible overhead. Conventional flows minimize AND count in an {XOR, AND, NOT} basis as a proxy for T, which neglects phase cancellation and can be far from T-optimal. We instead formulate an exact T synthesis problem and canonicalize Boolean functions under Clifford equivalence. By precomputing T-optimal implementations up to seven variables and developing a customized mapper, we reduce the T count by up to 14.3% on EPFL benchmarks and improve the T counts of s","authors_text":"Hanyu Wang, Jason Cong, Mingfei Yu, Xinrui Wu","cross_cats":[],"headline":"Precomputing T-optimal implementations for Boolean functions of up to seven variables, after Clifford canonicalization, yields quantum circuits with substantially lower T counts than AND-count minimization.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T23:34:01Z","title":"Quantum Circuit Synthesis Using an Exact T Library"},"references":{"count":43,"internal_anchors":4,"resolved_work":43,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"L. Amarú, P.-E. Gaillardon, and G. De Micheli. The EPFL combinational bench- mark suite.Hypotenuse, 256(128):214335, 2015","work_id":"d516af39-0d65-4b3a-af0a-e17956ada11a","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"M. Amy and M. Mosca. T-count optimization and Reed–Muller codes.IEEE Transactions on Information Theory, 65(8):4771–4784, 2019","work_id":"fc8048ad-f3d4-4661-98c8-611f58b9ab96","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"M. Amy and N. J. Ross. Phase-state duality in reversible circuit design.Physical Review A, 104(5):052602, 2021","work_id":"3d6bb738-ba29-4524-8e7e-5714c5ac595e","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell, et al. Quantum supremacy using a pro- grammable superconducting processor.Nature, 57","work_id":"ed7b25bb-5681-44f2-a093-d0779980c8d7","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven. Encoding electronic spectra in quantum circuits with linear T complexity.Physical Review X, 8(4):041015, 20","work_id":"3a78ff91-57d2-4e77-be03-0e716b00724b","year":2018}],"snapshot_sha256":"b2d8a5c45b73d4d50df5e0fa92b0d1f7699df672aa6c585a372718171db37374"},"source":{"id":"2605.15476","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T14:31:07.370423Z","id":"9d951eb2-4be9-4d78-9221-ffe12a245f81","model_set":{"reader":"grok-4.3"},"one_line_summary":"Exact T-count minimization via precomputed optimal libraries up to 7 variables and Clifford canonicalization yields up to 14.3% T reduction on EPFL benchmarks and 40% on cryptographic modules.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Precomputing T-optimal implementations for Boolean functions of up to seven variables, after Clifford canonicalization, yields quantum circuits with substantially lower T counts than AND-count minimization.","strongest_claim":"By precomputing T-optimal implementations up to seven variables and developing a customized mapper, we reduce the T count by up to 14.3% on EPFL benchmarks and improve the T counts of several cryptographic modules by up to 40%.","weakest_assumption":"That the precomputed T-optimal library for functions of at most seven variables, combined with Clifford canonicalization, is sufficient to cover the structure of practical benchmarks without introducing significant mapping overhead or missing better global optimizations."}},"verdict_id":"9d951eb2-4be9-4d78-9221-ffe12a245f81"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:84a60c833c49f20861aefbadbd86c8ce9cd0fe1a626a199087da108f2ac242e1","target":"record","created_at":"2026-05-20T00:01:00Z","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":"85dfa6a7916aa177775571608610b9263ea442bf66b0e0d1bc8a52513daf07e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T23:34:01Z","title_canon_sha256":"fdcfccc6975cd8f6f3e5cd82e3d0e824f9f208bc02b355302918c65c30aeba45"},"schema_version":"1.0","source":{"id":"2605.15476","kind":"arxiv","version":1}},"canonical_sha256":"fff757f7b5ac002eb1205258a57cab4758535c5c8148fe109b7a9b4350e74cb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fff757f7b5ac002eb1205258a57cab4758535c5c8148fe109b7a9b4350e74cb4","first_computed_at":"2026-05-20T00:01:00.571191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:00.571191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/VTWnlrGHnJNijf6KgAwWvoIz0gk807LUXUmZ3hz2pPV6SCps8x/T5q1VB7mPSzEx9EBkGAS0tk4wxfFr5xNCQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:00.571949Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15476","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84a60c833c49f20861aefbadbd86c8ce9cd0fe1a626a199087da108f2ac242e1","sha256:ea036eab005866597d6b9c4aecbddddf23ba3ea3661840535319adf2bc78db5b"],"state_sha256":"10edc592decc2bc9051138ed7eadd682e3aafa7fe8ca0f18bf7390b26c8e69fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Te71/LIHpSuiAcudHyKAi3DLmrvxM80p4buMK582BHqtICDUM8aNXnDoHDYGAqKdPKF6xaOx8x/MBvypXcRwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:16:19.590887Z","bundle_sha256":"b79198339748c996931359974c164450ffb73f35da17e7323c12b39cd3c5e067"}}