{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QUVRIYVYCDCEN7YHMVVOMAJ42H","short_pith_number":"pith:QUVRIYVY","schema_version":"1.0","canonical_sha256":"852b1462b810c446ff07656ae6013cd1e5632b0286c4848d5700e95fc5b0e283","source":{"kind":"arxiv","id":"1407.7162","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.7162","created_at":"2026-05-18T02:46:23.782954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7162v1","created_at":"2026-05-18T02:46:23.782954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7162","created_at":"2026-05-18T02:46:23.782954+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUVRIYVYCDCE","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUVRIYVYCDCEN7YH","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUVRIYVY","created_at":"2026-05-18T12:28:46.137349+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/QUVRIYVYCDCEN7YHMVVOMAJ42H","json":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H.json","graph_json":"https://pith.science/api/pith-number/QUVRIYVYCDCEN7YHMVVOMAJ42H/graph.json","events_json":"https://pith.science/api/pith-number/QUVRIYVYCDCEN7YHMVVOMAJ42H/events.json","paper":"https://pith.science/paper/QUVRIYVY"},"agent_actions":{"view_html":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H","download_json":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H.json","view_paper":"https://pith.science/paper/QUVRIYVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7162&json=true","fetch_graph":"https://pith.science/api/pith-number/QUVRIYVYCDCEN7YHMVVOMAJ42H/graph.json","fetch_events":"https://pith.science/api/pith-number/QUVRIYVYCDCEN7YHMVVOMAJ42H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/action/storage_attestation","attest_author":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/action/author_attestation","sign_citation":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/action/citation_signature","submit_replication":"https://pith.science/pith/QUVRIYVYCDCEN7YHMVVOMAJ42H/action/replication_record"}},"created_at":"2026-05-18T02:46:23.782954+00:00","updated_at":"2026-05-18T02:46:23.782954+00:00"}