{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SURCLAU7YVMNJK46XFYKXJCWGT","short_pith_number":"pith:SURCLAU7","schema_version":"1.0","canonical_sha256":"952225829fc558d4ab9eb970aba45634db0a0535c1d58b8332210b8ca317d322","source":{"kind":"arxiv","id":"1305.6577","version":5},"attestation_state":"computed","paper":{"title":"Polynomial Bounds for the Grid-Minor Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Julia Chuzhoy","submitted_at":"2013-05-28T18:27:20Z","abstract_excerpt":"One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid $H$, every graph whose treewidth is large enough relative to $|V(H)|$ contains $H$ as a minor. This theorem has found many applications in graph theory and algorithms. Let $f(k)$ denote the largest value such that every graph of treewidth $k$ contains a grid minor of size $(f(k)\\times f(k))$. The best previous quantitative bound, due to recent work of Kawarabayashi and Kobayashi, and Leaf and Seymour, shows that"},"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":"1305.6577","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-28T18:27:20Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"64fd4538560a991b7d433492b4162ab8004ae93014b5e837ae25abaf09f7ec64","abstract_canon_sha256":"3788a002b526cb7c425dd50fa5c2685e6e60093a255d7fa80e5933690b0ce4d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:32.697759Z","signature_b64":"k/7bPnS944V9PuIIZDlREKA9zttVtVuXoE4Bb8ogqviMY94IwhCiE09V4yIivUR968V9m/weL0PXeEZyqNMVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"952225829fc558d4ab9eb970aba45634db0a0535c1d58b8332210b8ca317d322","last_reissued_at":"2026-05-18T01:09:32.697371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:32.697371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Bounds for the Grid-Minor Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Julia Chuzhoy","submitted_at":"2013-05-28T18:27:20Z","abstract_excerpt":"One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid $H$, every graph whose treewidth is large enough relative to $|V(H)|$ contains $H$ as a minor. This theorem has found many applications in graph theory and algorithms. Let $f(k)$ denote the largest value such that every graph of treewidth $k$ contains a grid minor of size $(f(k)\\times f(k))$. The best previous quantitative bound, due to recent work of Kawarabayashi and Kobayashi, and Leaf and Seymour, shows that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6577","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1305.6577","created_at":"2026-05-18T01:09:32.697426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6577v5","created_at":"2026-05-18T01:09:32.697426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6577","created_at":"2026-05-18T01:09:32.697426+00:00"},{"alias_kind":"pith_short_12","alias_value":"SURCLAU7YVMN","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SURCLAU7YVMNJK46","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SURCLAU7","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SURCLAU7YVMNJK46XFYKXJCWGT","json":"https://pith.science/pith/SURCLAU7YVMNJK46XFYKXJCWGT.json","graph_json":"https://pith.science/api/pith-number/SURCLAU7YVMNJK46XFYKXJCWGT/graph.json","events_json":"https://pith.science/api/pith-number/SURCLAU7YVMNJK46XFYKXJCWGT/events.json","paper":"https://pith.science/paper/SURCLAU7"},"agent_actions":{"view_html":"https://pith.science/pith/SURCLAU7YVMNJK46XFYKXJCWGT","download_json":"https://pith.science/pith/SURCLAU7YVMNJK46XFYKXJCWGT.json","view_paper":"https://pith.science/paper/SURCLAU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6577&json=true","fetch_graph":"https://pith.science/api/pith-number/SURCLAU7YVMNJK46XFYKXJCWGT/graph.json","fetch_events":"https://pith.science/api/pith-number/SURCLAU7YVMNJK46XFYKXJCWGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SURCLAU7YVMNJK46XFYKXJCWGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SURCLAU7YVMNJK46XFYKXJCWGT/action/storage_attestation","attest_author":"https://pith.science/pith/SURCLAU7YVMNJK46XFYKXJCWGT/action/author_attestation","sign_citation":"https://pith.science/pith/SURCLAU7YVMNJK46XFYKXJCWGT/action/citation_signature","submit_replication":"https://pith.science/pith/SURCLAU7YVMNJK46XFYKXJCWGT/action/replication_record"}},"created_at":"2026-05-18T01:09:32.697426+00:00","updated_at":"2026-05-18T01:09:32.697426+00:00"}