{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EVNZXPZVDXCEVPYA7UCOX6ZYNZ","short_pith_number":"pith:EVNZXPZV","canonical_record":{"source":{"id":"2608.05688","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-06T07:28:20Z","cross_cats_sorted":["cs.IT","math.CO","math.GR","math.IT","math.RT"],"title_canon_sha256":"e32f908b34177f743888cc610e81726af99eac7fdbd7e842be2017a9b69bd6a2","abstract_canon_sha256":"ed17c8d67fc273225f8c1e41f8a8a264c137513e748df7774cddec1a66c0fd09"},"schema_version":"1.0"},"canonical_sha256":"255b9bbf351dc44abf00fd04ebfb386e4cd4f265a1e6aad0c60098ed41c9bc94","source":{"kind":"arxiv","id":"2608.05688","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.05688","created_at":"2026-08-07T00:52:21Z"},{"alias_kind":"arxiv_version","alias_value":"2608.05688v1","created_at":"2026-08-07T00:52:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05688","created_at":"2026-08-07T00:52:21Z"},{"alias_kind":"pith_short_12","alias_value":"EVNZXPZVDXCE","created_at":"2026-08-07T00:52:21Z"},{"alias_kind":"pith_short_16","alias_value":"EVNZXPZVDXCEVPYA","created_at":"2026-08-07T00:52:21Z"},{"alias_kind":"pith_short_8","alias_value":"EVNZXPZV","created_at":"2026-08-07T00:52:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EVNZXPZVDXCEVPYA7UCOX6ZYNZ","target":"record","payload":{"canonical_record":{"source":{"id":"2608.05688","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-06T07:28:20Z","cross_cats_sorted":["cs.IT","math.CO","math.GR","math.IT","math.RT"],"title_canon_sha256":"e32f908b34177f743888cc610e81726af99eac7fdbd7e842be2017a9b69bd6a2","abstract_canon_sha256":"ed17c8d67fc273225f8c1e41f8a8a264c137513e748df7774cddec1a66c0fd09"},"schema_version":"1.0"},"canonical_sha256":"255b9bbf351dc44abf00fd04ebfb386e4cd4f265a1e6aad0c60098ed41c9bc94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:52:21.531574Z","signature_b64":"dfcQyT6F8zedCpBFs+F6gM/ooI9DfWOrf2z4yopfmiexHts3YTUR0T7Og6z7v/IW6aoozFD3Onu+/ZcxKX+tDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"255b9bbf351dc44abf00fd04ebfb386e4cd4f265a1e6aad0c60098ed41c9bc94","last_reissued_at":"2026-08-07T00:52:21.530012Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:52:21.530012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.05688","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-08-07T00:52:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z404v+/K7Oqi5VlDx51JUh+C49N0N/Gr2hT8A8TqASFRWKv5Rnw4RhSTY+cvxxdkbGZBWpGWaG1X8bORI35MAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:56:20.765628Z"},"content_sha256":"90214b6a73fb0db40ef97ddbe2e5ea689cf2d6cb30655cd8331ba6b4ed219e45","schema_version":"1.0","event_id":"sha256:90214b6a73fb0db40ef97ddbe2e5ea689cf2d6cb30655cd8331ba6b4ed219e45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EVNZXPZVDXCEVPYA7UCOX6ZYNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond transversality: structure of Clifford circuits for CSS codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.CO","math.GR","math.IT","math.RT"],"primary_cat":"quant-ph","authors_text":"Victor V. Albert","submitted_at":"2026-08-06T07:28:20Z","abstract_excerpt":"We characterize four groups of Clifford circuits for Calderbank--Shor--Steane (CSS) codes that are relevant to fault-tolerant logical operations. First, we show that every code-preserving Clifford circuit is a product of Z-diagonal circuits, composed of S and CZ gates, and their X-basis analogues. Second, we define the two-fold transversal group, generated by depth-one two-local code-preserving circuits, and show that each of its elements can be expressed as a product of layers consisting of either Z-diagonal, X-diagonal, or CNOT gates. As a corollary, every transversal gate is a product of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05688","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.05688/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-07T00:52:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1ZbblcFhjx3kBij15TmH65pn05Ja+2vwtppSEFmsl4a7lyzQRFS5zoBBPH/HaXLdjYIFnKrhyNqzJ+MuPSzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:56:20.766661Z"},"content_sha256":"bd5f66df039465fc10b07f8e15052a48acea3af657f9b2529653182c8c5cc18a","schema_version":"1.0","event_id":"sha256:bd5f66df039465fc10b07f8e15052a48acea3af657f9b2529653182c8c5cc18a"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:EVNZXPZVDXCEVPYA7UCOX6ZYNZ","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s00220-026-05570-z) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"N. P. Breuckmann, M. Davydova, J. N. Eberhardt, and N. Tantivasadakarn, Cups and gates i: Cohomology invariants and logical quantum operations, Communi- cations in Mathematical Physics407, 10.1007/s00220- 026-05570-z (2026)","arxiv_id":"2608.05688","detector":"doi_compliance","evidence":{"ref_index":35,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s00220-","reconstructed_doi":"10.1007/s00220-026-05570-z"},"severity":"advisory","ref_index":35,"audited_at":"2026-08-08T01:08:07.988123Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s00220-026-05570-z","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a436cfdddc5be699c08926c080530f01bb975144cd39664c5b54051bab1bf57d","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18609,"payload_sha256":"1f2f44f58035413c7b131244d136b13033557f2ceaa85f5945142a48fe714f87","signature_b64":"IOEOe+JvwtkdAL+M+nPKr1y6f9qJ48S0AUET9J0gE6PTtYSxDeoE/yZoY7GxokD6F6XEakpcQramg5wVb5KFAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-08T01:08:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lN4K3t7LXX++tFl7qvRek/XXhmGR4lAuj3xYhy2vI7a2eIXLFWEGrXK3XLsbwGdbT0MQvU2wSYnfwb1sZOVyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:56:20.770715Z"},"content_sha256":"b3be3ea0bff665f2cb48b177021ea61ab1c07bbf998a4fc0a0883413e1c1ae47","schema_version":"1.0","event_id":"sha256:b3be3ea0bff665f2cb48b177021ea61ab1c07bbf998a4fc0a0883413e1c1ae47"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:EVNZXPZVDXCEVPYA7UCOX6ZYNZ","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/wcxs-w69t resolves to 'Non-Clifford and Parallelizable Fault-Tolerant Logical Gates on Constant and Almost-Constant Rate Homological Quantum Lo'. A reader following the printed text alone cannot reach it.","snippet":"G. Zhu, S. Sikander, E. Portnoy, A. W. Cross, and B. J. Brown, Non-clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate ho- mological quantum low-density parity-check codes via higher symmetries, PRX","arxiv_id":"2608.05688","detector":"doi_compliance","evidence":{"ref_index":34,"verdict_class":"incontrovertible","resolved_title":"Non-Clifford and Parallelizable Fault-Tolerant Logical Gates on Constant and Almost-Constant Rate Homological Quantum Low-Density Parity-Check Codes via Higher Symmetries","printed_excerpt":"10.1103/wcxs-","reconstructed_doi":"10.1103/wcxs-w69t"},"severity":"advisory","ref_index":34,"audited_at":"2026-08-08T01:08:07.988123Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/wcxs-w69t","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"43ce1b1f19b591add06d08fc778e077d0cdc2d6e4e116564a49432c1592433e0","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Non-Clifford and Parallelizable Fault-Tolerant Logical Gates on Constant and Almost-Constant Rate Homological Quantum Low-Density Parity-Check Codes via Higher Symmetries","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18608,"payload_sha256":"b4d20f8fb421f02391776b36398e0f867cb7c12b7029840464e5fb18bda5db4c","signature_b64":"GmyQr7zm9yvIGISleahHT5T13Y7Yq/Q9V6g7sGq8tintlw+ME+ftUsmbLP8Fd+uR/E07G2Lf7U+kIAHgIjxCCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-08T01:08:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akhlWAodHFBocfSPa3m3wOIGYhSQeawg012TJ+FeUEFEFhaPUHYmEUFxTxfEL/Y7mQ6K1hwVf3Y6ycPjm80IAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:56:20.771405Z"},"content_sha256":"1067982b1d4720cda7f575435d06b9a5007b97af842f096d47cb29d887283f98","schema_version":"1.0","event_id":"sha256:1067982b1d4720cda7f575435d06b9a5007b97af842f096d47cb29d887283f98"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:EVNZXPZVDXCEVPYA7UCOX6ZYNZ","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/y14y-7kp3 resolves to 'No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits'. A reader following the printed text alone cannot reach it.","snippet":"Anonymous, No-go theorem on fault tolerant gadgets for multiple logical qubits, PRX Quantum 10.1103/y14y- 7kp3 (2026)","arxiv_id":"2608.05688","detector":"doi_compliance","evidence":{"ref_index":32,"verdict_class":"incontrovertible","resolved_title":"No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits","printed_excerpt":"10.1103/y14y-","reconstructed_doi":"10.1103/y14y-7kp3"},"severity":"advisory","ref_index":32,"audited_at":"2026-08-08T01:08:07.988123Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/y14y-7kp3","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"b6b4fb6c470f5935bc6d66d86e021b204030ead0ab6ea9aef486fa1a0b627b59","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18607,"payload_sha256":"f1af8a556b4ffa7f2de45a2d9186b50f4f92007cd30edc4641d1d22257685c3b","signature_b64":"vcAZF4r07MbDhvnh68KCWQtVfjMtZ7h8SOB7ZTUYkTgfxMfbnPmKy+UhdCt97hR6FxeNr2MB7C/W8paUpyvdCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-08T01:08:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqMwNdGiPgbc4ZrKoZGi+jZY5Rghzsu3O7aOnVs97pLvoWEmIID+S42wtr5Pn/+H3zr5FDclxD+JDqc0rfRDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:56:20.772047Z"},"content_sha256":"9525c6968088b8cb6d2f7e41696539ec0e1f958b9eec5ed4965617f72abc60d5","schema_version":"1.0","event_id":"sha256:9525c6968088b8cb6d2f7e41696539ec0e1f958b9eec5ed4965617f72abc60d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EVNZXPZVDXCEVPYA7UCOX6ZYNZ/bundle.json","state_url":"https://pith.science/pith/EVNZXPZVDXCEVPYA7UCOX6ZYNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EVNZXPZVDXCEVPYA7UCOX6ZYNZ/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-08-10T09:56:20Z","links":{"resolver":"https://pith.science/pith/EVNZXPZVDXCEVPYA7UCOX6ZYNZ","bundle":"https://pith.science/pith/EVNZXPZVDXCEVPYA7UCOX6ZYNZ/bundle.json","state":"https://pith.science/pith/EVNZXPZVDXCEVPYA7UCOX6ZYNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EVNZXPZVDXCEVPYA7UCOX6ZYNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EVNZXPZVDXCEVPYA7UCOX6ZYNZ","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ed17c8d67fc273225f8c1e41f8a8a264c137513e748df7774cddec1a66c0fd09","cross_cats_sorted":["cs.IT","math.CO","math.GR","math.IT","math.RT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-06T07:28:20Z","title_canon_sha256":"e32f908b34177f743888cc610e81726af99eac7fdbd7e842be2017a9b69bd6a2"},"schema_version":"1.0","source":{"id":"2608.05688","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.05688","created_at":"2026-08-07T00:52:21Z"},{"alias_kind":"arxiv_version","alias_value":"2608.05688v1","created_at":"2026-08-07T00:52:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05688","created_at":"2026-08-07T00:52:21Z"},{"alias_kind":"pith_short_12","alias_value":"EVNZXPZVDXCE","created_at":"2026-08-07T00:52:21Z"},{"alias_kind":"pith_short_16","alias_value":"EVNZXPZVDXCEVPYA","created_at":"2026-08-07T00:52:21Z"},{"alias_kind":"pith_short_8","alias_value":"EVNZXPZV","created_at":"2026-08-07T00:52:21Z"}],"graph_snapshots":[{"event_id":"sha256:bd5f66df039465fc10b07f8e15052a48acea3af657f9b2529653182c8c5cc18a","target":"graph","created_at":"2026-08-07T00:52:21Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.05688/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We characterize four groups of Clifford circuits for Calderbank--Shor--Steane (CSS) codes that are relevant to fault-tolerant logical operations. First, we show that every code-preserving Clifford circuit is a product of Z-diagonal circuits, composed of S and CZ gates, and their X-basis analogues. Second, we define the two-fold transversal group, generated by depth-one two-local code-preserving circuits, and show that each of its elements can be expressed as a product of layers consisting of either Z-diagonal, X-diagonal, or CNOT gates. As a corollary, every transversal gate is a product of th","authors_text":"Victor V. Albert","cross_cats":["cs.IT","math.CO","math.GR","math.IT","math.RT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-06T07:28:20Z","title":"Beyond transversality: structure of Clifford circuits for CSS codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05688","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:90214b6a73fb0db40ef97ddbe2e5ea689cf2d6cb30655cd8331ba6b4ed219e45","target":"record","created_at":"2026-08-07T00:52:21Z","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":"ed17c8d67fc273225f8c1e41f8a8a264c137513e748df7774cddec1a66c0fd09","cross_cats_sorted":["cs.IT","math.CO","math.GR","math.IT","math.RT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-06T07:28:20Z","title_canon_sha256":"e32f908b34177f743888cc610e81726af99eac7fdbd7e842be2017a9b69bd6a2"},"schema_version":"1.0","source":{"id":"2608.05688","kind":"arxiv","version":1}},"canonical_sha256":"255b9bbf351dc44abf00fd04ebfb386e4cd4f265a1e6aad0c60098ed41c9bc94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"255b9bbf351dc44abf00fd04ebfb386e4cd4f265a1e6aad0c60098ed41c9bc94","first_computed_at":"2026-08-07T00:52:21.530012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-07T00:52:21.530012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dfcQyT6F8zedCpBFs+F6gM/ooI9DfWOrf2z4yopfmiexHts3YTUR0T7Og6z7v/IW6aoozFD3Onu+/ZcxKX+tDg==","signature_status":"signed_v1","signed_at":"2026-08-07T00:52:21.531574Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.05688","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:1067982b1d4720cda7f575435d06b9a5007b97af842f096d47cb29d887283f98","sha256:9525c6968088b8cb6d2f7e41696539ec0e1f958b9eec5ed4965617f72abc60d5","sha256:b3be3ea0bff665f2cb48b177021ea61ab1c07bbf998a4fc0a0883413e1c1ae47"]}],"invalid_events":[],"applied_event_ids":["sha256:90214b6a73fb0db40ef97ddbe2e5ea689cf2d6cb30655cd8331ba6b4ed219e45","sha256:bd5f66df039465fc10b07f8e15052a48acea3af657f9b2529653182c8c5cc18a"],"state_sha256":"19f28becedbc145109102e9a6d6ca45ade490ee579b08682ea4e1cf29a25ccf3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWAy+0aYhmSrWA3OsudaiOURf9wBLoq2zIiuT9eiwbkwWjj51lxPTVGpB+aimjyiZdl30tJoWQA6grsEbrvODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T09:56:20.776582Z","bundle_sha256":"da98803ff6eb202977614b3e6b55cecf683949c05506426441eecc85fac31641"}}