{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SURCLAU7YVMNJK46XFYKXJCWGT","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":"3788a002b526cb7c425dd50fa5c2685e6e60093a255d7fa80e5933690b0ce4d1","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-28T18:27:20Z","title_canon_sha256":"64fd4538560a991b7d433492b4162ab8004ae93014b5e837ae25abaf09f7ec64"},"schema_version":"1.0","source":{"id":"1305.6577","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6577","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6577v5","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6577","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"SURCLAU7YVMN","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SURCLAU7YVMNJK46","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SURCLAU7","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:4c6c79a4a0d44b0f265b4aab90197f0b3310fed8b205f05ceeb61615937becea","target":"graph","created_at":"2026-05-18T01:09:32Z","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"},"paper":{"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","authors_text":"Chandra Chekuri, Julia Chuzhoy","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-28T18:27:20Z","title":"Polynomial Bounds for the Grid-Minor Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6577","kind":"arxiv","version":5},"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:b53a6c500db9f9cd791da06596ff1f4b40ae70cab242e12f7ccb1f0d25ea8472","target":"record","created_at":"2026-05-18T01:09:32Z","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":"3788a002b526cb7c425dd50fa5c2685e6e60093a255d7fa80e5933690b0ce4d1","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-28T18:27:20Z","title_canon_sha256":"64fd4538560a991b7d433492b4162ab8004ae93014b5e837ae25abaf09f7ec64"},"schema_version":"1.0","source":{"id":"1305.6577","kind":"arxiv","version":5}},"canonical_sha256":"952225829fc558d4ab9eb970aba45634db0a0535c1d58b8332210b8ca317d322","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"952225829fc558d4ab9eb970aba45634db0a0535c1d58b8332210b8ca317d322","first_computed_at":"2026-05-18T01:09:32.697371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:32.697371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k/7bPnS944V9PuIIZDlREKA9zttVtVuXoE4Bb8ogqviMY94IwhCiE09V4yIivUR968V9m/weL0PXeEZyqNMVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:32.697759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6577","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b53a6c500db9f9cd791da06596ff1f4b40ae70cab242e12f7ccb1f0d25ea8472","sha256:4c6c79a4a0d44b0f265b4aab90197f0b3310fed8b205f05ceeb61615937becea"],"state_sha256":"6bf626d876c385e4615fd253868ad9739a6d67a6d39f799060253806be4e7c7a"}