{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AJG4HLMVQKT7J37KXJW75J3BI7","short_pith_number":"pith:AJG4HLMV","canonical_record":{"source":{"id":"1709.03034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-10T03:25:32Z","cross_cats_sorted":["cs.NI","cs.SI"],"title_canon_sha256":"7a8bc274e50e2a069e7db6817448a843aa00e8765e35ba54a4cbe0a65832d248","abstract_canon_sha256":"f139d3fec8e4d912a60bb5e5dfdf6071a09d90e720b56bf74d9b0f9ce9dedb54"},"schema_version":"1.0"},"canonical_sha256":"024dc3ad9582a7f4efeaba6dfea76147e0b4c5daa1e7e8dac1e5596941f21288","source":{"kind":"arxiv","id":"1709.03034","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03034","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03034v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03034","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"AJG4HLMVQKT7","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AJG4HLMVQKT7J37K","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AJG4HLMV","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AJG4HLMVQKT7J37KXJW75J3BI7","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-10T03:25:32Z","cross_cats_sorted":["cs.NI","cs.SI"],"title_canon_sha256":"7a8bc274e50e2a069e7db6817448a843aa00e8765e35ba54a4cbe0a65832d248","abstract_canon_sha256":"f139d3fec8e4d912a60bb5e5dfdf6071a09d90e720b56bf74d9b0f9ce9dedb54"},"schema_version":"1.0"},"canonical_sha256":"024dc3ad9582a7f4efeaba6dfea76147e0b4c5daa1e7e8dac1e5596941f21288","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:20.792817Z","signature_b64":"clzWvR2R8ZhlnXbeIlLPPEqnmAPbWdILnnxDpIzVf+UB7cUj4zjK2AtfSb7k3SvyW/6uI+a47+yOWHJH3BQqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"024dc3ad9582a7f4efeaba6dfea76147e0b4c5daa1e7e8dac1e5596941f21288","last_reissued_at":"2026-05-18T00:06:20.792426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:20.792426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03034","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-18T00:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+4qV8V4Lk9FERGC/OZZ7dgN9R26g/U87uyShieLsx9QFAtgZjOTWaFzpZ+CailO1r4MP4W5pTJaZ6FfcGd3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:40:49.437069Z"},"content_sha256":"e550a83a45e4264927e9e432ed49016655956c7c82ce4ed6790a5ea3ecf978e5","schema_version":"1.0","event_id":"sha256:e550a83a45e4264927e9e432ed49016655956c7c82ce4ed6790a5ea3ecf978e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AJG4HLMVQKT7J37KXJW75J3BI7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectivity in Interdependent Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SI"],"primary_cat":"cs.DM","authors_text":"Eytan Modiano, Jianan Zhang","submitted_at":"2017-09-10T03:25:32Z","abstract_excerpt":"We propose and analyze a graph model to study the connectivity of interdependent networks. Two interdependent networks of arbitrary topologies are modeled as two graphs, where every node in one graph is supported by supply nodes in the other graph, and a node fails if all of its supply nodes fail. Such interdependence arises in cyber-physical systems and layered network architectures.\n  We study the \\emph{supply node connectivity} of a network: namely, the minimum number of supply node removals that would disconnect the network. We develop algorithms to evaluate the supply node connectivity gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03034","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-18T00:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5h5VCymJGG9qhIwPVj8+VEmM6QylvDgqcss1qNjqMLb5yfvhHIQSsUYS/OerzLS1Fzt2eV/jTanhC/qcVHK5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:40:49.437724Z"},"content_sha256":"76a5871f0e3ad6239a129b88fa77580382cbcb5adddcdf9c6c9f2d98c7d5d409","schema_version":"1.0","event_id":"sha256:76a5871f0e3ad6239a129b88fa77580382cbcb5adddcdf9c6c9f2d98c7d5d409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJG4HLMVQKT7J37KXJW75J3BI7/bundle.json","state_url":"https://pith.science/pith/AJG4HLMVQKT7J37KXJW75J3BI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJG4HLMVQKT7J37KXJW75J3BI7/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-08T02:40:49Z","links":{"resolver":"https://pith.science/pith/AJG4HLMVQKT7J37KXJW75J3BI7","bundle":"https://pith.science/pith/AJG4HLMVQKT7J37KXJW75J3BI7/bundle.json","state":"https://pith.science/pith/AJG4HLMVQKT7J37KXJW75J3BI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJG4HLMVQKT7J37KXJW75J3BI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AJG4HLMVQKT7J37KXJW75J3BI7","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":"f139d3fec8e4d912a60bb5e5dfdf6071a09d90e720b56bf74d9b0f9ce9dedb54","cross_cats_sorted":["cs.NI","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-10T03:25:32Z","title_canon_sha256":"7a8bc274e50e2a069e7db6817448a843aa00e8765e35ba54a4cbe0a65832d248"},"schema_version":"1.0","source":{"id":"1709.03034","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03034","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03034v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03034","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"AJG4HLMVQKT7","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AJG4HLMVQKT7J37K","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AJG4HLMV","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:76a5871f0e3ad6239a129b88fa77580382cbcb5adddcdf9c6c9f2d98c7d5d409","target":"graph","created_at":"2026-05-18T00:06:20Z","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 propose and analyze a graph model to study the connectivity of interdependent networks. Two interdependent networks of arbitrary topologies are modeled as two graphs, where every node in one graph is supported by supply nodes in the other graph, and a node fails if all of its supply nodes fail. Such interdependence arises in cyber-physical systems and layered network architectures.\n  We study the \\emph{supply node connectivity} of a network: namely, the minimum number of supply node removals that would disconnect the network. We develop algorithms to evaluate the supply node connectivity gi","authors_text":"Eytan Modiano, Jianan Zhang","cross_cats":["cs.NI","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-10T03:25:32Z","title":"Connectivity in Interdependent Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03034","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:e550a83a45e4264927e9e432ed49016655956c7c82ce4ed6790a5ea3ecf978e5","target":"record","created_at":"2026-05-18T00:06:20Z","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":"f139d3fec8e4d912a60bb5e5dfdf6071a09d90e720b56bf74d9b0f9ce9dedb54","cross_cats_sorted":["cs.NI","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-09-10T03:25:32Z","title_canon_sha256":"7a8bc274e50e2a069e7db6817448a843aa00e8765e35ba54a4cbe0a65832d248"},"schema_version":"1.0","source":{"id":"1709.03034","kind":"arxiv","version":2}},"canonical_sha256":"024dc3ad9582a7f4efeaba6dfea76147e0b4c5daa1e7e8dac1e5596941f21288","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"024dc3ad9582a7f4efeaba6dfea76147e0b4c5daa1e7e8dac1e5596941f21288","first_computed_at":"2026-05-18T00:06:20.792426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:20.792426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"clzWvR2R8ZhlnXbeIlLPPEqnmAPbWdILnnxDpIzVf+UB7cUj4zjK2AtfSb7k3SvyW/6uI+a47+yOWHJH3BQqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:20.792817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03034","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e550a83a45e4264927e9e432ed49016655956c7c82ce4ed6790a5ea3ecf978e5","sha256:76a5871f0e3ad6239a129b88fa77580382cbcb5adddcdf9c6c9f2d98c7d5d409"],"state_sha256":"c9798b1d8d68ad95b4363c31b64eada8e03dda415778be38907a9844f9514829"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2nh2XIPvl/d9vHLzeREkaO1Fd1qhNyo4suCh4Dxncwu5rFRmErMgb5ZGoSsyLWfDABBssz/6cdy3+wmX3tBXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:40:49.442014Z","bundle_sha256":"21c1171ff8672760d3b3bb9f3964089a77a893dd1ef280a8c6c6fad82ce24aa0"}}