{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VSW33QILON7QBWYPMORGGSHYKQ","short_pith_number":"pith:VSW33QIL","schema_version":"1.0","canonical_sha256":"acadbdc10b737f00db0f63a26348f8543bbcaedb08d37b7ce8c727ee8c5e0047","source":{"kind":"arxiv","id":"1309.4961","version":3},"attestation_state":"computed","paper":{"title":"On 3-extra connectivity of k-ary n-cubes","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jian-Bing Liu, Mei-Mei Gu, Rong-Xia Hao","submitted_at":"2013-09-19T13:18:41Z","abstract_excerpt":"Given a graph G, a non-negative integer h and a set of vertices S, the h-extra connectivity of G is the cardinality of a minimum set S such that G-S is disconnected and each component of G-S has at least h+1 vertices. The 2-extra connectivity of k-ary n-cube is gotten by Hsieh et al. in [Theoretical Computer Science, 443 (2012) 63-69]. In this paper, we obtained the h-extra connectivity of the k-ary n-cube networks for h=3."},"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":"1309.4961","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DM","submitted_at":"2013-09-19T13:18:41Z","cross_cats_sorted":[],"title_canon_sha256":"f121100107bcb5227e1488ce8959f2f30fb64fea0179678c77c4dd6057eda5dd","abstract_canon_sha256":"b0f66e7d58003777a9d1e022f89bab7f50d69947a40f860433dc34fe02f3ce90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:54.045363Z","signature_b64":"tPtn/RMF32fll3hMGlk6TASTIwPe8CBWOvjkgqjObuf+iAHnxbcIsNznp0WkBQkRnDFvYSmqjQ8cM7mjdDlSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acadbdc10b737f00db0f63a26348f8543bbcaedb08d37b7ce8c727ee8c5e0047","last_reissued_at":"2026-05-18T02:42:54.044956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:54.044956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On 3-extra connectivity of k-ary n-cubes","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jian-Bing Liu, Mei-Mei Gu, Rong-Xia Hao","submitted_at":"2013-09-19T13:18:41Z","abstract_excerpt":"Given a graph G, a non-negative integer h and a set of vertices S, the h-extra connectivity of G is the cardinality of a minimum set S such that G-S is disconnected and each component of G-S has at least h+1 vertices. The 2-extra connectivity of k-ary n-cube is gotten by Hsieh et al. in [Theoretical Computer Science, 443 (2012) 63-69]. In this paper, we obtained the h-extra connectivity of the k-ary n-cube networks for h=3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4961","kind":"arxiv","version":3},"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":"1309.4961","created_at":"2026-05-18T02:42:54.045022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4961v3","created_at":"2026-05-18T02:42:54.045022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4961","created_at":"2026-05-18T02:42:54.045022+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSW33QILON7Q","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSW33QILON7QBWYP","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSW33QIL","created_at":"2026-05-18T12:28:04.890932+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/VSW33QILON7QBWYPMORGGSHYKQ","json":"https://pith.science/pith/VSW33QILON7QBWYPMORGGSHYKQ.json","graph_json":"https://pith.science/api/pith-number/VSW33QILON7QBWYPMORGGSHYKQ/graph.json","events_json":"https://pith.science/api/pith-number/VSW33QILON7QBWYPMORGGSHYKQ/events.json","paper":"https://pith.science/paper/VSW33QIL"},"agent_actions":{"view_html":"https://pith.science/pith/VSW33QILON7QBWYPMORGGSHYKQ","download_json":"https://pith.science/pith/VSW33QILON7QBWYPMORGGSHYKQ.json","view_paper":"https://pith.science/paper/VSW33QIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4961&json=true","fetch_graph":"https://pith.science/api/pith-number/VSW33QILON7QBWYPMORGGSHYKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VSW33QILON7QBWYPMORGGSHYKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSW33QILON7QBWYPMORGGSHYKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSW33QILON7QBWYPMORGGSHYKQ/action/storage_attestation","attest_author":"https://pith.science/pith/VSW33QILON7QBWYPMORGGSHYKQ/action/author_attestation","sign_citation":"https://pith.science/pith/VSW33QILON7QBWYPMORGGSHYKQ/action/citation_signature","submit_replication":"https://pith.science/pith/VSW33QILON7QBWYPMORGGSHYKQ/action/replication_record"}},"created_at":"2026-05-18T02:42:54.045022+00:00","updated_at":"2026-05-18T02:42:54.045022+00:00"}