{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FVHCSCZF3GWEJWNXMUHY7HLCFS","short_pith_number":"pith:FVHCSCZF","schema_version":"1.0","canonical_sha256":"2d4e290b25d9ac44d9b7650f8f9d622c883a203c187fd18af6916c70cccafaed","source":{"kind":"arxiv","id":"1703.09873","version":2},"attestation_state":"computed","paper":{"title":"Packing chromatic number of subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, J\\'ozsef Balogh, Xujun Liu","submitted_at":"2017-03-29T03:29:07Z","abstract_excerpt":"A packing $k$-coloring of a graph $G$ is a partition of $V(G)$ into sets $V_1,\\ldots,V_k$ such that for each $1\\leq i\\leq k$ the distance between any two distinct $x,y\\in V_i$ is at least $i+1$. The packing chromatic number, $\\chi_p(G)$, of a graph $G$ is the minimum $k$ such that $G$ has a packing $k$-coloring. Sloper showed that there are $4$-regular graphs with arbitrarily large packing chromatic number. The question whether the packing chromatic number of subcubic graphs is bounded appears in several papers. We answer this question in the negative. Moreover, we show that for every fixed $k"},"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":"1703.09873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-29T03:29:07Z","cross_cats_sorted":[],"title_canon_sha256":"e54ad3677856bae49b06a6aee874f9d18902c91e7875884494e7a25baf7dae2d","abstract_canon_sha256":"3aa66ebb7131875a8a38e53b32788a21f4b9fde815f0c28efcdf0acbda528ac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:37.729062Z","signature_b64":"xej3eHYS2yWYz67ZmrLGWljNqg2YkW88dAiMwClaqyUXyXnLa+n/Cfg2ovtAGPclpCDa4nrKtxe0UuwnR9HTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d4e290b25d9ac44d9b7650f8f9d622c883a203c187fd18af6916c70cccafaed","last_reissued_at":"2026-05-18T00:47:37.728355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:37.728355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing chromatic number of subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, J\\'ozsef Balogh, Xujun Liu","submitted_at":"2017-03-29T03:29:07Z","abstract_excerpt":"A packing $k$-coloring of a graph $G$ is a partition of $V(G)$ into sets $V_1,\\ldots,V_k$ such that for each $1\\leq i\\leq k$ the distance between any two distinct $x,y\\in V_i$ is at least $i+1$. The packing chromatic number, $\\chi_p(G)$, of a graph $G$ is the minimum $k$ such that $G$ has a packing $k$-coloring. Sloper showed that there are $4$-regular graphs with arbitrarily large packing chromatic number. The question whether the packing chromatic number of subcubic graphs is bounded appears in several papers. We answer this question in the negative. Moreover, we show that for every fixed $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09873","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":"1703.09873","created_at":"2026-05-18T00:47:37.728468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.09873v2","created_at":"2026-05-18T00:47:37.728468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09873","created_at":"2026-05-18T00:47:37.728468+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVHCSCZF3GWE","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVHCSCZF3GWEJWNX","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVHCSCZF","created_at":"2026-05-18T12:31:15.632608+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/FVHCSCZF3GWEJWNXMUHY7HLCFS","json":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS.json","graph_json":"https://pith.science/api/pith-number/FVHCSCZF3GWEJWNXMUHY7HLCFS/graph.json","events_json":"https://pith.science/api/pith-number/FVHCSCZF3GWEJWNXMUHY7HLCFS/events.json","paper":"https://pith.science/paper/FVHCSCZF"},"agent_actions":{"view_html":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS","download_json":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS.json","view_paper":"https://pith.science/paper/FVHCSCZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.09873&json=true","fetch_graph":"https://pith.science/api/pith-number/FVHCSCZF3GWEJWNXMUHY7HLCFS/graph.json","fetch_events":"https://pith.science/api/pith-number/FVHCSCZF3GWEJWNXMUHY7HLCFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/action/storage_attestation","attest_author":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/action/author_attestation","sign_citation":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/action/citation_signature","submit_replication":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/action/replication_record"}},"created_at":"2026-05-18T00:47:37.728468+00:00","updated_at":"2026-05-18T00:47:37.728468+00:00"}