{"as_of":"2026-08-08T20:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:067f7f484e506b5a498cb5cc7c15c2a874036a5398e49ea949df79650ab64e04","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-07T14:57:22.216148Z","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-12T10:51:31.947336Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.03280","last_updated":"2024-04-04T08:07:22Z","snapshot_observed_at":"2026-08-08T17:43:00.200467Z","submitted_at":"2024-04-04T08:07:22Z","title":"Faster and shorter synthesis of Hamiltonian simulation circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03280","snapshot_observed_at":"2026-08-07T14:57:22.216148Z","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":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:22.216148Z"},"links":{"cited_paper":"/paper/2404.03280","citing_paper":"/paper/2505.16891"},"observation_digest":"sha256:8355c60b51d942f68f3945c2fd20e56f374bfdb5ee777239dd6c415ef2550eef","observation_id":"e206f607-ec1a-4bfe-9c69-23fe49fb2ee1","resolution":{"observed_at":"2026-08-07T14:57:22.216148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03280","last_updated":"2024-04-04T08:07:22Z","snapshot_observed_at":"2026-08-08T17:43:00.200467Z","submitted_at":"2024-04-04T08:07:22Z","title":"Faster and shorter synthesis of Hamiltonian simulation circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03280","snapshot_observed_at":"2026-08-04T18:23:41.023414Z","title":"Faster and shorter synthesis of Hamil- tonian simulation circuits, April 2024.arXiv:2404.03280","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:41.023414Z"},"links":{"cited_paper":"/paper/2404.03280","citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:709f7a59e2fb5c637ea0f16dc015e7ea2106ade3c0bb8cd777d9758bc8de954d","observation_id":"2934d131-9229-42b2-bcfa-52a2c1bb5c00","resolution":{"observed_at":"2026-08-04T18:23:41.023414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03280","last_updated":"2024-04-04T08:07:22Z","snapshot_observed_at":"2026-08-08T17:43:00.200467Z","submitted_at":"2024-04-04T08:07:22Z","title":"Faster and shorter synthesis of Hamiltonian simulation circuits","version":1},"cited_work":{"arxiv_id":"2404.03280","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.03280","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Faster and shorter synthesis of Hamiltonian simulation circuits","venue":null,"work_id":"7f38b8d3-b379-479e-b50d-a4bd2434e4bf","year":2024},"citing_paper":{"arxiv_id":"2604.19029","last_updated":"2026-04-21T03:26:25Z","snapshot_observed_at":"2026-07-31T23:56:35.922785Z","submitted_at":"2026-04-21T03:26:25Z","title":"MonteQ: A Monte Carlo Tree Search Based Quantum Circuit Synthesis Framework","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T03:22:26.487817Z"},"links":{"cited_paper":"/paper/2404.03280","citing_paper":"/paper/2604.19029"},"observation_digest":"sha256:021ca661ab8be01f39e798c1a229cdf088da614041234c4bba6ac34c230097a8","observation_id":"6d6efccf-cc0b-4442-87e6-0cae2b7526c3","resolution":{"observed_at":"2026-05-11T12:31:06.852851Z","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":"2404.03280","last_updated":"2024-04-04T08:07:22Z","snapshot_observed_at":"2026-08-08T17:43:00.200467Z","submitted_at":"2024-04-04T08:07:22Z","title":"Faster and shorter synthesis of Hamiltonian simulation circuits","version":1},"cited_work":{"arxiv_id":"2404.03280","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.03280","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Faster and shorter synthesis of Hamiltonian simulation circuits","venue":null,"work_id":"7f38b8d3-b379-479e-b50d-a4bd2434e4bf","year":2024},"citing_paper":{"arxiv_id":"2604.26663","last_updated":"2026-04-29T13:26:54Z","snapshot_observed_at":"2026-07-06T23:12:15.279847Z","submitted_at":"2026-04-29T13:26:54Z","title":"Hardware-Efficient Hamiltonian Simulation via Trotter-Initialized Variational Optimization with Native Placement","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-07T11:28:33.462245Z"},"links":{"cited_paper":"/paper/2404.03280","citing_paper":"/paper/2604.26663"},"observation_digest":"sha256:bc03ff67edfdddcadd0cf9317d73bb6293d142242d25945fc39e29d2f6f01367","observation_id":"a74137aa-1b6c-490c-9b8c-8d43e3108a17","resolution":{"observed_at":"2026-05-12T09:21:25.316983Z","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":"2404.03280","last_updated":"2024-04-04T08:07:22Z","snapshot_observed_at":"2026-08-08T17:43:00.200467Z","submitted_at":"2024-04-04T08:07:22Z","title":"Faster and shorter synthesis of Hamiltonian simulation circuits","version":1},"cited_work":{"arxiv_id":"2404.03280","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.03280","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Faster and shorter synthesis of Hamiltonian simulation circuits","venue":null,"work_id":"7f38b8d3-b379-479e-b50d-a4bd2434e4bf","year":2024},"citing_paper":{"arxiv_id":"2605.03545","last_updated":"2026-05-05T09:16:29Z","snapshot_observed_at":"2026-07-06T23:16:25.301792Z","submitted_at":"2026-05-05T09:16:29Z","title":"Shortest Path in Pauli Forest -- An Algorithm for Decomposing Pauli Exponentials to Quantum Circuits","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-07T17:40:45.630183Z"},"links":{"cited_paper":"/paper/2404.03280","citing_paper":"/paper/2605.03545"},"observation_digest":"sha256:2e8887c8f601d82f361cc7025986fc0e8a478f273484e53c21dd1c109da8c34b","observation_id":"7b641d75-3940-4f6e-876f-ed8744cc224f","resolution":{"observed_at":"2026-05-12T10:51:31.950598Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2404.03280/citation-record","integrity":"/paper/2404.03280/integrity","json":"/paper/2404.03280/citation-record.json","paper":"/paper/2404.03280"},"outbound":[],"paper":{"arxiv_id":"2404.03280","last_updated":"2024-04-04T08:07:22Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T17:43:00.200467Z","submitted_at":"2024-04-04T08:07:22Z","title":"Faster and shorter synthesis of Hamiltonian simulation 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-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 5 inbound Pith citation observations for arXiv:2404.03280."}