{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZMHLL4QLMYXGREX4BR3HUB6GGB","short_pith_number":"pith:ZMHLL4QL","schema_version":"1.0","canonical_sha256":"cb0eb5f20b662e6892fc0c767a07c63044f1c4b3ecf2865403931c40f302160b","source":{"kind":"arxiv","id":"1709.02013","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.02013","created_at":"2026-05-18T00:35:50.509453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02013v1","created_at":"2026-05-18T00:35:50.509453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02013","created_at":"2026-05-18T00:35:50.509453+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMHLL4QLMYXG","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMHLL4QLMYXGREX4","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMHLL4QL","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB","json":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB.json","graph_json":"https://pith.science/api/pith-number/ZMHLL4QLMYXGREX4BR3HUB6GGB/graph.json","events_json":"https://pith.science/api/pith-number/ZMHLL4QLMYXGREX4BR3HUB6GGB/events.json","paper":"https://pith.science/paper/ZMHLL4QL"},"agent_actions":{"view_html":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB","download_json":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB.json","view_paper":"https://pith.science/paper/ZMHLL4QL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02013&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMHLL4QLMYXGREX4BR3HUB6GGB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMHLL4QLMYXGREX4BR3HUB6GGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/action/storage_attestation","attest_author":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/action/author_attestation","sign_citation":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/action/citation_signature","submit_replication":"https://pith.science/pith/ZMHLL4QLMYXGREX4BR3HUB6GGB/action/replication_record"}},"created_at":"2026-05-18T00:35:50.509453+00:00","updated_at":"2026-05-18T00:35:50.509453+00:00"}