{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CX6SCL347EBXDD7XHI5GU2T3U7","short_pith_number":"pith:CX6SCL34","schema_version":"1.0","canonical_sha256":"15fd212f7cf903718ff73a3a6a6a7ba7cad472640820f66ff8ad09e7029e7a2f","source":{"kind":"arxiv","id":"1104.4217","version":2},"attestation_state":"computed","paper":{"title":"Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Hans L. Bodlaender, Stefan Kratsch","submitted_at":"2011-04-21T09:52:16Z","abstract_excerpt":"The notion of treewidth plays an important role in theoretical and practical studies of graph problems. It has been recognized that, especially in practical environments, when computing the treewidth of a graph it is invaluable to first apply an array of preprocessing rules that simplify and shrink it. This work seeks to prove rigorous performance guarantees for such preprocessing rules, both known and new ones, by studying them in the framework of kernelization from parameterized complexity.\n  It is known that the NP-complete problem of determining whether a given graph G has treewidth at mos"},"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":"1104.4217","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-21T09:52:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3573b708eea6885115c2c2fdedd07643722027459ca13c0af320d6cde43446bd","abstract_canon_sha256":"8a0aff4b761dd73f82830ca5650d696f08f8d23a1d793eb260cfb87b87b4b35e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:01.605502Z","signature_b64":"jcyA+CoRKjO2b5Wg+07ABmtjyJwBJSxTThpEDDVuSYiD9SPG4bfq+vp/92Cfwa+qgLL8ykx19la/9LTub4V5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15fd212f7cf903718ff73a3a6a6a7ba7cad472640820f66ff8ad09e7029e7a2f","last_reissued_at":"2026-05-18T02:22:01.604772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:01.604772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Hans L. Bodlaender, Stefan Kratsch","submitted_at":"2011-04-21T09:52:16Z","abstract_excerpt":"The notion of treewidth plays an important role in theoretical and practical studies of graph problems. It has been recognized that, especially in practical environments, when computing the treewidth of a graph it is invaluable to first apply an array of preprocessing rules that simplify and shrink it. This work seeks to prove rigorous performance guarantees for such preprocessing rules, both known and new ones, by studying them in the framework of kernelization from parameterized complexity.\n  It is known that the NP-complete problem of determining whether a given graph G has treewidth at mos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4217","kind":"arxiv","version":2},"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":"1104.4217","created_at":"2026-05-18T02:22:01.604890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4217v2","created_at":"2026-05-18T02:22:01.604890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4217","created_at":"2026-05-18T02:22:01.604890+00:00"},{"alias_kind":"pith_short_12","alias_value":"CX6SCL347EBX","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CX6SCL347EBXDD7X","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CX6SCL34","created_at":"2026-05-18T12:26:26.731475+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/CX6SCL347EBXDD7XHI5GU2T3U7","json":"https://pith.science/pith/CX6SCL347EBXDD7XHI5GU2T3U7.json","graph_json":"https://pith.science/api/pith-number/CX6SCL347EBXDD7XHI5GU2T3U7/graph.json","events_json":"https://pith.science/api/pith-number/CX6SCL347EBXDD7XHI5GU2T3U7/events.json","paper":"https://pith.science/paper/CX6SCL34"},"agent_actions":{"view_html":"https://pith.science/pith/CX6SCL347EBXDD7XHI5GU2T3U7","download_json":"https://pith.science/pith/CX6SCL347EBXDD7XHI5GU2T3U7.json","view_paper":"https://pith.science/paper/CX6SCL34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4217&json=true","fetch_graph":"https://pith.science/api/pith-number/CX6SCL347EBXDD7XHI5GU2T3U7/graph.json","fetch_events":"https://pith.science/api/pith-number/CX6SCL347EBXDD7XHI5GU2T3U7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CX6SCL347EBXDD7XHI5GU2T3U7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CX6SCL347EBXDD7XHI5GU2T3U7/action/storage_attestation","attest_author":"https://pith.science/pith/CX6SCL347EBXDD7XHI5GU2T3U7/action/author_attestation","sign_citation":"https://pith.science/pith/CX6SCL347EBXDD7XHI5GU2T3U7/action/citation_signature","submit_replication":"https://pith.science/pith/CX6SCL347EBXDD7XHI5GU2T3U7/action/replication_record"}},"created_at":"2026-05-18T02:22:01.604890+00:00","updated_at":"2026-05-18T02:22:01.604890+00:00"}