{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:23LH7DPWG2TZYWPZTQIGYIR2AA","short_pith_number":"pith:23LH7DPW","schema_version":"1.0","canonical_sha256":"d6d67f8df636a79c59f99c106c223a000db3d5fb7432b17bbb242c795f413948","source":{"kind":"arxiv","id":"1707.03584","version":3},"attestation_state":"computed","paper":{"title":"Fast exact algorithms for some connectivity problems parametrized by clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Benjamin Bergougnoux, Mamadou Moustapha Kant\\'e","submitted_at":"2017-07-12T07:59:47Z","abstract_excerpt":"Given a clique-width $k$-expression of a graph $G$, we provide $2^{O(k)}\\cdot n$ time algorithms for connectivity constraints on locally checkable properties such as Node-Weighted Steiner Tree, Connected Dominating Set, or Connected Vertex Cover. We also propose a $2^{O(k)}\\cdot n$ time algorithm for Feedback Vertex Set. The best running times for all the considered cases were either $2^{O(k\\cdot \\log(k))}\\cdot n^{O(1)}$ or worse."},"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":"1707.03584","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-12T07:59:47Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"f1bf8538aae51c0346c13dfbc9dea27fbfd0ac06ded49dddbd27a47b4f4c3182","abstract_canon_sha256":"70e8c1926ff74ffbc912049c8ea433ac8750ae1009ecd3428eb822edf43b481a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:50.718737Z","signature_b64":"jl2jJpD0XEX81+lCGv4IljE85OhHaBrLURv3Y0wEQOzZiSAqwNeKCtWub1oIlJjqUiZA1Gs+Qr+s8xq303H5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6d67f8df636a79c59f99c106c223a000db3d5fb7432b17bbb242c795f413948","last_reissued_at":"2026-05-18T00:07:50.717986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:50.717986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast exact algorithms for some connectivity problems parametrized by clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Benjamin Bergougnoux, Mamadou Moustapha Kant\\'e","submitted_at":"2017-07-12T07:59:47Z","abstract_excerpt":"Given a clique-width $k$-expression of a graph $G$, we provide $2^{O(k)}\\cdot n$ time algorithms for connectivity constraints on locally checkable properties such as Node-Weighted Steiner Tree, Connected Dominating Set, or Connected Vertex Cover. We also propose a $2^{O(k)}\\cdot n$ time algorithm for Feedback Vertex Set. The best running times for all the considered cases were either $2^{O(k\\cdot \\log(k))}\\cdot n^{O(1)}$ or worse."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03584","kind":"arxiv","version":3},"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":"1707.03584","created_at":"2026-05-18T00:07:50.718103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03584v3","created_at":"2026-05-18T00:07:50.718103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03584","created_at":"2026-05-18T00:07:50.718103+00:00"},{"alias_kind":"pith_short_12","alias_value":"23LH7DPWG2TZ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"23LH7DPWG2TZYWPZ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"23LH7DPW","created_at":"2026-05-18T12:30:55.937587+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/23LH7DPWG2TZYWPZTQIGYIR2AA","json":"https://pith.science/pith/23LH7DPWG2TZYWPZTQIGYIR2AA.json","graph_json":"https://pith.science/api/pith-number/23LH7DPWG2TZYWPZTQIGYIR2AA/graph.json","events_json":"https://pith.science/api/pith-number/23LH7DPWG2TZYWPZTQIGYIR2AA/events.json","paper":"https://pith.science/paper/23LH7DPW"},"agent_actions":{"view_html":"https://pith.science/pith/23LH7DPWG2TZYWPZTQIGYIR2AA","download_json":"https://pith.science/pith/23LH7DPWG2TZYWPZTQIGYIR2AA.json","view_paper":"https://pith.science/paper/23LH7DPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03584&json=true","fetch_graph":"https://pith.science/api/pith-number/23LH7DPWG2TZYWPZTQIGYIR2AA/graph.json","fetch_events":"https://pith.science/api/pith-number/23LH7DPWG2TZYWPZTQIGYIR2AA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23LH7DPWG2TZYWPZTQIGYIR2AA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23LH7DPWG2TZYWPZTQIGYIR2AA/action/storage_attestation","attest_author":"https://pith.science/pith/23LH7DPWG2TZYWPZTQIGYIR2AA/action/author_attestation","sign_citation":"https://pith.science/pith/23LH7DPWG2TZYWPZTQIGYIR2AA/action/citation_signature","submit_replication":"https://pith.science/pith/23LH7DPWG2TZYWPZTQIGYIR2AA/action/replication_record"}},"created_at":"2026-05-18T00:07:50.718103+00:00","updated_at":"2026-05-18T00:07:50.718103+00:00"}