{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EL5INSIGUF7QL7CSHOJLO7KXPW","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":"4bf2d978a2a0bc6cf0901c05f8c1c5ff9bde2cb9d17eb85ecfe7dfa8fe16b8d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-02T20:36:20Z","title_canon_sha256":"512ef096c2e81c6e0a0a212676d97ba61f2099fd0b64a48c93088fdf1767bb2d"},"schema_version":"1.0","source":{"id":"1103.0534","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0534","created_at":"2026-05-18T04:27:34Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0534v1","created_at":"2026-05-18T04:27:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0534","created_at":"2026-05-18T04:27:34Z"},{"alias_kind":"pith_short_12","alias_value":"EL5INSIGUF7Q","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EL5INSIGUF7QL7CS","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EL5INSIG","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:4088524d727669171020354e2cad3aaa70f11a29f8e76d045d59b894b899699f","target":"graph","created_at":"2026-05-18T04:27:34Z","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":"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","authors_text":"Jakub Onufry Wojtaszczyk, Jesper Nederlof, Johan van Rooij, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-02T20:36:20Z","title":"Solving connectivity problems parameterized by treewidth in single exponential time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0534","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:51ea1cb73635d9eb73a1a158fb2bd752dbd47845460db83cbd625fa226eb79ca","target":"record","created_at":"2026-05-18T04:27:34Z","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":"4bf2d978a2a0bc6cf0901c05f8c1c5ff9bde2cb9d17eb85ecfe7dfa8fe16b8d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-02T20:36:20Z","title_canon_sha256":"512ef096c2e81c6e0a0a212676d97ba61f2099fd0b64a48c93088fdf1767bb2d"},"schema_version":"1.0","source":{"id":"1103.0534","kind":"arxiv","version":1}},"canonical_sha256":"22fa86c906a17f05fc523b92b77d577d91c2e98606467f3f9be87b8242727036","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22fa86c906a17f05fc523b92b77d577d91c2e98606467f3f9be87b8242727036","first_computed_at":"2026-05-18T04:27:34.669011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:34.669011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Do4AqFMqosgGyQXQc/ZDgkaXx+brg2h0uCtZoelrjZpjZW+nNHsNaA3z+poNVQlejCDkWDOHnBUuY6CvtAHAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:34.669489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0534","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51ea1cb73635d9eb73a1a158fb2bd752dbd47845460db83cbd625fa226eb79ca","sha256:4088524d727669171020354e2cad3aaa70f11a29f8e76d045d59b894b899699f"],"state_sha256":"1e13289653a4a10a66ad0aaa5d27d24686a0d29c162ef330281b651e79b68b8d"}