{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GEYUARCAKYXHPVSHDEULGV7SHD","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":"1c226e916aec0b0b578fc1f02f0225d16112ef02fada9852d394e4e16e9f7094","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T17:27:37Z","title_canon_sha256":"bfbc597e73bc9d3abf67374045489b6f4c6923daa23bb615af152c95873b46b5"},"schema_version":"1.0","source":{"id":"2501.14658","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.14658","created_at":"2026-07-05T10:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"2501.14658v2","created_at":"2026-07-05T10:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14658","created_at":"2026-07-05T10:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"GEYUARCAKYXH","created_at":"2026-07-05T10:10:48Z"},{"alias_kind":"pith_short_16","alias_value":"GEYUARCAKYXHPVSH","created_at":"2026-07-05T10:10:48Z"},{"alias_kind":"pith_short_8","alias_value":"GEYUARCA","created_at":"2026-07-05T10:10:48Z"}],"graph_snapshots":[{"event_id":"sha256:786c1c70e2f8a146ce55935076b2c1a51dae8c14c6941c63392453fcd995084d","target":"graph","created_at":"2026-07-05T10:10:48Z","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/2501.14658/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a family $\\mathcal{H}$ of graphs, we say that a graph $G$ is $\\mathcal{H}$-free if no induced subgraph of $G$ is isomorphic to a member of $\\mathcal{H}$. Let $S_{t,t,t}$ be the graph obtained from $K_{1,3}$ by subdividing each edge $t-1$ times, and let $W_{t\\times t}$ be the $t$-by-$t$ hexagonal grid. Let $\\mathcal{L}_t$ be the family of all graphs $G$ such that $G$ is the line graph of some subdivision of $W_{t \\times t}$. We prove that for every positive integer $t$ there exists $c(t)$ such that every $\\mathcal{L}_t \\cup \\{S_{t,t,t}, K_{t,t}\\}$-free $n$-vertex graph admits a tree decom","authors_text":"Daniel Lokshtanov, Julien Codsi, Maria Chudnovsky, Martin Milani\\v{c}, Varun Sivashankar","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T17:27:37Z","title":"Tree independence number V. Walls and claws"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14658","kind":"arxiv","version":2},"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:3fc307a2b64b82112c9eb9118a24f0a06cbdd5db7e6e511e047d655a08138ef6","target":"record","created_at":"2026-07-05T10:10:48Z","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":"1c226e916aec0b0b578fc1f02f0225d16112ef02fada9852d394e4e16e9f7094","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T17:27:37Z","title_canon_sha256":"bfbc597e73bc9d3abf67374045489b6f4c6923daa23bb615af152c95873b46b5"},"schema_version":"1.0","source":{"id":"2501.14658","kind":"arxiv","version":2}},"canonical_sha256":"3131404440562e77d6471928b357f238e35569453eee4b0a12213d588c41581a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3131404440562e77d6471928b357f238e35569453eee4b0a12213d588c41581a","first_computed_at":"2026-07-05T10:10:48.238670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:10:48.238670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YHcpwBPEZQHOwI6Mz1ilaQlqAQh89NBu9SWFRhdxa5r6sxIkxJWwcCUrUpguWggRpIhPtHBvZENNBY12VWI4BA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:10:48.239107Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.14658","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fc307a2b64b82112c9eb9118a24f0a06cbdd5db7e6e511e047d655a08138ef6","sha256:786c1c70e2f8a146ce55935076b2c1a51dae8c14c6941c63392453fcd995084d"],"state_sha256":"6edb9497c0e94895f2efcd158390dceb858fe2d996cc411e1842b1829cef57a7"}