{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3YHGSRVZT2EV4QA3JUTE7JLJJP","short_pith_number":"pith:3YHGSRVZ","schema_version":"1.0","canonical_sha256":"de0e6946b99e895e401b4d264fa5694bcbd5b0159729e0e3d2c7ccdbf14948da","source":{"kind":"arxiv","id":"1211.1505","version":1},"attestation_state":"computed","paper":{"title":"Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Hans L. Bodlaender, Jesper Nederlof, Marek Cygan, Stefan Kratsch","submitted_at":"2012-11-07T10:38:52Z","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 "},"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":"1211.1505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-07T10:38:52Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"8a040e5fc7520a0b56f1cfabe6e08b4cca8cfc709dc4975a304df60dfbff2962","abstract_canon_sha256":"a23a7efb7b17fdccbc22ad0ce3b89a4fe407946fe44eaf36f26a3fd508c9f531"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:20.837153Z","signature_b64":"qQ3kjOqO2IqQjyoUhA4GkFKMS6UBCmcKgAmJgtw9OBK+3XHN8YbjlSxFmLf8hpJJjluWA89C4iXejoEbmBnCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de0e6946b99e895e401b4d264fa5694bcbd5b0159729e0e3d2c7ccdbf14948da","last_reissued_at":"2026-05-18T03:41:20.836802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:20.836802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Hans L. Bodlaender, Jesper Nederlof, Marek Cygan, Stefan Kratsch","submitted_at":"2012-11-07T10:38:52Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1505","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":"1211.1505","created_at":"2026-05-18T03:41:20.836857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1505v1","created_at":"2026-05-18T03:41:20.836857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1505","created_at":"2026-05-18T03:41:20.836857+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YHGSRVZT2EV","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YHGSRVZT2EV4QA3","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YHGSRVZ","created_at":"2026-05-18T12:26:53.410803+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/3YHGSRVZT2EV4QA3JUTE7JLJJP","json":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP.json","graph_json":"https://pith.science/api/pith-number/3YHGSRVZT2EV4QA3JUTE7JLJJP/graph.json","events_json":"https://pith.science/api/pith-number/3YHGSRVZT2EV4QA3JUTE7JLJJP/events.json","paper":"https://pith.science/paper/3YHGSRVZ"},"agent_actions":{"view_html":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP","download_json":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP.json","view_paper":"https://pith.science/paper/3YHGSRVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1505&json=true","fetch_graph":"https://pith.science/api/pith-number/3YHGSRVZT2EV4QA3JUTE7JLJJP/graph.json","fetch_events":"https://pith.science/api/pith-number/3YHGSRVZT2EV4QA3JUTE7JLJJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/action/storage_attestation","attest_author":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/action/author_attestation","sign_citation":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/action/citation_signature","submit_replication":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/action/replication_record"}},"created_at":"2026-05-18T03:41:20.836857+00:00","updated_at":"2026-05-18T03:41:20.836857+00:00"}