{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CMB7J3TLIV2BNWQDTXFLDKTHPL","short_pith_number":"pith:CMB7J3TL","canonical_record":{"source":{"id":"1402.3939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-17T09:33:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b11b7908065e825c7bcab373b97f0bf899006a8fb78b7f866b003de81d998437","abstract_canon_sha256":"dc5d45f87d47c200ce9f66ac3b54b27d6e635fbfeec4e20d48eed7bdb60a5b4c"},"schema_version":"1.0"},"canonical_sha256":"1303f4ee6b457416da039dcab1aa677af05b39157ac9f0bed5fc9f855214d456","source":{"kind":"arxiv","id":"1402.3939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3939","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3939v1","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3939","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"CMB7J3TLIV2B","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CMB7J3TLIV2BNWQD","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CMB7J3TL","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CMB7J3TLIV2BNWQDTXFLDKTHPL","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-17T09:33:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b11b7908065e825c7bcab373b97f0bf899006a8fb78b7f866b003de81d998437","abstract_canon_sha256":"dc5d45f87d47c200ce9f66ac3b54b27d6e635fbfeec4e20d48eed7bdb60a5b4c"},"schema_version":"1.0"},"canonical_sha256":"1303f4ee6b457416da039dcab1aa677af05b39157ac9f0bed5fc9f855214d456","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:55.074450Z","signature_b64":"PJD/lPhx+r3+MBj5tN9s5SruFlq/8M37bGy95yiF2w7D70h8cnvf7C6573tLssEVl4CXjUDQ4J4+UCnx1B3iDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1303f4ee6b457416da039dcab1aa677af05b39157ac9f0bed5fc9f855214d456","last_reissued_at":"2026-05-18T02:58:55.073879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:55.073879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3939","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-18T02:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XfbrxtrTv7zucpZ4sNXG0k15fE5mv/C91WirKNO0FvnqilvUgcOdUoXIp0hY9TQITP+H+vNI/JTodqnMpltRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T00:53:13.197021Z"},"content_sha256":"ec242c673e2c443a3ac1a9cee669505535cedf0c0ddcfb082c15c09744b9f84c","schema_version":"1.0","event_id":"sha256:ec242c673e2c443a3ac1a9cee669505535cedf0c0ddcfb082c15c09744b9f84c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CMB7J3TLIV2BNWQDTXFLDKTHPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"IMRank: Influence Maximization via Finding Self-Consistent Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Hua-Wei Shen, Junming Huang, Suqi Cheng, Wei Chen, Xue-qi Cheng","submitted_at":"2014-02-17T09:33:15Z","abstract_excerpt":"Influence maximization, fundamental for word-of-mouth marketing and viral marketing, aims to find a set of seed nodes maximizing influence spread on social network. Early methods mainly fall into two paradigms with certain benefits and drawbacks: (1)Greedy algorithms, selecting seed nodes one by one, give a guaranteed accuracy relying on the accurate approximation of influence spread with high computational cost; (2)Heuristic algorithms, estimating influence spread using efficient heuristics, have low computational cost but unstable accuracy.\n  We first point out that greedy algorithms are ess"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3939","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-18T02:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wy1uBrlFR7u6IyBJ/04Ialau2pIQAtqyAoRfBz8NOApLyTt+sqwsJnNevWzy+4qPrTQprwK8K9463PC3ORLDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T00:53:13.197602Z"},"content_sha256":"b7bb0fbe4aa1c003c6c6ecc3cad5d83013ca0fca59bd0a3d05f9dc49bc78888f","schema_version":"1.0","event_id":"sha256:b7bb0fbe4aa1c003c6c6ecc3cad5d83013ca0fca59bd0a3d05f9dc49bc78888f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/bundle.json","state_url":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/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-07-07T00:53:13Z","links":{"resolver":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL","bundle":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/bundle.json","state":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CMB7J3TLIV2BNWQDTXFLDKTHPL","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":"dc5d45f87d47c200ce9f66ac3b54b27d6e635fbfeec4e20d48eed7bdb60a5b4c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-17T09:33:15Z","title_canon_sha256":"b11b7908065e825c7bcab373b97f0bf899006a8fb78b7f866b003de81d998437"},"schema_version":"1.0","source":{"id":"1402.3939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3939","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3939v1","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3939","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"CMB7J3TLIV2B","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CMB7J3TLIV2BNWQD","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CMB7J3TL","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:b7bb0fbe4aa1c003c6c6ecc3cad5d83013ca0fca59bd0a3d05f9dc49bc78888f","target":"graph","created_at":"2026-05-18T02:58:55Z","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":"Influence maximization, fundamental for word-of-mouth marketing and viral marketing, aims to find a set of seed nodes maximizing influence spread on social network. Early methods mainly fall into two paradigms with certain benefits and drawbacks: (1)Greedy algorithms, selecting seed nodes one by one, give a guaranteed accuracy relying on the accurate approximation of influence spread with high computational cost; (2)Heuristic algorithms, estimating influence spread using efficient heuristics, have low computational cost but unstable accuracy.\n  We first point out that greedy algorithms are ess","authors_text":"Hua-Wei Shen, Junming Huang, Suqi Cheng, Wei Chen, Xue-qi Cheng","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-17T09:33:15Z","title":"IMRank: Influence Maximization via Finding Self-Consistent Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3939","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:ec242c673e2c443a3ac1a9cee669505535cedf0c0ddcfb082c15c09744b9f84c","target":"record","created_at":"2026-05-18T02:58:55Z","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":"dc5d45f87d47c200ce9f66ac3b54b27d6e635fbfeec4e20d48eed7bdb60a5b4c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-17T09:33:15Z","title_canon_sha256":"b11b7908065e825c7bcab373b97f0bf899006a8fb78b7f866b003de81d998437"},"schema_version":"1.0","source":{"id":"1402.3939","kind":"arxiv","version":1}},"canonical_sha256":"1303f4ee6b457416da039dcab1aa677af05b39157ac9f0bed5fc9f855214d456","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1303f4ee6b457416da039dcab1aa677af05b39157ac9f0bed5fc9f855214d456","first_computed_at":"2026-05-18T02:58:55.073879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:55.073879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PJD/lPhx+r3+MBj5tN9s5SruFlq/8M37bGy95yiF2w7D70h8cnvf7C6573tLssEVl4CXjUDQ4J4+UCnx1B3iDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:55.074450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec242c673e2c443a3ac1a9cee669505535cedf0c0ddcfb082c15c09744b9f84c","sha256:b7bb0fbe4aa1c003c6c6ecc3cad5d83013ca0fca59bd0a3d05f9dc49bc78888f"],"state_sha256":"133cdbaeb5ece000c466bf921292777c458555bb96db487ff9b64266a8f782a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NK8hcDhvh6kp3gWDnpccccUvBoWk+M7tNRa6ah94Bnj4XzEle7n42XM25hgGA+KpAYZtoAwgdf7FyFdMzM7BBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T00:53:13.200887Z","bundle_sha256":"aaffd361ecb248bb91baec83a59b7feb6d2ec1ad404f20ae02283d41ae159991"}}