{"as_of":"2026-08-07T14:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c3473e5e161b49e1688765d76743b5bb816e5349032131293912ec2a4c35fd08","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T21:47:42.282338Z","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-08-04T21:47:44.751693Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.08643","last_updated":"2023-01-07T09:40:50Z","snapshot_observed_at":"2026-08-07T08:09:33.298644Z","submitted_at":"2022-07-18T14:41:48Z","title":"A Sublinear-Time Quantum Algorithm for Approximating Partition Functions","version":2},"cited_work":{"arxiv_id":"2207.08643","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.08643","snapshot_observed_at":"2026-08-04T21:47:44.751693Z","title":"A Sublinear-Time Quantum Algorithm for Approximating Partition Functions","venue":"quant-ph","work_id":"bad1c97b-8087-4b18-b1a4-736622f34171","year":2022},"citing_paper":{"arxiv_id":"2509.08030","last_updated":"2025-09-09T14:54:52Z","snapshot_observed_at":"2026-08-07T13:25:07.749353Z","submitted_at":"2025-09-09T14:54:52Z","title":"Circuit-Efficient Randomized Quantum Simulation of Non-Unitary Dynamics with Observable-Driven and Symmetry-Aware Designs","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-04T21:47:42.282338Z"},"links":{"cited_paper":"/paper/2207.08643","citing_paper":"/paper/2509.08030"},"observation_digest":"sha256:f8357779d9f570d220f52e8c926d02d6999a10e34e6ebc0bc4bf9a078d3a27c7","observation_id":"17c5bc9e-21c6-400d-b420-4379f7688630","resolution":{"observed_at":"2026-08-04T21:47:44.790019Z","resolver_source":"local_arxiv","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/2207.08643/citation-record","integrity":"/paper/2207.08643/integrity","json":"/paper/2207.08643/citation-record.json","paper":"/paper/2207.08643"},"outbound":[],"paper":{"arxiv_id":"2207.08643","last_updated":"2023-01-07T09:40:50Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T08:09:33.298644Z","submitted_at":"2022-07-18T14:41:48Z","title":"A Sublinear-Time Quantum Algorithm for Approximating Partition Functions"},"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 1 inbound Pith citation observation for arXiv:2207.08643."}