{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CROICCVYRLXVKSNGAGPJBJXDQG","short_pith_number":"pith:CROICCVY","schema_version":"1.0","canonical_sha256":"145c810ab88aef5549a6019e90a6e381a9b06bc4aa2adc69598ddaad0b743018","source":{"kind":"arxiv","id":"2502.14775","version":3},"attestation_state":"computed","paper":{"title":"Every Graph is Essential to Large Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bogdan Alecu, \\'Edouard Bonnet, Nicolas Trotignon, Pedro Bureo Villafana","submitted_at":"2025-02-20T17:59:36Z","abstract_excerpt":"We show that for every graph $H$, there is a hereditary weakly sparse graph class $\\mathcal C_H$ of unbounded treewidth such that the $H$-free (i.e., excluding $H$ as an induced subgraph) graphs of $\\mathcal C_H$ have bounded treewidth. This refutes several conjectures and critically thwarts the quest for the unavoidable induced subgraphs in classes of unbounded treewidth, a wished-for counterpart of the Grid Minor theorem. We actually show a stronger result: For every positive integer $t$, there is a hereditary graph class $\\mathcal C_t$ of unbounded treewidth such that for any graph $H$ of t"},"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":"2502.14775","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-20T17:59:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f783620287699caca1b617b020f4772b35e0a344e4eefef33b81d7c0ba045e43","abstract_canon_sha256":"a34ab01391ee3abc0d8e2f1b42066655a5922d899917d8c600983bafd598eda6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:42:43.740926Z","signature_b64":"PkzenyaTSs1MUb4ks4wNZkBfMcWP13BJDaGIUeu5XJ0KWfWIuhLOjThmAXUOjPGh1wOMFglbveQsaiP6aU2nAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"145c810ab88aef5549a6019e90a6e381a9b06bc4aa2adc69598ddaad0b743018","last_reissued_at":"2026-07-05T10:42:43.740393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:42:43.740393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Every Graph is Essential to Large Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bogdan Alecu, \\'Edouard Bonnet, Nicolas Trotignon, Pedro Bureo Villafana","submitted_at":"2025-02-20T17:59:36Z","abstract_excerpt":"We show that for every graph $H$, there is a hereditary weakly sparse graph class $\\mathcal C_H$ of unbounded treewidth such that the $H$-free (i.e., excluding $H$ as an induced subgraph) graphs of $\\mathcal C_H$ have bounded treewidth. This refutes several conjectures and critically thwarts the quest for the unavoidable induced subgraphs in classes of unbounded treewidth, a wished-for counterpart of the Grid Minor theorem. We actually show a stronger result: For every positive integer $t$, there is a hereditary graph class $\\mathcal C_t$ of unbounded treewidth such that for any graph $H$ of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.14775","kind":"arxiv","version":3},"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/2502.14775/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":"2502.14775","created_at":"2026-07-05T10:42:43.740453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.14775v3","created_at":"2026-07-05T10:42:43.740453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.14775","created_at":"2026-07-05T10:42:43.740453+00:00"},{"alias_kind":"pith_short_12","alias_value":"CROICCVYRLXV","created_at":"2026-07-05T10:42:43.740453+00:00"},{"alias_kind":"pith_short_16","alias_value":"CROICCVYRLXVKSNG","created_at":"2026-07-05T10:42:43.740453+00:00"},{"alias_kind":"pith_short_8","alias_value":"CROICCVY","created_at":"2026-07-05T10:42:43.740453+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.04026","citing_title":"Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars","ref_index":2025,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CROICCVYRLXVKSNGAGPJBJXDQG","json":"https://pith.science/pith/CROICCVYRLXVKSNGAGPJBJXDQG.json","graph_json":"https://pith.science/api/pith-number/CROICCVYRLXVKSNGAGPJBJXDQG/graph.json","events_json":"https://pith.science/api/pith-number/CROICCVYRLXVKSNGAGPJBJXDQG/events.json","paper":"https://pith.science/paper/CROICCVY"},"agent_actions":{"view_html":"https://pith.science/pith/CROICCVYRLXVKSNGAGPJBJXDQG","download_json":"https://pith.science/pith/CROICCVYRLXVKSNGAGPJBJXDQG.json","view_paper":"https://pith.science/paper/CROICCVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.14775&json=true","fetch_graph":"https://pith.science/api/pith-number/CROICCVYRLXVKSNGAGPJBJXDQG/graph.json","fetch_events":"https://pith.science/api/pith-number/CROICCVYRLXVKSNGAGPJBJXDQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CROICCVYRLXVKSNGAGPJBJXDQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CROICCVYRLXVKSNGAGPJBJXDQG/action/storage_attestation","attest_author":"https://pith.science/pith/CROICCVYRLXVKSNGAGPJBJXDQG/action/author_attestation","sign_citation":"https://pith.science/pith/CROICCVYRLXVKSNGAGPJBJXDQG/action/citation_signature","submit_replication":"https://pith.science/pith/CROICCVYRLXVKSNGAGPJBJXDQG/action/replication_record"}},"created_at":"2026-07-05T10:42:43.740453+00:00","updated_at":"2026-07-05T10:42:43.740453+00:00"}