{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NO4HWYIKY4BVORLWGB56R2PAR7","short_pith_number":"pith:NO4HWYIK","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"},"canonical_sha256":"6bb87b610ac703574576307be8e9e08fdca86f5285a0add01c111b34e6dc5454","source":{"kind":"arxiv","id":"1803.04388","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04388","created_at":"2026-07-04T23:52:02Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04388v2","created_at":"2026-07-04T23:52:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04388","created_at":"2026-07-04T23:52:02Z"},{"alias_kind":"pith_short_12","alias_value":"NO4HWYIKY4BV","created_at":"2026-07-04T23:52:02Z"},{"alias_kind":"pith_short_16","alias_value":"NO4HWYIKY4BVORLW","created_at":"2026-07-04T23:52:02Z"},{"alias_kind":"pith_short_8","alias_value":"NO4HWYIK","created_at":"2026-07-04T23:52:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NO4HWYIKY4BVORLWGB56R2PAR7","target":"record","payload":{"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"},"canonical_sha256":"6bb87b610ac703574576307be8e9e08fdca86f5285a0add01c111b34e6dc5454","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"},"source_kind":"arxiv","source_id":"1803.04388","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-07-04T23:52:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JYoXyph9QGYZ5/dOnE7MkRp4as/d02HtheGOJkgYx/Oy09gPnrcf7EITbSlw6+LrUtv1fZ3GEiH8ro6278OBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:46:02.725490Z"},"content_sha256":"78b3c3d546c9cf606a29b2c4a9a485a55a901c7d312880703d4c103e337e1661","schema_version":"1.0","event_id":"sha256:78b3c3d546c9cf606a29b2c4a9a485a55a901c7d312880703d4c103e337e1661"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NO4HWYIKY4BVORLWGB56R2PAR7","target":"graph","payload":{"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"},"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-07-04T23:52:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2eH16UA2YMpZ4f++fSlMNlPS0EGhKDG13pPAs69gHgsNHLrVZguMypBAERsKU4jQ9QR+mLIPbfzskyRirR4+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:46:02.726362Z"},"content_sha256":"7aed1821f1e4f829f3ac2edd871f6af858c4041a554e0b4aeadddeee9e96e35c","schema_version":"1.0","event_id":"sha256:7aed1821f1e4f829f3ac2edd871f6af858c4041a554e0b4aeadddeee9e96e35c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7/bundle.json","state_url":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NO4HWYIKY4BVORLWGB56R2PAR7/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-08-11T11:46:02Z","links":{"resolver":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7","bundle":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7/bundle.json","state":"https://pith.science/pith/NO4HWYIKY4BVORLWGB56R2PAR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NO4HWYIKY4BVORLWGB56R2PAR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NO4HWYIKY4BVORLWGB56R2PAR7","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":"05834ca4de6593a4dadf97ad0536ec0d9cb8877a63da64508633913780842030","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-12T17:29:28Z","title_canon_sha256":"fd1bcb0ce9abf31ea399ddcf7fbf95650a2e1bb0acc350875bb0559ba4078edc"},"schema_version":"1.0","source":{"id":"1803.04388","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04388","created_at":"2026-07-04T23:52:02Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04388v2","created_at":"2026-07-04T23:52:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04388","created_at":"2026-07-04T23:52:02Z"},{"alias_kind":"pith_short_12","alias_value":"NO4HWYIKY4BV","created_at":"2026-07-04T23:52:02Z"},{"alias_kind":"pith_short_16","alias_value":"NO4HWYIKY4BVORLW","created_at":"2026-07-04T23:52:02Z"},{"alias_kind":"pith_short_8","alias_value":"NO4HWYIK","created_at":"2026-07-04T23:52:02Z"}],"graph_snapshots":[{"event_id":"sha256:7aed1821f1e4f829f3ac2edd871f6af858c4041a554e0b4aeadddeee9e96e35c","target":"graph","created_at":"2026-07-04T23:52:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1803.04388/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Carl Feghali, Faisal N. Abu-Khzam, Pinar Heggernes","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-12T17:29:28Z","title":"Partitioning a graph into degenerate subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04388","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:78b3c3d546c9cf606a29b2c4a9a485a55a901c7d312880703d4c103e337e1661","target":"record","created_at":"2026-07-04T23:52:02Z","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":"05834ca4de6593a4dadf97ad0536ec0d9cb8877a63da64508633913780842030","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-12T17:29:28Z","title_canon_sha256":"fd1bcb0ce9abf31ea399ddcf7fbf95650a2e1bb0acc350875bb0559ba4078edc"},"schema_version":"1.0","source":{"id":"1803.04388","kind":"arxiv","version":2}},"canonical_sha256":"6bb87b610ac703574576307be8e9e08fdca86f5285a0add01c111b34e6dc5454","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bb87b610ac703574576307be8e9e08fdca86f5285a0add01c111b34e6dc5454","first_computed_at":"2026-07-04T23:52:02.144880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:02.144880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EexWX818DR6MhLCApSAm1/TB2JrzL2V+2zGxIhwblkr3WdGENT5W1kBxzTAQUEujHBNaEOIy2+ZFCdNjuGh1AA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:02.145254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04388","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78b3c3d546c9cf606a29b2c4a9a485a55a901c7d312880703d4c103e337e1661","sha256:7aed1821f1e4f829f3ac2edd871f6af858c4041a554e0b4aeadddeee9e96e35c"],"state_sha256":"7014744bb055678fd5affdde461796e778daa65987d2399551e79ec2fb25d111"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ry6bJxZiseCSBiFz27xJ3vzc5P0VA8rphYQpDbnIuQwU+4IX7tYZP1xdkGXnNkJzvEFLEIlLYjM82iKsE0XOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T11:46:02.735432Z","bundle_sha256":"fe0fb5417dd643828d8ad149be9736aa23816b7c6a9e141bb1b2f79ef44d2ea5"}}