{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3FC3YJMHSZL4OMVSA3PLCXOO5P","short_pith_number":"pith:3FC3YJMH","canonical_record":{"source":{"id":"2004.06469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-04-14T13:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"686bc0e7662a67f5045953175d6aeee3383cee8df3afbe88e7ae0c3d24e69e57","abstract_canon_sha256":"a8a593a7eacbc65985779cb678c92a763399d30a40b8356504267aca96fb8576"},"schema_version":"1.0"},"canonical_sha256":"d945bc25879657c732b206deb15dceebebefa4bd545ef98ccd0e5a4bdead0e5a","source":{"kind":"arxiv","id":"2004.06469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.06469","created_at":"2026-07-05T00:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"2004.06469v1","created_at":"2026-07-05T00:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.06469","created_at":"2026-07-05T00:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"3FC3YJMHSZL4","created_at":"2026-07-05T00:54:52Z"},{"alias_kind":"pith_short_16","alias_value":"3FC3YJMHSZL4OMVS","created_at":"2026-07-05T00:54:52Z"},{"alias_kind":"pith_short_8","alias_value":"3FC3YJMH","created_at":"2026-07-05T00:54:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3FC3YJMHSZL4OMVSA3PLCXOO5P","target":"record","payload":{"canonical_record":{"source":{"id":"2004.06469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-04-14T13:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"686bc0e7662a67f5045953175d6aeee3383cee8df3afbe88e7ae0c3d24e69e57","abstract_canon_sha256":"a8a593a7eacbc65985779cb678c92a763399d30a40b8356504267aca96fb8576"},"schema_version":"1.0"},"canonical_sha256":"d945bc25879657c732b206deb15dceebebefa4bd545ef98ccd0e5a4bdead0e5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:52.268186Z","signature_b64":"Qqaj9/QhBlJG/+7uPjjYOmSEn+5NH+vu7xoMzgEImZfWu0tdzVvPJVndKODSjQ5gF8t8njIkI6Hy3Axxnb9sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d945bc25879657c732b206deb15dceebebefa4bd545ef98ccd0e5a4bdead0e5a","last_reissued_at":"2026-07-05T00:54:52.267778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:52.267778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.06469","source_version":1,"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-05T00:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mUWqbFs0KdJ13WnQlBJq3GTA1zpfHWbN47vZE8b45n4pI1wE4pFTQZ5e7Xpk3d+QH5qMnIVQmZ6Hq92YrER5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:28:42.205523Z"},"content_sha256":"e3ce1b5bffcfe72d43ccbdcf43b5f7d0f1c6c284069a09ca71f24992d447fe93","schema_version":"1.0","event_id":"sha256:e3ce1b5bffcfe72d43ccbdcf43b5f7d0f1c6c284069a09ca71f24992d447fe93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3FC3YJMHSZL4OMVSA3PLCXOO5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Approximation Algorithms for Adaptive Influence Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Aixin Sun, Andrew Lim, Jing Tang, Kai Han, Keke Huang, Wei Chen, Xiaokui Xiao, Xueyan Tang","submitted_at":"2020-04-14T13:18:57Z","abstract_excerpt":"Given a social network $G$ and an integer $k$, the influence maximization (IM) problem asks for a seed set $S$ of $k$ nodes from $G$ to maximize the expected number of nodes influenced via a propagation model. The majority of the existing algorithms for the IM problem are developed only under the non-adaptive setting, i.e., where all $k$ seed nodes are selected in one batch without observing how they influence other users in real world. In this paper, we study the adaptive IM problem where the $k$ seed nodes are selected in batches of equal size $b$, such that the $i$-th batch is identified af"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.06469","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.06469/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-05T00:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NUTVlwcyy5326vtXydDDfUzMfPWkAX05EhWputsAXDVt8nvwGBVcEcXd5Lp0Ow5hkrldQM3wS4/MFhM1ud91AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:28:42.206169Z"},"content_sha256":"460a8d1dd9c96efa523587c67e9e766e84aab97690c19c05379c8712ac3cd66f","schema_version":"1.0","event_id":"sha256:460a8d1dd9c96efa523587c67e9e766e84aab97690c19c05379c8712ac3cd66f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FC3YJMHSZL4OMVSA3PLCXOO5P/bundle.json","state_url":"https://pith.science/pith/3FC3YJMHSZL4OMVSA3PLCXOO5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FC3YJMHSZL4OMVSA3PLCXOO5P/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-05T18:28:42Z","links":{"resolver":"https://pith.science/pith/3FC3YJMHSZL4OMVSA3PLCXOO5P","bundle":"https://pith.science/pith/3FC3YJMHSZL4OMVSA3PLCXOO5P/bundle.json","state":"https://pith.science/pith/3FC3YJMHSZL4OMVSA3PLCXOO5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FC3YJMHSZL4OMVSA3PLCXOO5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3FC3YJMHSZL4OMVSA3PLCXOO5P","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":"a8a593a7eacbc65985779cb678c92a763399d30a40b8356504267aca96fb8576","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-04-14T13:18:57Z","title_canon_sha256":"686bc0e7662a67f5045953175d6aeee3383cee8df3afbe88e7ae0c3d24e69e57"},"schema_version":"1.0","source":{"id":"2004.06469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.06469","created_at":"2026-07-05T00:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"2004.06469v1","created_at":"2026-07-05T00:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.06469","created_at":"2026-07-05T00:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"3FC3YJMHSZL4","created_at":"2026-07-05T00:54:52Z"},{"alias_kind":"pith_short_16","alias_value":"3FC3YJMHSZL4OMVS","created_at":"2026-07-05T00:54:52Z"},{"alias_kind":"pith_short_8","alias_value":"3FC3YJMH","created_at":"2026-07-05T00:54:52Z"}],"graph_snapshots":[{"event_id":"sha256:460a8d1dd9c96efa523587c67e9e766e84aab97690c19c05379c8712ac3cd66f","target":"graph","created_at":"2026-07-05T00:54:52Z","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/2004.06469/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a social network $G$ and an integer $k$, the influence maximization (IM) problem asks for a seed set $S$ of $k$ nodes from $G$ to maximize the expected number of nodes influenced via a propagation model. The majority of the existing algorithms for the IM problem are developed only under the non-adaptive setting, i.e., where all $k$ seed nodes are selected in one batch without observing how they influence other users in real world. In this paper, we study the adaptive IM problem where the $k$ seed nodes are selected in batches of equal size $b$, such that the $i$-th batch is identified af","authors_text":"Aixin Sun, Andrew Lim, Jing Tang, Kai Han, Keke Huang, Wei Chen, Xiaokui Xiao, Xueyan Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-04-14T13:18:57Z","title":"Efficient Approximation Algorithms for Adaptive Influence Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.06469","kind":"arxiv","version":1},"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:e3ce1b5bffcfe72d43ccbdcf43b5f7d0f1c6c284069a09ca71f24992d447fe93","target":"record","created_at":"2026-07-05T00:54:52Z","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":"a8a593a7eacbc65985779cb678c92a763399d30a40b8356504267aca96fb8576","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-04-14T13:18:57Z","title_canon_sha256":"686bc0e7662a67f5045953175d6aeee3383cee8df3afbe88e7ae0c3d24e69e57"},"schema_version":"1.0","source":{"id":"2004.06469","kind":"arxiv","version":1}},"canonical_sha256":"d945bc25879657c732b206deb15dceebebefa4bd545ef98ccd0e5a4bdead0e5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d945bc25879657c732b206deb15dceebebefa4bd545ef98ccd0e5a4bdead0e5a","first_computed_at":"2026-07-05T00:54:52.267778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:54:52.267778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qqaj9/QhBlJG/+7uPjjYOmSEn+5NH+vu7xoMzgEImZfWu0tdzVvPJVndKODSjQ5gF8t8njIkI6Hy3Axxnb9sDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:54:52.268186Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.06469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3ce1b5bffcfe72d43ccbdcf43b5f7d0f1c6c284069a09ca71f24992d447fe93","sha256:460a8d1dd9c96efa523587c67e9e766e84aab97690c19c05379c8712ac3cd66f"],"state_sha256":"2cde9bff6e52d1578c3da7024762a71c5dc1e1e1ee4375b223ca04bf2e12e026"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6oM8JLSOcBBiZRy6GHFtds4EUJBpJXuxT8gXtyROF+IMtz8Y9/uy4DDaVhlFiGMORGfHaq6n84qqY4Qt04CAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T18:28:42.211026Z","bundle_sha256":"a0be3b98a45b06de6fea121932bd245d93759e3eae88ebf416bf56e5a3fdcb4e"}}