{"as_of":"2026-08-21T09:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d471af969035fe559ed9a0b780c304952787553f06a3fc8c774659208ffbc512","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-21T06:32:19.484+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-06T17:40:19.102316Z","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-06T17:40:19.321987Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.00129","last_updated":"2025-06-26T06:52:38Z","snapshot_observed_at":"2026-08-21T08:52:05.255971Z","submitted_at":"2024-02-29T21:14:01Z","title":"Beyond Worst Case Local Computation Algorithms","version":2},"cited_work":{"arxiv_id":"2403.00129","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.00129","snapshot_observed_at":"2026-08-06T17:40:19.321987Z","title":"Beyond Worst Case Local Computation Algorithms","venue":"cs.DS","work_id":"c6776379-eb4b-4d1c-aebb-02f1f59c99b9","year":2024},"citing_paper":{"arxiv_id":"2507.10691","last_updated":"2025-07-14T18:05:02Z","snapshot_observed_at":"2026-08-21T08:51:48.013284Z","submitted_at":"2025-07-14T18:05:02Z","title":"A Fast Coloring Oracle for Average Case Hypergraphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T17:40:19.102316Z"},"links":{"cited_paper":"/paper/2403.00129","citing_paper":"/paper/2507.10691"},"observation_digest":"sha256:01b3018dd37c098e6c0417b3fff7568c828b505882cc8f0675c889749436179d","observation_id":"3f35466d-3280-482c-a800-ec7174a54563","resolution":{"observed_at":"2026-08-06T17:40:19.327729Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.00129","last_updated":"2025-06-26T06:52:38Z","snapshot_observed_at":"2026-08-21T08:52:05.255971Z","submitted_at":"2024-02-29T21:14:01Z","title":"Beyond Worst Case Local Computation Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.00129","snapshot_observed_at":"2026-08-01T13:00:55.993007Z","title":"arXiv preprint arXiv:2403.00129 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-21T08:52:16.985706Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:55.993007Z"},"links":{"cited_paper":"/paper/2403.00129","citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:ce97706d1c503987840f8ea4a64c17665e7e2be006834f75f451a51a4dfd024f","observation_id":"a7f08ad4-436b-402a-956b-a2d06405033e","resolution":{"observed_at":"2026-08-01T13:00:55.993007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.00129/citation-record","integrity":"/paper/2403.00129/integrity","json":"/paper/2403.00129/citation-record.json","paper":"/paper/2403.00129"},"outbound":[],"paper":{"arxiv_id":"2403.00129","last_updated":"2025-06-26T06:52:38Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-21T08:52:05.255971Z","submitted_at":"2024-02-29T21:14:01Z","title":"Beyond Worst Case Local Computation Algorithms"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2403.00129."}