{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZGEVL3VWTDXLRWBFRZYK6H7KA7","short_pith_number":"pith:ZGEVL3VW","canonical_record":{"source":{"id":"1607.07761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-13T06:01:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"22ae7e6d5da7fda1a09180d00be577f25ecf4e1eae7f8b622dadb0104c26a2e9","abstract_canon_sha256":"b4e660f256fdbd8fcd7ff125b0d8268ff5215ea379030af20d3fd9445da8a326"},"schema_version":"1.0"},"canonical_sha256":"c98955eeb698eeb8d8258e70af1fea07e5c413e7bfd8ac0da5344484bbab0015","source":{"kind":"arxiv","id":"1607.07761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07761","created_at":"2026-05-18T01:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07761v1","created_at":"2026-05-18T01:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07761","created_at":"2026-05-18T01:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZGEVL3VWTDXL","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZGEVL3VWTDXLRWBF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZGEVL3VW","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZGEVL3VWTDXLRWBFRZYK6H7KA7","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-13T06:01:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"22ae7e6d5da7fda1a09180d00be577f25ecf4e1eae7f8b622dadb0104c26a2e9","abstract_canon_sha256":"b4e660f256fdbd8fcd7ff125b0d8268ff5215ea379030af20d3fd9445da8a326"},"schema_version":"1.0"},"canonical_sha256":"c98955eeb698eeb8d8258e70af1fea07e5c413e7bfd8ac0da5344484bbab0015","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:25.328416Z","signature_b64":"bBXEiEV+UrEOnjlUY6deaQqN5Ok/jaKV5o8G6ojB6Twg35/ANtYH4LXG7RfihYn3d0roqx/Zn0gEL8nXnqhNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c98955eeb698eeb8d8258e70af1fea07e5c413e7bfd8ac0da5344484bbab0015","last_reissued_at":"2026-05-18T01:10:25.327742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:25.327742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07761","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-18T01:10:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1C3MH4l2rPsLnF52JobiNOoa7oFb0DvKJQHtStXwAgxtwliYSzgAgfK30c6UYgfkqQW/TkrsJRIM2qfAgMpFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:40:50.292271Z"},"content_sha256":"90e73bc67b090f8aaddb3bd1d9fbfe310ac1a419257b93a0e8eb0646a616c53f","schema_version":"1.0","event_id":"sha256:90e73bc67b090f8aaddb3bd1d9fbfe310ac1a419257b93a0e8eb0646a616c53f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZGEVL3VWTDXLRWBFRZYK6H7KA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Graph Isoperimetric Inequality to Network Connectivity -- A New Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DC","authors_text":"Dajin Wang, Fang Ma, Guodong Guo (Senior Member, IEEE), Qiang Zhu (Member, Weisheng Chen (Member","submitted_at":"2016-07-13T06:01:52Z","abstract_excerpt":"We present a new, novel approach to obtaining a network's connectivity. More specifically, we show that there exists a relationship between a network's graph isoperimetric properties and its conditional connectivity. A network's connectivity is the minimum number of nodes, whose removal will cause the network disconnected. It is a basic and important measure for the network's reliability, hence its overall robustness. Several conditional connectivities have been proposed in the past for the purpose of accurately reflecting various realistic network situations, with extra connectivity being one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07761","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-18T01:10:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RW9B7xCHrwCawf9o/Yp/t+5RLy0nnFWhBN9rY6VMBM14k37feWykc6OVPeVWZeCHC2ZtiqoFzO+Uc8zH7b80DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:40:50.292686Z"},"content_sha256":"c5d711f7c25e85b8393aef340c7b0f2fe096f51666ad9c92a00f9138ef5645a5","schema_version":"1.0","event_id":"sha256:c5d711f7c25e85b8393aef340c7b0f2fe096f51666ad9c92a00f9138ef5645a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGEVL3VWTDXLRWBFRZYK6H7KA7/bundle.json","state_url":"https://pith.science/pith/ZGEVL3VWTDXLRWBFRZYK6H7KA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGEVL3VWTDXLRWBFRZYK6H7KA7/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-06T11:40:50Z","links":{"resolver":"https://pith.science/pith/ZGEVL3VWTDXLRWBFRZYK6H7KA7","bundle":"https://pith.science/pith/ZGEVL3VWTDXLRWBFRZYK6H7KA7/bundle.json","state":"https://pith.science/pith/ZGEVL3VWTDXLRWBFRZYK6H7KA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGEVL3VWTDXLRWBFRZYK6H7KA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZGEVL3VWTDXLRWBFRZYK6H7KA7","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":"b4e660f256fdbd8fcd7ff125b0d8268ff5215ea379030af20d3fd9445da8a326","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-13T06:01:52Z","title_canon_sha256":"22ae7e6d5da7fda1a09180d00be577f25ecf4e1eae7f8b622dadb0104c26a2e9"},"schema_version":"1.0","source":{"id":"1607.07761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07761","created_at":"2026-05-18T01:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07761v1","created_at":"2026-05-18T01:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07761","created_at":"2026-05-18T01:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZGEVL3VWTDXL","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZGEVL3VWTDXLRWBF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZGEVL3VW","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:c5d711f7c25e85b8393aef340c7b0f2fe096f51666ad9c92a00f9138ef5645a5","target":"graph","created_at":"2026-05-18T01:10:25Z","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 present a new, novel approach to obtaining a network's connectivity. More specifically, we show that there exists a relationship between a network's graph isoperimetric properties and its conditional connectivity. A network's connectivity is the minimum number of nodes, whose removal will cause the network disconnected. It is a basic and important measure for the network's reliability, hence its overall robustness. Several conditional connectivities have been proposed in the past for the purpose of accurately reflecting various realistic network situations, with extra connectivity being one","authors_text":"Dajin Wang, Fang Ma, Guodong Guo (Senior Member, IEEE), Qiang Zhu (Member, Weisheng Chen (Member","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-13T06:01:52Z","title":"From Graph Isoperimetric Inequality to Network Connectivity -- A New Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07761","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:90e73bc67b090f8aaddb3bd1d9fbfe310ac1a419257b93a0e8eb0646a616c53f","target":"record","created_at":"2026-05-18T01:10:25Z","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":"b4e660f256fdbd8fcd7ff125b0d8268ff5215ea379030af20d3fd9445da8a326","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-13T06:01:52Z","title_canon_sha256":"22ae7e6d5da7fda1a09180d00be577f25ecf4e1eae7f8b622dadb0104c26a2e9"},"schema_version":"1.0","source":{"id":"1607.07761","kind":"arxiv","version":1}},"canonical_sha256":"c98955eeb698eeb8d8258e70af1fea07e5c413e7bfd8ac0da5344484bbab0015","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c98955eeb698eeb8d8258e70af1fea07e5c413e7bfd8ac0da5344484bbab0015","first_computed_at":"2026-05-18T01:10:25.327742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:25.327742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bBXEiEV+UrEOnjlUY6deaQqN5Ok/jaKV5o8G6ojB6Twg35/ANtYH4LXG7RfihYn3d0roqx/Zn0gEL8nXnqhNDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:25.328416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90e73bc67b090f8aaddb3bd1d9fbfe310ac1a419257b93a0e8eb0646a616c53f","sha256:c5d711f7c25e85b8393aef340c7b0f2fe096f51666ad9c92a00f9138ef5645a5"],"state_sha256":"10b1dea939d631ed53e8b2135c4f587e9bf5ef06ac5d3759f0b56e458a5bc33f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jidV0T+YW4iso/XgOtifgVcvQu5rMXk29i9y8ojaebgJJnJacNyHz2THzvZXyEJ2aFT22wRNzM6L0h0rQJckDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:40:50.295897Z","bundle_sha256":"24936e70a3cc7abafdb2234aace9318c0c3bd3b8e23bfb5a1f00b7dfdcbea355"}}