{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3RLYC64EYCYHCPK3IB7XSCLJLL","short_pith_number":"pith:3RLYC64E","canonical_record":{"source":{"id":"2608.03825","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T15:34:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"253e543c6d8f4f90d4202d9ce28597a90a84eb25156ff920d96b00222f954706","abstract_canon_sha256":"dbca944398b2f3b063bd1067f09ad0c8115ba04c5457690c30784a4e2e1b8aeb"},"schema_version":"1.0"},"canonical_sha256":"dc57817b84c0b0713d5b407f7909695ac6a633939c75ad9005683aa66c4d62e4","source":{"kind":"arxiv","id":"2608.03825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.03825","created_at":"2026-08-05T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"2608.03825v1","created_at":"2026-08-05T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03825","created_at":"2026-08-05T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"3RLYC64EYCYH","created_at":"2026-08-05T01:37:12Z"},{"alias_kind":"pith_short_16","alias_value":"3RLYC64EYCYHCPK3","created_at":"2026-08-05T01:37:12Z"},{"alias_kind":"pith_short_8","alias_value":"3RLYC64E","created_at":"2026-08-05T01:37:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3RLYC64EYCYHCPK3IB7XSCLJLL","target":"record","payload":{"canonical_record":{"source":{"id":"2608.03825","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T15:34:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"253e543c6d8f4f90d4202d9ce28597a90a84eb25156ff920d96b00222f954706","abstract_canon_sha256":"dbca944398b2f3b063bd1067f09ad0c8115ba04c5457690c30784a4e2e1b8aeb"},"schema_version":"1.0"},"canonical_sha256":"dc57817b84c0b0713d5b407f7909695ac6a633939c75ad9005683aa66c4d62e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T01:37:12.654031Z","signature_b64":"naEWDIqNJ/69uQ3OXjDO6/rm1/1htUMPPjS1Im4vTEN+fc99Fcl13qDMkZkcqAblOsz/+4nyS2dOh5+2kxGnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc57817b84c0b0713d5b407f7909695ac6a633939c75ad9005683aa66c4d62e4","last_reissued_at":"2026-08-05T01:37:12.652098Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T01:37:12.652098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.03825","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-05T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMBgJeKG45ecq9ngVfY86xXfrGKlTEiCdWX6y3u7XaRDIXElKlOHwLeu6pQ634FstAx2fWVFZ6dfudFTyRgEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:32:12.925258Z"},"content_sha256":"1d020d19c4b4bf50db0899d25ccf53ed54f4624a0ec53653bcb83aff95b30b4b","schema_version":"1.0","event_id":"sha256:1d020d19c4b4bf50db0899d25ccf53ed54f4624a0ec53653bcb83aff95b30b4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3RLYC64EYCYHCPK3IB7XSCLJLL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CNOT-Distance is NP-complete under all-to-all connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Antonio Acuaviva, Arturo Acuaviva, Pablo Acuaviva","submitted_at":"2026-08-04T15:34:26Z","abstract_excerpt":"Given $A\\in\\operatorname{GL}(N,2)$ and an integer $K$, we ask whether $A$ can be implemented by at most $K$ CNOT gates on fixed labelled wires with all-to-all connectivity. We prove that this problem is NP-complete. From a finite simple graph $G=(V,E)$, we construct an upper-unitriangular matrix $A_G\\in\\operatorname{GL}(2|V|+|E|+1,2)$ satisfying $\\ell_{\\mathrm{CNOT}}(A_G)=2|V|+2|E|+\\tau(G)$, where $\\tau(G)$ is the minimum vertex-cover size. Each target matrix has $O(N)$ nonzero entries and row Hamming weight at most four. The lower bound unfolds an arbitrary CNOT circuit into an XOR directed a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03825","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.03825/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-05T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w118MtHgOLBDaRMuqFMS6mWoC0ifpH0FJKeETy1xPVupqXU2jjIPVl9Oh004mPfBa/T0c0ykAL8K4fXZHXH4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:32:12.926221Z"},"content_sha256":"36e8f7de34640ede1518ae80851d9275e41e94ae53dc25cbef76e7ba46125e5a","schema_version":"1.0","event_id":"sha256:36e8f7de34640ede1518ae80851d9275e41e94ae53dc25cbef76e7ba46125e5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/bundle.json","state_url":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/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-06T02:32:12Z","links":{"resolver":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL","bundle":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/bundle.json","state":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3RLYC64EYCYHCPK3IB7XSCLJLL","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":"dbca944398b2f3b063bd1067f09ad0c8115ba04c5457690c30784a4e2e1b8aeb","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T15:34:26Z","title_canon_sha256":"253e543c6d8f4f90d4202d9ce28597a90a84eb25156ff920d96b00222f954706"},"schema_version":"1.0","source":{"id":"2608.03825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.03825","created_at":"2026-08-05T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"2608.03825v1","created_at":"2026-08-05T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03825","created_at":"2026-08-05T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"3RLYC64EYCYH","created_at":"2026-08-05T01:37:12Z"},{"alias_kind":"pith_short_16","alias_value":"3RLYC64EYCYHCPK3","created_at":"2026-08-05T01:37:12Z"},{"alias_kind":"pith_short_8","alias_value":"3RLYC64E","created_at":"2026-08-05T01:37:12Z"}],"graph_snapshots":[{"event_id":"sha256:36e8f7de34640ede1518ae80851d9275e41e94ae53dc25cbef76e7ba46125e5a","target":"graph","created_at":"2026-08-05T01:37:12Z","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.03825/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given $A\\in\\operatorname{GL}(N,2)$ and an integer $K$, we ask whether $A$ can be implemented by at most $K$ CNOT gates on fixed labelled wires with all-to-all connectivity. We prove that this problem is NP-complete. From a finite simple graph $G=(V,E)$, we construct an upper-unitriangular matrix $A_G\\in\\operatorname{GL}(2|V|+|E|+1,2)$ satisfying $\\ell_{\\mathrm{CNOT}}(A_G)=2|V|+2|E|+\\tau(G)$, where $\\tau(G)$ is the minimum vertex-cover size. Each target matrix has $O(N)$ nonzero entries and row Hamming weight at most four. The lower bound unfolds an arbitrary CNOT circuit into an XOR directed a","authors_text":"Antonio Acuaviva, Arturo Acuaviva, Pablo Acuaviva","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03825","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:1d020d19c4b4bf50db0899d25ccf53ed54f4624a0ec53653bcb83aff95b30b4b","target":"record","created_at":"2026-08-05T01:37:12Z","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":"dbca944398b2f3b063bd1067f09ad0c8115ba04c5457690c30784a4e2e1b8aeb","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T15:34:26Z","title_canon_sha256":"253e543c6d8f4f90d4202d9ce28597a90a84eb25156ff920d96b00222f954706"},"schema_version":"1.0","source":{"id":"2608.03825","kind":"arxiv","version":1}},"canonical_sha256":"dc57817b84c0b0713d5b407f7909695ac6a633939c75ad9005683aa66c4d62e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc57817b84c0b0713d5b407f7909695ac6a633939c75ad9005683aa66c4d62e4","first_computed_at":"2026-08-05T01:37:12.652098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-05T01:37:12.652098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"naEWDIqNJ/69uQ3OXjDO6/rm1/1htUMPPjS1Im4vTEN+fc99Fcl13qDMkZkcqAblOsz/+4nyS2dOh5+2kxGnDw==","signature_status":"signed_v1","signed_at":"2026-08-05T01:37:12.654031Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.03825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d020d19c4b4bf50db0899d25ccf53ed54f4624a0ec53653bcb83aff95b30b4b","sha256:36e8f7de34640ede1518ae80851d9275e41e94ae53dc25cbef76e7ba46125e5a"],"state_sha256":"5fb16deeaa5eefcdb5f8fe534b5e41e7c5cb8dd46c3fb37b7e3d5b4522d92a7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+W39X5u6FblMDpuv+w5xyrfBaoig9fSWYCd1SvK9KSnWrjcJT7GGxJ5xyWOtb2TOUj+4+iWfIPIn8RlKCPGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T02:32:12.933914Z","bundle_sha256":"9c16a7a31704d45918f7637040d4e965eea440210c6ab074039c8844ab95bdea"}}