{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CTDNC4DZ4IPKXI4J4DQ7XM2MMS","short_pith_number":"pith:CTDNC4DZ","schema_version":"1.0","canonical_sha256":"14c6d17079e21eaba389e0e1fbb34c64981a9847bd85b1107df7e40706d5d356","source":{"kind":"arxiv","id":"1904.09222","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for Online Edge Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Binghui Peng, David Wajc, Ilan Reuven Cohen","submitted_at":"2019-04-19T15:09:14Z","abstract_excerpt":"Vizing's celebrated theorem asserts that any graph of maximum degree $\\Delta$ admits an edge coloring using at most $\\Delta+1$ colors. In contrast, Bar-Noy, Naor and Motwani showed over a quarter century that the trivial greedy algorithm, which uses $2\\Delta-1$ colors, is optimal among online algorithms. Their lower bound has a caveat, however: it only applies to low-degree graphs, with $\\Delta=O(\\log n)$, and they conjectured the existence of online algorithms using $\\Delta(1+o(1))$ colors for $\\Delta=\\omega(\\log n)$. Progress towards resolving this conjecture was only made under stochastic a"},"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":"1904.09222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-19T15:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"61d6558887e701d7d63de8f9a9007f379e182c294e85928299b64a0658d3563a","abstract_canon_sha256":"46c5046cc6d553d5f41f7c74c16bb02901393cacb06e3746cf1fe824d5fe7478"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:07.993536Z","signature_b64":"8HVU7oCCOMmWGG/aIdRAUVHuD1SrGSQGjpAX2Hi+Beb2hF08dz4WHfjifcPrUtnIqKL5MokPN/e5of4gYgtoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14c6d17079e21eaba389e0e1fbb34c64981a9847bd85b1107df7e40706d5d356","last_reissued_at":"2026-05-17T23:48:07.992884Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:07.992884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Online Edge Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Binghui Peng, David Wajc, Ilan Reuven Cohen","submitted_at":"2019-04-19T15:09:14Z","abstract_excerpt":"Vizing's celebrated theorem asserts that any graph of maximum degree $\\Delta$ admits an edge coloring using at most $\\Delta+1$ colors. In contrast, Bar-Noy, Naor and Motwani showed over a quarter century that the trivial greedy algorithm, which uses $2\\Delta-1$ colors, is optimal among online algorithms. Their lower bound has a caveat, however: it only applies to low-degree graphs, with $\\Delta=O(\\log n)$, and they conjectured the existence of online algorithms using $\\Delta(1+o(1))$ colors for $\\Delta=\\omega(\\log n)$. Progress towards resolving this conjecture was only made under stochastic a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09222","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.09222","created_at":"2026-05-17T23:48:07.992983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09222v1","created_at":"2026-05-17T23:48:07.992983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09222","created_at":"2026-05-17T23:48:07.992983+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTDNC4DZ4IPK","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTDNC4DZ4IPKXI4J","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTDNC4DZ","created_at":"2026-05-18T12:33:15.570797+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/CTDNC4DZ4IPKXI4J4DQ7XM2MMS","json":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS.json","graph_json":"https://pith.science/api/pith-number/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/graph.json","events_json":"https://pith.science/api/pith-number/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/events.json","paper":"https://pith.science/paper/CTDNC4DZ"},"agent_actions":{"view_html":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS","download_json":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS.json","view_paper":"https://pith.science/paper/CTDNC4DZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09222&json=true","fetch_graph":"https://pith.science/api/pith-number/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/graph.json","fetch_events":"https://pith.science/api/pith-number/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/action/storage_attestation","attest_author":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/action/author_attestation","sign_citation":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/action/citation_signature","submit_replication":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/action/replication_record"}},"created_at":"2026-05-17T23:48:07.992983+00:00","updated_at":"2026-05-17T23:48:07.992983+00:00"}