{"as_of":"2026-08-09T07:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aabf069b09e667b83c66aa59350734c245ffcfaa71e78dff79ad42af756ac1c3","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-09T06:31:02.800959+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-01T05:02:01.243227Z","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-01T06:16:24.888925Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1304.1831","last_updated":"2013-04-05T22:36:46Z","snapshot_observed_at":"2026-08-08T13:43:28.846612Z","submitted_at":"2013-04-05T22:36:46Z","title":"Limits of local algorithms over sparse random graphs","version":1},"cited_work":{"arxiv_id":"1304.1831","doi":"10.48550/arxiv.1304.1831","metadata_source":"pith","pith_arxiv_id":"1304.1831","snapshot_observed_at":"2026-08-01T06:16:24.888925Z","title":"Limits of local algorithms over sparse random graphs","venue":"math.PR","work_id":"75689967-761e-4803-aa93-a029c4511358","year":2013},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.243227Z"},"links":{"cited_paper":"/paper/1304.1831","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:7629f748f396986f078c21e447fa6dd218fd1026bdeddcf19473263acc7c0751","observation_id":"4e90d629-ab45-4edc-a95c-1bf412ecd9d2","resolution":{"observed_at":"2026-08-01T05:03:24.543913Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:07.494862+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.494862+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1304.1831/citation-record","integrity":"/paper/1304.1831/integrity","json":"/paper/1304.1831/citation-record.json","paper":"/paper/1304.1831"},"outbound":[],"paper":{"arxiv_id":"1304.1831","last_updated":"2013-04-05T22:36:46Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-08T13:43:28.846612Z","submitted_at":"2013-04-05T22:36:46Z","title":"Limits of local algorithms over sparse random graphs"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1304.1831."}