{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:22FBGMJWBGFOGMW6JVJOAKTOJD","short_pith_number":"pith:22FBGMJW","canonical_record":{"source":{"id":"1711.05469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T09:22:14Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"67546b1ec80175728437cccdd7c1d6dfab8fd6dd662d6d61cc7e767e8327d844","abstract_canon_sha256":"6999ce9a0ad1ba14e165d5504bfb31081bf595dc75095bd6221419bd36ec6bc1"},"schema_version":"1.0"},"canonical_sha256":"d68a133136098ae332de4d52e02a6e48c011f077a8c85b502e69dad5669c0012","source":{"kind":"arxiv","id":"1711.05469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05469","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05469v1","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05469","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"pith_short_12","alias_value":"22FBGMJWBGFO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"22FBGMJWBGFOGMW6","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"22FBGMJW","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:22FBGMJWBGFOGMW6JVJOAKTOJD","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T09:22:14Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"67546b1ec80175728437cccdd7c1d6dfab8fd6dd662d6d61cc7e767e8327d844","abstract_canon_sha256":"6999ce9a0ad1ba14e165d5504bfb31081bf595dc75095bd6221419bd36ec6bc1"},"schema_version":"1.0"},"canonical_sha256":"d68a133136098ae332de4d52e02a6e48c011f077a8c85b502e69dad5669c0012","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:29.718002Z","signature_b64":"TwSTaTAhzzwK2Nm/RifDZqJQ9E3zdkzbhLej2Hf4L+M2KTrN1hmT4jJJnMt+GGdLMGFpqFNT2LiPK88oeHMQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d68a133136098ae332de4d52e02a6e48c011f077a8c85b502e69dad5669c0012","last_reissued_at":"2026-05-18T00:30:29.717293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:29.717293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05469","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:30:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PeIEjlFQvAFaUeWQqNgQh47FoOFpaMy2aMxuVttPf0113jKhY8m5X0E2evp3y6pNoA+rfLVl+k0Hv58a+T3LDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:36:04.059067Z"},"content_sha256":"226472d605cdcf8915ce45cd019926e240da743f97bb609e8e987744b04bc085","schema_version":"1.0","event_id":"sha256:226472d605cdcf8915ce45cd019926e240da743f97bb609e8e987744b04bc085"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:22FBGMJWBGFOGMW6JVJOAKTOJD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Distributed Edge-Coloring with Fewer Colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Jara Uitto, Mohsen Ghaffari, Yannic Maus","submitted_at":"2017-11-15T09:22:14Z","abstract_excerpt":"We present a deterministic distributed algorithm, in the LOCAL model, that computes a $(1+o(1))\\Delta$-edge-coloring in polylogarithmic-time, so long as the maximum degree $\\Delta=\\tilde{\\Omega}(\\log n)$. For smaller $\\Delta$, we give a polylogarithmic-time $3\\Delta/2$-edge-coloring. These are the first deterministic algorithms to go below the natural barrier of $2\\Delta-1$ colors, and they improve significantly on the recent polylogarithmic-time $(2\\Delta-1)(1+o(1))$-edge-coloring of Ghaffari and Su [SODA'17] and the $(2\\Delta-1)$-edge-coloring of Fischer, Ghaffari, and Kuhn [FOCS'17], positi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05469","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:30:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/K6oONGuxmkXDPjAEEFrur1culbER+uebwYuBusdP24Bq/WIQvb5xJTkPgzUJe8ngI+IRLmJ1v6MRT2uEJhlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:36:04.059634Z"},"content_sha256":"9cfdcc8d18d3a2692f24d6c525e0e71d6b428657796877140256da0afe1b43c6","schema_version":"1.0","event_id":"sha256:9cfdcc8d18d3a2692f24d6c525e0e71d6b428657796877140256da0afe1b43c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22FBGMJWBGFOGMW6JVJOAKTOJD/bundle.json","state_url":"https://pith.science/pith/22FBGMJWBGFOGMW6JVJOAKTOJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22FBGMJWBGFOGMW6JVJOAKTOJD/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-02T06:36:04Z","links":{"resolver":"https://pith.science/pith/22FBGMJWBGFOGMW6JVJOAKTOJD","bundle":"https://pith.science/pith/22FBGMJWBGFOGMW6JVJOAKTOJD/bundle.json","state":"https://pith.science/pith/22FBGMJWBGFOGMW6JVJOAKTOJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22FBGMJWBGFOGMW6JVJOAKTOJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:22FBGMJWBGFOGMW6JVJOAKTOJD","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":"6999ce9a0ad1ba14e165d5504bfb31081bf595dc75095bd6221419bd36ec6bc1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T09:22:14Z","title_canon_sha256":"67546b1ec80175728437cccdd7c1d6dfab8fd6dd662d6d61cc7e767e8327d844"},"schema_version":"1.0","source":{"id":"1711.05469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05469","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05469v1","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05469","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"pith_short_12","alias_value":"22FBGMJWBGFO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"22FBGMJWBGFOGMW6","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"22FBGMJW","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:9cfdcc8d18d3a2692f24d6c525e0e71d6b428657796877140256da0afe1b43c6","target":"graph","created_at":"2026-05-18T00:30:29Z","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, in the LOCAL model, that computes a $(1+o(1))\\Delta$-edge-coloring in polylogarithmic-time, so long as the maximum degree $\\Delta=\\tilde{\\Omega}(\\log n)$. For smaller $\\Delta$, we give a polylogarithmic-time $3\\Delta/2$-edge-coloring. These are the first deterministic algorithms to go below the natural barrier of $2\\Delta-1$ colors, and they improve significantly on the recent polylogarithmic-time $(2\\Delta-1)(1+o(1))$-edge-coloring of Ghaffari and Su [SODA'17] and the $(2\\Delta-1)$-edge-coloring of Fischer, Ghaffari, and Kuhn [FOCS'17], positi","authors_text":"Fabian Kuhn, Jara Uitto, Mohsen Ghaffari, Yannic Maus","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T09:22:14Z","title":"Deterministic Distributed Edge-Coloring with Fewer Colors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05469","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:226472d605cdcf8915ce45cd019926e240da743f97bb609e8e987744b04bc085","target":"record","created_at":"2026-05-18T00:30:29Z","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":"6999ce9a0ad1ba14e165d5504bfb31081bf595dc75095bd6221419bd36ec6bc1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T09:22:14Z","title_canon_sha256":"67546b1ec80175728437cccdd7c1d6dfab8fd6dd662d6d61cc7e767e8327d844"},"schema_version":"1.0","source":{"id":"1711.05469","kind":"arxiv","version":1}},"canonical_sha256":"d68a133136098ae332de4d52e02a6e48c011f077a8c85b502e69dad5669c0012","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d68a133136098ae332de4d52e02a6e48c011f077a8c85b502e69dad5669c0012","first_computed_at":"2026-05-18T00:30:29.717293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:29.717293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TwSTaTAhzzwK2Nm/RifDZqJQ9E3zdkzbhLej2Hf4L+M2KTrN1hmT4jJJnMt+GGdLMGFpqFNT2LiPK88oeHMQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:29.718002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:226472d605cdcf8915ce45cd019926e240da743f97bb609e8e987744b04bc085","sha256:9cfdcc8d18d3a2692f24d6c525e0e71d6b428657796877140256da0afe1b43c6"],"state_sha256":"4a7254e22a4ce8d00ad1e2f425ffec96cc1c8a4e1cf664a1029ffe141ad23326"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNm+Fx4pC9meSZZRWGjQ0VolZIu7S28OSOXdZdqJyrB7jgSNgIyX+n4hnQ8bbWtPO0RehejST8122SwOx9EBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:36:04.062529Z","bundle_sha256":"e5f6f47ce5a78d2b6d3217da07b96a2abbccbaf764b6d997d39be73fb076b4a0"}}