{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SRZG72MZG5AWNTKUFY2NT5ZYEC","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":"7cd6487bdeee9bc39b844e5eee3933a36f5e6f033f473fd5a1cef0fb3949a003","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-06T14:13:50Z","title_canon_sha256":"0016f38c27427f04d6a7a724fd774d6d11d748e124e27c9d6caf221c1025c577"},"schema_version":"1.0","source":{"id":"1908.02174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02174","created_at":"2026-07-04T23:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02174v1","created_at":"2026-07-04T23:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02174","created_at":"2026-07-04T23:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"SRZG72MZG5AW","created_at":"2026-07-04T23:51:51Z"},{"alias_kind":"pith_short_16","alias_value":"SRZG72MZG5AWNTKU","created_at":"2026-07-04T23:51:51Z"},{"alias_kind":"pith_short_8","alias_value":"SRZG72MZ","created_at":"2026-07-04T23:51:51Z"}],"graph_snapshots":[{"event_id":"sha256:73d0a10fe9f4dcd55369e4c2e022b49754ec3ac694d3bcd4922d297268ecbba8","target":"graph","created_at":"2026-07-04T23:51:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02174/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The enumeration of minimal connected dominating sets is known to be notoriously hard for general graphs. Currently, it is only known that the sets can be enumerated slightly faster than $\\mathcal{O}^{*}(2^n)$ and the algorithm is highly nontrivial. Moreover, it seems that it is hard to use bipartiteness as a structural aide when constructing enumeration algorithms. Hence, to the best of our knowledge, there is no known input-sensitive algorithm for enumerating minimal dominating sets, or one of their related sets, in bipartite graphs better than that of general graphs. In this paper, we provid","authors_text":"Mohamed Yosri Sayadi","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-06T14:13:50Z","title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02174","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:e1d75891c8943704a7b7f018f0f817e6a46636b290e14f74364d64356fba0416","target":"record","created_at":"2026-07-04T23:51:51Z","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":"7cd6487bdeee9bc39b844e5eee3933a36f5e6f033f473fd5a1cef0fb3949a003","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-06T14:13:50Z","title_canon_sha256":"0016f38c27427f04d6a7a724fd774d6d11d748e124e27c9d6caf221c1025c577"},"schema_version":"1.0","source":{"id":"1908.02174","kind":"arxiv","version":1}},"canonical_sha256":"94726fe999374166cd542e34d9f738208440205d137073be9b5e7cdf48eead28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94726fe999374166cd542e34d9f738208440205d137073be9b5e7cdf48eead28","first_computed_at":"2026-07-04T23:51:51.806752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:51.806752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"96G3MDr2paRuvEkO1LZF4ZUO9EviXkjdVtCOCgdPfZDMbahu3ZJGcBfAqbiN1xvbtOBRhmKbvyOeenk1wIhsCw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:51.807084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1d75891c8943704a7b7f018f0f817e6a46636b290e14f74364d64356fba0416","sha256:73d0a10fe9f4dcd55369e4c2e022b49754ec3ac694d3bcd4922d297268ecbba8"],"state_sha256":"b55afadf6108a299a26b0270e73fef450999095cb37778e9ed87b2c71803ed77"}