{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QZQCPBHZ6ORGODEOEJIYQ7HNR5","short_pith_number":"pith:QZQCPBHZ","canonical_record":{"source":{"id":"1702.05354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-17T14:23:14Z","cross_cats_sorted":[],"title_canon_sha256":"31871a8b624884235cb97bb7a87a6cbdfcbe868772342743304909e049ea5c6c","abstract_canon_sha256":"1299590fb3a3aba27f00ed606e4ffca661e7ae83cfd8a03040acd6c10e7ab298"},"schema_version":"1.0"},"canonical_sha256":"86602784f9f3a2670c8e2251887ced8f605a3a5702c3822b21a1ec8eb0d19522","source":{"kind":"arxiv","id":"1702.05354","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05354","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05354v2","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05354","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"QZQCPBHZ6ORG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZQCPBHZ6ORGODEO","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZQCPBHZ","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QZQCPBHZ6ORGODEOEJIYQ7HNR5","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-17T14:23:14Z","cross_cats_sorted":[],"title_canon_sha256":"31871a8b624884235cb97bb7a87a6cbdfcbe868772342743304909e049ea5c6c","abstract_canon_sha256":"1299590fb3a3aba27f00ed606e4ffca661e7ae83cfd8a03040acd6c10e7ab298"},"schema_version":"1.0"},"canonical_sha256":"86602784f9f3a2670c8e2251887ced8f605a3a5702c3822b21a1ec8eb0d19522","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:16.283560Z","signature_b64":"CJdlVu4IqT5FEyLoznLAOnhrnyvxryHJvmwNMeL6yX135fX24c+CCiWrSwDKWHXFgDRWnDW6hGs2sodMPF4kCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86602784f9f3a2670c8e2251887ced8f605a3a5702c3822b21a1ec8eb0d19522","last_reissued_at":"2026-05-18T00:32:16.282867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:16.282867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05354","source_version":2,"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-18T00:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqQc0Tetj/dwOpQ+UCP+A7siXfFD+9iQvAkf13iOG7xW5feCZvkEyJsjEsZ6N3nuM33BWeEcbdI5Aeq0sSQhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:20:54.917645Z"},"content_sha256":"4f22b4058c9cea47ea2bfd227fd246021f3fb73498602b1efa18ffb2b6a5e6ec","schema_version":"1.0","event_id":"sha256:4f22b4058c9cea47ea2bfd227fd246021f3fb73498602b1efa18ffb2b6a5e6ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QZQCPBHZ6ORGODEOEJIYQ7HNR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Online Influencer Marketing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Bogdan Cautis, Olivier Capp\\'e, Paul Lagr\\'ee, Silviu Maniu","submitted_at":"2017-02-17T14:23:14Z","abstract_excerpt":"Influence maximization is the problem of finding influential users, or nodes, in a graph so as to maximize the spread of information. It has many applications in advertising and marketing on social networks. In this paper, we study a highly generic version of influence maximization, one of optimizing influence campaigns by sequentially selecting \"spread seeds\" from a set of influencers, a small subset of the node population, under the hypothesis that, in a given campaign, previously activated nodes remain \"persistently\" active throughout and thus do not yield further rewards. This problem is i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05354","kind":"arxiv","version":2},"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-18T00:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ew6j6SAadcWi4oKmBDd9I6ukfLuSaSpTKmRRkEfl7r72B7qoOluV+I1CW71rBRwQpmNXnZAS2ojM4Ki8LkpbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:20:54.917984Z"},"content_sha256":"b422829366c984d524ad348609f8431acb7ce5aae1547c5dd59e1d29191cba38","schema_version":"1.0","event_id":"sha256:b422829366c984d524ad348609f8431acb7ce5aae1547c5dd59e1d29191cba38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZQCPBHZ6ORGODEOEJIYQ7HNR5/bundle.json","state_url":"https://pith.science/pith/QZQCPBHZ6ORGODEOEJIYQ7HNR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZQCPBHZ6ORGODEOEJIYQ7HNR5/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-06-06T20:20:54Z","links":{"resolver":"https://pith.science/pith/QZQCPBHZ6ORGODEOEJIYQ7HNR5","bundle":"https://pith.science/pith/QZQCPBHZ6ORGODEOEJIYQ7HNR5/bundle.json","state":"https://pith.science/pith/QZQCPBHZ6ORGODEOEJIYQ7HNR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZQCPBHZ6ORGODEOEJIYQ7HNR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QZQCPBHZ6ORGODEOEJIYQ7HNR5","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":"1299590fb3a3aba27f00ed606e4ffca661e7ae83cfd8a03040acd6c10e7ab298","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-17T14:23:14Z","title_canon_sha256":"31871a8b624884235cb97bb7a87a6cbdfcbe868772342743304909e049ea5c6c"},"schema_version":"1.0","source":{"id":"1702.05354","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05354","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05354v2","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05354","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"QZQCPBHZ6ORG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZQCPBHZ6ORGODEO","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZQCPBHZ","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b422829366c984d524ad348609f8431acb7ce5aae1547c5dd59e1d29191cba38","target":"graph","created_at":"2026-05-18T00:32:16Z","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 influential users, or nodes, in a graph so as to maximize the spread of information. It has many applications in advertising and marketing on social networks. In this paper, we study a highly generic version of influence maximization, one of optimizing influence campaigns by sequentially selecting \"spread seeds\" from a set of influencers, a small subset of the node population, under the hypothesis that, in a given campaign, previously activated nodes remain \"persistently\" active throughout and thus do not yield further rewards. This problem is i","authors_text":"Bogdan Cautis, Olivier Capp\\'e, Paul Lagr\\'ee, Silviu Maniu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-17T14:23:14Z","title":"Algorithms for Online Influencer Marketing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05354","kind":"arxiv","version":2},"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:4f22b4058c9cea47ea2bfd227fd246021f3fb73498602b1efa18ffb2b6a5e6ec","target":"record","created_at":"2026-05-18T00:32:16Z","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":"1299590fb3a3aba27f00ed606e4ffca661e7ae83cfd8a03040acd6c10e7ab298","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-17T14:23:14Z","title_canon_sha256":"31871a8b624884235cb97bb7a87a6cbdfcbe868772342743304909e049ea5c6c"},"schema_version":"1.0","source":{"id":"1702.05354","kind":"arxiv","version":2}},"canonical_sha256":"86602784f9f3a2670c8e2251887ced8f605a3a5702c3822b21a1ec8eb0d19522","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86602784f9f3a2670c8e2251887ced8f605a3a5702c3822b21a1ec8eb0d19522","first_computed_at":"2026-05-18T00:32:16.282867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:16.282867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CJdlVu4IqT5FEyLoznLAOnhrnyvxryHJvmwNMeL6yX135fX24c+CCiWrSwDKWHXFgDRWnDW6hGs2sodMPF4kCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:16.283560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05354","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f22b4058c9cea47ea2bfd227fd246021f3fb73498602b1efa18ffb2b6a5e6ec","sha256:b422829366c984d524ad348609f8431acb7ce5aae1547c5dd59e1d29191cba38"],"state_sha256":"cdd74ceed1389228f2f52871e2b9770f3edf4af58fc9168d3556aad7fca10006"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zve4IYccH0CsoOksY9XyynrGILc5UpfhwclIGk/YzGNbzZaLZuFRNfNAXdVVJaDXlM3tf431XhMYQxNGaN7fBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:20:54.920015Z","bundle_sha256":"ddbc1c24d8589eb0087de06e4ca02dc1da7fe7959f7e0bce0c49e5bd733fa6b8"}}