{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SDAZ4NMVMMELGEGC7JBSQRII5V","short_pith_number":"pith:SDAZ4NMV","schema_version":"1.0","canonical_sha256":"90c19e35956308b310c2fa43284508ed4aceff220b03cc94a4f3cc29df420aab","source":{"kind":"arxiv","id":"1407.5236","version":3},"attestation_state":"computed","paper":{"title":"A relative of Hadwiger's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Yeap Kang, Jaehoon Kim, Katherine Edwards, Paul Seymour, Sang-il Oum","submitted_at":"2014-07-20T02:36:59Z","abstract_excerpt":"Hadwiger's conjecture asserts that if a simple graph $G$ has no $K_{t+1}$ minor, then its vertex set $V(G)$ can be partitioned into $t$ stable sets. This is still open, but we prove under the same hypotheses that $V(G)$ can be partitioned into $t$ sets $X_1,\\ldots, X_t$, such that for $1\\le i\\le t$, the subgraph induced on $X_i$ has maximum degree at most a function of $t$. This is sharp, in that the conclusion becomes false if we ask for a partition into $t-1$ sets with the same property."},"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":"1407.5236","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-20T02:36:59Z","cross_cats_sorted":[],"title_canon_sha256":"0718d5d3a3b8d8c1b0e7c0383546a5b4c0f8fd3e4496e7260fc97af861532254","abstract_canon_sha256":"f3f4cd01cf810659a89f05f238377af392f56cfdc0e671e843a03ac874354c97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:50.927444Z","signature_b64":"O99ArqqYwdRcAkqkKeCU2kCDjOnlThLfkf245XDLUYkFCMWToZFMBd/teUho/WQooIw3sxrRwSFdJcNiAyD9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90c19e35956308b310c2fa43284508ed4aceff220b03cc94a4f3cc29df420aab","last_reissued_at":"2026-05-18T01:23:50.926869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:50.926869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A relative of Hadwiger's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Yeap Kang, Jaehoon Kim, Katherine Edwards, Paul Seymour, Sang-il Oum","submitted_at":"2014-07-20T02:36:59Z","abstract_excerpt":"Hadwiger's conjecture asserts that if a simple graph $G$ has no $K_{t+1}$ minor, then its vertex set $V(G)$ can be partitioned into $t$ stable sets. This is still open, but we prove under the same hypotheses that $V(G)$ can be partitioned into $t$ sets $X_1,\\ldots, X_t$, such that for $1\\le i\\le t$, the subgraph induced on $X_i$ has maximum degree at most a function of $t$. This is sharp, in that the conclusion becomes false if we ask for a partition into $t-1$ sets with the same property."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5236","kind":"arxiv","version":3},"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":"1407.5236","created_at":"2026-05-18T01:23:50.926971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5236v3","created_at":"2026-05-18T01:23:50.926971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5236","created_at":"2026-05-18T01:23:50.926971+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDAZ4NMVMMEL","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDAZ4NMVMMELGEGC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDAZ4NMV","created_at":"2026-05-18T12:28:49.207871+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/SDAZ4NMVMMELGEGC7JBSQRII5V","json":"https://pith.science/pith/SDAZ4NMVMMELGEGC7JBSQRII5V.json","graph_json":"https://pith.science/api/pith-number/SDAZ4NMVMMELGEGC7JBSQRII5V/graph.json","events_json":"https://pith.science/api/pith-number/SDAZ4NMVMMELGEGC7JBSQRII5V/events.json","paper":"https://pith.science/paper/SDAZ4NMV"},"agent_actions":{"view_html":"https://pith.science/pith/SDAZ4NMVMMELGEGC7JBSQRII5V","download_json":"https://pith.science/pith/SDAZ4NMVMMELGEGC7JBSQRII5V.json","view_paper":"https://pith.science/paper/SDAZ4NMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5236&json=true","fetch_graph":"https://pith.science/api/pith-number/SDAZ4NMVMMELGEGC7JBSQRII5V/graph.json","fetch_events":"https://pith.science/api/pith-number/SDAZ4NMVMMELGEGC7JBSQRII5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDAZ4NMVMMELGEGC7JBSQRII5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDAZ4NMVMMELGEGC7JBSQRII5V/action/storage_attestation","attest_author":"https://pith.science/pith/SDAZ4NMVMMELGEGC7JBSQRII5V/action/author_attestation","sign_citation":"https://pith.science/pith/SDAZ4NMVMMELGEGC7JBSQRII5V/action/citation_signature","submit_replication":"https://pith.science/pith/SDAZ4NMVMMELGEGC7JBSQRII5V/action/replication_record"}},"created_at":"2026-05-18T01:23:50.926971+00:00","updated_at":"2026-05-18T01:23:50.926971+00:00"}