{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SUK2ZHMK3TTHTLNYKM3CECASIY","short_pith_number":"pith:SUK2ZHMK","schema_version":"1.0","canonical_sha256":"9515ac9d8adce679adb85336220812462698a66ea49194881ef687ce146ebc03","source":{"kind":"arxiv","id":"2410.19295","version":1},"attestation_state":"computed","paper":{"title":"Treewidth, Hadwiger Number, and Induced Minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bryce Frederickson, David R. Wood, James Davies, J. Pascal Gollin, Kevin Hendrey, Liana Yepremyan, Marc Distel, Robert Hickingbotham, Rutger Campbell, Sebastian Wiederrecht","submitted_at":"2024-10-25T04:03:33Z","abstract_excerpt":"Treewidth and Hadwiger number are two of the most important parameters in structural graph theory.\n  This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor.\n  To formalise this, we say that a graph class $\\mathcal{G}$ is (tw,had)-bounded if there is a function $f$ (called the (tw,had)-bounding function) such that tw$(G)$ $\\leq$ $f$(had$(G)$) for every graph $G \\in \\mathcal{G}$.\n  We characterise (tw,had)-bounded graph classes as those that exclude some planar graph as an induced minor, and use this characterisation to show that every pro"},"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":"2410.19295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-25T04:03:33Z","cross_cats_sorted":[],"title_canon_sha256":"1795d083c73ef088385149ce3febdf061f4c88666a852bca9e985e70f3001c44","abstract_canon_sha256":"f780172c2c00afa8b7ac37460d03e2d324ae7f3bdbf07d39363651eaabeb5528"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:54.533340Z","signature_b64":"KDf3q3I5MNY6X/Yw0x6M8pEDQmCG5vFLymbg0YDJTahLEBu+LqkhAYdz8hYi/d9xhHy6hppyyXP37FWj+4sxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9515ac9d8adce679adb85336220812462698a66ea49194881ef687ce146ebc03","last_reissued_at":"2026-07-05T09:25:54.532790Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:54.532790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Treewidth, Hadwiger Number, and Induced Minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bryce Frederickson, David R. Wood, James Davies, J. Pascal Gollin, Kevin Hendrey, Liana Yepremyan, Marc Distel, Robert Hickingbotham, Rutger Campbell, Sebastian Wiederrecht","submitted_at":"2024-10-25T04:03:33Z","abstract_excerpt":"Treewidth and Hadwiger number are two of the most important parameters in structural graph theory.\n  This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor.\n  To formalise this, we say that a graph class $\\mathcal{G}$ is (tw,had)-bounded if there is a function $f$ (called the (tw,had)-bounding function) such that tw$(G)$ $\\leq$ $f$(had$(G)$) for every graph $G \\in \\mathcal{G}$.\n  We characterise (tw,had)-bounded graph classes as those that exclude some planar graph as an induced minor, and use this characterisation to show that every pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.19295","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/2410.19295/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.19295","created_at":"2026-07-05T09:25:54.532852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.19295v1","created_at":"2026-07-05T09:25:54.532852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.19295","created_at":"2026-07-05T09:25:54.532852+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUK2ZHMK3TTH","created_at":"2026-07-05T09:25:54.532852+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUK2ZHMK3TTHTLNY","created_at":"2026-07-05T09:25:54.532852+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUK2ZHMK","created_at":"2026-07-05T09:25:54.532852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.01140","citing_title":"Tree decompositions with small width, spread, order and degree","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SUK2ZHMK3TTHTLNYKM3CECASIY","json":"https://pith.science/pith/SUK2ZHMK3TTHTLNYKM3CECASIY.json","graph_json":"https://pith.science/api/pith-number/SUK2ZHMK3TTHTLNYKM3CECASIY/graph.json","events_json":"https://pith.science/api/pith-number/SUK2ZHMK3TTHTLNYKM3CECASIY/events.json","paper":"https://pith.science/paper/SUK2ZHMK"},"agent_actions":{"view_html":"https://pith.science/pith/SUK2ZHMK3TTHTLNYKM3CECASIY","download_json":"https://pith.science/pith/SUK2ZHMK3TTHTLNYKM3CECASIY.json","view_paper":"https://pith.science/paper/SUK2ZHMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.19295&json=true","fetch_graph":"https://pith.science/api/pith-number/SUK2ZHMK3TTHTLNYKM3CECASIY/graph.json","fetch_events":"https://pith.science/api/pith-number/SUK2ZHMK3TTHTLNYKM3CECASIY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUK2ZHMK3TTHTLNYKM3CECASIY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUK2ZHMK3TTHTLNYKM3CECASIY/action/storage_attestation","attest_author":"https://pith.science/pith/SUK2ZHMK3TTHTLNYKM3CECASIY/action/author_attestation","sign_citation":"https://pith.science/pith/SUK2ZHMK3TTHTLNYKM3CECASIY/action/citation_signature","submit_replication":"https://pith.science/pith/SUK2ZHMK3TTHTLNYKM3CECASIY/action/replication_record"}},"created_at":"2026-07-05T09:25:54.532852+00:00","updated_at":"2026-07-05T09:25:54.532852+00:00"}