{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SRZG72MZG5AWNTKUFY2NT5ZYEC","short_pith_number":"pith:SRZG72MZ","schema_version":"1.0","canonical_sha256":"94726fe999374166cd542e34d9f738208440205d137073be9b5e7cdf48eead28","source":{"kind":"arxiv","id":"1908.02174","version":1},"attestation_state":"computed","paper":{"title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Mohamed Yosri Sayadi","submitted_at":"2019-08-06T14:13:50Z","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"},"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":"1908.02174","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-06T14:13:50Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"0016f38c27427f04d6a7a724fd774d6d11d748e124e27c9d6caf221c1025c577","abstract_canon_sha256":"7cd6487bdeee9bc39b844e5eee3933a36f5e6f033f473fd5a1cef0fb3949a003"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:51.807084Z","signature_b64":"96G3MDr2paRuvEkO1LZF4ZUO9EviXkjdVtCOCgdPfZDMbahu3ZJGcBfAqbiN1xvbtOBRhmKbvyOeenk1wIhsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94726fe999374166cd542e34d9f738208440205d137073be9b5e7cdf48eead28","last_reissued_at":"2026-07-04T23:51:51.806752Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:51.806752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum number of minimal connected dominating sets in convex bipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Mohamed Yosri Sayadi","submitted_at":"2019-08-06T14:13:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02174","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02174/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":"1908.02174","created_at":"2026-07-04T23:51:51.806807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02174v1","created_at":"2026-07-04T23:51:51.806807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02174","created_at":"2026-07-04T23:51:51.806807+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRZG72MZG5AW","created_at":"2026-07-04T23:51:51.806807+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRZG72MZG5AWNTKU","created_at":"2026-07-04T23:51:51.806807+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRZG72MZ","created_at":"2026-07-04T23:51:51.806807+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/SRZG72MZG5AWNTKUFY2NT5ZYEC","json":"https://pith.science/pith/SRZG72MZG5AWNTKUFY2NT5ZYEC.json","graph_json":"https://pith.science/api/pith-number/SRZG72MZG5AWNTKUFY2NT5ZYEC/graph.json","events_json":"https://pith.science/api/pith-number/SRZG72MZG5AWNTKUFY2NT5ZYEC/events.json","paper":"https://pith.science/paper/SRZG72MZ"},"agent_actions":{"view_html":"https://pith.science/pith/SRZG72MZG5AWNTKUFY2NT5ZYEC","download_json":"https://pith.science/pith/SRZG72MZG5AWNTKUFY2NT5ZYEC.json","view_paper":"https://pith.science/paper/SRZG72MZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02174&json=true","fetch_graph":"https://pith.science/api/pith-number/SRZG72MZG5AWNTKUFY2NT5ZYEC/graph.json","fetch_events":"https://pith.science/api/pith-number/SRZG72MZG5AWNTKUFY2NT5ZYEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRZG72MZG5AWNTKUFY2NT5ZYEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRZG72MZG5AWNTKUFY2NT5ZYEC/action/storage_attestation","attest_author":"https://pith.science/pith/SRZG72MZG5AWNTKUFY2NT5ZYEC/action/author_attestation","sign_citation":"https://pith.science/pith/SRZG72MZG5AWNTKUFY2NT5ZYEC/action/citation_signature","submit_replication":"https://pith.science/pith/SRZG72MZG5AWNTKUFY2NT5ZYEC/action/replication_record"}},"created_at":"2026-07-04T23:51:51.806807+00:00","updated_at":"2026-07-04T23:51:51.806807+00:00"}