{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3YHGSRVZT2EV4QA3JUTE7JLJJP","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":"a23a7efb7b17fdccbc22ad0ce3b89a4fe407946fe44eaf36f26a3fd508c9f531","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-07T10:38:52Z","title_canon_sha256":"8a040e5fc7520a0b56f1cfabe6e08b4cca8cfc709dc4975a304df60dfbff2962"},"schema_version":"1.0","source":{"id":"1211.1505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1505","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1505v1","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1505","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"3YHGSRVZT2EV","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3YHGSRVZT2EV4QA3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3YHGSRVZ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:b193d5604d9da1352078e11d35a4d25abfdf81ba8fb6c3f5296d18b26fee9543","target":"graph","created_at":"2026-05-18T03:41:20Z","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":"It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time for graphs G=(V,E) with a given tree decomposition of width tw. However, for nonlocal problems, like the fundamental class of connectivity problems, for a long time we did not know how to do this faster than tw^{O(tw)}|V|^{O(1)}. Recently, Cygan et al. (FOCS 2011) presented Monte Carlo algorithms for a wide range of connectivity problems running in time $c^{tw}|V|^{O(1)} for a small constant c, e.g., for Hamiltonian Cycle and Steiner tree. Naturally, this raises the ","authors_text":"Hans L. Bodlaender, Jesper Nederlof, Marek Cygan, Stefan Kratsch","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-07T10:38:52Z","title":"Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1505","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:bbfdf460041c17e6cf0c2e10c0d43a69bee040ebe7f75103d6d9c5ba409ce0d3","target":"record","created_at":"2026-05-18T03:41:20Z","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":"a23a7efb7b17fdccbc22ad0ce3b89a4fe407946fe44eaf36f26a3fd508c9f531","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-07T10:38:52Z","title_canon_sha256":"8a040e5fc7520a0b56f1cfabe6e08b4cca8cfc709dc4975a304df60dfbff2962"},"schema_version":"1.0","source":{"id":"1211.1505","kind":"arxiv","version":1}},"canonical_sha256":"de0e6946b99e895e401b4d264fa5694bcbd5b0159729e0e3d2c7ccdbf14948da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de0e6946b99e895e401b4d264fa5694bcbd5b0159729e0e3d2c7ccdbf14948da","first_computed_at":"2026-05-18T03:41:20.836802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:20.836802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qQ3kjOqO2IqQjyoUhA4GkFKMS6UBCmcKgAmJgtw9OBK+3XHN8YbjlSxFmLf8hpJJjluWA89C4iXejoEbmBnCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:20.837153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbfdf460041c17e6cf0c2e10c0d43a69bee040ebe7f75103d6d9c5ba409ce0d3","sha256:b193d5604d9da1352078e11d35a4d25abfdf81ba8fb6c3f5296d18b26fee9543"],"state_sha256":"6af8a277e0d246c05b49cdc612ee50ff95b2763b46a11fb1248556b041cd421f"}