{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BWO7XARCYQMO7CDQ7FJHM2MGNE","short_pith_number":"pith:BWO7XARC","schema_version":"1.0","canonical_sha256":"0d9dfb8222c418ef8870f9527669866916533f864d46fec70bf6a38eccd3e041","source":{"kind":"arxiv","id":"2104.06627","version":6},"attestation_state":"computed","paper":{"title":"Product structure of graphs with an excluded minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, David R. Wood, Freddie Illingworth","submitted_at":"2021-04-14T05:11:39Z","abstract_excerpt":"This paper shows that $K_t$-minor-free (and $K_{s, t}$-minor-free) graphs $G$ are subgraphs of products of a tree-like graph $H$ (of bounded treewidth) and a complete graph $K_m$. Our results include optimal bounds on the treewidth of $H$ and optimal bounds (to within a constant factor) on $m$ in terms of the number of vertices of $G$ and the treewidth of $G$. These results follow from a more general theorem whose corollaries include a strengthening of the celebrated separator theorem of Alon, Seymour, and Thomas [J. Amer. Math. Soc. 1990] and the Planar Graph Product Structure Theorem of Dujm"},"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":"2104.06627","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-04-14T05:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"a458adc1d955da924932f5e9e1d7e1ac9e8e8b4f95db079f14d1882ba6d25af2","abstract_canon_sha256":"a4c298de6d2d85288897ddf6ba91c60677eaff40337ef9440271d65df4dd4a7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:38.073845Z","signature_b64":"ncYgzrEIJWUnctmpEZTub8IKK5opn+HXrv+KbmDDWJcXjtgdEGkCyvC5wRo7wJLlU9C6ziIRgQzLgTdqjsDKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9dfb8222c418ef8870f9527669866916533f864d46fec70bf6a38eccd3e041","last_reissued_at":"2026-07-05T09:32:38.073362Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:38.073362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Product structure of graphs with an excluded minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, David R. Wood, Freddie Illingworth","submitted_at":"2021-04-14T05:11:39Z","abstract_excerpt":"This paper shows that $K_t$-minor-free (and $K_{s, t}$-minor-free) graphs $G$ are subgraphs of products of a tree-like graph $H$ (of bounded treewidth) and a complete graph $K_m$. Our results include optimal bounds on the treewidth of $H$ and optimal bounds (to within a constant factor) on $m$ in terms of the number of vertices of $G$ and the treewidth of $G$. These results follow from a more general theorem whose corollaries include a strengthening of the celebrated separator theorem of Alon, Seymour, and Thomas [J. Amer. Math. Soc. 1990] and the Planar Graph Product Structure Theorem of Dujm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.06627","kind":"arxiv","version":6},"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/2104.06627/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":"2104.06627","created_at":"2026-07-05T09:32:38.073422+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.06627v6","created_at":"2026-07-05T09:32:38.073422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.06627","created_at":"2026-07-05T09:32:38.073422+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWO7XARCYQMO","created_at":"2026-07-05T09:32:38.073422+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWO7XARCYQMO7CDQ","created_at":"2026-07-05T09:32:38.073422+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWO7XARC","created_at":"2026-07-05T09:32:38.073422+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01927","citing_title":"Short Paths in the Planar Graph Product Structure Theorem","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWO7XARCYQMO7CDQ7FJHM2MGNE","json":"https://pith.science/pith/BWO7XARCYQMO7CDQ7FJHM2MGNE.json","graph_json":"https://pith.science/api/pith-number/BWO7XARCYQMO7CDQ7FJHM2MGNE/graph.json","events_json":"https://pith.science/api/pith-number/BWO7XARCYQMO7CDQ7FJHM2MGNE/events.json","paper":"https://pith.science/paper/BWO7XARC"},"agent_actions":{"view_html":"https://pith.science/pith/BWO7XARCYQMO7CDQ7FJHM2MGNE","download_json":"https://pith.science/pith/BWO7XARCYQMO7CDQ7FJHM2MGNE.json","view_paper":"https://pith.science/paper/BWO7XARC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.06627&json=true","fetch_graph":"https://pith.science/api/pith-number/BWO7XARCYQMO7CDQ7FJHM2MGNE/graph.json","fetch_events":"https://pith.science/api/pith-number/BWO7XARCYQMO7CDQ7FJHM2MGNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWO7XARCYQMO7CDQ7FJHM2MGNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWO7XARCYQMO7CDQ7FJHM2MGNE/action/storage_attestation","attest_author":"https://pith.science/pith/BWO7XARCYQMO7CDQ7FJHM2MGNE/action/author_attestation","sign_citation":"https://pith.science/pith/BWO7XARCYQMO7CDQ7FJHM2MGNE/action/citation_signature","submit_replication":"https://pith.science/pith/BWO7XARCYQMO7CDQ7FJHM2MGNE/action/replication_record"}},"created_at":"2026-07-05T09:32:38.073422+00:00","updated_at":"2026-07-05T09:32:38.073422+00:00"}