{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5SNC7S7MILFMWJRCOWAROFHF24","short_pith_number":"pith:5SNC7S7M","schema_version":"1.0","canonical_sha256":"ec9a2fcbec42cacb262275811714e5d7235d657a1ee9b218b232065796160810","source":{"kind":"arxiv","id":"2501.05570","version":1},"attestation_state":"computed","paper":{"title":"Faster Edge Coloring by Partition Sieving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shyan Akmal, Tomohiro Koana","submitted_at":"2025-01-09T20:51:46Z","abstract_excerpt":"In the Edge Coloring problem, we are given an undirected graph $G$ with $n$ vertices and $m$ edges, and are tasked with finding the smallest positive integer $k$ so that the edges of $G$ can be assigned $k$ colors in such a way that no two edges incident to the same vertex are assigned the same color. Edge Coloring is a classic NP-hard problem, and so significant research has gone into designing fast exponential-time algorithms for solving Edge Coloring and its variants exactly. Prior work showed that Edge Coloring can be solved in $2^m\\text{poly}(n)$ time and polynomial space, and in graphs w"},"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":"2501.05570","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-09T20:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"078a67bdf9ec9fa159e94d65a627f26f7ed8d8de2279296064c2adb44cba75ab","abstract_canon_sha256":"de79ad4803812f29f2850f7f976eb2147f032f3b43c5584c7d86dcc60432efc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:25.311058Z","signature_b64":"nOCvl0/UrB9tPu0t/Logbpq9UlQuynuJf1xB2whNaRLMunVA8QVjeSm5Rsa5/dYc9SRK5dmY4fGPUrCDZfQ7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec9a2fcbec42cacb262275811714e5d7235d657a1ee9b218b232065796160810","last_reissued_at":"2026-07-05T09:59:25.310565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:25.310565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Edge Coloring by Partition Sieving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shyan Akmal, Tomohiro Koana","submitted_at":"2025-01-09T20:51:46Z","abstract_excerpt":"In the Edge Coloring problem, we are given an undirected graph $G$ with $n$ vertices and $m$ edges, and are tasked with finding the smallest positive integer $k$ so that the edges of $G$ can be assigned $k$ colors in such a way that no two edges incident to the same vertex are assigned the same color. Edge Coloring is a classic NP-hard problem, and so significant research has gone into designing fast exponential-time algorithms for solving Edge Coloring and its variants exactly. Prior work showed that Edge Coloring can be solved in $2^m\\text{poly}(n)$ time and polynomial space, and in graphs w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05570","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.05570/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":"2501.05570","created_at":"2026-07-05T09:59:25.310627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.05570v1","created_at":"2026-07-05T09:59:25.310627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05570","created_at":"2026-07-05T09:59:25.310627+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SNC7S7MILFM","created_at":"2026-07-05T09:59:25.310627+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SNC7S7MILFMWJRC","created_at":"2026-07-05T09:59:25.310627+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SNC7S7M","created_at":"2026-07-05T09:59:25.310627+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/5SNC7S7MILFMWJRCOWAROFHF24","json":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24.json","graph_json":"https://pith.science/api/pith-number/5SNC7S7MILFMWJRCOWAROFHF24/graph.json","events_json":"https://pith.science/api/pith-number/5SNC7S7MILFMWJRCOWAROFHF24/events.json","paper":"https://pith.science/paper/5SNC7S7M"},"agent_actions":{"view_html":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24","download_json":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24.json","view_paper":"https://pith.science/paper/5SNC7S7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.05570&json=true","fetch_graph":"https://pith.science/api/pith-number/5SNC7S7MILFMWJRCOWAROFHF24/graph.json","fetch_events":"https://pith.science/api/pith-number/5SNC7S7MILFMWJRCOWAROFHF24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24/action/storage_attestation","attest_author":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24/action/author_attestation","sign_citation":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24/action/citation_signature","submit_replication":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24/action/replication_record"}},"created_at":"2026-07-05T09:59:25.310627+00:00","updated_at":"2026-07-05T09:59:25.310627+00:00"}