{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JWY7IVDKXQ6CND7OVXOPUIAODQ","short_pith_number":"pith:JWY7IVDK","schema_version":"1.0","canonical_sha256":"4db1f4546abc3c268feeaddcfa200e1c3c9a34ca82bfca3f0b7d8d7dceb1c0b7","source":{"kind":"arxiv","id":"1712.08373","version":1},"attestation_state":"computed","paper":{"title":"Notes on complexity of packing coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Bernard Lidick\\'y, Florian Pfender, Minki Kim, Tom\\'a\\v{s} Masa\\v{r}\\'ik","submitted_at":"2017-12-22T10:00:07Z","abstract_excerpt":"A packing $k$-coloring for some integer $k$ of a graph $G=(V,E)$ is a mapping\n  $\\varphi:V\\to\\{1,\\ldots,k\\}$ such that any two vertices $u, v$ of color $\\varphi(u)=\\varphi(v)$ are in distance at least $\\varphi(u)+1$. This concept is motivated by frequency assignment problems. The \\emph{packing chromatic number} of $G$ is the smallest $k$ such that there exists a packing $k$-coloring of $G$.\n  Fiala and Golovach showed that determining the packing chromatic number for chordal graphs is \\NP-complete for diameter exactly 5. While the problem is easy to solve for diameter 2, we show \\NP-completene"},"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":"1712.08373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-22T10:00:07Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a44ef73151d4aa22da6399cf3b9b1eac63839f5b8a22dc8a233fe10da7d5ab5e","abstract_canon_sha256":"b761845b403ee57a3fc5084b2625490e7ce9ccfbc9a7af528c849ec2b5bfb0ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:28.341393Z","signature_b64":"4Ey2hoogHlyb62aVWM1iw2pGWwoyu4RvLiR9k4/nA8Ti9b0cGv+jVUH7jUcZ01+iciTCBT4OxQZ+qxJKQes0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4db1f4546abc3c268feeaddcfa200e1c3c9a34ca82bfca3f0b7d8d7dceb1c0b7","last_reissued_at":"2026-05-18T00:15:28.340713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:28.340713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Notes on complexity of packing coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Bernard Lidick\\'y, Florian Pfender, Minki Kim, Tom\\'a\\v{s} Masa\\v{r}\\'ik","submitted_at":"2017-12-22T10:00:07Z","abstract_excerpt":"A packing $k$-coloring for some integer $k$ of a graph $G=(V,E)$ is a mapping\n  $\\varphi:V\\to\\{1,\\ldots,k\\}$ such that any two vertices $u, v$ of color $\\varphi(u)=\\varphi(v)$ are in distance at least $\\varphi(u)+1$. This concept is motivated by frequency assignment problems. The \\emph{packing chromatic number} of $G$ is the smallest $k$ such that there exists a packing $k$-coloring of $G$.\n  Fiala and Golovach showed that determining the packing chromatic number for chordal graphs is \\NP-complete for diameter exactly 5. While the problem is easy to solve for diameter 2, we show \\NP-completene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08373","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":"1712.08373","created_at":"2026-05-18T00:15:28.340819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08373v1","created_at":"2026-05-18T00:15:28.340819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08373","created_at":"2026-05-18T00:15:28.340819+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWY7IVDKXQ6C","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWY7IVDKXQ6CND7O","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWY7IVDK","created_at":"2026-05-18T12:31:24.725408+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/JWY7IVDKXQ6CND7OVXOPUIAODQ","json":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ.json","graph_json":"https://pith.science/api/pith-number/JWY7IVDKXQ6CND7OVXOPUIAODQ/graph.json","events_json":"https://pith.science/api/pith-number/JWY7IVDKXQ6CND7OVXOPUIAODQ/events.json","paper":"https://pith.science/paper/JWY7IVDK"},"agent_actions":{"view_html":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ","download_json":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ.json","view_paper":"https://pith.science/paper/JWY7IVDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08373&json=true","fetch_graph":"https://pith.science/api/pith-number/JWY7IVDKXQ6CND7OVXOPUIAODQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JWY7IVDKXQ6CND7OVXOPUIAODQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/action/storage_attestation","attest_author":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/action/author_attestation","sign_citation":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/action/citation_signature","submit_replication":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/action/replication_record"}},"created_at":"2026-05-18T00:15:28.340819+00:00","updated_at":"2026-05-18T00:15:28.340819+00:00"}