{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PVS36RXLDOKXUWSFZQIGLTYBBV","short_pith_number":"pith:PVS36RXL","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"},"canonical_sha256":"7d65bf46eb1b957a5a45cc1065cf010d5a7d9b6a32efcab0a26951be401caaf9","source":{"kind":"arxiv","id":"1308.3665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3665","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3665v1","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3665","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"pith_short_12","alias_value":"PVS36RXLDOKX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PVS36RXLDOKXUWSF","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PVS36RXL","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PVS36RXLDOKXUWSFZQIGLTYBBV","target":"record","payload":{"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"},"canonical_sha256":"7d65bf46eb1b957a5a45cc1065cf010d5a7d9b6a32efcab0a26951be401caaf9","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"},"source_kind":"arxiv","source_id":"1308.3665","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:15:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTVOG1TTAsOQ09+d5xVULfsnDrk4NEuaLlaS/aYsMkiXv2kh45a4Q1nK3r+Mc8B1G2QZm0i6Z+pUXEE74i23Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:12:36.456627Z"},"content_sha256":"9812f403c98382f0c5a88ca6fc4351cea25c21377b2d71b38f1adb74fa870943","schema_version":"1.0","event_id":"sha256:9812f403c98382f0c5a88ca6fc4351cea25c21377b2d71b38f1adb74fa870943"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PVS36RXLDOKXUWSFZQIGLTYBBV","target":"graph","payload":{"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"},"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:15:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOE4vIHnw/V0mzjwILK4/pZUvfr2jNFeAGwe3odR7JIXWJCiX0AqQ2Kdey6eVpVq7q0fjtGG5wznFjG1exGKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:12:36.457364Z"},"content_sha256":"bccae1bdb0ba028dc5cde4d343b08c0199cb8ddb4aaefc790acf1c8c7653b2bc","schema_version":"1.0","event_id":"sha256:bccae1bdb0ba028dc5cde4d343b08c0199cb8ddb4aaefc790acf1c8c7653b2bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/bundle.json","state_url":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/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-05-26T13:12:36Z","links":{"resolver":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV","bundle":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/bundle.json","state":"https://pith.science/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVS36RXLDOKXUWSFZQIGLTYBBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PVS36RXLDOKXUWSFZQIGLTYBBV","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":"8b4fc065b7ba979b16e8fee903f1be7345a22a75a49b3195b9875ed9cf027832","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-08-16T16:47:07Z","title_canon_sha256":"7c40b28552fb1ecfde1be5e95a9928edfd16b5ca755a244d496c27dcf0e6a85c"},"schema_version":"1.0","source":{"id":"1308.3665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3665","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3665v1","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3665","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"pith_short_12","alias_value":"PVS36RXLDOKX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PVS36RXLDOKXUWSF","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PVS36RXL","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:bccae1bdb0ba028dc5cde4d343b08c0199cb8ddb4aaefc790acf1c8c7653b2bc","target":"graph","created_at":"2026-05-18T03:15:44Z","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":"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","authors_text":"Bart M. P. Jansen","cross_cats":["cs.DM","cs.DS","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-08-16T16:47:07Z","title":"On Sparsification for Computing Treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3665","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:9812f403c98382f0c5a88ca6fc4351cea25c21377b2d71b38f1adb74fa870943","target":"record","created_at":"2026-05-18T03:15:44Z","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":"8b4fc065b7ba979b16e8fee903f1be7345a22a75a49b3195b9875ed9cf027832","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-08-16T16:47:07Z","title_canon_sha256":"7c40b28552fb1ecfde1be5e95a9928edfd16b5ca755a244d496c27dcf0e6a85c"},"schema_version":"1.0","source":{"id":"1308.3665","kind":"arxiv","version":1}},"canonical_sha256":"7d65bf46eb1b957a5a45cc1065cf010d5a7d9b6a32efcab0a26951be401caaf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d65bf46eb1b957a5a45cc1065cf010d5a7d9b6a32efcab0a26951be401caaf9","first_computed_at":"2026-05-18T03:15:44.305050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:44.305050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4xF6GXv9tsdJDqjQbtmZ48Pwy5kuD8swwy33n/oFPlH1qH5A+kJLMWo344KTwOfOBwxB3f0s0/Ag+lcyGlIVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:44.305699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9812f403c98382f0c5a88ca6fc4351cea25c21377b2d71b38f1adb74fa870943","sha256:bccae1bdb0ba028dc5cde4d343b08c0199cb8ddb4aaefc790acf1c8c7653b2bc"],"state_sha256":"85760bbca3cbfbbc0ebb692e0b03cd629aeee1d317e4847758d354f320bf719a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5I7OBk+aEIDYQO/NzE2h/fIt7Y7FX0ylOxOb+f73RsqclVQw4c087fL2zDQmp+SDUbFgK2yCNMaZHq9lVx/0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:12:36.460948Z","bundle_sha256":"9a35df4efed9c0395151c256cf5bc30252389897abc974d41121a6df1f848507"}}