{"as_of":"2026-08-14T02:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f60359c35534c8b611bafc6fcb91febefe4b7cda6cbef3465ef5644aa75b5c8","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:28:12.523878Z","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-07-09T08:06:04.153071Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.09835","last_updated":"2022-03-23T17:58:00Z","snapshot_observed_at":"2026-08-04T23:49:53.035356Z","submitted_at":"2020-12-17T18:54:38Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.09835","snapshot_observed_at":"2026-08-11T18:28:12.523878Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.07969","last_updated":"2024-12-10T23:14:42Z","snapshot_observed_at":"2026-08-12T04:47:05.938461Z","submitted_at":"2024-12-10T23:14:42Z","title":"AC/DC: Automated Compilation for Dynamic Circuits","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T18:28:12.523878Z"},"links":{"cited_paper":"/paper/2012.09835","citing_paper":"/paper/2412.07969"},"observation_digest":"sha256:12a082bb73fb09b3467f8282c6a40beab1eb7b143a636d504bedec2d6ffde170","observation_id":"bbaa575d-8780-4149-8040-d377e8803215","resolution":{"observed_at":"2026-08-11T18:28:12.523878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09835","last_updated":"2022-03-23T17:58:00Z","snapshot_observed_at":"2026-08-04T23:49:53.035356Z","submitted_at":"2020-12-17T18:54:38Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.09835","snapshot_observed_at":"2026-08-07T06:01:45.698372Z","title":"Chong, and Costin Iancu","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.698372Z"},"links":{"cited_paper":"/paper/2012.09835","citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:bd506b2a852041b446f915c7c90dc0c290444dab29e4691917ceab6106d19984","observation_id":"e9b3070a-c768-47e1-926d-e4c08660bf62","resolution":{"observed_at":"2026-08-07T06:01:45.698372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09835","last_updated":"2022-03-23T17:58:00Z","snapshot_observed_at":"2026-08-04T23:49:53.035356Z","submitted_at":"2020-12-17T18:54:38Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.09835","snapshot_observed_at":"2026-08-06T16:11:26.955567Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.14434","last_updated":"2025-07-19T02:05:32Z","snapshot_observed_at":"2026-08-10T15:19:28.646055Z","submitted_at":"2025-07-19T02:05:32Z","title":"Quantum Circuit Optimization Based on Dynamic Grouping and ZX-Calculus for Reducing 2-Qubit Gate Count","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T16:11:26.955567Z"},"links":{"cited_paper":"/paper/2012.09835","citing_paper":"/paper/2507.14434"},"observation_digest":"sha256:5250f40787c1c74ba1df2b95bd007dfb44bc6611a89ef3120473dd6745ec09dc","observation_id":"32b2cfaf-2ae5-431a-9fde-1df7da8c252e","resolution":{"observed_at":"2026-08-06T16:11:26.955567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09835","last_updated":"2022-03-23T17:58:00Z","snapshot_observed_at":"2026-08-04T23:49:53.035356Z","submitted_at":"2020-12-17T18:54:38Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","version":5},"cited_work":{"arxiv_id":"2012.09835","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.09835","snapshot_observed_at":"2026-07-09T08:06:04.153071Z","title":"Chong, and Costin Iancu","venue":"quant-ph","work_id":"b24fda1c-3d93-441d-b8aa-150e24410f15","year":2020},"citing_paper":{"arxiv_id":"2511.04608","last_updated":"2026-08-06T06:31:19Z","snapshot_observed_at":"2026-08-13T23:37:05.713354Z","submitted_at":"2025-11-06T17:58:53Z","title":"Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical Representation","version":4},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-18T00:45:26.450276Z"},"links":{"cited_paper":"/paper/2012.09835","citing_paper":"/paper/2511.04608"},"observation_digest":"sha256:78e188c6c25693201592eda9d44e23ef13db225c1ee58d1159e7b7f4e3981b16","observation_id":"ba703a6f-0865-4378-a6b6-58d8e329a493","resolution":{"observed_at":"2026-05-18T00:45:32.624410Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09835","last_updated":"2022-03-23T17:58:00Z","snapshot_observed_at":"2026-08-04T23:49:53.035356Z","submitted_at":"2020-12-17T18:54:38Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","version":5},"cited_work":{"arxiv_id":"2012.09835","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.09835","snapshot_observed_at":"2026-07-09T08:06:04.153071Z","title":"Chong, and Costin Iancu","venue":"quant-ph","work_id":"b24fda1c-3d93-441d-b8aa-150e24410f15","year":2020},"citing_paper":{"arxiv_id":"2603.25101","last_updated":"2026-05-15T00:26:35Z","snapshot_observed_at":"2026-08-07T19:45:01.577157Z","submitted_at":"2026-03-26T07:15:52Z","title":"T Count as a Numerically Solvable Minimization Problem","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-19T17:28:47.483756Z"},"links":{"cited_paper":"/paper/2012.09835","citing_paper":"/paper/2603.25101"},"observation_digest":"sha256:3c197f983b532d8ccfbe686d6b405fe1d56b19385f2c5064bf35b0860305f8fe","observation_id":"aeefe610-fd78-4e96-8f7e-155255447ce2","resolution":{"observed_at":"2026-05-19T17:32:41.750532Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09835","last_updated":"2022-03-23T17:58:00Z","snapshot_observed_at":"2026-08-04T23:49:53.035356Z","submitted_at":"2020-12-17T18:54:38Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","version":5},"cited_work":{"arxiv_id":"2012.09835","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.09835","snapshot_observed_at":"2026-07-09T08:06:04.153071Z","title":"Chong, and Costin Iancu","venue":"quant-ph","work_id":"b24fda1c-3d93-441d-b8aa-150e24410f15","year":2020},"citing_paper":{"arxiv_id":"2605.28723","last_updated":"2026-05-27T16:40:27Z","snapshot_observed_at":"2026-08-06T08:00:38.315717Z","submitted_at":"2026-05-27T16:40:27Z","title":"Variational Quantum Models for Knowledge Graph Embeddings on NISQ Devices","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T12:06:07.330506Z"},"links":{"cited_paper":"/paper/2012.09835","citing_paper":"/paper/2605.28723"},"observation_digest":"sha256:dd73e60687466a7ef5f55717ee3d7767595ab43ab825226d141392c31d91cf94","observation_id":"47bee557-e054-4821-a8d0-703a7f8b61de","resolution":{"observed_at":"2026-06-29T12:13:26.937698Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09835","last_updated":"2022-03-23T17:58:00Z","snapshot_observed_at":"2026-08-04T23:49:53.035356Z","submitted_at":"2020-12-17T18:54:38Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","version":5},"cited_work":{"arxiv_id":"2012.09835","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.09835","snapshot_observed_at":"2026-07-09T08:06:04.153071Z","title":"Chong, and Costin Iancu","venue":"quant-ph","work_id":"b24fda1c-3d93-441d-b8aa-150e24410f15","year":2020},"citing_paper":{"arxiv_id":"2606.04070","last_updated":"2026-06-02T14:49:10Z","snapshot_observed_at":"2026-08-06T21:57:00.714130Z","submitted_at":"2026-06-02T14:49:10Z","title":"Quantum circuit partition as a maze: emerging percolation transition via path finding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T09:51:30.881442Z"},"links":{"cited_paper":"/paper/2012.09835","citing_paper":"/paper/2606.04070"},"observation_digest":"sha256:fe7351a006b401b18f5b98db4fe7118a8610f506efa29bf3d14417db4fa8cdca","observation_id":"9e04685d-c13b-4923-94e6-f67a63f84c1e","resolution":{"observed_at":"2026-07-02T03:36:30.040440Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09835","last_updated":"2022-03-23T17:58:00Z","snapshot_observed_at":"2026-08-04T23:49:53.035356Z","submitted_at":"2020-12-17T18:54:38Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","version":5},"cited_work":{"arxiv_id":"2012.09835","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.09835","snapshot_observed_at":"2026-07-09T08:06:04.153071Z","title":"Chong, and Costin Iancu","venue":"quant-ph","work_id":"b24fda1c-3d93-441d-b8aa-150e24410f15","year":2020},"citing_paper":{"arxiv_id":"2607.07554","last_updated":"2026-07-08T15:50:54Z","snapshot_observed_at":"2026-08-07T12:04:21.366870Z","submitted_at":"2026-07-08T15:50:54Z","title":"RubriQ: Rubric-Guided Group Relative Policy Optimization for Constraint-Aware Quantum Circuit Synthesis","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-09T07:56:58.081635Z"},"links":{"cited_paper":"/paper/2012.09835","citing_paper":"/paper/2607.07554"},"observation_digest":"sha256:ee1f93a4f7e3ab0a5a3b0d16f5f7521b3c90536b4ac3806cf19ef766ede95b06","observation_id":"15c79253-2a28-4375-9ae0-ddc9b6d6f277","resolution":{"observed_at":"2026-07-09T08:06:04.154352Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2012.09835/citation-record","integrity":"/paper/2012.09835/integrity","json":"/paper/2012.09835/citation-record.json","paper":"/paper/2012.09835"},"outbound":[],"paper":{"arxiv_id":"2012.09835","last_updated":"2022-03-23T17:58:00Z","latest_version":5,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-04T23:49:53.035356Z","submitted_at":"2020-12-17T18:54:38Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2012.09835."}