{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SI5UJD45NVDYR77QCIZ6GL6GF5","short_pith_number":"pith:SI5UJD45","schema_version":"1.0","canonical_sha256":"923b448f9d6d4788fff01233e32fc62f55ae682cef5442d3e4b191b1b0b772c7","source":{"kind":"arxiv","id":"2605.21015","version":1},"attestation_state":"computed","paper":{"title":"Treewidth of the $n \\times n$ toroidal grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Hiraku Morimoto, Tatsuya Gima, Yota Otachi, Yuto Okada","submitted_at":"2026-05-20T10:50:16Z","abstract_excerpt":"In this paper, we show that the treewidth of the $n \\times n$ toroidal grid is $2n-1$ for all $n \\ge 5$. This closes the gap between the previously known upper bound of $2n-1$ (Ellis and Warren, DAM 2008) and the lower bound of $2n-2$ (Kiyomi, Okamoto, and Otachi, DAM 2016). To establish the matching lower bound, we construct a bramble of maximum order by utilizing maximum components obtained after removing $2n-1$ vertices. Our construction relies on the vertex-isoperimetric properties of the infinite grid to establish tight lower bounds on neighborhood sizes, combined with a careful analysis "},"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":"2605.21015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T10:50:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f68afcbf5fccf1a8e0304b6aedec6ad508e0d63f99ad4820b8e705e82a54e78a","abstract_canon_sha256":"60f91b913787cce2c27e5ae35771c444a29f14df1f7d23b4cd0f4805626373d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:32.410460Z","signature_b64":"n/R0lJT7vljHHMFMYUE3bYw3l1/jui8e8sV1cqNDiRHVjyMWTyUljFrfYr+NAtkC3AcRv6crKjdo9b0Mg5NIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"923b448f9d6d4788fff01233e32fc62f55ae682cef5442d3e4b191b1b0b772c7","last_reissued_at":"2026-05-21T01:05:32.409635Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:32.409635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Treewidth of the $n \\times n$ toroidal grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Hiraku Morimoto, Tatsuya Gima, Yota Otachi, Yuto Okada","submitted_at":"2026-05-20T10:50:16Z","abstract_excerpt":"In this paper, we show that the treewidth of the $n \\times n$ toroidal grid is $2n-1$ for all $n \\ge 5$. This closes the gap between the previously known upper bound of $2n-1$ (Ellis and Warren, DAM 2008) and the lower bound of $2n-2$ (Kiyomi, Okamoto, and Otachi, DAM 2016). To establish the matching lower bound, we construct a bramble of maximum order by utilizing maximum components obtained after removing $2n-1$ vertices. Our construction relies on the vertex-isoperimetric properties of the infinite grid to establish tight lower bounds on neighborhood sizes, combined with a careful analysis "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21015","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21015/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":"2605.21015","created_at":"2026-05-21T01:05:32.409758+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21015v1","created_at":"2026-05-21T01:05:32.409758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21015","created_at":"2026-05-21T01:05:32.409758+00:00"},{"alias_kind":"pith_short_12","alias_value":"SI5UJD45NVDY","created_at":"2026-05-21T01:05:32.409758+00:00"},{"alias_kind":"pith_short_16","alias_value":"SI5UJD45NVDYR77Q","created_at":"2026-05-21T01:05:32.409758+00:00"},{"alias_kind":"pith_short_8","alias_value":"SI5UJD45","created_at":"2026-05-21T01:05:32.409758+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/SI5UJD45NVDYR77QCIZ6GL6GF5","json":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5.json","graph_json":"https://pith.science/api/pith-number/SI5UJD45NVDYR77QCIZ6GL6GF5/graph.json","events_json":"https://pith.science/api/pith-number/SI5UJD45NVDYR77QCIZ6GL6GF5/events.json","paper":"https://pith.science/paper/SI5UJD45"},"agent_actions":{"view_html":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5","download_json":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5.json","view_paper":"https://pith.science/paper/SI5UJD45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21015&json=true","fetch_graph":"https://pith.science/api/pith-number/SI5UJD45NVDYR77QCIZ6GL6GF5/graph.json","fetch_events":"https://pith.science/api/pith-number/SI5UJD45NVDYR77QCIZ6GL6GF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/action/storage_attestation","attest_author":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/action/author_attestation","sign_citation":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/action/citation_signature","submit_replication":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/action/replication_record"}},"created_at":"2026-05-21T01:05:32.409758+00:00","updated_at":"2026-05-21T01:05:32.409758+00:00"}