{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:73FANSOGVLPNC534DD3RSMPQ3M","short_pith_number":"pith:73FANSOG","schema_version":"1.0","canonical_sha256":"feca06c9c6aaded1777c18f71931f0db2a42ae47d230fa249f8fb0e4108fb8ef","source":{"kind":"arxiv","id":"1804.10267","version":1},"attestation_state":"computed","paper":{"title":"Dismantling Efficiency and Network Fractality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"B. Kahng, Yoon Seok Im","submitted_at":"2018-04-26T20:01:48Z","abstract_excerpt":"Network dismantling is to identify a minimal set of nodes whose removal breaks the network into small components of subextensive size. Because finding the optimal set of nodes is an NP-hard problem, several heuristic algorithms have been developed as alternative methods, for instance, the so-called belief propagation-based decimation (BPD) algorithm and the collective influence (CI) algorithm. Here, we test the performance of each of these algorithms and analyze them in the perspective of the fractality of the network. Networks are classified into two types: fractal and non-fractal networks. R"},"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":"1804.10267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-04-26T20:01:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"19598b0e4224ffda4b75b05aaa9bab4893050cab22c365b5bb9b3aaa4021aaf7","abstract_canon_sha256":"a01f4ab4afaf4f5bde13ad3433b91f004ce404c18dda5908d4160cc5976f77c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:14.339191Z","signature_b64":"uWQZ9mGD+atIVySpfyKANNfaby1FDPFJmWod27P1/9pxVx4jbbO5XY5ijT2wXxkPNVO99YgpPkGqLTvF2JEuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feca06c9c6aaded1777c18f71931f0db2a42ae47d230fa249f8fb0e4108fb8ef","last_reissued_at":"2026-05-18T00:09:14.338498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:14.338498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dismantling Efficiency and Network Fractality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"B. Kahng, Yoon Seok Im","submitted_at":"2018-04-26T20:01:48Z","abstract_excerpt":"Network dismantling is to identify a minimal set of nodes whose removal breaks the network into small components of subextensive size. Because finding the optimal set of nodes is an NP-hard problem, several heuristic algorithms have been developed as alternative methods, for instance, the so-called belief propagation-based decimation (BPD) algorithm and the collective influence (CI) algorithm. Here, we test the performance of each of these algorithms and analyze them in the perspective of the fractality of the network. Networks are classified into two types: fractal and non-fractal networks. R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10267","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":"1804.10267","created_at":"2026-05-18T00:09:14.338616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10267v1","created_at":"2026-05-18T00:09:14.338616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10267","created_at":"2026-05-18T00:09:14.338616+00:00"},{"alias_kind":"pith_short_12","alias_value":"73FANSOGVLPN","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"73FANSOGVLPNC534","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"73FANSOG","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/73FANSOGVLPNC534DD3RSMPQ3M","json":"https://pith.science/pith/73FANSOGVLPNC534DD3RSMPQ3M.json","graph_json":"https://pith.science/api/pith-number/73FANSOGVLPNC534DD3RSMPQ3M/graph.json","events_json":"https://pith.science/api/pith-number/73FANSOGVLPNC534DD3RSMPQ3M/events.json","paper":"https://pith.science/paper/73FANSOG"},"agent_actions":{"view_html":"https://pith.science/pith/73FANSOGVLPNC534DD3RSMPQ3M","download_json":"https://pith.science/pith/73FANSOGVLPNC534DD3RSMPQ3M.json","view_paper":"https://pith.science/paper/73FANSOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10267&json=true","fetch_graph":"https://pith.science/api/pith-number/73FANSOGVLPNC534DD3RSMPQ3M/graph.json","fetch_events":"https://pith.science/api/pith-number/73FANSOGVLPNC534DD3RSMPQ3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73FANSOGVLPNC534DD3RSMPQ3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73FANSOGVLPNC534DD3RSMPQ3M/action/storage_attestation","attest_author":"https://pith.science/pith/73FANSOGVLPNC534DD3RSMPQ3M/action/author_attestation","sign_citation":"https://pith.science/pith/73FANSOGVLPNC534DD3RSMPQ3M/action/citation_signature","submit_replication":"https://pith.science/pith/73FANSOGVLPNC534DD3RSMPQ3M/action/replication_record"}},"created_at":"2026-05-18T00:09:14.338616+00:00","updated_at":"2026-05-18T00:09:14.338616+00:00"}