{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CGYZI2CYHAMNL2RGF3H55ZDXQK","short_pith_number":"pith:CGYZI2CY","canonical_record":{"source":{"id":"1111.4795","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-11-21T09:29:06Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"17d100fc0d04d392d47472944c61d2d731db8b46bc896d437d46847a3308c527","abstract_canon_sha256":"509b5df22214ab2e15abdc1ec79b8273dc06fe554254d75265d385a889fc642e"},"schema_version":"1.0"},"canonical_sha256":"11b19468583818d5ea262ecfdee47782a5dbc747e9ec17bd4fbdc4530490e948","source":{"kind":"arxiv","id":"1111.4795","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4795","created_at":"2026-05-18T03:59:49Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4795v3","created_at":"2026-05-18T03:59:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4795","created_at":"2026-05-18T03:59:49Z"},{"alias_kind":"pith_short_12","alias_value":"CGYZI2CYHAMN","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CGYZI2CYHAMNL2RG","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CGYZI2CY","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CGYZI2CYHAMNL2RGF3H55ZDXQK","target":"record","payload":{"canonical_record":{"source":{"id":"1111.4795","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-11-21T09:29:06Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"17d100fc0d04d392d47472944c61d2d731db8b46bc896d437d46847a3308c527","abstract_canon_sha256":"509b5df22214ab2e15abdc1ec79b8273dc06fe554254d75265d385a889fc642e"},"schema_version":"1.0"},"canonical_sha256":"11b19468583818d5ea262ecfdee47782a5dbc747e9ec17bd4fbdc4530490e948","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:49.255926Z","signature_b64":"voyp8/C79AHjz3sKHKp8B5tEVftxk6SG/gGXf2QZxL9bEmj4GGZEvLXrlDN5tc3TZ2r9KfTSBT/zLtxTw5HnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11b19468583818d5ea262ecfdee47782a5dbc747e9ec17bd4fbdc4530490e948","last_reissued_at":"2026-05-18T03:59:49.255519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:49.255519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.4795","source_version":3,"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-18T03:59:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWzqLzIF256w/WCAJL7jwe2b193Q0hA6V1nCOGFVR18BDddmohinL4IvJv3hzbB2O+KckWNNL34DHdxQMmWrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:47:08.617773Z"},"content_sha256":"03d00b57ff36145d21459bd089bf7412eb3b88b381ac27528befab482819ce63","schema_version":"1.0","event_id":"sha256:03d00b57ff36145d21459bd089bf7412eb3b88b381ac27528befab482819ce63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CGYZI2CYHAMNL2RGF3H55ZDXQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"IRIE: Scalable and Robust Influence Maximization in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Kyomin Jung, Wei Chen, Wooram Heo","submitted_at":"2011-11-21T09:29:06Z","abstract_excerpt":"Influence maximization is the problem of selecting top $k$ seed nodes in a social network to maximize their influence coverage under certain influence diffusion models. In this paper, we propose a novel algorithm IRIE that integrates a new message passing based influence ranking (IR), and influence estimation (IE) methods for influence maximization in both the independent cascade (IC) model and its extension IC-N that incorporates negative opinion propagations. Through extensive experiments, we demonstrate that IRIE matches the influence coverage of other algorithms while scales much better th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4795","kind":"arxiv","version":3},"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-18T03:59:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfP42CZl9QjlXCiXGLMQBBp/gwGWuJPyG59gZnVBqgt9MLFcWVmXEI8gFeLTKTYfgvqDyzy4itXJYBhhB0k3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:47:08.618436Z"},"content_sha256":"77495564feae559ea20830f4d548293bb9879c5f780ce05816779eb902d9ca88","schema_version":"1.0","event_id":"sha256:77495564feae559ea20830f4d548293bb9879c5f780ce05816779eb902d9ca88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGYZI2CYHAMNL2RGF3H55ZDXQK/bundle.json","state_url":"https://pith.science/pith/CGYZI2CYHAMNL2RGF3H55ZDXQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGYZI2CYHAMNL2RGF3H55ZDXQK/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-27T13:47:08Z","links":{"resolver":"https://pith.science/pith/CGYZI2CYHAMNL2RGF3H55ZDXQK","bundle":"https://pith.science/pith/CGYZI2CYHAMNL2RGF3H55ZDXQK/bundle.json","state":"https://pith.science/pith/CGYZI2CYHAMNL2RGF3H55ZDXQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGYZI2CYHAMNL2RGF3H55ZDXQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CGYZI2CYHAMNL2RGF3H55ZDXQK","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":"509b5df22214ab2e15abdc1ec79b8273dc06fe554254d75265d385a889fc642e","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-11-21T09:29:06Z","title_canon_sha256":"17d100fc0d04d392d47472944c61d2d731db8b46bc896d437d46847a3308c527"},"schema_version":"1.0","source":{"id":"1111.4795","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4795","created_at":"2026-05-18T03:59:49Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4795v3","created_at":"2026-05-18T03:59:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4795","created_at":"2026-05-18T03:59:49Z"},{"alias_kind":"pith_short_12","alias_value":"CGYZI2CYHAMN","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CGYZI2CYHAMNL2RG","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CGYZI2CY","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:77495564feae559ea20830f4d548293bb9879c5f780ce05816779eb902d9ca88","target":"graph","created_at":"2026-05-18T03:59: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":"Influence maximization is the problem of selecting top $k$ seed nodes in a social network to maximize their influence coverage under certain influence diffusion models. In this paper, we propose a novel algorithm IRIE that integrates a new message passing based influence ranking (IR), and influence estimation (IE) methods for influence maximization in both the independent cascade (IC) model and its extension IC-N that incorporates negative opinion propagations. Through extensive experiments, we demonstrate that IRIE matches the influence coverage of other algorithms while scales much better th","authors_text":"Kyomin Jung, Wei Chen, Wooram Heo","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-11-21T09:29:06Z","title":"IRIE: Scalable and Robust Influence Maximization in Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4795","kind":"arxiv","version":3},"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:03d00b57ff36145d21459bd089bf7412eb3b88b381ac27528befab482819ce63","target":"record","created_at":"2026-05-18T03:59: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":"509b5df22214ab2e15abdc1ec79b8273dc06fe554254d75265d385a889fc642e","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-11-21T09:29:06Z","title_canon_sha256":"17d100fc0d04d392d47472944c61d2d731db8b46bc896d437d46847a3308c527"},"schema_version":"1.0","source":{"id":"1111.4795","kind":"arxiv","version":3}},"canonical_sha256":"11b19468583818d5ea262ecfdee47782a5dbc747e9ec17bd4fbdc4530490e948","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11b19468583818d5ea262ecfdee47782a5dbc747e9ec17bd4fbdc4530490e948","first_computed_at":"2026-05-18T03:59:49.255519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:49.255519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"voyp8/C79AHjz3sKHKp8B5tEVftxk6SG/gGXf2QZxL9bEmj4GGZEvLXrlDN5tc3TZ2r9KfTSBT/zLtxTw5HnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:49.255926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4795","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03d00b57ff36145d21459bd089bf7412eb3b88b381ac27528befab482819ce63","sha256:77495564feae559ea20830f4d548293bb9879c5f780ce05816779eb902d9ca88"],"state_sha256":"50c4b1be5ecc0cad6cb1947e9fcbf477946f0367fe4255a89cce61e371b08e71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHIEhED6XXgDBTJ/Jea+UV0PPkvJ1YMTveyUKwDHJib2DUCBNKE4AG3HHlBiWC/0pHpdLb82XfrZRS6hAm/TBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:47:08.622001Z","bundle_sha256":"11dff9d203818de2b9775ae8ae43484a72b7c8b2a953e0ab14d2446b5d827209"}}