{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EHLGDW7P6HFTZNGH6GNAUW7QOF","short_pith_number":"pith:EHLGDW7P","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"},"canonical_sha256":"21d661dbeff1cb3cb4c7f19a0a5bf07164830d8dc641ea49e28946bdfe67465d","source":{"kind":"arxiv","id":"1404.3882","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3882","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3882v1","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3882","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"pith_short_12","alias_value":"EHLGDW7P6HFT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EHLGDW7P6HFTZNGH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EHLGDW7P","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EHLGDW7P6HFTZNGH6GNAUW7QOF","target":"record","payload":{"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"},"canonical_sha256":"21d661dbeff1cb3cb4c7f19a0a5bf07164830d8dc641ea49e28946bdfe67465d","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"},"source_kind":"arxiv","source_id":"1404.3882","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uci8LPOTOOpdtxiH0hNDcqlnzcAlnSu+PIGKuGVaiZMRE5AkSfvGVF/YIVwWeILa/M2EEyMrs8Oc+1URIQSwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:07:36.371536Z"},"content_sha256":"f90680d9de4b40be7bb07d97d8ebde5dd6f9085dd4dfdca59e264ffbeaa4bbef","schema_version":"1.0","event_id":"sha256:f90680d9de4b40be7bb07d97d8ebde5dd6f9085dd4dfdca59e264ffbeaa4bbef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EHLGDW7P6HFTZNGH6GNAUW7QOF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4oXOkXN5hODaDz+sGpEXNUWM/PM3OLJZuW2wW48dZCnD2CNb42uSYGQ9l5Ej7isfIo0+sr/DH+v5t77SlbwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:07:36.371888Z"},"content_sha256":"2fb3413313a18e6af9a67abf069395027b6d2a1a9e129eedd1f077b76d11d4ab","schema_version":"1.0","event_id":"sha256:2fb3413313a18e6af9a67abf069395027b6d2a1a9e129eedd1f077b76d11d4ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/bundle.json","state_url":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T17:07:36Z","links":{"resolver":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF","bundle":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/bundle.json","state":"https://pith.science/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHLGDW7P6HFTZNGH6GNAUW7QOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EHLGDW7P6HFTZNGH6GNAUW7QOF","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":"7062b0118d99f3279df617bd0a4756521cc2b0aca15be38f98dafdf4a68bfde7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-15T12:01:55Z","title_canon_sha256":"8658f8a91e778abd0298db3aefbbec4bfeb89ffc0fbf6af32730c2c233231a88"},"schema_version":"1.0","source":{"id":"1404.3882","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3882","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3882v1","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3882","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"pith_short_12","alias_value":"EHLGDW7P6HFT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EHLGDW7P6HFTZNGH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EHLGDW7P","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:2fb3413313a18e6af9a67abf069395027b6d2a1a9e129eedd1f077b76d11d4ab","target":"graph","created_at":"2026-05-18T02:54:13Z","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":"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","authors_text":"Fedor V. Fomin, Ioan Todinca, Mathieu Liedloff, Pedro Montealegre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-15T12:01:55Z","title":"Algorithms parameterized by vertex cover and modular width, through potential maximal cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3882","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:f90680d9de4b40be7bb07d97d8ebde5dd6f9085dd4dfdca59e264ffbeaa4bbef","target":"record","created_at":"2026-05-18T02:54:13Z","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":"7062b0118d99f3279df617bd0a4756521cc2b0aca15be38f98dafdf4a68bfde7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-15T12:01:55Z","title_canon_sha256":"8658f8a91e778abd0298db3aefbbec4bfeb89ffc0fbf6af32730c2c233231a88"},"schema_version":"1.0","source":{"id":"1404.3882","kind":"arxiv","version":1}},"canonical_sha256":"21d661dbeff1cb3cb4c7f19a0a5bf07164830d8dc641ea49e28946bdfe67465d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21d661dbeff1cb3cb4c7f19a0a5bf07164830d8dc641ea49e28946bdfe67465d","first_computed_at":"2026-05-18T02:54:13.423149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:13.423149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NlW7XaB42qEVVzCtlt2Fh5vj5ZPCO2Bckwh+XntWVqBJ9VLOv8CjC+ktKzTlpXDo1oiondTtCfGkggseXRmNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:13.423594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3882","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f90680d9de4b40be7bb07d97d8ebde5dd6f9085dd4dfdca59e264ffbeaa4bbef","sha256:2fb3413313a18e6af9a67abf069395027b6d2a1a9e129eedd1f077b76d11d4ab"],"state_sha256":"d9124242021007629eef8fccfefd8cd824a5f16d4e65dbe54250931ff32407cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+xWLgjzQghhveoeNHpUCsI6vaqYzFm4XZiCfNOFd511VqbVjw5pFGqOnx3T6uj2vFFWvUkalxStz0+v6mgEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:07:36.373924Z","bundle_sha256":"00e830cbb70f6bf3e2da53acf303b7e52b91eb43cac1409567ce950b0a878ee9"}}