{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HKTACLSN35RO6SF2LRZEQOTHEQ","short_pith_number":"pith:HKTACLSN","schema_version":"1.0","canonical_sha256":"3aa6012e4ddf62ef48ba5c72483a672400046afe187a68e63b2d80e24df812ad","source":{"kind":"arxiv","id":"2207.08937","version":4},"attestation_state":"computed","paper":{"title":"A Community-Aware Framework for Social Influence Maximization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Abhishek K. Umrawal, Christopher J. Quinn, Vaneet Aggarwal","submitted_at":"2022-07-18T20:43:17Z","abstract_excerpt":"We consider the problem of Influence Maximization (IM), the task of selecting $k$ seed nodes in a social network such that the expected number of nodes influenced is maximized. We propose a community-aware divide-and-conquer framework that involves (i) learning the inherent community structure of the social network, (ii) generating candidate solutions by solving the influence maximization problem for each community, and (iii) selecting the final set of seed nodes using a novel progressive budgeting scheme. Our experiments on real-world social networks show that the proposed framework outperfor"},"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":"2207.08937","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2022-07-18T20:43:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"62b79ab29044dbce8df46d8c585e420cc24a77fd94bb0fe73dad66090ea93037","abstract_canon_sha256":"9baf3fc368811e42514dc40cbac5c520851121113f7955384db4ecfa750deec8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:43:13.783440Z","signature_b64":"6a9FHaEp34+EDmNKcgmz6kKuhhi36AIG+vbyWBgPqQVPGo49/MB/uBpQoQPqz7d6zMfxAxNj/xzQ5LP/1cvYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aa6012e4ddf62ef48ba5c72483a672400046afe187a68e63b2d80e24df812ad","last_reissued_at":"2026-07-05T05:43:13.782995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:43:13.782995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Community-Aware Framework for Social Influence Maximization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Abhishek K. Umrawal, Christopher J. Quinn, Vaneet Aggarwal","submitted_at":"2022-07-18T20:43:17Z","abstract_excerpt":"We consider the problem of Influence Maximization (IM), the task of selecting $k$ seed nodes in a social network such that the expected number of nodes influenced is maximized. We propose a community-aware divide-and-conquer framework that involves (i) learning the inherent community structure of the social network, (ii) generating candidate solutions by solving the influence maximization problem for each community, and (iii) selecting the final set of seed nodes using a novel progressive budgeting scheme. Our experiments on real-world social networks show that the proposed framework outperfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.08937","kind":"arxiv","version":4},"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/2207.08937/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":"2207.08937","created_at":"2026-07-05T05:43:13.783056+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.08937v4","created_at":"2026-07-05T05:43:13.783056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.08937","created_at":"2026-07-05T05:43:13.783056+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKTACLSN35RO","created_at":"2026-07-05T05:43:13.783056+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKTACLSN35RO6SF2","created_at":"2026-07-05T05:43:13.783056+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKTACLSN","created_at":"2026-07-05T05:43:13.783056+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/HKTACLSN35RO6SF2LRZEQOTHEQ","json":"https://pith.science/pith/HKTACLSN35RO6SF2LRZEQOTHEQ.json","graph_json":"https://pith.science/api/pith-number/HKTACLSN35RO6SF2LRZEQOTHEQ/graph.json","events_json":"https://pith.science/api/pith-number/HKTACLSN35RO6SF2LRZEQOTHEQ/events.json","paper":"https://pith.science/paper/HKTACLSN"},"agent_actions":{"view_html":"https://pith.science/pith/HKTACLSN35RO6SF2LRZEQOTHEQ","download_json":"https://pith.science/pith/HKTACLSN35RO6SF2LRZEQOTHEQ.json","view_paper":"https://pith.science/paper/HKTACLSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.08937&json=true","fetch_graph":"https://pith.science/api/pith-number/HKTACLSN35RO6SF2LRZEQOTHEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HKTACLSN35RO6SF2LRZEQOTHEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKTACLSN35RO6SF2LRZEQOTHEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKTACLSN35RO6SF2LRZEQOTHEQ/action/storage_attestation","attest_author":"https://pith.science/pith/HKTACLSN35RO6SF2LRZEQOTHEQ/action/author_attestation","sign_citation":"https://pith.science/pith/HKTACLSN35RO6SF2LRZEQOTHEQ/action/citation_signature","submit_replication":"https://pith.science/pith/HKTACLSN35RO6SF2LRZEQOTHEQ/action/replication_record"}},"created_at":"2026-07-05T05:43:13.783056+00:00","updated_at":"2026-07-05T05:43:13.783056+00:00"}