{"as_of":"2026-08-07T15:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5c40dd2f0f0f48e29caa8b3afec6fe2c83e1ce1d1a983b5ef0497948f7c53b1","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:33:10.809254Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T02:27:35.266747Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.05874","last_updated":"2026-07-15T13:17:55Z","snapshot_observed_at":"2026-07-24T23:20:24.467180Z","submitted_at":"2024-02-08T18:08:09Z","title":"Complexity of graph-state preparation by Clifford circuits","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05874","snapshot_observed_at":"2026-08-07T10:33:10.809254Z","title":"Complexity of graph-state preparation by clifford circuits, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05478","last_updated":"2025-06-05T18:00:26Z","snapshot_observed_at":"2026-08-07T10:18:22.864902Z","submitted_at":"2025-06-05T18:00:26Z","title":"Orbit classification and analysis of qutrit graph states under local complementation and local scaling","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T10:33:10.809254Z"},"links":{"cited_paper":"/paper/2402.05874","citing_paper":"/paper/2506.05478"},"observation_digest":"sha256:756cf90b7d855581fee8da6edfb4e02a86e3e3a1bb60f62177bc7ecf8bc4c92e","observation_id":"349787e7-d51e-4990-892f-486881e5d916","resolution":{"observed_at":"2026-08-07T10:33:10.809254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05874","last_updated":"2026-07-15T13:17:55Z","snapshot_observed_at":"2026-07-24T23:20:24.467180Z","submitted_at":"2024-02-08T18:08:09Z","title":"Complexity of graph-state preparation by Clifford circuits","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05874","snapshot_observed_at":"2026-08-05T16:40:22.925985Z","title":"Complexity of graph-state preparation by clifford circuits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18375","last_updated":"2025-08-25T18:06:53Z","snapshot_observed_at":"2026-08-05T16:40:21.506715Z","submitted_at":"2025-08-25T18:06:53Z","title":"Finding trail covers: near-optimal decompositions of graph states as linear fusion networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T16:40:22.925985Z"},"links":{"cited_paper":"/paper/2402.05874","citing_paper":"/paper/2508.18375"},"observation_digest":"sha256:422ca830d2e9c2cb49627f8a25c7daabf4f96401bf9c3ba8a7ad24c9593eb7c9","observation_id":"5ecd51bf-7203-4cd1-9376-1cb2444fe8aa","resolution":{"observed_at":"2026-08-05T16:40:22.925985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05874","last_updated":"2026-07-15T13:17:55Z","snapshot_observed_at":"2026-07-24T23:20:24.467180Z","submitted_at":"2024-02-08T18:08:09Z","title":"Complexity of graph-state preparation by Clifford circuits","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05874","snapshot_observed_at":"2026-08-03T20:00:06.873581Z","title":"Complexity of graph-state prepara- tion by Clifford circuits, 2025.arXiv:2402.05874","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.22271","last_updated":"2026-07-21T18:26:30Z","snapshot_observed_at":"2026-08-06T09:16:30.633395Z","submitted_at":"2025-11-27T09:49:57Z","title":"Local Equivalences of Graph States","version":2},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-03T20:00:06.873581Z"},"links":{"cited_paper":"/paper/2402.05874","citing_paper":"/paper/2511.22271"},"observation_digest":"sha256:75df480f4264fc8bb74f13320d6dc0a903982c14d1c3d9b00fb33b8f791b578c","observation_id":"94a20fd3-27b4-4572-961e-78eaa46011e7","resolution":{"observed_at":"2026-08-03T20:00:06.873581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05874","last_updated":"2026-07-15T13:17:55Z","snapshot_observed_at":"2026-07-24T23:20:24.467180Z","submitted_at":"2024-02-08T18:08:09Z","title":"Complexity of graph-state preparation by Clifford circuits","version":4},"cited_work":{"arxiv_id":"2402.05874","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.05874","snapshot_observed_at":"2026-07-16T01:22:21.965584Z","title":"Complexity of graph- state preparation by clifford circuits","venue":null,"work_id":"2fe7e63b-b4fb-46d2-8195-bd96ffbc38ff","year":2025},"citing_paper":{"arxiv_id":"2605.06792","last_updated":"2026-05-13T14:11:22Z","snapshot_observed_at":"2026-08-01T04:00:32.231556Z","submitted_at":"2026-05-07T18:00:24Z","title":"Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-11T00:58:54.120349Z"},"links":{"cited_paper":"/paper/2402.05874","citing_paper":"/paper/2605.06792"},"observation_digest":"sha256:8b412d577179fbd40846866559cd9be612b52d0f5393483e8059fe61050f46a9","observation_id":"e8e58b61-8af5-4d90-98f1-67ae52d96ac2","resolution":{"observed_at":"2026-07-16T01:22:21.965584Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05874","last_updated":"2026-07-15T13:17:55Z","snapshot_observed_at":"2026-07-24T23:20:24.467180Z","submitted_at":"2024-02-08T18:08:09Z","title":"Complexity of graph-state preparation by Clifford circuits","version":4},"cited_work":{"arxiv_id":"2402.05874","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.05874","snapshot_observed_at":"2026-07-16T01:22:21.965584Z","title":"Complexity of graph- state preparation by clifford circuits","venue":null,"work_id":"2fe7e63b-b4fb-46d2-8195-bd96ffbc38ff","year":2025},"citing_paper":{"arxiv_id":"2605.06792","last_updated":"2026-05-13T14:11:22Z","snapshot_observed_at":"2026-08-01T04:00:32.231556Z","submitted_at":"2026-05-07T18:00:24Z","title":"Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-14T21:00:18.271186Z"},"links":{"cited_paper":"/paper/2402.05874","citing_paper":"/paper/2605.06792"},"observation_digest":"sha256:7652222830147cb898b55d8f451d7d78625da6ba02fe4a5b3989f7d8e2e40eaf","observation_id":"3ef991d7-4f45-4c35-8fde-9066798c0764","resolution":{"observed_at":"2026-07-16T01:22:21.965584Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05874","last_updated":"2026-07-15T13:17:55Z","snapshot_observed_at":"2026-07-24T23:20:24.467180Z","submitted_at":"2024-02-08T18:08:09Z","title":"Complexity of graph-state preparation by Clifford circuits","version":4},"cited_work":{"arxiv_id":"2402.05874","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.05874","snapshot_observed_at":"2026-07-16T01:22:21.965584Z","title":"Complexity of graph- state preparation by clifford circuits","venue":null,"work_id":"2fe7e63b-b4fb-46d2-8195-bd96ffbc38ff","year":2025},"citing_paper":{"arxiv_id":"2606.09785","last_updated":"2026-06-08T17:42:31Z","snapshot_observed_at":"2026-08-02T17:04:44.169209Z","submitted_at":"2026-06-08T17:42:31Z","title":"Biclique decompositions from Welzl orders","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T15:54:06.194541Z"},"links":{"cited_paper":"/paper/2402.05874","citing_paper":"/paper/2606.09785"},"observation_digest":"sha256:7248a70d0eb3625618da73db75755b508e0ac87d19eb66c76c3b18f6621f28c9","observation_id":"47687f01-6a4f-4e91-a907-80e250ebe039","resolution":{"observed_at":"2026-07-16T01:22:21.965584Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.05874/citation-record","integrity":"/paper/2402.05874/integrity","json":"/paper/2402.05874/citation-record.json","paper":"/paper/2402.05874"},"outbound":[],"paper":{"arxiv_id":"2402.05874","last_updated":"2026-07-15T13:17:55Z","latest_version":4,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-24T23:20:24.467180Z","submitted_at":"2024-02-08T18:08:09Z","title":"Complexity of graph-state preparation by Clifford circuits"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2402.05874."}