{"as_of":"2026-08-08T18:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cdeae21ccb79cb4ce340efa6e8641898a509b89e9134be621b17369855a29847","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:23:34.476170Z","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-06T19:23:36.447036Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.10142","last_updated":"2020-02-24T10:18:44Z","snapshot_observed_at":"2026-08-04T00:40:41.644799Z","submitted_at":"2020-02-24T10:18:44Z","title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","version":1},"cited_work":{"arxiv_id":"2002.10142","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.10142","snapshot_observed_at":"2026-08-06T19:23:36.447036Z","title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","venue":"cs.DS","work_id":"bdda3de7-38cf-4693-b868-5feb8f8bb2d6","year":2020},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.476170Z"},"links":{"cited_paper":"/paper/2002.10142","citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:959fdbb0853129426e4ff26447f1ec11f9016d543a4e920e39ba2c7d65a55123","observation_id":"51e0c308-f012-4a54-816c-6075fd6e49d6","resolution":{"observed_at":"2026-08-06T19:23:36.540971Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10142","last_updated":"2020-02-24T10:18:44Z","snapshot_observed_at":"2026-08-04T00:40:41.644799Z","submitted_at":"2020-02-24T10:18:44Z","title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10142","snapshot_observed_at":"2026-08-02T23:39:19.467664Z","title":"Explicit and implicit dynamic coloring of graphs with bounded arboricity.CoRR, abs/2002.10142, 2020","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.13460","last_updated":"2026-06-15T20:31:48Z","snapshot_observed_at":"2026-08-03T18:49:33.086032Z","submitted_at":"2026-02-13T21:07:57Z","title":"Differentially Private Graph Coloring","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T23:39:19.467664Z"},"links":{"cited_paper":"/paper/2002.10142","citing_paper":"/paper/2602.13460"},"observation_digest":"sha256:0b1e014b7314fd3ff50fd078a3e49816f53afc04d77e8d16a9e15b721720f82e","observation_id":"3f76172b-6e5c-4567-a8c6-733d988a92a1","resolution":{"observed_at":"2026-08-02T23:39:19.467664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10142","last_updated":"2020-02-24T10:18:44Z","snapshot_observed_at":"2026-08-04T00:40:41.644799Z","submitted_at":"2020-02-24T10:18:44Z","title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10142","snapshot_observed_at":"2026-08-02T22:27:03.567174Z","title":"Explicit and implicit dynamic col- oring of graphs with bounded arboricity.arXiv preprint arXiv:2002.10142, 2020","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-08T09:52:03.018133Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:03.567174Z"},"links":{"cited_paper":"/paper/2002.10142","citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:2417c7931e79ba3dd3277bcf3ed738b335d018100d72df260254dc81bc750e1c","observation_id":"80f39782-b63f-4fbd-9844-ac9e00046e94","resolution":{"observed_at":"2026-08-02T22:27:03.567174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.10142/citation-record","integrity":"/paper/2002.10142/integrity","json":"/paper/2002.10142/citation-record.json","paper":"/paper/2002.10142"},"outbound":[],"paper":{"arxiv_id":"2002.10142","last_updated":"2020-02-24T10:18:44Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-04T00:40:41.644799Z","submitted_at":"2020-02-24T10:18:44Z","title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2002.10142."}