{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4HOGEHMKUPKPQFGQL2WN62REPE","short_pith_number":"pith:4HOGEHMK","schema_version":"1.0","canonical_sha256":"e1dc621d8aa3d4f814d05eacdf6a24791e7c25db3a2104a1cf315b77efc4c526","source":{"kind":"arxiv","id":"2105.09507","version":1},"attestation_state":"computed","paper":{"title":"A hybrid algorithm based on Community Detection and Multi-Attribute Decision-Making for Influence Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Masoud Jalayer, Mehrdad Mohammad Ali Kermani, Morvarid Azheian","submitted_at":"2021-05-20T04:17:22Z","abstract_excerpt":"The influence maximization problem is trying to identify a set of K nodes by which the spread of influence, diseases, or information is maximized. The optimization of influence by finding such a set is an NP-hard problem and a key issue in analyzing complex networks. In this paper, a new greedy and hybrid approach based on a community detection algorithm and a MADM technique (TOPSIS) is proposed to cope with the problem, called, Greedy TOPSIS and Community-Based (GTaCB) algorithm. The paper concisely introduces community detection and the TOPSIS technique, then it presents the pseudo-code of t"},"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":"2105.09507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-05-20T04:17:22Z","cross_cats_sorted":[],"title_canon_sha256":"ae0b60646abca73b9b9c104d9adc66e81b6c1afec46ba11f57180aa7caf6c108","abstract_canon_sha256":"e69906191e7602115d383a3ebdd7de2717604bf7db21d8f285b65dfe4bee3f8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:41:53.606312Z","signature_b64":"Dno/TwgjrvaB6cnXtFyb55yX3iXfC6CcaDH1gW5EHGiW0ifZ0qwbqQ+Ewcl1Is3XblEzJIxnvPwJCwIEHYn1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1dc621d8aa3d4f814d05eacdf6a24791e7c25db3a2104a1cf315b77efc4c526","last_reissued_at":"2026-07-05T02:41:53.605854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:41:53.605854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A hybrid algorithm based on Community Detection and Multi-Attribute Decision-Making for Influence Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Masoud Jalayer, Mehrdad Mohammad Ali Kermani, Morvarid Azheian","submitted_at":"2021-05-20T04:17:22Z","abstract_excerpt":"The influence maximization problem is trying to identify a set of K nodes by which the spread of influence, diseases, or information is maximized. The optimization of influence by finding such a set is an NP-hard problem and a key issue in analyzing complex networks. In this paper, a new greedy and hybrid approach based on a community detection algorithm and a MADM technique (TOPSIS) is proposed to cope with the problem, called, Greedy TOPSIS and Community-Based (GTaCB) algorithm. The paper concisely introduces community detection and the TOPSIS technique, then it presents the pseudo-code of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.09507","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/2105.09507/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":"2105.09507","created_at":"2026-07-05T02:41:53.605913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.09507v1","created_at":"2026-07-05T02:41:53.605913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.09507","created_at":"2026-07-05T02:41:53.605913+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HOGEHMKUPKP","created_at":"2026-07-05T02:41:53.605913+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HOGEHMKUPKPQFGQ","created_at":"2026-07-05T02:41:53.605913+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HOGEHMK","created_at":"2026-07-05T02:41:53.605913+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07625","citing_title":"Influence Maximization Considering Influence, Cost and Time","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HOGEHMKUPKPQFGQL2WN62REPE","json":"https://pith.science/pith/4HOGEHMKUPKPQFGQL2WN62REPE.json","graph_json":"https://pith.science/api/pith-number/4HOGEHMKUPKPQFGQL2WN62REPE/graph.json","events_json":"https://pith.science/api/pith-number/4HOGEHMKUPKPQFGQL2WN62REPE/events.json","paper":"https://pith.science/paper/4HOGEHMK"},"agent_actions":{"view_html":"https://pith.science/pith/4HOGEHMKUPKPQFGQL2WN62REPE","download_json":"https://pith.science/pith/4HOGEHMKUPKPQFGQL2WN62REPE.json","view_paper":"https://pith.science/paper/4HOGEHMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.09507&json=true","fetch_graph":"https://pith.science/api/pith-number/4HOGEHMKUPKPQFGQL2WN62REPE/graph.json","fetch_events":"https://pith.science/api/pith-number/4HOGEHMKUPKPQFGQL2WN62REPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HOGEHMKUPKPQFGQL2WN62REPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HOGEHMKUPKPQFGQL2WN62REPE/action/storage_attestation","attest_author":"https://pith.science/pith/4HOGEHMKUPKPQFGQL2WN62REPE/action/author_attestation","sign_citation":"https://pith.science/pith/4HOGEHMKUPKPQFGQL2WN62REPE/action/citation_signature","submit_replication":"https://pith.science/pith/4HOGEHMKUPKPQFGQL2WN62REPE/action/replication_record"}},"created_at":"2026-07-05T02:41:53.605913+00:00","updated_at":"2026-07-05T02:41:53.605913+00:00"}