{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M75KVAESDXPSS4EUUFP44NYPTB","short_pith_number":"pith:M75KVAES","schema_version":"1.0","canonical_sha256":"67faaa80921ddf297094a15fce370f985c3571d1cb6110769fd663d838284338","source":{"kind":"arxiv","id":"1212.4892","version":1},"attestation_state":"computed","paper":{"title":"Edge-Fault Tolerance of Hypercube-like Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Xiang-jun Li","submitted_at":"2012-12-20T00:44:23Z","abstract_excerpt":"This paper considers a kind of generalized measure $\\lambda_s^{(h)}$ of fault tolerance in a hypercube-like graph $G_n$ which contain several well-known interconnection networks such as hypercubes, varietal hypercubes, twisted cubes, crossed cubes and M\\\"obius cubes, and proves $\\lambda_s^{(h)}(G_n)= 2^h(n-h)$ for any $h$ with $0\\leqslant h\\leqslant n-1$ by the induction on $n$ and a new technique. This result shows that at least $2^h(n-h)$ edges of $G_n$ have to be removed to get a disconnected graph that contains no vertices of degree less than $h$. Compared with previous results, this resul"},"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":"1212.4892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-20T00:44:23Z","cross_cats_sorted":[],"title_canon_sha256":"925750a2779b655806cbb3a2bdb4ee718c67ea18a2b9750ac4cc5cf4eaef52a2","abstract_canon_sha256":"152e1b57e157769b9d469b10f48f97bd865e3aa7b43ee4a7c9032d29aaca6dfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:04.437128Z","signature_b64":"/KqK6wFEm2KnVeUUgUbVo4enzThrIgayH/xA2YV+TSM47J6+9zu3sIHZOxBtgMIjOkSwP64gWbYiyrwXXWN3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67faaa80921ddf297094a15fce370f985c3571d1cb6110769fd663d838284338","last_reissued_at":"2026-05-18T03:38:04.436573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:04.436573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-Fault Tolerance of Hypercube-like Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Xiang-jun Li","submitted_at":"2012-12-20T00:44:23Z","abstract_excerpt":"This paper considers a kind of generalized measure $\\lambda_s^{(h)}$ of fault tolerance in a hypercube-like graph $G_n$ which contain several well-known interconnection networks such as hypercubes, varietal hypercubes, twisted cubes, crossed cubes and M\\\"obius cubes, and proves $\\lambda_s^{(h)}(G_n)= 2^h(n-h)$ for any $h$ with $0\\leqslant h\\leqslant n-1$ by the induction on $n$ and a new technique. This result shows that at least $2^h(n-h)$ edges of $G_n$ have to be removed to get a disconnected graph that contains no vertices of degree less than $h$. Compared with previous results, this resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4892","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":"1212.4892","created_at":"2026-05-18T03:38:04.436643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4892v1","created_at":"2026-05-18T03:38:04.436643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4892","created_at":"2026-05-18T03:38:04.436643+00:00"},{"alias_kind":"pith_short_12","alias_value":"M75KVAESDXPS","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M75KVAESDXPSS4EU","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M75KVAES","created_at":"2026-05-18T12:27:14.488303+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/M75KVAESDXPSS4EUUFP44NYPTB","json":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB.json","graph_json":"https://pith.science/api/pith-number/M75KVAESDXPSS4EUUFP44NYPTB/graph.json","events_json":"https://pith.science/api/pith-number/M75KVAESDXPSS4EUUFP44NYPTB/events.json","paper":"https://pith.science/paper/M75KVAES"},"agent_actions":{"view_html":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB","download_json":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB.json","view_paper":"https://pith.science/paper/M75KVAES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4892&json=true","fetch_graph":"https://pith.science/api/pith-number/M75KVAESDXPSS4EUUFP44NYPTB/graph.json","fetch_events":"https://pith.science/api/pith-number/M75KVAESDXPSS4EUUFP44NYPTB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB/action/storage_attestation","attest_author":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB/action/author_attestation","sign_citation":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB/action/citation_signature","submit_replication":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB/action/replication_record"}},"created_at":"2026-05-18T03:38:04.436643+00:00","updated_at":"2026-05-18T03:38:04.436643+00:00"}