{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QZVU26VJQDTR46ATISGRILV5TN","short_pith_number":"pith:QZVU26VJ","schema_version":"1.0","canonical_sha256":"866b4d7aa980e71e7813448d142ebd9b6b0f10540a942a29a83c5ead10c73079","source":{"kind":"arxiv","id":"1808.02675","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.02675","created_at":"2026-05-18T00:08:14.245339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02675v2","created_at":"2026-05-18T00:08:14.245339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02675","created_at":"2026-05-18T00:08:14.245339+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZVU26VJQDTR","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZVU26VJQDTR46AT","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZVU26VJ","created_at":"2026-05-18T12:32:50.500415+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/QZVU26VJQDTR46ATISGRILV5TN","json":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN.json","graph_json":"https://pith.science/api/pith-number/QZVU26VJQDTR46ATISGRILV5TN/graph.json","events_json":"https://pith.science/api/pith-number/QZVU26VJQDTR46ATISGRILV5TN/events.json","paper":"https://pith.science/paper/QZVU26VJ"},"agent_actions":{"view_html":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN","download_json":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN.json","view_paper":"https://pith.science/paper/QZVU26VJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02675&json=true","fetch_graph":"https://pith.science/api/pith-number/QZVU26VJQDTR46ATISGRILV5TN/graph.json","fetch_events":"https://pith.science/api/pith-number/QZVU26VJQDTR46ATISGRILV5TN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN/action/storage_attestation","attest_author":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN/action/author_attestation","sign_citation":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN/action/citation_signature","submit_replication":"https://pith.science/pith/QZVU26VJQDTR46ATISGRILV5TN/action/replication_record"}},"created_at":"2026-05-18T00:08:14.245339+00:00","updated_at":"2026-05-18T00:08:14.245339+00:00"}