{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LUSR5NZW6YFIC2PQIRX76M2FAT","short_pith_number":"pith:LUSR5NZW","canonical_record":{"source":{"id":"2607.28598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:48:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f377a4cf4e784792110301da0821b8918f1091e34890052bacb32d76d02ff7d5","abstract_canon_sha256":"e6552726da22d5bcfd39867f9e97faf2040c8c7b8e8065d607aae0ccc789d244"},"schema_version":"1.0"},"canonical_sha256":"5d251eb736f60a8169f0446fff334504f69238b69f080b325ef6934880b13920","source":{"kind":"arxiv","id":"2607.28598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28598","created_at":"2026-07-31T01:39:03Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28598v1","created_at":"2026-07-31T01:39:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28598","created_at":"2026-07-31T01:39:03Z"},{"alias_kind":"pith_short_12","alias_value":"LUSR5NZW6YFI","created_at":"2026-07-31T01:39:03Z"},{"alias_kind":"pith_short_16","alias_value":"LUSR5NZW6YFIC2PQ","created_at":"2026-07-31T01:39:03Z"},{"alias_kind":"pith_short_8","alias_value":"LUSR5NZW","created_at":"2026-07-31T01:39:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LUSR5NZW6YFIC2PQIRX76M2FAT","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:48:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f377a4cf4e784792110301da0821b8918f1091e34890052bacb32d76d02ff7d5","abstract_canon_sha256":"e6552726da22d5bcfd39867f9e97faf2040c8c7b8e8065d607aae0ccc789d244"},"schema_version":"1.0"},"canonical_sha256":"5d251eb736f60a8169f0446fff334504f69238b69f080b325ef6934880b13920","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d251eb736f60a8169f0446fff334504f69238b69f080b325ef6934880b13920","last_reissued_at":"2026-07-31T01:39:03.873407Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:39:03.873407Z"},"source_kind":"arxiv","source_id":"2607.28598","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-07-31T01:39:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGKy2UIYc/a+3GGRbOCPcvOiJqT+i5ptjIm/wvpBCRb99t502Y9Pgus5/I+MC8WCOUfJY3llczqhiUPvwH1gDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T00:21:05.018974Z"},"content_sha256":"2e038eedde6c0a02c5cf28da9b94393bf16445bdd413ce1c7206638e78c12d56","schema_version":"1.0","event_id":"sha256:2e038eedde6c0a02c5cf28da9b94393bf16445bdd413ce1c7206638e78c12d56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LUSR5NZW6YFIC2PQIRX76M2FAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit Matrices over $\\mathbb Z_2$ with CNOT and Row Complexity $4n-\\mathrm{o}(n)$ and Local Logic Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"Andrew Yu, Sherry Gong","submitted_at":"2026-07-30T17:48:15Z","abstract_excerpt":"In this article, we present an explicit family of invertible $n\\times n$ matrices over $\\mathbb Z_2$ whose CNOT and row complexity is at least $4n-\\text{o}(n)$; equivalently, reducing these matrices to the identity requires at least $4n-\\text{o}(n)$ elementary row operations. Moreover, the same complexity lower bound holds in the stronger computational model where the CNOT gates are replaced by arbitrary local linear logic gates, namely arbitrary invertible linear transformations acting on pairs of coordinates.\n  Let $G_n$ denote the permutation group generated by local logic gates acting on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28598","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/2607.28598/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-07-31T01:39:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0bhDogZi5bDgOOf0MwTfzEla8znVFUZv32c2gs1oe5czifvCezhF6RZTzzTU6sW1D2ckT8sKuBxR38+QwLf9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T00:21:05.019887Z"},"content_sha256":"d65e12d28833fcedd62f6f9afed4931c254e2bb91853a73f6b7b21d38020e8af","schema_version":"1.0","event_id":"sha256:d65e12d28833fcedd62f6f9afed4931c254e2bb91853a73f6b7b21d38020e8af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUSR5NZW6YFIC2PQIRX76M2FAT/bundle.json","state_url":"https://pith.science/pith/LUSR5NZW6YFIC2PQIRX76M2FAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUSR5NZW6YFIC2PQIRX76M2FAT/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-03T00:21:05Z","links":{"resolver":"https://pith.science/pith/LUSR5NZW6YFIC2PQIRX76M2FAT","bundle":"https://pith.science/pith/LUSR5NZW6YFIC2PQIRX76M2FAT/bundle.json","state":"https://pith.science/pith/LUSR5NZW6YFIC2PQIRX76M2FAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUSR5NZW6YFIC2PQIRX76M2FAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LUSR5NZW6YFIC2PQIRX76M2FAT","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":"e6552726da22d5bcfd39867f9e97faf2040c8c7b8e8065d607aae0ccc789d244","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:48:15Z","title_canon_sha256":"f377a4cf4e784792110301da0821b8918f1091e34890052bacb32d76d02ff7d5"},"schema_version":"1.0","source":{"id":"2607.28598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28598","created_at":"2026-07-31T01:39:03Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28598v1","created_at":"2026-07-31T01:39:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28598","created_at":"2026-07-31T01:39:03Z"},{"alias_kind":"pith_short_12","alias_value":"LUSR5NZW6YFI","created_at":"2026-07-31T01:39:03Z"},{"alias_kind":"pith_short_16","alias_value":"LUSR5NZW6YFIC2PQ","created_at":"2026-07-31T01:39:03Z"},{"alias_kind":"pith_short_8","alias_value":"LUSR5NZW","created_at":"2026-07-31T01:39:03Z"}],"graph_snapshots":[{"event_id":"sha256:d65e12d28833fcedd62f6f9afed4931c254e2bb91853a73f6b7b21d38020e8af","target":"graph","created_at":"2026-07-31T01:39:03Z","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/2607.28598/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this article, we present an explicit family of invertible $n\\times n$ matrices over $\\mathbb Z_2$ whose CNOT and row complexity is at least $4n-\\text{o}(n)$; equivalently, reducing these matrices to the identity requires at least $4n-\\text{o}(n)$ elementary row operations. Moreover, the same complexity lower bound holds in the stronger computational model where the CNOT gates are replaced by arbitrary local linear logic gates, namely arbitrary invertible linear transformations acting on pairs of coordinates.\n  Let $G_n$ denote the permutation group generated by local logic gates acting on t","authors_text":"Andrew Yu, Sherry Gong","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:48:15Z","title":"Explicit Matrices over $\\mathbb Z_2$ with CNOT and Row Complexity $4n-\\mathrm{o}(n)$ and Local Logic Gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28598","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:2e038eedde6c0a02c5cf28da9b94393bf16445bdd413ce1c7206638e78c12d56","target":"record","created_at":"2026-07-31T01:39:03Z","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":"e6552726da22d5bcfd39867f9e97faf2040c8c7b8e8065d607aae0ccc789d244","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:48:15Z","title_canon_sha256":"f377a4cf4e784792110301da0821b8918f1091e34890052bacb32d76d02ff7d5"},"schema_version":"1.0","source":{"id":"2607.28598","kind":"arxiv","version":1}},"canonical_sha256":"5d251eb736f60a8169f0446fff334504f69238b69f080b325ef6934880b13920","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d251eb736f60a8169f0446fff334504f69238b69f080b325ef6934880b13920","first_computed_at":"2026-07-31T01:39:03.873407Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:39:03.873407Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e038eedde6c0a02c5cf28da9b94393bf16445bdd413ce1c7206638e78c12d56","sha256:d65e12d28833fcedd62f6f9afed4931c254e2bb91853a73f6b7b21d38020e8af"],"state_sha256":"fb881c89e0e2d261bacb4a99658444e80aa8b1453212cac53d0b370a5ba9a7da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAxvBSvzyIW8u9pan3WldEG/UE4PG+Gq7j0LFyWOpwuA/6/LYLiW13i46cNBf3Lkk/I1qUObIKZiWltjgH3ICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T00:21:05.027061Z","bundle_sha256":"f3372b8c5b9b26ac449da935bcaaf8af85b916658fb8df3db7bcc3299fd8a2a0"}}