{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZIPEVBG4IYJJDV3WTWSE2GBUR2","short_pith_number":"pith:ZIPEVBG4","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"},"canonical_sha256":"ca1e4a84dc461291d7769da44d18348ebf3f694796a25141a7930cc0ff0b0459","source":{"kind":"arxiv","id":"1304.1577","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1577","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1577v1","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1577","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZIPEVBG4IYJJ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZIPEVBG4IYJJDV3W","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZIPEVBG4","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZIPEVBG4IYJJDV3WTWSE2GBUR2","target":"record","payload":{"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"},"canonical_sha256":"ca1e4a84dc461291d7769da44d18348ebf3f694796a25141a7930cc0ff0b0459","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"},"source_kind":"arxiv","source_id":"1304.1577","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-18T03:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzNQsLPhcScwsAC3Xl0JJLE6e3dxTxi5mrD9U/uQYTGFlzZY2qi33poXI7Z877//rmU7DjbAobn97SOy5tPcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:15:53.493010Z"},"content_sha256":"2e025dbaa89165eddcc8e60e4b2993e20cc3013eb8bbfdc85c2bfd40dad5918c","schema_version":"1.0","event_id":"sha256:2e025dbaa89165eddcc8e60e4b2993e20cc3013eb8bbfdc85c2bfd40dad5918c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZIPEVBG4IYJJDV3WTWSE2GBUR2","target":"graph","payload":{"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"},"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-18T03:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z8kBXlsDaelYQ8qR+fIKDETRjXwT4clgCrpjuMXpq8LPKW9edqoLMZWyud/tpSsbHLiBHEv0lpFTIZttCkc2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:15:53.493372Z"},"content_sha256":"4d4174859760b5df700b1fe2ba48fb236e125438c0ab79692853eff42e1f5c06","schema_version":"1.0","event_id":"sha256:4d4174859760b5df700b1fe2ba48fb236e125438c0ab79692853eff42e1f5c06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/bundle.json","state_url":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/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-06-09T12:15:53Z","links":{"resolver":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2","bundle":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/bundle.json","state":"https://pith.science/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIPEVBG4IYJJDV3WTWSE2GBUR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZIPEVBG4IYJJDV3WTWSE2GBUR2","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":"72f38d40849c230b4ced76ba8a039e1353c56fde154e1cb64310173cebe06f99","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T22:42:11Z","title_canon_sha256":"9293ff0b5fe7543b363a962638fd64ee3a66b86f1fe3f1a792c9f84e771a7d00"},"schema_version":"1.0","source":{"id":"1304.1577","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1577","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1577v1","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1577","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZIPEVBG4IYJJ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZIPEVBG4IYJJDV3W","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZIPEVBG4","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:4d4174859760b5df700b1fe2ba48fb236e125438c0ab79692853eff42e1f5c06","target":"graph","created_at":"2026-05-18T03:28:55Z","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"},"paper":{"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","authors_text":"Chandra Chekuri, Julia Chuzhoy","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T22:42:11Z","title":"Large-Treewidth Graph Decompositions and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1577","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:2e025dbaa89165eddcc8e60e4b2993e20cc3013eb8bbfdc85c2bfd40dad5918c","target":"record","created_at":"2026-05-18T03:28:55Z","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":"72f38d40849c230b4ced76ba8a039e1353c56fde154e1cb64310173cebe06f99","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T22:42:11Z","title_canon_sha256":"9293ff0b5fe7543b363a962638fd64ee3a66b86f1fe3f1a792c9f84e771a7d00"},"schema_version":"1.0","source":{"id":"1304.1577","kind":"arxiv","version":1}},"canonical_sha256":"ca1e4a84dc461291d7769da44d18348ebf3f694796a25141a7930cc0ff0b0459","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca1e4a84dc461291d7769da44d18348ebf3f694796a25141a7930cc0ff0b0459","first_computed_at":"2026-05-18T03:28:55.325669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:55.325669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iwp7CVN83qwxTmr7WOFEXkaJzlvCJh9OpmmmM8ASCkr9UI6wMvK86B5us/Vyp38hCWoakd4RL+X6TVUvJPqLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:55.326576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1577","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e025dbaa89165eddcc8e60e4b2993e20cc3013eb8bbfdc85c2bfd40dad5918c","sha256:4d4174859760b5df700b1fe2ba48fb236e125438c0ab79692853eff42e1f5c06"],"state_sha256":"9dd391e95a378d082f3e890aa2550930441fdd31ddc09f353625728712359890"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4EiZUICgts2GdMYDzbjIDvxPxLOVW/sUpiolg1cMIzqrr1EB3vEkPsn9aD7yXi2gmwBKa2OdwgKRht2RcHnzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:15:53.495263Z","bundle_sha256":"b8c8148b8b22c299d33ad6ea4f44f1de1e00fe5dff0787783a393862236c0206"}}