{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MDZM7EPU5EQKFBSHWHCLQHVDFV","short_pith_number":"pith:MDZM7EPU","canonical_record":{"source":{"id":"1704.02767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T09:03:11Z","cross_cats_sorted":[],"title_canon_sha256":"3d1e44bcbbdd4727710c3757c22dedc29e97b15c2465680a96d3867893d01020","abstract_canon_sha256":"d3a4a4ccf460911650b65060248f823e0bd90227f2e57329ab2f57031eee246e"},"schema_version":"1.0"},"canonical_sha256":"60f2cf91f4e920a28647b1c4b81ea32d45a403b1ad1cd18e4320edc753c4e712","source":{"kind":"arxiv","id":"1704.02767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02767","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02767v1","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02767","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"MDZM7EPU5EQK","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MDZM7EPU5EQKFBSH","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MDZM7EPU","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MDZM7EPU5EQKFBSHWHCLQHVDFV","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T09:03:11Z","cross_cats_sorted":[],"title_canon_sha256":"3d1e44bcbbdd4727710c3757c22dedc29e97b15c2465680a96d3867893d01020","abstract_canon_sha256":"d3a4a4ccf460911650b65060248f823e0bd90227f2e57329ab2f57031eee246e"},"schema_version":"1.0"},"canonical_sha256":"60f2cf91f4e920a28647b1c4b81ea32d45a403b1ad1cd18e4320edc753c4e712","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:44.463557Z","signature_b64":"6eqN4iW/MqPpACKMZvRhfCueUb80dL3eUu35iS2b+6zofLgcfyGLVbB4blJTheBsUSMvrJZ5jc4hC1bKJzF6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60f2cf91f4e920a28647b1c4b81ea32d45a403b1ad1cd18e4320edc753c4e712","last_reissued_at":"2026-05-18T00:46:44.462785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:44.462785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02767","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-18T00:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5hGKnDIlud9hBAIilSJ/v7fgAe6XfTsdLVQjj40Kcd1/M/pQO+w9MIGVccYwdFW24OjL58Si3icQ9TK83eVACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:24:00.713640Z"},"content_sha256":"b58e63b9d429b3b7ca881ab7adc3c900b00f222cf0a3974ef79cd2a9a2c8d627","schema_version":"1.0","event_id":"sha256:b58e63b9d429b3b7ca881ab7adc3c900b00f222cf0a3974ef79cd2a9a2c8d627"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MDZM7EPU5EQKFBSHWHCLQHVDFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Manuela Fischer, Mohsen Ghaffari","submitted_at":"2017-04-10T09:03:11Z","abstract_excerpt":"We present a deterministic distributed algorithm that computes a $(2\\Delta-1)$-edge-coloring, or even list-edge-coloring, in any $n$-node graph with maximum degree $\\Delta$, in $O(\\log^7 \\Delta \\log n)$ rounds. This answers one of the long-standing open questions of \\emph{distributed graph algorithms} from the late 1980s, which asked for a polylogarithmic-time algorithm. See, e.g., Open Problem 4 in the Distributed Graph Coloring book of Barenboim and Elkin. The previous best round complexities were $2^{O(\\sqrt{\\log n})}$ by Panconesi and Srinivasan [STOC'92] and $\\tilde{O}(\\sqrt{\\Delta}) + O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02767","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-18T00:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJs0gTNt+esx6AKjSyFAZ4q1G9vduicseAevK8O60GnMAzz8Gqk9pdJgfwQf2i70XnzAkOPRz8pnVQ9g2sd5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:24:00.714361Z"},"content_sha256":"97e3bb91cb66c7bb97da8f37b067ea3d1fa7cd1cf6fb4d15d67c2ebf068bbc28","schema_version":"1.0","event_id":"sha256:97e3bb91cb66c7bb97da8f37b067ea3d1fa7cd1cf6fb4d15d67c2ebf068bbc28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDZM7EPU5EQKFBSHWHCLQHVDFV/bundle.json","state_url":"https://pith.science/pith/MDZM7EPU5EQKFBSHWHCLQHVDFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDZM7EPU5EQKFBSHWHCLQHVDFV/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-26T14:24:00Z","links":{"resolver":"https://pith.science/pith/MDZM7EPU5EQKFBSHWHCLQHVDFV","bundle":"https://pith.science/pith/MDZM7EPU5EQKFBSHWHCLQHVDFV/bundle.json","state":"https://pith.science/pith/MDZM7EPU5EQKFBSHWHCLQHVDFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDZM7EPU5EQKFBSHWHCLQHVDFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MDZM7EPU5EQKFBSHWHCLQHVDFV","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":"d3a4a4ccf460911650b65060248f823e0bd90227f2e57329ab2f57031eee246e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T09:03:11Z","title_canon_sha256":"3d1e44bcbbdd4727710c3757c22dedc29e97b15c2465680a96d3867893d01020"},"schema_version":"1.0","source":{"id":"1704.02767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02767","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02767v1","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02767","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"MDZM7EPU5EQK","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MDZM7EPU5EQKFBSH","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MDZM7EPU","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:97e3bb91cb66c7bb97da8f37b067ea3d1fa7cd1cf6fb4d15d67c2ebf068bbc28","target":"graph","created_at":"2026-05-18T00:46:44Z","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 present a deterministic distributed algorithm that computes a $(2\\Delta-1)$-edge-coloring, or even list-edge-coloring, in any $n$-node graph with maximum degree $\\Delta$, in $O(\\log^7 \\Delta \\log n)$ rounds. This answers one of the long-standing open questions of \\emph{distributed graph algorithms} from the late 1980s, which asked for a polylogarithmic-time algorithm. See, e.g., Open Problem 4 in the Distributed Graph Coloring book of Barenboim and Elkin. The previous best round complexities were $2^{O(\\sqrt{\\log n})}$ by Panconesi and Srinivasan [STOC'92] and $\\tilde{O}(\\sqrt{\\Delta}) + O(","authors_text":"Fabian Kuhn, Manuela Fischer, Mohsen Ghaffari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T09:03:11Z","title":"Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02767","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:b58e63b9d429b3b7ca881ab7adc3c900b00f222cf0a3974ef79cd2a9a2c8d627","target":"record","created_at":"2026-05-18T00:46:44Z","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":"d3a4a4ccf460911650b65060248f823e0bd90227f2e57329ab2f57031eee246e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T09:03:11Z","title_canon_sha256":"3d1e44bcbbdd4727710c3757c22dedc29e97b15c2465680a96d3867893d01020"},"schema_version":"1.0","source":{"id":"1704.02767","kind":"arxiv","version":1}},"canonical_sha256":"60f2cf91f4e920a28647b1c4b81ea32d45a403b1ad1cd18e4320edc753c4e712","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60f2cf91f4e920a28647b1c4b81ea32d45a403b1ad1cd18e4320edc753c4e712","first_computed_at":"2026-05-18T00:46:44.462785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:44.462785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6eqN4iW/MqPpACKMZvRhfCueUb80dL3eUu35iS2b+6zofLgcfyGLVbB4blJTheBsUSMvrJZ5jc4hC1bKJzF6AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:44.463557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b58e63b9d429b3b7ca881ab7adc3c900b00f222cf0a3974ef79cd2a9a2c8d627","sha256:97e3bb91cb66c7bb97da8f37b067ea3d1fa7cd1cf6fb4d15d67c2ebf068bbc28"],"state_sha256":"025b059f745a2daa1f27a720d6891759c288a8a48356797473def33e5aef095c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0zouLR9headWGEAtwD/04rLvN72Q8Of4E/kD5FO/HfWpY5wHWGjQ1AJvnRLe74JX2qugLmB87cGhcx+itR6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:24:00.717467Z","bundle_sha256":"01f3959dae828e65d954ace2e4c711a2c43294e3eb00200711dc294deb5ebd32"}}