{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YSMCBLCM5F5Z7HS4H5WDMMQJGC","short_pith_number":"pith:YSMCBLCM","schema_version":"1.0","canonical_sha256":"c49820ac4ce97b9f9e5c3f6c363209309b836a7b197cb9ddebb097689812eed9","source":{"kind":"arxiv","id":"1608.05577","version":1},"attestation_state":"computed","paper":{"title":"Packing chromatic number under local changes in a graph","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, Douglas F. Rall, Kirsti Wash, Sandi Klav\\v{z}ar","submitted_at":"2016-08-19T11:56:48Z","abstract_excerpt":"The packing chromatic number $\\chi_{\\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that there exists a $k$-vertex coloring of $G$ in which any two vertices receiving color $i$ are at distance at least $i+1$. It is proved that in the class of subcubic graphs the packing chromatic number is bigger than $13$, thus answering an open problem from [Gastineau, Togni, $S$-packing colorings of cubic graphs, Discrete Math.\\ 339 (2016) 2461--2470]. In addition, the packing chromatic number is investigated with respect to several local operations. In particular, if $S_e(G)$ is the graph obtaine"},"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":"1608.05577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T11:56:48Z","cross_cats_sorted":[],"title_canon_sha256":"d9f04a4be2650a5b3b586c9a2a0cf7b981d0cae1064c0b291679b87f88109fbd","abstract_canon_sha256":"ab377b8dfe126aea85811367736050eab3c83ed57a9f5da011962243dd501129"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:28.134580Z","signature_b64":"bEX8I+g0Ap3SEuril6zLodJu83YM7TSCGYH2Az/D1nBsbI2up58OAIRcvOEjLecvG4s7Vv9/hfafYiOBIDYWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c49820ac4ce97b9f9e5c3f6c363209309b836a7b197cb9ddebb097689812eed9","last_reissued_at":"2026-05-18T01:08:28.133913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:28.133913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing chromatic number under local changes in a graph","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, Douglas F. Rall, Kirsti Wash, Sandi Klav\\v{z}ar","submitted_at":"2016-08-19T11:56:48Z","abstract_excerpt":"The packing chromatic number $\\chi_{\\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that there exists a $k$-vertex coloring of $G$ in which any two vertices receiving color $i$ are at distance at least $i+1$. It is proved that in the class of subcubic graphs the packing chromatic number is bigger than $13$, thus answering an open problem from [Gastineau, Togni, $S$-packing colorings of cubic graphs, Discrete Math.\\ 339 (2016) 2461--2470]. In addition, the packing chromatic number is investigated with respect to several local operations. In particular, if $S_e(G)$ is the graph obtaine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05577","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":"1608.05577","created_at":"2026-05-18T01:08:28.134014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05577v1","created_at":"2026-05-18T01:08:28.134014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05577","created_at":"2026-05-18T01:08:28.134014+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSMCBLCM5F5Z","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSMCBLCM5F5Z7HS4","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSMCBLCM","created_at":"2026-05-18T12:30:53.716459+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/YSMCBLCM5F5Z7HS4H5WDMMQJGC","json":"https://pith.science/pith/YSMCBLCM5F5Z7HS4H5WDMMQJGC.json","graph_json":"https://pith.science/api/pith-number/YSMCBLCM5F5Z7HS4H5WDMMQJGC/graph.json","events_json":"https://pith.science/api/pith-number/YSMCBLCM5F5Z7HS4H5WDMMQJGC/events.json","paper":"https://pith.science/paper/YSMCBLCM"},"agent_actions":{"view_html":"https://pith.science/pith/YSMCBLCM5F5Z7HS4H5WDMMQJGC","download_json":"https://pith.science/pith/YSMCBLCM5F5Z7HS4H5WDMMQJGC.json","view_paper":"https://pith.science/paper/YSMCBLCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05577&json=true","fetch_graph":"https://pith.science/api/pith-number/YSMCBLCM5F5Z7HS4H5WDMMQJGC/graph.json","fetch_events":"https://pith.science/api/pith-number/YSMCBLCM5F5Z7HS4H5WDMMQJGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSMCBLCM5F5Z7HS4H5WDMMQJGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSMCBLCM5F5Z7HS4H5WDMMQJGC/action/storage_attestation","attest_author":"https://pith.science/pith/YSMCBLCM5F5Z7HS4H5WDMMQJGC/action/author_attestation","sign_citation":"https://pith.science/pith/YSMCBLCM5F5Z7HS4H5WDMMQJGC/action/citation_signature","submit_replication":"https://pith.science/pith/YSMCBLCM5F5Z7HS4H5WDMMQJGC/action/replication_record"}},"created_at":"2026-05-18T01:08:28.134014+00:00","updated_at":"2026-05-18T01:08:28.134014+00:00"}