{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NO4HWYIKY4BVORLWGB56R2PAR7","short_pith_number":"pith:NO4HWYIK","schema_version":"1.0","canonical_sha256":"6bb87b610ac703574576307be8e9e08fdca86f5285a0add01c111b34e6dc5454","source":{"kind":"arxiv","id":"1803.04388","version":2},"attestation_state":"computed","paper":{"title":"Partitioning a graph into degenerate subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Carl Feghali, Faisal N. Abu-Khzam, Pinar Heggernes","submitted_at":"2018-03-12T17:29:28Z","abstract_excerpt":"Let $G = (V, E)$ be a connected graph with maximum degree $k\\geq 3$ distinct from $K_{k+1}$. Given integers $s \\geq 2$ and $p_1,\\ldots,p_s\\geq 0$, $G$ is said to be $(p_1, \\dots, p_s)$-partitionable if there exists a partition of $V$ into sets~$V_1,\\ldots,V_s$ such that $G[V_i]$ is $p_i$-degenerate for $i\\in\\{1,\\ldots,s\\}$. In this paper, we prove that we can find a $(p_1, \\dots, p_s)$-partition of $G$ in $O(|V| + |E|)$-time whenever $1\\geq p_1, \\dots, p_s \\geq 0$ and $p_1 + \\dots + p_s \\geq k - s$. This generalizes a result of Bonamy et al. (MFCS, 2017) and can be viewed as an algorithmic ext"},"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":"1803.04388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-12T17:29:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fd1bcb0ce9abf31ea399ddcf7fbf95650a2e1bb0acc350875bb0559ba4078edc","abstract_canon_sha256":"05834ca4de6593a4dadf97ad0536ec0d9cb8877a63da64508633913780842030"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:02.145254Z","signature_b64":"EexWX818DR6MhLCApSAm1/TB2JrzL2V+2zGxIhwblkr3WdGENT5W1kBxzTAQUEujHBNaEOIy2+ZFCdNjuGh1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bb87b610ac703574576307be8e9e08fdca86f5285a0add01c111b34e6dc5454","last_reissued_at":"2026-07-04T23:52:02.144880Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:02.144880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning a graph into degenerate subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Carl Feghali, Faisal N. Abu-Khzam, Pinar Heggernes","submitted_at":"2018-03-12T17:29:28Z","abstract_excerpt":"Let $G = (V, E)$ be a connected graph with maximum degree $k\\geq 3$ distinct from $K_{k+1}$. Given integers $s \\geq 2$ and $p_1,\\ldots,p_s\\geq 0$, $G$ is said to be $(p_1, \\dots, p_s)$-partitionable if there exists a partition of $V$ into sets~$V_1,\\ldots,V_s$ such that $G[V_i]$ is $p_i$-degenerate for $i\\in\\{1,\\ldots,s\\}$. In this paper, we prove that we can find a $(p_1, \\dots, p_s)$-partition of $G$ in $O(|V| + |E|)$-time whenever $1\\geq p_1, \\dots, p_s \\geq 0$ and $p_1 + \\dots + p_s \\geq k - s$. This generalizes a result of Bonamy et al. (MFCS, 2017) and can be viewed as an algorithmic ext"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04388","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1803.04388/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1803.04388","created_at":"2026-07-04T23:52:02.144936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04388v2","created_at":"2026-07-04T23:52:02.144936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04388","created_at":"2026-07-04T23:52:02.144936+00:00"},{"alias_kind":"pith_short_12","alias_value":"NO4HWYIKY4BV","created_at":"2026-07-04T23:52:02.144936+00:00"},{"alias_kind":"pith_short_16","alias_value":"NO4HWYIKY4BVORLW","created_at":"2026-07-04T23:52:02.144936+00:00"},{"alias_kind":"pith_short_8","alias_value":"NO4HWYIK","created_at":"2026-07-04T23:52:02.144936+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/NO4HWYIKY4BVORLWGB56R2PAR7","json":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7.json","graph_json":"https://pith.science/api/pith-number/NO4HWYIKY4BVORLWGB56R2PAR7/graph.json","events_json":"https://pith.science/api/pith-number/NO4HWYIKY4BVORLWGB56R2PAR7/events.json","paper":"https://pith.science/paper/NO4HWYIK"},"agent_actions":{"view_html":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7","download_json":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7.json","view_paper":"https://pith.science/paper/NO4HWYIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04388&json=true","fetch_graph":"https://pith.science/api/pith-number/NO4HWYIKY4BVORLWGB56R2PAR7/graph.json","fetch_events":"https://pith.science/api/pith-number/NO4HWYIKY4BVORLWGB56R2PAR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7/action/storage_attestation","attest_author":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7/action/author_attestation","sign_citation":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7/action/citation_signature","submit_replication":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7/action/replication_record"}},"created_at":"2026-07-04T23:52:02.144936+00:00","updated_at":"2026-07-04T23:52:02.144936+00:00"}