{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5SNC7S7MILFMWJRCOWAROFHF24","short_pith_number":"pith:5SNC7S7M","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"},"canonical_sha256":"ec9a2fcbec42cacb262275811714e5d7235d657a1ee9b218b232065796160810","source":{"kind":"arxiv","id":"2501.05570","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.05570","created_at":"2026-07-05T09:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"2501.05570v1","created_at":"2026-07-05T09:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05570","created_at":"2026-07-05T09:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"5SNC7S7MILFM","created_at":"2026-07-05T09:59:25Z"},{"alias_kind":"pith_short_16","alias_value":"5SNC7S7MILFMWJRC","created_at":"2026-07-05T09:59:25Z"},{"alias_kind":"pith_short_8","alias_value":"5SNC7S7M","created_at":"2026-07-05T09:59:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5SNC7S7MILFMWJRCOWAROFHF24","target":"record","payload":{"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"},"canonical_sha256":"ec9a2fcbec42cacb262275811714e5d7235d657a1ee9b218b232065796160810","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"},"source_kind":"arxiv","source_id":"2501.05570","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-07-05T09:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/93tKEzUPqL79oMaF7x04tRT2/QhKnR8kJeBsmYscaqm55v/pbpYlD/iKoO5eVbIJqaFGBCmq51/uvcCTpujBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:33:02.367271Z"},"content_sha256":"59d5af9ad3caf841eb9afc16833fb0d4390641df1d069dd88992a0297da8f685","schema_version":"1.0","event_id":"sha256:59d5af9ad3caf841eb9afc16833fb0d4390641df1d069dd88992a0297da8f685"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5SNC7S7MILFMWJRCOWAROFHF24","target":"graph","payload":{"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"},"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-07-05T09:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLxAX0tbrxHIlv0Ll9vuZLltzpPS6TI26yxhD9e67DqW98CuwVSVhahO8EVqyh14rkmroWE8Ctlur0xZkAcIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:33:02.367862Z"},"content_sha256":"65db28dfca0c4d72f1de78d82696613563b25a97238bc32809d994aef357f4e6","schema_version":"1.0","event_id":"sha256:65db28dfca0c4d72f1de78d82696613563b25a97238bc32809d994aef357f4e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24/bundle.json","state_url":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SNC7S7MILFMWJRCOWAROFHF24/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-08-13T10:33:02Z","links":{"resolver":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24","bundle":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24/bundle.json","state":"https://pith.science/pith/5SNC7S7MILFMWJRCOWAROFHF24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SNC7S7MILFMWJRCOWAROFHF24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5SNC7S7MILFMWJRCOWAROFHF24","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":"de79ad4803812f29f2850f7f976eb2147f032f3b43c5584c7d86dcc60432efc7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-09T20:51:46Z","title_canon_sha256":"078a67bdf9ec9fa159e94d65a627f26f7ed8d8de2279296064c2adb44cba75ab"},"schema_version":"1.0","source":{"id":"2501.05570","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.05570","created_at":"2026-07-05T09:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"2501.05570v1","created_at":"2026-07-05T09:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05570","created_at":"2026-07-05T09:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"5SNC7S7MILFM","created_at":"2026-07-05T09:59:25Z"},{"alias_kind":"pith_short_16","alias_value":"5SNC7S7MILFMWJRC","created_at":"2026-07-05T09:59:25Z"},{"alias_kind":"pith_short_8","alias_value":"5SNC7S7M","created_at":"2026-07-05T09:59:25Z"}],"graph_snapshots":[{"event_id":"sha256:65db28dfca0c4d72f1de78d82696613563b25a97238bc32809d994aef357f4e6","target":"graph","created_at":"2026-07-05T09:59:25Z","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/2501.05570/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Shyan Akmal, Tomohiro Koana","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05570","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:59d5af9ad3caf841eb9afc16833fb0d4390641df1d069dd88992a0297da8f685","target":"record","created_at":"2026-07-05T09:59:25Z","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":"de79ad4803812f29f2850f7f976eb2147f032f3b43c5584c7d86dcc60432efc7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-09T20:51:46Z","title_canon_sha256":"078a67bdf9ec9fa159e94d65a627f26f7ed8d8de2279296064c2adb44cba75ab"},"schema_version":"1.0","source":{"id":"2501.05570","kind":"arxiv","version":1}},"canonical_sha256":"ec9a2fcbec42cacb262275811714e5d7235d657a1ee9b218b232065796160810","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec9a2fcbec42cacb262275811714e5d7235d657a1ee9b218b232065796160810","first_computed_at":"2026-07-05T09:59:25.310565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:59:25.310565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nOCvl0/UrB9tPu0t/Logbpq9UlQuynuJf1xB2whNaRLMunVA8QVjeSm5Rsa5/dYc9SRK5dmY4fGPUrCDZfQ7Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:59:25.311058Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.05570","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59d5af9ad3caf841eb9afc16833fb0d4390641df1d069dd88992a0297da8f685","sha256:65db28dfca0c4d72f1de78d82696613563b25a97238bc32809d994aef357f4e6"],"state_sha256":"4ce8da3440863e8769053701383bb2fb42cb993cefc5470869dfff3d2bb9b59b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yo/RcAmQ4xGozBqxJbykOeBqAg4QLu64Dlsr8PSbU8ZC8MyGbhe0fK5Oe3w9QtmaijKC1/2f8gxRN44dvX2LBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T10:33:02.374100Z","bundle_sha256":"c0df64d82bc989d08663f50a1495f11cdf10873994b5fd57accef7e56ce44af4"}}