{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NUYLWHXQYYA7PAKAI3EGDMEDDI","short_pith_number":"pith:NUYLWHXQ","schema_version":"1.0","canonical_sha256":"6d30bb1ef0c601f7814046c861b0831a3bdcbaf2f735310b14ed70ac4f1a5b3b","source":{"kind":"arxiv","id":"1907.03201","version":4},"attestation_state":"computed","paper":{"title":"Fast and Simple Edge-Coloring Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Corwin Sinnamon","submitted_at":"2019-07-06T22:36:21Z","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"},"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":"1907.03201","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T22:36:21Z","cross_cats_sorted":[],"title_canon_sha256":"914fa2bc0f67ec1750fc362226f1b1ee8b79b3048085c1da14c7a149402abb47","abstract_canon_sha256":"6a3e2b7c71ebb42f92499a09ef55bf99da925a0ac31325825c8af44ee32f352c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:48.832836Z","signature_b64":"jeOUIDcA99of5gxvugHfiQConYG8jlMuCh54b1zn+5tBt2yTp6PFQ/s4x1Es7xG4ou0Rpu3j10w8SRG8R4MHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d30bb1ef0c601f7814046c861b0831a3bdcbaf2f735310b14ed70ac4f1a5b3b","last_reissued_at":"2026-07-05T02:18:48.832439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:48.832439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Simple Edge-Coloring Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Corwin Sinnamon","submitted_at":"2019-07-06T22:36:21Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03201","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.03201/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.03201","created_at":"2026-07-05T02:18:48.832492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03201v4","created_at":"2026-07-05T02:18:48.832492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03201","created_at":"2026-07-05T02:18:48.832492+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUYLWHXQYYA7","created_at":"2026-07-05T02:18:48.832492+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUYLWHXQYYA7PAKA","created_at":"2026-07-05T02:18:48.832492+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUYLWHXQ","created_at":"2026-07-05T02:18:48.832492+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.04516","citing_title":"The planar edge-coloring theorem of Vizing in $O(n\\log n)$ time","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NUYLWHXQYYA7PAKAI3EGDMEDDI","json":"https://pith.science/pith/NUYLWHXQYYA7PAKAI3EGDMEDDI.json","graph_json":"https://pith.science/api/pith-number/NUYLWHXQYYA7PAKAI3EGDMEDDI/graph.json","events_json":"https://pith.science/api/pith-number/NUYLWHXQYYA7PAKAI3EGDMEDDI/events.json","paper":"https://pith.science/paper/NUYLWHXQ"},"agent_actions":{"view_html":"https://pith.science/pith/NUYLWHXQYYA7PAKAI3EGDMEDDI","download_json":"https://pith.science/pith/NUYLWHXQYYA7PAKAI3EGDMEDDI.json","view_paper":"https://pith.science/paper/NUYLWHXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03201&json=true","fetch_graph":"https://pith.science/api/pith-number/NUYLWHXQYYA7PAKAI3EGDMEDDI/graph.json","fetch_events":"https://pith.science/api/pith-number/NUYLWHXQYYA7PAKAI3EGDMEDDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUYLWHXQYYA7PAKAI3EGDMEDDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUYLWHXQYYA7PAKAI3EGDMEDDI/action/storage_attestation","attest_author":"https://pith.science/pith/NUYLWHXQYYA7PAKAI3EGDMEDDI/action/author_attestation","sign_citation":"https://pith.science/pith/NUYLWHXQYYA7PAKAI3EGDMEDDI/action/citation_signature","submit_replication":"https://pith.science/pith/NUYLWHXQYYA7PAKAI3EGDMEDDI/action/replication_record"}},"created_at":"2026-07-05T02:18:48.832492+00:00","updated_at":"2026-07-05T02:18:48.832492+00:00"}