{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YQ54LMMW4ZBLSZZMIPJMQJUZLF","short_pith_number":"pith:YQ54LMMW","canonical_record":{"source":{"id":"1109.6886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-09-30T16:25:13Z","cross_cats_sorted":[],"title_canon_sha256":"c94fdf36908deac685a65f2c306f0cf45e79ea0a9e7deee0b46731971a98813f","abstract_canon_sha256":"9ccfb3808432e96976c1860021d8594190912a4f385e0127f76e47dff0879d19"},"schema_version":"1.0"},"canonical_sha256":"c43bc5b196e642b9672c43d2c82699597ffc983470759372f1412a46392333b8","source":{"kind":"arxiv","id":"1109.6886","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6886","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6886v1","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6886","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"YQ54LMMW4ZBL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YQ54LMMW4ZBLSZZM","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YQ54LMMW","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YQ54LMMW4ZBLSZZMIPJMQJUZLF","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-09-30T16:25:13Z","cross_cats_sorted":[],"title_canon_sha256":"c94fdf36908deac685a65f2c306f0cf45e79ea0a9e7deee0b46731971a98813f","abstract_canon_sha256":"9ccfb3808432e96976c1860021d8594190912a4f385e0127f76e47dff0879d19"},"schema_version":"1.0"},"canonical_sha256":"c43bc5b196e642b9672c43d2c82699597ffc983470759372f1412a46392333b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:52.274788Z","signature_b64":"aHXY9Iat0v1GxVT77coGMvk+PMIT5xGSlmjc1DTNTsSOW5BJK6kWldP8OurjTgZg09djayiKNMIm9KKjVKPdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c43bc5b196e642b9672c43d2c82699597ffc983470759372f1412a46392333b8","last_reissued_at":"2026-05-18T04:11:52.274187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:52.274187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6886","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-05-18T04:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQBNUcgD2WnAOPP3yOZWcrGzYTZK5HzpqiBdM5COkTKKhEF7wrIlNOhmb6U8HJYCMB8gBxKGoysPJWePjaByDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T12:45:29.603090Z"},"content_sha256":"f7f70aed990386a009b3128e98cb3147ae67d39654d2432e040d08694d6a9d94","schema_version":"1.0","event_id":"sha256:f7f70aed990386a009b3128e98cb3147ae67d39654d2432e040d08694d6a9d94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YQ54LMMW4ZBLSZZMIPJMQJUZLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Data-Based Approach to Social Influence Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amit Goyal, Francesco Bonchi, Laks V. S. Lakshmanan","submitted_at":"2011-09-30T16:25:13Z","abstract_excerpt":"Influence maximization is the problem of finding a set of users in a social network, such that by targeting this set, one maximizes the expected spread of influence in the network. Most of the literature on this topic has focused exclusively on the social graph, overlooking historical data, i.e., traces of past action propagations. In this paper, we study influence maximization from a novel data-based perspective. In particular, we introduce a new model, which we call credit distribution, that directly leverages available propagation traces to learn how influence flows in the network and uses "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6886","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"},"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-05-18T04:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwmyC79U85XLkEwcOmiD7QrwKWOILX7kY/kT9sXy//tsCwNmuGSXyjFW/0uiKnEtqBZhwSBCUMhz9bjNRllyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T12:45:29.603801Z"},"content_sha256":"4d16304f9d64b11cc10002bfe4c417ba15bbac84091ecf8b82481938f03cdb47","schema_version":"1.0","event_id":"sha256:4d16304f9d64b11cc10002bfe4c417ba15bbac84091ecf8b82481938f03cdb47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQ54LMMW4ZBLSZZMIPJMQJUZLF/bundle.json","state_url":"https://pith.science/pith/YQ54LMMW4ZBLSZZMIPJMQJUZLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQ54LMMW4ZBLSZZMIPJMQJUZLF/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-05-22T12:45:29Z","links":{"resolver":"https://pith.science/pith/YQ54LMMW4ZBLSZZMIPJMQJUZLF","bundle":"https://pith.science/pith/YQ54LMMW4ZBLSZZMIPJMQJUZLF/bundle.json","state":"https://pith.science/pith/YQ54LMMW4ZBLSZZMIPJMQJUZLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQ54LMMW4ZBLSZZMIPJMQJUZLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YQ54LMMW4ZBLSZZMIPJMQJUZLF","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":"9ccfb3808432e96976c1860021d8594190912a4f385e0127f76e47dff0879d19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-09-30T16:25:13Z","title_canon_sha256":"c94fdf36908deac685a65f2c306f0cf45e79ea0a9e7deee0b46731971a98813f"},"schema_version":"1.0","source":{"id":"1109.6886","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6886","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6886v1","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6886","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"YQ54LMMW4ZBL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YQ54LMMW4ZBLSZZM","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YQ54LMMW","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:4d16304f9d64b11cc10002bfe4c417ba15bbac84091ecf8b82481938f03cdb47","target":"graph","created_at":"2026-05-18T04:11:52Z","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"},"paper":{"abstract_excerpt":"Influence maximization is the problem of finding a set of users in a social network, such that by targeting this set, one maximizes the expected spread of influence in the network. Most of the literature on this topic has focused exclusively on the social graph, overlooking historical data, i.e., traces of past action propagations. In this paper, we study influence maximization from a novel data-based perspective. In particular, we introduce a new model, which we call credit distribution, that directly leverages available propagation traces to learn how influence flows in the network and uses ","authors_text":"Amit Goyal, Francesco Bonchi, Laks V. S. Lakshmanan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-09-30T16:25:13Z","title":"A Data-Based Approach to Social Influence Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6886","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:f7f70aed990386a009b3128e98cb3147ae67d39654d2432e040d08694d6a9d94","target":"record","created_at":"2026-05-18T04:11:52Z","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":"9ccfb3808432e96976c1860021d8594190912a4f385e0127f76e47dff0879d19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-09-30T16:25:13Z","title_canon_sha256":"c94fdf36908deac685a65f2c306f0cf45e79ea0a9e7deee0b46731971a98813f"},"schema_version":"1.0","source":{"id":"1109.6886","kind":"arxiv","version":1}},"canonical_sha256":"c43bc5b196e642b9672c43d2c82699597ffc983470759372f1412a46392333b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c43bc5b196e642b9672c43d2c82699597ffc983470759372f1412a46392333b8","first_computed_at":"2026-05-18T04:11:52.274187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:52.274187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aHXY9Iat0v1GxVT77coGMvk+PMIT5xGSlmjc1DTNTsSOW5BJK6kWldP8OurjTgZg09djayiKNMIm9KKjVKPdAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:52.274788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6886","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7f70aed990386a009b3128e98cb3147ae67d39654d2432e040d08694d6a9d94","sha256:4d16304f9d64b11cc10002bfe4c417ba15bbac84091ecf8b82481938f03cdb47"],"state_sha256":"19d8d2b4990194ac53a0b63fd302015122a507ffcce5e7ef9568d4281b7c4c7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aeddzs35RYeCt08KARZPOBSFFOLRn6to0hq3Y4XfAn+ZuDR9TYNqQjUFR+FpIGRhXsu34fK06c5segGIEGz3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T12:45:29.607427Z","bundle_sha256":"c7b23dcc4ed28c8fa448f3a07d8cf18070a633f42ab6d2f1b4154eaaf564dfaa"}}