{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TMDF76VQ7UGXTLIJH3NKIQT2NB","short_pith_number":"pith:TMDF76VQ","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"},"canonical_sha256":"9b065ffab0fd0d79ad093edaa4427a684bba14dee9a959d1f8f383b5483ed8ff","source":{"kind":"arxiv","id":"1912.07647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.07647","created_at":"2026-07-05T00:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1912.07647v1","created_at":"2026-07-05T00:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.07647","created_at":"2026-07-05T00:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"TMDF76VQ7UGX","created_at":"2026-07-05T00:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"TMDF76VQ7UGXTLIJ","created_at":"2026-07-05T00:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"TMDF76VQ","created_at":"2026-07-05T00:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TMDF76VQ7UGXTLIJH3NKIQT2NB","target":"record","payload":{"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"},"canonical_sha256":"9b065ffab0fd0d79ad093edaa4427a684bba14dee9a959d1f8f383b5483ed8ff","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"},"source_kind":"arxiv","source_id":"1912.07647","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-07-05T00:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLbEMPsEQNXawxauBH2NoMG1xl4RfY3hqWd/+yT9WZONfbgl1t00GWNUUYjaFyNU8pywyeUI1mj0dINs7qGcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:01:05.996746Z"},"content_sha256":"8738686146b9b68ba1e96473bd1ba02dad95c4970537b80434e5c76110bd0f2b","schema_version":"1.0","event_id":"sha256:8738686146b9b68ba1e96473bd1ba02dad95c4970537b80434e5c76110bd0f2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TMDF76VQ7UGXTLIJH3NKIQT2NB","target":"graph","payload":{"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"},"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-07-05T00:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jiw/g4aae48xbIkgs+EQR8Ys7sLQ0ymur+ASVjxR84PSklpc/Z2wjhIuXjSH0T8JA+CDPQ4O61HoufGDi1ASAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:01:05.997621Z"},"content_sha256":"e6745ecee467922e2b77cdcab7ea861681629a8432b79ae797e3ba9994182ee4","schema_version":"1.0","event_id":"sha256:e6745ecee467922e2b77cdcab7ea861681629a8432b79ae797e3ba9994182ee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/bundle.json","state_url":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/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-08-14T11:01:06Z","links":{"resolver":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB","bundle":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/bundle.json","state":"https://pith.science/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMDF76VQ7UGXTLIJH3NKIQT2NB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TMDF76VQ7UGXTLIJH3NKIQT2NB","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":"6aa152bc60b57c410a19ae3e3b9effbbd95ed88fb45765e2b1f3c562e24f6901","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-16T19:27:28Z","title_canon_sha256":"aee7487758a970a273ef120a80e54c3010e08b48d10a1b54e82f1c34b48e41c2"},"schema_version":"1.0","source":{"id":"1912.07647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.07647","created_at":"2026-07-05T00:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1912.07647v1","created_at":"2026-07-05T00:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.07647","created_at":"2026-07-05T00:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"TMDF76VQ7UGX","created_at":"2026-07-05T00:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"TMDF76VQ7UGXTLIJ","created_at":"2026-07-05T00:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"TMDF76VQ","created_at":"2026-07-05T00:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:e6745ecee467922e2b77cdcab7ea861681629a8432b79ae797e3ba9994182ee4","target":"graph","created_at":"2026-07-05T00:26:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.07647/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Sergey Norin, Zi-Xia Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-16T19:27:28Z","title":"A new upper bound on the chromatic number of graphs with no odd $K_t$ minor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.07647","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:8738686146b9b68ba1e96473bd1ba02dad95c4970537b80434e5c76110bd0f2b","target":"record","created_at":"2026-07-05T00:26:24Z","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":"6aa152bc60b57c410a19ae3e3b9effbbd95ed88fb45765e2b1f3c562e24f6901","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-16T19:27:28Z","title_canon_sha256":"aee7487758a970a273ef120a80e54c3010e08b48d10a1b54e82f1c34b48e41c2"},"schema_version":"1.0","source":{"id":"1912.07647","kind":"arxiv","version":1}},"canonical_sha256":"9b065ffab0fd0d79ad093edaa4427a684bba14dee9a959d1f8f383b5483ed8ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b065ffab0fd0d79ad093edaa4427a684bba14dee9a959d1f8f383b5483ed8ff","first_computed_at":"2026-07-05T00:26:24.704134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:26:24.704134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"79SSb/8t9ipbb0NX/cQkYsLfhbpKGAJsF9us7C6FsT6/tlnSIwPEBUbeUBm61sLNjUcL3Cs0rLy6bUwBndkTDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:26:24.704539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.07647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8738686146b9b68ba1e96473bd1ba02dad95c4970537b80434e5c76110bd0f2b","sha256:e6745ecee467922e2b77cdcab7ea861681629a8432b79ae797e3ba9994182ee4"],"state_sha256":"d39c96e436f5f007f64f1e3a3e848a3ca0f18130f07753f415c8d034c4fd2fab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMsJVSYWcg/y8YDVrKBEOWMFaRxXchodbwkaDFC2vTvsm2zRbaz/PDxo/ZgiipsJ1Ezbiix9SJbpRBTHhETGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T11:01:06.041767Z","bundle_sha256":"76ca6311402e25bc8958e5b29384f9ba216faa46d2c3046d17bd9f867c92af0c"}}