{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IQ6O2RQJIKOSVT5FAHOYTCZGU7","short_pith_number":"pith:IQ6O2RQJ","schema_version":"1.0","canonical_sha256":"443ced4609429d2acfa501dd898b26a7ef3bbca4ab7310ffbbfdcc5d8b39fa2b","source":{"kind":"arxiv","id":"1507.00640","version":2},"attestation_state":"computed","paper":{"title":"Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Du\\v{s}an Knop, Jan Kratochv\\'il, Ji\\v{r}\\'i Fiala, Martin Kouteck\\'y, Tom\\'a\\v{s} Gaven\\v{c}iak","submitted_at":"2015-07-02T15:59:27Z","abstract_excerpt":"We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neighborhood diversity and clique width.\n  We rephrase the distance constrained graph labeling problem as a specific uniform variant of the Channel Assignment problem and show that this problem is fixed parameter tractable when parameterized by the neighborhood diversity together with the largest weight. Consequently, every $L(p_1, p_2, \\dots, p_k)$-labeling problem is FPT when parameterized by the neighborhood diversity,"},"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":"1507.00640","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-02T15:59:27Z","cross_cats_sorted":[],"title_canon_sha256":"2ee2f4cbf5f485b1d43cd57c7561009fda2087c50e75aa8193557c17ad9667d9","abstract_canon_sha256":"ef7eebf698c3c89870fd6f62c60701f32cf26ef9e7e7107be430fbdc8a6fd619"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:24.451763Z","signature_b64":"toW0igvRpscYMjqPV7kk80Bc1ekm8o8z2JNTz+gvK61JBeFTz2q+KFB9cdmfACUB9CMd51z7C/d5nf1M6uP7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"443ced4609429d2acfa501dd898b26a7ef3bbca4ab7310ffbbfdcc5d8b39fa2b","last_reissued_at":"2026-05-18T01:25:24.451295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:24.451295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Du\\v{s}an Knop, Jan Kratochv\\'il, Ji\\v{r}\\'i Fiala, Martin Kouteck\\'y, Tom\\'a\\v{s} Gaven\\v{c}iak","submitted_at":"2015-07-02T15:59:27Z","abstract_excerpt":"We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neighborhood diversity and clique width.\n  We rephrase the distance constrained graph labeling problem as a specific uniform variant of the Channel Assignment problem and show that this problem is fixed parameter tractable when parameterized by the neighborhood diversity together with the largest weight. Consequently, every $L(p_1, p_2, \\dots, p_k)$-labeling problem is FPT when parameterized by the neighborhood diversity,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00640","kind":"arxiv","version":2},"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":"1507.00640","created_at":"2026-05-18T01:25:24.451387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00640v2","created_at":"2026-05-18T01:25:24.451387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00640","created_at":"2026-05-18T01:25:24.451387+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQ6O2RQJIKOS","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQ6O2RQJIKOSVT5F","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQ6O2RQJ","created_at":"2026-05-18T12:29:25.134429+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/IQ6O2RQJIKOSVT5FAHOYTCZGU7","json":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7.json","graph_json":"https://pith.science/api/pith-number/IQ6O2RQJIKOSVT5FAHOYTCZGU7/graph.json","events_json":"https://pith.science/api/pith-number/IQ6O2RQJIKOSVT5FAHOYTCZGU7/events.json","paper":"https://pith.science/paper/IQ6O2RQJ"},"agent_actions":{"view_html":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7","download_json":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7.json","view_paper":"https://pith.science/paper/IQ6O2RQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00640&json=true","fetch_graph":"https://pith.science/api/pith-number/IQ6O2RQJIKOSVT5FAHOYTCZGU7/graph.json","fetch_events":"https://pith.science/api/pith-number/IQ6O2RQJIKOSVT5FAHOYTCZGU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/action/storage_attestation","attest_author":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/action/author_attestation","sign_citation":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/action/citation_signature","submit_replication":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/action/replication_record"}},"created_at":"2026-05-18T01:25:24.451387+00:00","updated_at":"2026-05-18T01:25:24.451387+00:00"}