{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7GAHI4QYEY3BH6GGTUIMPN546T","short_pith_number":"pith:7GAHI4QY","canonical_record":{"source":{"id":"1805.12320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-31T05:24:16Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"bce05f918e9515d1043e6ca6052a90b92d90f296a48669c5035817318f3473ef","abstract_canon_sha256":"bed7aa6fc9f93aeb0c9e82fdd701c6582e5b46327eda1dbb9c79b89f22776454"},"schema_version":"1.0"},"canonical_sha256":"f980747218263613f8c69d10c7b7bcf4f0fc7b2ab08bbf507d8baa19968422d2","source":{"kind":"arxiv","id":"1805.12320","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12320","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12320v1","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12320","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"7GAHI4QYEY3B","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7GAHI4QYEY3BH6GG","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7GAHI4QY","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7GAHI4QYEY3BH6GGTUIMPN546T","target":"record","payload":{"canonical_record":{"source":{"id":"1805.12320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-31T05:24:16Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"bce05f918e9515d1043e6ca6052a90b92d90f296a48669c5035817318f3473ef","abstract_canon_sha256":"bed7aa6fc9f93aeb0c9e82fdd701c6582e5b46327eda1dbb9c79b89f22776454"},"schema_version":"1.0"},"canonical_sha256":"f980747218263613f8c69d10c7b7bcf4f0fc7b2ab08bbf507d8baa19968422d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:30.595310Z","signature_b64":"NiJY4GMkshYYo7CCjB2gAP4oXXKR+8JNSLeMXtcBgQwpAZSEtXUOYp1XUr3JTnHchwn1thQS9cTmFrPU3mtcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f980747218263613f8c69d10c7b7bcf4f0fc7b2ab08bbf507d8baa19968422d2","last_reissued_at":"2026-05-18T00:14:30.594630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:30.594630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.12320","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-05-18T00:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zecignwnAq9lx1EPbjrwpZdlbpZlKGi5+2fj0CjyAlc8ItTLkCV3IUFL8hZzjKauiGfvgACwn1z+OBLMAS4HCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:20:16.915052Z"},"content_sha256":"02cd51e3a704b960b2c4b3de0fb04aaa583acdb3daf61f235717d890217e1b89","schema_version":"1.0","event_id":"sha256:02cd51e3a704b960b2c4b3de0fb04aaa583acdb3daf61f235717d890217e1b89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7GAHI4QYEY3BH6GGTUIMPN546T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QuickIM: Efficient, Accurate and Robust Influence Maximization Algorithm on Billion-Scale Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Jianzhong Li, Rong Zhu, Sheng Yang, Yue Han, Zhaonian Zou","submitted_at":"2018-05-31T05:24:16Z","abstract_excerpt":"The Influence Maximization (IM) problem aims at finding k seed vertices in a network, starting from which influence can be spread in the network to the maximum extent. In this paper, we propose QuickIM, the first versatile IM algorithm that attains all the desirable properties of a practically applicable IM algorithm at the same time, namely high time efficiency, good result quality, low memory footprint, and high robustness. On real-world social networks, QuickIM achieves the $\\Omega(n + m)$ lower bound on time complexity and $\\Omega(n)$ space complexity, where $n$ and $m$ are the number of v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12320","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"},"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:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBIKcQF0d34EEVHQFxzT/BAWXJoSk73aNbfUOHjClNfuDjcylBipc4EzXSS3UA8VWn4I3hv8ZPz51cR4jZlYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:20:16.915692Z"},"content_sha256":"3419309689ad937cc8fa1100652a99465446bf4719128fe29bfa6f98a523b811","schema_version":"1.0","event_id":"sha256:3419309689ad937cc8fa1100652a99465446bf4719128fe29bfa6f98a523b811"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GAHI4QYEY3BH6GGTUIMPN546T/bundle.json","state_url":"https://pith.science/pith/7GAHI4QYEY3BH6GGTUIMPN546T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GAHI4QYEY3BH6GGTUIMPN546T/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-27T05:20:16Z","links":{"resolver":"https://pith.science/pith/7GAHI4QYEY3BH6GGTUIMPN546T","bundle":"https://pith.science/pith/7GAHI4QYEY3BH6GGTUIMPN546T/bundle.json","state":"https://pith.science/pith/7GAHI4QYEY3BH6GGTUIMPN546T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GAHI4QYEY3BH6GGTUIMPN546T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7GAHI4QYEY3BH6GGTUIMPN546T","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":"bed7aa6fc9f93aeb0c9e82fdd701c6582e5b46327eda1dbb9c79b89f22776454","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-31T05:24:16Z","title_canon_sha256":"bce05f918e9515d1043e6ca6052a90b92d90f296a48669c5035817318f3473ef"},"schema_version":"1.0","source":{"id":"1805.12320","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12320","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12320v1","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12320","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"7GAHI4QYEY3B","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7GAHI4QYEY3BH6GG","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7GAHI4QY","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:3419309689ad937cc8fa1100652a99465446bf4719128fe29bfa6f98a523b811","target":"graph","created_at":"2026-05-18T00:14: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":"The Influence Maximization (IM) problem aims at finding k seed vertices in a network, starting from which influence can be spread in the network to the maximum extent. In this paper, we propose QuickIM, the first versatile IM algorithm that attains all the desirable properties of a practically applicable IM algorithm at the same time, namely high time efficiency, good result quality, low memory footprint, and high robustness. On real-world social networks, QuickIM achieves the $\\Omega(n + m)$ lower bound on time complexity and $\\Omega(n)$ space complexity, where $n$ and $m$ are the number of v","authors_text":"Jianzhong Li, Rong Zhu, Sheng Yang, Yue Han, Zhaonian Zou","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-31T05:24:16Z","title":"QuickIM: Efficient, Accurate and Robust Influence Maximization Algorithm on Billion-Scale Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12320","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:02cd51e3a704b960b2c4b3de0fb04aaa583acdb3daf61f235717d890217e1b89","target":"record","created_at":"2026-05-18T00:14: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":"bed7aa6fc9f93aeb0c9e82fdd701c6582e5b46327eda1dbb9c79b89f22776454","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-31T05:24:16Z","title_canon_sha256":"bce05f918e9515d1043e6ca6052a90b92d90f296a48669c5035817318f3473ef"},"schema_version":"1.0","source":{"id":"1805.12320","kind":"arxiv","version":1}},"canonical_sha256":"f980747218263613f8c69d10c7b7bcf4f0fc7b2ab08bbf507d8baa19968422d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f980747218263613f8c69d10c7b7bcf4f0fc7b2ab08bbf507d8baa19968422d2","first_computed_at":"2026-05-18T00:14:30.594630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:30.594630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NiJY4GMkshYYo7CCjB2gAP4oXXKR+8JNSLeMXtcBgQwpAZSEtXUOYp1XUr3JTnHchwn1thQS9cTmFrPU3mtcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:30.595310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.12320","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02cd51e3a704b960b2c4b3de0fb04aaa583acdb3daf61f235717d890217e1b89","sha256:3419309689ad937cc8fa1100652a99465446bf4719128fe29bfa6f98a523b811"],"state_sha256":"f8110bb91a5dddc7ca0b043b80f04311bbbd0dfb1419a324da90e5211c15e454"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oNuqcxfc7YmoubVOrwyZIJz14x+YzSR0nE2PX4cYziZF+/K5m3xI4fxFmCCpOJvoLYsOHQ1Y5N1AVF0Vi0ZvBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:20:16.918846Z","bundle_sha256":"cf069b356d890e465965cd2b71f0e0b140231b4843fe6b8d04bde99491a225cd"}}