{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JWY7IVDKXQ6CND7OVXOPUIAODQ","short_pith_number":"pith:JWY7IVDK","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"},"canonical_sha256":"4db1f4546abc3c268feeaddcfa200e1c3c9a34ca82bfca3f0b7d8d7dceb1c0b7","source":{"kind":"arxiv","id":"1712.08373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08373","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08373v1","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08373","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"JWY7IVDKXQ6C","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JWY7IVDKXQ6CND7O","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JWY7IVDK","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JWY7IVDKXQ6CND7OVXOPUIAODQ","target":"record","payload":{"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"},"canonical_sha256":"4db1f4546abc3c268feeaddcfa200e1c3c9a34ca82bfca3f0b7d8d7dceb1c0b7","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"},"source_kind":"arxiv","source_id":"1712.08373","source_version":1,"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-18T00:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvWoIE/lbS2rOo56iTEHtCiPEOaDDZvSQroy5CANTO3zN9mOU40/FM8LeWom+OmMKh6NBJUudm26hC/cpXWnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:57:48.534890Z"},"content_sha256":"f2a7351f2beeca9e6b6aa823036a8e11b6263b0132b56d13362ea08805fb864c","schema_version":"1.0","event_id":"sha256:f2a7351f2beeca9e6b6aa823036a8e11b6263b0132b56d13362ea08805fb864c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JWY7IVDKXQ6CND7OVXOPUIAODQ","target":"graph","payload":{"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"},"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-18T00:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UX8PzfT468+Az8Z589mg+bncPcwfCZHCponxBLaJXUojZhm1tj8eknIGCJzGndua1BBQHbnaWQIC53OtANivCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:57:48.535486Z"},"content_sha256":"aa7b7ada583ff33eeca5af3b19f0312cdc38706a157eb982c35b6aef34ccac6c","schema_version":"1.0","event_id":"sha256:aa7b7ada583ff33eeca5af3b19f0312cdc38706a157eb982c35b6aef34ccac6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/bundle.json","state_url":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/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-06T20:57:48Z","links":{"resolver":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ","bundle":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/bundle.json","state":"https://pith.science/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWY7IVDKXQ6CND7OVXOPUIAODQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JWY7IVDKXQ6CND7OVXOPUIAODQ","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":"b761845b403ee57a3fc5084b2625490e7ce9ccfbc9a7af528c849ec2b5bfb0ca","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-22T10:00:07Z","title_canon_sha256":"a44ef73151d4aa22da6399cf3b9b1eac63839f5b8a22dc8a233fe10da7d5ab5e"},"schema_version":"1.0","source":{"id":"1712.08373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08373","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08373v1","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08373","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"JWY7IVDKXQ6C","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JWY7IVDKXQ6CND7O","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JWY7IVDK","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:aa7b7ada583ff33eeca5af3b19f0312cdc38706a157eb982c35b6aef34ccac6c","target":"graph","created_at":"2026-05-18T00:15:28Z","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":"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","authors_text":"Bernard Lidick\\'y, Florian Pfender, Minki Kim, Tom\\'a\\v{s} Masa\\v{r}\\'ik","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-22T10:00:07Z","title":"Notes on complexity of packing coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08373","kind":"arxiv","version":1},"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:f2a7351f2beeca9e6b6aa823036a8e11b6263b0132b56d13362ea08805fb864c","target":"record","created_at":"2026-05-18T00:15:28Z","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":"b761845b403ee57a3fc5084b2625490e7ce9ccfbc9a7af528c849ec2b5bfb0ca","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-22T10:00:07Z","title_canon_sha256":"a44ef73151d4aa22da6399cf3b9b1eac63839f5b8a22dc8a233fe10da7d5ab5e"},"schema_version":"1.0","source":{"id":"1712.08373","kind":"arxiv","version":1}},"canonical_sha256":"4db1f4546abc3c268feeaddcfa200e1c3c9a34ca82bfca3f0b7d8d7dceb1c0b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4db1f4546abc3c268feeaddcfa200e1c3c9a34ca82bfca3f0b7d8d7dceb1c0b7","first_computed_at":"2026-05-18T00:15:28.340713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:28.340713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Ey2hoogHlyb62aVWM1iw2pGWwoyu4RvLiR9k4/nA8Ti9b0cGv+jVUH7jUcZ01+iciTCBT4OxQZ+qxJKQes0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:28.341393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2a7351f2beeca9e6b6aa823036a8e11b6263b0132b56d13362ea08805fb864c","sha256:aa7b7ada583ff33eeca5af3b19f0312cdc38706a157eb982c35b6aef34ccac6c"],"state_sha256":"bd65a53e8840fbacfaf6be5fbac3035e9282ebe783c6766c5244ba7e5f234397"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSB1DEmiA4VR1CaaPTRksBcPqsCy4KsQDruKAcG/nV5qNAk8TNCeOek/yWcreSBsjUoikVaIUma1yGPeuaSsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:57:48.539117Z","bundle_sha256":"30e4a48fe8be73a43e0714a4c71a67df91054e77bd9c1aa0bf9d97805b026d63"}}