{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QZVU26VJQDTR46ATISGRILV5TN","short_pith_number":"pith:QZVU26VJ","canonical_record":{"source":{"id":"1808.02675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-08T08:59:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d83704bc1c84a87c1423c1456ea80b947ee7b7860d36f37819916b7dd75eef9e","abstract_canon_sha256":"1809b6a1dcbf89511be928e6d2b6ba11b69cebac8355cf3e643bb342392d5885"},"schema_version":"1.0"},"canonical_sha256":"866b4d7aa980e71e7813448d142ebd9b6b0f10540a942a29a83c5ead10c73079","source":{"kind":"arxiv","id":"1808.02675","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02675","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02675v2","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02675","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"QZVU26VJQDTR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QZVU26VJQDTR46AT","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QZVU26VJ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QZVU26VJQDTR46ATISGRILV5TN","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-08T08:59:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d83704bc1c84a87c1423c1456ea80b947ee7b7860d36f37819916b7dd75eef9e","abstract_canon_sha256":"1809b6a1dcbf89511be928e6d2b6ba11b69cebac8355cf3e643bb342392d5885"},"schema_version":"1.0"},"canonical_sha256":"866b4d7aa980e71e7813448d142ebd9b6b0f10540a942a29a83c5ead10c73079","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:14.245643Z","signature_b64":"r7l/IIt9fZQEUSMmMquzBzR9PA2RRKXm3tzwDkFK9sds0LJHZYjbhDEQR5Va/Jxb2ksvvEFnIMykmI6W64YxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"866b4d7aa980e71e7813448d142ebd9b6b0f10540a942a29a83c5ead10c73079","last_reissued_at":"2026-05-18T00:08:14.245277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:14.245277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02675","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:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBvzegS6mukmrNZU/zZv76SZLGCC1J0G4424LdO8VGqUcqD5VX7KHDDcaiz8h9CU5UzY6Rb2RkFd63k7TaWSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:35:48.570983Z"},"content_sha256":"fd3b94cf2cc18877dd0d6fb5d2d4149fc3494d1ccc541ac782fe92fa7a6997ee","schema_version":"1.0","event_id":"sha256:fd3b94cf2cc18877dd0d6fb5d2d4149fc3494d1ccc541ac782fe92fa7a6997ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QZVU26VJQDTR46ATISGRILV5TN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing colouring of some classes of cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Daouya La\\\"iche (L'IFORCE), Eric Sopena (LaBRI)","submitted_at":"2018-08-08T08:59:55Z","abstract_excerpt":"The packing chromatic number $\\chi$ $\\rho$ (G) of a graph G is the smallest integer k such that its set of vertices V (G) can be partitioned into k disjoint subsets V 1 ,. .. , V k , in such a way that every two distinct vertices in V i are at distance greater than i in G for every i, 1 $\\le$ i $\\le$ k. Recently, Balogh, Kostochka and Liu proved that $\\chi$ $\\rho$ is not bounded in the class of subcubic graphs [Packing chromatic number of subcubic graphs, Discrete Math. 341 (2018), 474483], thus answering a question previously addressed in several papers. However, several subclasses of cubic o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02675","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:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HATAEJmHEtZOwGp/nRHYVf2Y22xy+8HVt/vqJsKW/xBx3NjxHyyiCvH8s2Q/GVzi/YBTBUVBQXAS5/e70/slBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:35:48.571344Z"},"content_sha256":"c99341beb2416d4be156734ca1c0c761e01b219210b11695704a898364f12b66","schema_version":"1.0","event_id":"sha256:c99341beb2416d4be156734ca1c0c761e01b219210b11695704a898364f12b66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN/bundle.json","state_url":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZVU26VJQDTR46ATISGRILV5TN/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-05T20:35:48Z","links":{"resolver":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN","bundle":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN/bundle.json","state":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZVU26VJQDTR46ATISGRILV5TN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QZVU26VJQDTR46ATISGRILV5TN","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":"1809b6a1dcbf89511be928e6d2b6ba11b69cebac8355cf3e643bb342392d5885","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-08T08:59:55Z","title_canon_sha256":"d83704bc1c84a87c1423c1456ea80b947ee7b7860d36f37819916b7dd75eef9e"},"schema_version":"1.0","source":{"id":"1808.02675","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02675","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02675v2","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02675","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"QZVU26VJQDTR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QZVU26VJQDTR46AT","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QZVU26VJ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:c99341beb2416d4be156734ca1c0c761e01b219210b11695704a898364f12b66","target":"graph","created_at":"2026-05-18T00:08:14Z","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":"The packing chromatic number $\\chi$ $\\rho$ (G) of a graph G is the smallest integer k such that its set of vertices V (G) can be partitioned into k disjoint subsets V 1 ,. .. , V k , in such a way that every two distinct vertices in V i are at distance greater than i in G for every i, 1 $\\le$ i $\\le$ k. Recently, Balogh, Kostochka and Liu proved that $\\chi$ $\\rho$ is not bounded in the class of subcubic graphs [Packing chromatic number of subcubic graphs, Discrete Math. 341 (2018), 474483], thus answering a question previously addressed in several papers. However, several subclasses of cubic o","authors_text":"Daouya La\\\"iche (L'IFORCE), Eric Sopena (LaBRI)","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-08T08:59:55Z","title":"Packing colouring of some classes of cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02675","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:fd3b94cf2cc18877dd0d6fb5d2d4149fc3494d1ccc541ac782fe92fa7a6997ee","target":"record","created_at":"2026-05-18T00:08:14Z","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":"1809b6a1dcbf89511be928e6d2b6ba11b69cebac8355cf3e643bb342392d5885","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-08T08:59:55Z","title_canon_sha256":"d83704bc1c84a87c1423c1456ea80b947ee7b7860d36f37819916b7dd75eef9e"},"schema_version":"1.0","source":{"id":"1808.02675","kind":"arxiv","version":2}},"canonical_sha256":"866b4d7aa980e71e7813448d142ebd9b6b0f10540a942a29a83c5ead10c73079","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"866b4d7aa980e71e7813448d142ebd9b6b0f10540a942a29a83c5ead10c73079","first_computed_at":"2026-05-18T00:08:14.245277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:14.245277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r7l/IIt9fZQEUSMmMquzBzR9PA2RRKXm3tzwDkFK9sds0LJHZYjbhDEQR5Va/Jxb2ksvvEFnIMykmI6W64YxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:14.245643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02675","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd3b94cf2cc18877dd0d6fb5d2d4149fc3494d1ccc541ac782fe92fa7a6997ee","sha256:c99341beb2416d4be156734ca1c0c761e01b219210b11695704a898364f12b66"],"state_sha256":"f051840d12db2b734d12166ed4e3b35a7efd50fc6026768eccb536139640ee66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWGAJzxT6Go1qcuN1iZo86m2h66pft252haHHzR9Swuu3f5YqLI367iEwYGb6/Rs17lYVLZwAEBCzGh4p0/4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:35:48.573481Z","bundle_sha256":"ffc96519ada3b3fff829870ea8674df12e689b899577d231a36050dd46514d97"}}