{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IT45YPNU6WDP5E73CPHJ4T4LYL","short_pith_number":"pith:IT45YPNU","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"},"canonical_sha256":"44f9dc3db4f586fe93fb13ce9e4f8bc2df723e8e915036c35e3915c0a5ebf1d8","source":{"kind":"arxiv","id":"1306.0752","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0752","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0752v2","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0752","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"IT45YPNU6WDP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IT45YPNU6WDP5E73","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IT45YPNU","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IT45YPNU6WDP5E73CPHJ4T4LYL","target":"record","payload":{"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"},"canonical_sha256":"44f9dc3db4f586fe93fb13ce9e4f8bc2df723e8e915036c35e3915c0a5ebf1d8","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"},"source_kind":"arxiv","source_id":"1306.0752","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-18T03:21:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AfobKgAviTTRmPcY2EYKeshnfJElJQslrVHDItGfJlYVEr8OxusJBT2L7YK0Bct/bB+nXEmrD6w93ypoGZDODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:26:20.928759Z"},"content_sha256":"aa57dcf2395a2ba593d17fbc20f94801a0d3038a3a8014e290f28bc84147787b","schema_version":"1.0","event_id":"sha256:aa57dcf2395a2ba593d17fbc20f94801a0d3038a3a8014e290f28bc84147787b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IT45YPNU6WDP5E73CPHJ4T4LYL","target":"graph","payload":{"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"},"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-18T03:21:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kpsgKiW5F/7zYpksWMiupsfoEypKDG9EOWhDsC86bKsyDAcX9A9Pr22gI9bKzIdfEttynHMmpOJtawJXZX0TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:26:20.929413Z"},"content_sha256":"3bb3799ec48ce366bd881e3c79b4a6d5ce673c5a18b948d71ce5e09d096ebae9","schema_version":"1.0","event_id":"sha256:3bb3799ec48ce366bd881e3c79b4a6d5ce673c5a18b948d71ce5e09d096ebae9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/bundle.json","state_url":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/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-05-27T22:26:20Z","links":{"resolver":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL","bundle":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/bundle.json","state":"https://pith.science/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IT45YPNU6WDP5E73CPHJ4T4LYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IT45YPNU6WDP5E73CPHJ4T4LYL","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":"74c2866a030ef79b1d38068ed24f0e20f7805f3403c6ede2847e170bcd56c9db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-04T12:43:51Z","title_canon_sha256":"195cff264faae73b53f6cb21e2ac36097920583e2f1e36b691cc2f04df512f7c"},"schema_version":"1.0","source":{"id":"1306.0752","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0752","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0752v2","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0752","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"IT45YPNU6WDP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IT45YPNU6WDP5E73","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IT45YPNU","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:3bb3799ec48ce366bd881e3c79b4a6d5ce673c5a18b948d71ce5e09d096ebae9","target":"graph","created_at":"2026-05-18T03:21:44Z","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":"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","authors_text":"Mickael Montassier, Pascal Ochem","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-04T12:43:51Z","title":"Near-colorings: non-colorable graphs and NP-completeness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0752","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:aa57dcf2395a2ba593d17fbc20f94801a0d3038a3a8014e290f28bc84147787b","target":"record","created_at":"2026-05-18T03:21:44Z","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":"74c2866a030ef79b1d38068ed24f0e20f7805f3403c6ede2847e170bcd56c9db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-04T12:43:51Z","title_canon_sha256":"195cff264faae73b53f6cb21e2ac36097920583e2f1e36b691cc2f04df512f7c"},"schema_version":"1.0","source":{"id":"1306.0752","kind":"arxiv","version":2}},"canonical_sha256":"44f9dc3db4f586fe93fb13ce9e4f8bc2df723e8e915036c35e3915c0a5ebf1d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44f9dc3db4f586fe93fb13ce9e4f8bc2df723e8e915036c35e3915c0a5ebf1d8","first_computed_at":"2026-05-18T03:21:44.941571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:44.941571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TS9M74xWy+Z48kBrWbF8w4rqKi2p4rWl5J8doYDMDEAgWF1ef0LdhddS2Qu/p8AdEpsCv/vL6DplTKd1nxW3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:44.942192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0752","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa57dcf2395a2ba593d17fbc20f94801a0d3038a3a8014e290f28bc84147787b","sha256:3bb3799ec48ce366bd881e3c79b4a6d5ce673c5a18b948d71ce5e09d096ebae9"],"state_sha256":"fd79e61b463ed4e9b42ab235e3eeb5275dde9533776cc6eb4c5f70ff322e4d11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kB2mYds/nY7wRx4mcTtxs5E+CcDh3qWW1E1+v4PA8I8WYWTNQxXeW/+sPIBGRX/BOhZlNTsipzjfvH0AmTuwBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:26:20.932959Z","bundle_sha256":"d53ffe5a31fc8dc0f5cd903c4b6640a20ddeadfd620b117b1a6770733ccad242"}}