{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Z2UMNUQIWAHX6C75OH47GR65PZ","short_pith_number":"pith:Z2UMNUQI","canonical_record":{"source":{"id":"1710.03522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-10T11:38:15Z","cross_cats_sorted":["cs.LG","physics.soc-ph"],"title_canon_sha256":"8028655cf416eab805a78d534e29ba6cbe1f67905225d2bc4ea90b61609fe77c","abstract_canon_sha256":"d6fcdb7cf8278b814c3295680479263051dc36b3a13cdc82f7d5d8b38faac2c2"},"schema_version":"1.0"},"canonical_sha256":"cea8c6d208b00f7f0bfd71f9f347dd7e683d80382a434287f57ec984e0ecfcb6","source":{"kind":"arxiv","id":"1710.03522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03522","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03522v1","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03522","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"Z2UMNUQIWAHX","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z2UMNUQIWAHX6C75","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z2UMNUQI","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Z2UMNUQIWAHX6C75OH47GR65PZ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-10T11:38:15Z","cross_cats_sorted":["cs.LG","physics.soc-ph"],"title_canon_sha256":"8028655cf416eab805a78d534e29ba6cbe1f67905225d2bc4ea90b61609fe77c","abstract_canon_sha256":"d6fcdb7cf8278b814c3295680479263051dc36b3a13cdc82f7d5d8b38faac2c2"},"schema_version":"1.0"},"canonical_sha256":"cea8c6d208b00f7f0bfd71f9f347dd7e683d80382a434287f57ec984e0ecfcb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:39.051580Z","signature_b64":"Uw+lEXgna29+lyEDpS43xYopDh1xiFGbKinZbOmUIyA0zdc0pd/6V2W3689twxi4h30ccpw75OfXnDcDoJmXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea8c6d208b00f7f0bfd71f9f347dd7e683d80382a434287f57ec984e0ecfcb6","last_reissued_at":"2026-05-18T00:25:39.050929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:39.050929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03522","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDKirtwg0S2PXzfsSKrYLliabcbgiSdW9rsVGTE+B9bVjjFwg9iWQ8DqzpoWF0G0LmDLtd7hs5Ff3mPvmZoIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:13:47.342985Z"},"content_sha256":"73f7d5e16f0dcd5532b8e1157399844579b090e9997e1d09e6b0ef7ee12f8d4f","schema_version":"1.0","event_id":"sha256:73f7d5e16f0dcd5532b8e1157399844579b090e9997e1d09e6b0ef7ee12f8d4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Z2UMNUQIWAHX6C75OH47GR65PZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Underestimated cost of targeted attacks on complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Dijana Tolic, Niels Gleinig, Nino Antulov-Fantulin, Xiao-Long Ren","submitted_at":"2017-10-10T11:38:15Z","abstract_excerpt":"The robustness of complex networks under targeted attacks is deeply connected to the resilience of complex systems, i.e., the ability to make appropriate responses to the attacks. In this article, we investigated the state-of-the-art targeted node attack algorithms and demonstrate that they become very inefficient when the cost of the attack is taken into consideration. In this paper, we made explicit assumption that the cost of removing a node is proportional to the number of adjacent links that are removed, i.e., higher degree nodes have higher cost. Finally, for the case when it is possible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03522","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPw4a6UIZaHgHaRnThGGWw4uqeHIwbbUov7fWE7+uepid2k/kj5xLdR5L6QmG/wiSMklh7zyW3yBKJJuDAnJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:13:47.343625Z"},"content_sha256":"c2969de0a9b3242b1e802688a607eaff5ce75c85bb43ca54d02b280e53ad3151","schema_version":"1.0","event_id":"sha256:c2969de0a9b3242b1e802688a607eaff5ce75c85bb43ca54d02b280e53ad3151"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2UMNUQIWAHX6C75OH47GR65PZ/bundle.json","state_url":"https://pith.science/pith/Z2UMNUQIWAHX6C75OH47GR65PZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2UMNUQIWAHX6C75OH47GR65PZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T05:13:47Z","links":{"resolver":"https://pith.science/pith/Z2UMNUQIWAHX6C75OH47GR65PZ","bundle":"https://pith.science/pith/Z2UMNUQIWAHX6C75OH47GR65PZ/bundle.json","state":"https://pith.science/pith/Z2UMNUQIWAHX6C75OH47GR65PZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2UMNUQIWAHX6C75OH47GR65PZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z2UMNUQIWAHX6C75OH47GR65PZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d6fcdb7cf8278b814c3295680479263051dc36b3a13cdc82f7d5d8b38faac2c2","cross_cats_sorted":["cs.LG","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-10T11:38:15Z","title_canon_sha256":"8028655cf416eab805a78d534e29ba6cbe1f67905225d2bc4ea90b61609fe77c"},"schema_version":"1.0","source":{"id":"1710.03522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03522","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03522v1","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03522","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"Z2UMNUQIWAHX","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z2UMNUQIWAHX6C75","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z2UMNUQI","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:c2969de0a9b3242b1e802688a607eaff5ce75c85bb43ca54d02b280e53ad3151","target":"graph","created_at":"2026-05-18T00:25:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The robustness of complex networks under targeted attacks is deeply connected to the resilience of complex systems, i.e., the ability to make appropriate responses to the attacks. In this article, we investigated the state-of-the-art targeted node attack algorithms and demonstrate that they become very inefficient when the cost of the attack is taken into consideration. In this paper, we made explicit assumption that the cost of removing a node is proportional to the number of adjacent links that are removed, i.e., higher degree nodes have higher cost. Finally, for the case when it is possible","authors_text":"Dijana Tolic, Niels Gleinig, Nino Antulov-Fantulin, Xiao-Long Ren","cross_cats":["cs.LG","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-10T11:38:15Z","title":"Underestimated cost of targeted attacks on complex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03522","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:73f7d5e16f0dcd5532b8e1157399844579b090e9997e1d09e6b0ef7ee12f8d4f","target":"record","created_at":"2026-05-18T00:25:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d6fcdb7cf8278b814c3295680479263051dc36b3a13cdc82f7d5d8b38faac2c2","cross_cats_sorted":["cs.LG","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-10T11:38:15Z","title_canon_sha256":"8028655cf416eab805a78d534e29ba6cbe1f67905225d2bc4ea90b61609fe77c"},"schema_version":"1.0","source":{"id":"1710.03522","kind":"arxiv","version":1}},"canonical_sha256":"cea8c6d208b00f7f0bfd71f9f347dd7e683d80382a434287f57ec984e0ecfcb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cea8c6d208b00f7f0bfd71f9f347dd7e683d80382a434287f57ec984e0ecfcb6","first_computed_at":"2026-05-18T00:25:39.050929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:39.050929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uw+lEXgna29+lyEDpS43xYopDh1xiFGbKinZbOmUIyA0zdc0pd/6V2W3689twxi4h30ccpw75OfXnDcDoJmXAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:39.051580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73f7d5e16f0dcd5532b8e1157399844579b090e9997e1d09e6b0ef7ee12f8d4f","sha256:c2969de0a9b3242b1e802688a607eaff5ce75c85bb43ca54d02b280e53ad3151"],"state_sha256":"0c78ae773e6b773240a647d76ba771867b8c878ec697413c43f419e889ca7d09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kkvGS2QrSrEeQ+6Q3NstSyTl4EY7u+99bpVjJkCfO+n8FZArnpNkwYp9I8MgRGEiAqCAhEI6W7jhSW4QjwAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:13:47.346675Z","bundle_sha256":"f66073a87c50f2ffc7bbd25b3f3da82f5107975bfe6995b9d31ecff01d5f93f5"}}