{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EUNXU5X5J6EI3CI7UALJS57JZV","short_pith_number":"pith:EUNXU5X5","schema_version":"1.0","canonical_sha256":"251b7a76fd4f888d891fa0169977e9cd68a81c4ebc646e4128fbd6c689bc5026","source":{"kind":"arxiv","id":"1803.02537","version":2},"attestation_state":"computed","paper":{"title":"Packing chromatic number of subdivisions of cubic 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":"2018-03-07T06:30:01Z","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. For a graph $G$, let $D(G)$ denote the graph obtained from $G$ by subdividing every edge. The questions on the value of the maximum of $\\chi_p(G)$ and of $\\chi_p(D(G))$ over the class of subcubic graphs $G$ appear in several papers. Gastineau and Togni asked whether $\\chi_p(D(G))\\leq 5"},"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":"1803.02537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-07T06:30:01Z","cross_cats_sorted":[],"title_canon_sha256":"a6bc36291ff9b515fff3e5a86099d358b77a66ad5983bc0e6f66f19d418b5229","abstract_canon_sha256":"9e967370812041efa09b40b8e3dfbfad580ab6c4b868326f8be21dda1fb4ffcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.302284Z","signature_b64":"/C1quo6GtGq8dvCX5a2HulYtuKUWUPdFqWvcZtjyXtvSnLot70bkS8xxpFmusgAZZKWgZmUcdOgW1XcCrPXTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"251b7a76fd4f888d891fa0169977e9cd68a81c4ebc646e4128fbd6c689bc5026","last_reissued_at":"2026-05-18T00:03:56.301638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.301638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing chromatic number of subdivisions of cubic 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":"2018-03-07T06:30:01Z","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. For a graph $G$, let $D(G)$ denote the graph obtained from $G$ by subdividing every edge. The questions on the value of the maximum of $\\chi_p(G)$ and of $\\chi_p(D(G))$ over the class of subcubic graphs $G$ appear in several papers. Gastineau and Togni asked whether $\\chi_p(D(G))\\leq 5"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02537","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":"1803.02537","created_at":"2026-05-18T00:03:56.301729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02537v2","created_at":"2026-05-18T00:03:56.301729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02537","created_at":"2026-05-18T00:03:56.301729+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUNXU5X5J6EI","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUNXU5X5J6EI3CI7","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUNXU5X5","created_at":"2026-05-18T12:32:22.470017+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/EUNXU5X5J6EI3CI7UALJS57JZV","json":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV.json","graph_json":"https://pith.science/api/pith-number/EUNXU5X5J6EI3CI7UALJS57JZV/graph.json","events_json":"https://pith.science/api/pith-number/EUNXU5X5J6EI3CI7UALJS57JZV/events.json","paper":"https://pith.science/paper/EUNXU5X5"},"agent_actions":{"view_html":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV","download_json":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV.json","view_paper":"https://pith.science/paper/EUNXU5X5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02537&json=true","fetch_graph":"https://pith.science/api/pith-number/EUNXU5X5J6EI3CI7UALJS57JZV/graph.json","fetch_events":"https://pith.science/api/pith-number/EUNXU5X5J6EI3CI7UALJS57JZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV/action/storage_attestation","attest_author":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV/action/author_attestation","sign_citation":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV/action/citation_signature","submit_replication":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV/action/replication_record"}},"created_at":"2026-05-18T00:03:56.301729+00:00","updated_at":"2026-05-18T00:03:56.301729+00:00"}