{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:242B5NEX527XBLDYJF7ESC5NMG","short_pith_number":"pith:242B5NEX","schema_version":"1.0","canonical_sha256":"d7341eb497eebf70ac78497e490bad6196d368d2c3ee397011c627b5db9fbd98","source":{"kind":"arxiv","id":"2402.11222","version":2},"attestation_state":"computed","paper":{"title":"Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Andrea Munaro, Cl\\'ement Dallard, Kenny \\v{S}torgel, Martin Milani\\v{c}, Matja\\v{z} Krnc, O-joung Kwon, Sebastian Wiederrecht","submitted_at":"2024-02-17T08:38:58Z","abstract_excerpt":"Many recent works address the question of characterizing induced obstructions to bounded treewidth. In 2022, Lozin and Razgon completely answered this question for graph classes defined by finitely many forbidden induced subgraphs. Their result also implies a characterization of graph classes defined by finitely many forbidden induced subgraphs that are $(tw,\\omega)$-bounded, that is, treewidth can only be large due to the presence of a large clique. This condition is known to be satisfied for any graph class with bounded tree-independence number, a graph parameter introduced independently by "},"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":"2402.11222","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-17T08:38:58Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"7aba6816b74c67f4d5c92b85b147a77a3a0fe503a7e12b7dfc01c752734d4aad","abstract_canon_sha256":"2acab1b40282dd9a8f21d995fab5790253009e4477f1a049d17c9420647e2a4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:10.068022Z","signature_b64":"XONcWcSC/u2cLRzpBEyftUgERb0VoaOAQy8cRnVDNq7liPffyVhQ2ZYOKEIROWmuFOgXmLKe+Uc1ZJxQkgo+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7341eb497eebf70ac78497e490bad6196d368d2c3ee397011c627b5db9fbd98","last_reissued_at":"2026-07-05T07:47:10.067560Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:10.067560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Andrea Munaro, Cl\\'ement Dallard, Kenny \\v{S}torgel, Martin Milani\\v{c}, Matja\\v{z} Krnc, O-joung Kwon, Sebastian Wiederrecht","submitted_at":"2024-02-17T08:38:58Z","abstract_excerpt":"Many recent works address the question of characterizing induced obstructions to bounded treewidth. In 2022, Lozin and Razgon completely answered this question for graph classes defined by finitely many forbidden induced subgraphs. Their result also implies a characterization of graph classes defined by finitely many forbidden induced subgraphs that are $(tw,\\omega)$-bounded, that is, treewidth can only be large due to the presence of a large clique. This condition is known to be satisfied for any graph class with bounded tree-independence number, a graph parameter introduced independently by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11222","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.11222/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":"2402.11222","created_at":"2026-07-05T07:47:10.067618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.11222v2","created_at":"2026-07-05T07:47:10.067618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11222","created_at":"2026-07-05T07:47:10.067618+00:00"},{"alias_kind":"pith_short_12","alias_value":"242B5NEX527X","created_at":"2026-07-05T07:47:10.067618+00:00"},{"alias_kind":"pith_short_16","alias_value":"242B5NEX527XBLDY","created_at":"2026-07-05T07:47:10.067618+00:00"},{"alias_kind":"pith_short_8","alias_value":"242B5NEX","created_at":"2026-07-05T07:47:10.067618+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07697","citing_title":"Induced Erd\\H{o}s--P\\'osa property for long holes, long thetas, and beyond","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2606.24695","citing_title":"Forcing monochromatic induced subgraphs","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20256","citing_title":"Tree-independence number of $K_{1,d}$-free graph classes","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2509.01140","citing_title":"Tree decompositions with small width, spread, order and degree","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01223","citing_title":"Tree-alpha and excluding finitely many graphs","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/242B5NEX527XBLDYJF7ESC5NMG","json":"https://pith.science/pith/242B5NEX527XBLDYJF7ESC5NMG.json","graph_json":"https://pith.science/api/pith-number/242B5NEX527XBLDYJF7ESC5NMG/graph.json","events_json":"https://pith.science/api/pith-number/242B5NEX527XBLDYJF7ESC5NMG/events.json","paper":"https://pith.science/paper/242B5NEX"},"agent_actions":{"view_html":"https://pith.science/pith/242B5NEX527XBLDYJF7ESC5NMG","download_json":"https://pith.science/pith/242B5NEX527XBLDYJF7ESC5NMG.json","view_paper":"https://pith.science/paper/242B5NEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.11222&json=true","fetch_graph":"https://pith.science/api/pith-number/242B5NEX527XBLDYJF7ESC5NMG/graph.json","fetch_events":"https://pith.science/api/pith-number/242B5NEX527XBLDYJF7ESC5NMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/242B5NEX527XBLDYJF7ESC5NMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/242B5NEX527XBLDYJF7ESC5NMG/action/storage_attestation","attest_author":"https://pith.science/pith/242B5NEX527XBLDYJF7ESC5NMG/action/author_attestation","sign_citation":"https://pith.science/pith/242B5NEX527XBLDYJF7ESC5NMG/action/citation_signature","submit_replication":"https://pith.science/pith/242B5NEX527XBLDYJF7ESC5NMG/action/replication_record"}},"created_at":"2026-07-05T07:47:10.067618+00:00","updated_at":"2026-07-05T07:47:10.067618+00:00"}