{"as_of":"2026-08-09T02:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b11c4d0f30c80b08c6eec2f9fa1af5f49ca301a18a97cc60658271dfbb88767","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T19:23:28.174137Z","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-05-21T09:34:05.756462Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.02721","last_updated":"2025-09-02T18:18:46Z","snapshot_observed_at":"2026-08-08T07:02:09.449937Z","submitted_at":"2025-09-02T18:18:46Z","title":"Tableau-Based Framework for Efficient Logical Quantum Compilation","version":1},"cited_work":{"arxiv_id":"2509.02721","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.02721","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tableau-based framework for efficient logical quantum compilation","venue":null,"work_id":"d36a1498-b329-4278-8b12-2864e8af2426","year":2025},"citing_paper":{"arxiv_id":"2604.20013","last_updated":"2026-04-21T21:43:03Z","snapshot_observed_at":"2026-07-06T23:06:31.110859Z","submitted_at":"2026-04-21T21:43:03Z","title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T01:59:36.998867Z"},"links":{"cited_paper":"/paper/2509.02721","citing_paper":"/paper/2604.20013"},"observation_digest":"sha256:d8824479ad45b21fa704e9dfe5150c7467cf58c291dc3fc164813019886ae5ee","observation_id":"60c94b4d-060f-4043-81a8-37aef8c15f2e","resolution":{"observed_at":"2026-05-11T13:21:02.661198Z","resolver_source":"arxiv_id","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.02721","last_updated":"2025-09-02T18:18:46Z","snapshot_observed_at":"2026-08-08T07:02:09.449937Z","submitted_at":"2025-09-02T18:18:46Z","title":"Tableau-Based Framework for Efficient Logical Quantum Compilation","version":1},"cited_work":{"arxiv_id":"2509.02721","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.02721","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tableau-based framework for efficient logical quantum compilation","venue":null,"work_id":"d36a1498-b329-4278-8b12-2864e8af2426","year":2025},"citing_paper":{"arxiv_id":"2604.27058","last_updated":"2026-05-20T13:52:10Z","snapshot_observed_at":"2026-08-01T13:39:05.605829Z","submitted_at":"2026-04-29T18:00:10Z","title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-07T08:22:38.071410Z"},"links":{"cited_paper":"/paper/2509.02721","citing_paper":"/paper/2604.27058"},"observation_digest":"sha256:e9f9c27a4f11e183ff768a8b7b3488beb46d72e6907fc39579fabe3ddfc8aa6c","observation_id":"f9787560-facf-48e0-aa61-250d6acca2ca","resolution":{"observed_at":"2026-05-12T10:01:28.590049Z","resolver_source":"arxiv_id","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.02721","last_updated":"2025-09-02T18:18:46Z","snapshot_observed_at":"2026-08-08T07:02:09.449937Z","submitted_at":"2025-09-02T18:18:46Z","title":"Tableau-Based Framework for Efficient Logical Quantum Compilation","version":1},"cited_work":{"arxiv_id":"2509.02721","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.02721","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tableau-based framework for efficient logical quantum compilation","venue":null,"work_id":"d36a1498-b329-4278-8b12-2864e8af2426","year":2025},"citing_paper":{"arxiv_id":"2604.27058","last_updated":"2026-05-20T13:52:10Z","snapshot_observed_at":"2026-08-01T13:39:05.605829Z","submitted_at":"2026-04-29T18:00:10Z","title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-21T09:30:55.243056Z"},"links":{"cited_paper":"/paper/2509.02721","citing_paper":"/paper/2604.27058"},"observation_digest":"sha256:af6df928a9827e2083b9c466e4bbf15b0fdd1936e14942448c5ab419ba88acbc","observation_id":"88c1cd6b-67f8-4c34-b90b-2065c4606413","resolution":{"observed_at":"2026-05-21T09:34:05.758660Z","resolver_source":"arxiv_id","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.02721","last_updated":"2025-09-02T18:18:46Z","snapshot_observed_at":"2026-08-08T07:02:09.449937Z","submitted_at":"2025-09-02T18:18:46Z","title":"Tableau-Based Framework for Efficient Logical Quantum Compilation","version":1},"cited_work":{"arxiv_id":"2509.02721","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.02721","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tableau-based framework for efficient logical quantum compilation","venue":null,"work_id":"d36a1498-b329-4278-8b12-2864e8af2426","year":2025},"citing_paper":{"arxiv_id":"2605.12066","last_updated":"2026-05-12T12:54:59Z","snapshot_observed_at":"2026-08-08T15:20:00.306674Z","submitted_at":"2026-05-12T12:54:59Z","title":"Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-05-13T04:49:09.397479Z"},"links":{"cited_paper":"/paper/2509.02721","citing_paper":"/paper/2605.12066"},"observation_digest":"sha256:2a68d934b414e67d8aa97a83af120a30fe059e5c61e8d3c7cd112386f9813f44","observation_id":"ae40414a-9bac-4653-927a-b7b29bd612d7","resolution":{"observed_at":"2026-05-13T04:52:17.142717Z","resolver_source":"arxiv_id","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.02721","last_updated":"2025-09-02T18:18:46Z","snapshot_observed_at":"2026-08-08T07:02:09.449937Z","submitted_at":"2025-09-02T18:18:46Z","title":"Tableau-Based Framework for Efficient Logical Quantum Compilation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.02721","snapshot_observed_at":"2026-08-01T19:23:28.174137Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16996","last_updated":"2026-07-18T23:08:06Z","snapshot_observed_at":"2026-08-08T13:32:05.715158Z","submitted_at":"2026-07-18T23:08:06Z","title":"Encoding Choices and Fault-Tolerant Resource Estimates for Digital Quantum Hamiltonian Descent","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-01T19:23:28.174137Z"},"links":{"cited_paper":"/paper/2509.02721","citing_paper":"/paper/2607.16996"},"observation_digest":"sha256:b0d9604556a4b51bdea09cd2f2fc57c17003509ce07ae0373991e5d1361e6384","observation_id":"affd6a4b-1f2f-49b9-8815-877b98ca47bb","resolution":{"observed_at":"2026-08-01T19:23:28.174137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.02721/citation-record","integrity":"/paper/2509.02721/integrity","json":"/paper/2509.02721/citation-record.json","paper":"/paper/2509.02721"},"outbound":[],"paper":{"arxiv_id":"2509.02721","last_updated":"2025-09-02T18:18:46Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T07:02:09.449937Z","submitted_at":"2025-09-02T18:18:46Z","title":"Tableau-Based Framework for Efficient Logical Quantum Compilation"},"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-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 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2509.02721."}