{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QM5OA6UY3QCA25WCEA74VBYHIQ","short_pith_number":"pith:QM5OA6UY","schema_version":"1.0","canonical_sha256":"833ae07a98dc040d76c2203fca8707440922e494352049e92d18dadc0817ec13","source":{"kind":"arxiv","id":"1801.01357","version":2},"attestation_state":"computed","paper":{"title":"Generalized Network Dismantling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.soc-ph","stat.CO"],"primary_cat":"cs.SI","authors_text":"Dirk Helbing, Niels Gleinig, Nino Antulov-Fantulin, Xiao-Long Ren","submitted_at":"2018-01-04T14:13:32Z","abstract_excerpt":"Finding the set of nodes, which removed or (de)activated can stop the spread of (dis)information, contain an epidemic or disrupt the functioning of a corrupt/criminal organization is still one of the key challenges in network science. In this paper, we introduce the generalized network dismantling problem, which aims to find the set of nodes that, when removed from a network, results in a network fragmentation into subcritical network components at minimum cost. For unit costs, our formulation becomes equivalent to the standard network dismantling problem. Our non-unit cost generalization allo"},"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":"1801.01357","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-04T14:13:32Z","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph","stat.CO"],"title_canon_sha256":"00bd32846bc06f85485b711b9addc0a7f4cf513cff9dcc7953ea79c99e7ff69d","abstract_canon_sha256":"1d4df92a0dab112f28b9da08669f81ec4239b65eb310d03295b797896d48d1a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:34.281092Z","signature_b64":"bVWvqFzq2QE04MuOFE+VPqQaOItdTIVNpLXQc3/W9zTo67/gq2oaVGTLaYlbJnum2Z+5M3k0qU+FDi8v4gSADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"833ae07a98dc040d76c2203fca8707440922e494352049e92d18dadc0817ec13","last_reissued_at":"2026-05-17T23:50:34.280427Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:34.280427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Network Dismantling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.soc-ph","stat.CO"],"primary_cat":"cs.SI","authors_text":"Dirk Helbing, Niels Gleinig, Nino Antulov-Fantulin, Xiao-Long Ren","submitted_at":"2018-01-04T14:13:32Z","abstract_excerpt":"Finding the set of nodes, which removed or (de)activated can stop the spread of (dis)information, contain an epidemic or disrupt the functioning of a corrupt/criminal organization is still one of the key challenges in network science. In this paper, we introduce the generalized network dismantling problem, which aims to find the set of nodes that, when removed from a network, results in a network fragmentation into subcritical network components at minimum cost. For unit costs, our formulation becomes equivalent to the standard network dismantling problem. Our non-unit cost generalization allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01357","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":"1801.01357","created_at":"2026-05-17T23:50:34.280551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01357v2","created_at":"2026-05-17T23:50:34.280551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01357","created_at":"2026-05-17T23:50:34.280551+00:00"},{"alias_kind":"pith_short_12","alias_value":"QM5OA6UY3QCA","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QM5OA6UY3QCA25WC","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QM5OA6UY","created_at":"2026-05-18T12:32:46.962924+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/QM5OA6UY3QCA25WCEA74VBYHIQ","json":"https://pith.science/pith/QM5OA6UY3QCA25WCEA74VBYHIQ.json","graph_json":"https://pith.science/api/pith-number/QM5OA6UY3QCA25WCEA74VBYHIQ/graph.json","events_json":"https://pith.science/api/pith-number/QM5OA6UY3QCA25WCEA74VBYHIQ/events.json","paper":"https://pith.science/paper/QM5OA6UY"},"agent_actions":{"view_html":"https://pith.science/pith/QM5OA6UY3QCA25WCEA74VBYHIQ","download_json":"https://pith.science/pith/QM5OA6UY3QCA25WCEA74VBYHIQ.json","view_paper":"https://pith.science/paper/QM5OA6UY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01357&json=true","fetch_graph":"https://pith.science/api/pith-number/QM5OA6UY3QCA25WCEA74VBYHIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/QM5OA6UY3QCA25WCEA74VBYHIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QM5OA6UY3QCA25WCEA74VBYHIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QM5OA6UY3QCA25WCEA74VBYHIQ/action/storage_attestation","attest_author":"https://pith.science/pith/QM5OA6UY3QCA25WCEA74VBYHIQ/action/author_attestation","sign_citation":"https://pith.science/pith/QM5OA6UY3QCA25WCEA74VBYHIQ/action/citation_signature","submit_replication":"https://pith.science/pith/QM5OA6UY3QCA25WCEA74VBYHIQ/action/replication_record"}},"created_at":"2026-05-17T23:50:34.280551+00:00","updated_at":"2026-05-17T23:50:34.280551+00:00"}