{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QOZW3G37J6B2ORHQGCVG3AZULW","short_pith_number":"pith:QOZW3G37","schema_version":"1.0","canonical_sha256":"83b36d9b7f4f83a744f030aa6d83345db5af16a71d9374ad1f3a69e2d550e205","source":{"kind":"arxiv","id":"1406.3812","version":1},"attestation_state":"computed","paper":{"title":"Hadwiger number of graphs with small chordality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Petr A. Golovach, Pim van 't Hof, Pinar Heggernes","submitted_at":"2014-06-15T13:08:56Z","abstract_excerpt":"The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph is NP-hard on co-bipartite graphs, but can be solved in polynomial time on cographs and on bipartite permutation graphs. We also consider a natural generalization of this problem that asks for the largest integer h such that G has a minor with h vertices and diameter at most $s$. We show that this problem can be solved in polynomial time on AT-free graphs when s>=2, but is NP-hard on chordal graphs for every fixed s>"},"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":"1406.3812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-15T13:08:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7a74e75553f722fbab045c825c201cdae29e9dc56aa526bab816c19100f70dec","abstract_canon_sha256":"8ad7590696ae514e1937bb5664d099049451bc02e87abb91b15b8857c4b5809d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.684989Z","signature_b64":"uAroKngK863PUW3WfXizYBvd/4BoEBC//laimsLITvdJCrDURrNDyc78n2SXi4fdUGVhj5bsDQ0DQf6tMBCUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b36d9b7f4f83a744f030aa6d83345db5af16a71d9374ad1f3a69e2d550e205","last_reissued_at":"2026-05-18T02:49:39.684670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.684670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hadwiger number of graphs with small chordality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Petr A. Golovach, Pim van 't Hof, Pinar Heggernes","submitted_at":"2014-06-15T13:08:56Z","abstract_excerpt":"The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph is NP-hard on co-bipartite graphs, but can be solved in polynomial time on cographs and on bipartite permutation graphs. We also consider a natural generalization of this problem that asks for the largest integer h such that G has a minor with h vertices and diameter at most $s$. We show that this problem can be solved in polynomial time on AT-free graphs when s>=2, but is NP-hard on chordal graphs for every fixed s>"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3812","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":"1406.3812","created_at":"2026-05-18T02:49:39.684723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3812v1","created_at":"2026-05-18T02:49:39.684723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3812","created_at":"2026-05-18T02:49:39.684723+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOZW3G37J6B2","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOZW3G37J6B2ORHQ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOZW3G37","created_at":"2026-05-18T12:28:46.137349+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/QOZW3G37J6B2ORHQGCVG3AZULW","json":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW.json","graph_json":"https://pith.science/api/pith-number/QOZW3G37J6B2ORHQGCVG3AZULW/graph.json","events_json":"https://pith.science/api/pith-number/QOZW3G37J6B2ORHQGCVG3AZULW/events.json","paper":"https://pith.science/paper/QOZW3G37"},"agent_actions":{"view_html":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW","download_json":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW.json","view_paper":"https://pith.science/paper/QOZW3G37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3812&json=true","fetch_graph":"https://pith.science/api/pith-number/QOZW3G37J6B2ORHQGCVG3AZULW/graph.json","fetch_events":"https://pith.science/api/pith-number/QOZW3G37J6B2ORHQGCVG3AZULW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW/action/storage_attestation","attest_author":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW/action/author_attestation","sign_citation":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW/action/citation_signature","submit_replication":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW/action/replication_record"}},"created_at":"2026-05-18T02:49:39.684723+00:00","updated_at":"2026-05-18T02:49:39.684723+00:00"}