{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:32NGHU6UODVDN3JCXWEPLU6C7X","short_pith_number":"pith:32NGHU6U","schema_version":"1.0","canonical_sha256":"de9a63d3d470ea36ed22bd88f5d3c2fdcc22adda2063cf4db63095e826914924","source":{"kind":"arxiv","id":"1206.1545","version":1},"attestation_state":"computed","paper":{"title":"Constructing graphs with no immersion of large complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Karen L. Collins, Megan E. Heenehan","submitted_at":"2012-06-07T16:29:21Z","abstract_excerpt":"In 1989, Lescure and Meyniel proved, for $d=5, 6$, that every $d$-chromatic graph contains an immersion of $K_d$, and in 2003 Abu-Khzam and Langston conjectured that this holds for all $d$. In 2010, DeVos, Kawarabayashi, Mohar, and Okamura proved this conjecture for $d = 7$. In each proof, the $d$-chromatic assumption was not fully utilized, as the proofs only use the fact that a $d$-critical graph has minimum degree at least $d - 1$. DeVos, Dvo\\v{r}\\'ak, Fox, McDonald, Mohar, and Scheide show the stronger conjecture that a graph with minimum degree $d-1$ has an immersion of $K_d$ fails for $d"},"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":"1206.1545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T16:29:21Z","cross_cats_sorted":[],"title_canon_sha256":"e5b6a748c267086c45dd0fd554b0303786261c28642a6f4725b70a0d09ae64a8","abstract_canon_sha256":"c0d78c7166233d4dd8d704e42eb8ab6a2ac89aaa483bd1f4fd101fe1b1324790"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:04.857440Z","signature_b64":"Yh21euHZbgYt5L4rUgtv7ECOxuESYnSVbVCMAVrKxz/yK1pGUa2rhZwgBp5dhGgnQjfF+HREoqh2dPsCsqrwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de9a63d3d470ea36ed22bd88f5d3c2fdcc22adda2063cf4db63095e826914924","last_reissued_at":"2026-05-18T03:54:04.856663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:04.856663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing graphs with no immersion of large complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Karen L. Collins, Megan E. Heenehan","submitted_at":"2012-06-07T16:29:21Z","abstract_excerpt":"In 1989, Lescure and Meyniel proved, for $d=5, 6$, that every $d$-chromatic graph contains an immersion of $K_d$, and in 2003 Abu-Khzam and Langston conjectured that this holds for all $d$. In 2010, DeVos, Kawarabayashi, Mohar, and Okamura proved this conjecture for $d = 7$. In each proof, the $d$-chromatic assumption was not fully utilized, as the proofs only use the fact that a $d$-critical graph has minimum degree at least $d - 1$. DeVos, Dvo\\v{r}\\'ak, Fox, McDonald, Mohar, and Scheide show the stronger conjecture that a graph with minimum degree $d-1$ has an immersion of $K_d$ fails for $d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1545","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":"1206.1545","created_at":"2026-05-18T03:54:04.856798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1545v1","created_at":"2026-05-18T03:54:04.856798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1545","created_at":"2026-05-18T03:54:04.856798+00:00"},{"alias_kind":"pith_short_12","alias_value":"32NGHU6UODVD","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"32NGHU6UODVDN3JC","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"32NGHU6U","created_at":"2026-05-18T12:26:50.516681+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/32NGHU6UODVDN3JCXWEPLU6C7X","json":"https://pith.science/pith/32NGHU6UODVDN3JCXWEPLU6C7X.json","graph_json":"https://pith.science/api/pith-number/32NGHU6UODVDN3JCXWEPLU6C7X/graph.json","events_json":"https://pith.science/api/pith-number/32NGHU6UODVDN3JCXWEPLU6C7X/events.json","paper":"https://pith.science/paper/32NGHU6U"},"agent_actions":{"view_html":"https://pith.science/pith/32NGHU6UODVDN3JCXWEPLU6C7X","download_json":"https://pith.science/pith/32NGHU6UODVDN3JCXWEPLU6C7X.json","view_paper":"https://pith.science/paper/32NGHU6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1545&json=true","fetch_graph":"https://pith.science/api/pith-number/32NGHU6UODVDN3JCXWEPLU6C7X/graph.json","fetch_events":"https://pith.science/api/pith-number/32NGHU6UODVDN3JCXWEPLU6C7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32NGHU6UODVDN3JCXWEPLU6C7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32NGHU6UODVDN3JCXWEPLU6C7X/action/storage_attestation","attest_author":"https://pith.science/pith/32NGHU6UODVDN3JCXWEPLU6C7X/action/author_attestation","sign_citation":"https://pith.science/pith/32NGHU6UODVDN3JCXWEPLU6C7X/action/citation_signature","submit_replication":"https://pith.science/pith/32NGHU6UODVDN3JCXWEPLU6C7X/action/replication_record"}},"created_at":"2026-05-18T03:54:04.856798+00:00","updated_at":"2026-05-18T03:54:04.856798+00:00"}