{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4FOTTEENZDVWDFZT2QINAHDV6V","short_pith_number":"pith:4FOTTEEN","schema_version":"1.0","canonical_sha256":"e15d39908dc8eb619733d410d01c75f544cca84383c0ce17a8e0abd33bc0adb0","source":{"kind":"arxiv","id":"1609.09098","version":1},"attestation_state":"computed","paper":{"title":"A generalization of the Grid Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benson Joeris, Jim Geelen","submitted_at":"2016-09-28T20:07:19Z","abstract_excerpt":"A graph has tree-width at most $k$ if it can be obtained from a set of graphs each with at most $k+1$ vertices by a sequence of clique sums. We refine this definition by, for each non-negative integer $\\theta$, defining the $\\theta$-tree-width of a graph to be at most $k$ if it can be obtained from a set of graphs each with at most $k+1$ vertices by a sequence of clique sums on cliques of size less than $\\theta$. We find the unavoidable minors for the graphs with large $\\theta$-tree-width and we obtain Robertson and Seymour's Grid Theorem as a corollary."},"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":"1609.09098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-28T20:07:19Z","cross_cats_sorted":[],"title_canon_sha256":"fad9e72e520be0d4c1ad3f83740c22f48c8fc49d5a0ebbe8be8cd097f03df979","abstract_canon_sha256":"d6276f069dcaae4e26ad7a767c41f40ecad2f8d2adc6682fd16f79a203814fd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:40.228879Z","signature_b64":"fpjpUQoN9URw27FQW/gQFNFybP/qpz9c0qPKfDCIIytyDfQPFMFC2N0hDEBpN0ZWU8hzmz0vggsMRhFbBDt4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e15d39908dc8eb619733d410d01c75f544cca84383c0ce17a8e0abd33bc0adb0","last_reissued_at":"2026-05-18T01:03:40.228444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:40.228444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of the Grid Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benson Joeris, Jim Geelen","submitted_at":"2016-09-28T20:07:19Z","abstract_excerpt":"A graph has tree-width at most $k$ if it can be obtained from a set of graphs each with at most $k+1$ vertices by a sequence of clique sums. We refine this definition by, for each non-negative integer $\\theta$, defining the $\\theta$-tree-width of a graph to be at most $k$ if it can be obtained from a set of graphs each with at most $k+1$ vertices by a sequence of clique sums on cliques of size less than $\\theta$. We find the unavoidable minors for the graphs with large $\\theta$-tree-width and we obtain Robertson and Seymour's Grid Theorem as a corollary."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09098","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":"1609.09098","created_at":"2026-05-18T01:03:40.228511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09098v1","created_at":"2026-05-18T01:03:40.228511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09098","created_at":"2026-05-18T01:03:40.228511+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FOTTEENZDVW","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FOTTEENZDVWDFZT","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FOTTEEN","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2304.14121","citing_title":"An Overview of Universal Obstructions for Graph Parameters","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4FOTTEENZDVWDFZT2QINAHDV6V","json":"https://pith.science/pith/4FOTTEENZDVWDFZT2QINAHDV6V.json","graph_json":"https://pith.science/api/pith-number/4FOTTEENZDVWDFZT2QINAHDV6V/graph.json","events_json":"https://pith.science/api/pith-number/4FOTTEENZDVWDFZT2QINAHDV6V/events.json","paper":"https://pith.science/paper/4FOTTEEN"},"agent_actions":{"view_html":"https://pith.science/pith/4FOTTEENZDVWDFZT2QINAHDV6V","download_json":"https://pith.science/pith/4FOTTEENZDVWDFZT2QINAHDV6V.json","view_paper":"https://pith.science/paper/4FOTTEEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09098&json=true","fetch_graph":"https://pith.science/api/pith-number/4FOTTEENZDVWDFZT2QINAHDV6V/graph.json","fetch_events":"https://pith.science/api/pith-number/4FOTTEENZDVWDFZT2QINAHDV6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FOTTEENZDVWDFZT2QINAHDV6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FOTTEENZDVWDFZT2QINAHDV6V/action/storage_attestation","attest_author":"https://pith.science/pith/4FOTTEENZDVWDFZT2QINAHDV6V/action/author_attestation","sign_citation":"https://pith.science/pith/4FOTTEENZDVWDFZT2QINAHDV6V/action/citation_signature","submit_replication":"https://pith.science/pith/4FOTTEENZDVWDFZT2QINAHDV6V/action/replication_record"}},"created_at":"2026-05-18T01:03:40.228511+00:00","updated_at":"2026-05-18T01:03:40.228511+00:00"}