{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SI5UJD45NVDYR77QCIZ6GL6GF5","short_pith_number":"pith:SI5UJD45","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"},"canonical_sha256":"923b448f9d6d4788fff01233e32fc62f55ae682cef5442d3e4b191b1b0b772c7","source":{"kind":"arxiv","id":"2605.21015","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21015","created_at":"2026-05-21T01:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21015v1","created_at":"2026-05-21T01:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21015","created_at":"2026-05-21T01:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"SI5UJD45NVDY","created_at":"2026-05-21T01:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"SI5UJD45NVDYR77Q","created_at":"2026-05-21T01:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"SI5UJD45","created_at":"2026-05-21T01:05:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SI5UJD45NVDYR77QCIZ6GL6GF5","target":"record","payload":{"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"},"canonical_sha256":"923b448f9d6d4788fff01233e32fc62f55ae682cef5442d3e4b191b1b0b772c7","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"},"source_kind":"arxiv","source_id":"2605.21015","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T01:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjnjdxvcRUJtUGy2m7I6pjZFVnT3xsUfplGnEXk28V0CUbcXaLbjc0+o410PixcOXLHAPwdFbRnzliFg16ZsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:26:12.907072Z"},"content_sha256":"fe6a55564d0a89972310d2c7ceeaec0062c7d21c966db4ed9e667c6b3f981f70","schema_version":"1.0","event_id":"sha256:fe6a55564d0a89972310d2c7ceeaec0062c7d21c966db4ed9e667c6b3f981f70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SI5UJD45NVDYR77QCIZ6GL6GF5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T01:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJ7nAR+K6daSglhBGxRBATSrjL9TFoQVZMpkrHCN3YmWm7cs4O67PbkOdifyz4plpKsZgv2GiAJPxRapAui/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:26:12.907803Z"},"content_sha256":"0a8283a18b71e205df98b2902be268d9de65f601c48e4552d5f3a998a0bea478","schema_version":"1.0","event_id":"sha256:0a8283a18b71e205df98b2902be268d9de65f601c48e4552d5f3a998a0bea478"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/bundle.json","state_url":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T21:26:12Z","links":{"resolver":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5","bundle":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/bundle.json","state":"https://pith.science/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SI5UJD45NVDYR77QCIZ6GL6GF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SI5UJD45NVDYR77QCIZ6GL6GF5","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":"60f91b913787cce2c27e5ae35771c444a29f14df1f7d23b4cd0f4805626373d5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T10:50:16Z","title_canon_sha256":"f68afcbf5fccf1a8e0304b6aedec6ad508e0d63f99ad4820b8e705e82a54e78a"},"schema_version":"1.0","source":{"id":"2605.21015","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21015","created_at":"2026-05-21T01:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21015v1","created_at":"2026-05-21T01:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21015","created_at":"2026-05-21T01:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"SI5UJD45NVDY","created_at":"2026-05-21T01:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"SI5UJD45NVDYR77Q","created_at":"2026-05-21T01:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"SI5UJD45","created_at":"2026-05-21T01:05:32Z"}],"graph_snapshots":[{"event_id":"sha256:0a8283a18b71e205df98b2902be268d9de65f601c48e4552d5f3a998a0bea478","target":"graph","created_at":"2026-05-21T01:05: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.21015/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Hiraku Morimoto, Tatsuya Gima, Yota Otachi, Yuto Okada","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T10:50:16Z","title":"Treewidth of the $n \\times n$ toroidal grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21015","kind":"arxiv","version":1},"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:fe6a55564d0a89972310d2c7ceeaec0062c7d21c966db4ed9e667c6b3f981f70","target":"record","created_at":"2026-05-21T01:05: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":"60f91b913787cce2c27e5ae35771c444a29f14df1f7d23b4cd0f4805626373d5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T10:50:16Z","title_canon_sha256":"f68afcbf5fccf1a8e0304b6aedec6ad508e0d63f99ad4820b8e705e82a54e78a"},"schema_version":"1.0","source":{"id":"2605.21015","kind":"arxiv","version":1}},"canonical_sha256":"923b448f9d6d4788fff01233e32fc62f55ae682cef5442d3e4b191b1b0b772c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"923b448f9d6d4788fff01233e32fc62f55ae682cef5442d3e4b191b1b0b772c7","first_computed_at":"2026-05-21T01:05:32.409635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:32.409635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n/R0lJT7vljHHMFMYUE3bYw3l1/jui8e8sV1cqNDiRHVjyMWTyUljFrfYr+NAtkC3AcRv6crKjdo9b0Mg5NIDA==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:32.410460Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21015","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe6a55564d0a89972310d2c7ceeaec0062c7d21c966db4ed9e667c6b3f981f70","sha256:0a8283a18b71e205df98b2902be268d9de65f601c48e4552d5f3a998a0bea478"],"state_sha256":"70800babc24f94819b4bb6ecdb91e926897d4a1df62db99dd96e507bb0a8b219"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CyHPtKWE97EeWJrkuviqoXlzuwC71vReJXMh7Kao2ToxbAFB1nK2Ed2e5fsM8bNrAsygy2BxEj825SShVK5cAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T21:26:12.912447Z","bundle_sha256":"8568a2ff6b641f70a0b4a3ad44475e91040eae56b3e5e7114246fac602136b6b"}}