{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NUYLWHXQYYA7PAKAI3EGDMEDDI","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":"6a3e2b7c71ebb42f92499a09ef55bf99da925a0ac31325825c8af44ee32f352c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T22:36:21Z","title_canon_sha256":"914fa2bc0f67ec1750fc362226f1b1ee8b79b3048085c1da14c7a149402abb47"},"schema_version":"1.0","source":{"id":"1907.03201","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03201","created_at":"2026-07-05T02:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03201v4","created_at":"2026-07-05T02:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03201","created_at":"2026-07-05T02:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"NUYLWHXQYYA7","created_at":"2026-07-05T02:18:48Z"},{"alias_kind":"pith_short_16","alias_value":"NUYLWHXQYYA7PAKA","created_at":"2026-07-05T02:18:48Z"},{"alias_kind":"pith_short_8","alias_value":"NUYLWHXQ","created_at":"2026-07-05T02:18:48Z"}],"graph_snapshots":[{"event_id":"sha256:2c2cb698ac9d4f8f5aadd921d826632111f0450f7eb6552efa009b50a26f2262","target":"graph","created_at":"2026-07-05T02:18:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.03201/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop sequential algorithms for constructing edge-colorings of graphs and multigraphs efficiently and using few colors. Our primary focus is edge-coloring arbitrary simple graphs using $d+1$ colors, where $d$ is the largest vertex degree in the graph. Vizing's Theorem states that every simple graph can be edge-colored using $d+1$ colors. Although some graphs can be edge-colored using only $d$ colors, it is NP-hard to recognize graphs of this type [Holyer, 1981]. So using $d+1$ colors is a natural goal. Efficient techniques for $(d+1)$-edge-coloring were developed by Gabow, Nishizeki, Kari","authors_text":"Corwin Sinnamon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T22:36:21Z","title":"Fast and Simple Edge-Coloring Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03201","kind":"arxiv","version":4},"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:cc752a250f30375c78213de1f8cfab00e82fd9cc06c10fa9e8331bf1cbfc71a6","target":"record","created_at":"2026-07-05T02:18:48Z","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":"6a3e2b7c71ebb42f92499a09ef55bf99da925a0ac31325825c8af44ee32f352c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T22:36:21Z","title_canon_sha256":"914fa2bc0f67ec1750fc362226f1b1ee8b79b3048085c1da14c7a149402abb47"},"schema_version":"1.0","source":{"id":"1907.03201","kind":"arxiv","version":4}},"canonical_sha256":"6d30bb1ef0c601f7814046c861b0831a3bdcbaf2f735310b14ed70ac4f1a5b3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d30bb1ef0c601f7814046c861b0831a3bdcbaf2f735310b14ed70ac4f1a5b3b","first_computed_at":"2026-07-05T02:18:48.832439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:18:48.832439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jeOUIDcA99of5gxvugHfiQConYG8jlMuCh54b1zn+5tBt2yTp6PFQ/s4x1Es7xG4ou0Rpu3j10w8SRG8R4MHDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:18:48.832836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03201","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc752a250f30375c78213de1f8cfab00e82fd9cc06c10fa9e8331bf1cbfc71a6","sha256:2c2cb698ac9d4f8f5aadd921d826632111f0450f7eb6552efa009b50a26f2262"],"state_sha256":"4d9795b6c520cebaa7432c018491d391bcd4b398c4b5c8b650ac330960375fd0"}