{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:M6IZTX777M2BPOFJE4WD2N5AXA","short_pith_number":"pith:M6IZTX77","schema_version":"1.0","canonical_sha256":"679199dffffb3417b8a9272c3d37a0b824ff9386790391cb16e11e292ba44822","source":{"kind":"arxiv","id":"1103.2275","version":1},"attestation_state":"computed","paper":{"title":"Channel Assignment via Fast Zeta Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"{\\L}ukasz Kowalik, Marek Cygan","submitted_at":"2011-03-11T14:12:12Z","abstract_excerpt":"We show an O*((l+1)^n)-time algorithm for the channel assignment problem, where l is the maximum edge weight. This improves on the previous O*((l+2)^n)-time algorithm by Kral, as well as algorithms for important special cases, like L(2,1)-labelling. For the latter problem, our algorithm works in O*(3^n) time. The progress is achieved by applying the fast zeta transform in combination with the inclusion-exclusion principle."},"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":"1103.2275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-11T14:12:12Z","cross_cats_sorted":[],"title_canon_sha256":"7ea641ccf1b1499a683662c9da41a0e46e9a05a310f48b134137e2666d802119","abstract_canon_sha256":"757c777d770efeb330aee8b3dc0a8d9a09d9814998f083339af3543ed25e6ed6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:55.893079Z","signature_b64":"G5NFJvf9AmTZp5a3yA3o2MgMSnvMmBDT3n0kvXifHu9xYTpnOjgaZnTWd5CZkK0LLoUIkLceT1b/zeBI8UPnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"679199dffffb3417b8a9272c3d37a0b824ff9386790391cb16e11e292ba44822","last_reissued_at":"2026-05-18T04:26:55.892522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:55.892522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channel Assignment via Fast Zeta Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"{\\L}ukasz Kowalik, Marek Cygan","submitted_at":"2011-03-11T14:12:12Z","abstract_excerpt":"We show an O*((l+1)^n)-time algorithm for the channel assignment problem, where l is the maximum edge weight. This improves on the previous O*((l+2)^n)-time algorithm by Kral, as well as algorithms for important special cases, like L(2,1)-labelling. For the latter problem, our algorithm works in O*(3^n) time. The progress is achieved by applying the fast zeta transform in combination with the inclusion-exclusion principle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2275","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":"1103.2275","created_at":"2026-05-18T04:26:55.892609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2275v1","created_at":"2026-05-18T04:26:55.892609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2275","created_at":"2026-05-18T04:26:55.892609+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6IZTX777M2B","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6IZTX777M2BPOFJ","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6IZTX77","created_at":"2026-05-18T12:26:34.985390+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/M6IZTX777M2BPOFJE4WD2N5AXA","json":"https://pith.science/pith/M6IZTX777M2BPOFJE4WD2N5AXA.json","graph_json":"https://pith.science/api/pith-number/M6IZTX777M2BPOFJE4WD2N5AXA/graph.json","events_json":"https://pith.science/api/pith-number/M6IZTX777M2BPOFJE4WD2N5AXA/events.json","paper":"https://pith.science/paper/M6IZTX77"},"agent_actions":{"view_html":"https://pith.science/pith/M6IZTX777M2BPOFJE4WD2N5AXA","download_json":"https://pith.science/pith/M6IZTX777M2BPOFJE4WD2N5AXA.json","view_paper":"https://pith.science/paper/M6IZTX77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2275&json=true","fetch_graph":"https://pith.science/api/pith-number/M6IZTX777M2BPOFJE4WD2N5AXA/graph.json","fetch_events":"https://pith.science/api/pith-number/M6IZTX777M2BPOFJE4WD2N5AXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6IZTX777M2BPOFJE4WD2N5AXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6IZTX777M2BPOFJE4WD2N5AXA/action/storage_attestation","attest_author":"https://pith.science/pith/M6IZTX777M2BPOFJE4WD2N5AXA/action/author_attestation","sign_citation":"https://pith.science/pith/M6IZTX777M2BPOFJE4WD2N5AXA/action/citation_signature","submit_replication":"https://pith.science/pith/M6IZTX777M2BPOFJE4WD2N5AXA/action/replication_record"}},"created_at":"2026-05-18T04:26:55.892609+00:00","updated_at":"2026-05-18T04:26:55.892609+00:00"}