{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:G5IIG6YP7KCAPGJBIRA6IQM2WS","short_pith_number":"pith:G5IIG6YP","schema_version":"1.0","canonical_sha256":"3750837b0ffa840799214441e4419ab4b06f9c8b19a1824bf2d13de83100640e","source":{"kind":"arxiv","id":"1806.07757","version":1},"attestation_state":"computed","paper":{"title":"How to Maximize the Spread of Social Influence: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Giuseppe De Nittis, Nicola Gatti","submitted_at":"2018-06-19T14:57:22Z","abstract_excerpt":"This survey presents the main results achieved for the influence maximization problem in social networks. This problem is well studied in the literature and, thanks to its recent applications, some of which currently deployed on the field, it is receiving more and more attention in the scientific community. The problem can be formulated as follows: given a graph, with each node having a certain probability of influencing its neighbors, select a subset of vertices so that the number of nodes in the network that are influenced is maximized. Starting from this model, we introduce the main theoret"},"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":"1806.07757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-19T14:57:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fdc9167aecfd2f86e36587273445bd0b0e1081a1962adc7a593203bc1071c34b","abstract_canon_sha256":"2fbb8630b7b2744e50f1337e944627e1b6fbed083dc7beec13ad4d850622c345"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:46.768114Z","signature_b64":"jmYlHr0wn1OIO+HB3+g3LBqFgcLBcYrX8KRckXg8i2SOusQvJmqFx3fhV99zuJOkNmARNn4B2aZXoj8VakxVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3750837b0ffa840799214441e4419ab4b06f9c8b19a1824bf2d13de83100640e","last_reissued_at":"2026-05-18T00:12:46.767116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:46.767116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Maximize the Spread of Social Influence: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Giuseppe De Nittis, Nicola Gatti","submitted_at":"2018-06-19T14:57:22Z","abstract_excerpt":"This survey presents the main results achieved for the influence maximization problem in social networks. This problem is well studied in the literature and, thanks to its recent applications, some of which currently deployed on the field, it is receiving more and more attention in the scientific community. The problem can be formulated as follows: given a graph, with each node having a certain probability of influencing its neighbors, select a subset of vertices so that the number of nodes in the network that are influenced is maximized. Starting from this model, we introduce the main theoret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07757","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":""},"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":"1806.07757","created_at":"2026-05-18T00:12:46.767484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07757v1","created_at":"2026-05-18T00:12:46.767484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07757","created_at":"2026-05-18T00:12:46.767484+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5IIG6YP7KCA","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5IIG6YP7KCAPGJB","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5IIG6YP","created_at":"2026-05-18T12:32:25.280505+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/G5IIG6YP7KCAPGJBIRA6IQM2WS","json":"https://pith.science/pith/G5IIG6YP7KCAPGJBIRA6IQM2WS.json","graph_json":"https://pith.science/api/pith-number/G5IIG6YP7KCAPGJBIRA6IQM2WS/graph.json","events_json":"https://pith.science/api/pith-number/G5IIG6YP7KCAPGJBIRA6IQM2WS/events.json","paper":"https://pith.science/paper/G5IIG6YP"},"agent_actions":{"view_html":"https://pith.science/pith/G5IIG6YP7KCAPGJBIRA6IQM2WS","download_json":"https://pith.science/pith/G5IIG6YP7KCAPGJBIRA6IQM2WS.json","view_paper":"https://pith.science/paper/G5IIG6YP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07757&json=true","fetch_graph":"https://pith.science/api/pith-number/G5IIG6YP7KCAPGJBIRA6IQM2WS/graph.json","fetch_events":"https://pith.science/api/pith-number/G5IIG6YP7KCAPGJBIRA6IQM2WS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5IIG6YP7KCAPGJBIRA6IQM2WS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5IIG6YP7KCAPGJBIRA6IQM2WS/action/storage_attestation","attest_author":"https://pith.science/pith/G5IIG6YP7KCAPGJBIRA6IQM2WS/action/author_attestation","sign_citation":"https://pith.science/pith/G5IIG6YP7KCAPGJBIRA6IQM2WS/action/citation_signature","submit_replication":"https://pith.science/pith/G5IIG6YP7KCAPGJBIRA6IQM2WS/action/replication_record"}},"created_at":"2026-05-18T00:12:46.767484+00:00","updated_at":"2026-05-18T00:12:46.767484+00:00"}