{"as_of":"2026-08-20T12:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b8544913ff9618b6f4678f4afb54064d1d55c8e4e4c9e4c2fb7cb8da11a5b83","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:57:35.831694Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2504.19729/citation-record","integrity":"/paper/2504.19729/integrity","json":"/paper/2504.19729/citation-record.json","paper":"/paper/2504.19729"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:35.924800Z","title":"In Ioana Oriana Bercea and Rasmus Pagh, editors,2025 Symposium on Simplicity in Algorithms, SOSA 2025, New Orleans, LA, USA, January 13-15, 2025 , pages 1–8","venue":null,"work_id":"17fab634-747e-4912-9a90-0a74a4fb23aa","year":2025},"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":1,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.804507Z"},"links":{"citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:e2f0f8ebfb8e48c5530f433ef82e894db74e655e7d3dd41ee89b69ad58d7f2ea","observation_id":"a92bbec7-d5c1-4261-a5f1-31240a838a35","resolution":{"observed_at":"2026-08-16T05:57:35.927071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:35.872751Z","title":"Halld´ orsson, Fabian Kuhn, Yannic Maus, and Tigran Tonoyan","venue":null,"work_id":"86a50c52-c42c-421d-8045-df2edac2d4e4","year":2021},"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":10,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.827538Z"},"links":{"citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:22c07c49550b23a73e9b1f2ea16bcd2ecbcee5af36c93fb4c7432ed340a0305f","observation_id":"9361a784-b64f-436b-bbfc-615165706db7","resolution":{"observed_at":"2026-08-16T05:57:35.875542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2105.04700","last_updated":"2021-05-10T22:49:48Z","snapshot_observed_at":"2026-08-16T18:25:42.554571Z","submitted_at":"2021-05-10T22:49:48Z","title":"Ultrafast Distributed Coloring of High Degree Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.04700","snapshot_observed_at":"2026-08-16T05:57:35.829528Z","title":"Halld´ orsson, Alexandre Nolin, and Tigran Tonoyan","venue":null,"work_id":null,"year":null},"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":11,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.829528Z"},"links":{"cited_paper":"/paper/2105.04700","citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:8deaffec6b2490dd7eaa349573411af18a043b0eb7821f2693b86db3c26d2c1a","observation_id":"d3096231-446e-4d48-8296-66a37d6465e5","resolution":{"observed_at":"2026-08-16T05:57:35.829528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:35.900038Z","title":"(2∆ - l)-edge-coloring is much easier than maximal matching in the distributed setting","venue":null,"work_id":"f7c62dde-318e-4b88-b93d-ad8f027dcc6f","year":2015},"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":2009,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.818733Z"},"links":{"citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:9989883389d0e0d96c7d62849aee437e1d774d6c5fa2cbe3ea2b2b79ee8abd90","observation_id":"c9f2abef-5e72-4ee1-93b1-886897ea3094","resolution":{"observed_at":"2026-08-16T05:57:35.902195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:35.894014Z","title":"Halld´ orsson, Fabian Kuhn, and Alexandre Nolin","venue":null,"work_id":"d739461a-20c3-4a4a-ba7c-71f17bd985bd","year":2023},"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":2015,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.821819Z"},"links":{"citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:0fba95ab5aa58aaa2d21e9849d215022b0b0c351266106371fb5d8b96d9d5b0c","observation_id":"6e0209fa-b669-41c9-8698-6ffa4dbf570f","resolution":{"observed_at":"2026-08-16T05:57:35.896262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2102.05077","last_updated":"2025-01-04T16:18:17Z","snapshot_observed_at":"2026-08-16T18:46:40.519108Z","submitted_at":"2021-02-09T19:06:35Z","title":"The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.05077","snapshot_observed_at":"2026-08-16T05:57:35.831694Z","title":"The multiplicative version of azuma’s inequality, with an application to contention analysis","venue":null,"work_id":null,"year":null},"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":2018,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.831694Z"},"links":{"cited_paper":"/paper/2102.05077","citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:cad3427a600430cd9d44653fe9dba6f8ac3ebc89fbac7c1ce5cfaf4fe882ef45","observation_id":"f1181c32-3100-4211-a3bb-0f23d83a5fdd","resolution":{"observed_at":"2026-08-16T05:57:35.831694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:35.906182Z","title":"The complexity of (∆+1) coloring in congested clique, massively parallel computation, and centralized local com- putation","venue":null,"work_id":"4a32078e-f510-4b95-b53a-c99104c3b144","year":2019},"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":2021,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.813471Z"},"links":{"citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:4933941c531923818dbf2bc492288c4dcc26291858f3a265af9687e3972bf513","observation_id":"1f634430-5c92-4a17-88b9-22463c45fdcf","resolution":{"observed_at":"2026-08-16T05:57:35.908964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:35.912958Z","title":"Fully dynamic (∆ + 1)-coloring against adaptive adversaries","venue":null,"work_id":"bf8a7eba-e3fb-46b9-8eb5-1d24b62d0a37","year":2025},"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":2022,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.810634Z"},"links":{"citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:5b54695b59fc70345d5739bab8f74bad0bada92d86ba3eb1eaad6479bd50e77d","observation_id":"2f862734-4c59-46d5-abe4-2abd99fb0e81","resolution":{"observed_at":"2026-08-16T05:57:35.915474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:35.888007Z","title":"Halld´ orsson, Fabian Kuhn, and Alexandre Nolin","venue":null,"work_id":"7ea1fd55-1eb2-403f-9e3f-825f4c4f37a0","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":2023,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.823876Z"},"links":{"citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:48067ad21add28e450eda2819693b79a878e07db545c014ef7b65cf92fe801bf","observation_id":"b8677ca7-494f-4fdc-a7dd-e8ee496bd4bb","resolution":{"observed_at":"2026-08-16T05:57:35.890174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:35.880500Z","title":"(∆+1) vertex coloring in O(n) communication","venue":null,"work_id":"6e9a67a4-7402-4f4a-9a87-4f1ea7fa04ae","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":2024,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.825719Z"},"links":{"citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:8870c0d9ba70e644a209ecb9806a1ec52ff38818267396282c746ac3191d9c59","observation_id":"f826e217-efef-44a5-89d7-f1e6798527f3","resolution":{"observed_at":"2026-08-16T05:57:35.882978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:35.919492Z","title":"Dynamic algorithms for graph coloring","venue":null,"work_id":"40d2571f-8a9e-4070-87e7-d2bb8f6fc8ff","year":2018},"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":2025,"source":"pdf_text","source_observed_at":"2026-08-16T05:57:35.807848Z"},"links":{"citing_paper":"/paper/2504.19729"},"observation_digest":"sha256:eb6e14564019d11355128ea989ddc296cc2539e15c970004a597986657540894","observation_id":"8a6ef730-ff18-4152-89b8-86bc9aafe3d6","resolution":{"observed_at":"2026-08-16T05:57:35.921421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2504.19729","last_updated":"2025-07-07T12:44:15Z","latest_version":2,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":9},"total_outbound_references":12},"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 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2504.19729."}