{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZVMGMHBMWFHT2TB2HKOXANOMDT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"84f11f93b9be88ffec5e775a8494e0e2c3f3ea098096d38fe59975a26be0696d","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-04T09:00:07Z","title_canon_sha256":"f6108ebafc84541390378baf9f3e3f30c8c40fbf034b78d1b8da91ae48bee5ad"},"schema_version":"1.0","source":{"id":"2509.04026","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.04026","created_at":"2026-07-05T12:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"2509.04026v1","created_at":"2026-07-05T12:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04026","created_at":"2026-07-05T12:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZVMGMHBMWFHT","created_at":"2026-07-05T12:04:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZVMGMHBMWFHT2TB2","created_at":"2026-07-05T12:04:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZVMGMHBM","created_at":"2026-07-05T12:04:52Z"}],"graph_snapshots":[{"event_id":"sha256:2f65778d719689ef56f8c94704b09b96e556da916dee167964414e1bc0900e9b","target":"graph","created_at":"2026-07-05T12:04:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.04026/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mujin Choi, Sebastian Wiederrecht","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-04T09:00:07Z","title":"Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04026","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:23f2a62641202e874cfc0ffa7aba55498b31c7e79fa3beec364ed2c93c01cc53","target":"record","created_at":"2026-07-05T12:04:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"84f11f93b9be88ffec5e775a8494e0e2c3f3ea098096d38fe59975a26be0696d","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-04T09:00:07Z","title_canon_sha256":"f6108ebafc84541390378baf9f3e3f30c8c40fbf034b78d1b8da91ae48bee5ad"},"schema_version":"1.0","source":{"id":"2509.04026","kind":"arxiv","version":1}},"canonical_sha256":"cd58661c2cb14f3d4c3a3a9d7035cc1cd1d7106dbea2a505d9bb66ccedb5ae77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd58661c2cb14f3d4c3a3a9d7035cc1cd1d7106dbea2a505d9bb66ccedb5ae77","first_computed_at":"2026-07-05T12:04:52.061988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:04:52.061988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wLt/YDfjAAMlrm7yh6krIuexjKAZRjLdNvKQjRTCXde48O5J6+jJfB+Vwm28S9Cz3kGYNbrkMcd8HEqRC2L4BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:04:52.062488Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.04026","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23f2a62641202e874cfc0ffa7aba55498b31c7e79fa3beec364ed2c93c01cc53","sha256:2f65778d719689ef56f8c94704b09b96e556da916dee167964414e1bc0900e9b"],"state_sha256":"d9286378f38a9906859aff11da016b3db3f6f1d2b4594b722b6f0327da68cd53"}