{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MINSYVZG4L5I64A55PNXC3YOX7","short_pith_number":"pith:MINSYVZG","schema_version":"1.0","canonical_sha256":"621b2c5726e2fa8f701debdb716f0ebfd4cec97350aca1fb184b463e3dad9148","source":{"kind":"arxiv","id":"2306.08253","version":1},"attestation_state":"computed","paper":{"title":"Measures and Optimization for Robustness and Vulnerability in Disconnected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.SI","authors_text":"Liwang Zhu, Qi Bao, Zhongzhi Zhang","submitted_at":"2023-06-14T05:36:47Z","abstract_excerpt":"The function or performance of a network is strongly dependent on its robustness, quantifying the ability of the network to continue functioning under perturbations. While a wide variety of robustness metrics have been proposed, they have their respective limitations. In this paper, we propose to use the forest index as a measure of network robustness, which overcomes the deficiencies of existing metrics. Using such a measure as an optimization criterion, we propose and study the problem of breaking down a network by attacking some key edges. We show that the objective function of the problem "},"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":"2306.08253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-06-14T05:36:47Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"9b824537785574c3294b774c843d12c0ac303fa68e955ce30f4ce64bb55ca01d","abstract_canon_sha256":"91ce17db9ae8eeb576016353d80b318cb349e6c27b743244576d402f778869c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:50.090606Z","signature_b64":"pXlc2dXmecxLkcQbZSTdjE/Zy+kFfIQ+JVDwbVhCdfOXkYwpYef9bwON/bkg6+nUQMzufbKoHmYqTnIj8hiSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"621b2c5726e2fa8f701debdb716f0ebfd4cec97350aca1fb184b463e3dad9148","last_reissued_at":"2026-07-05T06:20:50.090139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:50.090139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Measures and Optimization for Robustness and Vulnerability in Disconnected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.SI","authors_text":"Liwang Zhu, Qi Bao, Zhongzhi Zhang","submitted_at":"2023-06-14T05:36:47Z","abstract_excerpt":"The function or performance of a network is strongly dependent on its robustness, quantifying the ability of the network to continue functioning under perturbations. While a wide variety of robustness metrics have been proposed, they have their respective limitations. In this paper, we propose to use the forest index as a measure of network robustness, which overcomes the deficiencies of existing metrics. Using such a measure as an optimization criterion, we propose and study the problem of breaking down a network by attacking some key edges. We show that the objective function of the problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08253","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/2306.08253/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":"2306.08253","created_at":"2026-07-05T06:20:50.090195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.08253v1","created_at":"2026-07-05T06:20:50.090195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08253","created_at":"2026-07-05T06:20:50.090195+00:00"},{"alias_kind":"pith_short_12","alias_value":"MINSYVZG4L5I","created_at":"2026-07-05T06:20:50.090195+00:00"},{"alias_kind":"pith_short_16","alias_value":"MINSYVZG4L5I64A5","created_at":"2026-07-05T06:20:50.090195+00:00"},{"alias_kind":"pith_short_8","alias_value":"MINSYVZG","created_at":"2026-07-05T06:20:50.090195+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/MINSYVZG4L5I64A55PNXC3YOX7","json":"https://pith.science/pith/MINSYVZG4L5I64A55PNXC3YOX7.json","graph_json":"https://pith.science/api/pith-number/MINSYVZG4L5I64A55PNXC3YOX7/graph.json","events_json":"https://pith.science/api/pith-number/MINSYVZG4L5I64A55PNXC3YOX7/events.json","paper":"https://pith.science/paper/MINSYVZG"},"agent_actions":{"view_html":"https://pith.science/pith/MINSYVZG4L5I64A55PNXC3YOX7","download_json":"https://pith.science/pith/MINSYVZG4L5I64A55PNXC3YOX7.json","view_paper":"https://pith.science/paper/MINSYVZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.08253&json=true","fetch_graph":"https://pith.science/api/pith-number/MINSYVZG4L5I64A55PNXC3YOX7/graph.json","fetch_events":"https://pith.science/api/pith-number/MINSYVZG4L5I64A55PNXC3YOX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MINSYVZG4L5I64A55PNXC3YOX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MINSYVZG4L5I64A55PNXC3YOX7/action/storage_attestation","attest_author":"https://pith.science/pith/MINSYVZG4L5I64A55PNXC3YOX7/action/author_attestation","sign_citation":"https://pith.science/pith/MINSYVZG4L5I64A55PNXC3YOX7/action/citation_signature","submit_replication":"https://pith.science/pith/MINSYVZG4L5I64A55PNXC3YOX7/action/replication_record"}},"created_at":"2026-07-05T06:20:50.090195+00:00","updated_at":"2026-07-05T06:20:50.090195+00:00"}