{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HOLWAGCUC7QIQWTAPQ6NYQ44HH","short_pith_number":"pith:HOLWAGCU","schema_version":"1.0","canonical_sha256":"3b9760185417e0885a607c3cdc439c39d9304c28dbb40ae064422e4375757d9a","source":{"kind":"arxiv","id":"2405.12871","version":1},"attestation_state":"computed","paper":{"title":"Efficient Influence Minimization via Node Blocking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jinghao Wang, Lu Qin, Wenjie Zhang, Xiaoyang Wang, Xuemin Lin, Yanping Wu, Ying Zhang","submitted_at":"2024-05-21T15:39:11Z","abstract_excerpt":"Given a graph G, a budget k and a misinformation seed set S, Influence Minimization (IMIN) via node blocking aims to find a set of k nodes to be blocked such that the expected spread of S is minimized. This problem finds important applications in suppressing the spread of misinformation and has been extensively studied in the literature. However, existing solutions for IMIN still incur significant computation overhead, especially when k becomes large. In addition, there is still no approximation solution with non-trivial theoretical guarantee for IMIN via node blocking prior to our work. In th"},"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":"2405.12871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-05-21T15:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"b91d5e9d3d07776dea96d31e5f44b0070c42777e0ff28c6dc55fa4b8d5b5b7e2","abstract_canon_sha256":"314e9c8f94f8fa31b0fd4c5779458ffa0b5760e6e2a0e175fada4ea4f8e6e3eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:27.493227Z","signature_b64":"+0rpOeXOw0vFVHgzj8OPzPKZb8hPCnxmTI27tMCqw2ewCA16j0RBKVXDpWuHn+AZDvdR+3gVfdIdHnWEfxqOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b9760185417e0885a607c3cdc439c39d9304c28dbb40ae064422e4375757d9a","last_reissued_at":"2026-07-05T08:21:27.492728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:27.492728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Influence Minimization via Node Blocking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jinghao Wang, Lu Qin, Wenjie Zhang, Xiaoyang Wang, Xuemin Lin, Yanping Wu, Ying Zhang","submitted_at":"2024-05-21T15:39:11Z","abstract_excerpt":"Given a graph G, a budget k and a misinformation seed set S, Influence Minimization (IMIN) via node blocking aims to find a set of k nodes to be blocked such that the expected spread of S is minimized. This problem finds important applications in suppressing the spread of misinformation and has been extensively studied in the literature. However, existing solutions for IMIN still incur significant computation overhead, especially when k becomes large. In addition, there is still no approximation solution with non-trivial theoretical guarantee for IMIN via node blocking prior to our work. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12871","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.12871/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":"2405.12871","created_at":"2026-07-05T08:21:27.492784+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.12871v1","created_at":"2026-07-05T08:21:27.492784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12871","created_at":"2026-07-05T08:21:27.492784+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOLWAGCUC7QI","created_at":"2026-07-05T08:21:27.492784+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOLWAGCUC7QIQWTA","created_at":"2026-07-05T08:21:27.492784+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOLWAGCU","created_at":"2026-07-05T08:21:27.492784+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.12155","citing_title":"SGPT: Few-Shot Prompt Tuning for Signed Graphs","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HOLWAGCUC7QIQWTAPQ6NYQ44HH","json":"https://pith.science/pith/HOLWAGCUC7QIQWTAPQ6NYQ44HH.json","graph_json":"https://pith.science/api/pith-number/HOLWAGCUC7QIQWTAPQ6NYQ44HH/graph.json","events_json":"https://pith.science/api/pith-number/HOLWAGCUC7QIQWTAPQ6NYQ44HH/events.json","paper":"https://pith.science/paper/HOLWAGCU"},"agent_actions":{"view_html":"https://pith.science/pith/HOLWAGCUC7QIQWTAPQ6NYQ44HH","download_json":"https://pith.science/pith/HOLWAGCUC7QIQWTAPQ6NYQ44HH.json","view_paper":"https://pith.science/paper/HOLWAGCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.12871&json=true","fetch_graph":"https://pith.science/api/pith-number/HOLWAGCUC7QIQWTAPQ6NYQ44HH/graph.json","fetch_events":"https://pith.science/api/pith-number/HOLWAGCUC7QIQWTAPQ6NYQ44HH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOLWAGCUC7QIQWTAPQ6NYQ44HH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOLWAGCUC7QIQWTAPQ6NYQ44HH/action/storage_attestation","attest_author":"https://pith.science/pith/HOLWAGCUC7QIQWTAPQ6NYQ44HH/action/author_attestation","sign_citation":"https://pith.science/pith/HOLWAGCUC7QIQWTAPQ6NYQ44HH/action/citation_signature","submit_replication":"https://pith.science/pith/HOLWAGCUC7QIQWTAPQ6NYQ44HH/action/replication_record"}},"created_at":"2026-07-05T08:21:27.492784+00:00","updated_at":"2026-07-05T08:21:27.492784+00:00"}