{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EUNXU5X5J6EI3CI7UALJS57JZV","short_pith_number":"pith:EUNXU5X5","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"},"canonical_sha256":"251b7a76fd4f888d891fa0169977e9cd68a81c4ebc646e4128fbd6c689bc5026","source":{"kind":"arxiv","id":"1803.02537","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EUNXU5X5J6EI3CI7UALJS57JZV","target":"record","payload":{"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"},"canonical_sha256":"251b7a76fd4f888d891fa0169977e9cd68a81c4ebc646e4128fbd6c689bc5026","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"},"source_kind":"arxiv","source_id":"1803.02537","source_version":2,"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:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+n19FCNTIo2crsSQZV/l5qCHZnAlgeawsYOhgjwnvF28YVS0PvMT2TyYBR+hMIuf+mw5z2fOkht6kABcgUgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:40:19.721944Z"},"content_sha256":"a4e0692d8cb3f83d9c07de35068f3914b4e2fd9a127aab06176a189cf55ca984","schema_version":"1.0","event_id":"sha256:a4e0692d8cb3f83d9c07de35068f3914b4e2fd9a127aab06176a189cf55ca984"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EUNXU5X5J6EI3CI7UALJS57JZV","target":"graph","payload":{"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"},"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:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zoti/+SvF++RlRbGy4twuclhepPM/HU5d1HEgMe9YS8MxmJlZTGWQZgFfcnJV6lCWa18BMCxDBdmCSrQC6ACCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:40:19.722419Z"},"content_sha256":"0434859f140fd0d390c9ad749a8e20c8b7ebf10213951e9c91f4a2a32713ca23","schema_version":"1.0","event_id":"sha256:0434859f140fd0d390c9ad749a8e20c8b7ebf10213951e9c91f4a2a32713ca23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV/bundle.json","state_url":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUNXU5X5J6EI3CI7UALJS57JZV/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-23T02:40:19Z","links":{"resolver":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV","bundle":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV/bundle.json","state":"https://pith.science/pith/EUNXU5X5J6EI3CI7UALJS57JZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUNXU5X5J6EI3CI7UALJS57JZV/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"baqLjOOHteShs1vTfooLfSJfGPAySq/VJcYN29Gn6GZucPCFOgQhQNBSaXaFvo+15TCWageNy4eSgCL8991aAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:40:19.724984Z","bundle_sha256":"7b5cc5cd8f680ed6d8990ab29845de44f6836d6f934ec274887a003a5f346b0b"}}