{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QUVRIYVYCDCEN7YHMVVOMAJ42H","short_pith_number":"pith:QUVRIYVY","canonical_record":{"source":{"id":"1407.7162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-26T22:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"d2b9a025353a81117fed1152ae22d4ac89e986837c102d1f95a66e94d4322e25","abstract_canon_sha256":"a3a37c3785f9a7c6a951c8983479f8835fb56ce7bad8b2c87e9f28b6f46d4cc6"},"schema_version":"1.0"},"canonical_sha256":"852b1462b810c446ff07656ae6013cd1e5632b0286c4848d5700e95fc5b0e283","source":{"kind":"arxiv","id":"1407.7162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7162","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7162v1","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7162","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"QUVRIYVYCDCE","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QUVRIYVYCDCEN7YH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QUVRIYVY","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QUVRIYVYCDCEN7YHMVVOMAJ42H","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-26T22:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"d2b9a025353a81117fed1152ae22d4ac89e986837c102d1f95a66e94d4322e25","abstract_canon_sha256":"a3a37c3785f9a7c6a951c8983479f8835fb56ce7bad8b2c87e9f28b6f46d4cc6"},"schema_version":"1.0"},"canonical_sha256":"852b1462b810c446ff07656ae6013cd1e5632b0286c4848d5700e95fc5b0e283","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:23.783338Z","signature_b64":"VPCwMG7Ny8qoueJ2a8KVeykp37nYHwUnWcu0liAZoTp7VtTSHOKbsEXjgbhhSRKIsj0T4PEeoA3+fFWrh85UCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"852b1462b810c446ff07656ae6013cd1e5632b0286c4848d5700e95fc5b0e283","last_reissued_at":"2026-05-18T02:46:23.782870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:23.782870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7162","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-18T02:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pU3zrOVdpg8ooFeor3i8xoLmh0EbWCC+JiEH3mBih8BoMNdz3B85zAayZ9DstcBQ/ObYpRr41t3eaywq441pBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:04:24.681739Z"},"content_sha256":"26533b820e909d8d215d830f04758766459dd1fcb769342f06bc0b2d15418893","schema_version":"1.0","event_id":"sha256:26533b820e909d8d215d830f04758766459dd1fcb769342f06bc0b2d15418893"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QUVRIYVYCDCEN7YHMVVOMAJ42H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight lower bound for the channel assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arkadiusz Socala","submitted_at":"2014-07-26T22:21:35Z","abstract_excerpt":"We study the complexity of the Channel Assignment problem. A major open problem asks whether Channel Assignment admits an $O(c^n)$-time algorithm, for a constant $c$ independent of the weights on the edges. We answer this question in the negative i.e. we show that there is no $2^{o(n\\log n)}$-time algorithm solving Channel Assignment unless the Exponential Time Hypothesis fails. Note that the currently best known algorithm works in time $O^*(n!) = 2^{O(n\\log n)}$ so our lower bound is tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7162","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-18T02:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VaCOFx//Epr26iiLzSRN7A7BsQjjnL/1/8cniKhyHih+5WI55RJEByusdleJb+OTH27hVqk5qtlxTQwdNsrgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:04:24.682075Z"},"content_sha256":"b02085aaa7b6f06faa04e57278d8c080c3a80cf42593f9080d257eda43168ded","schema_version":"1.0","event_id":"sha256:b02085aaa7b6f06faa04e57278d8c080c3a80cf42593f9080d257eda43168ded"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/bundle.json","state_url":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/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-11T10:04:24Z","links":{"resolver":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H","bundle":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/bundle.json","state":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QUVRIYVYCDCEN7YHMVVOMAJ42H","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":"a3a37c3785f9a7c6a951c8983479f8835fb56ce7bad8b2c87e9f28b6f46d4cc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-26T22:21:35Z","title_canon_sha256":"d2b9a025353a81117fed1152ae22d4ac89e986837c102d1f95a66e94d4322e25"},"schema_version":"1.0","source":{"id":"1407.7162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7162","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7162v1","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7162","created_at":"2026-05-18T02:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"QUVRIYVYCDCE","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QUVRIYVYCDCEN7YH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QUVRIYVY","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:b02085aaa7b6f06faa04e57278d8c080c3a80cf42593f9080d257eda43168ded","target":"graph","created_at":"2026-05-18T02:46:23Z","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":"We study the complexity of the Channel Assignment problem. A major open problem asks whether Channel Assignment admits an $O(c^n)$-time algorithm, for a constant $c$ independent of the weights on the edges. We answer this question in the negative i.e. we show that there is no $2^{o(n\\log n)}$-time algorithm solving Channel Assignment unless the Exponential Time Hypothesis fails. Note that the currently best known algorithm works in time $O^*(n!) = 2^{O(n\\log n)}$ so our lower bound is tight.","authors_text":"Arkadiusz Socala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-26T22:21:35Z","title":"Tight lower bound for the channel assignment problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7162","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:26533b820e909d8d215d830f04758766459dd1fcb769342f06bc0b2d15418893","target":"record","created_at":"2026-05-18T02:46:23Z","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":"a3a37c3785f9a7c6a951c8983479f8835fb56ce7bad8b2c87e9f28b6f46d4cc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-26T22:21:35Z","title_canon_sha256":"d2b9a025353a81117fed1152ae22d4ac89e986837c102d1f95a66e94d4322e25"},"schema_version":"1.0","source":{"id":"1407.7162","kind":"arxiv","version":1}},"canonical_sha256":"852b1462b810c446ff07656ae6013cd1e5632b0286c4848d5700e95fc5b0e283","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"852b1462b810c446ff07656ae6013cd1e5632b0286c4848d5700e95fc5b0e283","first_computed_at":"2026-05-18T02:46:23.782870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:23.782870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VPCwMG7Ny8qoueJ2a8KVeykp37nYHwUnWcu0liAZoTp7VtTSHOKbsEXjgbhhSRKIsj0T4PEeoA3+fFWrh85UCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:23.783338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26533b820e909d8d215d830f04758766459dd1fcb769342f06bc0b2d15418893","sha256:b02085aaa7b6f06faa04e57278d8c080c3a80cf42593f9080d257eda43168ded"],"state_sha256":"dbf823a1224bc833b7661b87ba57338f03385a0dc05422d4ed2a0ee27cf3f4cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fowYISGiHviPLWZcWMghEv+r5qFCVWwcozz5xAsUKb1iYA8qY9Zm3AN3Q4Jv7V8WieeCIFZtgqiF2UAnhtW3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:04:24.683907Z","bundle_sha256":"a941a4bf696f3f980acbead146f507a827f3ec0ae8868a27c015750e0de70188"}}