{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YY45BW42M6FXBM7QAZ53BWWT7Z","short_pith_number":"pith:YY45BW42","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"},"canonical_sha256":"c639d0db9a678b70b3f0067bb0dad3fe7d882d45be610d9fad5d05b9586d7fb2","source":{"kind":"arxiv","id":"1905.02123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02123","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02123v1","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02123","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"YY45BW42M6FX","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YY45BW42M6FXBM7Q","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YY45BW42","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YY45BW42M6FXBM7QAZ53BWWT7Z","target":"record","payload":{"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"},"canonical_sha256":"c639d0db9a678b70b3f0067bb0dad3fe7d882d45be610d9fad5d05b9586d7fb2","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"},"source_kind":"arxiv","source_id":"1905.02123","source_version":1,"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-05-17T23:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RZkJUOAZqOHkNsGO+9AAyQgklevbLIj7UMlzzdk6geA8D86RrMOJePdgekCoLkFUD8pSuhuxf57LfuAqHQtcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:45:28.901601Z"},"content_sha256":"e99ace95888aa4c8ebe83dd852d4d233d87fd0663060cc2e0cf0ed9df4f3af52","schema_version":"1.0","event_id":"sha256:e99ace95888aa4c8ebe83dd852d4d233d87fd0663060cc2e0cf0ed9df4f3af52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YY45BW42M6FXBM7QAZ53BWWT7Z","target":"graph","payload":{"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"},"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-05-17T23:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DC+QCY+bNzytY4wmYVVdzgnLeqFue2QsO02hKYRz7ckMkYZbTQuxoyz8u5Mg+0GZRCZsUFpMoNsopOvxmAnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:45:28.901947Z"},"content_sha256":"9d037544b32a1503759711eb270f418a81eeecf72c7a919c2bc5ab30f8c984ce","schema_version":"1.0","event_id":"sha256:9d037544b32a1503759711eb270f418a81eeecf72c7a919c2bc5ab30f8c984ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/bundle.json","state_url":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/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-05-27T12:45:28Z","links":{"resolver":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z","bundle":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/bundle.json","state":"https://pith.science/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YY45BW42M6FXBM7QAZ53BWWT7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YY45BW42M6FXBM7QAZ53BWWT7Z","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":"8a35e51e179ec693b5e0841ae3ebaa79ac9367ab21b841a749d01c2be8ebdcb6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-06T16:17:21Z","title_canon_sha256":"68281a2b82c043941d996fdd516ceab42d4a4a3aedebd65e88b0a1202e533aa1"},"schema_version":"1.0","source":{"id":"1905.02123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02123","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02123v1","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02123","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"YY45BW42M6FX","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YY45BW42M6FXBM7Q","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YY45BW42","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:9d037544b32a1503759711eb270f418a81eeecf72c7a919c2bc5ab30f8c984ce","target":"graph","created_at":"2026-05-17T23:46:56Z","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"},"paper":{"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","authors_text":"Fran\\c{c}ois Dross, Ilkyoo Choi, Pascal Ochem","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-06T16:17:21Z","title":"Partitioning sparse graphs into an independent set and a graph with bounded size components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02123","kind":"arxiv","version":1},"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:e99ace95888aa4c8ebe83dd852d4d233d87fd0663060cc2e0cf0ed9df4f3af52","target":"record","created_at":"2026-05-17T23:46:56Z","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":"8a35e51e179ec693b5e0841ae3ebaa79ac9367ab21b841a749d01c2be8ebdcb6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-06T16:17:21Z","title_canon_sha256":"68281a2b82c043941d996fdd516ceab42d4a4a3aedebd65e88b0a1202e533aa1"},"schema_version":"1.0","source":{"id":"1905.02123","kind":"arxiv","version":1}},"canonical_sha256":"c639d0db9a678b70b3f0067bb0dad3fe7d882d45be610d9fad5d05b9586d7fb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c639d0db9a678b70b3f0067bb0dad3fe7d882d45be610d9fad5d05b9586d7fb2","first_computed_at":"2026-05-17T23:46:56.296848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:56.296848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bbWjV0i2vxUBllOK02JMVWXM2hbdoaGwQpA0KL6n8z4/32s8FF8/reAgKAoWakTsubq2juHe/WFdp3+2RUujDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:56.297447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e99ace95888aa4c8ebe83dd852d4d233d87fd0663060cc2e0cf0ed9df4f3af52","sha256:9d037544b32a1503759711eb270f418a81eeecf72c7a919c2bc5ab30f8c984ce"],"state_sha256":"fe1939063052844cef2ddda015bab4241b2e4ba21b0c6692669254d00814be94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Az1wlkfOKE9oSns90TSgTFwYVV+DZP0hVmwbfO9Z8z8ShMQyjGa8zII4OGS5gKHu1CiRHG9+LQk4GWCTXulxAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:45:28.904120Z","bundle_sha256":"864e8fb2bb0453d55ff7bee7777c7a08b18aa66bd664c8993ddd823cbae85557"}}