{"as_of":"2026-08-20T18:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4cc3fc6c77227542b7bcab77b7dbeabf892de406a54d9a4c3d3bafd1f59ee9b","coverage":[{"denominator":3,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:13:13.725140Z","state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"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-16T05:57:35.815566Z","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-16T05:57:35.863600Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.12589","last_updated":"2025-05-09T03:01:09Z","snapshot_observed_at":"2026-08-15T14:16:02.954131Z","submitted_at":"2024-12-17T06:46:09Z","title":"Round and Communication Efficient Graph Coloring","version":2},"cited_work":{"arxiv_id":"2412.12589","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.12589","snapshot_observed_at":"2026-08-16T05:57:35.863600Z","title":"Round and Communication Efficient Graph Coloring","venue":"cs.DS","work_id":"3e2a5f01-9eaa-4f98-be93-6c39f9b44eb9","year":2024},"citing_paper":{"arxiv_id":"2504.19729","last_updated":"2025-07-07T12:44:15Z","snapshot_observed_at":"2026-08-16T10:47:10.530291Z","submitted_at":"2025-04-28T12:28:45Z","title":"Faster Dynamic $(\\Delta+1)$-Coloring Against Adaptive Adversaries","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.815566Z"},"links":{"cited_paper":"/paper/2412.12589","citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:b9796cd2d4c28d248f97b072036e285590dca1922d5757bc90b6e3fda9b5fce4","observation_id":"e4d6f6a4-aa2b-4837-a75c-6dbce6047e1d","resolution":{"observed_at":"2026-08-16T05:57:35.867996Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.12589/citation-record","integrity":"/paper/2412.12589/integrity","json":"/paper/2412.12589/citation-record.json","paper":"/paper/2412.12589"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.07027","last_updated":"2021-03-12T01:27:12Z","snapshot_observed_at":"2026-08-16T18:39:28.178717Z","submitted_at":"2021-03-12T01:27:12Z","title":"Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication","version":1},"cited_work":{"arxiv_id":"2103.07027","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.07027","snapshot_observed_at":"2026-08-11T14:13:13.859533Z","title":"Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication","venue":"cs.DS","work_id":"e11d0c40-17a5-4648-8c36-8e0f87e21b61","year":2021},"citing_paper":{"arxiv_id":"2412.12589","last_updated":"2025-05-09T03:01:09Z","snapshot_observed_at":"2026-08-15T14:16:02.954131Z","submitted_at":"2024-12-17T06:46:09Z","title":"Round and Communication Efficient Graph Coloring","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T14:13:13.719997Z"},"links":{"cited_paper":"/paper/2103.07027","citing_paper":"/paper/2412.12589"},"observation_digest":"sha256:b890d228e5f3c9b340fcf64921438ab654cbdcf3b239ecb7121f1492d2848e9c","observation_id":"9d95c625-8eff-4d9b-8a80-7b11ecb37f0d","resolution":{"observed_at":"2026-08-11T14:13:13.866162Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0070.80219","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:13:13.830411Z","title":"[MK17] Ali Mashreghi and Valerie King","venue":null,"work_id":"38fd0c74-cc8c-47e1-90ec-46a704cdef13","year":null},"citing_paper":{"arxiv_id":"2412.12589","last_updated":"2025-05-09T03:01:09Z","snapshot_observed_at":"2026-08-15T14:16:02.954131Z","submitted_at":"2024-12-17T06:46:09Z","title":"Round and Communication Efficient Graph Coloring","version":2},"reference_index":1992,"source":"pdf_text","source_observed_at":"2026-08-11T14:13:13.725140Z"},"links":{"citing_paper":"/paper/2412.12589"},"observation_digest":"sha256:38b4074d79182bf383e8384b4cabb63c057a45bcf8a6e76b6c3641ebb3333e82","observation_id":"e040b3b9-e89d-4bcb-be6a-565620df339f","resolution":{"observed_at":"2026-08-11T14:13:13.841040Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:13:13.706744Z","title":"[CFG+19] Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uit to, and Yufan Zheng","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.12589","last_updated":"2025-05-09T03:01:09Z","snapshot_observed_at":"2026-08-15T14:16:02.954131Z","submitted_at":"2024-12-17T06:46:09Z","title":"Round and Communication Efficient Graph Coloring","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T14:13:13.706744Z"},"links":{"citing_paper":"/paper/2412.12589"},"observation_digest":"sha256:a0b3a0ca45f82f1e884b9ce016a091af4248c09b376a39abea1f1772d5a6012b","observation_id":"3fa66c93-2aeb-4c5c-85e9-41d8cd76bcd9","resolution":{"observed_at":"2026-08-11T14:13:13.706744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.12589","last_updated":"2025-05-09T03:01:09Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T14:16:02.954131Z","submitted_at":"2024-12-17T06:46:09Z","title":"Round and Communication Efficient Graph Coloring"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":3},"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 3 of 3 outbound references and 1 inbound Pith citation observation for arXiv:2412.12589."}