{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5Q2X5VXB3TMPS35MZL4NRZM2KN","short_pith_number":"pith:5Q2X5VXB","schema_version":"1.0","canonical_sha256":"ec357ed6e1dcd8f96faccaf8d8e59a537a628432c0db2123296be2f0ac2378b8","source":{"kind":"arxiv","id":"1606.04394","version":1},"attestation_state":"computed","paper":{"title":"Partitioning sparse graphs into an independent set and a forest of bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Fran\\c{c}ois Dross, Mickael Montassier","submitted_at":"2016-06-14T14:38:07Z","abstract_excerpt":"An $({\\cal I},{\\cal F}_d)$-partition of a graph is a partition of the vertices of the graph into two sets $I$ and $F$, such that $I$ is an independent set and $F$ induces a forest of maximum degree at most $d$. We show that for all $M<3$ and $d \\ge \\frac{2}{3-M} - 2$, if a graph has maximum average degree less than $M$, then it has an $({\\cal I},{\\cal F}_d)$-partition. Additionally, we prove that for all $\\frac{8}{3} \\le M < 3$ and $d \\ge \\frac{1}{3-M}$, if a graph has maximum average degree less than $M$ then it has an $({\\cal I},{\\cal F}_d)$-partition."},"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":"1606.04394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-14T14:38:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0cfafef8f6178ccb1caf506ba442050d5b496b6bb0756a4c3dd63e80530f0ed0","abstract_canon_sha256":"f6c9bad0eaa2dffb7d27f6f6a395b64a76d0edf046fb412d4feca1d1cfab4008"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:25.657785Z","signature_b64":"LjL1M6AvwzA8q9gtoaVLJlR3t+RVrGm8A2GbLSs2g2AOggsmelrknsJwM8zoDexmivx8ouBqNhv+re4951lUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec357ed6e1dcd8f96faccaf8d8e59a537a628432c0db2123296be2f0ac2378b8","last_reissued_at":"2026-05-18T01:12:25.657400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:25.657400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning sparse graphs into an independent set and a forest of bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Fran\\c{c}ois Dross, Mickael Montassier","submitted_at":"2016-06-14T14:38:07Z","abstract_excerpt":"An $({\\cal I},{\\cal F}_d)$-partition of a graph is a partition of the vertices of the graph into two sets $I$ and $F$, such that $I$ is an independent set and $F$ induces a forest of maximum degree at most $d$. We show that for all $M<3$ and $d \\ge \\frac{2}{3-M} - 2$, if a graph has maximum average degree less than $M$, then it has an $({\\cal I},{\\cal F}_d)$-partition. Additionally, we prove that for all $\\frac{8}{3} \\le M < 3$ and $d \\ge \\frac{1}{3-M}$, if a graph has maximum average degree less than $M$ then it has an $({\\cal I},{\\cal F}_d)$-partition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04394","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":"1606.04394","created_at":"2026-05-18T01:12:25.657462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04394v1","created_at":"2026-05-18T01:12:25.657462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04394","created_at":"2026-05-18T01:12:25.657462+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Q2X5VXB3TMP","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Q2X5VXB3TMPS35M","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Q2X5VXB","created_at":"2026-05-18T12:30:01.593930+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/5Q2X5VXB3TMPS35MZL4NRZM2KN","json":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN.json","graph_json":"https://pith.science/api/pith-number/5Q2X5VXB3TMPS35MZL4NRZM2KN/graph.json","events_json":"https://pith.science/api/pith-number/5Q2X5VXB3TMPS35MZL4NRZM2KN/events.json","paper":"https://pith.science/paper/5Q2X5VXB"},"agent_actions":{"view_html":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN","download_json":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN.json","view_paper":"https://pith.science/paper/5Q2X5VXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04394&json=true","fetch_graph":"https://pith.science/api/pith-number/5Q2X5VXB3TMPS35MZL4NRZM2KN/graph.json","fetch_events":"https://pith.science/api/pith-number/5Q2X5VXB3TMPS35MZL4NRZM2KN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/action/storage_attestation","attest_author":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/action/author_attestation","sign_citation":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/action/citation_signature","submit_replication":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/action/replication_record"}},"created_at":"2026-05-18T01:12:25.657462+00:00","updated_at":"2026-05-18T01:12:25.657462+00:00"}