{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CMB7J3TLIV2BNWQDTXFLDKTHPL","short_pith_number":"pith:CMB7J3TL","schema_version":"1.0","canonical_sha256":"1303f4ee6b457416da039dcab1aa677af05b39157ac9f0bed5fc9f855214d456","source":{"kind":"arxiv","id":"1402.3939","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.3939","created_at":"2026-05-18T02:58:55.073973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3939v1","created_at":"2026-05-18T02:58:55.073973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3939","created_at":"2026-05-18T02:58:55.073973+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMB7J3TLIV2B","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMB7J3TLIV2BNWQD","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMB7J3TL","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL","json":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL.json","graph_json":"https://pith.science/api/pith-number/CMB7J3TLIV2BNWQDTXFLDKTHPL/graph.json","events_json":"https://pith.science/api/pith-number/CMB7J3TLIV2BNWQDTXFLDKTHPL/events.json","paper":"https://pith.science/paper/CMB7J3TL"},"agent_actions":{"view_html":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL","download_json":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL.json","view_paper":"https://pith.science/paper/CMB7J3TL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3939&json=true","fetch_graph":"https://pith.science/api/pith-number/CMB7J3TLIV2BNWQDTXFLDKTHPL/graph.json","fetch_events":"https://pith.science/api/pith-number/CMB7J3TLIV2BNWQDTXFLDKTHPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/action/storage_attestation","attest_author":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/action/author_attestation","sign_citation":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/action/citation_signature","submit_replication":"https://pith.science/pith/CMB7J3TLIV2BNWQDTXFLDKTHPL/action/replication_record"}},"created_at":"2026-05-18T02:58:55.073973+00:00","updated_at":"2026-05-18T02:58:55.073973+00:00"}