{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:43UC4QSHLXHQWXV6H3IHZ3YHET","short_pith_number":"pith:43UC4QSH","canonical_record":{"source":{"id":"1711.01361","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-03T23:46:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a72bc5d7eec4abf22841aef40185fa9add51081e18b6fd574cce5554d305fd62","abstract_canon_sha256":"3420caa78f5b587c2aa1cafbeebe67552b36fadd4d3bb4d1871e245e2b041c50"},"schema_version":"1.0"},"canonical_sha256":"e6e82e42475dcf0b5ebe3ed07cef0724cb0318db96d49108352d4e6401964b52","source":{"kind":"arxiv","id":"1711.01361","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01361","created_at":"2026-05-17T23:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01361v3","created_at":"2026-05-17T23:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01361","created_at":"2026-05-17T23:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"43UC4QSHLXHQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"43UC4QSHLXHQWXV6","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"43UC4QSH","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:43UC4QSHLXHQWXV6H3IHZ3YHET","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01361","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-03T23:46:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a72bc5d7eec4abf22841aef40185fa9add51081e18b6fd574cce5554d305fd62","abstract_canon_sha256":"3420caa78f5b587c2aa1cafbeebe67552b36fadd4d3bb4d1871e245e2b041c50"},"schema_version":"1.0"},"canonical_sha256":"e6e82e42475dcf0b5ebe3ed07cef0724cb0318db96d49108352d4e6401964b52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:34.352309Z","signature_b64":"WeCn5jJAN3t7rH5gG3pdylla9lC5NFehJdnhkH8AjDXjCqHUkE3lsZ3AN8s6tGbJvrN1yJUyEFN+XWPMtEGICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e82e42475dcf0b5ebe3ed07cef0724cb0318db96d49108352d4e6401964b52","last_reissued_at":"2026-05-17T23:51:34.351537Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:34.351537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01361","source_version":3,"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:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77sp28fGPozxngPqSiZrdzCylPWlPTeHQ659NCIamm4ToruUAe1KNarZtz8Ny1ktHzrBZ6b9Jjzh81vf3bpxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:50:50.395020Z"},"content_sha256":"04393adbf879fda218a67bb82371f3f3dcb2f86067de5fe3c8f7a4ee2de7608f","schema_version":"1.0","event_id":"sha256:04393adbf879fda218a67bb82371f3f3dcb2f86067de5fe3c8f7a4ee2de7608f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:43UC4QSHLXHQWXV6H3IHZ3YHET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Distributed $(\\Delta+1)$-Coloring Algorithm?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Seth Pettie, Wenzheng Li, Yi-Jun Chang","submitted_at":"2017-11-03T23:46:52Z","abstract_excerpt":"Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for $(\\Delta+1)$-list coloring in the randomized ${\\sf LOCAL}$ model running in $O(\\mathsf{Det}_{\\scriptscriptstyle d}(\\text{poly} \\log n))$ time, where $\\mathsf{Det}_{\\scriptscriptstyle d}(n')$ is the deterministic complexity of $(\\text{deg}+1)$-list coloring on $n'$-vertex graphs. (In this problem, each $v$ has a palette of size $\\text{deg}(v)+1$.) This improves upon a previous randomized algorithm of Harris, Schneider, and Su [STOC'16, JACM'18] with com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01361","kind":"arxiv","version":3},"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:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rlc8SqjAVxuQdWgy8trP9pThajkEOkg3Al1d+XCkcDsDA3NxbhbgTmoDCb/XxYliyN2wCBguupFA67Y8wcnKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:50:50.395382Z"},"content_sha256":"b34765c9244bfbe7c6f361835a8ff3c7fb646769d78f078e5ac40c20a39233a4","schema_version":"1.0","event_id":"sha256:b34765c9244bfbe7c6f361835a8ff3c7fb646769d78f078e5ac40c20a39233a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/bundle.json","state_url":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/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-06-26T08:50:50Z","links":{"resolver":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET","bundle":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/bundle.json","state":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:43UC4QSHLXHQWXV6H3IHZ3YHET","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":"3420caa78f5b587c2aa1cafbeebe67552b36fadd4d3bb4d1871e245e2b041c50","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-03T23:46:52Z","title_canon_sha256":"a72bc5d7eec4abf22841aef40185fa9add51081e18b6fd574cce5554d305fd62"},"schema_version":"1.0","source":{"id":"1711.01361","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01361","created_at":"2026-05-17T23:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01361v3","created_at":"2026-05-17T23:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01361","created_at":"2026-05-17T23:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"43UC4QSHLXHQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"43UC4QSHLXHQWXV6","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"43UC4QSH","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:b34765c9244bfbe7c6f361835a8ff3c7fb646769d78f078e5ac40c20a39233a4","target":"graph","created_at":"2026-05-17T23:51:34Z","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":"Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for $(\\Delta+1)$-list coloring in the randomized ${\\sf LOCAL}$ model running in $O(\\mathsf{Det}_{\\scriptscriptstyle d}(\\text{poly} \\log n))$ time, where $\\mathsf{Det}_{\\scriptscriptstyle d}(n')$ is the deterministic complexity of $(\\text{deg}+1)$-list coloring on $n'$-vertex graphs. (In this problem, each $v$ has a palette of size $\\text{deg}(v)+1$.) This improves upon a previous randomized algorithm of Harris, Schneider, and Su [STOC'16, JACM'18] with com","authors_text":"Seth Pettie, Wenzheng Li, Yi-Jun Chang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-03T23:46:52Z","title":"An Optimal Distributed $(\\Delta+1)$-Coloring Algorithm?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01361","kind":"arxiv","version":3},"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:04393adbf879fda218a67bb82371f3f3dcb2f86067de5fe3c8f7a4ee2de7608f","target":"record","created_at":"2026-05-17T23:51:34Z","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":"3420caa78f5b587c2aa1cafbeebe67552b36fadd4d3bb4d1871e245e2b041c50","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-03T23:46:52Z","title_canon_sha256":"a72bc5d7eec4abf22841aef40185fa9add51081e18b6fd574cce5554d305fd62"},"schema_version":"1.0","source":{"id":"1711.01361","kind":"arxiv","version":3}},"canonical_sha256":"e6e82e42475dcf0b5ebe3ed07cef0724cb0318db96d49108352d4e6401964b52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6e82e42475dcf0b5ebe3ed07cef0724cb0318db96d49108352d4e6401964b52","first_computed_at":"2026-05-17T23:51:34.351537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:34.351537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WeCn5jJAN3t7rH5gG3pdylla9lC5NFehJdnhkH8AjDXjCqHUkE3lsZ3AN8s6tGbJvrN1yJUyEFN+XWPMtEGICA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:34.352309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01361","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04393adbf879fda218a67bb82371f3f3dcb2f86067de5fe3c8f7a4ee2de7608f","sha256:b34765c9244bfbe7c6f361835a8ff3c7fb646769d78f078e5ac40c20a39233a4"],"state_sha256":"0665ca665d0afbab5a894cbcc0c5e4c2fdabe47e54cf8a2dac93d69129d22c42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99yCF416ympTneRVxpyBU3o17b/NGHwAc94N2lA25KboTXX8of6aAReGj+h7d9HMmDHJvec1I+rQjLpvNy8YDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T08:50:50.397616Z","bundle_sha256":"89aaa8bf8e51cbafa139e8fe50f1739c6961dd8efa326792b04052033685b823"}}