{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:J44BQMDWEJLIIBEHOOCG3EP6B3","short_pith_number":"pith:J44BQMDW","schema_version":"1.0","canonical_sha256":"4f38183076225684048773846d91fe0eddd8e6cb9664f64b8715ddd255bacd7a","source":{"kind":"arxiv","id":"2012.04883","version":2},"attestation_state":"computed","paper":{"title":"On Distributed Algorithms for Minimum Dominating Set problem, from theory to application","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ehsan Futuhi, Sharareh Alipour, Shayan Karimi","submitted_at":"2020-12-09T06:17:21Z","abstract_excerpt":"In this paper, we propose a distributed algorithm for the minimum dominating set problem. For some especial networks, we prove theoretically that the achieved answer by our proposed algorithm is a constant approximation factor of the exact answer. This problem arises naturally in social networks, for example in news spreading, avoiding rumor spreading and recommendation spreading. So we implement our algorithm on massive social networks and compare our results with the state of the art algorithms. Also, we extend our algorithm to solve the $k$-distance dominating set problem and experimentally"},"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":"2012.04883","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2020-12-09T06:17:21Z","cross_cats_sorted":[],"title_canon_sha256":"72117539f75735a9a1572dde225fb311bb1e2317488db4b931a4540a192737a3","abstract_canon_sha256":"24be66e5c5619c9488b0f1599bdf4055786a081c8336004b3c2c12a9ed0e2b4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:13.726323Z","signature_b64":"0FV2asmNvrU2P271dqqBCFD8jM8NX1zoF7kIq9fj4ns4MGDcT9se/AB54VV8b5cHCxQd+GXD20yQTcTKOY/ZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f38183076225684048773846d91fe0eddd8e6cb9664f64b8715ddd255bacd7a","last_reissued_at":"2026-07-05T02:04:13.725849Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:13.725849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Distributed Algorithms for Minimum Dominating Set problem, from theory to application","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ehsan Futuhi, Sharareh Alipour, Shayan Karimi","submitted_at":"2020-12-09T06:17:21Z","abstract_excerpt":"In this paper, we propose a distributed algorithm for the minimum dominating set problem. For some especial networks, we prove theoretically that the achieved answer by our proposed algorithm is a constant approximation factor of the exact answer. This problem arises naturally in social networks, for example in news spreading, avoiding rumor spreading and recommendation spreading. So we implement our algorithm on massive social networks and compare our results with the state of the art algorithms. Also, we extend our algorithm to solve the $k$-distance dominating set problem and experimentally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04883","kind":"arxiv","version":2},"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/2012.04883/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":"2012.04883","created_at":"2026-07-05T02:04:13.725900+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.04883v2","created_at":"2026-07-05T02:04:13.725900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04883","created_at":"2026-07-05T02:04:13.725900+00:00"},{"alias_kind":"pith_short_12","alias_value":"J44BQMDWEJLI","created_at":"2026-07-05T02:04:13.725900+00:00"},{"alias_kind":"pith_short_16","alias_value":"J44BQMDWEJLIIBEH","created_at":"2026-07-05T02:04:13.725900+00:00"},{"alias_kind":"pith_short_8","alias_value":"J44BQMDW","created_at":"2026-07-05T02:04:13.725900+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.14328","citing_title":"ScaloWork: Useful Proof-of-Work with Distributed Pool Mining","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J44BQMDWEJLIIBEHOOCG3EP6B3","json":"https://pith.science/pith/J44BQMDWEJLIIBEHOOCG3EP6B3.json","graph_json":"https://pith.science/api/pith-number/J44BQMDWEJLIIBEHOOCG3EP6B3/graph.json","events_json":"https://pith.science/api/pith-number/J44BQMDWEJLIIBEHOOCG3EP6B3/events.json","paper":"https://pith.science/paper/J44BQMDW"},"agent_actions":{"view_html":"https://pith.science/pith/J44BQMDWEJLIIBEHOOCG3EP6B3","download_json":"https://pith.science/pith/J44BQMDWEJLIIBEHOOCG3EP6B3.json","view_paper":"https://pith.science/paper/J44BQMDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.04883&json=true","fetch_graph":"https://pith.science/api/pith-number/J44BQMDWEJLIIBEHOOCG3EP6B3/graph.json","fetch_events":"https://pith.science/api/pith-number/J44BQMDWEJLIIBEHOOCG3EP6B3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J44BQMDWEJLIIBEHOOCG3EP6B3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J44BQMDWEJLIIBEHOOCG3EP6B3/action/storage_attestation","attest_author":"https://pith.science/pith/J44BQMDWEJLIIBEHOOCG3EP6B3/action/author_attestation","sign_citation":"https://pith.science/pith/J44BQMDWEJLIIBEHOOCG3EP6B3/action/citation_signature","submit_replication":"https://pith.science/pith/J44BQMDWEJLIIBEHOOCG3EP6B3/action/replication_record"}},"created_at":"2026-07-05T02:04:13.725900+00:00","updated_at":"2026-07-05T02:04:13.725900+00:00"}