{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6TB2XGEWTRJLKMW6NJC2MWSQ6K","short_pith_number":"pith:6TB2XGEW","schema_version":"1.0","canonical_sha256":"f4c3ab98969c52b532de6a45a65a50f2aba5c6ea33907d66a5103ac1fb6714fe","source":{"kind":"arxiv","id":"1802.03992","version":2},"attestation_state":"computed","paper":{"title":"Targeted Damage to Interdependent Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"G. J. Baxter, G. Tim\\'ar, J. F. F. Mendes","submitted_at":"2018-02-12T11:49:29Z","abstract_excerpt":"The giant mutually connected component (GMCC) of an interdependent or multiplex network collapses with a discontinuous hybrid transition under random damage to the network. If the nodes to be damaged are selected in a targeted way, the collapse of the GMCC may occur significantly sooner. Finding the minimal damage set which destroys the largest mutually connected component of a given interdependent network is a computationally prohibitive simultaneous optimization problem. We introduce a simple heuristic strategy -- Effective Multiplex Degree -- for targeted attack on interdependent networks t"},"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":"1802.03992","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-02-12T11:49:29Z","cross_cats_sorted":["cond-mat.dis-nn","cs.SI"],"title_canon_sha256":"660af8ae047bf0012b5177baff4afdbda1fe6b61866c17d86e6b22c1311580ac","abstract_canon_sha256":"c851ae611ce2508c6093fd962a0ef5476cb7b727eef7d503efc0165021a22ee2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:05.260102Z","signature_b64":"pNW/NJMB6TITKPCGyuCaXmDnjakMuXskAi2KXVWId6VwhgQ/jZKGJY/ByE9D3jqlkCtEToHRsAixzoqGq/WjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4c3ab98969c52b532de6a45a65a50f2aba5c6ea33907d66a5103ac1fb6714fe","last_reissued_at":"2026-05-18T00:05:05.259471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:05.259471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Targeted Damage to Interdependent Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"G. J. Baxter, G. Tim\\'ar, J. F. F. Mendes","submitted_at":"2018-02-12T11:49:29Z","abstract_excerpt":"The giant mutually connected component (GMCC) of an interdependent or multiplex network collapses with a discontinuous hybrid transition under random damage to the network. If the nodes to be damaged are selected in a targeted way, the collapse of the GMCC may occur significantly sooner. Finding the minimal damage set which destroys the largest mutually connected component of a given interdependent network is a computationally prohibitive simultaneous optimization problem. We introduce a simple heuristic strategy -- Effective Multiplex Degree -- for targeted attack on interdependent networks t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03992","kind":"arxiv","version":2},"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":"1802.03992","created_at":"2026-05-18T00:05:05.259570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03992v2","created_at":"2026-05-18T00:05:05.259570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03992","created_at":"2026-05-18T00:05:05.259570+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TB2XGEWTRJL","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TB2XGEWTRJLKMW6","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TB2XGEW","created_at":"2026-05-18T12:32:11.075285+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/6TB2XGEWTRJLKMW6NJC2MWSQ6K","json":"https://pith.science/pith/6TB2XGEWTRJLKMW6NJC2MWSQ6K.json","graph_json":"https://pith.science/api/pith-number/6TB2XGEWTRJLKMW6NJC2MWSQ6K/graph.json","events_json":"https://pith.science/api/pith-number/6TB2XGEWTRJLKMW6NJC2MWSQ6K/events.json","paper":"https://pith.science/paper/6TB2XGEW"},"agent_actions":{"view_html":"https://pith.science/pith/6TB2XGEWTRJLKMW6NJC2MWSQ6K","download_json":"https://pith.science/pith/6TB2XGEWTRJLKMW6NJC2MWSQ6K.json","view_paper":"https://pith.science/paper/6TB2XGEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03992&json=true","fetch_graph":"https://pith.science/api/pith-number/6TB2XGEWTRJLKMW6NJC2MWSQ6K/graph.json","fetch_events":"https://pith.science/api/pith-number/6TB2XGEWTRJLKMW6NJC2MWSQ6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TB2XGEWTRJLKMW6NJC2MWSQ6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TB2XGEWTRJLKMW6NJC2MWSQ6K/action/storage_attestation","attest_author":"https://pith.science/pith/6TB2XGEWTRJLKMW6NJC2MWSQ6K/action/author_attestation","sign_citation":"https://pith.science/pith/6TB2XGEWTRJLKMW6NJC2MWSQ6K/action/citation_signature","submit_replication":"https://pith.science/pith/6TB2XGEWTRJLKMW6NJC2MWSQ6K/action/replication_record"}},"created_at":"2026-05-18T00:05:05.259570+00:00","updated_at":"2026-05-18T00:05:05.259570+00:00"}