{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MDXRWLARMNZZQQQTK6BRHZQPJH","short_pith_number":"pith:MDXRWLAR","schema_version":"1.0","canonical_sha256":"60ef1b2c116373984213578313e60f49cc28b907ac49bc7215380e3898a86291","source":{"kind":"arxiv","id":"1212.3093","version":1},"attestation_state":"computed","paper":{"title":"Hadwiger's conjecture for graphs with infinite chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.LO"],"primary_cat":"math.CO","authors_text":"Dominic van der Zypen","submitted_at":"2012-12-13T09:10:00Z","abstract_excerpt":"We construct a connected graph H such that (1) \\chi(H) = \\omega; (2) K_\\omega, the complete graph on \\omega points, is not a minor of H. Therefore Hadwiger's conjecture does not hold for graphs with infinite coloring number."},"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":"1212.3093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-13T09:10:00Z","cross_cats_sorted":["cs.DM","math.LO"],"title_canon_sha256":"e57b775c2214116e64c1d859bdd831e255fc2d32e5ab04c6030c5f626eb1d22c","abstract_canon_sha256":"0a77184f1acb6653c549dd4f6309a8a3cbbb3bb64a4bb9e2a5df22abc4918f12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:33.785848Z","signature_b64":"HkbCybNi/lHaVVDntbmTm8Hep43LAgpokMYqBJa86NWGB7DxueL9ioG75vgtb6SJltzO/R6sBvdLwE55W8zmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60ef1b2c116373984213578313e60f49cc28b907ac49bc7215380e3898a86291","last_reissued_at":"2026-05-18T03:38:33.785197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:33.785197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hadwiger's conjecture for graphs with infinite chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.LO"],"primary_cat":"math.CO","authors_text":"Dominic van der Zypen","submitted_at":"2012-12-13T09:10:00Z","abstract_excerpt":"We construct a connected graph H such that (1) \\chi(H) = \\omega; (2) K_\\omega, the complete graph on \\omega points, is not a minor of H. Therefore Hadwiger's conjecture does not hold for graphs with infinite coloring number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3093","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.3093","created_at":"2026-05-18T03:38:33.785304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3093v1","created_at":"2026-05-18T03:38:33.785304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3093","created_at":"2026-05-18T03:38:33.785304+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDXRWLARMNZZ","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDXRWLARMNZZQQQT","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDXRWLAR","created_at":"2026-05-18T12:27:14.488303+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/MDXRWLARMNZZQQQTK6BRHZQPJH","json":"https://pith.science/pith/MDXRWLARMNZZQQQTK6BRHZQPJH.json","graph_json":"https://pith.science/api/pith-number/MDXRWLARMNZZQQQTK6BRHZQPJH/graph.json","events_json":"https://pith.science/api/pith-number/MDXRWLARMNZZQQQTK6BRHZQPJH/events.json","paper":"https://pith.science/paper/MDXRWLAR"},"agent_actions":{"view_html":"https://pith.science/pith/MDXRWLARMNZZQQQTK6BRHZQPJH","download_json":"https://pith.science/pith/MDXRWLARMNZZQQQTK6BRHZQPJH.json","view_paper":"https://pith.science/paper/MDXRWLAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3093&json=true","fetch_graph":"https://pith.science/api/pith-number/MDXRWLARMNZZQQQTK6BRHZQPJH/graph.json","fetch_events":"https://pith.science/api/pith-number/MDXRWLARMNZZQQQTK6BRHZQPJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDXRWLARMNZZQQQTK6BRHZQPJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDXRWLARMNZZQQQTK6BRHZQPJH/action/storage_attestation","attest_author":"https://pith.science/pith/MDXRWLARMNZZQQQTK6BRHZQPJH/action/author_attestation","sign_citation":"https://pith.science/pith/MDXRWLARMNZZQQQTK6BRHZQPJH/action/citation_signature","submit_replication":"https://pith.science/pith/MDXRWLARMNZZQQQTK6BRHZQPJH/action/replication_record"}},"created_at":"2026-05-18T03:38:33.785304+00:00","updated_at":"2026-05-18T03:38:33.785304+00:00"}