{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DPKGDW2PPSNPXKA2RLVKGKTNBJ","short_pith_number":"pith:DPKGDW2P","schema_version":"1.0","canonical_sha256":"1bd461db4f7c9afba81a8aeaa32a6d0a497872ea4c97a5f6ab398ec5faf129a6","source":{"kind":"arxiv","id":"1801.03879","version":1},"attestation_state":"computed","paper":{"title":"Parameterized (Approximate) Defective Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Michael Lampis, R\\'emy Belmonte, Valia Mitsou","submitted_at":"2018-01-11T17:13:11Z","abstract_excerpt":"In Defective Coloring we are given a graph $G = (V, E)$ and two integers $\\chi_d, \\Delta^*$ and are asked if we can partition $V$ into $\\chi_d$ color classes, so that each class induces a graph of maximum degree $\\Delta^*$. We investigate the complexity of this generalization of Coloring with respect to several well-studied graph parameters, and show that the problem is W-hard parameterized by treewidth, pathwidth, tree-depth, or feedback vertex set, if $\\chi_d = 2$. As expected, this hardness can be extended to larger values of $\\chi_d$ for most of these parameters, with one surprising except"},"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.03879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-11T17:13:11Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"99021225afa6d40c502baaccf78b9a3816835b0d5acd43eab597ec0d67884f42","abstract_canon_sha256":"2fd90febb31c4ef2d741183934be1f0888fb81236911bc686dbe9918bf205d3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:13.310716Z","signature_b64":"XbcaR1NYbG7rHchg92rZnbW6f5que23rZuKbOYm7LLKFxpojWZkYz/asel6FW0sydxEotyrw0l6vyjqcRig/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bd461db4f7c9afba81a8aeaa32a6d0a497872ea4c97a5f6ab398ec5faf129a6","last_reissued_at":"2026-05-18T00:26:13.310238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:13.310238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized (Approximate) Defective Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Michael Lampis, R\\'emy Belmonte, Valia Mitsou","submitted_at":"2018-01-11T17:13:11Z","abstract_excerpt":"In Defective Coloring we are given a graph $G = (V, E)$ and two integers $\\chi_d, \\Delta^*$ and are asked if we can partition $V$ into $\\chi_d$ color classes, so that each class induces a graph of maximum degree $\\Delta^*$. We investigate the complexity of this generalization of Coloring with respect to several well-studied graph parameters, and show that the problem is W-hard parameterized by treewidth, pathwidth, tree-depth, or feedback vertex set, if $\\chi_d = 2$. As expected, this hardness can be extended to larger values of $\\chi_d$ for most of these parameters, with one surprising except"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03879","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.03879","created_at":"2026-05-18T00:26:13.310320+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03879v1","created_at":"2026-05-18T00:26:13.310320+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03879","created_at":"2026-05-18T00:26:13.310320+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPKGDW2PPSNP","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPKGDW2PPSNPXKA2","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPKGDW2P","created_at":"2026-05-18T12:32:19.392346+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/DPKGDW2PPSNPXKA2RLVKGKTNBJ","json":"https://pith.science/pith/DPKGDW2PPSNPXKA2RLVKGKTNBJ.json","graph_json":"https://pith.science/api/pith-number/DPKGDW2PPSNPXKA2RLVKGKTNBJ/graph.json","events_json":"https://pith.science/api/pith-number/DPKGDW2PPSNPXKA2RLVKGKTNBJ/events.json","paper":"https://pith.science/paper/DPKGDW2P"},"agent_actions":{"view_html":"https://pith.science/pith/DPKGDW2PPSNPXKA2RLVKGKTNBJ","download_json":"https://pith.science/pith/DPKGDW2PPSNPXKA2RLVKGKTNBJ.json","view_paper":"https://pith.science/paper/DPKGDW2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03879&json=true","fetch_graph":"https://pith.science/api/pith-number/DPKGDW2PPSNPXKA2RLVKGKTNBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DPKGDW2PPSNPXKA2RLVKGKTNBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPKGDW2PPSNPXKA2RLVKGKTNBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPKGDW2PPSNPXKA2RLVKGKTNBJ/action/storage_attestation","attest_author":"https://pith.science/pith/DPKGDW2PPSNPXKA2RLVKGKTNBJ/action/author_attestation","sign_citation":"https://pith.science/pith/DPKGDW2PPSNPXKA2RLVKGKTNBJ/action/citation_signature","submit_replication":"https://pith.science/pith/DPKGDW2PPSNPXKA2RLVKGKTNBJ/action/replication_record"}},"created_at":"2026-05-18T00:26:13.310320+00:00","updated_at":"2026-05-18T00:26:13.310320+00:00"}