{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LFUWJB6434TRTSNYWPJZP4Z3GO","short_pith_number":"pith:LFUWJB64","canonical_record":{"source":{"id":"1503.08371","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-29T00:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"32413192887366a49bec4e64962ba46a4212be68b1dabd618a7cfa4b0fd86462","abstract_canon_sha256":"ac2c86d554c187f5f6fb05d85893dec8b794853a9fae4e25010c567733fd6db2"},"schema_version":"1.0"},"canonical_sha256":"59696487dcdf2719c9b8b3d397f33b33910930f6f2a5c95d3eab318daf9367bd","source":{"kind":"arxiv","id":"1503.08371","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08371","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08371v4","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08371","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"LFUWJB6434TR","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFUWJB6434TRTSNY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFUWJB64","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LFUWJB6434TRTSNYWPJZP4Z3GO","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08371","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-29T00:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"32413192887366a49bec4e64962ba46a4212be68b1dabd618a7cfa4b0fd86462","abstract_canon_sha256":"ac2c86d554c187f5f6fb05d85893dec8b794853a9fae4e25010c567733fd6db2"},"schema_version":"1.0"},"canonical_sha256":"59696487dcdf2719c9b8b3d397f33b33910930f6f2a5c95d3eab318daf9367bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:03.396577Z","signature_b64":"vAoXi3LC3jmdT+zxfFT8gwhnQ/no/iXSjIzf3L9Jme1dXlFMFdzm6rHXOvcl7qL5G9rz/MAHYSuYnx55QmBHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59696487dcdf2719c9b8b3d397f33b33910930f6f2a5c95d3eab318daf9367bd","last_reissued_at":"2026-05-18T00:16:03.396203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:03.396203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08371","source_version":4,"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-18T00:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WFvcw0RsEZGb2uXyutcUSKjXnK6EQY+p+aMCdi4x9JuBAz6Anf/84u4pO9C+2QlAs2CU5qUHGr1iPYjXrQFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:50:40.652122Z"},"content_sha256":"9ec558fa8d864c4364b8b66a15f0b2f164442280da833d1a195b92587cc2d176","schema_version":"1.0","event_id":"sha256:9ec558fa8d864c4364b8b66a15f0b2f164442280da833d1a195b92587cc2d176"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LFUWJB6434TRTSNYWPJZP4Z3GO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning $H$-minor free graphs into three subgraphs with no large components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, Sang-il Oum","submitted_at":"2015-03-29T00:22:18Z","abstract_excerpt":"We prove that for every graph $H$, if a graph $G$ has no (odd) $H$ minor, then its vertex set $V(G)$ can be partitioned into three sets $X_1$, $X_2$, $X_3$ such that for each~$i$, the subgraph induced on $X_i$ has no component of size larger than a function of~$H$ and the maximum degree of~$G$. This improves a previous result of Alon, Ding, Oporowski and Vertigan~(2003) stating that $V(G)$ can be partitioned into four such sets if $G$ has no $H$ minor. Our theorem generalizes a result of Esperet and Joret~(2014), who proved it for graphs embeddable on a fixed surface and asked whether it is tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08371","kind":"arxiv","version":4},"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-18T00:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULSeFwXqUv7tip2uGYrzBpfZVWD/JkCb5x5yWhj4D6FC+ECOXlzoSVzhzclx0S5yniznLQhdrMGicb1gmDYrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:50:40.652839Z"},"content_sha256":"896c652945aee37901538896a8275c6b4b79fb39aa4243a37c91c1d4608edb27","schema_version":"1.0","event_id":"sha256:896c652945aee37901538896a8275c6b4b79fb39aa4243a37c91c1d4608edb27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/bundle.json","state_url":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/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-06-11T00:50:40Z","links":{"resolver":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO","bundle":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/bundle.json","state":"https://pith.science/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFUWJB6434TRTSNYWPJZP4Z3GO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LFUWJB6434TRTSNYWPJZP4Z3GO","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":"ac2c86d554c187f5f6fb05d85893dec8b794853a9fae4e25010c567733fd6db2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-29T00:22:18Z","title_canon_sha256":"32413192887366a49bec4e64962ba46a4212be68b1dabd618a7cfa4b0fd86462"},"schema_version":"1.0","source":{"id":"1503.08371","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08371","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08371v4","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08371","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"LFUWJB6434TR","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFUWJB6434TRTSNY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFUWJB64","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:896c652945aee37901538896a8275c6b4b79fb39aa4243a37c91c1d4608edb27","target":"graph","created_at":"2026-05-18T00:16:03Z","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 prove that for every graph $H$, if a graph $G$ has no (odd) $H$ minor, then its vertex set $V(G)$ can be partitioned into three sets $X_1$, $X_2$, $X_3$ such that for each~$i$, the subgraph induced on $X_i$ has no component of size larger than a function of~$H$ and the maximum degree of~$G$. This improves a previous result of Alon, Ding, Oporowski and Vertigan~(2003) stating that $V(G)$ can be partitioned into four such sets if $G$ has no $H$ minor. Our theorem generalizes a result of Esperet and Joret~(2014), who proved it for graphs embeddable on a fixed surface and asked whether it is tr","authors_text":"Chun-Hung Liu, Sang-il Oum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-29T00:22:18Z","title":"Partitioning $H$-minor free graphs into three subgraphs with no large components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08371","kind":"arxiv","version":4},"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:9ec558fa8d864c4364b8b66a15f0b2f164442280da833d1a195b92587cc2d176","target":"record","created_at":"2026-05-18T00:16:03Z","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":"ac2c86d554c187f5f6fb05d85893dec8b794853a9fae4e25010c567733fd6db2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-29T00:22:18Z","title_canon_sha256":"32413192887366a49bec4e64962ba46a4212be68b1dabd618a7cfa4b0fd86462"},"schema_version":"1.0","source":{"id":"1503.08371","kind":"arxiv","version":4}},"canonical_sha256":"59696487dcdf2719c9b8b3d397f33b33910930f6f2a5c95d3eab318daf9367bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59696487dcdf2719c9b8b3d397f33b33910930f6f2a5c95d3eab318daf9367bd","first_computed_at":"2026-05-18T00:16:03.396203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:03.396203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vAoXi3LC3jmdT+zxfFT8gwhnQ/no/iXSjIzf3L9Jme1dXlFMFdzm6rHXOvcl7qL5G9rz/MAHYSuYnx55QmBHDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:03.396577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08371","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ec558fa8d864c4364b8b66a15f0b2f164442280da833d1a195b92587cc2d176","sha256:896c652945aee37901538896a8275c6b4b79fb39aa4243a37c91c1d4608edb27"],"state_sha256":"6b94f13d5a991f308c3c0ce0ddea25938b7754567e107419e8caf91a5c5b25eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4aw+QaLZvJ6zq36yjBkEVzMqn57eEYfrgrklAbvOqRfInm2H0v5+Vt/MROsB58ac2MYC8zxpfKCfarukNsLMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:50:40.657189Z","bundle_sha256":"ebddfbb6f8e566f2618663f30f383682972501e691046cd1fb28135a04d29331"}}