{"as_of":"2026-08-11T11:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5372a3e975bee58838ea21bb4b68211426cc67321b3bf504ba25462f86eec0e7","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-11T06:34:44.6726+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-10T22:29:43.106208Z","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-10T22:29:43.276692Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.10990","last_updated":"2021-03-19T19:17:14Z","snapshot_observed_at":"2026-08-11T06:17:57.576318Z","submitted_at":"2021-03-19T19:17:14Z","title":"Local Computation Algorithms for Coloring of Uniform Hypergraphs","version":1},"cited_work":{"arxiv_id":"2103.10990","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.10990","snapshot_observed_at":"2026-08-10T22:29:43.276692Z","title":"Local Computation Algorithms for Coloring of Uniform Hypergraphs","venue":"cs.DS","work_id":"3f7662c6-3135-406e-b914-4b296892d403","year":2021},"citing_paper":{"arxiv_id":"2501.02136","last_updated":"2025-01-03T23:03:29Z","snapshot_observed_at":"2026-08-10T22:12:07.214752Z","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations","version":1},"reference_index":1986,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:43.106208Z"},"links":{"cited_paper":"/paper/2103.10990","citing_paper":"/paper/2501.02136"},"observation_digest":"sha256:b84a4ad8dec83988bc6d29237efaa8582393961db2a7c127527eb8e5c93e932a","observation_id":"56a60a7d-5fd9-441c-88ba-27af634276bd","resolution":{"observed_at":"2026-08-10T22:29:43.280654Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10990","last_updated":"2021-03-19T19:17:14Z","snapshot_observed_at":"2026-08-11T06:17:57.576318Z","submitted_at":"2021-03-19T19:17:14Z","title":"Local Computation Algorithms for Coloring of Uniform Hypergraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.10990","snapshot_observed_at":"2026-08-01T13:00:58.404960Z","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-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.404960Z"},"links":{"cited_paper":"/paper/2103.10990","citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:d5d34bec4af6a320ff2976cf2c31c910fb756cec7770965f7c97b818fd81ac74","observation_id":"1d4ed68c-33ea-4850-b583-4397b7db996a","resolution":{"observed_at":"2026-08-01T13:00:58.404960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2103.10990/citation-record","integrity":"/paper/2103.10990/integrity","json":"/paper/2103.10990/citation-record.json","paper":"/paper/2103.10990"},"outbound":[],"paper":{"arxiv_id":"2103.10990","last_updated":"2021-03-19T19:17:14Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T06:17:57.576318Z","submitted_at":"2021-03-19T19:17:14Z","title":"Local Computation Algorithms for Coloring of Uniform Hypergraphs"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2103.10990."}