{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IT45YPNU6WDP5E73CPHJ4T4LYL","short_pith_number":"pith:IT45YPNU","schema_version":"1.0","canonical_sha256":"44f9dc3db4f586fe93fb13ce9e4f8bc2df723e8e915036c35e3915c0a5ebf1d8","source":{"kind":"arxiv","id":"1306.0752","version":2},"attestation_state":"computed","paper":{"title":"Near-colorings: non-colorable graphs and NP-completeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mickael Montassier, Pascal Ochem","submitted_at":"2013-06-04T12:43:51Z","abstract_excerpt":"A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1 <= i <= l. In this paper, we focus on complexity aspects of such colorings when l=2,3. More precisely, we prove that, for any fixed integers k,j,g with (k,j) distinct form (0,0) and g >= 3, either every planar graph with girth at least g is (k,j)-colorable or it is NP-complete to determine whether a planar graph with girth at least g is (k,j)-colorable. Also, for any fixed integer k, it is NP-com"},"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":"1306.0752","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-04T12:43:51Z","cross_cats_sorted":[],"title_canon_sha256":"195cff264faae73b53f6cb21e2ac36097920583e2f1e36b691cc2f04df512f7c","abstract_canon_sha256":"74c2866a030ef79b1d38068ed24f0e20f7805f3403c6ede2847e170bcd56c9db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:44.942192Z","signature_b64":"TS9M74xWy+Z48kBrWbF8w4rqKi2p4rWl5J8doYDMDEAgWF1ef0LdhddS2Qu/p8AdEpsCv/vL6DplTKd1nxW3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44f9dc3db4f586fe93fb13ce9e4f8bc2df723e8e915036c35e3915c0a5ebf1d8","last_reissued_at":"2026-05-18T03:21:44.941571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:44.941571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-colorings: non-colorable graphs and NP-completeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mickael Montassier, Pascal Ochem","submitted_at":"2013-06-04T12:43:51Z","abstract_excerpt":"A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1 <= i <= l. In this paper, we focus on complexity aspects of such colorings when l=2,3. More precisely, we prove that, for any fixed integers k,j,g with (k,j) distinct form (0,0) and g >= 3, either every planar graph with girth at least g is (k,j)-colorable or it is NP-complete to determine whether a planar graph with girth at least g is (k,j)-colorable. Also, for any fixed integer k, it is NP-com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0752","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":"1306.0752","created_at":"2026-05-18T03:21:44.941647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0752v2","created_at":"2026-05-18T03:21:44.941647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0752","created_at":"2026-05-18T03:21:44.941647+00:00"},{"alias_kind":"pith_short_12","alias_value":"IT45YPNU6WDP","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"IT45YPNU6WDP5E73","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"IT45YPNU","created_at":"2026-05-18T12:27:49.015174+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/IT45YPNU6WDP5E73CPHJ4T4LYL","json":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL.json","graph_json":"https://pith.science/api/pith-number/IT45YPNU6WDP5E73CPHJ4T4LYL/graph.json","events_json":"https://pith.science/api/pith-number/IT45YPNU6WDP5E73CPHJ4T4LYL/events.json","paper":"https://pith.science/paper/IT45YPNU"},"agent_actions":{"view_html":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL","download_json":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL.json","view_paper":"https://pith.science/paper/IT45YPNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0752&json=true","fetch_graph":"https://pith.science/api/pith-number/IT45YPNU6WDP5E73CPHJ4T4LYL/graph.json","fetch_events":"https://pith.science/api/pith-number/IT45YPNU6WDP5E73CPHJ4T4LYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/action/storage_attestation","attest_author":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/action/author_attestation","sign_citation":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/action/citation_signature","submit_replication":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/action/replication_record"}},"created_at":"2026-05-18T03:21:44.941647+00:00","updated_at":"2026-05-18T03:21:44.941647+00:00"}