{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FFKYRGSBPHX4O33X7SHCJXQ7RN","short_pith_number":"pith:FFKYRGSB","canonical_record":{"source":{"id":"1612.02712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-08T16:15:57Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"13f5ed6690f1bd372224b6e7fb3d542a6470c6920d188724b7145a032e722325","abstract_canon_sha256":"9d7b8d92799603754f84fc805ae377a99d5d6257aa93cabf5ae1d33c4539d4c8"},"schema_version":"1.0"},"canonical_sha256":"2955889a4179efc76f77fc8e24de1f8b5fe217efdd7ac39ddf24c065b42a60d5","source":{"kind":"arxiv","id":"1612.02712","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02712","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02712v2","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02712","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"FFKYRGSBPHX4","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FFKYRGSBPHX4O33X","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FFKYRGSB","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FFKYRGSBPHX4O33X7SHCJXQ7RN","target":"record","payload":{"canonical_record":{"source":{"id":"1612.02712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-08T16:15:57Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"13f5ed6690f1bd372224b6e7fb3d542a6470c6920d188724b7145a032e722325","abstract_canon_sha256":"9d7b8d92799603754f84fc805ae377a99d5d6257aa93cabf5ae1d33c4539d4c8"},"schema_version":"1.0"},"canonical_sha256":"2955889a4179efc76f77fc8e24de1f8b5fe217efdd7ac39ddf24c065b42a60d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:57.217118Z","signature_b64":"7m3BBo4XFiEYP7Cc/uS7fn7D+N9ohgrZvvAWpVS15N5mSJs6i+LxyBUHieWgPWTaQozDNt/jHqmfyhzv/I1YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2955889a4179efc76f77fc8e24de1f8b5fe217efdd7ac39ddf24c065b42a60d5","last_reissued_at":"2026-05-18T00:51:57.216506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:57.216506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.02712","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:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnYW0O8aPcSyd0Giyg2cvJJQQ5AZQa1vG8ZHxV/4aRg64PUhZgPDuj+vQ5i0mHsR5e9ikrlJa4dIfZ0kdO1XDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:05:08.018896Z"},"content_sha256":"0afe9a4925bc7ac5849edb8a41c695b36067bbd83c3297d49a6b556ccfc9aa22","schema_version":"1.0","event_id":"sha256:0afe9a4925bc7ac5849edb8a41c695b36067bbd83c3297d49a6b556ccfc9aa22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FFKYRGSBPHX4O33X7SHCJXQ7RN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Influence Maximization for Multiple Products in Continuous-Time Diffusion Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Hongyuan Zha, Le Song, Manuel Gomez-Rodriguez, Maria-Florina Balcan, Nan Du, Yingyu Liang","submitted_at":"2016-12-08T16:15:57Z","abstract_excerpt":"A typical viral marketing model identifies influential users in a social network to maximize a single product adoption assuming unlimited user attention, campaign budgets, and time. In reality, multiple products need campaigns, users have limited attention, convincing users incurs costs, and advertisers have limited budgets and expect the adoptions to be maximized soon. Facing these user, monetary, and timing constraints, we formulate the problem as a submodular maximization task in a continuous-time diffusion model under the intersection of a matroid and multiple knapsack constraints. We prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02712","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:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sangoaklbCXtK3qEstqnCamHOxUGxCX1wadAY2TG4mQUgjfFgQ2bnTV11jqp+n69MOzGcDRSL0KJOtL2ojOICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:05:08.019606Z"},"content_sha256":"579a48f3d41e42b0a2c0c24c2a687502340061a6fea9944a7b6ad7ce23b67d43","schema_version":"1.0","event_id":"sha256:579a48f3d41e42b0a2c0c24c2a687502340061a6fea9944a7b6ad7ce23b67d43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFKYRGSBPHX4O33X7SHCJXQ7RN/bundle.json","state_url":"https://pith.science/pith/FFKYRGSBPHX4O33X7SHCJXQ7RN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFKYRGSBPHX4O33X7SHCJXQ7RN/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-26T11:05:08Z","links":{"resolver":"https://pith.science/pith/FFKYRGSBPHX4O33X7SHCJXQ7RN","bundle":"https://pith.science/pith/FFKYRGSBPHX4O33X7SHCJXQ7RN/bundle.json","state":"https://pith.science/pith/FFKYRGSBPHX4O33X7SHCJXQ7RN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFKYRGSBPHX4O33X7SHCJXQ7RN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FFKYRGSBPHX4O33X7SHCJXQ7RN","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":"9d7b8d92799603754f84fc805ae377a99d5d6257aa93cabf5ae1d33c4539d4c8","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-08T16:15:57Z","title_canon_sha256":"13f5ed6690f1bd372224b6e7fb3d542a6470c6920d188724b7145a032e722325"},"schema_version":"1.0","source":{"id":"1612.02712","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02712","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02712v2","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02712","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"FFKYRGSBPHX4","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FFKYRGSBPHX4O33X","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FFKYRGSB","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:579a48f3d41e42b0a2c0c24c2a687502340061a6fea9944a7b6ad7ce23b67d43","target":"graph","created_at":"2026-05-18T00:51:57Z","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":"A typical viral marketing model identifies influential users in a social network to maximize a single product adoption assuming unlimited user attention, campaign budgets, and time. In reality, multiple products need campaigns, users have limited attention, convincing users incurs costs, and advertisers have limited budgets and expect the adoptions to be maximized soon. Facing these user, monetary, and timing constraints, we formulate the problem as a submodular maximization task in a continuous-time diffusion model under the intersection of a matroid and multiple knapsack constraints. We prop","authors_text":"Hongyuan Zha, Le Song, Manuel Gomez-Rodriguez, Maria-Florina Balcan, Nan Du, Yingyu Liang","cross_cats":["cs.DS","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-08T16:15:57Z","title":"Scalable Influence Maximization for Multiple Products in Continuous-Time Diffusion Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02712","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:0afe9a4925bc7ac5849edb8a41c695b36067bbd83c3297d49a6b556ccfc9aa22","target":"record","created_at":"2026-05-18T00:51:57Z","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":"9d7b8d92799603754f84fc805ae377a99d5d6257aa93cabf5ae1d33c4539d4c8","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-08T16:15:57Z","title_canon_sha256":"13f5ed6690f1bd372224b6e7fb3d542a6470c6920d188724b7145a032e722325"},"schema_version":"1.0","source":{"id":"1612.02712","kind":"arxiv","version":2}},"canonical_sha256":"2955889a4179efc76f77fc8e24de1f8b5fe217efdd7ac39ddf24c065b42a60d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2955889a4179efc76f77fc8e24de1f8b5fe217efdd7ac39ddf24c065b42a60d5","first_computed_at":"2026-05-18T00:51:57.216506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:57.216506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7m3BBo4XFiEYP7Cc/uS7fn7D+N9ohgrZvvAWpVS15N5mSJs6i+LxyBUHieWgPWTaQozDNt/jHqmfyhzv/I1YAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:57.217118Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02712","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0afe9a4925bc7ac5849edb8a41c695b36067bbd83c3297d49a6b556ccfc9aa22","sha256:579a48f3d41e42b0a2c0c24c2a687502340061a6fea9944a7b6ad7ce23b67d43"],"state_sha256":"9330ded38ab701722fcece09299d621b97d88f950cf9901e6ce7c234d0bf67c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bS1OP76qh5xjpzA7Jwel5fb8WwtqBMfX6z7R4lSGaFr/CaQq13TsK3D3dW/pz/7dejb3kaV62g6mKQ8nE1/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:05:08.023006Z","bundle_sha256":"8cf0780e3be762127a96ff8d767d05bc56395eef73ac76e99f9b64d7c8af0059"}}