{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3BVD2BJOKNPEAJZZFMNHWK2ECW","short_pith_number":"pith:3BVD2BJO","schema_version":"1.0","canonical_sha256":"d86a3d052e535e4027392b1a7b2b4415a1f6c480d6880df3801e7df03358390b","source":{"kind":"arxiv","id":"1409.1147","version":2},"attestation_state":"computed","paper":{"title":"Efficient algorithm to compute mutually connected components in interdependent networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"B. Kahng, Deokjae Lee, S. Choi, S. Hwang","submitted_at":"2014-09-03T16:28:26Z","abstract_excerpt":"Mutually connected components (MCCs) play an important role as a measure of resilience in the study of interdependent networks. Despite their importance, an efficient algorithm to obtain the statistics of all MCCs during the removal of links has thus far been absent. Here, using a well-known fully dynamic graph algorithm, we propose an efficient algorithm to accomplish this task. We show that the time complexity of this algorithm is approximately $O({N^{1.2} })$ for random graphs, which is more efficient than $O(N^{2})$ of the brute-force algorithm. We confirm the correctness of our algorithm "},"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":"1409.1147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-09-03T16:28:26Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"b0d95d336f5d06120ff868ed6d0737e097d28c1e512d246bc17cf30725e3f693","abstract_canon_sha256":"74f06c14ecce9fe346a9f0a6385dc2f5492469a9fb2145f1e7e02aee4b01570b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:31.613581Z","signature_b64":"fq17bTcM/5DOv3hOt2jDHua5PcQ4z72TD1az5tkuQZdK9mZ/+herBTUqqFCa2eQrHXqeXeUGJqYGP+jVmFR/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d86a3d052e535e4027392b1a7b2b4415a1f6c480d6880df3801e7df03358390b","last_reissued_at":"2026-05-18T02:26:31.613174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:31.613174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient algorithm to compute mutually connected components in interdependent networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"B. Kahng, Deokjae Lee, S. Choi, S. Hwang","submitted_at":"2014-09-03T16:28:26Z","abstract_excerpt":"Mutually connected components (MCCs) play an important role as a measure of resilience in the study of interdependent networks. Despite their importance, an efficient algorithm to obtain the statistics of all MCCs during the removal of links has thus far been absent. Here, using a well-known fully dynamic graph algorithm, we propose an efficient algorithm to accomplish this task. We show that the time complexity of this algorithm is approximately $O({N^{1.2} })$ for random graphs, which is more efficient than $O(N^{2})$ of the brute-force algorithm. We confirm the correctness of our algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1147","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":"1409.1147","created_at":"2026-05-18T02:26:31.613241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.1147v2","created_at":"2026-05-18T02:26:31.613241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1147","created_at":"2026-05-18T02:26:31.613241+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BVD2BJOKNPE","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BVD2BJOKNPEAJZZ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BVD2BJO","created_at":"2026-05-18T12:28:11.866339+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/3BVD2BJOKNPEAJZZFMNHWK2ECW","json":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW.json","graph_json":"https://pith.science/api/pith-number/3BVD2BJOKNPEAJZZFMNHWK2ECW/graph.json","events_json":"https://pith.science/api/pith-number/3BVD2BJOKNPEAJZZFMNHWK2ECW/events.json","paper":"https://pith.science/paper/3BVD2BJO"},"agent_actions":{"view_html":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW","download_json":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW.json","view_paper":"https://pith.science/paper/3BVD2BJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.1147&json=true","fetch_graph":"https://pith.science/api/pith-number/3BVD2BJOKNPEAJZZFMNHWK2ECW/graph.json","fetch_events":"https://pith.science/api/pith-number/3BVD2BJOKNPEAJZZFMNHWK2ECW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/action/storage_attestation","attest_author":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/action/author_attestation","sign_citation":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/action/citation_signature","submit_replication":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/action/replication_record"}},"created_at":"2026-05-18T02:26:31.613241+00:00","updated_at":"2026-05-18T02:26:31.613241+00:00"}