{"as_of":"2026-08-09T23:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:667af8ac03c2bf2baa2f78c7e6bbae120a0a3911210080047c8d595f88c7d6a4","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T05:28:48.444849Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:55:26.674955Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T11:55:26.917958Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":{"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":"2607.22248","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.22248","snapshot_observed_at":"2026-08-05T11:55:26.917958Z","title":"Lower bounds for the CNOT-complexity of linear reversible operators","venue":"quant-ph","work_id":"a81e1e77-c2a9-4571-9701-6feec4fb97f8","year":2026},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-09T17:14:50.560915Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.674955Z"},"links":{"cited_paper":"/paper/2607.22248","citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:0ac49cf0b4d980284de04bc4a9cb6838f6476bd499a54cb421a3e5d2cc83a4ce","observation_id":"91ceed09-376f-4483-9faa-b060c71253f5","resolution":{"observed_at":"2026-08-05T11:55:26.921435Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2607.22248/citation-record","integrity":"/paper/2607.22248/integrity","json":"/paper/2607.22248/citation-record.json","paper":"/paper/2607.22248"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:28:45.834826Z","title":"2013 , url =","venue":null,"work_id":null,"year":2013},"citing_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},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:45.834826Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:b186395f35480c6fa608799c620d1c7991e33f91c1ad6b4a0b40a07f2bbae31a","observation_id":"60f1e8e3-13c8-4e2f-8cab-4902b92d8d2b","resolution":{"observed_at":"2026-08-01T05:28:45.834826Z","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-08-01T05:28:45.985036Z","title":"Quantum Science and Technology , abstract =","venue":null,"work_id":null,"year":2018},"citing_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},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:45.985036Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:353dca7df4a28f0a54bfaf6a3a629310af15caebbb527b3f752a8bfc12c23412","observation_id":"92167d74-0ee9-4638-a2ad-d4a06378d47b","resolution":{"observed_at":"2026-08-01T05:28:45.985036Z","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":"10.1007/s11128-022-03577-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum Information Processing , volume =","venue":"Quantum Information Processing","work_id":"436cc46d-021e-4ebd-a5f2-3611a60abec3","year":null},"citing_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},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:46.214749Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:69f44643399b47caf96ea3ca7fdeff4a3739baf9387ae88f8c40bd2a3296a684","observation_id":"67d3135b-8ea9-4c51-aae9-bc1516adc8a5","resolution":{"observed_at":"2026-08-01T05:33:28.128726Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-03T23:38:08.557109+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T23:38:08.557109+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-52482-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reversible Computation - 12th International Conference,","venue":"Lecture notes in computer science","work_id":"c3529920-02c0-4f68-97b4-7d55373ca307","year":2020},"citing_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},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:46.390306Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:bf50866313ea115cedc2f882c4ff5f04b0c851d3917bba0d42166f4bf10461c0","observation_id":"a41c3cd6-464a-4e83-b027-9bf888417400","resolution":{"observed_at":"2026-08-01T05:33:28.077618Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-03T23:38:08.690589+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T23:38:08.690589+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3474226","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2021 , issue_date =","venue":"ACM Transactions on Quantum Computing","work_id":"9abe5917-669b-4269-99ee-531980d6a773","year":2021},"citing_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},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:46.518349Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:d61d28b7a3e6aa41e7435b8164ea09782ee8427b85940c81cfe2f4070329e8d0","observation_id":"57b4f77f-1ae2-486b-aabb-17ff75437830","resolution":{"observed_at":"2026-08-01T05:33:28.032011Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-03T23:38:08.804844+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T23:38:08.804844+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11128-025-04831-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Minimum synthesis cost of CNOT circuits","venue":"Quantum Information Processing","work_id":"d6d2bf33-65ed-40fd-9f47-20831baeb70b","year":null},"citing_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},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:46.620228Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:eebcdaa6bd529c5b40eb96f84b0be9eb6a6f8dea1a259fd6169c1d65972fa5be","observation_id":"63028726-3980-462a-8887-c78989240449","resolution":{"observed_at":"2026-08-01T05:33:27.936717Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-03T23:38:08.968534+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T23:38:08.968534+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:28:46.845085Z","title":"On exact sizes of minimal CNOT circuits","venue":null,"work_id":null,"year":null},"citing_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},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:46.845085Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:ef5e647e5edef2c8428a79093608226ec5d09136ef0181d45c81897a2c225151","observation_id":"77b2c594-73f1-49a0-b185-b05ee0ed67fa","resolution":{"observed_at":"2026-08-01T05:28:46.845085Z","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-08-01T05:28:47.062512Z","title":"2023 , volume=","venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:47.062512Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:c0457dff5eac939b76c72511695a29717e7ab5e95fd88f4d19564a5dc1396a30","observation_id":"68b483ae-281c-4f9b-bc4e-845e84696759","resolution":{"observed_at":"2026-08-01T05:28:47.062512Z","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-08-01T05:28:47.207382Z","title":"What is the complexity of this problem? , YEAR =","venue":null,"work_id":null,"year":null},"citing_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},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:47.207382Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:ff1b960761cde612586cd81076277535d91d0d6e4ff20a1cc64cddb808516f22","observation_id":"9e5aada9-9959-4b21-99b5-1339959e6e1b","resolution":{"observed_at":"2026-08-01T05:28:47.207382Z","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-08-01T05:28:47.339722Z","title":"Complexity of linear Boolean operators","venue":null,"work_id":null,"year":null},"citing_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},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:47.339722Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:2e5b4c8c594d09c8a6d7309d33bc8e8284b2b8366e15e519cc1f6bd7d8514ab7","observation_id":"863f4fcb-9e9d-45e0-8882-bf9f10633cf3","resolution":{"observed_at":"2026-08-01T05:28:47.339722Z","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-08-01T05:28:47.514739Z","title":"Proceedings of the 39th Annual Design Automation Conference , pages =","venue":null,"work_id":null,"year":2002},"citing_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},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:47.514739Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:97f82fc8ab46eba9177d256648b136ac73f13b36244a9db5cfab981e47dcff51","observation_id":"7f95b9f7-6406-4c37-acf6-9b938ea027b7","resolution":{"observed_at":"2026-08-01T05:28:47.514739Z","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-08-01T05:28:47.764743Z","title":"Reversible Computation - 10th International Conference,","venue":null,"work_id":null,"year":2018},"citing_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},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:47.764743Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:63de57dab2efa59973e7b5cd442115ba94bab811d87d78181c750a82d092eef3","observation_id":"e61cf1ad-a505-4f22-9c59-c0b55a655e16","resolution":{"observed_at":"2026-08-01T05:28:47.764743Z","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-08-01T05:28:47.911652Z","title":"and Markov, Igor L","venue":null,"work_id":null,"year":2008},"citing_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},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:47.911652Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:8272b96b7c9c4df171144ac9f752feec982f47ef61cc4bcf1e5c679bdf8714ea","observation_id":"b51f556c-c23d-46e6-8614-a3fb2427734a","resolution":{"observed_at":"2026-08-01T05:28:47.911652Z","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-08-01T05:28:48.015830Z","title":"2022 , pages=","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:48.015830Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:1f5de2ec4140fae050d07cb8bb3fbc5fcaa5a32e3bb971d4bd85ad04780452d7","observation_id":"a7834e91-70f0-4838-8189-a85fbb7ccb57","resolution":{"observed_at":"2026-08-01T05:28:48.015830Z","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":"10.1134/s0001434625605143","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lower Bounds for Additive Complexity of Linear Operators and Bilinear Algorithms for Matrix and Polynomial Multiplication GF(2)","venue":"Mathematical Notes","work_id":"a21a6d99-484d-4779-b174-10fc23753f96","year":null},"citing_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},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:48.194038Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:6b904cb40e3e1bb6b8ad06f296e841485f9687af975c3ae7ad1ca2b0141dbe61","observation_id":"a86b7fc1-6764-408a-9fd2-8a441b51dd88","resolution":{"observed_at":"2026-08-01T05:33:27.845421Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-03T23:38:09.599618+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T23:38:09.599618+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:28:48.298318Z","title":"2024 , doi =","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:48.298318Z"},"links":{"citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:97008bb7a2ef9b602c005e9542ed51abc683c90e95a3640eafc01669dbc572a2","observation_id":"1c188b8a-5036-44dc-926a-7be69a9ceaae","resolution":{"observed_at":"2026-08-01T05:28:48.298318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14660","last_updated":"2025-03-18T19:09:58Z","snapshot_observed_at":"2026-08-07T16:53:53.747822Z","submitted_at":"2025-03-18T19:09:58Z","title":"Heuristic and Optimal Synthesis of CNOT and Clifford Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14660","snapshot_observed_at":"2026-08-01T05:28:48.444849Z","title":"Heuristic and optimal synthesis of CNOT and Clifford circuits","venue":null,"work_id":null,"year":null},"citing_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},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:48.444849Z"},"links":{"cited_paper":"/paper/2503.14660","citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:e3f523380009a22d12256bfde42878b74edf2e242f6ff6d475924acef498f069","observation_id":"d4b568d7-6968-474a-a08f-2b59bd41d2e3","resolution":{"observed_at":"2026-08-01T05:28:48.444849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22248","last_updated":"2026-07-24T12:31:18Z","latest_version":1,"primary_category":"quant-ph","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"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":17},"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 17 of 17 outbound references and 2 inbound Pith citation observations for arXiv:2607.22248."}