{"as_of":"2026-08-16T01:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec67610d3b56af113a48e6d704e266508380ffdd3e5052fc29c23c25d66d219f","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:14:41.875716Z","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-13T04:42:16.319324Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0811.0596","last_updated":"2009-04-16T08:20:18Z","snapshot_observed_at":"2026-08-15T10:02:45.865289Z","submitted_at":"2008-11-04T20:24:00Z","title":"Quantum Speed-up for Approximating Partition Functions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0811.0596","snapshot_observed_at":"2026-08-14T14:14:41.875716Z","title":"2, 022340, arXiv:0811.0596","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.03903","last_updated":"2021-11-01T15:27:03Z","snapshot_observed_at":"2026-08-15T20:49:16.135578Z","submitted_at":"2019-08-11T13:13:47Z","title":"Quantum algorithm for estimating volumes of convex bodies","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-14T14:14:41.875716Z"},"links":{"cited_paper":"/paper/0811.0596","citing_paper":"/paper/1908.03903"},"observation_digest":"sha256:1278b5fdc8bdd3f66f872daad16e6843fed3dab8cd47c5d1ae5fb919ad970544","observation_id":"513b782a-62d5-4225-a9f7-49a026a6d095","resolution":{"observed_at":"2026-08-14T14:14:41.875716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0811.0596","last_updated":"2009-04-16T08:20:18Z","snapshot_observed_at":"2026-08-15T10:02:45.865289Z","submitted_at":"2008-11-04T20:24:00Z","title":"Quantum Speed-up for Approximating Partition Functions","version":3},"cited_work":{"arxiv_id":"0811.0596","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0811.0596","snapshot_observed_at":"2026-07-04T18:33:26.406776Z","title":"Quantum algorithm for approximating partition functions , Volume =","venue":null,"work_id":"de11eebf-b1bc-4ac0-ab10-b5c6b0a0f8f2","year":null},"citing_paper":{"arxiv_id":"2605.12385","last_updated":"2026-05-12T16:47:51Z","snapshot_observed_at":"2026-08-03T03:00:21.805076Z","submitted_at":"2026-05-12T16:47:51Z","title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","version":1},"reference_index":284,"source":"arxiv_source","source_observed_at":"2026-05-13T04:38:04.165728Z"},"links":{"cited_paper":"/paper/0811.0596","citing_paper":"/paper/2605.12385"},"observation_digest":"sha256:e1e255558f5a2d2301850d538fe9c284179a5e8ab3def70ec17aec1d1c2157dd","observation_id":"0fc7fe9a-b3af-4764-927f-13a2504e9a93","resolution":{"observed_at":"2026-07-04T18:33:26.406776Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/0811.0596/citation-record","integrity":"/paper/0811.0596/integrity","json":"/paper/0811.0596/citation-record.json","paper":"/paper/0811.0596"},"outbound":[],"paper":{"arxiv_id":"0811.0596","last_updated":"2009-04-16T08:20:18Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-15T10:02:45.865289Z","submitted_at":"2008-11-04T20:24:00Z","title":"Quantum Speed-up 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:0811.0596."}