{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3BVD2BJOKNPEAJZZFMNHWK2ECW","short_pith_number":"pith:3BVD2BJO","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"},"canonical_sha256":"d86a3d052e535e4027392b1a7b2b4415a1f6c480d6880df3801e7df03358390b","source":{"kind":"arxiv","id":"1409.1147","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1147","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1147v2","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1147","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"3BVD2BJOKNPE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3BVD2BJOKNPEAJZZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3BVD2BJO","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3BVD2BJOKNPEAJZZFMNHWK2ECW","target":"record","payload":{"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"},"canonical_sha256":"d86a3d052e535e4027392b1a7b2b4415a1f6c480d6880df3801e7df03358390b","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"},"source_kind":"arxiv","source_id":"1409.1147","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50fhMlFyt3uAn3D0kgB2m3JekNotYMSTnkSBAC4V+cRskOH0ueZ/+kGd/qtlWMFOsnOPuRwwkrbeqSydhTtDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:32:05.868913Z"},"content_sha256":"e21af1dd1929d6dfd1a5fb94c27094934d00beec7e8da32c45c6c6bbee48086a","schema_version":"1.0","event_id":"sha256:e21af1dd1929d6dfd1a5fb94c27094934d00beec7e8da32c45c6c6bbee48086a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3BVD2BJOKNPEAJZZFMNHWK2ECW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBaItFVpdHxg/bDl0Ec4As+jecG/vMeCXwpz6AuQcFJixgSDvA2m7V3BtxMCOLA+gaXwraVifXwOXPknqm8AAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:32:05.869262Z"},"content_sha256":"1bafd08541fd6fdb03942f0cae13af2bd9a272db65bd591adbab28e80d7123ba","schema_version":"1.0","event_id":"sha256:1bafd08541fd6fdb03942f0cae13af2bd9a272db65bd591adbab28e80d7123ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/bundle.json","state_url":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T06:32:05Z","links":{"resolver":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW","bundle":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/bundle.json","state":"https://pith.science/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BVD2BJOKNPEAJZZFMNHWK2ECW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3BVD2BJOKNPEAJZZFMNHWK2ECW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"74f06c14ecce9fe346a9f0a6385dc2f5492469a9fb2145f1e7e02aee4b01570b","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-09-03T16:28:26Z","title_canon_sha256":"b0d95d336f5d06120ff868ed6d0737e097d28c1e512d246bc17cf30725e3f693"},"schema_version":"1.0","source":{"id":"1409.1147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1147","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1147v2","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1147","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"3BVD2BJOKNPE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3BVD2BJOKNPEAJZZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3BVD2BJO","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:1bafd08541fd6fdb03942f0cae13af2bd9a272db65bd591adbab28e80d7123ba","target":"graph","created_at":"2026-05-18T02:26:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"B. Kahng, Deokjae Lee, S. Choi, S. Hwang","cross_cats":["cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-09-03T16:28:26Z","title":"Efficient algorithm to compute mutually connected components in interdependent networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1147","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e21af1dd1929d6dfd1a5fb94c27094934d00beec7e8da32c45c6c6bbee48086a","target":"record","created_at":"2026-05-18T02:26:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"74f06c14ecce9fe346a9f0a6385dc2f5492469a9fb2145f1e7e02aee4b01570b","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-09-03T16:28:26Z","title_canon_sha256":"b0d95d336f5d06120ff868ed6d0737e097d28c1e512d246bc17cf30725e3f693"},"schema_version":"1.0","source":{"id":"1409.1147","kind":"arxiv","version":2}},"canonical_sha256":"d86a3d052e535e4027392b1a7b2b4415a1f6c480d6880df3801e7df03358390b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d86a3d052e535e4027392b1a7b2b4415a1f6c480d6880df3801e7df03358390b","first_computed_at":"2026-05-18T02:26:31.613174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:31.613174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fq17bTcM/5DOv3hOt2jDHua5PcQ4z72TD1az5tkuQZdK9mZ/+herBTUqqFCa2eQrHXqeXeUGJqYGP+jVmFR/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:31.613581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e21af1dd1929d6dfd1a5fb94c27094934d00beec7e8da32c45c6c6bbee48086a","sha256:1bafd08541fd6fdb03942f0cae13af2bd9a272db65bd591adbab28e80d7123ba"],"state_sha256":"c856229a760d325a1c228c81a0ca978bb288d09771685de597c6c8e495630b82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPvENl7JAyShP+BduLkDidAn5mej2WVx1egu6JF785RNUNI/c0GuZrCKzAbi4yXGKA4UUh7rn6DPwUJGCGVaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:32:05.871183Z","bundle_sha256":"fb4fe06fb87e01592971965265e9832533e82db6bd186a9d9ed608106d279dca"}}