{"as_of":"2026-08-19T01:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e054703b7a0332e5865f13e81f883929741a02a15cadd41e297074d184571097","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-18T06:34:40.430872+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-12T00:24:40.696223Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-24T15:44:41.336074Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.04511","last_updated":"2021-09-04T12:45:44Z","snapshot_observed_at":"2026-08-18T20:46:33.907934Z","submitted_at":"2020-11-09T15:42:06Z","title":"Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition","version":2},"cited_work":{"arxiv_id":"2011.04511","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.04511","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition","venue":null,"work_id":"40bc5468-5b7e-48a7-8bda-6e0303ee9a20","year":2011},"citing_paper":{"arxiv_id":"2001.04235","last_updated":"2026-05-18T02:30:20Z","snapshot_observed_at":"2026-08-09T07:15:25.113383Z","submitted_at":"2020-01-10T18:51:18Z","title":"Notes on Theory of Distributed Systems","version":6},"reference_index":142,"source":"arxiv_source","source_observed_at":"2026-05-24T15:42:08.656511Z"},"links":{"cited_paper":"/paper/2011.04511","citing_paper":"/paper/2001.04235"},"observation_digest":"sha256:97f29464da3429d0e8e39c405925cf884cdfed43cd8d74f61606fc2552f2dae5","observation_id":"3f1aa7a8-a4ea-4123-96d6-95a0f3b68110","resolution":{"observed_at":"2026-05-24T15:44:41.340442Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.04511","last_updated":"2021-09-04T12:45:44Z","snapshot_observed_at":"2026-08-18T20:46:33.907934Z","submitted_at":"2020-11-09T15:42:06Z","title":"Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.04511","snapshot_observed_at":"2026-08-12T00:24:40.696223Z","title":"62nd IEEE Annual Symposium on Foundations of Computer Science , series =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.08296","last_updated":"2026-08-08T19:10:37Z","snapshot_observed_at":"2026-08-16T13:54:03.926492Z","submitted_at":"2026-08-08T19:10:37Z","title":"Truly Work-efficient Parallel Deterministic $(\\Delta+1)$-coloring and Maximal Independent Set","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T00:24:40.696223Z"},"links":{"cited_paper":"/paper/2011.04511","citing_paper":"/paper/2608.08296"},"observation_digest":"sha256:e7e81598bba4a9a51511630aced9bb02fbf4510377301faf3216c48126703730","observation_id":"29f0d9f7-ba48-4e03-b99d-ac56cc34116d","resolution":{"observed_at":"2026-08-12T00:24:40.696223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2011.04511/citation-record","integrity":"/paper/2011.04511/integrity","json":"/paper/2011.04511/citation-record.json","paper":"/paper/2011.04511"},"outbound":[],"paper":{"arxiv_id":"2011.04511","last_updated":"2021-09-04T12:45:44Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T20:46:33.907934Z","submitted_at":"2020-11-09T15:42:06Z","title":"Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2011.04511."}