{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QVNMRRESZGSARNUWA23MH42BMN","short_pith_number":"pith:QVNMRRES","schema_version":"1.0","canonical_sha256":"855ac8c492c9a408b69606b6c3f341635f045b73ce14aa874aef5c3e889fbfa5","source":{"kind":"arxiv","id":"2307.02816","version":2},"attestation_state":"computed","paper":{"title":"The grid-minor theorem revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Cl\\'ement Rambaud, David R. Wood, Gwena\\\"el Joret, Hoang La, J\\k{e}drzej Hodor, Pat Morin, Piotr Micek, Robert Hickingbotham, Vida Dujmovi\\'c","submitted_at":"2023-07-06T07:20:44Z","abstract_excerpt":"We prove that for every planar graph $X$ of treedepth $h$, there exists a positive integer $c$ such that for every $X$-minor-free graph $G$, there exists a graph $H$ of treewidth at most $f(h)$ such that $G$ is isomorphic to a subgraph of $H\\boxtimes K_c$. This is a qualitative strengthening of the Grid-Minor Theorem of Robertson and Seymour (JCTB 1986), and treedepth is the optimal parameter in such a result. As an example application, we use this result to improve the upper bound for weak coloring numbers of graphs excluding a fixed graph as a minor."},"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":"2307.02816","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-06T07:20:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3d283c9bc5cf9ff55ce8572d215c7856dcccb11368ec1944263af5ddd4282ba7","abstract_canon_sha256":"5b5b16e542166afc276b639909462ed1986c21e62c9ac57073f2c24359b282e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:44.620714Z","signature_b64":"d9ncDdYKGapTOosMcRx0S5+SLdkT2WVM/Pc+FROtffv8zN9K6qQuQ21TUHDqpRJdWL4SPju4XByLEdnhk2geAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"855ac8c492c9a408b69606b6c3f341635f045b73ce14aa874aef5c3e889fbfa5","last_reissued_at":"2026-06-02T02:04:44.620233Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:44.620233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The grid-minor theorem revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Cl\\'ement Rambaud, David R. Wood, Gwena\\\"el Joret, Hoang La, J\\k{e}drzej Hodor, Pat Morin, Piotr Micek, Robert Hickingbotham, Vida Dujmovi\\'c","submitted_at":"2023-07-06T07:20:44Z","abstract_excerpt":"We prove that for every planar graph $X$ of treedepth $h$, there exists a positive integer $c$ such that for every $X$-minor-free graph $G$, there exists a graph $H$ of treewidth at most $f(h)$ such that $G$ is isomorphic to a subgraph of $H\\boxtimes K_c$. This is a qualitative strengthening of the Grid-Minor Theorem of Robertson and Seymour (JCTB 1986), and treedepth is the optimal parameter in such a result. As an example application, we use this result to improve the upper bound for weak coloring numbers of graphs excluding a fixed graph as a minor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.02816","kind":"arxiv","version":2},"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/2307.02816/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":"2307.02816","created_at":"2026-06-02T02:04:44.620293+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.02816v2","created_at":"2026-06-02T02:04:44.620293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.02816","created_at":"2026-06-02T02:04:44.620293+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVNMRRESZGSA","created_at":"2026-06-02T02:04:44.620293+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVNMRRESZGSARNUW","created_at":"2026-06-02T02:04:44.620293+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVNMRRES","created_at":"2026-06-02T02:04:44.620293+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.02949","citing_title":"Sample compression schemes for balls in structurally sparse graphs","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QVNMRRESZGSARNUWA23MH42BMN","json":"https://pith.science/pith/QVNMRRESZGSARNUWA23MH42BMN.json","graph_json":"https://pith.science/api/pith-number/QVNMRRESZGSARNUWA23MH42BMN/graph.json","events_json":"https://pith.science/api/pith-number/QVNMRRESZGSARNUWA23MH42BMN/events.json","paper":"https://pith.science/paper/QVNMRRES"},"agent_actions":{"view_html":"https://pith.science/pith/QVNMRRESZGSARNUWA23MH42BMN","download_json":"https://pith.science/pith/QVNMRRESZGSARNUWA23MH42BMN.json","view_paper":"https://pith.science/paper/QVNMRRES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.02816&json=true","fetch_graph":"https://pith.science/api/pith-number/QVNMRRESZGSARNUWA23MH42BMN/graph.json","fetch_events":"https://pith.science/api/pith-number/QVNMRRESZGSARNUWA23MH42BMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVNMRRESZGSARNUWA23MH42BMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVNMRRESZGSARNUWA23MH42BMN/action/storage_attestation","attest_author":"https://pith.science/pith/QVNMRRESZGSARNUWA23MH42BMN/action/author_attestation","sign_citation":"https://pith.science/pith/QVNMRRESZGSARNUWA23MH42BMN/action/citation_signature","submit_replication":"https://pith.science/pith/QVNMRRESZGSARNUWA23MH42BMN/action/replication_record"}},"created_at":"2026-06-02T02:04:44.620293+00:00","updated_at":"2026-06-02T02:04:44.620293+00:00"}