{"as_of":"2026-08-09T21:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4b009268cbb522745c7bd7fadcccd3565488cf2e9d7062323bdbda2c72817f4a","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T02:42:14.736309Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.28598/citation-record","integrity":"/paper/2607.28598/integrity","json":"/paper/2607.28598/citation-record.json","paper":"/paper/2607.28598"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2112.05724","last_updated":"2021-12-10T18:28:01Z","snapshot_observed_at":"2026-07-06T12:17:32.029778Z","submitted_at":"2021-12-10T18:28:01Z","title":"A Quantum Complexity Lowerbound from Differential Geometry","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.05724","snapshot_observed_at":"2026-07-31T02:42:14.669691Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.669691Z"},"links":{"cited_paper":"/paper/2112.05724","citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:80cb972ecaa12aeeeb73c96a6759c7f2a4380ec57a31dc2962ae1c90bf6ed494","observation_id":"7913aba0-2429-4618-9a06-f446273684c9","resolution":{"observed_at":"2026-07-31T02:42:14.669691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.12700","last_updated":"2023-11-20T19:25:56Z","snapshot_observed_at":"2026-08-09T11:03:49.414088Z","submitted_at":"2021-11-24T18:52:44Z","title":"Universality in long-distance geometry and quantum complexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.12700","snapshot_observed_at":"2026-07-31T02:42:14.673843Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.673843Z"},"links":{"cited_paper":"/paper/2111.12700","citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:7a66e4b1a6f06815f5c20d67557bf48a2552035780103bab7a3ee4cbeb72182c","observation_id":"fc6bfa6b-89d3-433d-8a6d-ea4cdc5a8fd3","resolution":{"observed_at":"2026-07-31T02:42:14.673843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.677648Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.677648Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:b79f6ed34184e94bdb096bf7a2063dd09396cf237738ba51c4eab6026b6d4de4","observation_id":"25d93544-1752-471a-b2f6-7ffc9a821e6b","resolution":{"observed_at":"2026-07-31T02:42:14.677648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0505030","last_updated":"2005-08-23T01:12:00Z","snapshot_observed_at":"2026-07-07T07:19:07.719177Z","submitted_at":"2005-05-06T00:55:45Z","title":"The Solovay-Kitaev algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0505030","snapshot_observed_at":"2026-07-31T02:42:14.680711Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.680711Z"},"links":{"cited_paper":"/paper/quant-ph/0505030","citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:f674cbca8fdbdb9e819e99072c3c5887c75bfb7c93b46868ce1805e94922ff8b","observation_id":"5a4b8da3-cdc1-41bb-8344-20f473b4ffdb","resolution":{"observed_at":"2026-07-31T02:42:14.680711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.684551Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.684551Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:b1b6ddf8c4c4f84c90a327c555423fff314ef2475a81b666f5383632fe6b1f6f","observation_id":"28bb597d-80d1-462c-be2c-7a8c38dd294a","resolution":{"observed_at":"2026-07-31T02:42:14.684551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.22248","last_updated":"2026-07-24T12:31:18Z","snapshot_observed_at":"2026-08-01T05:28:44.964746Z","submitted_at":"2026-07-24T12:31:18Z","title":"Lower bounds for the CNOT-complexity of linear reversible operators","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.22248","snapshot_observed_at":"2026-07-31T02:42:14.688000Z","title":"Lower bounds for the CNOT-complexity of linear reversible operators,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.688000Z"},"links":{"cited_paper":"/paper/2607.22248","citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:be02883c02e9ee58290430a8a4b7fec8230038c920252708275940741044bffe","observation_id":"f7f83dd8-2140-4499-9c13-b9e8a7e0af00","resolution":{"observed_at":"2026-07-31T02:42:14.688000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.691324Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.691324Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:c2a2c7742f2280cb3a1720b337d33d450f78da780e788f3261f7a0d29a96cf85","observation_id":"fde3fa40-490a-4aef-91d8-43f45c5bedd1","resolution":{"observed_at":"2026-07-31T02:42:14.691324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.694342Z","title":"Nielsen,A Geometric Approach to Quantum Circuit Lower Bounds,Quantum Infor- mation & Computation, vol","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.694342Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:189feaf04672645a3d73e1ca40d311743518728ccd12acc97a9608ec8f98a9b8","observation_id":"c0ba4aa9-d79a-45fb-9030-9bca9d328ad3","resolution":{"observed_at":"2026-07-31T02:42:14.694342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.697134Z","title":"Nielsen and I","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.697134Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:a3a7408121ba38ae3542fa39f63efe3a3a2a6b06213e442786c47c949db8175e","observation_id":"60f44bd7-a132-46ff-9c7f-80f8c59ad976","resolution":{"observed_at":"2026-07-31T02:42:14.697134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0603161","last_updated":"2006-03-21T16:50:14Z","snapshot_observed_at":"2026-08-07T20:07:21.891094Z","submitted_at":"2006-03-19T02:36:28Z","title":"Quantum Computation as Geometry","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0603161","snapshot_observed_at":"2026-07-31T02:42:14.699954Z","title":"Nielsen, M","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.699954Z"},"links":{"cited_paper":"/paper/quant-ph/0603161","citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:23f9102639242c9c92e4fae9a92a6393c3faea01bede13edc86cab819680203e","observation_id":"0997c767-0218-47d8-850e-f84f6152ce20","resolution":{"observed_at":"2026-07-31T02:42:14.699954Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.702907Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.702907Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:d0934f437569189ef306ac92f910635ed91666dc4179bb52174e1917e0a353e7","observation_id":"cec670d2-8b25-4809-b6c1-9e533edabc6b","resolution":{"observed_at":"2026-07-31T02:42:14.702907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.705650Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.705650Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:c5ffb4cfa327b90319212a80c7e1fb802ff1b77d3a7a6cf7432f5aa10755e7da","observation_id":"3da681c8-7182-4c22-a98a-43ab517a90d7","resolution":{"observed_at":"2026-07-31T02:42:14.705650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.05256","last_updated":"2016-07-18T19:46:48Z","snapshot_observed_at":"2026-07-06T05:04:00.852031Z","submitted_at":"2016-07-18T19:46:48Z","title":"The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.05256","snapshot_observed_at":"2026-07-31T02:42:14.708415Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.708415Z"},"links":{"cited_paper":"/paper/1607.05256","citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:7a05a9f40df31cf1f74e035bdb43eb3b6cff72ffa1dc5fff521b62f8d22113c4","observation_id":"778be610-7c85-4d3d-9140-ab1d608a1713","resolution":{"observed_at":"2026-07-31T02:42:14.708415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.711561Z","title":"Andr´ en, L","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.711561Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:4f7c690d1734474bf599eaa290513f5a5905ec923d40c7f568565bcc4fdc725b","observation_id":"4cf40147-8ab4-4c6e-9440-fb14b77c9d18","resolution":{"observed_at":"2026-07-31T02:42:14.711561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.714249Z","title":"Gowers,Rough Structure and Classification,79-117, GAF A Special Volume, Vision in Mathematics, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.714249Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:bbdecb077529e19a22fc21d800d90868a07cefd5bb42b200e89252f03510134a","observation_id":"73188976-470a-4f76-9c62-f2a8d739af6a","resolution":{"observed_at":"2026-07-31T02:42:14.714249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.716976Z","title":"Gowers,A conversation about complexity lower bounds,Gowers’ webblog, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.716976Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:c5449c5559c3718123ad4c79bfd8815a01f39c2d1af443c2c762398ca1b3bba6","observation_id":"878d7890-b6e7-420f-86ce-d8b10fce5239","resolution":{"observed_at":"2026-07-31T02:42:14.716976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.719711Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.719711Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:34908e5b905612e3924affa12ce829c6526b96a2f820d51ed65a9e3d0ad44437","observation_id":"09874fee-fe6e-4d37-ab65-d61bcd17aef1","resolution":{"observed_at":"2026-07-31T02:42:14.719711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.722447Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.722447Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:c525f6964fa4bf1d5e9a12a1b1216b28f75a2dc963ddf3be2610686183d5c621","observation_id":"90582091-4b4b-46dd-abd2-847a06f342cc","resolution":{"observed_at":"2026-07-31T02:42:14.722447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.725087Z","title":"Yu,Quantum Complexity of Permutations,575-595, Pure and Applied Mathematics Quarterly, Volume 19, Number 2, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.725087Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:df3669ddf753ca9bba2555cae11054967fec9dccc047321f2183234ccc81ece9","observation_id":"0c460dbd-92fd-438a-b9ba-b43c4bbadc41","resolution":{"observed_at":"2026-07-31T02:42:14.725087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.727918Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.727918Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:2c63eb21bdd0938e46282bea4e9a15afcfa21ab72f9e343d804453ce4951d24b","observation_id":"667d8e5d-0c20-4533-8c95-da1ff2263e8b","resolution":{"observed_at":"2026-07-31T02:42:14.727918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.730596Z","title":"Bataille,Quantum circuits of CNOT gates: Optimization and entanglement,Quantum Information Processing, 21(7):269, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.730596Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:cbd633b3f507d0acfd31cdec271bd0e55100d26a12edf9bc15e65aa40ec166fd","observation_id":"95eb46fd-4d4c-454b-a3b0-1d1591c9cfb5","resolution":{"observed_at":"2026-07-31T02:42:14.730596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.733550Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.733550Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:ac47577f7e3aeaac6bf6e30640f1dee4eb9af8421ee958214759fafdc79eaafd","observation_id":"1e6f84f6-4dba-497c-bad5-8bde7a17ea13","resolution":{"observed_at":"2026-07-31T02:42:14.733550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T02:42:14.736309Z","title":"Shoup,New Algorithms for Finding Irreducible Polynomials over Finite Fields,Math- ematics of Computation, 54 (189), 435–447, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T02:42:14.736309Z"},"links":{"citing_paper":"/paper/2607.28598"},"observation_digest":"sha256:95a754baa2104389df79cd7804240a30c00ed78a0d6044dbb4824be1daf46f92","observation_id":"c444e8c2-235d-473f-81ca-8111a838d639","resolution":{"observed_at":"2026-07-31T02:42:14.736309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.28598","last_updated":"2026-07-30T17:48:15Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T23:37:14.979216Z","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"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":23},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2607.28598."}