{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3YEHJWK3Y2DWGSLGP7TCV7BDIS","short_pith_number":"pith:3YEHJWK3","canonical_record":{"source":{"id":"1901.00479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-02T18:30:14Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"45544bfb4d1e4ae1be7c50ab9ef0d1c22dabcae478a5bb9c8620aed7c21da44a","abstract_canon_sha256":"02cdc37274dad97da209b2ec3e1a51841ef344c99d8f11707b648911609772f9"},"schema_version":"1.0"},"canonical_sha256":"de0874d95bc6876349667fe62afc23449cecf2e61185d5f27f1a1c3042d2dd93","source":{"kind":"arxiv","id":"1901.00479","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00479","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00479v2","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00479","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"3YEHJWK3Y2DW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3YEHJWK3Y2DWGSLG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3YEHJWK3","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3YEHJWK3Y2DWGSLGP7TCV7BDIS","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-02T18:30:14Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"45544bfb4d1e4ae1be7c50ab9ef0d1c22dabcae478a5bb9c8620aed7c21da44a","abstract_canon_sha256":"02cdc37274dad97da209b2ec3e1a51841ef344c99d8f11707b648911609772f9"},"schema_version":"1.0"},"canonical_sha256":"de0874d95bc6876349667fe62afc23449cecf2e61185d5f27f1a1c3042d2dd93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:55.086987Z","signature_b64":"pRMVsFtT55RwwpLi+wemRV5sVP00dk6aOXEtaujQ4q7OAu/jPzvBBL0kfl8o2GBTU0M4QkDSra9CXNSoJP8eDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de0874d95bc6876349667fe62afc23449cecf2e61185d5f27f1a1c3042d2dd93","last_reissued_at":"2026-05-17T23:48:55.086518Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:55.086518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00479","source_version":2,"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:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4UR0Aa0WYcyMGASQ1x2MZCGKYUrRIesGZ+MCmVckYHuZUF3uTj5xa9Bk7g6cwg9f54YRcGHNP0tzQIFiPneFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T00:56:25.162465Z"},"content_sha256":"943b336068374065ac64a0260c94fea25d47a4ddb4ef8224cce35bcd510fbda9","schema_version":"1.0","event_id":"sha256:943b336068374065ac64a0260c94fea25d47a4ddb4ef8224cce35bcd510fbda9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3YEHJWK3Y2DWGSLGP7TCV7BDIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards the Locality of Vizing's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Hoa T. Vu, Hsin-Hao Su","submitted_at":"2019-01-02T18:30:14Z","abstract_excerpt":"Vizing showed that it suffices to color the edges of a simple graph using $\\Delta + 1$ colors, where $\\Delta$ is the maximum degree of the graph. However, up to this date, no efficient distributed edge-coloring algorithms are known for obtaining such a coloring, even for constant degree graphs. The current algorithms that get closest to this number of colors are the randomized $(\\Delta + \\tilde{\\Theta}(\\sqrt{\\Delta}))$-edge-coloring algorithm that runs in $\\text{polylog}(n)$ rounds by Chang et al. (SODA '18) and the deterministic $(\\Delta + \\text{polylog}(n))$-edge-coloring algorithm that runs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00479","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":""},"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:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7J5hkln2uGVUeq4KBhUyGMItnQa4PVD8EWT/yuBPeiGYFCaJkVIW0Zw5DcSruRTyYaB8LO1IafPnELnZjFT6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T00:56:25.162819Z"},"content_sha256":"b3c9f69a13bfe4c50bdabcf21afa4055fb1c016f8a03ce6bb759f6f8cae192d8","schema_version":"1.0","event_id":"sha256:b3c9f69a13bfe4c50bdabcf21afa4055fb1c016f8a03ce6bb759f6f8cae192d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/bundle.json","state_url":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/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-07-02T00:56:25Z","links":{"resolver":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS","bundle":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/bundle.json","state":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3YEHJWK3Y2DWGSLGP7TCV7BDIS","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":"02cdc37274dad97da209b2ec3e1a51841ef344c99d8f11707b648911609772f9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-02T18:30:14Z","title_canon_sha256":"45544bfb4d1e4ae1be7c50ab9ef0d1c22dabcae478a5bb9c8620aed7c21da44a"},"schema_version":"1.0","source":{"id":"1901.00479","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00479","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00479v2","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00479","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"3YEHJWK3Y2DW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3YEHJWK3Y2DWGSLG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3YEHJWK3","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:b3c9f69a13bfe4c50bdabcf21afa4055fb1c016f8a03ce6bb759f6f8cae192d8","target":"graph","created_at":"2026-05-17T23:48:55Z","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":"Vizing showed that it suffices to color the edges of a simple graph using $\\Delta + 1$ colors, where $\\Delta$ is the maximum degree of the graph. However, up to this date, no efficient distributed edge-coloring algorithms are known for obtaining such a coloring, even for constant degree graphs. The current algorithms that get closest to this number of colors are the randomized $(\\Delta + \\tilde{\\Theta}(\\sqrt{\\Delta}))$-edge-coloring algorithm that runs in $\\text{polylog}(n)$ rounds by Chang et al. (SODA '18) and the deterministic $(\\Delta + \\text{polylog}(n))$-edge-coloring algorithm that runs","authors_text":"Hoa T. Vu, Hsin-Hao Su","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-02T18:30:14Z","title":"Towards the Locality of Vizing's Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00479","kind":"arxiv","version":2},"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:943b336068374065ac64a0260c94fea25d47a4ddb4ef8224cce35bcd510fbda9","target":"record","created_at":"2026-05-17T23:48:55Z","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":"02cdc37274dad97da209b2ec3e1a51841ef344c99d8f11707b648911609772f9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-02T18:30:14Z","title_canon_sha256":"45544bfb4d1e4ae1be7c50ab9ef0d1c22dabcae478a5bb9c8620aed7c21da44a"},"schema_version":"1.0","source":{"id":"1901.00479","kind":"arxiv","version":2}},"canonical_sha256":"de0874d95bc6876349667fe62afc23449cecf2e61185d5f27f1a1c3042d2dd93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de0874d95bc6876349667fe62afc23449cecf2e61185d5f27f1a1c3042d2dd93","first_computed_at":"2026-05-17T23:48:55.086518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:55.086518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pRMVsFtT55RwwpLi+wemRV5sVP00dk6aOXEtaujQ4q7OAu/jPzvBBL0kfl8o2GBTU0M4QkDSra9CXNSoJP8eDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:55.086987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00479","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:943b336068374065ac64a0260c94fea25d47a4ddb4ef8224cce35bcd510fbda9","sha256:b3c9f69a13bfe4c50bdabcf21afa4055fb1c016f8a03ce6bb759f6f8cae192d8"],"state_sha256":"23fe489fdedd963b39454b3d418ae1d7245e3a506feab24793abe4adaac7cf3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZGURXstMnWz3Z2MchMOqnviy+97tB9IDFxWcuYIz7kHtBvcVlNizlgxyk9n/x/WL1VoCA+WVpSoxMCE0FitDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T00:56:25.164978Z","bundle_sha256":"921119a3a1694cac09324cfae68b9e379928ddeb9fda693285a6fd75f552eb9c"}}