{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5HUBED3VA2NG7ZTX3RTWCRKLHG","short_pith_number":"pith:5HUBED3V","canonical_record":{"source":{"id":"1906.03737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-09T23:43:03Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"1dd7986618e187a7de693c5e39cce0318396e4122e2a3c6761aa815a239e6172","abstract_canon_sha256":"e5386169d3f25c9bf9e6bd398d452244c8bdc8dc3a0d589aa3cf2102d41df22e"},"schema_version":"1.0"},"canonical_sha256":"e9e8120f75069a6fe677dc6761454b39a2f7d1c3f0cdfa2e3c524b452717fc6a","source":{"kind":"arxiv","id":"1906.03737","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03737","created_at":"2026-05-17T23:40:30Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03737v2","created_at":"2026-05-17T23:40:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03737","created_at":"2026-05-17T23:40:30Z"},{"alias_kind":"pith_short_12","alias_value":"5HUBED3VA2NG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5HUBED3VA2NG7ZTX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5HUBED3V","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5HUBED3VA2NG7ZTX3RTWCRKLHG","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-09T23:43:03Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"1dd7986618e187a7de693c5e39cce0318396e4122e2a3c6761aa815a239e6172","abstract_canon_sha256":"e5386169d3f25c9bf9e6bd398d452244c8bdc8dc3a0d589aa3cf2102d41df22e"},"schema_version":"1.0"},"canonical_sha256":"e9e8120f75069a6fe677dc6761454b39a2f7d1c3f0cdfa2e3c524b452717fc6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:30.203362Z","signature_b64":"5eCyAv4OTziqGwM+UqMpGdKFy1vkpksSlR+EtxHO1HSRtEM3WhmfXyQrR41VCsYUgzp+NSzFSvV9RYRYVbVEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9e8120f75069a6fe677dc6761454b39a2f7d1c3f0cdfa2e3c524b452717fc6a","last_reissued_at":"2026-05-17T23:40:30.202950Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:30.202950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03737","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-17T23:40:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zlm7koPWlPsYUlnNt8ShFUWlKmXEngh6YnsNXNobPCBunSAV3F45/KfUMsyDvEDoSBmLwyulI1mtCmmjlx4+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:30:25.720599Z"},"content_sha256":"213720a863b046717bfe34e3e639668059748de270374c50706f82107838323f","schema_version":"1.0","event_id":"sha256:213720a863b046717bfe34e3e639668059748de270374c50706f82107838323f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5HUBED3VA2NG7ZTX3RTWCRKLHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factorization Bandits for Online Influence Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongning Wang, Huazheng Wang, Qingyun Wu, Wei Chen, Zhige Li","submitted_at":"2019-06-09T23:43:03Z","abstract_excerpt":"We study the problem of online influence maximization in social networks. In this problem, a learner aims to identify the set of \"best influencers\" in a network by interacting with it, i.e., repeatedly selecting seed nodes and observing activation feedback in the network. We capitalize on an important property of the influence maximization problem named network assortativity, which is ignored by most existing works in online influence maximization. To realize network assortativity, we factorize the activation probability on the edges into latent factors on the corresponding nodes, including in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03737","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-17T23:40:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMbXqwtZU9RUc0CFuzm/3rslDtORwQHIDd5HieeZAUnKkT6GTFtn/nf3HxoxeBiNSJFL9mq20rlv0QvuwYO7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:30:25.721218Z"},"content_sha256":"8f84446aad86d9f56b6ba2d9534dc059c3fc339ccf8dd8a19d096fbed9a95154","schema_version":"1.0","event_id":"sha256:8f84446aad86d9f56b6ba2d9534dc059c3fc339ccf8dd8a19d096fbed9a95154"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HUBED3VA2NG7ZTX3RTWCRKLHG/bundle.json","state_url":"https://pith.science/pith/5HUBED3VA2NG7ZTX3RTWCRKLHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HUBED3VA2NG7ZTX3RTWCRKLHG/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-27T10:30:25Z","links":{"resolver":"https://pith.science/pith/5HUBED3VA2NG7ZTX3RTWCRKLHG","bundle":"https://pith.science/pith/5HUBED3VA2NG7ZTX3RTWCRKLHG/bundle.json","state":"https://pith.science/pith/5HUBED3VA2NG7ZTX3RTWCRKLHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HUBED3VA2NG7ZTX3RTWCRKLHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5HUBED3VA2NG7ZTX3RTWCRKLHG","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":"e5386169d3f25c9bf9e6bd398d452244c8bdc8dc3a0d589aa3cf2102d41df22e","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-09T23:43:03Z","title_canon_sha256":"1dd7986618e187a7de693c5e39cce0318396e4122e2a3c6761aa815a239e6172"},"schema_version":"1.0","source":{"id":"1906.03737","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03737","created_at":"2026-05-17T23:40:30Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03737v2","created_at":"2026-05-17T23:40:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03737","created_at":"2026-05-17T23:40:30Z"},{"alias_kind":"pith_short_12","alias_value":"5HUBED3VA2NG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5HUBED3VA2NG7ZTX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5HUBED3V","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:8f84446aad86d9f56b6ba2d9534dc059c3fc339ccf8dd8a19d096fbed9a95154","target":"graph","created_at":"2026-05-17T23:40:30Z","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":"We study the problem of online influence maximization in social networks. In this problem, a learner aims to identify the set of \"best influencers\" in a network by interacting with it, i.e., repeatedly selecting seed nodes and observing activation feedback in the network. We capitalize on an important property of the influence maximization problem named network assortativity, which is ignored by most existing works in online influence maximization. To realize network assortativity, we factorize the activation probability on the edges into latent factors on the corresponding nodes, including in","authors_text":"Hongning Wang, Huazheng Wang, Qingyun Wu, Wei Chen, Zhige Li","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-09T23:43:03Z","title":"Factorization Bandits for Online Influence Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03737","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:213720a863b046717bfe34e3e639668059748de270374c50706f82107838323f","target":"record","created_at":"2026-05-17T23:40:30Z","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":"e5386169d3f25c9bf9e6bd398d452244c8bdc8dc3a0d589aa3cf2102d41df22e","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-09T23:43:03Z","title_canon_sha256":"1dd7986618e187a7de693c5e39cce0318396e4122e2a3c6761aa815a239e6172"},"schema_version":"1.0","source":{"id":"1906.03737","kind":"arxiv","version":2}},"canonical_sha256":"e9e8120f75069a6fe677dc6761454b39a2f7d1c3f0cdfa2e3c524b452717fc6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9e8120f75069a6fe677dc6761454b39a2f7d1c3f0cdfa2e3c524b452717fc6a","first_computed_at":"2026-05-17T23:40:30.202950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:30.202950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5eCyAv4OTziqGwM+UqMpGdKFy1vkpksSlR+EtxHO1HSRtEM3WhmfXyQrR41VCsYUgzp+NSzFSvV9RYRYVbVEAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:30.203362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03737","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:213720a863b046717bfe34e3e639668059748de270374c50706f82107838323f","sha256:8f84446aad86d9f56b6ba2d9534dc059c3fc339ccf8dd8a19d096fbed9a95154"],"state_sha256":"9f43fd00089c5cbf04779a6e0be9596297bdca46743c46c5fc1020de85b1963a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"us+mGHnECXFEwKAF8QESUAmSBVmSBi69WUwDhtIE31w1h1V5u9ztPCaHOB2vm4KDEPmXJSWNmSkfVjt6CxZvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:30:25.724786Z","bundle_sha256":"16e93fd2a014db5eff0a1858e3aa3dc95ca5e38048e7d87fcc490b31af22dce9"}}