{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZO5O52D234VL3RK2KLUD23JEFE","short_pith_number":"pith:ZO5O52D2","schema_version":"1.0","canonical_sha256":"cbbaeee87adf2abdc55a52e83d6d24291b9eeb333dc92a0cd0da99a7095b0856","source":{"kind":"arxiv","id":"2504.19729","version":2},"attestation_state":"computed","paper":{"title":"Faster Dynamic $(\\Delta+1)$-Coloring Against Adaptive Adversaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Magn\\'us M. Halld\\'orsson, Maxime Flin","submitted_at":"2025-04-28T12:28:45Z","abstract_excerpt":"We consider the problem of maintaining a proper $(\\Delta + 1)$-vertex coloring in a graph on $n$-vertices and maximum degree $\\Delta$ undergoing edge insertions and deletions. We give a randomized algorithm with amortized update time $\\widetilde{O}( n^{2/3} )$ against adaptive adversaries, meaning that updates may depend on past decisions by the algorithm. This improves on the very recent $\\widetilde{O}( n^{8/9} )$-update-time algorithm by Behnezhad, Rajaraman, and Wasim (SODA 2025) and matches a natural barrier for dynamic $(\\Delta+1)$-coloring algorithms. The main improvements are in the den"},"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":"2504.19729","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-28T12:28:45Z","cross_cats_sorted":[],"title_canon_sha256":"698ead290fbd9f4dc7830e9b4cee7c3ed45859988df41c5cd51ccaf945729fb7","abstract_canon_sha256":"6aee59bd7e928ae8671faa06bdf1afbca0d90a16a322b6ae73593c8832078ff5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:04.942010Z","signature_b64":"OaojLy70HU81/CKl/yykJX6DUfkcxSxcZbHKPj53fbFWb3oisbC4hjV12eVfEx/Gf09LhT4DQZUx2xlgZ0ZBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbbaeee87adf2abdc55a52e83d6d24291b9eeb333dc92a0cd0da99a7095b0856","last_reissued_at":"2026-07-05T11:33:04.941546Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:04.941546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Dynamic $(\\Delta+1)$-Coloring Against Adaptive Adversaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Magn\\'us M. Halld\\'orsson, Maxime Flin","submitted_at":"2025-04-28T12:28:45Z","abstract_excerpt":"We consider the problem of maintaining a proper $(\\Delta + 1)$-vertex coloring in a graph on $n$-vertices and maximum degree $\\Delta$ undergoing edge insertions and deletions. We give a randomized algorithm with amortized update time $\\widetilde{O}( n^{2/3} )$ against adaptive adversaries, meaning that updates may depend on past decisions by the algorithm. This improves on the very recent $\\widetilde{O}( n^{8/9} )$-update-time algorithm by Behnezhad, Rajaraman, and Wasim (SODA 2025) and matches a natural barrier for dynamic $(\\Delta+1)$-coloring algorithms. The main improvements are in the den"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19729","kind":"arxiv","version":2},"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/2504.19729/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":"2504.19729","created_at":"2026-07-05T11:33:04.941601+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.19729v2","created_at":"2026-07-05T11:33:04.941601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19729","created_at":"2026-07-05T11:33:04.941601+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZO5O52D234VL","created_at":"2026-07-05T11:33:04.941601+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZO5O52D234VL3RK2","created_at":"2026-07-05T11:33:04.941601+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZO5O52D2","created_at":"2026-07-05T11:33:04.941601+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZO5O52D234VL3RK2KLUD23JEFE","json":"https://pith.science/pith/ZO5O52D234VL3RK2KLUD23JEFE.json","graph_json":"https://pith.science/api/pith-number/ZO5O52D234VL3RK2KLUD23JEFE/graph.json","events_json":"https://pith.science/api/pith-number/ZO5O52D234VL3RK2KLUD23JEFE/events.json","paper":"https://pith.science/paper/ZO5O52D2"},"agent_actions":{"view_html":"https://pith.science/pith/ZO5O52D234VL3RK2KLUD23JEFE","download_json":"https://pith.science/pith/ZO5O52D234VL3RK2KLUD23JEFE.json","view_paper":"https://pith.science/paper/ZO5O52D2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.19729&json=true","fetch_graph":"https://pith.science/api/pith-number/ZO5O52D234VL3RK2KLUD23JEFE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZO5O52D234VL3RK2KLUD23JEFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZO5O52D234VL3RK2KLUD23JEFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZO5O52D234VL3RK2KLUD23JEFE/action/storage_attestation","attest_author":"https://pith.science/pith/ZO5O52D234VL3RK2KLUD23JEFE/action/author_attestation","sign_citation":"https://pith.science/pith/ZO5O52D234VL3RK2KLUD23JEFE/action/citation_signature","submit_replication":"https://pith.science/pith/ZO5O52D234VL3RK2KLUD23JEFE/action/replication_record"}},"created_at":"2026-07-05T11:33:04.941601+00:00","updated_at":"2026-07-05T11:33:04.941601+00:00"}