{"as_of":"2026-08-22T10:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee926cc898791208564c12593a5b049ce48ad0b4c3a2767b36778988cfacccaf","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-22T06:32:14.747728+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-10T20:43:48.003042Z","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-10T20:43:48.206106Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.03776","last_updated":"2024-05-06T18:17:42Z","snapshot_observed_at":"2026-08-18T19:18:04.241462Z","submitted_at":"2024-05-06T18:17:42Z","title":"Near-optimal decoding algorithm for color codes using Population Annealing","version":1},"cited_work":{"arxiv_id":"2405.03776","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.03776","snapshot_observed_at":"2026-08-10T20:43:48.206106Z","title":"Near-optimal decoding algorithm for color codes using Population Annealing","venue":"quant-ph","work_id":"43221e84-1ec5-404f-8555-de33c4526e39","year":2024},"citing_paper":{"arxiv_id":"2501.07638","last_updated":"2025-08-25T10:17:04Z","snapshot_observed_at":"2026-08-17T21:38:31.731846Z","submitted_at":"2025-01-13T19:01:48Z","title":"Problem hardness of diluted Ising models: Population Annealing versus Simulated Annealing","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T20:43:48.003042Z"},"links":{"cited_paper":"/paper/2405.03776","citing_paper":"/paper/2501.07638"},"observation_digest":"sha256:b80c995526e5cf6fb62f77bf0bb0d2b87f4985cc7287231ed598bc91310c94c4","observation_id":"0dd5d6ff-f093-4a90-80dd-d00560753e22","resolution":{"observed_at":"2026-08-10T20:43:48.227216Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.03776/citation-record","integrity":"/paper/2405.03776/integrity","json":"/paper/2405.03776/citation-record.json","paper":"/paper/2405.03776"},"outbound":[],"paper":{"arxiv_id":"2405.03776","last_updated":"2024-05-06T18:17:42Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T19:18:04.241462Z","submitted_at":"2024-05-06T18:17:42Z","title":"Near-optimal decoding algorithm for color codes using Population Annealing"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2405.03776."}