{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EHLGDW7P6HFTZNGH6GNAUW7QOF","short_pith_number":"pith:EHLGDW7P","schema_version":"1.0","canonical_sha256":"21d661dbeff1cb3cb4c7f19a0a5bf07164830d8dc641ea49e28946bdfe67465d","source":{"kind":"arxiv","id":"1404.3882","version":1},"attestation_state":"computed","paper":{"title":"Algorithms parameterized by vertex cover and modular width, through potential maximal cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Ioan Todinca, Mathieu Liedloff, Pedro Montealegre","submitted_at":"2014-04-15T12:01:55Z","abstract_excerpt":"In this paper we give upper bounds on the number of minimal separators and potential maximal cliques of graphs w.r.t. two graph parameters, namely vertex cover ($\\operatorname{vc}$) and modular width ($\\operatorname{mw}$). We prove that for any graph, the number of minimal separators is $\\mathcal{O}^*(3^{\\operatorname{vc}})$ and $\\mathcal{O}^*(1.6181^{\\operatorname{mw}})$, and the number of potential maximal cliques is $\\mathcal{O}^*(4^{\\operatorname{vc}})$ and $\\mathcal{O}^*(1.7347^{\\operatorname{mw}})$, and these objects can be listed within the same running times. (The $\\mathcal{O}^*$ notat"},"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":"1404.3882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-15T12:01:55Z","cross_cats_sorted":[],"title_canon_sha256":"8658f8a91e778abd0298db3aefbbec4bfeb89ffc0fbf6af32730c2c233231a88","abstract_canon_sha256":"7062b0118d99f3279df617bd0a4756521cc2b0aca15be38f98dafdf4a68bfde7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:13.423594Z","signature_b64":"NlW7XaB42qEVVzCtlt2Fh5vj5ZPCO2Bckwh+XntWVqBJ9VLOv8CjC+ktKzTlpXDo1oiondTtCfGkggseXRmNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21d661dbeff1cb3cb4c7f19a0a5bf07164830d8dc641ea49e28946bdfe67465d","last_reissued_at":"2026-05-18T02:54:13.423149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:13.423149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms parameterized by vertex cover and modular width, through potential maximal cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Ioan Todinca, Mathieu Liedloff, Pedro Montealegre","submitted_at":"2014-04-15T12:01:55Z","abstract_excerpt":"In this paper we give upper bounds on the number of minimal separators and potential maximal cliques of graphs w.r.t. two graph parameters, namely vertex cover ($\\operatorname{vc}$) and modular width ($\\operatorname{mw}$). We prove that for any graph, the number of minimal separators is $\\mathcal{O}^*(3^{\\operatorname{vc}})$ and $\\mathcal{O}^*(1.6181^{\\operatorname{mw}})$, and the number of potential maximal cliques is $\\mathcal{O}^*(4^{\\operatorname{vc}})$ and $\\mathcal{O}^*(1.7347^{\\operatorname{mw}})$, and these objects can be listed within the same running times. (The $\\mathcal{O}^*$ notat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3882","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":"1404.3882","created_at":"2026-05-18T02:54:13.423218+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3882v1","created_at":"2026-05-18T02:54:13.423218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3882","created_at":"2026-05-18T02:54:13.423218+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHLGDW7P6HFT","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHLGDW7P6HFTZNGH","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHLGDW7P","created_at":"2026-05-18T12:28:25.294606+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/EHLGDW7P6HFTZNGH6GNAUW7QOF","json":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF.json","graph_json":"https://pith.science/api/pith-number/EHLGDW7P6HFTZNGH6GNAUW7QOF/graph.json","events_json":"https://pith.science/api/pith-number/EHLGDW7P6HFTZNGH6GNAUW7QOF/events.json","paper":"https://pith.science/paper/EHLGDW7P"},"agent_actions":{"view_html":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF","download_json":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF.json","view_paper":"https://pith.science/paper/EHLGDW7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3882&json=true","fetch_graph":"https://pith.science/api/pith-number/EHLGDW7P6HFTZNGH6GNAUW7QOF/graph.json","fetch_events":"https://pith.science/api/pith-number/EHLGDW7P6HFTZNGH6GNAUW7QOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/action/storage_attestation","attest_author":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/action/author_attestation","sign_citation":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/action/citation_signature","submit_replication":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/action/replication_record"}},"created_at":"2026-05-18T02:54:13.423218+00:00","updated_at":"2026-05-18T02:54:13.423218+00:00"}