{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:4I7APW76OTJPUXNW7EVT2QINPN","short_pith_number":"pith:4I7APW76","canonical_record":{"source":{"id":"2107.04997","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-11T08:58:53Z","cross_cats_sorted":[],"title_canon_sha256":"f04fed17c454d973f44e2aa1859416407bc25cccdafeb5cebf4639a9a13321a0","abstract_canon_sha256":"3eba4343401d5e561b06db096c653cb1b21b6b15b7b649fa31dc5e525e8b6134"},"schema_version":"1.0"},"canonical_sha256":"e23e07dbfe74d2fa5db6f92b3d410d7b46fb8115b68ffdd2a213f448552d69f2","source":{"kind":"arxiv","id":"2107.04997","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.04997","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"2107.04997v3","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04997","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"4I7APW76OTJP","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"4I7APW76OTJPUXNW","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"4I7APW76","created_at":"2026-07-05T03:00:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:4I7APW76OTJPUXNW7EVT2QINPN","target":"record","payload":{"canonical_record":{"source":{"id":"2107.04997","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-11T08:58:53Z","cross_cats_sorted":[],"title_canon_sha256":"f04fed17c454d973f44e2aa1859416407bc25cccdafeb5cebf4639a9a13321a0","abstract_canon_sha256":"3eba4343401d5e561b06db096c653cb1b21b6b15b7b649fa31dc5e525e8b6134"},"schema_version":"1.0"},"canonical_sha256":"e23e07dbfe74d2fa5db6f92b3d410d7b46fb8115b68ffdd2a213f448552d69f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:34.623124Z","signature_b64":"MiGAG663LKuv74VKA4KV0JLeqJG52xljjpv7dOfyl0PJO2n2yG64cO0iTWB+5r4LuJO2lGCx2dc8A/CSBOztDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e23e07dbfe74d2fa5db6f92b3d410d7b46fb8115b68ffdd2a213f448552d69f2","last_reissued_at":"2026-07-05T03:00:34.622737Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:34.622737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.04997","source_version":3,"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-05T03:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fxaoIQMa04Ggp73bevw8q8x4ed0/3ozc7NrNXzbNjlsJwwLD1Wr4fTJ+ums1Z9Yuy5bpijFdjy4ZEElwbcG+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:25:10.212956Z"},"content_sha256":"7a74e5d814c820e1b24412754288910005c08b5699ff799cf5ed81bb1a480041","schema_version":"1.0","event_id":"sha256:7a74e5d814c820e1b24412754288910005c08b5699ff799cf5ed81bb1a480041"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:4I7APW76OTJPUXNW7EVT2QINPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Effective Algorithms for Revenue Maximization in Social Advertising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benwei Wu, Cigdem Aslay, Jing Tang, Kai Han, Laks V. S. Lakshmanan, Shuang Cui","submitted_at":"2021-07-11T08:58:53Z","abstract_excerpt":"We consider the revenue maximization problem in social advertising, where a social network platform owner needs to select seed users for a group of advertisers, each with a payment budget, such that the total expected revenue that the owner gains from the advertisers by propagating their ads in the network is maximized. Previous studies on this problem show that it is intractable and present approximation algorithms. We revisit this problem from a fresh perspective and develop novel efficient approximation algorithms, both under the setting where an exact influence oracle is assumed and under "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04997","kind":"arxiv","version":3},"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/2107.04997/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-05T03:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96mSHR3GX104ZOgFNoLHrxkjTi4NRTp84ui2bC7p6q6RvIhxWElxKLS4LAvBC6TGLoVprbbjuXzWDxYS0XdnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:25:10.213899Z"},"content_sha256":"9b3374098733b5a04f039f1aef228589d0e6b7ed506745fd626a71a83146275e","schema_version":"1.0","event_id":"sha256:9b3374098733b5a04f039f1aef228589d0e6b7ed506745fd626a71a83146275e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4I7APW76OTJPUXNW7EVT2QINPN/bundle.json","state_url":"https://pith.science/pith/4I7APW76OTJPUXNW7EVT2QINPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4I7APW76OTJPUXNW7EVT2QINPN/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-08-05T14:25:10Z","links":{"resolver":"https://pith.science/pith/4I7APW76OTJPUXNW7EVT2QINPN","bundle":"https://pith.science/pith/4I7APW76OTJPUXNW7EVT2QINPN/bundle.json","state":"https://pith.science/pith/4I7APW76OTJPUXNW7EVT2QINPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4I7APW76OTJPUXNW7EVT2QINPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4I7APW76OTJPUXNW7EVT2QINPN","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":"3eba4343401d5e561b06db096c653cb1b21b6b15b7b649fa31dc5e525e8b6134","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-11T08:58:53Z","title_canon_sha256":"f04fed17c454d973f44e2aa1859416407bc25cccdafeb5cebf4639a9a13321a0"},"schema_version":"1.0","source":{"id":"2107.04997","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.04997","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"2107.04997v3","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04997","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"4I7APW76OTJP","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"4I7APW76OTJPUXNW","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"4I7APW76","created_at":"2026-07-05T03:00:34Z"}],"graph_snapshots":[{"event_id":"sha256:9b3374098733b5a04f039f1aef228589d0e6b7ed506745fd626a71a83146275e","target":"graph","created_at":"2026-07-05T03:00:34Z","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/2107.04997/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the revenue maximization problem in social advertising, where a social network platform owner needs to select seed users for a group of advertisers, each with a payment budget, such that the total expected revenue that the owner gains from the advertisers by propagating their ads in the network is maximized. Previous studies on this problem show that it is intractable and present approximation algorithms. We revisit this problem from a fresh perspective and develop novel efficient approximation algorithms, both under the setting where an exact influence oracle is assumed and under ","authors_text":"Benwei Wu, Cigdem Aslay, Jing Tang, Kai Han, Laks V. S. Lakshmanan, Shuang Cui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-11T08:58:53Z","title":"Efficient and Effective Algorithms for Revenue Maximization in Social Advertising"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04997","kind":"arxiv","version":3},"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:7a74e5d814c820e1b24412754288910005c08b5699ff799cf5ed81bb1a480041","target":"record","created_at":"2026-07-05T03:00:34Z","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":"3eba4343401d5e561b06db096c653cb1b21b6b15b7b649fa31dc5e525e8b6134","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-11T08:58:53Z","title_canon_sha256":"f04fed17c454d973f44e2aa1859416407bc25cccdafeb5cebf4639a9a13321a0"},"schema_version":"1.0","source":{"id":"2107.04997","kind":"arxiv","version":3}},"canonical_sha256":"e23e07dbfe74d2fa5db6f92b3d410d7b46fb8115b68ffdd2a213f448552d69f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e23e07dbfe74d2fa5db6f92b3d410d7b46fb8115b68ffdd2a213f448552d69f2","first_computed_at":"2026-07-05T03:00:34.622737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:00:34.622737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MiGAG663LKuv74VKA4KV0JLeqJG52xljjpv7dOfyl0PJO2n2yG64cO0iTWB+5r4LuJO2lGCx2dc8A/CSBOztDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:00:34.623124Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.04997","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a74e5d814c820e1b24412754288910005c08b5699ff799cf5ed81bb1a480041","sha256:9b3374098733b5a04f039f1aef228589d0e6b7ed506745fd626a71a83146275e"],"state_sha256":"fb91d643dbbbd6178a1b85cec0c6a868827fa420a39204998183cb51e71ea0d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXndg4qgYDydiiXL04XzD4fKVmZRoYtzlx2cGGSpO1RKoLDSNvgJKBuX+Au32GITCF3Pb3Q8sOsf013Piyr/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T14:25:10.240056Z","bundle_sha256":"36ec9aeb743b00150a266d0d450cbb63370908b8d3885b0625283a77141198a9"}}