{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3YEHJWK3Y2DWGSLGP7TCV7BDIS","short_pith_number":"pith:3YEHJWK3","schema_version":"1.0","canonical_sha256":"de0874d95bc6876349667fe62afc23449cecf2e61185d5f27f1a1c3042d2dd93","source":{"kind":"arxiv","id":"1901.00479","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.00479","created_at":"2026-05-17T23:48:55.086591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00479v2","created_at":"2026-05-17T23:48:55.086591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00479","created_at":"2026-05-17T23:48:55.086591+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YEHJWK3Y2DW","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YEHJWK3Y2DWGSLG","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YEHJWK3","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS","json":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS.json","graph_json":"https://pith.science/api/pith-number/3YEHJWK3Y2DWGSLGP7TCV7BDIS/graph.json","events_json":"https://pith.science/api/pith-number/3YEHJWK3Y2DWGSLGP7TCV7BDIS/events.json","paper":"https://pith.science/paper/3YEHJWK3"},"agent_actions":{"view_html":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS","download_json":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS.json","view_paper":"https://pith.science/paper/3YEHJWK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00479&json=true","fetch_graph":"https://pith.science/api/pith-number/3YEHJWK3Y2DWGSLGP7TCV7BDIS/graph.json","fetch_events":"https://pith.science/api/pith-number/3YEHJWK3Y2DWGSLGP7TCV7BDIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/action/storage_attestation","attest_author":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/action/author_attestation","sign_citation":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/action/citation_signature","submit_replication":"https://pith.science/pith/3YEHJWK3Y2DWGSLGP7TCV7BDIS/action/replication_record"}},"created_at":"2026-05-17T23:48:55.086591+00:00","updated_at":"2026-05-17T23:48:55.086591+00:00"}