{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2PUCAPLBI4ESIHMMNIIDCGJWJ5","short_pith_number":"pith:2PUCAPLB","schema_version":"1.0","canonical_sha256":"d3e8203d614709241d8c6a103119364f6733b0b7262b3b403a474e3f39f65c31","source":{"kind":"arxiv","id":"1503.06912","version":2},"attestation_state":"computed","paper":{"title":"Hadwiger's conjecture for the complements of Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guangjun Xu, Sanming Zhou","submitted_at":"2015-03-24T04:52:03Z","abstract_excerpt":"Hadwiger's conjecture asserts that every graph with chromatic number $t$ contains a complete minor of order $t$. Given integers $n \\ge 2k+1 \\ge 5$, the Kneser graph $K(n, k)$ is the graph with vertices the $k$-subsets of an $n$-set such that two vertices are adjacent if and only if the corresponding $k$-subsets are disjoint. We prove that Hadwiger's conjecture is true for the complements of Kneser graphs."},"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":"1503.06912","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-24T04:52:03Z","cross_cats_sorted":[],"title_canon_sha256":"6e485bd47b45b7091f5ee0102c1bc72b0fdd009054979d4c1b618b331a68e920","abstract_canon_sha256":"6ec91a2c19ef1c3e01f0558e7b0654e2ff7c4ab595f1fea586987a78d3ae5581"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:47.186446Z","signature_b64":"YQBw1wf7KXP/YFa4p2Ts5bSv04OEG7AykCBHveqLE3Olk46YcYIV/ERcPlnFR3HoURZstsryci9h+bmz7N6rAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3e8203d614709241d8c6a103119364f6733b0b7262b3b403a474e3f39f65c31","last_reissued_at":"2026-05-18T01:25:47.185949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:47.185949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hadwiger's conjecture for the complements of Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guangjun Xu, Sanming Zhou","submitted_at":"2015-03-24T04:52:03Z","abstract_excerpt":"Hadwiger's conjecture asserts that every graph with chromatic number $t$ contains a complete minor of order $t$. Given integers $n \\ge 2k+1 \\ge 5$, the Kneser graph $K(n, k)$ is the graph with vertices the $k$-subsets of an $n$-set such that two vertices are adjacent if and only if the corresponding $k$-subsets are disjoint. We prove that Hadwiger's conjecture is true for the complements of Kneser graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06912","kind":"arxiv","version":2},"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":"1503.06912","created_at":"2026-05-18T01:25:47.186011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06912v2","created_at":"2026-05-18T01:25:47.186011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06912","created_at":"2026-05-18T01:25:47.186011+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PUCAPLBI4ES","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PUCAPLBI4ESIHMM","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PUCAPLB","created_at":"2026-05-18T12:29:02.477457+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/2PUCAPLBI4ESIHMMNIIDCGJWJ5","json":"https://pith.science/pith/2PUCAPLBI4ESIHMMNIIDCGJWJ5.json","graph_json":"https://pith.science/api/pith-number/2PUCAPLBI4ESIHMMNIIDCGJWJ5/graph.json","events_json":"https://pith.science/api/pith-number/2PUCAPLBI4ESIHMMNIIDCGJWJ5/events.json","paper":"https://pith.science/paper/2PUCAPLB"},"agent_actions":{"view_html":"https://pith.science/pith/2PUCAPLBI4ESIHMMNIIDCGJWJ5","download_json":"https://pith.science/pith/2PUCAPLBI4ESIHMMNIIDCGJWJ5.json","view_paper":"https://pith.science/paper/2PUCAPLB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06912&json=true","fetch_graph":"https://pith.science/api/pith-number/2PUCAPLBI4ESIHMMNIIDCGJWJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/2PUCAPLBI4ESIHMMNIIDCGJWJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PUCAPLBI4ESIHMMNIIDCGJWJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PUCAPLBI4ESIHMMNIIDCGJWJ5/action/storage_attestation","attest_author":"https://pith.science/pith/2PUCAPLBI4ESIHMMNIIDCGJWJ5/action/author_attestation","sign_citation":"https://pith.science/pith/2PUCAPLBI4ESIHMMNIIDCGJWJ5/action/citation_signature","submit_replication":"https://pith.science/pith/2PUCAPLBI4ESIHMMNIIDCGJWJ5/action/replication_record"}},"created_at":"2026-05-18T01:25:47.186011+00:00","updated_at":"2026-05-18T01:25:47.186011+00:00"}