{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MI5JEAY4PIMJU3RSPNMTTE5U6W","short_pith_number":"pith:MI5JEAY4","schema_version":"1.0","canonical_sha256":"623a92031c7a189a6e327b593993b4f589b055f603f36f046cea221efebceb4c","source":{"kind":"arxiv","id":"2306.01724","version":6},"attestation_state":"computed","paper":{"title":"The Graph Minor Structure Theorem through Bidimensionality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dimitrios M. Thilikos, Sebastian Wiederrecht","submitted_at":"2023-06-02T17:50:10Z","abstract_excerpt":"The bidimensionality of a set of vertices $X$ in a graph $G$ is the maximum $k$ for which $G$ contains as a $X$-rooted minor the $(k \\times k)$-grid. This notion allows for the following version of the Graph Minors Structure Theorem (GMST) that avoids the use of apices and vortices: $K_k$-minor free graphs are those that admit tree decompositions whose torsos contain sets of bounded bidimensionality whose removal yield a graph embeddable in some surface $\\Sigma$ of bounded Euler-genus. We next fix the target condition by demanding that $\\Sigma$ is some particular surface. This defines a \"surfa"},"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":"2306.01724","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-02T17:50:10Z","cross_cats_sorted":[],"title_canon_sha256":"000e14f56f1f4d206be908a65f327024dd8ab2f2875174ebe26840b0db285f26","abstract_canon_sha256":"181bae8556995fa08ea6e4300b148b56f294fa3b84c45de35ee68e19cfc4c06d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:31.770155Z","signature_b64":"Nck6b6fTHXv0GpZdvssAp4uNMQnWqditt5313fXCxIejgd6Bc9RDxZg84FMfhhTCPDW8ozxZ+ceCa5ijdRWQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"623a92031c7a189a6e327b593993b4f589b055f603f36f046cea221efebceb4c","last_reissued_at":"2026-05-27T01:05:31.769535Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:31.769535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Graph Minor Structure Theorem through Bidimensionality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dimitrios M. Thilikos, Sebastian Wiederrecht","submitted_at":"2023-06-02T17:50:10Z","abstract_excerpt":"The bidimensionality of a set of vertices $X$ in a graph $G$ is the maximum $k$ for which $G$ contains as a $X$-rooted minor the $(k \\times k)$-grid. This notion allows for the following version of the Graph Minors Structure Theorem (GMST) that avoids the use of apices and vortices: $K_k$-minor free graphs are those that admit tree decompositions whose torsos contain sets of bounded bidimensionality whose removal yield a graph embeddable in some surface $\\Sigma$ of bounded Euler-genus. We next fix the target condition by demanding that $\\Sigma$ is some particular surface. This defines a \"surfa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01724","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/2306.01724/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":"2306.01724","created_at":"2026-05-27T01:05:31.769621+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.01724v6","created_at":"2026-05-27T01:05:31.769621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01724","created_at":"2026-05-27T01:05:31.769621+00:00"},{"alias_kind":"pith_short_12","alias_value":"MI5JEAY4PIMJ","created_at":"2026-05-27T01:05:31.769621+00:00"},{"alias_kind":"pith_short_16","alias_value":"MI5JEAY4PIMJU3RS","created_at":"2026-05-27T01:05:31.769621+00:00"},{"alias_kind":"pith_short_8","alias_value":"MI5JEAY4","created_at":"2026-05-27T01:05:31.769621+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2304.14121","citing_title":"An Overview of Universal Obstructions for Graph Parameters","ref_index":135,"is_internal_anchor":true},{"citing_arxiv_id":"2507.10467","citing_title":"Colorful Minors","ref_index":89,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11112","citing_title":"A coarse Menger's Theorem for planar and bounded genus graphs","ref_index":51,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00192","citing_title":"Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MI5JEAY4PIMJU3RSPNMTTE5U6W","json":"https://pith.science/pith/MI5JEAY4PIMJU3RSPNMTTE5U6W.json","graph_json":"https://pith.science/api/pith-number/MI5JEAY4PIMJU3RSPNMTTE5U6W/graph.json","events_json":"https://pith.science/api/pith-number/MI5JEAY4PIMJU3RSPNMTTE5U6W/events.json","paper":"https://pith.science/paper/MI5JEAY4"},"agent_actions":{"view_html":"https://pith.science/pith/MI5JEAY4PIMJU3RSPNMTTE5U6W","download_json":"https://pith.science/pith/MI5JEAY4PIMJU3RSPNMTTE5U6W.json","view_paper":"https://pith.science/paper/MI5JEAY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.01724&json=true","fetch_graph":"https://pith.science/api/pith-number/MI5JEAY4PIMJU3RSPNMTTE5U6W/graph.json","fetch_events":"https://pith.science/api/pith-number/MI5JEAY4PIMJU3RSPNMTTE5U6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MI5JEAY4PIMJU3RSPNMTTE5U6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MI5JEAY4PIMJU3RSPNMTTE5U6W/action/storage_attestation","attest_author":"https://pith.science/pith/MI5JEAY4PIMJU3RSPNMTTE5U6W/action/author_attestation","sign_citation":"https://pith.science/pith/MI5JEAY4PIMJU3RSPNMTTE5U6W/action/citation_signature","submit_replication":"https://pith.science/pith/MI5JEAY4PIMJU3RSPNMTTE5U6W/action/replication_record"}},"created_at":"2026-05-27T01:05:31.769621+00:00","updated_at":"2026-05-27T01:05:31.769621+00:00"}