{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JLW2L7YXESQBPPA33CEF26UST5","short_pith_number":"pith:JLW2L7YX","schema_version":"1.0","canonical_sha256":"4aeda5ff1724a017bc1bd8885d7a929f6656a8172acd46ca37bb53ac73033775","source":{"kind":"arxiv","id":"2204.11100","version":2},"attestation_state":"computed","paper":{"title":"Partitioning into degenerate graphs in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Alexandre Talon, Carl Feghali, Daniel Gon\\c{c}alves, H\\'el\\`ene Langlois, Quentin Deschamps, Timoth\\'ee Corsini","submitted_at":"2022-04-23T16:28:42Z","abstract_excerpt":"Let $G$ be a connected graph with maximum degree $\\Delta \\geq 3$ distinct from $K_{\\Delta + 1}$. Generalizing Brooks' Theorem, Borodin, Kostochka and Toft proved that if $p_1, \\dots, p_s$ are non-negative integers such that $p_1 + \\dots + p_s \\geq \\Delta - s$, then $G$ admits a vertex partition into parts $A_1, \\dots, A_s$ such that, for $1 \\leq i \\leq s$, $G[A_i]$ is $p_i$-degenerate. Here we show that such a partition can be performed in linear time. This generalizes previous results that treated subcases of a conjecture of Abu-Khzam, Feghali and Heggernes~\\cite{abu2020partitioning}, which o"},"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":"2204.11100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-04-23T16:28:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"527b47e7aaf0fe0a58a26a0ee387fd4b5833480b07fba334e9e266784cf01354","abstract_canon_sha256":"cad63b99acdbf391408d07e2ddfcfaa831f84e33637016b32944f54e2ac5757a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:53:47.976377Z","signature_b64":"ibj4/TAO0ewW8TsUZyWdlRKU2g41qvGWVov8HaCBO2kXhOZx8GwG6ZOgG6pGDPYQfGKKmRTjaWBcXRJnDnYdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aeda5ff1724a017bc1bd8885d7a929f6656a8172acd46ca37bb53ac73033775","last_reissued_at":"2026-07-05T05:53:47.975637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:53:47.975637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning into degenerate graphs in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Alexandre Talon, Carl Feghali, Daniel Gon\\c{c}alves, H\\'el\\`ene Langlois, Quentin Deschamps, Timoth\\'ee Corsini","submitted_at":"2022-04-23T16:28:42Z","abstract_excerpt":"Let $G$ be a connected graph with maximum degree $\\Delta \\geq 3$ distinct from $K_{\\Delta + 1}$. Generalizing Brooks' Theorem, Borodin, Kostochka and Toft proved that if $p_1, \\dots, p_s$ are non-negative integers such that $p_1 + \\dots + p_s \\geq \\Delta - s$, then $G$ admits a vertex partition into parts $A_1, \\dots, A_s$ such that, for $1 \\leq i \\leq s$, $G[A_i]$ is $p_i$-degenerate. Here we show that such a partition can be performed in linear time. This generalizes previous results that treated subcases of a conjecture of Abu-Khzam, Feghali and Heggernes~\\cite{abu2020partitioning}, which o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.11100","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/2204.11100/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":"2204.11100","created_at":"2026-07-05T05:53:47.975897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.11100v2","created_at":"2026-07-05T05:53:47.975897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.11100","created_at":"2026-07-05T05:53:47.975897+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLW2L7YXESQB","created_at":"2026-07-05T05:53:47.975897+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLW2L7YXESQBPPA3","created_at":"2026-07-05T05:53:47.975897+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLW2L7YX","created_at":"2026-07-05T05:53:47.975897+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/JLW2L7YXESQBPPA33CEF26UST5","json":"https://pith.science/pith/JLW2L7YXESQBPPA33CEF26UST5.json","graph_json":"https://pith.science/api/pith-number/JLW2L7YXESQBPPA33CEF26UST5/graph.json","events_json":"https://pith.science/api/pith-number/JLW2L7YXESQBPPA33CEF26UST5/events.json","paper":"https://pith.science/paper/JLW2L7YX"},"agent_actions":{"view_html":"https://pith.science/pith/JLW2L7YXESQBPPA33CEF26UST5","download_json":"https://pith.science/pith/JLW2L7YXESQBPPA33CEF26UST5.json","view_paper":"https://pith.science/paper/JLW2L7YX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.11100&json=true","fetch_graph":"https://pith.science/api/pith-number/JLW2L7YXESQBPPA33CEF26UST5/graph.json","fetch_events":"https://pith.science/api/pith-number/JLW2L7YXESQBPPA33CEF26UST5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLW2L7YXESQBPPA33CEF26UST5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLW2L7YXESQBPPA33CEF26UST5/action/storage_attestation","attest_author":"https://pith.science/pith/JLW2L7YXESQBPPA33CEF26UST5/action/author_attestation","sign_citation":"https://pith.science/pith/JLW2L7YXESQBPPA33CEF26UST5/action/citation_signature","submit_replication":"https://pith.science/pith/JLW2L7YXESQBPPA33CEF26UST5/action/replication_record"}},"created_at":"2026-07-05T05:53:47.975897+00:00","updated_at":"2026-07-05T05:53:47.975897+00:00"}