{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MBRE5CABD7OHVLCAGJ3XKBZVFZ","short_pith_number":"pith:MBRE5CAB","canonical_record":{"source":{"id":"1907.03797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-08T18:22:43Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7f711199968b4fef207871f992d77d850a35e0e8f433fe6046f8ad08fd197671","abstract_canon_sha256":"2579dcfb6a28e150d6e4bf67c757047cc00585b524e3c7254f6607ea9e687a38"},"schema_version":"1.0"},"canonical_sha256":"60624e88011fdc7aac4032777507352e73bc7ee437307ab891c542d51f70b552","source":{"kind":"arxiv","id":"1907.03797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03797","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03797v1","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03797","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"pith_short_12","alias_value":"MBRE5CABD7OH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MBRE5CABD7OHVLCA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MBRE5CAB","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MBRE5CABD7OHVLCAGJ3XKBZVFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-08T18:22:43Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7f711199968b4fef207871f992d77d850a35e0e8f433fe6046f8ad08fd197671","abstract_canon_sha256":"2579dcfb6a28e150d6e4bf67c757047cc00585b524e3c7254f6607ea9e687a38"},"schema_version":"1.0"},"canonical_sha256":"60624e88011fdc7aac4032777507352e73bc7ee437307ab891c542d51f70b552","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:06.828760Z","signature_b64":"LfPSiMVutwzjKa+rwfRb3YQSD8tn2hH2gsjKmwrevps9KSE7d/EEoVyQa5Fyt2DhxC+xHRk8vvUbo5XgMmvWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60624e88011fdc7aac4032777507352e73bc7ee437307ab891c542d51f70b552","last_reissued_at":"2026-05-17T23:41:06.828052Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:06.828052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03797","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"My+DN4n1LXQvZ0FEzaklFRH8gq4riDu7sLYtiDVGZ1XefahOten64zCtsDhDW/XtWyn3lwH1KSs7OZGCE0s+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:28:41.832178Z"},"content_sha256":"b94e8ed88b9c668e3362761cb056e4b6cba3510e79b7d6c7431f4edd48829114","schema_version":"1.0","event_id":"sha256:b94e8ed88b9c668e3362761cb056e4b6cba3510e79b7d6c7431f4edd48829114"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MBRE5CABD7OHVLCAGJ3XKBZVFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Deterministic Distributed Coloring Through Recursive List Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn","submitted_at":"2019-07-08T18:22:43Z","abstract_excerpt":"We provide novel deterministic distributed vertex coloring algorithms. As our main result, we give a deterministic distributed algorithm to compute a $(\\Delta+1)$-coloring of an $n$-node graph with maximum degree $\\Delta$ in $2^{O(\\sqrt{\\log\\Delta})}\\cdot\\log n$ rounds. This improves on the best previously known time complexity for a large range of values of $\\Delta$. For graphs with arboricity $a$, we obtain a deterministic distributed algorithm to compute a $(2+o(1))a$-coloring in time $2^{O(\\sqrt{\\log a})}\\cdot\\log^2 n$. Further, for graphs with bounded neighborhood independence, we show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03797","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvOOGGQI6Fm5mhYtTdsedw39rq5Al6LiWh/TwEqTo7CoCSj027cYqpFU0b4uWc0YZdAcO8Ai6mogTi1Ozm3CDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:28:41.832802Z"},"content_sha256":"bd2d9f6aff6a5c6b78ab7c50f5b5cbf67e3847612488d801d7e87f6b861b37d0","schema_version":"1.0","event_id":"sha256:bd2d9f6aff6a5c6b78ab7c50f5b5cbf67e3847612488d801d7e87f6b861b37d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/bundle.json","state_url":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T19:28:41Z","links":{"resolver":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ","bundle":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/bundle.json","state":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MBRE5CABD7OHVLCAGJ3XKBZVFZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2579dcfb6a28e150d6e4bf67c757047cc00585b524e3c7254f6607ea9e687a38","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-08T18:22:43Z","title_canon_sha256":"7f711199968b4fef207871f992d77d850a35e0e8f433fe6046f8ad08fd197671"},"schema_version":"1.0","source":{"id":"1907.03797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03797","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03797v1","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03797","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"pith_short_12","alias_value":"MBRE5CABD7OH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MBRE5CABD7OHVLCA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MBRE5CAB","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:bd2d9f6aff6a5c6b78ab7c50f5b5cbf67e3847612488d801d7e87f6b861b37d0","target":"graph","created_at":"2026-05-17T23:41:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We provide novel deterministic distributed vertex coloring algorithms. As our main result, we give a deterministic distributed algorithm to compute a $(\\Delta+1)$-coloring of an $n$-node graph with maximum degree $\\Delta$ in $2^{O(\\sqrt{\\log\\Delta})}\\cdot\\log n$ rounds. This improves on the best previously known time complexity for a large range of values of $\\Delta$. For graphs with arboricity $a$, we obtain a deterministic distributed algorithm to compute a $(2+o(1))a$-coloring in time $2^{O(\\sqrt{\\log a})}\\cdot\\log^2 n$. Further, for graphs with bounded neighborhood independence, we show th","authors_text":"Fabian Kuhn","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-08T18:22:43Z","title":"Faster Deterministic Distributed Coloring Through Recursive List Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03797","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b94e8ed88b9c668e3362761cb056e4b6cba3510e79b7d6c7431f4edd48829114","target":"record","created_at":"2026-05-17T23:41:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2579dcfb6a28e150d6e4bf67c757047cc00585b524e3c7254f6607ea9e687a38","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-08T18:22:43Z","title_canon_sha256":"7f711199968b4fef207871f992d77d850a35e0e8f433fe6046f8ad08fd197671"},"schema_version":"1.0","source":{"id":"1907.03797","kind":"arxiv","version":1}},"canonical_sha256":"60624e88011fdc7aac4032777507352e73bc7ee437307ab891c542d51f70b552","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60624e88011fdc7aac4032777507352e73bc7ee437307ab891c542d51f70b552","first_computed_at":"2026-05-17T23:41:06.828052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:06.828052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LfPSiMVutwzjKa+rwfRb3YQSD8tn2hH2gsjKmwrevps9KSE7d/EEoVyQa5Fyt2DhxC+xHRk8vvUbo5XgMmvWDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:06.828760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b94e8ed88b9c668e3362761cb056e4b6cba3510e79b7d6c7431f4edd48829114","sha256:bd2d9f6aff6a5c6b78ab7c50f5b5cbf67e3847612488d801d7e87f6b861b37d0"],"state_sha256":"1617fbb3be0e0e1109fa16ea4dd0e3ec13623917bcbbaf342fa7628883b6ca79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAXJHug2WCuQypgCLRxGv9Rp1p5X0mffNDo67tc0YNmea/P7L4nU3u59IVqC0E/E59TXsB5WY4+xpuCwS7p2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:28:41.836251Z","bundle_sha256":"22102dc0965ee957e914ac69dad17eb0f2347cb051143ceab4f5e7f946013504"}}