{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W7AD3ZFEYC477FPHT6T2PO5Z2X","short_pith_number":"pith:W7AD3ZFE","schema_version":"1.0","canonical_sha256":"b7c03de4a4c0b9ff95e79fa7a7bbb9d5f7c7485b0842a1a21ae654f487c16aa1","source":{"kind":"arxiv","id":"1801.09871","version":1},"attestation_state":"computed","paper":{"title":"An infinite family of subcubic graphs with unbounded packing chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Jasmina Ferme","submitted_at":"2018-01-30T07:12:31Z","abstract_excerpt":"Recently, Balogh, Kostochka and Liu in [Packing chromatic number of cubic graphs, Discrete Math.~341 (2018) 474--483] answered in negative the question that was posed in several earlier papers whether the packing chromatic number is bounded in the class of graphs with maximum degree $3$. In this note, we present an explicit infinite family of subcubic graphs with unbounded packing chromatic number."},"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":"1801.09871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-30T07:12:31Z","cross_cats_sorted":[],"title_canon_sha256":"fe72a844c8e7a412b6db697b89ef5975fc96d843a0f0bdfee8372b490d3a0a02","abstract_canon_sha256":"20006dc4899298c91fc12f8b6ed9e282d7ca9a570586793d00aaf275bd81177a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:46.529024Z","signature_b64":"J6pdxKxioxq/yDDEI6XBmyB2bUwYyPEpItt3Yf2WOks4KVpR6M4q14a93TOHUdOPMkOTSR/LTH+2jBxxaNVBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7c03de4a4c0b9ff95e79fa7a7bbb9d5f7c7485b0842a1a21ae654f487c16aa1","last_reissued_at":"2026-05-18T00:24:46.528389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:46.528389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An infinite family of subcubic graphs with unbounded packing chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Jasmina Ferme","submitted_at":"2018-01-30T07:12:31Z","abstract_excerpt":"Recently, Balogh, Kostochka and Liu in [Packing chromatic number of cubic graphs, Discrete Math.~341 (2018) 474--483] answered in negative the question that was posed in several earlier papers whether the packing chromatic number is bounded in the class of graphs with maximum degree $3$. In this note, we present an explicit infinite family of subcubic graphs with unbounded packing chromatic number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09871","kind":"arxiv","version":1},"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":"1801.09871","created_at":"2026-05-18T00:24:46.528489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.09871v1","created_at":"2026-05-18T00:24:46.528489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09871","created_at":"2026-05-18T00:24:46.528489+00:00"},{"alias_kind":"pith_short_12","alias_value":"W7AD3ZFEYC47","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W7AD3ZFEYC477FPH","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W7AD3ZFE","created_at":"2026-05-18T12:32:59.047623+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/W7AD3ZFEYC477FPHT6T2PO5Z2X","json":"https://pith.science/pith/W7AD3ZFEYC477FPHT6T2PO5Z2X.json","graph_json":"https://pith.science/api/pith-number/W7AD3ZFEYC477FPHT6T2PO5Z2X/graph.json","events_json":"https://pith.science/api/pith-number/W7AD3ZFEYC477FPHT6T2PO5Z2X/events.json","paper":"https://pith.science/paper/W7AD3ZFE"},"agent_actions":{"view_html":"https://pith.science/pith/W7AD3ZFEYC477FPHT6T2PO5Z2X","download_json":"https://pith.science/pith/W7AD3ZFEYC477FPHT6T2PO5Z2X.json","view_paper":"https://pith.science/paper/W7AD3ZFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.09871&json=true","fetch_graph":"https://pith.science/api/pith-number/W7AD3ZFEYC477FPHT6T2PO5Z2X/graph.json","fetch_events":"https://pith.science/api/pith-number/W7AD3ZFEYC477FPHT6T2PO5Z2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W7AD3ZFEYC477FPHT6T2PO5Z2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W7AD3ZFEYC477FPHT6T2PO5Z2X/action/storage_attestation","attest_author":"https://pith.science/pith/W7AD3ZFEYC477FPHT6T2PO5Z2X/action/author_attestation","sign_citation":"https://pith.science/pith/W7AD3ZFEYC477FPHT6T2PO5Z2X/action/citation_signature","submit_replication":"https://pith.science/pith/W7AD3ZFEYC477FPHT6T2PO5Z2X/action/replication_record"}},"created_at":"2026-05-18T00:24:46.528489+00:00","updated_at":"2026-05-18T00:24:46.528489+00:00"}