{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CTDNC4DZ4IPKXI4J4DQ7XM2MMS","short_pith_number":"pith:CTDNC4DZ","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"},"canonical_sha256":"14c6d17079e21eaba389e0e1fbb34c64981a9847bd85b1107df7e40706d5d356","source":{"kind":"arxiv","id":"1904.09222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09222","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09222v1","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09222","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"CTDNC4DZ4IPK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CTDNC4DZ4IPKXI4J","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CTDNC4DZ","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CTDNC4DZ4IPKXI4J4DQ7XM2MMS","target":"record","payload":{"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"},"canonical_sha256":"14c6d17079e21eaba389e0e1fbb34c64981a9847bd85b1107df7e40706d5d356","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"},"source_kind":"arxiv","source_id":"1904.09222","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-17T23:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qv4TgAzu66gqhTkaSXp9XyH5s++1VMyZNRWzpaPWltxV0ONpKnwI2tO2vGWRMBpcVxloswHjYl8B1xJNEFpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:22:06.272385Z"},"content_sha256":"e8de737ec4034e000d617db3badde8a4d29953fb4b35921d9087272acd303d63","schema_version":"1.0","event_id":"sha256:e8de737ec4034e000d617db3badde8a4d29953fb4b35921d9087272acd303d63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CTDNC4DZ4IPKXI4J4DQ7XM2MMS","target":"graph","payload":{"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"},"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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XERV/hDf6G6ZPPQAXrpJkVVUYYGkWmGKUlU9G/5lBy1jVJtVu+y/RwqHTawRLGIMNjrAGasPHwgIaGamKYzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:22:06.272737Z"},"content_sha256":"2e46885ff04b9e38def8e7992657f71eb5f6331abda672582994c6eac5852839","schema_version":"1.0","event_id":"sha256:2e46885ff04b9e38def8e7992657f71eb5f6331abda672582994c6eac5852839"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/bundle.json","state_url":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/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-04T14:22:06Z","links":{"resolver":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS","bundle":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/bundle.json","state":"https://pith.science/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTDNC4DZ4IPKXI4J4DQ7XM2MMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CTDNC4DZ4IPKXI4J4DQ7XM2MMS","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":"46c5046cc6d553d5f41f7c74c16bb02901393cacb06e3746cf1fe824d5fe7478","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-19T15:09:14Z","title_canon_sha256":"61d6558887e701d7d63de8f9a9007f379e182c294e85928299b64a0658d3563a"},"schema_version":"1.0","source":{"id":"1904.09222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09222","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09222v1","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09222","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"CTDNC4DZ4IPK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CTDNC4DZ4IPKXI4J","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CTDNC4DZ","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:2e46885ff04b9e38def8e7992657f71eb5f6331abda672582994c6eac5852839","target":"graph","created_at":"2026-05-17T23:48:07Z","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'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","authors_text":"Binghui Peng, David Wajc, Ilan Reuven Cohen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-19T15:09:14Z","title":"Tight Bounds for Online Edge Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09222","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:e8de737ec4034e000d617db3badde8a4d29953fb4b35921d9087272acd303d63","target":"record","created_at":"2026-05-17T23:48:07Z","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":"46c5046cc6d553d5f41f7c74c16bb02901393cacb06e3746cf1fe824d5fe7478","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-19T15:09:14Z","title_canon_sha256":"61d6558887e701d7d63de8f9a9007f379e182c294e85928299b64a0658d3563a"},"schema_version":"1.0","source":{"id":"1904.09222","kind":"arxiv","version":1}},"canonical_sha256":"14c6d17079e21eaba389e0e1fbb34c64981a9847bd85b1107df7e40706d5d356","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14c6d17079e21eaba389e0e1fbb34c64981a9847bd85b1107df7e40706d5d356","first_computed_at":"2026-05-17T23:48:07.992884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:07.992884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8HVU7oCCOMmWGG/aIdRAUVHuD1SrGSQGjpAX2Hi+Beb2hF08dz4WHfjifcPrUtnIqKL5MokPN/e5of4gYgtoAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:07.993536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8de737ec4034e000d617db3badde8a4d29953fb4b35921d9087272acd303d63","sha256:2e46885ff04b9e38def8e7992657f71eb5f6331abda672582994c6eac5852839"],"state_sha256":"08c35e15a428fe9073b30a9d12c584860736732de4cbc60948aa6cee40d49953"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SpkLPxnSxULmSYTO10ZG7kEwf0WCA27IJNB9jhvXscbWSk3I4Mpx9wDti4UVWMXu2EcPKYIXjZK5dgMgTU4wBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:22:06.274717Z","bundle_sha256":"600409e3401809f946249f8f38017d39f008ec32a8a53a4bc5a73d32b80eaf5a"}}