{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2VMH6UXAK75UD536CNZXAURPJ7","short_pith_number":"pith:2VMH6UXA","schema_version":"1.0","canonical_sha256":"d5587f52e057fb41f77e137370522f4fe871d0f3e2a19a2fb7b77809fb1a1c1d","source":{"kind":"arxiv","id":"1301.2851","version":1},"attestation_state":"computed","paper":{"title":"Efficient algorithm to study interconnected networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"primary_cat":"physics.comp-ph","authors_text":"Christian M. Schneider, Hans J. Herrmann, Nuno A. M. Ara\\'ujo","submitted_at":"2013-01-14T03:16:53Z","abstract_excerpt":"Interconnected networks have been shown to be much more vulnerable to random and targeted failures than isolated ones, raising several interesting questions regarding the identification and mitigation of their risk. The paradigm to address these questions is the percolation model, where the resilience of the system is quantified by the dependence of the size of the largest cluster on the number of failures. Numerically, the major challenge is the identification of this cluster and the calculation of its size. Here, we propose an efficient algorithm to tackle this problem. We show that the algo"},"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":"1301.2851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2013-01-14T03:16:53Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"title_canon_sha256":"6d203c4102532221d810b6d28bae0c4805704184c0a13e07a97dad528ef99c33","abstract_canon_sha256":"7f0b4cfca0f84ea26688c3f7dd5754c73a5dd71c339eb540c1500a22b6201307"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:26.337800Z","signature_b64":"RS6CgDsf71IXlw8SjPTzXxld9jhPXAzbYNDGqCD9urwBfNTfxZvrg9T5LadbEJK7l0SkTsXfifzcaFI9JA9sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5587f52e057fb41f77e137370522f4fe871d0f3e2a19a2fb7b77809fb1a1c1d","last_reissued_at":"2026-05-18T02:41:26.337397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:26.337397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient algorithm to study interconnected networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"primary_cat":"physics.comp-ph","authors_text":"Christian M. Schneider, Hans J. Herrmann, Nuno A. M. Ara\\'ujo","submitted_at":"2013-01-14T03:16:53Z","abstract_excerpt":"Interconnected networks have been shown to be much more vulnerable to random and targeted failures than isolated ones, raising several interesting questions regarding the identification and mitigation of their risk. The paradigm to address these questions is the percolation model, where the resilience of the system is quantified by the dependence of the size of the largest cluster on the number of failures. Numerically, the major challenge is the identification of this cluster and the calculation of its size. Here, we propose an efficient algorithm to tackle this problem. We show that the algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2851","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":"1301.2851","created_at":"2026-05-18T02:41:26.337454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2851v1","created_at":"2026-05-18T02:41:26.337454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2851","created_at":"2026-05-18T02:41:26.337454+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VMH6UXAK75U","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VMH6UXAK75UD536","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VMH6UXA","created_at":"2026-05-18T12:27:32.513160+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/2VMH6UXAK75UD536CNZXAURPJ7","json":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7.json","graph_json":"https://pith.science/api/pith-number/2VMH6UXAK75UD536CNZXAURPJ7/graph.json","events_json":"https://pith.science/api/pith-number/2VMH6UXAK75UD536CNZXAURPJ7/events.json","paper":"https://pith.science/paper/2VMH6UXA"},"agent_actions":{"view_html":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7","download_json":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7.json","view_paper":"https://pith.science/paper/2VMH6UXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2851&json=true","fetch_graph":"https://pith.science/api/pith-number/2VMH6UXAK75UD536CNZXAURPJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/2VMH6UXAK75UD536CNZXAURPJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7/action/storage_attestation","attest_author":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7/action/author_attestation","sign_citation":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7/action/citation_signature","submit_replication":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7/action/replication_record"}},"created_at":"2026-05-18T02:41:26.337454+00:00","updated_at":"2026-05-18T02:41:26.337454+00:00"}