{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RFRX6L2TLVMZKIPZFK7P67XZCM","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":"4cc61334d1e67ca5079e5617758d404ccbc11563bb4787698be9f1545ce88386","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-10T17:27:12Z","title_canon_sha256":"41d49fa728aac4e54a944b16a04429b12d4299849388337a124a2d9a11f2c9e1"},"schema_version":"1.0","source":{"id":"1312.2889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2889","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2889v1","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2889","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"RFRX6L2TLVMZ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RFRX6L2TLVMZKIPZ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RFRX6L2T","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:d604b9a8ce02604f36dfabbbd8c3b85be96b4c23d2e7096cb087dc56281074ea","target":"graph","created_at":"2026-05-18T03:05:08Z","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 some years it was believed that for \"connectivity\" problems such as Hamiltonian Cycle, algorithms running in time 2^{O(tw)}n^{O(1)} -called single-exponential- existed only on planar and other sparse graph classes, where tw stands for the treewidth of the n-vertex input graph. This was recently disproved by Cygan et al. [FOCS 2011], Bodlaender et al. [ICALP 2013], and Fomin et al. [SODA 2014], who provided single-exponential algorithms on general graphs for essentially all connectivity problems that were known to be solvable in single-exponential time on sparse graphs. In this article we f","authors_text":"Ignasi Sau, Julien Baste","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-10T17:27:12Z","title":"The role of planarity in connectivity problems parameterized by treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2889","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:fab1026fe406f8f4f85f3e0cfeab59749d6d749b3a74921586c2334e0c4a8c87","target":"record","created_at":"2026-05-18T03:05:08Z","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":"4cc61334d1e67ca5079e5617758d404ccbc11563bb4787698be9f1545ce88386","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-10T17:27:12Z","title_canon_sha256":"41d49fa728aac4e54a944b16a04429b12d4299849388337a124a2d9a11f2c9e1"},"schema_version":"1.0","source":{"id":"1312.2889","kind":"arxiv","version":1}},"canonical_sha256":"89637f2f535d599521f92abeff7ef91307208e5f1846f3f0ae148c7ebd1d931f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89637f2f535d599521f92abeff7ef91307208e5f1846f3f0ae148c7ebd1d931f","first_computed_at":"2026-05-18T03:05:08.120387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:08.120387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GGUmEd2HsGGDscCreNum5akMcXxHqyZy70w5XtF4+chBnPmwLqbHwBJmjX+zc0p/44owyk3ep6B2RexA7q9+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:08.121182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fab1026fe406f8f4f85f3e0cfeab59749d6d749b3a74921586c2334e0c4a8c87","sha256:d604b9a8ce02604f36dfabbbd8c3b85be96b4c23d2e7096cb087dc56281074ea"],"state_sha256":"c974a11db06feb3dffabd5ece15a3d7ddbdeeb68683170f8ac3e5beea725f371"}