{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZVMGMHBMWFHT2TB2HKOXANOMDT","short_pith_number":"pith:ZVMGMHBM","schema_version":"1.0","canonical_sha256":"cd58661c2cb14f3d4c3a3a9d7035cc1cd1d7106dbea2a505d9bb66ccedb5ae77","source":{"kind":"arxiv","id":"2509.04026","version":1},"attestation_state":"computed","paper":{"title":"Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Mujin Choi, Sebastian Wiederrecht","submitted_at":"2025-09-04T09:00:07Z","abstract_excerpt":"A $k$-ladder is the graph obtained from two disjoint paths, each with $k$ vertices, by joining the $i$th vertices of both paths with an edge for each $i\\in\\{ 1,\\ldots,k\\}$. In this paper, we show that for all positive integers $k$ and $d$, the class of all $K_{1,d}$-free graphs excluding the $k$-ladder as an induced minor has a bounded tree-independence number.\n  We further show that our method implies a number of known results: We improve the bound on the tree-independence number for the class of $K_{1,d}$-free graphs not containing a wheel as an induced minor given by Choi, Hilaire, Milani\\v"},"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":"2509.04026","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-04T09:00:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f6108ebafc84541390378baf9f3e3f30c8c40fbf034b78d1b8da91ae48bee5ad","abstract_canon_sha256":"84f11f93b9be88ffec5e775a8494e0e2c3f3ea098096d38fe59975a26be0696d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:52.062488Z","signature_b64":"wLt/YDfjAAMlrm7yh6krIuexjKAZRjLdNvKQjRTCXde48O5J6+jJfB+Vwm28S9Cz3kGYNbrkMcd8HEqRC2L4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd58661c2cb14f3d4c3a3a9d7035cc1cd1d7106dbea2a505d9bb66ccedb5ae77","last_reissued_at":"2026-07-05T12:04:52.061988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:52.061988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Mujin Choi, Sebastian Wiederrecht","submitted_at":"2025-09-04T09:00:07Z","abstract_excerpt":"A $k$-ladder is the graph obtained from two disjoint paths, each with $k$ vertices, by joining the $i$th vertices of both paths with an edge for each $i\\in\\{ 1,\\ldots,k\\}$. In this paper, we show that for all positive integers $k$ and $d$, the class of all $K_{1,d}$-free graphs excluding the $k$-ladder as an induced minor has a bounded tree-independence number.\n  We further show that our method implies a number of known results: We improve the bound on the tree-independence number for the class of $K_{1,d}$-free graphs not containing a wheel as an induced minor given by Choi, Hilaire, Milani\\v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04026","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/2509.04026/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":"2509.04026","created_at":"2026-07-05T12:04:52.062044+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.04026v1","created_at":"2026-07-05T12:04:52.062044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04026","created_at":"2026-07-05T12:04:52.062044+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVMGMHBMWFHT","created_at":"2026-07-05T12:04:52.062044+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVMGMHBMWFHT2TB2","created_at":"2026-07-05T12:04:52.062044+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVMGMHBM","created_at":"2026-07-05T12:04:52.062044+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/ZVMGMHBMWFHT2TB2HKOXANOMDT","json":"https://pith.science/pith/ZVMGMHBMWFHT2TB2HKOXANOMDT.json","graph_json":"https://pith.science/api/pith-number/ZVMGMHBMWFHT2TB2HKOXANOMDT/graph.json","events_json":"https://pith.science/api/pith-number/ZVMGMHBMWFHT2TB2HKOXANOMDT/events.json","paper":"https://pith.science/paper/ZVMGMHBM"},"agent_actions":{"view_html":"https://pith.science/pith/ZVMGMHBMWFHT2TB2HKOXANOMDT","download_json":"https://pith.science/pith/ZVMGMHBMWFHT2TB2HKOXANOMDT.json","view_paper":"https://pith.science/paper/ZVMGMHBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.04026&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVMGMHBMWFHT2TB2HKOXANOMDT/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVMGMHBMWFHT2TB2HKOXANOMDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVMGMHBMWFHT2TB2HKOXANOMDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVMGMHBMWFHT2TB2HKOXANOMDT/action/storage_attestation","attest_author":"https://pith.science/pith/ZVMGMHBMWFHT2TB2HKOXANOMDT/action/author_attestation","sign_citation":"https://pith.science/pith/ZVMGMHBMWFHT2TB2HKOXANOMDT/action/citation_signature","submit_replication":"https://pith.science/pith/ZVMGMHBMWFHT2TB2HKOXANOMDT/action/replication_record"}},"created_at":"2026-07-05T12:04:52.062044+00:00","updated_at":"2026-07-05T12:04:52.062044+00:00"}