{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YY45BW42M6FXBM7QAZ53BWWT7Z","short_pith_number":"pith:YY45BW42","schema_version":"1.0","canonical_sha256":"c639d0db9a678b70b3f0067bb0dad3fe7d882d45be610d9fad5d05b9586d7fb2","source":{"kind":"arxiv","id":"1905.02123","version":1},"attestation_state":"computed","paper":{"title":"Partitioning sparse graphs into an independent set and a graph with bounded size components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fran\\c{c}ois Dross, Ilkyoo Choi, Pascal Ochem","submitted_at":"2019-05-06T16:17:21Z","abstract_excerpt":"We study the problem of partitioning the vertex set of a given graph so that each part induces a graph with components of bounded order; we are also interested in restricting these components to be paths. In particular, we say a graph $G$ admits an $({\\cal I}, {\\cal O}_k)$-partition if its vertex set can be partitioned into an independent set and a set that induces a graph with components of order at most $k$. We prove that every graph $G$ with $\\operatorname{mad}(G)<\\frac 52$ admits an $({\\cal I}, {\\cal O}_3)$-partition. This implies that every planar graph with girth at least $10$ can be par"},"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":"1905.02123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-06T16:17:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"68281a2b82c043941d996fdd516ceab42d4a4a3aedebd65e88b0a1202e533aa1","abstract_canon_sha256":"8a35e51e179ec693b5e0841ae3ebaa79ac9367ab21b841a749d01c2be8ebdcb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:56.297447Z","signature_b64":"bbWjV0i2vxUBllOK02JMVWXM2hbdoaGwQpA0KL6n8z4/32s8FF8/reAgKAoWakTsubq2juHe/WFdp3+2RUujDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c639d0db9a678b70b3f0067bb0dad3fe7d882d45be610d9fad5d05b9586d7fb2","last_reissued_at":"2026-05-17T23:46:56.296848Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:56.296848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning sparse graphs into an independent set and a graph with bounded size components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fran\\c{c}ois Dross, Ilkyoo Choi, Pascal Ochem","submitted_at":"2019-05-06T16:17:21Z","abstract_excerpt":"We study the problem of partitioning the vertex set of a given graph so that each part induces a graph with components of bounded order; we are also interested in restricting these components to be paths. In particular, we say a graph $G$ admits an $({\\cal I}, {\\cal O}_k)$-partition if its vertex set can be partitioned into an independent set and a set that induces a graph with components of order at most $k$. We prove that every graph $G$ with $\\operatorname{mad}(G)<\\frac 52$ admits an $({\\cal I}, {\\cal O}_3)$-partition. This implies that every planar graph with girth at least $10$ can be par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02123","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":"1905.02123","created_at":"2026-05-17T23:46:56.296953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.02123v1","created_at":"2026-05-17T23:46:56.296953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02123","created_at":"2026-05-17T23:46:56.296953+00:00"},{"alias_kind":"pith_short_12","alias_value":"YY45BW42M6FX","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YY45BW42M6FXBM7Q","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YY45BW42","created_at":"2026-05-18T12:33:33.725879+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/YY45BW42M6FXBM7QAZ53BWWT7Z","json":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z.json","graph_json":"https://pith.science/api/pith-number/YY45BW42M6FXBM7QAZ53BWWT7Z/graph.json","events_json":"https://pith.science/api/pith-number/YY45BW42M6FXBM7QAZ53BWWT7Z/events.json","paper":"https://pith.science/paper/YY45BW42"},"agent_actions":{"view_html":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z","download_json":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z.json","view_paper":"https://pith.science/paper/YY45BW42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.02123&json=true","fetch_graph":"https://pith.science/api/pith-number/YY45BW42M6FXBM7QAZ53BWWT7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/YY45BW42M6FXBM7QAZ53BWWT7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/action/storage_attestation","attest_author":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/action/author_attestation","sign_citation":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/action/citation_signature","submit_replication":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/action/replication_record"}},"created_at":"2026-05-17T23:46:56.296953+00:00","updated_at":"2026-05-17T23:46:56.296953+00:00"}