{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FVHCSCZF3GWEJWNXMUHY7HLCFS","short_pith_number":"pith:FVHCSCZF","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"},"canonical_sha256":"2d4e290b25d9ac44d9b7650f8f9d622c883a203c187fd18af6916c70cccafaed","source":{"kind":"arxiv","id":"1703.09873","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09873","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09873v2","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09873","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"FVHCSCZF3GWE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVHCSCZF3GWEJWNX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVHCSCZF","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FVHCSCZF3GWEJWNXMUHY7HLCFS","target":"record","payload":{"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"},"canonical_sha256":"2d4e290b25d9ac44d9b7650f8f9d622c883a203c187fd18af6916c70cccafaed","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"},"source_kind":"arxiv","source_id":"1703.09873","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:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFmycqtZkyLWxm+Kq/qEGgxNp76Bt4AuHPX38i3pl6nC/24ADT/vN1qATW+jSZS51iDYQ2I/B0c7LbKQnhNKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:24:51.280422Z"},"content_sha256":"d875992633546e5210ab2cc85d2aa67bcb8420c0322fabde242127e7166c5637","schema_version":"1.0","event_id":"sha256:d875992633546e5210ab2cc85d2aa67bcb8420c0322fabde242127e7166c5637"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FVHCSCZF3GWEJWNXMUHY7HLCFS","target":"graph","payload":{"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"},"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:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4fQSh22aHxaa9g6mmw4WpQqeBrjoaXvqJCUFIMRzSEabbBnXNfdbqjUK1dL0IpvKbeecnPrsuyfgLWm/yGXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:24:51.281019Z"},"content_sha256":"f26028bdc789b829dbfcde46adf56af4aadc9fbb5874011fe08736279d98bb8d","schema_version":"1.0","event_id":"sha256:f26028bdc789b829dbfcde46adf56af4aadc9fbb5874011fe08736279d98bb8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/bundle.json","state_url":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/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-23T01:24:51Z","links":{"resolver":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS","bundle":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/bundle.json","state":"https://pith.science/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVHCSCZF3GWEJWNXMUHY7HLCFS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FVHCSCZF3GWEJWNXMUHY7HLCFS","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":"3aa66ebb7131875a8a38e53b32788a21f4b9fde815f0c28efcdf0acbda528ac2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-29T03:29:07Z","title_canon_sha256":"e54ad3677856bae49b06a6aee874f9d18902c91e7875884494e7a25baf7dae2d"},"schema_version":"1.0","source":{"id":"1703.09873","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09873","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09873v2","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09873","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"FVHCSCZF3GWE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVHCSCZF3GWEJWNX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVHCSCZF","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:f26028bdc789b829dbfcde46adf56af4aadc9fbb5874011fe08736279d98bb8d","target":"graph","created_at":"2026-05-18T00:47:37Z","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. 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","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":"2017-03-29T03:29:07Z","title":"Packing chromatic number of subcubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09873","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:d875992633546e5210ab2cc85d2aa67bcb8420c0322fabde242127e7166c5637","target":"record","created_at":"2026-05-18T00:47:37Z","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":"3aa66ebb7131875a8a38e53b32788a21f4b9fde815f0c28efcdf0acbda528ac2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-29T03:29:07Z","title_canon_sha256":"e54ad3677856bae49b06a6aee874f9d18902c91e7875884494e7a25baf7dae2d"},"schema_version":"1.0","source":{"id":"1703.09873","kind":"arxiv","version":2}},"canonical_sha256":"2d4e290b25d9ac44d9b7650f8f9d622c883a203c187fd18af6916c70cccafaed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d4e290b25d9ac44d9b7650f8f9d622c883a203c187fd18af6916c70cccafaed","first_computed_at":"2026-05-18T00:47:37.728355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:37.728355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xej3eHYS2yWYz67ZmrLGWljNqg2YkW88dAiMwClaqyUXyXnLa+n/Cfg2ovtAGPclpCDa4nrKtxe0UuwnR9HTCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:37.729062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09873","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d875992633546e5210ab2cc85d2aa67bcb8420c0322fabde242127e7166c5637","sha256:f26028bdc789b829dbfcde46adf56af4aadc9fbb5874011fe08736279d98bb8d"],"state_sha256":"88eb571562b5e504c53e9b6d803487b88632602048cfb537477c603024f11f2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsmmJCG/eATUw//0kBau5lOAdEXhbtlAzMJZUJYXsBO7QtsIP0wwowFD7Atukjh9MIn3a3zhSaZZMF0a9YQJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T01:24:51.284088Z","bundle_sha256":"c98d9c2e16337e9c4e9ac89a86cabbd50fd2d37fbbb62095ab5798740c0d1baa"}}