{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZMHLL4QLMYXGREX4BR3HUB6GGB","short_pith_number":"pith:ZMHLL4QL","canonical_record":{"source":{"id":"1709.02013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-06T22:08:31Z","cross_cats_sorted":[],"title_canon_sha256":"bb939cfafcabf77de29e429ec99441be16edc306377b198884d195e99031a26d","abstract_canon_sha256":"4c02b86e1f91da0e0dbfdf19fd17cf0c850923c17cb3844aef5fa30f9e7ed174"},"schema_version":"1.0"},"canonical_sha256":"cb0eb5f20b662e6892fc0c767a07c63044f1c4b3ecf2865403931c40f302160b","source":{"kind":"arxiv","id":"1709.02013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02013","created_at":"2026-05-18T00:35:50Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02013v1","created_at":"2026-05-18T00:35:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02013","created_at":"2026-05-18T00:35:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZMHLL4QLMYXG","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZMHLL4QLMYXGREX4","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZMHLL4QL","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZMHLL4QLMYXGREX4BR3HUB6GGB","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-06T22:08:31Z","cross_cats_sorted":[],"title_canon_sha256":"bb939cfafcabf77de29e429ec99441be16edc306377b198884d195e99031a26d","abstract_canon_sha256":"4c02b86e1f91da0e0dbfdf19fd17cf0c850923c17cb3844aef5fa30f9e7ed174"},"schema_version":"1.0"},"canonical_sha256":"cb0eb5f20b662e6892fc0c767a07c63044f1c4b3ecf2865403931c40f302160b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:50.510218Z","signature_b64":"GBlS2x73J5wzjLxLTVBhE2/xm0UMMCEoow6e/3iUTejG/sHPdwZGEBiGs9lq/R+9Ar8XHEk6uiF5UaoZryiLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb0eb5f20b662e6892fc0c767a07c63044f1c4b3ecf2865403931c40f302160b","last_reissued_at":"2026-05-18T00:35:50.509281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:50.509281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02013","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-18T00:35:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcMMw5BtQqezcRsvop+MjNEQ8eej1P5iX+V3LjpZTUntUmWiCJFLURGVCHAo0v85juy2RlC67I/KeZqNlBPmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:05:30.870189Z"},"content_sha256":"90d61b7d581bf9e425740fbfa9af48b2d889f97d3363bca352413d1c6cfc3ac7","schema_version":"1.0","event_id":"sha256:90d61b7d581bf9e425740fbfa9af48b2d889f97d3363bca352413d1c6cfc3ac7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZMHLL4QLMYXGREX4BR3HUB6GGB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On conditional fault tolerance of hierarchical cubic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Min Liu, Xiang-jun Li, Zheng Yan","submitted_at":"2017-09-06T22:08:31Z","abstract_excerpt":"This paper considers the conditional fault tolerance, $h$-super connectivity $\\kappa^{h}$ and $h$-super edge-connectivity $\\lambda^{h}$ of the hierarchical cubic network $HCN_n$, an attractive alternative network to the hypercube, and shows $\\kappa^h(HCN_n)=\\lambda^h(HCN_n)=2^h(n+1-h)$ for any $h$ with $0\\leq h\\leq n-1$. The results imply that at least $2^h(n+1-h)$ vertices or edges have to be removed from $HCN_n$ to make it disconnected with no vertices of degree less than $h$, and generalize some known results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02013","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-18T00:35:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7LBuaz0Hb/llh2oxFsbhTBuO4e60FlfgFYLH85702U/84E6hCaeAKeQbuRch7mdNsiVslz6ZYGtsYisIXvMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:05:30.870912Z"},"content_sha256":"917d8b58d896a8e3b2a5fba8a33ef08f6df3557e67bc10e20d619c456862a632","schema_version":"1.0","event_id":"sha256:917d8b58d896a8e3b2a5fba8a33ef08f6df3557e67bc10e20d619c456862a632"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/bundle.json","state_url":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/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-06T18:05:30Z","links":{"resolver":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB","bundle":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/bundle.json","state":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZMHLL4QLMYXGREX4BR3HUB6GGB","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":"4c02b86e1f91da0e0dbfdf19fd17cf0c850923c17cb3844aef5fa30f9e7ed174","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-06T22:08:31Z","title_canon_sha256":"bb939cfafcabf77de29e429ec99441be16edc306377b198884d195e99031a26d"},"schema_version":"1.0","source":{"id":"1709.02013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02013","created_at":"2026-05-18T00:35:50Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02013v1","created_at":"2026-05-18T00:35:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02013","created_at":"2026-05-18T00:35:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZMHLL4QLMYXG","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZMHLL4QLMYXGREX4","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZMHLL4QL","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:917d8b58d896a8e3b2a5fba8a33ef08f6df3557e67bc10e20d619c456862a632","target":"graph","created_at":"2026-05-18T00:35:50Z","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":"This paper considers the conditional fault tolerance, $h$-super connectivity $\\kappa^{h}$ and $h$-super edge-connectivity $\\lambda^{h}$ of the hierarchical cubic network $HCN_n$, an attractive alternative network to the hypercube, and shows $\\kappa^h(HCN_n)=\\lambda^h(HCN_n)=2^h(n+1-h)$ for any $h$ with $0\\leq h\\leq n-1$. The results imply that at least $2^h(n+1-h)$ vertices or edges have to be removed from $HCN_n$ to make it disconnected with no vertices of degree less than $h$, and generalize some known results.","authors_text":"Jun-Ming Xu, Min Liu, Xiang-jun Li, Zheng Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-06T22:08:31Z","title":"On conditional fault tolerance of hierarchical cubic networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02013","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:90d61b7d581bf9e425740fbfa9af48b2d889f97d3363bca352413d1c6cfc3ac7","target":"record","created_at":"2026-05-18T00:35:50Z","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":"4c02b86e1f91da0e0dbfdf19fd17cf0c850923c17cb3844aef5fa30f9e7ed174","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-06T22:08:31Z","title_canon_sha256":"bb939cfafcabf77de29e429ec99441be16edc306377b198884d195e99031a26d"},"schema_version":"1.0","source":{"id":"1709.02013","kind":"arxiv","version":1}},"canonical_sha256":"cb0eb5f20b662e6892fc0c767a07c63044f1c4b3ecf2865403931c40f302160b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb0eb5f20b662e6892fc0c767a07c63044f1c4b3ecf2865403931c40f302160b","first_computed_at":"2026-05-18T00:35:50.509281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:50.509281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GBlS2x73J5wzjLxLTVBhE2/xm0UMMCEoow6e/3iUTejG/sHPdwZGEBiGs9lq/R+9Ar8XHEk6uiF5UaoZryiLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:50.510218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90d61b7d581bf9e425740fbfa9af48b2d889f97d3363bca352413d1c6cfc3ac7","sha256:917d8b58d896a8e3b2a5fba8a33ef08f6df3557e67bc10e20d619c456862a632"],"state_sha256":"2ae58f99af0491481123fa8cd404a659659569f8d1d90b3cadaa1a064dcecaf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVw/C3464o4yQBuvBMg0raZX2o281g+T6MOVw0qUGJkPKwlOYs45qVKT2BS2JIEB+LfaF1sUSKEB+nI3/LSrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:05:30.875312Z","bundle_sha256":"8d72d6a9bc360b6e1dd571cc046c3d5ac6d9ac9be55a0d7bd4027c1f681bff37"}}