{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DLZCLCXNBKBTV4U5YWZIFYXWLZ","short_pith_number":"pith:DLZCLCXN","schema_version":"1.0","canonical_sha256":"1af2258aed0a833af29dc5b282e2f65e58995db980b3e019d20310509d3897df","source":{"kind":"arxiv","id":"2308.14012","version":2},"attestation_state":"computed","paper":{"title":"Neural Influence Estimator: Towards Real-time Solutions to Influence Blocking Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.NE","authors_text":"Ke Tang, Shengcai Liu, Wenjie Chen, Yew-Soon Ong, Zhuang Li","submitted_at":"2023-08-27T06:16:40Z","abstract_excerpt":"Real-time solutions to the influence blocking maximization (IBM) problems are crucial for promptly containing the spread of misinformation. However, achieving this goal is non-trivial, mainly because assessing the blocked influence of an IBM problem solution typically requires plenty of expensive Monte Carlo simulations (MCSs). This work presents a novel approach that enables solving IBM problems with hundreds of thousands of nodes and edges in seconds. The key idea is to construct a fast-to-evaluate surrogate model called neural influence estimator (NIE) offline as a substitute for the time-i"},"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":"2308.14012","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-08-27T06:16:40Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"96d0d646afb7b6620b6eb6456f6c807569b200e30c4c38e89e33c4ff23cc26ef","abstract_canon_sha256":"1b004778348c3b7d352cdb57e2e2b2ca0d126efaa3918a6f68404f97ae63ff9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:00.430893Z","signature_b64":"xeB7kp5pir1tVv8fws+VJdqE2b0MPjPX2wkYkGkGo2voPc4MMdpiiiMkm8JGbsgZV2o/lkH73IG/PV2jStO0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1af2258aed0a833af29dc5b282e2f65e58995db980b3e019d20310509d3897df","last_reissued_at":"2026-07-05T11:07:00.430490Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:00.430490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Influence Estimator: Towards Real-time Solutions to Influence Blocking Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.NE","authors_text":"Ke Tang, Shengcai Liu, Wenjie Chen, Yew-Soon Ong, Zhuang Li","submitted_at":"2023-08-27T06:16:40Z","abstract_excerpt":"Real-time solutions to the influence blocking maximization (IBM) problems are crucial for promptly containing the spread of misinformation. However, achieving this goal is non-trivial, mainly because assessing the blocked influence of an IBM problem solution typically requires plenty of expensive Monte Carlo simulations (MCSs). This work presents a novel approach that enables solving IBM problems with hundreds of thousands of nodes and edges in seconds. The key idea is to construct a fast-to-evaluate surrogate model called neural influence estimator (NIE) offline as a substitute for the time-i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.14012","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.14012/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.14012","created_at":"2026-07-05T11:07:00.430548+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.14012v2","created_at":"2026-07-05T11:07:00.430548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.14012","created_at":"2026-07-05T11:07:00.430548+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLZCLCXNBKBT","created_at":"2026-07-05T11:07:00.430548+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLZCLCXNBKBTV4U5","created_at":"2026-07-05T11:07:00.430548+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLZCLCXN","created_at":"2026-07-05T11:07:00.430548+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.01129","citing_title":"Human-Robot Red Teaming for Safety-Aware Reasoning","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DLZCLCXNBKBTV4U5YWZIFYXWLZ","json":"https://pith.science/pith/DLZCLCXNBKBTV4U5YWZIFYXWLZ.json","graph_json":"https://pith.science/api/pith-number/DLZCLCXNBKBTV4U5YWZIFYXWLZ/graph.json","events_json":"https://pith.science/api/pith-number/DLZCLCXNBKBTV4U5YWZIFYXWLZ/events.json","paper":"https://pith.science/paper/DLZCLCXN"},"agent_actions":{"view_html":"https://pith.science/pith/DLZCLCXNBKBTV4U5YWZIFYXWLZ","download_json":"https://pith.science/pith/DLZCLCXNBKBTV4U5YWZIFYXWLZ.json","view_paper":"https://pith.science/paper/DLZCLCXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.14012&json=true","fetch_graph":"https://pith.science/api/pith-number/DLZCLCXNBKBTV4U5YWZIFYXWLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DLZCLCXNBKBTV4U5YWZIFYXWLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLZCLCXNBKBTV4U5YWZIFYXWLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLZCLCXNBKBTV4U5YWZIFYXWLZ/action/storage_attestation","attest_author":"https://pith.science/pith/DLZCLCXNBKBTV4U5YWZIFYXWLZ/action/author_attestation","sign_citation":"https://pith.science/pith/DLZCLCXNBKBTV4U5YWZIFYXWLZ/action/citation_signature","submit_replication":"https://pith.science/pith/DLZCLCXNBKBTV4U5YWZIFYXWLZ/action/replication_record"}},"created_at":"2026-07-05T11:07:00.430548+00:00","updated_at":"2026-07-05T11:07:00.430548+00:00"}