{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZIPEVBG4IYJJDV3WTWSE2GBUR2","short_pith_number":"pith:ZIPEVBG4","schema_version":"1.0","canonical_sha256":"ca1e4a84dc461291d7769da44d18348ebf3f694796a25141a7930cc0ff0b0459","source":{"kind":"arxiv","id":"1304.1577","version":1},"attestation_state":"computed","paper":{"title":"Large-Treewidth Graph Decompositions and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Julia Chuzhoy","submitted_at":"2013-04-04T22:42:11Z","abstract_excerpt":"Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph $G$ into node-disjoint subgraphs, where each subgraph has sufficiently large treewidth. We prove two theorems on the tradeoff between the number of the desired subgraphs $h$, and the desired lower bound $r$ on the treewidth of each subgraph. The theorems assert that, given a graph $G$ with treewidth $k$, a decomposition with parameters $h,r$ is feasible whenever $hr^2 \\le k/\\polylog(k)$, or $h^3r \\le k/\\polylog(k)$ holds. We then show a f"},"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":"1304.1577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T22:42:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9293ff0b5fe7543b363a962638fd64ee3a66b86f1fe3f1a792c9f84e771a7d00","abstract_canon_sha256":"72f38d40849c230b4ced76ba8a039e1353c56fde154e1cb64310173cebe06f99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:55.326576Z","signature_b64":"Iwp7CVN83qwxTmr7WOFEXkaJzlvCJh9OpmmmM8ASCkr9UI6wMvK86B5us/Vyp38hCWoakd4RL+X6TVUvJPqLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca1e4a84dc461291d7769da44d18348ebf3f694796a25141a7930cc0ff0b0459","last_reissued_at":"2026-05-18T03:28:55.325669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:55.325669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large-Treewidth Graph Decompositions and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Julia Chuzhoy","submitted_at":"2013-04-04T22:42:11Z","abstract_excerpt":"Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph $G$ into node-disjoint subgraphs, where each subgraph has sufficiently large treewidth. We prove two theorems on the tradeoff between the number of the desired subgraphs $h$, and the desired lower bound $r$ on the treewidth of each subgraph. The theorems assert that, given a graph $G$ with treewidth $k$, a decomposition with parameters $h,r$ is feasible whenever $hr^2 \\le k/\\polylog(k)$, or $h^3r \\le k/\\polylog(k)$ holds. We then show a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1577","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":"1304.1577","created_at":"2026-05-18T03:28:55.325803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1577v1","created_at":"2026-05-18T03:28:55.325803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1577","created_at":"2026-05-18T03:28:55.325803+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIPEVBG4IYJJ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIPEVBG4IYJJDV3W","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIPEVBG4","created_at":"2026-05-18T12:28:09.283467+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/ZIPEVBG4IYJJDV3WTWSE2GBUR2","json":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2.json","graph_json":"https://pith.science/api/pith-number/ZIPEVBG4IYJJDV3WTWSE2GBUR2/graph.json","events_json":"https://pith.science/api/pith-number/ZIPEVBG4IYJJDV3WTWSE2GBUR2/events.json","paper":"https://pith.science/paper/ZIPEVBG4"},"agent_actions":{"view_html":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2","download_json":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2.json","view_paper":"https://pith.science/paper/ZIPEVBG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1577&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIPEVBG4IYJJDV3WTWSE2GBUR2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIPEVBG4IYJJDV3WTWSE2GBUR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/action/storage_attestation","attest_author":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/action/author_attestation","sign_citation":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/action/citation_signature","submit_replication":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/action/replication_record"}},"created_at":"2026-05-18T03:28:55.325803+00:00","updated_at":"2026-05-18T03:28:55.325803+00:00"}