{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EUNXU5X5J6EI3CI7UALJS57JZV","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":"9e967370812041efa09b40b8e3dfbfad580ab6c4b868326f8be21dda1fb4ffcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-07T06:30:01Z","title_canon_sha256":"a6bc36291ff9b515fff3e5a86099d358b77a66ad5983bc0e6f66f19d418b5229"},"schema_version":"1.0","source":{"id":"1803.02537","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02537","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02537v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02537","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"EUNXU5X5J6EI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EUNXU5X5J6EI3CI7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EUNXU5X5","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:0434859f140fd0d390c9ad749a8e20c8b7ebf10213951e9c91f4a2a32713ca23","target":"graph","created_at":"2026-05-18T00:03:56Z","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 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","authors_text":"Alexandr Kostochka, J\\'ozsef Balogh, Xujun Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-07T06:30:01Z","title":"Packing chromatic number of subdivisions of cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02537","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:a4e0692d8cb3f83d9c07de35068f3914b4e2fd9a127aab06176a189cf55ca984","target":"record","created_at":"2026-05-18T00:03:56Z","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":"9e967370812041efa09b40b8e3dfbfad580ab6c4b868326f8be21dda1fb4ffcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-07T06:30:01Z","title_canon_sha256":"a6bc36291ff9b515fff3e5a86099d358b77a66ad5983bc0e6f66f19d418b5229"},"schema_version":"1.0","source":{"id":"1803.02537","kind":"arxiv","version":2}},"canonical_sha256":"251b7a76fd4f888d891fa0169977e9cd68a81c4ebc646e4128fbd6c689bc5026","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"251b7a76fd4f888d891fa0169977e9cd68a81c4ebc646e4128fbd6c689bc5026","first_computed_at":"2026-05-18T00:03:56.301638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:56.301638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/C1quo6GtGq8dvCX5a2HulYtuKUWUPdFqWvcZtjyXtvSnLot70bkS8xxpFmusgAZZKWgZmUcdOgW1XcCrPXTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:56.302284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02537","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4e0692d8cb3f83d9c07de35068f3914b4e2fd9a127aab06176a189cf55ca984","sha256:0434859f140fd0d390c9ad749a8e20c8b7ebf10213951e9c91f4a2a32713ca23"],"state_sha256":"da39b4c37f4c0c447342fcd916e584e7597dd61c203bc17bff3ff3deb1d01135"}