{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PPJGZN2KG2J7WUILJ32SM2U24I","short_pith_number":"pith:PPJGZN2K","schema_version":"1.0","canonical_sha256":"7bd26cb74a3693fb510b4ef5266a9ae21cfde443f7e574c4e50013d72d4d70b4","source":{"kind":"arxiv","id":"1502.00353","version":1},"attestation_state":"computed","paper":{"title":"Complex networks vulnerability to module-based attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Bruno Requi\\~ao da Cunha, Juan Carlos Gonz\\'alez-Avella, Sebasti\\'an Gon\\c{c}alves","submitted_at":"2015-02-02T04:25:06Z","abstract_excerpt":"In the multidisciplinary field of Network Science, optimization of procedures for efficiently breaking complex networks is attracting much attention from practical points of view. In this contribution we present a module-based method to efficiently break complex networks. The procedure first identifies the communities in which the network can be represented, then it deletes the nodes (edges) that connect different modules by its order in the betweenness centrality ranking list. We illustrate the method by applying it to various well known examples of social, infrastructure, and biological netw"},"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":"1502.00353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-02-02T04:25:06Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI"],"title_canon_sha256":"e6eb55cfdb34b52e1452ee86559c049a703ee360ba17dc9bdf5674c7bcdf0377","abstract_canon_sha256":"9c5ed9c97fc3a128f24180fd812927457d4ce818e64905fabe9ab604513c5f88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:08:15.276563Z","signature_b64":"Dl9ybvQcyfU4h5Yev4TsvMQk4jQaTEpEsHZ5Y4+9E/bEigzM0P70/0ZAevIFDSfG0NCaQgEpKmOJV9nq8p2rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bd26cb74a3693fb510b4ef5266a9ae21cfde443f7e574c4e50013d72d4d70b4","last_reissued_at":"2026-07-05T00:08:15.276126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:08:15.276126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complex networks vulnerability to module-based attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Bruno Requi\\~ao da Cunha, Juan Carlos Gonz\\'alez-Avella, Sebasti\\'an Gon\\c{c}alves","submitted_at":"2015-02-02T04:25:06Z","abstract_excerpt":"In the multidisciplinary field of Network Science, optimization of procedures for efficiently breaking complex networks is attracting much attention from practical points of view. In this contribution we present a module-based method to efficiently break complex networks. The procedure first identifies the communities in which the network can be represented, then it deletes the nodes (edges) that connect different modules by its order in the betweenness centrality ranking list. We illustrate the method by applying it to various well known examples of social, infrastructure, and biological netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00353","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/1502.00353/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":"1502.00353","created_at":"2026-07-05T00:08:15.276196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00353v1","created_at":"2026-07-05T00:08:15.276196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00353","created_at":"2026-07-05T00:08:15.276196+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPJGZN2KG2J7","created_at":"2026-07-05T00:08:15.276196+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPJGZN2KG2J7WUIL","created_at":"2026-07-05T00:08:15.276196+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPJGZN2K","created_at":"2026-07-05T00:08:15.276196+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/PPJGZN2KG2J7WUILJ32SM2U24I","json":"https://pith.science/pith/PPJGZN2KG2J7WUILJ32SM2U24I.json","graph_json":"https://pith.science/api/pith-number/PPJGZN2KG2J7WUILJ32SM2U24I/graph.json","events_json":"https://pith.science/api/pith-number/PPJGZN2KG2J7WUILJ32SM2U24I/events.json","paper":"https://pith.science/paper/PPJGZN2K"},"agent_actions":{"view_html":"https://pith.science/pith/PPJGZN2KG2J7WUILJ32SM2U24I","download_json":"https://pith.science/pith/PPJGZN2KG2J7WUILJ32SM2U24I.json","view_paper":"https://pith.science/paper/PPJGZN2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00353&json=true","fetch_graph":"https://pith.science/api/pith-number/PPJGZN2KG2J7WUILJ32SM2U24I/graph.json","fetch_events":"https://pith.science/api/pith-number/PPJGZN2KG2J7WUILJ32SM2U24I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPJGZN2KG2J7WUILJ32SM2U24I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPJGZN2KG2J7WUILJ32SM2U24I/action/storage_attestation","attest_author":"https://pith.science/pith/PPJGZN2KG2J7WUILJ32SM2U24I/action/author_attestation","sign_citation":"https://pith.science/pith/PPJGZN2KG2J7WUILJ32SM2U24I/action/citation_signature","submit_replication":"https://pith.science/pith/PPJGZN2KG2J7WUILJ32SM2U24I/action/replication_record"}},"created_at":"2026-07-05T00:08:15.276196+00:00","updated_at":"2026-07-05T00:08:15.276196+00:00"}