{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IO2OI7U3R7WAYYCHLYUETY6KHK","short_pith_number":"pith:IO2OI7U3","schema_version":"1.0","canonical_sha256":"43b4e47e9b8fec0c60475e2849e3ca3aa29fbd1b8593bd304f9284b480cee318","source":{"kind":"arxiv","id":"2606.20256","version":1},"attestation_state":"computed","paper":{"title":"Tree-independence number of $K_{1,d}$-free graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"{\\DH}or{\\dj}e Vasi\\'c, Hidde Koerts, Kenny Be\\v{s}ter \\v{S}torgel, Mujin Choi","submitted_at":"2026-06-18T14:05:30Z","abstract_excerpt":"In this paper, we investigate the tree-independence number of graph classes that do not contain $K_{1,d}$ as an induced subgraph. Dallard et al. conjectured that for any positive integer $d$ and any planar graph $H$, the class of all $K_{1,d}$-free graphs without $H$ as an induced minor has bounded tree-independence number. Our main contribution towards this conjecture is showing that the conjecture holds for outerstring graphs. Additionally we give linear and quadratic bounds for the tree-independence number of various $K_{1,d}$-free graph classes, sharpening previous bounds. Finally, we boun"},"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":"2606.20256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T14:05:30Z","cross_cats_sorted":[],"title_canon_sha256":"085aa329c89b26e8f91a9717452562b385ace8ea326f52d61453b181920d6f03","abstract_canon_sha256":"5b01bbc4ecf6425b0232b2e64875b4fc3883805fec08a9eb708c9a1f52335080"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:07.054686Z","signature_b64":"6JmtmD2iTfcp+xsAiDMzW4+/ki15o7sD1k/Om5jAQpCT+CA4NsztNoCO25dIz3pdxeBMU5UEkC3/itUTRK/rDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43b4e47e9b8fec0c60475e2849e3ca3aa29fbd1b8593bd304f9284b480cee318","last_reissued_at":"2026-06-19T16:13:07.054343Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:07.054343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-independence number of $K_{1,d}$-free graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"{\\DH}or{\\dj}e Vasi\\'c, Hidde Koerts, Kenny Be\\v{s}ter \\v{S}torgel, Mujin Choi","submitted_at":"2026-06-18T14:05:30Z","abstract_excerpt":"In this paper, we investigate the tree-independence number of graph classes that do not contain $K_{1,d}$ as an induced subgraph. Dallard et al. conjectured that for any positive integer $d$ and any planar graph $H$, the class of all $K_{1,d}$-free graphs without $H$ as an induced minor has bounded tree-independence number. Our main contribution towards this conjecture is showing that the conjecture holds for outerstring graphs. Additionally we give linear and quadratic bounds for the tree-independence number of various $K_{1,d}$-free graph classes, sharpening previous bounds. Finally, we boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20256","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/2606.20256/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":"2606.20256","created_at":"2026-06-19T16:13:07.054406+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.20256v1","created_at":"2026-06-19T16:13:07.054406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20256","created_at":"2026-06-19T16:13:07.054406+00:00"},{"alias_kind":"pith_short_12","alias_value":"IO2OI7U3R7WA","created_at":"2026-06-19T16:13:07.054406+00:00"},{"alias_kind":"pith_short_16","alias_value":"IO2OI7U3R7WAYYCH","created_at":"2026-06-19T16:13:07.054406+00:00"},{"alias_kind":"pith_short_8","alias_value":"IO2OI7U3","created_at":"2026-06-19T16:13:07.054406+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/IO2OI7U3R7WAYYCHLYUETY6KHK","json":"https://pith.science/pith/IO2OI7U3R7WAYYCHLYUETY6KHK.json","graph_json":"https://pith.science/api/pith-number/IO2OI7U3R7WAYYCHLYUETY6KHK/graph.json","events_json":"https://pith.science/api/pith-number/IO2OI7U3R7WAYYCHLYUETY6KHK/events.json","paper":"https://pith.science/paper/IO2OI7U3"},"agent_actions":{"view_html":"https://pith.science/pith/IO2OI7U3R7WAYYCHLYUETY6KHK","download_json":"https://pith.science/pith/IO2OI7U3R7WAYYCHLYUETY6KHK.json","view_paper":"https://pith.science/paper/IO2OI7U3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.20256&json=true","fetch_graph":"https://pith.science/api/pith-number/IO2OI7U3R7WAYYCHLYUETY6KHK/graph.json","fetch_events":"https://pith.science/api/pith-number/IO2OI7U3R7WAYYCHLYUETY6KHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IO2OI7U3R7WAYYCHLYUETY6KHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IO2OI7U3R7WAYYCHLYUETY6KHK/action/storage_attestation","attest_author":"https://pith.science/pith/IO2OI7U3R7WAYYCHLYUETY6KHK/action/author_attestation","sign_citation":"https://pith.science/pith/IO2OI7U3R7WAYYCHLYUETY6KHK/action/citation_signature","submit_replication":"https://pith.science/pith/IO2OI7U3R7WAYYCHLYUETY6KHK/action/replication_record"}},"created_at":"2026-06-19T16:13:07.054406+00:00","updated_at":"2026-06-19T16:13:07.054406+00:00"}