{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DAG34XGN6OM2LMEL4ZJTT6J6JK","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":"ae0e7f8cfe610db36b634ac0b29ae02fcec5031274b714cb2e7ec8a09de733d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-09T00:04:35Z","title_canon_sha256":"4a18cf3cd1e529e5fec5d53b5f2253ba67c153af45d2b663af02cbffd1fec6c5"},"schema_version":"1.0","source":{"id":"2311.05066","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.05066","created_at":"2026-07-05T09:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"2311.05066v4","created_at":"2026-07-05T09:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05066","created_at":"2026-07-05T09:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"DAG34XGN6OM2","created_at":"2026-07-05T09:41:29Z"},{"alias_kind":"pith_short_16","alias_value":"DAG34XGN6OM2LMEL","created_at":"2026-07-05T09:41:29Z"},{"alias_kind":"pith_short_8","alias_value":"DAG34XGN","created_at":"2026-07-05T09:41:29Z"}],"graph_snapshots":[{"event_id":"sha256:18139d989fadc690ca8ce951cfcc3a441420cdad17a350c79545759bab8c618f","target":"graph","created_at":"2026-07-05T09:41:29Z","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/2311.05066/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-09T00:04:35Z","title":"Induced subgraphs and tree decompositions XIII. Basic obstructions in $\\mathcal{H}$-free graphs for finite $\\mathcal{H}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05066","kind":"arxiv","version":4},"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:30044b4332a80279a650d0ebe12a313609f05aa29265f1bdb752ccb5446c597c","target":"record","created_at":"2026-07-05T09:41:29Z","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":"ae0e7f8cfe610db36b634ac0b29ae02fcec5031274b714cb2e7ec8a09de733d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-09T00:04:35Z","title_canon_sha256":"4a18cf3cd1e529e5fec5d53b5f2253ba67c153af45d2b663af02cbffd1fec6c5"},"schema_version":"1.0","source":{"id":"2311.05066","kind":"arxiv","version":4}},"canonical_sha256":"180dbe5ccdf399a5b08be65339f93e4a9c6e6701669190772de1560fc5276176","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"180dbe5ccdf399a5b08be65339f93e4a9c6e6701669190772de1560fc5276176","first_computed_at":"2026-07-05T09:41:29.593711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:29.593711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lAhWt3LrAJ/YGbQWekkILIBoSHAWnKVarcLO7iIsOSt/3O8kyTwfOY/4RHHjQOEebeLP0a/4OM0ita0m6mZbAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:29.594144Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.05066","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30044b4332a80279a650d0ebe12a313609f05aa29265f1bdb752ccb5446c597c","sha256:18139d989fadc690ca8ce951cfcc3a441420cdad17a350c79545759bab8c618f"],"state_sha256":"2672cd3ddf6e0f273be4be9073dd3ee364ce954514c2255feb99ecdf112fb24a"}