{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:X3YIVWGNK2RIMGIZC47RTRKUYW","short_pith_number":"pith:X3YIVWGN","schema_version":"1.0","canonical_sha256":"bef08ad8cd56a2861919173f19c554c5a5625910b9e8465857167d09bb2fbac2","source":{"kind":"arxiv","id":"2308.09601","version":1},"attestation_state":"computed","paper":{"title":"MONA: An Efficient and Scalable Strategy for Targeted k-Nodes Collapse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Bo Zhou, Jinhuan Wang, Qi Xuan, Shanqing Yu, Yuqian Lv","submitted_at":"2023-08-18T14:55:14Z","abstract_excerpt":"The concept of k-core plays an important role in measuring the cohesiveness and engagement of a network. And recent studies have shown the vulnerability of k-core under adversarial attacks. However, there are few researchers concentrating on the vulnerability of individual nodes within k-core. Therefore, in this paper, we attempt to study Targeted k-Nodes Collapse Problem (TNsCP), which focuses on removing a minimal size set of edges to make multiple target k-nodes collapse. For this purpose, we first propose a novel algorithm named MOD for candidate reduction. Then we introduce an efficient s"},"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.09601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-08-18T14:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"6021bd29bac45d0420a347cbf5e31ef54684de0353148e9d5afa162ea8d437c4","abstract_canon_sha256":"9cb54499ae7705d60d51ef11ded6078d14097b9048cc6cb0ea603b4a839ea3eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:42:35.359712Z","signature_b64":"vjl62yMCpCCbCUWiBbTI7XHZ8t/nZwbao+vp4a2gvXhK7LMezmAn3LdMEKlEYu9AqtNq9/KZtNjaomYJt1FlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bef08ad8cd56a2861919173f19c554c5a5625910b9e8465857167d09bb2fbac2","last_reissued_at":"2026-07-05T06:42:35.359231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:42:35.359231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MONA: An Efficient and Scalable Strategy for Targeted k-Nodes Collapse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Bo Zhou, Jinhuan Wang, Qi Xuan, Shanqing Yu, Yuqian Lv","submitted_at":"2023-08-18T14:55:14Z","abstract_excerpt":"The concept of k-core plays an important role in measuring the cohesiveness and engagement of a network. And recent studies have shown the vulnerability of k-core under adversarial attacks. However, there are few researchers concentrating on the vulnerability of individual nodes within k-core. Therefore, in this paper, we attempt to study Targeted k-Nodes Collapse Problem (TNsCP), which focuses on removing a minimal size set of edges to make multiple target k-nodes collapse. For this purpose, we first propose a novel algorithm named MOD for candidate reduction. Then we introduce an efficient s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.09601","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/2308.09601/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.09601","created_at":"2026-07-05T06:42:35.359289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.09601v1","created_at":"2026-07-05T06:42:35.359289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.09601","created_at":"2026-07-05T06:42:35.359289+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3YIVWGNK2RI","created_at":"2026-07-05T06:42:35.359289+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3YIVWGNK2RIMGIZ","created_at":"2026-07-05T06:42:35.359289+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3YIVWGN","created_at":"2026-07-05T06:42:35.359289+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/X3YIVWGNK2RIMGIZC47RTRKUYW","json":"https://pith.science/pith/X3YIVWGNK2RIMGIZC47RTRKUYW.json","graph_json":"https://pith.science/api/pith-number/X3YIVWGNK2RIMGIZC47RTRKUYW/graph.json","events_json":"https://pith.science/api/pith-number/X3YIVWGNK2RIMGIZC47RTRKUYW/events.json","paper":"https://pith.science/paper/X3YIVWGN"},"agent_actions":{"view_html":"https://pith.science/pith/X3YIVWGNK2RIMGIZC47RTRKUYW","download_json":"https://pith.science/pith/X3YIVWGNK2RIMGIZC47RTRKUYW.json","view_paper":"https://pith.science/paper/X3YIVWGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.09601&json=true","fetch_graph":"https://pith.science/api/pith-number/X3YIVWGNK2RIMGIZC47RTRKUYW/graph.json","fetch_events":"https://pith.science/api/pith-number/X3YIVWGNK2RIMGIZC47RTRKUYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3YIVWGNK2RIMGIZC47RTRKUYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3YIVWGNK2RIMGIZC47RTRKUYW/action/storage_attestation","attest_author":"https://pith.science/pith/X3YIVWGNK2RIMGIZC47RTRKUYW/action/author_attestation","sign_citation":"https://pith.science/pith/X3YIVWGNK2RIMGIZC47RTRKUYW/action/citation_signature","submit_replication":"https://pith.science/pith/X3YIVWGNK2RIMGIZC47RTRKUYW/action/replication_record"}},"created_at":"2026-07-05T06:42:35.359289+00:00","updated_at":"2026-07-05T06:42:35.359289+00:00"}