{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BHLVDD5FRPG2X4CW2HJXQAUWYJ","short_pith_number":"pith:BHLVDD5F","schema_version":"1.0","canonical_sha256":"09d7518fa58bcdabf056d1d3780296c2459018d08a526a8462ce5bac7695061a","source":{"kind":"arxiv","id":"1805.02345","version":1},"attestation_state":"computed","paper":{"title":"Domination Cover Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"A. Shakiba, M. Alambardar Meybodi, M.R. Hooshmandasl, P. Sharifani","submitted_at":"2018-05-07T05:13:21Z","abstract_excerpt":"A set $D \\subseteq V$ for the graph $G=(V, E)$ is called a dominating set if any vertex $v\\in V\\setminus D$ has at least one neighbor in $D$. Fomin et al.[9] gave an algorithm for enumerating all minimal dominating sets with $n$ vertices in $O(1.7159^n)$ time. It is known that the number of minimal dominating sets for interval graphs and trees on $n$ vertices is at most $3^{n/3} \\approx 1.4422^n$. In this paper, we introduce the domination cover number as a new criterion for evaluating the dominating sets in graphs. The domination cover number of a dominating set $D$, denoted by $\\mathcal{C}_D"},"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.02345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-07T05:13:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bf67c857b5084264479c4f02939d31227ea84bea22e862c55d0eba3fbf768a31","abstract_canon_sha256":"468955f441e39f9172c35f657a7e881f4dd5754a76e55113dc6f6e4d75bcb1c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:59.745880Z","signature_b64":"5Qu7TMtUJV811GPCPMWv//HOCmyJzNysY8CdPXVthzzb0eezIEsx6tahLGitW1w+T8iOfGXm0st9YF0AcuNtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09d7518fa58bcdabf056d1d3780296c2459018d08a526a8462ce5bac7695061a","last_reissued_at":"2026-05-18T00:13:59.745148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:59.745148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination Cover Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"A. Shakiba, M. Alambardar Meybodi, M.R. Hooshmandasl, P. Sharifani","submitted_at":"2018-05-07T05:13:21Z","abstract_excerpt":"A set $D \\subseteq V$ for the graph $G=(V, E)$ is called a dominating set if any vertex $v\\in V\\setminus D$ has at least one neighbor in $D$. Fomin et al.[9] gave an algorithm for enumerating all minimal dominating sets with $n$ vertices in $O(1.7159^n)$ time. It is known that the number of minimal dominating sets for interval graphs and trees on $n$ vertices is at most $3^{n/3} \\approx 1.4422^n$. In this paper, we introduce the domination cover number as a new criterion for evaluating the dominating sets in graphs. The domination cover number of a dominating set $D$, denoted by $\\mathcal{C}_D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02345","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":"1805.02345","created_at":"2026-05-18T00:13:59.745256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02345v1","created_at":"2026-05-18T00:13:59.745256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02345","created_at":"2026-05-18T00:13:59.745256+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHLVDD5FRPG2","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHLVDD5FRPG2X4CW","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHLVDD5F","created_at":"2026-05-18T12:32:16.446611+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/BHLVDD5FRPG2X4CW2HJXQAUWYJ","json":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ.json","graph_json":"https://pith.science/api/pith-number/BHLVDD5FRPG2X4CW2HJXQAUWYJ/graph.json","events_json":"https://pith.science/api/pith-number/BHLVDD5FRPG2X4CW2HJXQAUWYJ/events.json","paper":"https://pith.science/paper/BHLVDD5F"},"agent_actions":{"view_html":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ","download_json":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ.json","view_paper":"https://pith.science/paper/BHLVDD5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02345&json=true","fetch_graph":"https://pith.science/api/pith-number/BHLVDD5FRPG2X4CW2HJXQAUWYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/BHLVDD5FRPG2X4CW2HJXQAUWYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/action/storage_attestation","attest_author":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/action/author_attestation","sign_citation":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/action/citation_signature","submit_replication":"https://pith.science/pith/BHLVDD5FRPG2X4CW2HJXQAUWYJ/action/replication_record"}},"created_at":"2026-05-18T00:13:59.745256+00:00","updated_at":"2026-05-18T00:13:59.745256+00:00"}