{"as_of":"2026-08-08T15:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7edefed93f3e552eab44571800eb87a2bf7dd97cd9c019f58b7eeb29773ac956","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:57:36.593462Z","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-25T08:35:32.844538Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.15095","last_updated":"2024-11-02T05:11:35Z","snapshot_observed_at":"2026-08-07T09:10:19.495355Z","submitted_at":"2024-05-23T22:57:49Z","title":"Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling","version":2},"cited_work":{"arxiv_id":"2405.15095","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.15095","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Compilation for dynamically field- programmable qubit arrays with efficient and provably near-optimal scheduling","venue":null,"work_id":"84bc3161-15d5-45c1-a7d0-6b065929f065","year":2024},"citing_paper":{"arxiv_id":"2411.14037","last_updated":"2026-05-22T11:18:36Z","snapshot_observed_at":"2026-07-06T19:53:38.888574Z","submitted_at":"2024-11-21T11:39:21Z","title":"ZAP: Zoned Architecture and Performant Compiler for Field Programmable Atom Array","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-25T08:30:54.014154Z"},"links":{"cited_paper":"/paper/2405.15095","citing_paper":"/paper/2411.14037"},"observation_digest":"sha256:2063b14097d87f2f868f8d69d0dd21c2d5732be7ad36ddc3a948c9dc66b5d9d9","observation_id":"3e826813-9a80-4786-9c14-7b865755e07a","resolution":{"observed_at":"2026-05-25T08:35:32.847540Z","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":"2405.15095","last_updated":"2024-11-02T05:11:35Z","snapshot_observed_at":"2026-08-07T09:10:19.495355Z","submitted_at":"2024-05-23T22:57:49Z","title":"Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15095","snapshot_observed_at":"2026-08-07T14:57:36.593462Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16891","last_updated":"2025-05-23T16:32:39Z","snapshot_observed_at":"2026-08-07T20:50:57.760669Z","submitted_at":"2025-05-22T16:49:57Z","title":"Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems","version":2},"reference_index":178,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:36.593462Z"},"links":{"cited_paper":"/paper/2405.15095","citing_paper":"/paper/2505.16891"},"observation_digest":"sha256:62caf9029b3313a96a0bac877d7744fdec227fb7bdd3d73b118ff2589ef103f9","observation_id":"ee7d9e80-70ce-4488-a5c1-8c57d8189eb5","resolution":{"observed_at":"2026-08-07T14:57:36.593462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15095","last_updated":"2024-11-02T05:11:35Z","snapshot_observed_at":"2026-08-07T09:10:19.495355Z","submitted_at":"2024-05-23T22:57:49Z","title":"Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15095","snapshot_observed_at":"2026-08-07T10:26:04.808196Z","title":"Compilation for dy- namically field-programmable qubit arrays with efficient and provably near-optimal scheduling,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05536","last_updated":"2025-06-05T19:34:01Z","snapshot_observed_at":"2026-08-07T10:17:14.637349Z","submitted_at":"2025-06-05T19:34:01Z","title":"Quantum circuits as a game: A reinforcement learning agent for quantum compilation and its application to reconfigurable neutral atom arrays","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T10:26:04.808196Z"},"links":{"cited_paper":"/paper/2405.15095","citing_paper":"/paper/2506.05536"},"observation_digest":"sha256:4105973539c840f81c23caa6f5e06e9cf83b42c01a579a54f5eb011ffc71ae7e","observation_id":"bf2a5d52-0aca-4241-90b9-71727fc392e6","resolution":{"observed_at":"2026-08-07T10:26:04.808196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.15095/citation-record","integrity":"/paper/2405.15095/integrity","json":"/paper/2405.15095/citation-record.json","paper":"/paper/2405.15095"},"outbound":[],"paper":{"arxiv_id":"2405.15095","last_updated":"2024-11-02T05:11:35Z","latest_version":2,"primary_category":"cs.ET","snapshot_observed_at":"2026-08-07T09:10:19.495355Z","submitted_at":"2024-05-23T22:57:49Z","title":"Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling"},"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 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2405.15095."}