{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:335EMAXHGXMC5DAX3CGVFH5F2V","short_pith_number":"pith:335EMAXH","canonical_record":{"source":{"id":"1009.3183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-09-16T14:31:42Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"c41e77a443108a3e64da88e49b61181dc883adefc7957070d9ea8bf46626a91b","abstract_canon_sha256":"64084c9497d9eaf2d7fbf0bbc2d56ac2dc89f031e4f9f382e601d791eef42daa"},"schema_version":"1.0"},"canonical_sha256":"defa4602e735d82e8c17d88d529fa5d548b8df7852be1cc226c1a6c7552e4f9f","source":{"kind":"arxiv","id":"1009.3183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3183","created_at":"2026-05-18T02:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3183v1","created_at":"2026-05-18T02:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3183","created_at":"2026-05-18T02:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"335EMAXHGXMC","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"335EMAXHGXMC5DAX","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"335EMAXH","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:335EMAXHGXMC5DAX3CGVFH5F2V","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-09-16T14:31:42Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"c41e77a443108a3e64da88e49b61181dc883adefc7957070d9ea8bf46626a91b","abstract_canon_sha256":"64084c9497d9eaf2d7fbf0bbc2d56ac2dc89f031e4f9f382e601d791eef42daa"},"schema_version":"1.0"},"canonical_sha256":"defa4602e735d82e8c17d88d529fa5d548b8df7852be1cc226c1a6c7552e4f9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:27.476131Z","signature_b64":"98CJZ51eUJT4RW8ix1JqQgtSn7Zp1X3X2vY6KaEBg4M8XdYIWqbRM8/enVSHCZNTN3Io3wn4p11l7koPL3cvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"defa4602e735d82e8c17d88d529fa5d548b8df7852be1cc226c1a6c7552e4f9f","last_reissued_at":"2026-05-18T02:05:27.475387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:27.475387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3183","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:05:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QIgaV5gqQIgCskE+Ux1MGhXs2pzZBmoXi2+7wsFIA8wnO8ePbLlHLr2cqK93Fkk9zt7agoY8HyYYGmui38TBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:35:06.298210Z"},"content_sha256":"0f93f6857ea2251b9cd02a8d45775dc0d1a75c91cb013b949ea324b66f09c6de","schema_version":"1.0","event_id":"sha256:0f93f6857ea2251b9cd02a8d45775dc0d1a75c91cb013b949ea324b66f09c6de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:335EMAXHGXMC5DAX3CGVFH5F2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interdependent networks with correlated degrees of mutually dependent nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Gabriel A. Cwilich, Nathaniel Shere, Sergey V. Buldyrev","submitted_at":"2010-09-16T14:31:42Z","abstract_excerpt":"We study a problem of failure of two interdependent networks in the case of correlated degrees of mutually dependent nodes. We assume that both networks (A and B) have the same number of nodes $N$ connected by the bidirectional dependency links establishing a one-to-one correspondence between the nodes of the two networks in a such a way that the mutually dependent nodes have the same number of connectivity links, i.e. their degrees coincide. This implies that both networks have the same degree distribution $P(k)$. We call such networks correspondently coupled networks (CCN). We assume that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3183","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:05:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQJVkSGeQyt6Mkg4Vb6dQbdjl/r3tRqpc8pQiUGKihG/SCz2/ebMqwO6Q42Qg5pleMzGCaq1dFQBmeXG7kGgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:35:06.298565Z"},"content_sha256":"49534cd6ccbf2e8c109739d1665e05e75e7030a91a7d4a9f07f9db32d6ed8698","schema_version":"1.0","event_id":"sha256:49534cd6ccbf2e8c109739d1665e05e75e7030a91a7d4a9f07f9db32d6ed8698"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/335EMAXHGXMC5DAX3CGVFH5F2V/bundle.json","state_url":"https://pith.science/pith/335EMAXHGXMC5DAX3CGVFH5F2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/335EMAXHGXMC5DAX3CGVFH5F2V/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-06-27T06:35:06Z","links":{"resolver":"https://pith.science/pith/335EMAXHGXMC5DAX3CGVFH5F2V","bundle":"https://pith.science/pith/335EMAXHGXMC5DAX3CGVFH5F2V/bundle.json","state":"https://pith.science/pith/335EMAXHGXMC5DAX3CGVFH5F2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/335EMAXHGXMC5DAX3CGVFH5F2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:335EMAXHGXMC5DAX3CGVFH5F2V","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":"64084c9497d9eaf2d7fbf0bbc2d56ac2dc89f031e4f9f382e601d791eef42daa","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-09-16T14:31:42Z","title_canon_sha256":"c41e77a443108a3e64da88e49b61181dc883adefc7957070d9ea8bf46626a91b"},"schema_version":"1.0","source":{"id":"1009.3183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3183","created_at":"2026-05-18T02:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3183v1","created_at":"2026-05-18T02:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3183","created_at":"2026-05-18T02:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"335EMAXHGXMC","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"335EMAXHGXMC5DAX","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"335EMAXH","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:49534cd6ccbf2e8c109739d1665e05e75e7030a91a7d4a9f07f9db32d6ed8698","target":"graph","created_at":"2026-05-18T02:05:27Z","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":"We study a problem of failure of two interdependent networks in the case of correlated degrees of mutually dependent nodes. We assume that both networks (A and B) have the same number of nodes $N$ connected by the bidirectional dependency links establishing a one-to-one correspondence between the nodes of the two networks in a such a way that the mutually dependent nodes have the same number of connectivity links, i.e. their degrees coincide. This implies that both networks have the same degree distribution $P(k)$. We call such networks correspondently coupled networks (CCN). We assume that th","authors_text":"Gabriel A. Cwilich, Nathaniel Shere, Sergey V. Buldyrev","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-09-16T14:31:42Z","title":"Interdependent networks with correlated degrees of mutually dependent nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3183","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:0f93f6857ea2251b9cd02a8d45775dc0d1a75c91cb013b949ea324b66f09c6de","target":"record","created_at":"2026-05-18T02:05:27Z","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":"64084c9497d9eaf2d7fbf0bbc2d56ac2dc89f031e4f9f382e601d791eef42daa","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2010-09-16T14:31:42Z","title_canon_sha256":"c41e77a443108a3e64da88e49b61181dc883adefc7957070d9ea8bf46626a91b"},"schema_version":"1.0","source":{"id":"1009.3183","kind":"arxiv","version":1}},"canonical_sha256":"defa4602e735d82e8c17d88d529fa5d548b8df7852be1cc226c1a6c7552e4f9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"defa4602e735d82e8c17d88d529fa5d548b8df7852be1cc226c1a6c7552e4f9f","first_computed_at":"2026-05-18T02:05:27.475387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:05:27.475387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"98CJZ51eUJT4RW8ix1JqQgtSn7Zp1X3X2vY6KaEBg4M8XdYIWqbRM8/enVSHCZNTN3Io3wn4p11l7koPL3cvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:05:27.476131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f93f6857ea2251b9cd02a8d45775dc0d1a75c91cb013b949ea324b66f09c6de","sha256:49534cd6ccbf2e8c109739d1665e05e75e7030a91a7d4a9f07f9db32d6ed8698"],"state_sha256":"c9bc88517060a7918108638c906f7ae5ccf391922b232930ea0b4b1c5456405b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXBdjptmP8THZFEb4NcPQFQpLZ/bHlQqqcK2HQ+Ony5keJqe22WVMrkxwQH0UDiHuWI39wqjL1j4EKLGlUHMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T06:35:06.300468Z","bundle_sha256":"b3b911dae9234b0c3c57fdd55dc989ac1e5cc44c3359d999ce4c5d95296308a4"}}