{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:CYLNRUIBB2G4OA7YUH2BGG5UQE","short_pith_number":"pith:CYLNRUIB","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"},"canonical_sha256":"1616d8d1010e8dc703f8a1f4131bb48106252d002e6a584861842d6040fdbcfc","source":{"kind":"arxiv","id":"2003.07966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.07966","created_at":"2026-07-05T00:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"2003.07966v1","created_at":"2026-07-05T00:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.07966","created_at":"2026-07-05T00:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"CYLNRUIBB2G4","created_at":"2026-07-05T00:49:03Z"},{"alias_kind":"pith_short_16","alias_value":"CYLNRUIBB2G4OA7Y","created_at":"2026-07-05T00:49:03Z"},{"alias_kind":"pith_short_8","alias_value":"CYLNRUIB","created_at":"2026-07-05T00:49:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:CYLNRUIBB2G4OA7YUH2BGG5UQE","target":"record","payload":{"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"},"canonical_sha256":"1616d8d1010e8dc703f8a1f4131bb48106252d002e6a584861842d6040fdbcfc","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"},"source_kind":"arxiv","source_id":"2003.07966","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-05T00:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WMyJ87b3eMp1jlOleVa7OaeiLpaO74B02mdREcIDmp2CnTh5T29Bu0+GMVgyJCPfiVfO4DG94fwRtgKL0lMQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:44:22.525411Z"},"content_sha256":"ccd294564e424bbc30792910be533823da1f0dadeaeade5e9babdb3aa7e013e8","schema_version":"1.0","event_id":"sha256:ccd294564e424bbc30792910be533823da1f0dadeaeade5e9babdb3aa7e013e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:CYLNRUIBB2G4OA7YUH2BGG5UQE","target":"graph","payload":{"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"},"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-05T00:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sc5W1DxIH/g+wq09PImVNhqw08igJvspPN+FiOq2Ur4HMNXvaiZiJHMIkuhER+LLyXfOZILRlwt9sUSZ4pVSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:44:22.525801Z"},"content_sha256":"be6468764af2ba2073c310990253ec00a026f442268fddccaa1a5f302670db9e","schema_version":"1.0","event_id":"sha256:be6468764af2ba2073c310990253ec00a026f442268fddccaa1a5f302670db9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/bundle.json","state_url":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/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-07-06T10:44:22Z","links":{"resolver":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE","bundle":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/bundle.json","state":"https://pith.science/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYLNRUIBB2G4OA7YUH2BGG5UQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:CYLNRUIBB2G4OA7YUH2BGG5UQE","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":"1311908c63f7b941c8337d249211b93077d1f65596f6028ec5b65c323adca2b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-03-17T22:25:18Z","title_canon_sha256":"c4c1826c0af04ee3af2a073087a0b0e2db5a6c16afab4e42b03c62b349ce2822"},"schema_version":"1.0","source":{"id":"2003.07966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.07966","created_at":"2026-07-05T00:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"2003.07966v1","created_at":"2026-07-05T00:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.07966","created_at":"2026-07-05T00:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"CYLNRUIBB2G4","created_at":"2026-07-05T00:49:03Z"},{"alias_kind":"pith_short_16","alias_value":"CYLNRUIBB2G4OA7Y","created_at":"2026-07-05T00:49:03Z"},{"alias_kind":"pith_short_8","alias_value":"CYLNRUIB","created_at":"2026-07-05T00:49:03Z"}],"graph_snapshots":[{"event_id":"sha256:be6468764af2ba2073c310990253ec00a026f442268fddccaa1a5f302670db9e","target":"graph","created_at":"2026-07-05T00:49:03Z","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/2003.07966/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gianlorenzo D'Angelo, Hugo Gilbert, Ruben Becker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-03-17T22:25:18Z","title":"Maximizing Influence-based Group Shapley Centrality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.07966","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:ccd294564e424bbc30792910be533823da1f0dadeaeade5e9babdb3aa7e013e8","target":"record","created_at":"2026-07-05T00:49:03Z","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":"1311908c63f7b941c8337d249211b93077d1f65596f6028ec5b65c323adca2b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-03-17T22:25:18Z","title_canon_sha256":"c4c1826c0af04ee3af2a073087a0b0e2db5a6c16afab4e42b03c62b349ce2822"},"schema_version":"1.0","source":{"id":"2003.07966","kind":"arxiv","version":1}},"canonical_sha256":"1616d8d1010e8dc703f8a1f4131bb48106252d002e6a584861842d6040fdbcfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1616d8d1010e8dc703f8a1f4131bb48106252d002e6a584861842d6040fdbcfc","first_computed_at":"2026-07-05T00:49:03.066765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:49:03.066765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c8pvN/aLisTUjyBeQFQhf40l9zc86k8td+AAer05T871QhlFstUUdaE9cov3OuVScg1D4cpBL+OoRo2hfhcFCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:49:03.067217Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.07966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccd294564e424bbc30792910be533823da1f0dadeaeade5e9babdb3aa7e013e8","sha256:be6468764af2ba2073c310990253ec00a026f442268fddccaa1a5f302670db9e"],"state_sha256":"b3ec475d2081d543b61ad4a757828e88714507d75b638f8e8aaa7c392453c64e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7rBwZW1cPURflr6HoORnpgUIAlovLDv7kJnERpEAQn55FziiRDbcoX5Z5ZHaU483wS4GteZ/vg9RVt4tYLEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T10:44:22.527738Z","bundle_sha256":"5a338ceca9fb6dd46a682b0750b1b4e80b934b49e4301dc29e1e0d8e8147a83a"}}