{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KUJNLOSTMQLLWCMOAHNQQNE2PJ","short_pith_number":"pith:KUJNLOST","schema_version":"1.0","canonical_sha256":"5512d5ba536416bb098e01db08349a7a6ec81047ce48d720ff8aabbf7de1f12c","source":{"kind":"arxiv","id":"1805.11275","version":8},"attestation_state":"computed","paper":{"title":"More applications of the d-neighbor equivalence: acyclicity and connectivity constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Mamadou Moustapha Kant\\'e","submitted_at":"2018-05-29T07:16:15Z","abstract_excerpt":"In this paper, we design a framework to obtain efficient algorithms for several problems with a global constraint (acyclicity or connectivity) such as Connected Dominating Set, Node Weighted Steiner Tree, Maximum Induced Tree, Longest Induced Path, and Feedback Vertex Set. We design a meta-algorithm that solves all these problems and whose running time is upper bounded by $2^{O(k)}\\cdot n^{O(1)}$, $2^{O(k \\log(k))}\\cdot n^{O(1)}$, $2^{O(k^2)}\\cdot n^{O(1)}$ and $n^{O(k)}$ where $k$ is respectively the clique-width, $\\mathbf{Q}$-rank-width, rank-width and maximum induced matching width of a giv"},"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":"1805.11275","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-29T07:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"d90c7bb9b0d407bf5d7ad25e397b3ed5adf1c79162b43eedfb29c919b976d2fa","abstract_canon_sha256":"db263c0b6ce4ad609ae0623e0659120bbc2fcd8978725aa9c3fa9db9582eaad0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:34.262960Z","signature_b64":"NEOobbSV1LPu8ShLVmWdY3766JEq6PFvvfEH544LhZ6w43GG3gybqmnEFYFM9XAaO1YoIKvfoHrJQxUeN482Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5512d5ba536416bb098e01db08349a7a6ec81047ce48d720ff8aabbf7de1f12c","last_reissued_at":"2026-07-05T06:58:34.262520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:34.262520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More applications of the d-neighbor equivalence: acyclicity and connectivity constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Mamadou Moustapha Kant\\'e","submitted_at":"2018-05-29T07:16:15Z","abstract_excerpt":"In this paper, we design a framework to obtain efficient algorithms for several problems with a global constraint (acyclicity or connectivity) such as Connected Dominating Set, Node Weighted Steiner Tree, Maximum Induced Tree, Longest Induced Path, and Feedback Vertex Set. We design a meta-algorithm that solves all these problems and whose running time is upper bounded by $2^{O(k)}\\cdot n^{O(1)}$, $2^{O(k \\log(k))}\\cdot n^{O(1)}$, $2^{O(k^2)}\\cdot n^{O(1)}$ and $n^{O(k)}$ where $k$ is respectively the clique-width, $\\mathbf{Q}$-rank-width, rank-width and maximum induced matching width of a giv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11275","kind":"arxiv","version":8},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.11275/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1805.11275","created_at":"2026-07-05T06:58:34.262581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11275v8","created_at":"2026-07-05T06:58:34.262581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11275","created_at":"2026-07-05T06:58:34.262581+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUJNLOSTMQLL","created_at":"2026-07-05T06:58:34.262581+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUJNLOSTMQLLWCMO","created_at":"2026-07-05T06:58:34.262581+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUJNLOST","created_at":"2026-07-05T06:58:34.262581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.04132","citing_title":"Linear MIM-Width of Trees","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ","json":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ.json","graph_json":"https://pith.science/api/pith-number/KUJNLOSTMQLLWCMOAHNQQNE2PJ/graph.json","events_json":"https://pith.science/api/pith-number/KUJNLOSTMQLLWCMOAHNQQNE2PJ/events.json","paper":"https://pith.science/paper/KUJNLOST"},"agent_actions":{"view_html":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ","download_json":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ.json","view_paper":"https://pith.science/paper/KUJNLOST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11275&json=true","fetch_graph":"https://pith.science/api/pith-number/KUJNLOSTMQLLWCMOAHNQQNE2PJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KUJNLOSTMQLLWCMOAHNQQNE2PJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/action/storage_attestation","attest_author":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/action/author_attestation","sign_citation":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/action/citation_signature","submit_replication":"https://pith.science/pith/KUJNLOSTMQLLWCMOAHNQQNE2PJ/action/replication_record"}},"created_at":"2026-07-05T06:58:34.262581+00:00","updated_at":"2026-07-05T06:58:34.262581+00:00"}