{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4S6U24JRZMD4GIFZRKCBYYUC6O","short_pith_number":"pith:4S6U24JR","schema_version":"1.0","canonical_sha256":"e4bd4d7131cb07c320b98a841c6282f38cf1364f4db8126fbb6d3e8ad8f2dd53","source":{"kind":"arxiv","id":"1411.2427","version":1},"attestation_state":"computed","paper":{"title":"How to efficiently destroy a network with limited information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"G. M. Viswanathan, L. R. da Silva, T. M. Vieira","submitted_at":"2014-11-10T13:54:03Z","abstract_excerpt":"We address the general problem of how best to attack and destroy a network by node removal, given limited or no prior information about the edges. We consider a family of strategies in which nodes are randomly chosen, but not removed. Instead, a random acquaintance (i.e., a first neighbour) of the chosen node is removed from the network. By assigning an informal cost to the information about the network structure, we show using cost-benefit analysis that acquaintance removal is the optimal strategy to destroy networks efficiently."},"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":"1411.2427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-11-10T13:54:03Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"8fde4e07a4add7501510f66e7af1ff5ca1c72a7ebd022d289dd61c70b63699a8","abstract_canon_sha256":"3cb233eda0f92ac8b7a2f73396f210bf91b24eefc9462231cb7c020d477e4887"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:07.474226Z","signature_b64":"NYn0sz33Vqq40h+MVFMykFvXeHWNCpnhjnnWs3gE3sUBTGOBa3CeZezKK+drE4YysT3AWp9+q1u7167tTrH6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4bd4d7131cb07c320b98a841c6282f38cf1364f4db8126fbb6d3e8ad8f2dd53","last_reissued_at":"2026-05-18T02:38:07.473624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:07.473624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to efficiently destroy a network with limited information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"G. M. Viswanathan, L. R. da Silva, T. M. Vieira","submitted_at":"2014-11-10T13:54:03Z","abstract_excerpt":"We address the general problem of how best to attack and destroy a network by node removal, given limited or no prior information about the edges. We consider a family of strategies in which nodes are randomly chosen, but not removed. Instead, a random acquaintance (i.e., a first neighbour) of the chosen node is removed from the network. By assigning an informal cost to the information about the network structure, we show using cost-benefit analysis that acquaintance removal is the optimal strategy to destroy networks efficiently."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2427","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":"1411.2427","created_at":"2026-05-18T02:38:07.473721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2427v1","created_at":"2026-05-18T02:38:07.473721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2427","created_at":"2026-05-18T02:38:07.473721+00:00"},{"alias_kind":"pith_short_12","alias_value":"4S6U24JRZMD4","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4S6U24JRZMD4GIFZ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4S6U24JR","created_at":"2026-05-18T12:28:14.216126+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/4S6U24JRZMD4GIFZRKCBYYUC6O","json":"https://pith.science/pith/4S6U24JRZMD4GIFZRKCBYYUC6O.json","graph_json":"https://pith.science/api/pith-number/4S6U24JRZMD4GIFZRKCBYYUC6O/graph.json","events_json":"https://pith.science/api/pith-number/4S6U24JRZMD4GIFZRKCBYYUC6O/events.json","paper":"https://pith.science/paper/4S6U24JR"},"agent_actions":{"view_html":"https://pith.science/pith/4S6U24JRZMD4GIFZRKCBYYUC6O","download_json":"https://pith.science/pith/4S6U24JRZMD4GIFZRKCBYYUC6O.json","view_paper":"https://pith.science/paper/4S6U24JR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2427&json=true","fetch_graph":"https://pith.science/api/pith-number/4S6U24JRZMD4GIFZRKCBYYUC6O/graph.json","fetch_events":"https://pith.science/api/pith-number/4S6U24JRZMD4GIFZRKCBYYUC6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4S6U24JRZMD4GIFZRKCBYYUC6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4S6U24JRZMD4GIFZRKCBYYUC6O/action/storage_attestation","attest_author":"https://pith.science/pith/4S6U24JRZMD4GIFZRKCBYYUC6O/action/author_attestation","sign_citation":"https://pith.science/pith/4S6U24JRZMD4GIFZRKCBYYUC6O/action/citation_signature","submit_replication":"https://pith.science/pith/4S6U24JRZMD4GIFZRKCBYYUC6O/action/replication_record"}},"created_at":"2026-05-18T02:38:07.473721+00:00","updated_at":"2026-05-18T02:38:07.473721+00:00"}