{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:T5X2MJEHF65GCMZPJKR4WCN6UC","short_pith_number":"pith:T5X2MJEH","schema_version":"1.0","canonical_sha256":"9f6fa624872fba61332f4aa3cb09bea0981a92047ecb27faea41d21ec99b5031","source":{"kind":"arxiv","id":"2002.10142","version":1},"attestation_state":"computed","paper":{"title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Monika Henzinger, Stefan Neumann","submitted_at":"2020-02-24T10:18:44Z","abstract_excerpt":"Graph coloring is a fundamental problem in computer science. We study the fully dynamic version of the problem in which the graph is undergoing edge insertions and deletions and we wish to maintain a vertex-coloring with small update time after each insertion and deletion.\n  We show how to maintain an $O(\\alpha \\lg n)$-coloring with polylogarithmic update time, where $n$ is the number of vertices in the graph and $\\alpha$ is the current arboricity of the graph. This improves upon a result by Solomon and Wein (ESA'18) who maintained an $O(\\alpha_{\\max}\\lg^2 n)$-coloring, where $\\alpha_{\\max}$ i"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2002.10142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-24T10:18:44Z","cross_cats_sorted":[],"title_canon_sha256":"9c7b69a645b5850e0da58981bac6750fe0fb9716ba72d9293667ca6a5b16f15d","abstract_canon_sha256":"95d7004874d9a868b5ffcea12b32999641f747cb90f90f1284b386e0c733c0a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:14.790750Z","signature_b64":"NZfbEWZcK2ajY2qF7jzrCSV5g8TYUglU1owyrbokEn76uSZ4gmzBlAOHMaHwJnwIaH2l5WcpZ/CxzfShKLUUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f6fa624872fba61332f4aa3cb09bea0981a92047ecb27faea41d21ec99b5031","last_reissued_at":"2026-07-05T00:43:14.790293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:14.790293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Monika Henzinger, Stefan Neumann","submitted_at":"2020-02-24T10:18:44Z","abstract_excerpt":"Graph coloring is a fundamental problem in computer science. We study the fully dynamic version of the problem in which the graph is undergoing edge insertions and deletions and we wish to maintain a vertex-coloring with small update time after each insertion and deletion.\n  We show how to maintain an $O(\\alpha \\lg n)$-coloring with polylogarithmic update time, where $n$ is the number of vertices in the graph and $\\alpha$ is the current arboricity of the graph. This improves upon a result by Solomon and Wein (ESA'18) who maintained an $O(\\alpha_{\\max}\\lg^2 n)$-coloring, where $\\alpha_{\\max}$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10142","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.10142/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2002.10142","created_at":"2026-07-05T00:43:14.790358+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.10142v1","created_at":"2026-07-05T00:43:14.790358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10142","created_at":"2026-07-05T00:43:14.790358+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5X2MJEHF65G","created_at":"2026-07-05T00:43:14.790358+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5X2MJEHF65GCMZP","created_at":"2026-07-05T00:43:14.790358+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5X2MJEH","created_at":"2026-07-05T00:43:14.790358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06334","citing_title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC","json":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC.json","graph_json":"https://pith.science/api/pith-number/T5X2MJEHF65GCMZPJKR4WCN6UC/graph.json","events_json":"https://pith.science/api/pith-number/T5X2MJEHF65GCMZPJKR4WCN6UC/events.json","paper":"https://pith.science/paper/T5X2MJEH"},"agent_actions":{"view_html":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC","download_json":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC.json","view_paper":"https://pith.science/paper/T5X2MJEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.10142&json=true","fetch_graph":"https://pith.science/api/pith-number/T5X2MJEHF65GCMZPJKR4WCN6UC/graph.json","fetch_events":"https://pith.science/api/pith-number/T5X2MJEHF65GCMZPJKR4WCN6UC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/action/storage_attestation","attest_author":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/action/author_attestation","sign_citation":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/action/citation_signature","submit_replication":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/action/replication_record"}},"created_at":"2026-07-05T00:43:14.790358+00:00","updated_at":"2026-07-05T00:43:14.790358+00:00"}