{"as_of":"2026-08-20T18:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f42714ef8b62c9b8e2ac6739ae23d9e59b7ae3b50ea37f4c324b58c05e24644c","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-20T06:33:59.587034+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-01T13:00:56.634335Z","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":"2111.14771","last_updated":"2022-10-16T14:49:50Z","snapshot_observed_at":"2026-08-16T17:38:31.581878Z","submitted_at":"2021-11-29T18:21:29Z","title":"A fast algorithm on average for solving the Hamilton Cycle problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.14771","snapshot_observed_at":"2026-08-01T13:00:56.634335Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-18T06:57:14.693814Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.634335Z"},"links":{"cited_paper":"/paper/2111.14771","citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:7ee0398dfeb6c1e167215ef19881cf5d73a092bcb48499bd3dc5a84269255f1c","observation_id":"e8f309fd-faa5-4ae0-8e74-7e6b304abd58","resolution":{"observed_at":"2026-08-01T13:00:56.634335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2111.14771/citation-record","integrity":"/paper/2111.14771/integrity","json":"/paper/2111.14771/citation-record.json","paper":"/paper/2111.14771"},"outbound":[],"paper":{"arxiv_id":"2111.14771","last_updated":"2022-10-16T14:49:50Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T17:38:31.581878Z","submitted_at":"2021-11-29T18:21:29Z","title":"A fast algorithm on average for solving the Hamilton Cycle problem"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2111.14771."}