{"as_of":"2026-08-09T02:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:039459de0971f12aeb0967a71c9f5f9584f0fd12ee3b473a834953abe5e4617b","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:55:26.714339Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:55:25.381894Z","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.931598Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"cited_work":{"arxiv_id":"2608.03825","doi":null,"metadata_source":"pith","pith_arxiv_id":"2608.03825","snapshot_observed_at":"2026-08-05T11:55:26.931598Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","venue":"quant-ph","work_id":"b429bd43-dad5-4fcd-856d-d2caac815570","year":2026},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:25.381894Z"},"links":{"cited_paper":"/paper/2608.03825","citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:aa322dc0d7e0b3b72e585cf0829ab410cd1de240616ad20ae6f18855c9bcd997","observation_id":"0df6541e-9311-44e8-a474-0cc6b48a0d64","resolution":{"observed_at":"2026-08-05T11:55:26.935040Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2608.03825/citation-record","integrity":"/paper/2608.03825/integrity","json":"/paper/2608.03825/citation-record.json","paper":"/paper/2608.03825"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"cited_work":{"arxiv_id":"2608.03825","doi":null,"metadata_source":"pith","pith_arxiv_id":"2608.03825","snapshot_observed_at":"2026-08-05T11:55:26.931598Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","venue":"quant-ph","work_id":"b429bd43-dad5-4fcd-856d-d2caac815570","year":2026},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:25.381894Z"},"links":{"cited_paper":"/paper/2608.03825","citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:aa322dc0d7e0b3b72e585cf0829ab410cd1de240616ad20ae6f18855c9bcd997","observation_id":"0df6541e-9311-44e8-a474-0cc6b48a0d64","resolution":{"observed_at":"2026-08-05T11:55:26.935040Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.205881Z","title":null,"venue":null,"work_id":"f5a203c3-3976-4fbe-80ab-d67f416f1e2d","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:25.453373Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:18ffdd72433c7d8c255e0efe8d4e0b3a7ebfee265262408c8c7c284620d7de04","observation_id":"6434a620-9b61-447f-b407-5f91e7a40153","resolution":{"observed_at":"2026-08-05T11:55:27.209037Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.195615Z","title":", N}and denote byIN theN×N identity matrix","venue":null,"work_id":"6e619268-f41b-45c2-9f7d-19279f6b8c76","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:25.540549Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:d45ec267c4e825a831d6c13e55812d0fdadfd3638b6e87b1091be9cef5bb7127","observation_id":"3f758080-cc53-4810-ba79-8576fca027a1","resolution":{"observed_at":"2026-08-05T11:55:27.199082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.186168Z","title":"LetG= (V, E) be a finite simple graph, and write n=|V|, m=|E|","venue":null,"work_id":"112349a5-d1b0-4239-8cf4-7f6ab077bef2","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:25.635926Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:45399bfe6874bb0e7ac56147c81cd3298eb956c2b48de769ce31c6d41b64125e","observation_id":"7c83eef5-87fd-4d1f-a562-bed8b702bc60","resolution":{"observed_at":"2026-08-05T11:55:27.189417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.176455Z","title":"We first prove the decision result and its ancillary vari- ants, and then derive hardness for exact computation, fixed-additive approximation, and multiplicative approx- imation","venue":null,"work_id":"28a23faa-6358-4cab-be21-c4dbc8f7335f","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:25.785272Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:30bf12d55fddbc1e823c0b7246b725ff15e057da992bab8e26a142dba89dd26a","observation_id":"59bb40fa-54c3-49c2-8858-d8652c1ab4b4","resolution":{"observed_at":"2026-08-05T11:55:27.179910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.165387Z","title":"Thus ex- act CNOT-count minimisation remains computation- ally hard even after routing constraints and restricted gate availability are removed","venue":null,"work_id":"a269f0fb-1ae7-44ce-adbe-664d5fec1e29","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:25.919654Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:3a50a4aa573d73a10bc241c3567932de44a9601168460fdae6049494fde02930","observation_id":"e7975830-96b8-4578-8c5e-c952a4bbdecb","resolution":{"observed_at":"2026-08-05T11:55:27.169337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.155364Z","title":null,"venue":null,"work_id":"99961c56-5046-4823-be9f-4ef3dd5ee593","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.005961Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:c0e8ac2591c8aea0d673c63314bbd67ee73a57d326e0ecf788c666793d18feed","observation_id":"914b914e-9702-415d-bbff-195ee2f1295f","resolution":{"observed_at":"2026-08-05T11:55:27.158578Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.145954Z","title":null,"venue":null,"work_id":"8ffee6f0-9829-4446-8c3a-a03a332a9804","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.141435Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:74cb99d188ec73f07418613163437851f8fa3e6b82f53a5dc06a65430a3ebd88","observation_id":"983a2811-4d6d-4f74-80a8-0669ba0993da","resolution":{"observed_at":"2026-08-05T11:55:27.149049Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.136630Z","title":null,"venue":null,"work_id":"43b53e78-078e-4c22-b157-ee333cdf6fb1","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.296497Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:f9b7bdce424c6a9ae65460850b012b7e720e19eaef5c249d54beb17db0014233","observation_id":"96e213d3-7b44-4cf0-bb61-b740e3591829","resolution":{"observed_at":"2026-08-05T11:55:27.139821Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.126312Z","title":"Fort= 0, takeQ 0 =L, letρ 0 be the identity map, and take the input variables inU G as the basisB 0","venue":null,"work_id":"90d00f11-f713-416c-a596-36c87b855ed6","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.470343Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:96647d73b190a6cbec72aee764f3eecbb5ab017f63be27b18182eb0cc7d3ebff","observation_id":"6e702df5-9577-4e3e-8fcb-fc0ed888cc94","resolution":{"observed_at":"2026-08-05T11:55:27.129926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.116988Z","title":"Elementary gates for quantum compu- tation,","venue":null,"work_id":"eef861b7-4d7f-457e-b159-a1c6d3587bb9","year":1995},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.586134Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:60bab4b13ed054f9da0f881b90eedb09c354d249c038091ec8574c9457742e88","observation_id":"62b87625-108a-42df-8506-d7f2bde80ccb","resolution":{"observed_at":"2026-08-05T11:55:27.120266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.107614Z","title":"Improved simulation of stabilizer circuits,","venue":null,"work_id":"faceb426-88f7-4d8a-8179-67952713ea7f","year":2004},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.646193Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:ceccd5e0721b7795e1b91b29aff6ff711606f657bbcff628974c1d6105cc6428","observation_id":"66f9f94f-73e1-494f-ae6e-bdfaf406e679","resolution":{"observed_at":"2026-08-05T11:55:27.110603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.098099Z","title":"On the controlled-NOT complexity of controlled-NOT–phase circuits,","venue":null,"work_id":"69e90621-f530-4e55-a68c-c3d01ea35159","year":2018},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.649795Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:0357a3ebe989c19f694f9a2f5af50d9d518ca748a383048e9612238ee051b409","observation_id":"f72c36c2-61ed-482f-bb5a-19f8811f2a6f","resolution":{"observed_at":"2026-08-05T11:55:27.101051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.088605Z","title":"Clifford circuit optimization with templates and symbolic pauli gates,","venue":null,"work_id":"d94df24e-3271-4e7f-983d-1be300eca94d","year":2021},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.653046Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:4e12be50f83e5d3f7be853b36170b184b2544b4a8be4062702c04646932ef3d2","observation_id":"cf6e2407-79db-4fe7-b5b6-3ab57fa8e790","resolution":{"observed_at":"2026-08-05T11:55:27.091840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.077635Z","title":"Global synthesis of CNOT circuits with holes,","venue":null,"work_id":"6478aff2-4098-4a34-99de-aec6ff1664ab","year":2023},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.656423Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:dd53f4d8bb644102736a3be023d1ae2ea7c1d8781ecb05f47994a769fa198c5c","observation_id":"3d5fd0ce-73fd-4b65-9501-83496fabdf2b","resolution":{"observed_at":"2026-08-05T11:55:27.081298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.066303Z","title":"Optimal synthesis of linear reversible circuits,","venue":null,"work_id":"fede3a49-4738-46a1-814d-dbddb89e6b3d","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.659808Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:6973e115daf6b4df3a7f66e6299bba86cf49635fd8146f915bd730616bb690b4","observation_id":"5901c24f-5c98-4f39-8f76-9ff9632c7816","resolution":{"observed_at":"2026-08-05T11:55:27.069736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05958","last_updated":"2024-08-12T11:29:25Z","snapshot_observed_at":"2026-08-06T05:31:45.349232Z","submitted_at":"2023-09-12T09:35:23Z","title":"Optimising quantum circuits is generally hard","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05958","snapshot_observed_at":"2026-08-05T11:55:26.696275Z","title":"Optimising quantum circuits is generally hard","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.696275Z"},"links":{"cited_paper":"/paper/2310.05958","citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:2850874f5c16dc3600a7bc8f582dc83fc84915c349a6d2fad09a44269c13a0ee","observation_id":"8e810dff-f538-4f61-ae1e-09e109ee087f","resolution":{"observed_at":"2026-08-05T11:55:26.696275Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.055198Z","title":"Quantum circuits of CNOT gates: opti- mization and entanglement,","venue":null,"work_id":"79a5d997-0a6e-43eb-9ae6-6ea56c8c12ec","year":2022},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.665716Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:ba537beef871f705e85502098e36949bfc03f2bf929d72409ae5c03218c55c77","observation_id":"a554604a-b7a2-4fe3-8212-a972ee4126a4","resolution":{"observed_at":"2026-08-05T11:55:27.058827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T11:55:26.668561Z","title":"On exact sizes of minimal CNOT circuits,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.668561Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:802a19142c029458b51ad0f9c5058387d5f9c2c475754f26c8edf43a75a05f89","observation_id":"784ad66c-4694-4fe0-ab3d-86932f7a9ce6","resolution":{"observed_at":"2026-08-05T11:55:26.668561Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.044287Z","title":"Minimum synthesis cost of CNOT circuits,","venue":null,"work_id":"dbe02f96-bc06-467d-b4ff-8fa56675e651","year":2025},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.671627Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:107dd6d0d9adfaca32538fb3c1a90b78c6972aca547b9e84d06edd889a8cf06f","observation_id":"396d1e94-e58d-4e95-bfe4-67647f812b70","resolution":{"observed_at":"2026-08-05T11:55:27.047594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T23:12:32.360488Z","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:c66036886da542605a39443477875ef95c2a02b3f6a7c28d64272d2d10ba3715","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.035194Z","title":"Explicit matrices overZ 2 with CNOT and row complexity 4n−o(n) and local logic gates,","venue":null,"work_id":"1bf18944-9680-4d1b-a3ca-b7f8935c0940","year":2026},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.678210Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:f07830656f0fcbcaf3e5ecd8e8f195411128a03ba96b1b23a39fc2e63578c659","observation_id":"70a50f1c-5c51-420d-b6f0-f1e2cbacddc2","resolution":{"observed_at":"2026-08-05T11:55:27.038343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.025499Z","title":"Gaussian elimination ver- sus greedy methods for the synthesis of linear reversible circuits,","venue":null,"work_id":"77db3c4b-1e77-4259-9b3a-e6297bb322eb","year":2021},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.681069Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:d50b99d1682f7222fee895ee7f5ec2a2812a7ace80d6ed3a923f1ea964c7ecac","observation_id":"7f0dbfd9-2864-4792-bd2f-953176d4287b","resolution":{"observed_at":"2026-08-05T11:55:27.028997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T11:55:26.683911Z","title":"CNOT minimal circuit synthesis: A reinforcement learning approach,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.683911Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:b819b9d90603f2a684c229ae53b99305c9e1944070258bce74ecc1e3a3332d40","observation_id":"82b02f8c-e315-4ba1-a7b5-ef2be79bc841","resolution":{"observed_at":"2026-08-05T11:55:26.683911Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:27.014562Z","title":"AlphaCNOT: Learning CNOT minimization with model-based planning,","venue":null,"work_id":"1af2da99-5038-4894-9250-2493ef4c5346","year":2026},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.686543Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:b9c20840eeec9458209a6dd51124fe2d474132474cd50ce62bda7bb83f642896","observation_id":"62295a3c-8aa9-4371-bff5-e87d831c4878","resolution":{"observed_at":"2026-08-05T11:55:27.017807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.24195","last_updated":"2026-07-27T09:14:53Z","snapshot_observed_at":"2026-07-31T21:21:02.693265Z","submitted_at":"2026-07-27T09:14:53Z","title":"Parallelizable Exact Synthesis of Quantum Circuits via Semi-Tensor Product","version":1},"cited_work":{"arxiv_id":"2607.24195","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.24195","snapshot_observed_at":"2026-08-05T11:55:26.807899Z","title":"Parallelizable Exact Synthesis of Quantum Circuits via Semi-Tensor Product","venue":"quant-ph","work_id":"31a9b6fe-58b4-4ff8-8d8d-ec22c625fe1b","year":2026},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.689324Z"},"links":{"cited_paper":"/paper/2607.24195","citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:26f65b42f0e120329aad6a9c9f6651278a23306740deef192ee687de2e207b1d","observation_id":"4afd287e-84d7-4e9a-be61-6f9b5f80fdbc","resolution":{"observed_at":"2026-08-05T11:55:26.811254Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"cited_work":{"arxiv_id":"2509.10070","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.10070","snapshot_observed_at":"2026-08-05T11:55:26.793514Z","title":"Toward Minimum Graphic Parity Networks","venue":"quant-ph","work_id":"3361efad-79ee-4365-aec9-a203077c8757","year":2025},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.692548Z"},"links":{"cited_paper":"/paper/2509.10070","citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:a3593b3d39ea442b1878586a7544151650d65e49f694b5950a73d66c2a29606a","observation_id":"4c0e4471-969b-4b22-99b9-ad501704e58e","resolution":{"observed_at":"2026-08-05T11:55:26.797730Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:26.999079Z","title":"Optimal space–depth trade-off of CNOT cir- cuits in quantum logic synthesis,","venue":null,"work_id":"433aa0d8-2bc9-41a6-9d00-ca8915288f63","year":2020},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.700225Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:77d888ef0b65ec65cb7ea4deff49120160019ae6151ea3b1e5379397c04efd97","observation_id":"7478a9d4-1f0b-4e65-9304-49e998dc7ae6","resolution":{"observed_at":"2026-08-05T11:55:27.007021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:26.963266Z","title":"CNOT-optimal circuit synthesis,","venue":null,"work_id":"9d21d6a8-a311-4522-bc08-4c963834dc60","year":2023},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.703180Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:0f9d7f9b758d5d9ab908e6b546582a8b5819f9ec687d7a10017b750cd7c4be9b","observation_id":"00e2038e-9cd1-4297-811e-e2951ffcf23e","resolution":{"observed_at":"2026-08-05T11:55:26.978008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T11:55:26.705915Z","title":"Reducibility among combinatorial prob- lems,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.705915Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:619d3f2e6122e3c9cacc798e9a21777217d7cd9fea44d760562511c13c7a12a2","observation_id":"b2b5af18-308a-484e-8661-72264cd33335","resolution":{"observed_at":"2026-08-05T11:55:26.705915Z","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/s00145-012-9124-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:26.743940Z","title":"Logic minimiza- tion techniques with applications to cryptology,","venue":null,"work_id":"31db2d17-84fa-44cc-b538-79fab97fa7b9","year":2013},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.708740Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:85d7550a1cc14548b0dd4ec12f9c0d22a6625e43791a134e2d6fdb9d28d42578","observation_id":"d7e3d0be-e4cd-4f65-99ab-e3886c31b5a0","resolution":{"observed_at":"2026-08-05T11:55:26.749821Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:26.952273Z","title":"Some APX-completeness re- sults for cubic graphs,","venue":null,"work_id":"852b0bdf-f11d-4779-9a01-e0a5d449cd98","year":2000},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.711537Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:38684a0d5ff4da5ea0e6ffd42167702c112553cdd772d039abf748d78fc5245c","observation_id":"ce0618e1-f899-409e-b9cd-802ddc5bf9df","resolution":{"observed_at":"2026-08-05T11:55:26.955735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:26.942328Z","title":"Optimization, approximation, and complexity classes,","venue":null,"work_id":"d48e674b-d72d-4c91-9188-16b8d60d6c4e","year":1991},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.714339Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:a10d746213edc9c5af2fb1bb91a19e70c787fc430bde2b012aecc1625a8be0d7","observation_id":"5fcab2c8-74b4-42ed-ac45-b5d799337459","resolution":{"observed_at":"2026-08-05T11:55:26.945630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.26421/qic8.3-4-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:55:26.780341Z","title":null,"venue":null,"work_id":"0931a60c-7f0b-4e6b-be95-5d4aabda37c4","year":null},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.662861Z"},"links":{"citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:2701fff58ddfa1b47cfad40c8be5421027cdcd596ee961c1710735394f2b14dd","observation_id":"6dd66808-79ce-4024-8855-56bcd63d9346","resolution":{"observed_at":"2026-08-05T11:55:26.783471Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T23:12:32.360488Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":8,"verified_exact":5,"verified_fuzzy":20},"total_outbound_references":34},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 1 inbound Pith citation observation for arXiv:2608.03825."}