{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CYLNRUIBB2G4OA7YUH2BGG5UQE","short_pith_number":"pith:CYLNRUIB","schema_version":"1.0","canonical_sha256":"1616d8d1010e8dc703f8a1f4131bb48106252d002e6a584861842d6040fdbcfc","source":{"kind":"arxiv","id":"2003.07966","version":1},"attestation_state":"computed","paper":{"title":"Maximizing Influence-based Group Shapley Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gianlorenzo D'Angelo, Hugo Gilbert, Ruben Becker","submitted_at":"2020-03-17T22:25:18Z","abstract_excerpt":"One key problem in network analysis is the so-called influence maximization problem, which consists in finding a set $S$ of at most $k$ seed users, in a social network, maximizing the spread of information from $S$. This paper studies a related but slightly different problem: We want to find a set $S$ of at most $k$ seed users that maximizes the spread of information, when $S$ is added to an already pre-existing - but unknown - set of seed users $T$. We consider such scenario to be very realistic. Assume a central entity wants to spread a piece of news, while having a budget to influence $k$ u"},"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":"2003.07966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-03-17T22:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"c4c1826c0af04ee3af2a073087a0b0e2db5a6c16afab4e42b03c62b349ce2822","abstract_canon_sha256":"1311908c63f7b941c8337d249211b93077d1f65596f6028ec5b65c323adca2b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:49:03.067217Z","signature_b64":"c8pvN/aLisTUjyBeQFQhf40l9zc86k8td+AAer05T871QhlFstUUdaE9cov3OuVScg1D4cpBL+OoRo2hfhcFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1616d8d1010e8dc703f8a1f4131bb48106252d002e6a584861842d6040fdbcfc","last_reissued_at":"2026-07-05T00:49:03.066765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:49:03.066765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Influence-based Group Shapley Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gianlorenzo D'Angelo, Hugo Gilbert, Ruben Becker","submitted_at":"2020-03-17T22:25:18Z","abstract_excerpt":"One key problem in network analysis is the so-called influence maximization problem, which consists in finding a set $S$ of at most $k$ seed users, in a social network, maximizing the spread of information from $S$. This paper studies a related but slightly different problem: We want to find a set $S$ of at most $k$ seed users that maximizes the spread of information, when $S$ is added to an already pre-existing - but unknown - set of seed users $T$. We consider such scenario to be very realistic. Assume a central entity wants to spread a piece of news, while having a budget to influence $k$ u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.07966","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/2003.07966/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":"2003.07966","created_at":"2026-07-05T00:49:03.066822+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.07966v1","created_at":"2026-07-05T00:49:03.066822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.07966","created_at":"2026-07-05T00:49:03.066822+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYLNRUIBB2G4","created_at":"2026-07-05T00:49:03.066822+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYLNRUIBB2G4OA7Y","created_at":"2026-07-05T00:49:03.066822+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYLNRUIB","created_at":"2026-07-05T00:49:03.066822+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/CYLNRUIBB2G4OA7YUH2BGG5UQE","json":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE.json","graph_json":"https://pith.science/api/pith-number/CYLNRUIBB2G4OA7YUH2BGG5UQE/graph.json","events_json":"https://pith.science/api/pith-number/CYLNRUIBB2G4OA7YUH2BGG5UQE/events.json","paper":"https://pith.science/paper/CYLNRUIB"},"agent_actions":{"view_html":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE","download_json":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE.json","view_paper":"https://pith.science/paper/CYLNRUIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.07966&json=true","fetch_graph":"https://pith.science/api/pith-number/CYLNRUIBB2G4OA7YUH2BGG5UQE/graph.json","fetch_events":"https://pith.science/api/pith-number/CYLNRUIBB2G4OA7YUH2BGG5UQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/action/storage_attestation","attest_author":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/action/author_attestation","sign_citation":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/action/citation_signature","submit_replication":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/action/replication_record"}},"created_at":"2026-07-05T00:49:03.066822+00:00","updated_at":"2026-07-05T00:49:03.066822+00:00"}