{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2VMH6UXAK75UD536CNZXAURPJ7","short_pith_number":"pith:2VMH6UXA","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"},"canonical_sha256":"d5587f52e057fb41f77e137370522f4fe871d0f3e2a19a2fb7b77809fb1a1c1d","source":{"kind":"arxiv","id":"1301.2851","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2851","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2851v1","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2851","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"2VMH6UXAK75U","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2VMH6UXAK75UD536","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2VMH6UXA","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2VMH6UXAK75UD536CNZXAURPJ7","target":"record","payload":{"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"},"canonical_sha256":"d5587f52e057fb41f77e137370522f4fe871d0f3e2a19a2fb7b77809fb1a1c1d","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"},"source_kind":"arxiv","source_id":"1301.2851","source_version":1,"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:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzPKGEaVRsbpFBa4JWeukWmnk+EckN2aaNIzlRQhGS386l79Mn5vAjwYv7rA2nTfCS067BR+VXdi94qWhMi2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:49:15.260231Z"},"content_sha256":"275f6478d52d5f29c0df7aa7e8cd6690df32a4924834894d6974b5c5d2bcf82c","schema_version":"1.0","event_id":"sha256:275f6478d52d5f29c0df7aa7e8cd6690df32a4924834894d6974b5c5d2bcf82c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2VMH6UXAK75UD536CNZXAURPJ7","target":"graph","payload":{"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"},"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:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yW84XjzxvGtPmJTrJsr0niLs1VWomHPhodakU2QTpO1qfZ++TPxYs+qV6nOvycXN7mLrspG7wD9gvn+pQWJYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:49:15.260717Z"},"content_sha256":"3efa655613b0547c11b55fb9143f23615d51fec256701e8297d965c0ba39d69f","schema_version":"1.0","event_id":"sha256:3efa655613b0547c11b55fb9143f23615d51fec256701e8297d965c0ba39d69f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7/bundle.json","state_url":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VMH6UXAK75UD536CNZXAURPJ7/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-27T19:49:15Z","links":{"resolver":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7","bundle":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7/bundle.json","state":"https://pith.science/pith/2VMH6UXAK75UD536CNZXAURPJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VMH6UXAK75UD536CNZXAURPJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2VMH6UXAK75UD536CNZXAURPJ7","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":"7f0b4cfca0f84ea26688c3f7dd5754c73a5dd71c339eb540c1500a22b6201307","cross_cats_sorted":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2013-01-14T03:16:53Z","title_canon_sha256":"6d203c4102532221d810b6d28bae0c4805704184c0a13e07a97dad528ef99c33"},"schema_version":"1.0","source":{"id":"1301.2851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2851","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2851v1","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2851","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"2VMH6UXAK75U","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2VMH6UXAK75UD536","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2VMH6UXA","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:3efa655613b0547c11b55fb9143f23615d51fec256701e8297d965c0ba39d69f","target":"graph","created_at":"2026-05-18T02:41:26Z","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":"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","authors_text":"Christian M. Schneider, Hans J. Herrmann, Nuno A. M. Ara\\'ujo","cross_cats":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2013-01-14T03:16:53Z","title":"Efficient algorithm to study interconnected networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2851","kind":"arxiv","version":1},"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:275f6478d52d5f29c0df7aa7e8cd6690df32a4924834894d6974b5c5d2bcf82c","target":"record","created_at":"2026-05-18T02:41:26Z","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":"7f0b4cfca0f84ea26688c3f7dd5754c73a5dd71c339eb540c1500a22b6201307","cross_cats_sorted":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2013-01-14T03:16:53Z","title_canon_sha256":"6d203c4102532221d810b6d28bae0c4805704184c0a13e07a97dad528ef99c33"},"schema_version":"1.0","source":{"id":"1301.2851","kind":"arxiv","version":1}},"canonical_sha256":"d5587f52e057fb41f77e137370522f4fe871d0f3e2a19a2fb7b77809fb1a1c1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5587f52e057fb41f77e137370522f4fe871d0f3e2a19a2fb7b77809fb1a1c1d","first_computed_at":"2026-05-18T02:41:26.337397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:26.337397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RS6CgDsf71IXlw8SjPTzXxld9jhPXAzbYNDGqCD9urwBfNTfxZvrg9T5LadbEJK7l0SkTsXfifzcaFI9JA9sCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:26.337800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:275f6478d52d5f29c0df7aa7e8cd6690df32a4924834894d6974b5c5d2bcf82c","sha256:3efa655613b0547c11b55fb9143f23615d51fec256701e8297d965c0ba39d69f"],"state_sha256":"4965ceb8e60b45bb3b2917176379040750f4d6344833044555de99e1ea565241"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xeTlB0zFGznKr6Rmp8edq46YcYrZxJFR+8xKBoSCBi5jp0lDUdWpfrD920Jhzy+m29MiRHOVop6bbc/Jjw6eCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:49:15.263823Z","bundle_sha256":"285e69793a0c3eb51cf86eb0f6e46c9de126bb2f24ddb925648fe8510de7b042"}}