{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EL5INSIGUF7QL7CSHOJLO7KXPW","short_pith_number":"pith:EL5INSIG","schema_version":"1.0","canonical_sha256":"22fa86c906a17f05fc523b92b77d577d91c2e98606467f3f9be87b8242727036","source":{"kind":"arxiv","id":"1103.0534","version":1},"attestation_state":"computed","paper":{"title":"Solving connectivity problems parameterized by treewidth in single exponential time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Onufry Wojtaszczyk, Jesper Nederlof, Johan van Rooij, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2011-03-02T20:36:20Z","abstract_excerpt":"For the vast majority of local graph problems standard dynamic programming techniques give c^tw V^O(1) algorithms, where tw is the treewidth of the input graph. On the other hand, for problems with a global requirement (usually connectivity) the best-known algorithms were naive dynamic programming schemes running in tw^O(tw) V^O(1) time.\n  We breach this gap by introducing a technique we dubbed Cut&Count that allows to produce c^tw V^O(1) Monte Carlo algorithms for most connectivity-type problems, including Hamiltonian Path, Feedback Vertex Set and Connected Dominating Set, consequently answer"},"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":"1103.0534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-02T20:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"512ef096c2e81c6e0a0a212676d97ba61f2099fd0b64a48c93088fdf1767bb2d","abstract_canon_sha256":"4bf2d978a2a0bc6cf0901c05f8c1c5ff9bde2cb9d17eb85ecfe7dfa8fe16b8d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:34.669489Z","signature_b64":"4Do4AqFMqosgGyQXQc/ZDgkaXx+brg2h0uCtZoelrjZpjZW+nNHsNaA3z+poNVQlejCDkWDOHnBUuY6CvtAHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22fa86c906a17f05fc523b92b77d577d91c2e98606467f3f9be87b8242727036","last_reissued_at":"2026-05-18T04:27:34.669011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:34.669011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving connectivity problems parameterized by treewidth in single exponential time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Onufry Wojtaszczyk, Jesper Nederlof, Johan van Rooij, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2011-03-02T20:36:20Z","abstract_excerpt":"For the vast majority of local graph problems standard dynamic programming techniques give c^tw V^O(1) algorithms, where tw is the treewidth of the input graph. On the other hand, for problems with a global requirement (usually connectivity) the best-known algorithms were naive dynamic programming schemes running in tw^O(tw) V^O(1) time.\n  We breach this gap by introducing a technique we dubbed Cut&Count that allows to produce c^tw V^O(1) Monte Carlo algorithms for most connectivity-type problems, including Hamiltonian Path, Feedback Vertex Set and Connected Dominating Set, consequently answer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0534","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":"1103.0534","created_at":"2026-05-18T04:27:34.669081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0534v1","created_at":"2026-05-18T04:27:34.669081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0534","created_at":"2026-05-18T04:27:34.669081+00:00"},{"alias_kind":"pith_short_12","alias_value":"EL5INSIGUF7Q","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EL5INSIGUF7QL7CS","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EL5INSIG","created_at":"2026-05-18T12:26:28.662955+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/EL5INSIGUF7QL7CSHOJLO7KXPW","json":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW.json","graph_json":"https://pith.science/api/pith-number/EL5INSIGUF7QL7CSHOJLO7KXPW/graph.json","events_json":"https://pith.science/api/pith-number/EL5INSIGUF7QL7CSHOJLO7KXPW/events.json","paper":"https://pith.science/paper/EL5INSIG"},"agent_actions":{"view_html":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW","download_json":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW.json","view_paper":"https://pith.science/paper/EL5INSIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0534&json=true","fetch_graph":"https://pith.science/api/pith-number/EL5INSIGUF7QL7CSHOJLO7KXPW/graph.json","fetch_events":"https://pith.science/api/pith-number/EL5INSIGUF7QL7CSHOJLO7KXPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/action/storage_attestation","attest_author":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/action/author_attestation","sign_citation":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/action/citation_signature","submit_replication":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/action/replication_record"}},"created_at":"2026-05-18T04:27:34.669081+00:00","updated_at":"2026-05-18T04:27:34.669081+00:00"}