{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PVS36RXLDOKXUWSFZQIGLTYBBV","short_pith_number":"pith:PVS36RXL","schema_version":"1.0","canonical_sha256":"7d65bf46eb1b957a5a45cc1065cf010d5a7d9b6a32efcab0a26951be401caaf9","source":{"kind":"arxiv","id":"1308.3665","version":1},"attestation_state":"computed","paper":{"title":"On Sparsification for Computing Treewidth","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen","submitted_at":"2013-08-16T16:47:07Z","abstract_excerpt":"We investigate whether an n-vertex instance (G,k) of Treewidth, asking whether the graph G has treewidth at most k, can efficiently be made sparse without changing its answer. By giving a special form of OR-cross-composition, we prove that this is unlikely: if there is an e > 0 and a polynomial-time algorithm that reduces n-vertex Treewidth instances to equivalent instances, of an arbitrary problem, with O(n^{2-e}) bits, then NP is in coNP/poly and the polynomial hierarchy collapses to its third level.\n  Our sparsification lower bound has implications for structural parameterizations of Treewi"},"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":"1308.3665","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-08-16T16:47:07Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"7c40b28552fb1ecfde1be5e95a9928edfd16b5ca755a244d496c27dcf0e6a85c","abstract_canon_sha256":"8b4fc065b7ba979b16e8fee903f1be7345a22a75a49b3195b9875ed9cf027832"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:44.305699Z","signature_b64":"4xF6GXv9tsdJDqjQbtmZ48Pwy5kuD8swwy33n/oFPlH1qH5A+kJLMWo344KTwOfOBwxB3f0s0/Ag+lcyGlIVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d65bf46eb1b957a5a45cc1065cf010d5a7d9b6a32efcab0a26951be401caaf9","last_reissued_at":"2026-05-18T03:15:44.305050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:44.305050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Sparsification for Computing Treewidth","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen","submitted_at":"2013-08-16T16:47:07Z","abstract_excerpt":"We investigate whether an n-vertex instance (G,k) of Treewidth, asking whether the graph G has treewidth at most k, can efficiently be made sparse without changing its answer. By giving a special form of OR-cross-composition, we prove that this is unlikely: if there is an e > 0 and a polynomial-time algorithm that reduces n-vertex Treewidth instances to equivalent instances, of an arbitrary problem, with O(n^{2-e}) bits, then NP is in coNP/poly and the polynomial hierarchy collapses to its third level.\n  Our sparsification lower bound has implications for structural parameterizations of Treewi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3665","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":"1308.3665","created_at":"2026-05-18T03:15:44.305161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3665v1","created_at":"2026-05-18T03:15:44.305161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3665","created_at":"2026-05-18T03:15:44.305161+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVS36RXLDOKX","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVS36RXLDOKXUWSF","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVS36RXL","created_at":"2026-05-18T12:27:57.521954+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/PVS36RXLDOKXUWSFZQIGLTYBBV","json":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV.json","graph_json":"https://pith.science/api/pith-number/PVS36RXLDOKXUWSFZQIGLTYBBV/graph.json","events_json":"https://pith.science/api/pith-number/PVS36RXLDOKXUWSFZQIGLTYBBV/events.json","paper":"https://pith.science/paper/PVS36RXL"},"agent_actions":{"view_html":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV","download_json":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV.json","view_paper":"https://pith.science/paper/PVS36RXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3665&json=true","fetch_graph":"https://pith.science/api/pith-number/PVS36RXLDOKXUWSFZQIGLTYBBV/graph.json","fetch_events":"https://pith.science/api/pith-number/PVS36RXLDOKXUWSFZQIGLTYBBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/action/storage_attestation","attest_author":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/action/author_attestation","sign_citation":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/action/citation_signature","submit_replication":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/action/replication_record"}},"created_at":"2026-05-18T03:15:44.305161+00:00","updated_at":"2026-05-18T03:15:44.305161+00:00"}