{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:M75KVAESDXPSS4EUUFP44NYPTB","short_pith_number":"pith:M75KVAES","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"},"canonical_sha256":"67faaa80921ddf297094a15fce370f985c3571d1cb6110769fd663d838284338","source":{"kind":"arxiv","id":"1212.4892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4892","created_at":"2026-05-18T03:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4892v1","created_at":"2026-05-18T03:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4892","created_at":"2026-05-18T03:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"M75KVAESDXPS","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M75KVAESDXPSS4EU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M75KVAES","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:M75KVAESDXPSS4EUUFP44NYPTB","target":"record","payload":{"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"},"canonical_sha256":"67faaa80921ddf297094a15fce370f985c3571d1cb6110769fd663d838284338","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"},"source_kind":"arxiv","source_id":"1212.4892","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-18T03:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fzS62kBOLOfUc8TQ2E5rpHzQ2FTHVlRCxPXsA66DvjfCpWHOpyLyG11qxbewvEH8r5tpuRlI+md9U7i2nUxaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:57:48.981057Z"},"content_sha256":"dcff356cdbd660e1ac946c9691a264f20d48301c6dd7ce231f0c6f744c109ea0","schema_version":"1.0","event_id":"sha256:dcff356cdbd660e1ac946c9691a264f20d48301c6dd7ce231f0c6f744c109ea0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:M75KVAESDXPSS4EUUFP44NYPTB","target":"graph","payload":{"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"},"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-18T03:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gAaefHIjseQziIr3a4G0j5BI7ttJX5F+1GLzVvE7XBk/5XT5vbr3mfnwu+xS0TbVnP6Gnq1y6QfG7sGldczAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:57:48.981412Z"},"content_sha256":"2dbd48a2888394d1b0d0a542584c557090c9a5d95b22b5846adffb41c8b161ed","schema_version":"1.0","event_id":"sha256:2dbd48a2888394d1b0d0a542584c557090c9a5d95b22b5846adffb41c8b161ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB/bundle.json","state_url":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M75KVAESDXPSS4EUUFP44NYPTB/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-24T02:57:48Z","links":{"resolver":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB","bundle":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB/bundle.json","state":"https://pith.science/pith/M75KVAESDXPSS4EUUFP44NYPTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M75KVAESDXPSS4EUUFP44NYPTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:M75KVAESDXPSS4EUUFP44NYPTB","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":"152e1b57e157769b9d469b10f48f97bd865e3aa7b43ee4a7c9032d29aaca6dfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-20T00:44:23Z","title_canon_sha256":"925750a2779b655806cbb3a2bdb4ee718c67ea18a2b9750ac4cc5cf4eaef52a2"},"schema_version":"1.0","source":{"id":"1212.4892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4892","created_at":"2026-05-18T03:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4892v1","created_at":"2026-05-18T03:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4892","created_at":"2026-05-18T03:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"M75KVAESDXPS","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M75KVAESDXPSS4EU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M75KVAES","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:2dbd48a2888394d1b0d0a542584c557090c9a5d95b22b5846adffb41c8b161ed","target":"graph","created_at":"2026-05-18T03:38:04Z","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 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","authors_text":"Jun-Ming Xu, Xiang-jun Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-20T00:44:23Z","title":"Edge-Fault Tolerance of Hypercube-like Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4892","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:dcff356cdbd660e1ac946c9691a264f20d48301c6dd7ce231f0c6f744c109ea0","target":"record","created_at":"2026-05-18T03:38:04Z","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":"152e1b57e157769b9d469b10f48f97bd865e3aa7b43ee4a7c9032d29aaca6dfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-20T00:44:23Z","title_canon_sha256":"925750a2779b655806cbb3a2bdb4ee718c67ea18a2b9750ac4cc5cf4eaef52a2"},"schema_version":"1.0","source":{"id":"1212.4892","kind":"arxiv","version":1}},"canonical_sha256":"67faaa80921ddf297094a15fce370f985c3571d1cb6110769fd663d838284338","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67faaa80921ddf297094a15fce370f985c3571d1cb6110769fd663d838284338","first_computed_at":"2026-05-18T03:38:04.436573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:04.436573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/KqK6wFEm2KnVeUUgUbVo4enzThrIgayH/xA2YV+TSM47J6+9zu3sIHZOxBtgMIjOkSwP64gWbYiyrwXXWN3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:04.437128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcff356cdbd660e1ac946c9691a264f20d48301c6dd7ce231f0c6f744c109ea0","sha256:2dbd48a2888394d1b0d0a542584c557090c9a5d95b22b5846adffb41c8b161ed"],"state_sha256":"71a173467d3593f4b6bb9f0fa47b55624a75d2aecec4363407a84258f1edb1d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2AGu5jOkvKgLqd+KbHPhkrnHh1/KwdOlAl4ug2/3hD7235LTUJf4I2FlzgOXihfLCLJL/ofSI6a6O33FMb4FAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:57:48.983333Z","bundle_sha256":"919526340acf8803cca21758c7bf72781b746757d6529477abeba148088a1a77"}}