{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZFG5N3C5TGE6BRJPOMOREGX66V","short_pith_number":"pith:ZFG5N3C5","schema_version":"1.0","canonical_sha256":"c94dd6ec5d9989e0c52f731d121afef57cc1f2265330ca90e156260585eb300f","source":{"kind":"arxiv","id":"1901.07944","version":1},"attestation_state":"computed","paper":{"title":"Towards Tight(er) Bounds for the Excluded Grid Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Julia Chuzhoy, Zihan Tan","submitted_at":"2019-01-23T15:22:32Z","abstract_excerpt":"We study the Excluded Grid Theorem, a fundamental structural result in graph theory, that was proved by Robertson and Seymour in their seminal work on graph minors. The theorem states that there is a function $f: \\mathbb{Z}^+ \\to \\mathbb{Z}^+$, such that for every integer $g>0$, every graph of treewidth at least $f(g)$ contains the $(g\\times g)$-grid as a minor. For every integer $g>0$, let $f(g)$ be the smallest value for which the theorem holds. Establishing tight bounds on $f(g)$ is an important graph-theoretic question. Robertson and Seymour showed that $f(g)=\\Omega(g^2\\log g)$ must hold. "},"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":"1901.07944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-01-23T15:22:32Z","cross_cats_sorted":[],"title_canon_sha256":"119dc6ddf1eb359df0acf229ed8d7751feb39b2422b74d84e37d23298e9c780f","abstract_canon_sha256":"1b4e2463d6819f33c4bda9b531835c8ef1771bf99634c63e98e843e5c2ab90aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:39.442932Z","signature_b64":"HaNegTmBgXnJPd0oILtVcGJkmzNuj3tH6oZ4D/UCeaC6AOnYmQQr5Z+tT3ShPaILSY+luFgtOM94m9s+iIauAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c94dd6ec5d9989e0c52f731d121afef57cc1f2265330ca90e156260585eb300f","last_reissued_at":"2026-05-17T23:55:39.442504Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:39.442504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Tight(er) Bounds for the Excluded Grid Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Julia Chuzhoy, Zihan Tan","submitted_at":"2019-01-23T15:22:32Z","abstract_excerpt":"We study the Excluded Grid Theorem, a fundamental structural result in graph theory, that was proved by Robertson and Seymour in their seminal work on graph minors. The theorem states that there is a function $f: \\mathbb{Z}^+ \\to \\mathbb{Z}^+$, such that for every integer $g>0$, every graph of treewidth at least $f(g)$ contains the $(g\\times g)$-grid as a minor. For every integer $g>0$, let $f(g)$ be the smallest value for which the theorem holds. Establishing tight bounds on $f(g)$ is an important graph-theoretic question. Robertson and Seymour showed that $f(g)=\\Omega(g^2\\log g)$ must hold. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07944","kind":"arxiv","version":1},"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":"1901.07944","created_at":"2026-05-17T23:55:39.442568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07944v1","created_at":"2026-05-17T23:55:39.442568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07944","created_at":"2026-05-17T23:55:39.442568+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFG5N3C5TGE6","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFG5N3C5TGE6BRJP","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFG5N3C5","created_at":"2026-05-18T12:33:33.725879+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/ZFG5N3C5TGE6BRJPOMOREGX66V","json":"https://pith.science/pith/ZFG5N3C5TGE6BRJPOMOREGX66V.json","graph_json":"https://pith.science/api/pith-number/ZFG5N3C5TGE6BRJPOMOREGX66V/graph.json","events_json":"https://pith.science/api/pith-number/ZFG5N3C5TGE6BRJPOMOREGX66V/events.json","paper":"https://pith.science/paper/ZFG5N3C5"},"agent_actions":{"view_html":"https://pith.science/pith/ZFG5N3C5TGE6BRJPOMOREGX66V","download_json":"https://pith.science/pith/ZFG5N3C5TGE6BRJPOMOREGX66V.json","view_paper":"https://pith.science/paper/ZFG5N3C5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07944&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFG5N3C5TGE6BRJPOMOREGX66V/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFG5N3C5TGE6BRJPOMOREGX66V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFG5N3C5TGE6BRJPOMOREGX66V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFG5N3C5TGE6BRJPOMOREGX66V/action/storage_attestation","attest_author":"https://pith.science/pith/ZFG5N3C5TGE6BRJPOMOREGX66V/action/author_attestation","sign_citation":"https://pith.science/pith/ZFG5N3C5TGE6BRJPOMOREGX66V/action/citation_signature","submit_replication":"https://pith.science/pith/ZFG5N3C5TGE6BRJPOMOREGX66V/action/replication_record"}},"created_at":"2026-05-17T23:55:39.442568+00:00","updated_at":"2026-05-17T23:55:39.442568+00:00"}