{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HDEZKDQ5QNE3Z7RHCMKSMHKWUP","short_pith_number":"pith:HDEZKDQ5","canonical_record":{"source":{"id":"2408.10982","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-08-20T16:18:19Z","cross_cats_sorted":[],"title_canon_sha256":"6ab2b18666322db26c9d0b1856427481e62813960ccab08cb706e1ad71495d65","abstract_canon_sha256":"0bb48a8c52785267f6d915b61d61380cc0f52dd62729975eec51f5f95031d1ea"},"schema_version":"1.0"},"canonical_sha256":"38c9950e1d8349bcfe271315261d56a3fd1bd83e191427ca8980145204c812c8","source":{"kind":"arxiv","id":"2408.10982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.10982","created_at":"2026-07-05T08:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"2408.10982v1","created_at":"2026-07-05T08:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10982","created_at":"2026-07-05T08:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"HDEZKDQ5QNE3","created_at":"2026-07-05T08:57:20Z"},{"alias_kind":"pith_short_16","alias_value":"HDEZKDQ5QNE3Z7RH","created_at":"2026-07-05T08:57:20Z"},{"alias_kind":"pith_short_8","alias_value":"HDEZKDQ5","created_at":"2026-07-05T08:57:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HDEZKDQ5QNE3Z7RHCMKSMHKWUP","target":"record","payload":{"canonical_record":{"source":{"id":"2408.10982","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-08-20T16:18:19Z","cross_cats_sorted":[],"title_canon_sha256":"6ab2b18666322db26c9d0b1856427481e62813960ccab08cb706e1ad71495d65","abstract_canon_sha256":"0bb48a8c52785267f6d915b61d61380cc0f52dd62729975eec51f5f95031d1ea"},"schema_version":"1.0"},"canonical_sha256":"38c9950e1d8349bcfe271315261d56a3fd1bd83e191427ca8980145204c812c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:20.606352Z","signature_b64":"He0n+/P1pEtSbh3Tkxs6Dg4am3tKo7/xNxL8toB+3cAeEDMNqJQx2IhU7eyi26epfkfCoVBuh/xvD7vQCNpAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38c9950e1d8349bcfe271315261d56a3fd1bd83e191427ca8980145204c812c8","last_reissued_at":"2026-07-05T08:57:20.605900Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:20.605900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.10982","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1cdKrrNvYrCsoqyN65+tGQL+p8hWqL+jq/5VmdLssyWOfDpxJK8ziaCRC/hDmGwRdhgpcYb4C3jLnJVOQNmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T00:32:43.850062Z"},"content_sha256":"149e15813cddb0b187800932a2c19799965ee848d8b199e0a6b0f93548668f16","schema_version":"1.0","event_id":"sha256:149e15813cddb0b187800932a2c19799965ee848d8b199e0a6b0f93548668f16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HDEZKDQ5QNE3Z7RHCMKSMHKWUP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GreediRIS: Scalable Influence Maximization using Distributed Streaming Maximum Cover","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ananth Kalyanaraman, Mahantesh Halappanavar, Marco Minutoli, Reet Barik, S M Ferdous, Wade Cappa","submitted_at":"2024-08-20T16:18:19Z","abstract_excerpt":"Influence maximization--the problem of identifying a subset of k influential seeds (vertices) in a network--is a classical problem in network science with numerous applications. The problem is NP-hard, but there exist efficient polynomial time approximations. However, scaling these algorithms still remain a daunting task due to the complexities associated with steps involving stochastic sampling and large-scale aggregations. In this paper, we present a new parallel distributed approximation algorithm for influence maximization with provable approximation guarantees. Our approach, which we call"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10982","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/2408.10982/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rIVFvG5TGVpaobhce8YpR39HNRcpKRhO8UcHdKVkPckdC1ZDoRdeSN1pqd2sogKJMcQ9aeMnM3laYhcyo8bVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T00:32:43.850571Z"},"content_sha256":"32ba9f156d72de1d4be72bf4b7ba2d239794d744851e16b14b8f4dee74e3c09e","schema_version":"1.0","event_id":"sha256:32ba9f156d72de1d4be72bf4b7ba2d239794d744851e16b14b8f4dee74e3c09e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDEZKDQ5QNE3Z7RHCMKSMHKWUP/bundle.json","state_url":"https://pith.science/pith/HDEZKDQ5QNE3Z7RHCMKSMHKWUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDEZKDQ5QNE3Z7RHCMKSMHKWUP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T00:32:43Z","links":{"resolver":"https://pith.science/pith/HDEZKDQ5QNE3Z7RHCMKSMHKWUP","bundle":"https://pith.science/pith/HDEZKDQ5QNE3Z7RHCMKSMHKWUP/bundle.json","state":"https://pith.science/pith/HDEZKDQ5QNE3Z7RHCMKSMHKWUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDEZKDQ5QNE3Z7RHCMKSMHKWUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HDEZKDQ5QNE3Z7RHCMKSMHKWUP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0bb48a8c52785267f6d915b61d61380cc0f52dd62729975eec51f5f95031d1ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-08-20T16:18:19Z","title_canon_sha256":"6ab2b18666322db26c9d0b1856427481e62813960ccab08cb706e1ad71495d65"},"schema_version":"1.0","source":{"id":"2408.10982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.10982","created_at":"2026-07-05T08:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"2408.10982v1","created_at":"2026-07-05T08:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10982","created_at":"2026-07-05T08:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"HDEZKDQ5QNE3","created_at":"2026-07-05T08:57:20Z"},{"alias_kind":"pith_short_16","alias_value":"HDEZKDQ5QNE3Z7RH","created_at":"2026-07-05T08:57:20Z"},{"alias_kind":"pith_short_8","alias_value":"HDEZKDQ5","created_at":"2026-07-05T08:57:20Z"}],"graph_snapshots":[{"event_id":"sha256:32ba9f156d72de1d4be72bf4b7ba2d239794d744851e16b14b8f4dee74e3c09e","target":"graph","created_at":"2026-07-05T08:57:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.10982/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Influence maximization--the problem of identifying a subset of k influential seeds (vertices) in a network--is a classical problem in network science with numerous applications. The problem is NP-hard, but there exist efficient polynomial time approximations. However, scaling these algorithms still remain a daunting task due to the complexities associated with steps involving stochastic sampling and large-scale aggregations. In this paper, we present a new parallel distributed approximation algorithm for influence maximization with provable approximation guarantees. Our approach, which we call","authors_text":"Ananth Kalyanaraman, Mahantesh Halappanavar, Marco Minutoli, Reet Barik, S M Ferdous, Wade Cappa","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-08-20T16:18:19Z","title":"GreediRIS: Scalable Influence Maximization using Distributed Streaming Maximum Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10982","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:149e15813cddb0b187800932a2c19799965ee848d8b199e0a6b0f93548668f16","target":"record","created_at":"2026-07-05T08:57:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0bb48a8c52785267f6d915b61d61380cc0f52dd62729975eec51f5f95031d1ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-08-20T16:18:19Z","title_canon_sha256":"6ab2b18666322db26c9d0b1856427481e62813960ccab08cb706e1ad71495d65"},"schema_version":"1.0","source":{"id":"2408.10982","kind":"arxiv","version":1}},"canonical_sha256":"38c9950e1d8349bcfe271315261d56a3fd1bd83e191427ca8980145204c812c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38c9950e1d8349bcfe271315261d56a3fd1bd83e191427ca8980145204c812c8","first_computed_at":"2026-07-05T08:57:20.605900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:57:20.605900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"He0n+/P1pEtSbh3Tkxs6Dg4am3tKo7/xNxL8toB+3cAeEDMNqJQx2IhU7eyi26epfkfCoVBuh/xvD7vQCNpAAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:57:20.606352Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.10982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:149e15813cddb0b187800932a2c19799965ee848d8b199e0a6b0f93548668f16","sha256:32ba9f156d72de1d4be72bf4b7ba2d239794d744851e16b14b8f4dee74e3c09e"],"state_sha256":"6aab007ac9c01c7749ce2fe1dfb7366dfe5127bc52bec2bf6e3129d45129b015"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t61kRY01w+s/m0mTYYsk5NYUdfly0FvJ0DBm2RJHhE6XqwumgoHhYtYSQTpwwi0okweLBAWVVF4bVYuk3ndcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T00:32:43.856016Z","bundle_sha256":"e2921d865abf2f63052a608e4083943af66142dac5b2a41501a0c9fc831318d9"}}