{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TMDF76VQ7UGXTLIJH3NKIQT2NB","short_pith_number":"pith:TMDF76VQ","schema_version":"1.0","canonical_sha256":"9b065ffab0fd0d79ad093edaa4427a684bba14dee9a959d1f8f383b5483ed8ff","source":{"kind":"arxiv","id":"1912.07647","version":1},"attestation_state":"computed","paper":{"title":"A new upper bound on the chromatic number of graphs with no odd $K_t$ minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Norin, Zi-Xia Song","submitted_at":"2019-12-16T19:27:28Z","abstract_excerpt":"Gerards and Seymour conjectured that every graph with no odd $K_t$ minor is $(t-1)$-colorable. This is a strengthening of the famous Hadwiger's Conjecture. Geelen et al. proved that every graph with no odd $K_t$ minor is $O(t\\sqrt{\\log t})$-colorable. Using the methods the present authors and Postle recently developed for coloring graphs with no $K_t$ minor, we make the first improvement on this bound by showing that every graph with no odd $K_t$ minor is $O(t(\\log t)^{\\beta})$-colorable for every $\\beta > 1/4$."},"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":"1912.07647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-16T19:27:28Z","cross_cats_sorted":[],"title_canon_sha256":"aee7487758a970a273ef120a80e54c3010e08b48d10a1b54e82f1c34b48e41c2","abstract_canon_sha256":"6aa152bc60b57c410a19ae3e3b9effbbd95ed88fb45765e2b1f3c562e24f6901"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:24.704539Z","signature_b64":"79SSb/8t9ipbb0NX/cQkYsLfhbpKGAJsF9us7C6FsT6/tlnSIwPEBUbeUBm61sLNjUcL3Cs0rLy6bUwBndkTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b065ffab0fd0d79ad093edaa4427a684bba14dee9a959d1f8f383b5483ed8ff","last_reissued_at":"2026-07-05T00:26:24.704134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:24.704134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new upper bound on the chromatic number of graphs with no odd $K_t$ minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Norin, Zi-Xia Song","submitted_at":"2019-12-16T19:27:28Z","abstract_excerpt":"Gerards and Seymour conjectured that every graph with no odd $K_t$ minor is $(t-1)$-colorable. This is a strengthening of the famous Hadwiger's Conjecture. Geelen et al. proved that every graph with no odd $K_t$ minor is $O(t\\sqrt{\\log t})$-colorable. Using the methods the present authors and Postle recently developed for coloring graphs with no $K_t$ minor, we make the first improvement on this bound by showing that every graph with no odd $K_t$ minor is $O(t(\\log t)^{\\beta})$-colorable for every $\\beta > 1/4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.07647","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.07647/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.07647","created_at":"2026-07-05T00:26:24.704190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.07647v1","created_at":"2026-07-05T00:26:24.704190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.07647","created_at":"2026-07-05T00:26:24.704190+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMDF76VQ7UGX","created_at":"2026-07-05T00:26:24.704190+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMDF76VQ7UGXTLIJ","created_at":"2026-07-05T00:26:24.704190+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMDF76VQ","created_at":"2026-07-05T00:26:24.704190+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/TMDF76VQ7UGXTLIJH3NKIQT2NB","json":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB.json","graph_json":"https://pith.science/api/pith-number/TMDF76VQ7UGXTLIJH3NKIQT2NB/graph.json","events_json":"https://pith.science/api/pith-number/TMDF76VQ7UGXTLIJH3NKIQT2NB/events.json","paper":"https://pith.science/paper/TMDF76VQ"},"agent_actions":{"view_html":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB","download_json":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB.json","view_paper":"https://pith.science/paper/TMDF76VQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.07647&json=true","fetch_graph":"https://pith.science/api/pith-number/TMDF76VQ7UGXTLIJH3NKIQT2NB/graph.json","fetch_events":"https://pith.science/api/pith-number/TMDF76VQ7UGXTLIJH3NKIQT2NB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/action/storage_attestation","attest_author":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/action/author_attestation","sign_citation":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/action/citation_signature","submit_replication":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/action/replication_record"}},"created_at":"2026-07-05T00:26:24.704190+00:00","updated_at":"2026-07-05T00:26:24.704190+00:00"}