{"as_of":"2026-08-12T18:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b65758131244e47bac67e95c59f05159913c6caf4ebd789ee9bc762b932f666b","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-12T06:34:41.77262+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-11T04:39:47.194132Z","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-08T05:24:31.874200Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.09813","last_updated":"2025-09-11T19:32:55Z","snapshot_observed_at":"2026-08-11T16:04:42.106031Z","submitted_at":"2025-09-11T19:32:55Z","title":"Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances","version":1},"cited_work":{"arxiv_id":"2509.09813","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.09813","snapshot_observed_at":"2026-07-08T05:24:31.874200Z","title":"Nearly optimal algorithms to learn sparse quantum hamiltonians in physically motivated distances","venue":"quant-ph","work_id":"95a74cf0-2faf-46dd-a1a9-aa9a7cd319ec","year":2025},"citing_paper":{"arxiv_id":"2604.27838","last_updated":"2026-04-30T13:23:41Z","snapshot_observed_at":"2026-07-06T23:13:15.994987Z","submitted_at":"2026-04-30T13:23:41Z","title":"Heisenberg-limited Hamiltonian learning without short-time control","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-07T05:55:37.319212Z"},"links":{"cited_paper":"/paper/2509.09813","citing_paper":"/paper/2604.27838"},"observation_digest":"sha256:48944ae4165f26ee32d816ceab6421e639d2efea010069fbe4d6e2ad39739a6e","observation_id":"d5b1ffc1-07a3-489f-8cc5-127005b2c231","resolution":{"observed_at":"2026-05-12T10:31:28.930400Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.09813","last_updated":"2025-09-11T19:32:55Z","snapshot_observed_at":"2026-08-11T16:04:42.106031Z","submitted_at":"2025-09-11T19:32:55Z","title":"Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances","version":1},"cited_work":{"arxiv_id":"2509.09813","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.09813","snapshot_observed_at":"2026-07-08T05:24:31.874200Z","title":"Nearly optimal algorithms to learn sparse quantum hamiltonians in physically motivated distances","venue":"quant-ph","work_id":"95a74cf0-2faf-46dd-a1a9-aa9a7cd319ec","year":2025},"citing_paper":{"arxiv_id":"2607.06472","last_updated":"2026-07-07T16:30:09Z","snapshot_observed_at":"2026-08-05T22:18:33.375401Z","submitted_at":"2026-07-07T16:30:09Z","title":"Provable learning separation for predicting time-evolution of quantum many-body systems","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-07-08T05:21:32.503461Z"},"links":{"cited_paper":"/paper/2509.09813","citing_paper":"/paper/2607.06472"},"observation_digest":"sha256:821d36a7a7f74938f83d23a94e3945ea6f821894b59c444fc30c5664530b7fb8","observation_id":"4fed7462-dc31-4eda-8974-5cc21e337986","resolution":{"observed_at":"2026-07-08T05:24:31.875737Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.09813","last_updated":"2025-09-11T19:32:55Z","snapshot_observed_at":"2026-08-11T16:04:42.106031Z","submitted_at":"2025-09-11T19:32:55Z","title":"Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.09813","snapshot_observed_at":"2026-08-11T04:39:47.194132Z","title":"arXiv preprint arXiv:2509.09813 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09912","last_updated":"2026-08-10T17:54:14Z","snapshot_observed_at":"2026-08-12T18:18:50.976919Z","submitted_at":"2026-08-10T17:54:14Z","title":"Learning Clifford-structured quantum unitaries and Hamiltonians","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T04:39:47.194132Z"},"links":{"cited_paper":"/paper/2509.09813","citing_paper":"/paper/2608.09912"},"observation_digest":"sha256:bd03591d6cf7a4c510e6c5ef4b0a555083872e57bcb9810735ce2fe127b40318","observation_id":"cb2aa1d3-272f-4577-83a8-d365c303d8c3","resolution":{"observed_at":"2026-08-11T04:39:47.194132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.09813/citation-record","integrity":"/paper/2509.09813/integrity","json":"/paper/2509.09813/citation-record.json","paper":"/paper/2509.09813"},"outbound":[],"paper":{"arxiv_id":"2509.09813","last_updated":"2025-09-11T19:32:55Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T16:04:42.106031Z","submitted_at":"2025-09-11T19:32:55Z","title":"Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2509.09813."}