{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EGLU5SY3DNLXWWGDU2JFQ67GK3","short_pith_number":"pith:EGLU5SY3","canonical_record":{"source":{"id":"1404.0900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-03T13:23:10Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ecba4979cb4269ae18bb16b9f4fc3c7d3aec3b5d20f2d1aed14204f61a86a4b5","abstract_canon_sha256":"bc01c39e73b5214b72472cfb0029a586d57a142d9ce5dc9300301007a2827687"},"schema_version":"1.0"},"canonical_sha256":"21974ecb1b1b577b58c3a692587be656f3c22a1d84728317c061eb414c87a609","source":{"kind":"arxiv","id":"1404.0900","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0900","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0900v2","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0900","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"EGLU5SY3DNLX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EGLU5SY3DNLXWWGD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EGLU5SY3","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EGLU5SY3DNLXWWGDU2JFQ67GK3","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-03T13:23:10Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ecba4979cb4269ae18bb16b9f4fc3c7d3aec3b5d20f2d1aed14204f61a86a4b5","abstract_canon_sha256":"bc01c39e73b5214b72472cfb0029a586d57a142d9ce5dc9300301007a2827687"},"schema_version":"1.0"},"canonical_sha256":"21974ecb1b1b577b58c3a692587be656f3c22a1d84728317c061eb414c87a609","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:49.229041Z","signature_b64":"fktDgfGfkQ60g89LDUo6tTrEuRQup9TYZkQXyhnrEFnNUtrn0r9Ffl7jLdI6jBwIGHhFMOiDVtNuAKLMh0aEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21974ecb1b1b577b58c3a692587be656f3c22a1d84728317c061eb414c87a609","last_reissued_at":"2026-05-18T02:52:49.228674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:49.228674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0900","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-18T02:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RwT+dSEDcVBiYbCLZ5xcFj3sERflv4ONV0Sn3k+ofbdInD/M+IsGOateKdGfKZgtz4L518rsixVvAjoRX2ByBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:13:33.241913Z"},"content_sha256":"2bee92e1a94c651c1eb4abc6cfe9356612cdd292071884db6e771b954bc5d62f","schema_version":"1.0","event_id":"sha256:2bee92e1a94c651c1eb4abc6cfe9356612cdd292071884db6e771b954bc5d62f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EGLU5SY3DNLXWWGDU2JFQ67GK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Xiaokui Xiao, Yanchen Shi, Youze Tang","submitted_at":"2014-04-03T13:23:10Z","abstract_excerpt":"Given a social network G and a constant k, the influence maximization problem asks for k nodes in G that (directly and indirectly) influence the largest number of nodes under a pre-defined diffusion model. This problem finds important applications in viral marketing, and has been extensively studied in the literature. Existing algorithms for influence maximization, however, either trade approximation guarantees for practical efficiency, or vice versa. In particular, among the algorithms that achieve constant factor approximations under the prominent independent cascade (IC) model or linear thr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0900","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-18T02:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2THRKYewXDwTMW/Nz5TumvqDW2vA4Ysw1UerDshgfcYEE2m/ivdI0WGcSGcrLpbtAhiDyfs00Z7cjgiz/cKNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:13:33.242250Z"},"content_sha256":"65c80eb51075883692a06bb0ef14c7561e1b8e9b52f4a7fca6ce5feb58d745dd","schema_version":"1.0","event_id":"sha256:65c80eb51075883692a06bb0ef14c7561e1b8e9b52f4a7fca6ce5feb58d745dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGLU5SY3DNLXWWGDU2JFQ67GK3/bundle.json","state_url":"https://pith.science/pith/EGLU5SY3DNLXWWGDU2JFQ67GK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGLU5SY3DNLXWWGDU2JFQ67GK3/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-06-27T15:13:33Z","links":{"resolver":"https://pith.science/pith/EGLU5SY3DNLXWWGDU2JFQ67GK3","bundle":"https://pith.science/pith/EGLU5SY3DNLXWWGDU2JFQ67GK3/bundle.json","state":"https://pith.science/pith/EGLU5SY3DNLXWWGDU2JFQ67GK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGLU5SY3DNLXWWGDU2JFQ67GK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EGLU5SY3DNLXWWGDU2JFQ67GK3","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":"bc01c39e73b5214b72472cfb0029a586d57a142d9ce5dc9300301007a2827687","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-03T13:23:10Z","title_canon_sha256":"ecba4979cb4269ae18bb16b9f4fc3c7d3aec3b5d20f2d1aed14204f61a86a4b5"},"schema_version":"1.0","source":{"id":"1404.0900","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0900","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0900v2","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0900","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"EGLU5SY3DNLX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EGLU5SY3DNLXWWGD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EGLU5SY3","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:65c80eb51075883692a06bb0ef14c7561e1b8e9b52f4a7fca6ce5feb58d745dd","target":"graph","created_at":"2026-05-18T02:52:49Z","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":"Given a social network G and a constant k, the influence maximization problem asks for k nodes in G that (directly and indirectly) influence the largest number of nodes under a pre-defined diffusion model. This problem finds important applications in viral marketing, and has been extensively studied in the literature. Existing algorithms for influence maximization, however, either trade approximation guarantees for practical efficiency, or vice versa. In particular, among the algorithms that achieve constant factor approximations under the prominent independent cascade (IC) model or linear thr","authors_text":"Xiaokui Xiao, Yanchen Shi, Youze Tang","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-03T13:23:10Z","title":"Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0900","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:2bee92e1a94c651c1eb4abc6cfe9356612cdd292071884db6e771b954bc5d62f","target":"record","created_at":"2026-05-18T02:52:49Z","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":"bc01c39e73b5214b72472cfb0029a586d57a142d9ce5dc9300301007a2827687","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-04-03T13:23:10Z","title_canon_sha256":"ecba4979cb4269ae18bb16b9f4fc3c7d3aec3b5d20f2d1aed14204f61a86a4b5"},"schema_version":"1.0","source":{"id":"1404.0900","kind":"arxiv","version":2}},"canonical_sha256":"21974ecb1b1b577b58c3a692587be656f3c22a1d84728317c061eb414c87a609","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21974ecb1b1b577b58c3a692587be656f3c22a1d84728317c061eb414c87a609","first_computed_at":"2026-05-18T02:52:49.228674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:49.228674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fktDgfGfkQ60g89LDUo6tTrEuRQup9TYZkQXyhnrEFnNUtrn0r9Ffl7jLdI6jBwIGHhFMOiDVtNuAKLMh0aEBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:49.229041Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0900","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bee92e1a94c651c1eb4abc6cfe9356612cdd292071884db6e771b954bc5d62f","sha256:65c80eb51075883692a06bb0ef14c7561e1b8e9b52f4a7fca6ce5feb58d745dd"],"state_sha256":"78a7df46508d0214f63ef30688f9ed2f638ba51aacb7ab036913d39c93f14886"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgAbShBnuHMu7UQY8uCnG1WTYb/ufLSQhNUI/fRaHoOBIzXmpVEWzikYEd+6RezBIdhT3wmP1kz1lUsEFxbiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T15:13:33.244389Z","bundle_sha256":"e90f70f877d66849c205db5cff0d8e06cc371d5c9491e2ecbecd57308c59ab71"}}