{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IQ6O2RQJIKOSVT5FAHOYTCZGU7","short_pith_number":"pith:IQ6O2RQJ","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"},"canonical_sha256":"443ced4609429d2acfa501dd898b26a7ef3bbca4ab7310ffbbfdcc5d8b39fa2b","source":{"kind":"arxiv","id":"1507.00640","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00640","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00640v2","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00640","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"pith_short_12","alias_value":"IQ6O2RQJIKOS","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IQ6O2RQJIKOSVT5F","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IQ6O2RQJ","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IQ6O2RQJIKOSVT5FAHOYTCZGU7","target":"record","payload":{"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"},"canonical_sha256":"443ced4609429d2acfa501dd898b26a7ef3bbca4ab7310ffbbfdcc5d8b39fa2b","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"},"source_kind":"arxiv","source_id":"1507.00640","source_version":2,"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-18T01:25:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXybJVFhSFqx0fBfXqZHsmc7V5c/zyWoGV7hN+TlW5517W7NNF6NuRaT3NVxCqSjfkTEpfoFtiFCHx9eeVbuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:08:07.470796Z"},"content_sha256":"821f97077ae6b185b66cb2d006fb9696b78bfcf57862c95eadf5f557dbe89a08","schema_version":"1.0","event_id":"sha256:821f97077ae6b185b66cb2d006fb9696b78bfcf57862c95eadf5f557dbe89a08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IQ6O2RQJIKOSVT5FAHOYTCZGU7","target":"graph","payload":{"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"},"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-18T01:25:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wB1FbxHOs6GG6bSJqxKDCxprszBJ7BPktUHId/LMi6ZSJGCwT346W7PnPQ0/AWyo32mau7XtYA75VPXKrcaRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:08:07.471155Z"},"content_sha256":"e33b6fdb6dfc7aa3ec5138a5d3334d055edb4095afaa82529686956c448f7241","schema_version":"1.0","event_id":"sha256:e33b6fdb6dfc7aa3ec5138a5d3334d055edb4095afaa82529686956c448f7241"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/bundle.json","state_url":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/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-22T18:08:07Z","links":{"resolver":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7","bundle":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/bundle.json","state":"https://pith.science/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQ6O2RQJIKOSVT5FAHOYTCZGU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IQ6O2RQJIKOSVT5FAHOYTCZGU7","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":"ef7eebf698c3c89870fd6f62c60701f32cf26ef9e7e7107be430fbdc8a6fd619","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-02T15:59:27Z","title_canon_sha256":"2ee2f4cbf5f485b1d43cd57c7561009fda2087c50e75aa8193557c17ad9667d9"},"schema_version":"1.0","source":{"id":"1507.00640","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00640","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00640v2","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00640","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"pith_short_12","alias_value":"IQ6O2RQJIKOS","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IQ6O2RQJIKOSVT5F","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IQ6O2RQJ","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:e33b6fdb6dfc7aa3ec5138a5d3334d055edb4095afaa82529686956c448f7241","target":"graph","created_at":"2026-05-18T01:25:24Z","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 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,","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","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-02T15:59:27Z","title":"Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00640","kind":"arxiv","version":2},"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:821f97077ae6b185b66cb2d006fb9696b78bfcf57862c95eadf5f557dbe89a08","target":"record","created_at":"2026-05-18T01:25:24Z","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":"ef7eebf698c3c89870fd6f62c60701f32cf26ef9e7e7107be430fbdc8a6fd619","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-02T15:59:27Z","title_canon_sha256":"2ee2f4cbf5f485b1d43cd57c7561009fda2087c50e75aa8193557c17ad9667d9"},"schema_version":"1.0","source":{"id":"1507.00640","kind":"arxiv","version":2}},"canonical_sha256":"443ced4609429d2acfa501dd898b26a7ef3bbca4ab7310ffbbfdcc5d8b39fa2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"443ced4609429d2acfa501dd898b26a7ef3bbca4ab7310ffbbfdcc5d8b39fa2b","first_computed_at":"2026-05-18T01:25:24.451295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:24.451295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"toW0igvRpscYMjqPV7kk80Bc1ekm8o8z2JNTz+gvK61JBeFTz2q+KFB9cdmfACUB9CMd51z7C/d5nf1M6uP7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:24.451763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00640","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:821f97077ae6b185b66cb2d006fb9696b78bfcf57862c95eadf5f557dbe89a08","sha256:e33b6fdb6dfc7aa3ec5138a5d3334d055edb4095afaa82529686956c448f7241"],"state_sha256":"03a456c6f542905be16e23f2be1dff2a0717b1014dc9ebd721a2cfc8091e2876"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZjGTWtgBwviyN9DXF/O/U71X5a9Vx6ifoK8u56zYm8bZdspkp0+S+SbLWWcvUrF19e+7QqieolU93VTUe1DAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T18:08:07.473173Z","bundle_sha256":"26d2a158651dd6267e15801cfb7c836cdebf5eadcca9ca8dda392a91ec7ad001"}}