{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JYG5BDPPWEOPFDOMBFTRMFPCBU","short_pith_number":"pith:JYG5BDPP","schema_version":"1.0","canonical_sha256":"4e0dd08defb11cf28dcc09671615e20d0542c8bd60f7e42d317e4e91c60d8358","source":{"kind":"arxiv","id":"1410.1016","version":1},"attestation_state":"computed","paper":{"title":"Degree-3 Treewidth Sparsifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Julia Chuzhoy","submitted_at":"2014-10-04T03:37:29Z","abstract_excerpt":"We study treewidth sparsifiers. Informally, given a graph $G$ of treewidth $k$, a treewidth sparsifier $H$ is a minor of $G$, whose treewidth is close to $k$, $|V(H)|$ is small, and the maximum vertex degree in $H$ is bounded. Treewidth sparsifiers of degree $3$ are of particular interest, as routing on node-disjoint paths, and computing minors seems easier in sub-cubic graphs than in general graphs.\n  In this paper we describe an algorithm that, given a graph $G$ of treewidth $k$, computes a topological minor $H$ of $G$ such that (i) the treewidth of $H$ is $\\Omega(k/\\text{polylog}(k))$; (ii)"},"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":"1410.1016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-04T03:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"334bcff116d44ba061f3ee39c8a6692a3312001d2f2bd6efc63895a9842f5034","abstract_canon_sha256":"c3b0d81dfb5b98f99cc400ac0155decf9fc14a3fc421b9f0ab18b81f6219279c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:02.972026Z","signature_b64":"26AGk7nHcrPIMmUkpwHDcVxBeezKv4I5Ix558UpqL6vhJuX+sBm+VNqBzcj2eiw/7P2mJgJIWLZllCVJMEyZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e0dd08defb11cf28dcc09671615e20d0542c8bd60f7e42d317e4e91c60d8358","last_reissued_at":"2026-05-18T02:41:02.971336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:02.971336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree-3 Treewidth Sparsifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Julia Chuzhoy","submitted_at":"2014-10-04T03:37:29Z","abstract_excerpt":"We study treewidth sparsifiers. Informally, given a graph $G$ of treewidth $k$, a treewidth sparsifier $H$ is a minor of $G$, whose treewidth is close to $k$, $|V(H)|$ is small, and the maximum vertex degree in $H$ is bounded. Treewidth sparsifiers of degree $3$ are of particular interest, as routing on node-disjoint paths, and computing minors seems easier in sub-cubic graphs than in general graphs.\n  In this paper we describe an algorithm that, given a graph $G$ of treewidth $k$, computes a topological minor $H$ of $G$ such that (i) the treewidth of $H$ is $\\Omega(k/\\text{polylog}(k))$; (ii)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1016","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":"1410.1016","created_at":"2026-05-18T02:41:02.971426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.1016v1","created_at":"2026-05-18T02:41:02.971426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1016","created_at":"2026-05-18T02:41:02.971426+00:00"},{"alias_kind":"pith_short_12","alias_value":"JYG5BDPPWEOP","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JYG5BDPPWEOPFDOM","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JYG5BDPP","created_at":"2026-05-18T12:28:35.611951+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/JYG5BDPPWEOPFDOMBFTRMFPCBU","json":"https://pith.science/pith/JYG5BDPPWEOPFDOMBFTRMFPCBU.json","graph_json":"https://pith.science/api/pith-number/JYG5BDPPWEOPFDOMBFTRMFPCBU/graph.json","events_json":"https://pith.science/api/pith-number/JYG5BDPPWEOPFDOMBFTRMFPCBU/events.json","paper":"https://pith.science/paper/JYG5BDPP"},"agent_actions":{"view_html":"https://pith.science/pith/JYG5BDPPWEOPFDOMBFTRMFPCBU","download_json":"https://pith.science/pith/JYG5BDPPWEOPFDOMBFTRMFPCBU.json","view_paper":"https://pith.science/paper/JYG5BDPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.1016&json=true","fetch_graph":"https://pith.science/api/pith-number/JYG5BDPPWEOPFDOMBFTRMFPCBU/graph.json","fetch_events":"https://pith.science/api/pith-number/JYG5BDPPWEOPFDOMBFTRMFPCBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JYG5BDPPWEOPFDOMBFTRMFPCBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JYG5BDPPWEOPFDOMBFTRMFPCBU/action/storage_attestation","attest_author":"https://pith.science/pith/JYG5BDPPWEOPFDOMBFTRMFPCBU/action/author_attestation","sign_citation":"https://pith.science/pith/JYG5BDPPWEOPFDOMBFTRMFPCBU/action/citation_signature","submit_replication":"https://pith.science/pith/JYG5BDPPWEOPFDOMBFTRMFPCBU/action/replication_record"}},"created_at":"2026-05-18T02:41:02.971426+00:00","updated_at":"2026-05-18T02:41:02.971426+00:00"}