{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HSOXD2JF3J74RC6THG3B2IKHDS","short_pith_number":"pith:HSOXD2JF","schema_version":"1.0","canonical_sha256":"3c9d71e925da7fc88bd339b61d21471cb99982d5e17d4c82ea4fdf5c2bbbeb45","source":{"kind":"arxiv","id":"2009.07325","version":2},"attestation_state":"computed","paper":{"title":"gIM: GPU Accelerated RIS-based Influence Maximization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Matin Hashemi, Saber Salehkaleybar, Soheil Shahrouz","submitted_at":"2020-09-15T19:06:10Z","abstract_excerpt":"Given a social network modeled as a weighted graph $G$, the influence maximization problem seeks $k$ vertices to become initially influenced, to maximize the expected number of influenced nodes under a particular diffusion model. The influence maximization problem has been proven to be NP-hard, and most proposed solutions to the problem are approximate greedy algorithms, which can guarantee a tunable approximation ratio for their results with respect to the optimal solution. The state-of-the-art algorithms are based on Reverse Influence Sampling (RIS) technique, which can offer both computatio"},"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":"2009.07325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-15T19:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"1a042890ac5d76aa28cc5308fcead8ae643eda8f44bed6cd2a2fe14999e96a59","abstract_canon_sha256":"a253b99387291e3caa2504484f568b26a33c477af354b4578a58a6b884ff02f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:42.118399Z","signature_b64":"5EMFquxJv+Hn0p6s1AYwmkd7f9p5wS3F+5mWLnl1BHyEDIetYwFtWWgui+kE6NMpoC3DuPOyrG6SnitWvnc4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c9d71e925da7fc88bd339b61d21471cb99982d5e17d4c82ea4fdf5c2bbbeb45","last_reissued_at":"2026-07-05T02:30:42.117784Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:42.117784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"gIM: GPU Accelerated RIS-based Influence Maximization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Matin Hashemi, Saber Salehkaleybar, Soheil Shahrouz","submitted_at":"2020-09-15T19:06:10Z","abstract_excerpt":"Given a social network modeled as a weighted graph $G$, the influence maximization problem seeks $k$ vertices to become initially influenced, to maximize the expected number of influenced nodes under a particular diffusion model. The influence maximization problem has been proven to be NP-hard, and most proposed solutions to the problem are approximate greedy algorithms, which can guarantee a tunable approximation ratio for their results with respect to the optimal solution. The state-of-the-art algorithms are based on Reverse Influence Sampling (RIS) technique, which can offer both computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.07325","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/2009.07325/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":"2009.07325","created_at":"2026-07-05T02:30:42.117951+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.07325v2","created_at":"2026-07-05T02:30:42.117951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.07325","created_at":"2026-07-05T02:30:42.117951+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSOXD2JF3J74","created_at":"2026-07-05T02:30:42.117951+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSOXD2JF3J74RC6T","created_at":"2026-07-05T02:30:42.117951+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSOXD2JF","created_at":"2026-07-05T02:30:42.117951+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/HSOXD2JF3J74RC6THG3B2IKHDS","json":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS.json","graph_json":"https://pith.science/api/pith-number/HSOXD2JF3J74RC6THG3B2IKHDS/graph.json","events_json":"https://pith.science/api/pith-number/HSOXD2JF3J74RC6THG3B2IKHDS/events.json","paper":"https://pith.science/paper/HSOXD2JF"},"agent_actions":{"view_html":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS","download_json":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS.json","view_paper":"https://pith.science/paper/HSOXD2JF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.07325&json=true","fetch_graph":"https://pith.science/api/pith-number/HSOXD2JF3J74RC6THG3B2IKHDS/graph.json","fetch_events":"https://pith.science/api/pith-number/HSOXD2JF3J74RC6THG3B2IKHDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS/action/storage_attestation","attest_author":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS/action/author_attestation","sign_citation":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS/action/citation_signature","submit_replication":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS/action/replication_record"}},"created_at":"2026-07-05T02:30:42.117951+00:00","updated_at":"2026-07-05T02:30:42.117951+00:00"}