{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:B6RZP5OIZ5ZXRMXQJHXMVQZZL5","short_pith_number":"pith:B6RZP5OI","schema_version":"1.0","canonical_sha256":"0fa397f5c8cf7378b2f049eecac3395f639789adebc7ef488791e0604c63f9f2","source":{"kind":"arxiv","id":"1606.03816","version":1},"attestation_state":"computed","paper":{"title":"Multistage Campaigning in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hongyuan Zha, Le Song, Mehrdad Farajtabar, Sahar Harati, Xiaojing Ye","submitted_at":"2016-06-13T05:29:49Z","abstract_excerpt":"We consider the problem of how to optimize multi-stage campaigning over social networks. The dynamic programming framework is employed to balance the high present reward and large penalty on low future outcome in the presence of extensive uncertainties. In particular, we establish theoretical foundations of optimal campaigning over social networks where the user activities are modeled as a multivariate Hawkes process, and we derive a time dependent linear relation between the intensity of exogenous events and several commonly used objective functions of campaigning. We further develop a convex"},"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":"1606.03816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-13T05:29:49Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e7efb8c9662af7196ff5678f9d62b4369045e1dab5966780c3c116c17d5a10a8","abstract_canon_sha256":"01ad9cce90df349da26e906efc7bccdd7452411648d3b151472c4583abb3faa1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:32.958696Z","signature_b64":"Ca+kSg8llMv6U2f55yB2BDdkuYgEtHDsI2MjIgpkrHSA7q5z+H/nxB6CzCQwxAMlujmgGPRjhgw3PQ+FalOEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fa397f5c8cf7378b2f049eecac3395f639789adebc7ef488791e0604c63f9f2","last_reissued_at":"2026-05-18T01:12:32.958178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:32.958178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multistage Campaigning in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hongyuan Zha, Le Song, Mehrdad Farajtabar, Sahar Harati, Xiaojing Ye","submitted_at":"2016-06-13T05:29:49Z","abstract_excerpt":"We consider the problem of how to optimize multi-stage campaigning over social networks. The dynamic programming framework is employed to balance the high present reward and large penalty on low future outcome in the presence of extensive uncertainties. In particular, we establish theoretical foundations of optimal campaigning over social networks where the user activities are modeled as a multivariate Hawkes process, and we derive a time dependent linear relation between the intensity of exogenous events and several commonly used objective functions of campaigning. We further develop a convex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03816","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.03816","created_at":"2026-05-18T01:12:32.958270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03816v1","created_at":"2026-05-18T01:12:32.958270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03816","created_at":"2026-05-18T01:12:32.958270+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6RZP5OIZ5ZX","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6RZP5OIZ5ZXRMXQ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6RZP5OI","created_at":"2026-05-18T12:30:07.202191+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/B6RZP5OIZ5ZXRMXQJHXMVQZZL5","json":"https://pith.science/pith/B6RZP5OIZ5ZXRMXQJHXMVQZZL5.json","graph_json":"https://pith.science/api/pith-number/B6RZP5OIZ5ZXRMXQJHXMVQZZL5/graph.json","events_json":"https://pith.science/api/pith-number/B6RZP5OIZ5ZXRMXQJHXMVQZZL5/events.json","paper":"https://pith.science/paper/B6RZP5OI"},"agent_actions":{"view_html":"https://pith.science/pith/B6RZP5OIZ5ZXRMXQJHXMVQZZL5","download_json":"https://pith.science/pith/B6RZP5OIZ5ZXRMXQJHXMVQZZL5.json","view_paper":"https://pith.science/paper/B6RZP5OI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03816&json=true","fetch_graph":"https://pith.science/api/pith-number/B6RZP5OIZ5ZXRMXQJHXMVQZZL5/graph.json","fetch_events":"https://pith.science/api/pith-number/B6RZP5OIZ5ZXRMXQJHXMVQZZL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6RZP5OIZ5ZXRMXQJHXMVQZZL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6RZP5OIZ5ZXRMXQJHXMVQZZL5/action/storage_attestation","attest_author":"https://pith.science/pith/B6RZP5OIZ5ZXRMXQJHXMVQZZL5/action/author_attestation","sign_citation":"https://pith.science/pith/B6RZP5OIZ5ZXRMXQJHXMVQZZL5/action/citation_signature","submit_replication":"https://pith.science/pith/B6RZP5OIZ5ZXRMXQJHXMVQZZL5/action/replication_record"}},"created_at":"2026-05-18T01:12:32.958270+00:00","updated_at":"2026-05-18T01:12:32.958270+00:00"}