{"as_of":"2026-08-07T05:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc1aaec8e3d6e6f96bad3d5cfbd4e97a06d007f2c1e9c9cdfa59c5d2c33e7a11","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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-07-10T08:07:58.802765Z","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-10T08:16:58.895226Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1303.2042","last_updated":"2013-12-13T17:31:54Z","snapshot_observed_at":"2026-07-06T03:08:16.668100Z","submitted_at":"2013-03-08T16:20:34Z","title":"Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning","version":2},"cited_work":{"arxiv_id":"1303.2042","doi":null,"metadata_source":"pith","pith_arxiv_id":"1303.2042","snapshot_observed_at":"2026-07-10T08:16:58.895226Z","title":"Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning","venue":"quant-ph","work_id":"859eece1-65e2-4469-8816-a94d6699f835","year":2013},"citing_paper":{"arxiv_id":"2606.29962","last_updated":"2026-06-29T08:38:48Z","snapshot_observed_at":"2026-08-03T03:35:03.362224Z","submitted_at":"2026-06-29T08:38:48Z","title":"BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-30T06:35:20.057918Z"},"links":{"cited_paper":"/paper/1303.2042","citing_paper":"/paper/2606.29962"},"observation_digest":"sha256:68889810271512868068af764e96de07897a5407161fc08164a9efa52da3c335","observation_id":"c04696a7-ec15-46fd-8213-2f8334f97b0f","resolution":{"observed_at":"2026-06-30T06:44:19.769900Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1303.2042","last_updated":"2013-12-13T17:31:54Z","snapshot_observed_at":"2026-07-06T03:08:16.668100Z","submitted_at":"2013-03-08T16:20:34Z","title":"Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning","version":2},"cited_work":{"arxiv_id":"1303.2042","doi":null,"metadata_source":"pith","pith_arxiv_id":"1303.2042","snapshot_observed_at":"2026-07-10T08:16:58.895226Z","title":"Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning","venue":"quant-ph","work_id":"859eece1-65e2-4469-8816-a94d6699f835","year":2013},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-06T09:51:45.285110Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/1303.2042","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:79700cab80f2e2f29e04f6498f8e84021835400c88eb16d75b0465be7934dc63","observation_id":"d813c386-9dc2-44d4-9477-e32ff42fe94e","resolution":{"observed_at":"2026-07-10T08:16:58.896472Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1303.2042/citation-record","integrity":"/paper/1303.2042/integrity","json":"/paper/1303.2042/citation-record.json","paper":"/paper/1303.2042"},"outbound":[],"paper":{"arxiv_id":"1303.2042","last_updated":"2013-12-13T17:31:54Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T03:08:16.668100Z","submitted_at":"2013-03-08T16:20:34Z","title":"Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1303.2042."}