{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BBN5HYCWW2EZ6VLEROMJBLORDX","short_pith_number":"pith:BBN5HYCW","schema_version":"1.0","canonical_sha256":"085bd3e056b6899f55648b9890add11de9a5eb26875c7c15f04e7635c245b121","source":{"kind":"arxiv","id":"1604.02906","version":2},"attestation_state":"computed","paper":{"title":"The vulnerability of the diameter of enhanced hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Douglas B. West, Jun-Ming Xu, Meijie Ma","submitted_at":"2016-04-11T12:04:37Z","abstract_excerpt":"For an interconnection network $G$, the {\\it $\\omega$-wide diameter} $d_\\omega(G)$ is the least $\\ell$ such that any two vertices are joined by $\\omega$ internally-disjoint paths of length at most $\\ell$, and the {\\it $(\\omega-1)$-fault diameter} $D_{\\omega}(G)$ is the maximum diameter of a subgraph obtained by deleting fewer than $\\omega$ vertices of $G$.\n  The enhanced hypercube $Q_{n,k}$ is a variant of the well-known hypercube. Yang, Chang, Pai, and Chan gave an upper bound for $d_{n+1}(Q_{n,k})$ and $D_{n+1}(Q_{n,k})$ and posed the problem of finding the wide diameters and fault diameters"},"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":"1604.02906","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-11T12:04:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"265578e897482dba8682411372bbe19c5002fdbeaffc25ade1b796118f3bb358","abstract_canon_sha256":"dbf906c95d1f418573bf1f3e5d623c98de31cf12610c966c734204807f181264"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:16.646844Z","signature_b64":"PuH4YFk7DSM+dUyDYZEUhw+hAWF9pEKR/uZ14lrkRM0Lpuc6qD9T6AlttbnqYVIGka/Z7jjHqBmG+1pOnLvRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"085bd3e056b6899f55648b9890add11de9a5eb26875c7c15f04e7635c245b121","last_reissued_at":"2026-05-18T01:12:16.646494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:16.646494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The vulnerability of the diameter of enhanced hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Douglas B. West, Jun-Ming Xu, Meijie Ma","submitted_at":"2016-04-11T12:04:37Z","abstract_excerpt":"For an interconnection network $G$, the {\\it $\\omega$-wide diameter} $d_\\omega(G)$ is the least $\\ell$ such that any two vertices are joined by $\\omega$ internally-disjoint paths of length at most $\\ell$, and the {\\it $(\\omega-1)$-fault diameter} $D_{\\omega}(G)$ is the maximum diameter of a subgraph obtained by deleting fewer than $\\omega$ vertices of $G$.\n  The enhanced hypercube $Q_{n,k}$ is a variant of the well-known hypercube. Yang, Chang, Pai, and Chan gave an upper bound for $d_{n+1}(Q_{n,k})$ and $D_{n+1}(Q_{n,k})$ and posed the problem of finding the wide diameters and fault diameters"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02906","kind":"arxiv","version":2},"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":"1604.02906","created_at":"2026-05-18T01:12:16.646544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02906v2","created_at":"2026-05-18T01:12:16.646544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02906","created_at":"2026-05-18T01:12:16.646544+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBN5HYCWW2EZ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBN5HYCWW2EZ6VLE","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBN5HYCW","created_at":"2026-05-18T12:30:07.202191+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/BBN5HYCWW2EZ6VLEROMJBLORDX","json":"https://pith.science/pith/BBN5HYCWW2EZ6VLEROMJBLORDX.json","graph_json":"https://pith.science/api/pith-number/BBN5HYCWW2EZ6VLEROMJBLORDX/graph.json","events_json":"https://pith.science/api/pith-number/BBN5HYCWW2EZ6VLEROMJBLORDX/events.json","paper":"https://pith.science/paper/BBN5HYCW"},"agent_actions":{"view_html":"https://pith.science/pith/BBN5HYCWW2EZ6VLEROMJBLORDX","download_json":"https://pith.science/pith/BBN5HYCWW2EZ6VLEROMJBLORDX.json","view_paper":"https://pith.science/paper/BBN5HYCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02906&json=true","fetch_graph":"https://pith.science/api/pith-number/BBN5HYCWW2EZ6VLEROMJBLORDX/graph.json","fetch_events":"https://pith.science/api/pith-number/BBN5HYCWW2EZ6VLEROMJBLORDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBN5HYCWW2EZ6VLEROMJBLORDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBN5HYCWW2EZ6VLEROMJBLORDX/action/storage_attestation","attest_author":"https://pith.science/pith/BBN5HYCWW2EZ6VLEROMJBLORDX/action/author_attestation","sign_citation":"https://pith.science/pith/BBN5HYCWW2EZ6VLEROMJBLORDX/action/citation_signature","submit_replication":"https://pith.science/pith/BBN5HYCWW2EZ6VLEROMJBLORDX/action/replication_record"}},"created_at":"2026-05-18T01:12:16.646544+00:00","updated_at":"2026-05-18T01:12:16.646544+00:00"}