{"as_of":"2026-08-06T14:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:342d6d5103e7d0647337c490fcee98b25a95c84194613524f976feeda4c98572","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-06T06:34:29.942622+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-03T07:11:03.035801Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.11568","last_updated":"2021-02-01T13:59:44Z","snapshot_observed_at":"2026-08-05T14:54:28.816110Z","submitted_at":"2020-04-24T07:21:43Z","title":"Efficient Algorithms for Approximating Quantum Partition Functions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.11568","snapshot_observed_at":"2026-08-03T07:11:03.035801Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.21140","last_updated":"2026-07-14T04:46:06Z","snapshot_observed_at":"2026-08-06T13:03:08.648880Z","submitted_at":"2026-01-29T00:49:31Z","title":"Efficient Algorithms for Weakly-Interacting Quantum Spin Systems","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:03.035801Z"},"links":{"cited_paper":"/paper/2004.11568","citing_paper":"/paper/2601.21140"},"observation_digest":"sha256:2ecf59d7fc4c6b55cb48ced3eb485f6a4310671e859614a1a179155ffbfd35ac","observation_id":"c1def49c-c7ea-4ea2-bea9-108c2a91aa08","resolution":{"observed_at":"2026-08-03T07:11:03.035801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2004.11568/citation-record","integrity":"/paper/2004.11568/integrity","json":"/paper/2004.11568/citation-record.json","paper":"/paper/2004.11568"},"outbound":[],"paper":{"arxiv_id":"2004.11568","last_updated":"2021-02-01T13:59:44Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-05T14:54:28.816110Z","submitted_at":"2020-04-24T07:21:43Z","title":"Efficient Algorithms for Approximating Quantum 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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2004.11568."}