{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DAG34XGN6OM2LMEL4ZJTT6J6JK","short_pith_number":"pith:DAG34XGN","schema_version":"1.0","canonical_sha256":"180dbe5ccdf399a5b08be65339f93e4a9c6e6701669190772de1560fc5276176","source":{"kind":"arxiv","id":"2311.05066","version":4},"attestation_state":"computed","paper":{"title":"Induced subgraphs and tree decompositions XIII. Basic obstructions in $\\mathcal{H}$-free graphs for finite $\\mathcal{H}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl","submitted_at":"2023-11-09T00:04:35Z","abstract_excerpt":"Unlike minors, the induced subgraph obstructions to bounded treewidth come in a large variety, including, for every $t\\geq 1$, the $t$-basic obstructions: the graphs $K_{t+1}$ and $K_{t,t}$, along with the subdivisions of the $t$-by-$t$ wall and their line graphs. But this list is far from complete. The simplest example of a ''non-basic'' obstruction is due to Pohoata and Davies (independently). For every $n \\geq 1$, they construct certain graphs of treewidth $n$ and with no $3$-basic obstruction as an induced subgraph, which we call $n$-arrays. Let us say a graph class $\\mathcal{G}$ is clean "},"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":"2311.05066","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-09T00:04:35Z","cross_cats_sorted":[],"title_canon_sha256":"4a18cf3cd1e529e5fec5d53b5f2253ba67c153af45d2b663af02cbffd1fec6c5","abstract_canon_sha256":"ae0e7f8cfe610db36b634ac0b29ae02fcec5031274b714cb2e7ec8a09de733d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:29.594144Z","signature_b64":"lAhWt3LrAJ/YGbQWekkILIBoSHAWnKVarcLO7iIsOSt/3O8kyTwfOY/4RHHjQOEebeLP0a/4OM0ita0m6mZbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"180dbe5ccdf399a5b08be65339f93e4a9c6e6701669190772de1560fc5276176","last_reissued_at":"2026-07-05T09:41:29.593711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:29.593711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced subgraphs and tree decompositions XIII. Basic obstructions in $\\mathcal{H}$-free graphs for finite $\\mathcal{H}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl","submitted_at":"2023-11-09T00:04:35Z","abstract_excerpt":"Unlike minors, the induced subgraph obstructions to bounded treewidth come in a large variety, including, for every $t\\geq 1$, the $t$-basic obstructions: the graphs $K_{t+1}$ and $K_{t,t}$, along with the subdivisions of the $t$-by-$t$ wall and their line graphs. But this list is far from complete. The simplest example of a ''non-basic'' obstruction is due to Pohoata and Davies (independently). For every $n \\geq 1$, they construct certain graphs of treewidth $n$ and with no $3$-basic obstruction as an induced subgraph, which we call $n$-arrays. Let us say a graph class $\\mathcal{G}$ is clean "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05066","kind":"arxiv","version":4},"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/2311.05066/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":"2311.05066","created_at":"2026-07-05T09:41:29.593768+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.05066v4","created_at":"2026-07-05T09:41:29.593768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05066","created_at":"2026-07-05T09:41:29.593768+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAG34XGN6OM2","created_at":"2026-07-05T09:41:29.593768+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAG34XGN6OM2LMEL","created_at":"2026-07-05T09:41:29.593768+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAG34XGN","created_at":"2026-07-05T09:41:29.593768+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08829","citing_title":"Excluding an induced wheel minor in graphs without large induced stars","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DAG34XGN6OM2LMEL4ZJTT6J6JK","json":"https://pith.science/pith/DAG34XGN6OM2LMEL4ZJTT6J6JK.json","graph_json":"https://pith.science/api/pith-number/DAG34XGN6OM2LMEL4ZJTT6J6JK/graph.json","events_json":"https://pith.science/api/pith-number/DAG34XGN6OM2LMEL4ZJTT6J6JK/events.json","paper":"https://pith.science/paper/DAG34XGN"},"agent_actions":{"view_html":"https://pith.science/pith/DAG34XGN6OM2LMEL4ZJTT6J6JK","download_json":"https://pith.science/pith/DAG34XGN6OM2LMEL4ZJTT6J6JK.json","view_paper":"https://pith.science/paper/DAG34XGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.05066&json=true","fetch_graph":"https://pith.science/api/pith-number/DAG34XGN6OM2LMEL4ZJTT6J6JK/graph.json","fetch_events":"https://pith.science/api/pith-number/DAG34XGN6OM2LMEL4ZJTT6J6JK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAG34XGN6OM2LMEL4ZJTT6J6JK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAG34XGN6OM2LMEL4ZJTT6J6JK/action/storage_attestation","attest_author":"https://pith.science/pith/DAG34XGN6OM2LMEL4ZJTT6J6JK/action/author_attestation","sign_citation":"https://pith.science/pith/DAG34XGN6OM2LMEL4ZJTT6J6JK/action/citation_signature","submit_replication":"https://pith.science/pith/DAG34XGN6OM2LMEL4ZJTT6J6JK/action/replication_record"}},"created_at":"2026-07-05T09:41:29.593768+00:00","updated_at":"2026-07-05T09:41:29.593768+00:00"}