{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NZIAIOIEGO2OYHTUYQWVC4A7JP","short_pith_number":"pith:NZIAIOIE","schema_version":"1.0","canonical_sha256":"6e5004390433b4ec1e74c42d51701f4bea06a2231d28460f24340d9e71874971","source":{"kind":"arxiv","id":"1808.02375","version":1},"attestation_state":"computed","paper":{"title":"Structure and substructure connectivity of balanced hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Huazhong L\\\"u, Tingzeng Wu","submitted_at":"2018-08-06T10:48:39Z","abstract_excerpt":"The connectivity of a network directly signifies its reliability and fault-tolerance. Structure and substructure connectivity are two novel generalizations of the connectivity. Let $H$ be a subgraph of a connected graph $G$. The structure connectivity (resp. substructure connectivity) of $G$, denoted by $\\kappa(G;H)$ (resp. $\\kappa^s(G;H)$), is defined to be the minimum cardinality of a set $F$ of connected subgraphs in $G$, if exists, whose removal disconnects $G$ and each element of $F$ is isomorphic to $H$ (resp. a subgraph of $H$). In this paper, we shall establish both $\\kappa(BH_n;H)$ an"},"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":"1808.02375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-06T10:48:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a914a10fbf4e58267cf6aecae0c887c34f8c1fae5bc3b8202958ba54a746f44c","abstract_canon_sha256":"9edbaff54d107345e2389fe7df12af23661e92fea35def509cc74e1d3f2abc44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:37.271047Z","signature_b64":"UgjGJLPi85Qk/JEt4D9lrE0ICb8NNORjXq4AxIZbw/fw21AR3RFZkqjCBHA8/ZO+RITo1TTbgex6tnM1YhXXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e5004390433b4ec1e74c42d51701f4bea06a2231d28460f24340d9e71874971","last_reissued_at":"2026-05-18T00:08:37.270525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:37.270525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure and substructure connectivity of balanced hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Huazhong L\\\"u, Tingzeng Wu","submitted_at":"2018-08-06T10:48:39Z","abstract_excerpt":"The connectivity of a network directly signifies its reliability and fault-tolerance. Structure and substructure connectivity are two novel generalizations of the connectivity. Let $H$ be a subgraph of a connected graph $G$. The structure connectivity (resp. substructure connectivity) of $G$, denoted by $\\kappa(G;H)$ (resp. $\\kappa^s(G;H)$), is defined to be the minimum cardinality of a set $F$ of connected subgraphs in $G$, if exists, whose removal disconnects $G$ and each element of $F$ is isomorphic to $H$ (resp. a subgraph of $H$). In this paper, we shall establish both $\\kappa(BH_n;H)$ an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02375","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":"1808.02375","created_at":"2026-05-18T00:08:37.270607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02375v1","created_at":"2026-05-18T00:08:37.270607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02375","created_at":"2026-05-18T00:08:37.270607+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZIAIOIEGO2O","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZIAIOIEGO2OYHTU","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZIAIOIE","created_at":"2026-05-18T12:32:40.477152+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/NZIAIOIEGO2OYHTUYQWVC4A7JP","json":"https://pith.science/pith/NZIAIOIEGO2OYHTUYQWVC4A7JP.json","graph_json":"https://pith.science/api/pith-number/NZIAIOIEGO2OYHTUYQWVC4A7JP/graph.json","events_json":"https://pith.science/api/pith-number/NZIAIOIEGO2OYHTUYQWVC4A7JP/events.json","paper":"https://pith.science/paper/NZIAIOIE"},"agent_actions":{"view_html":"https://pith.science/pith/NZIAIOIEGO2OYHTUYQWVC4A7JP","download_json":"https://pith.science/pith/NZIAIOIEGO2OYHTUYQWVC4A7JP.json","view_paper":"https://pith.science/paper/NZIAIOIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02375&json=true","fetch_graph":"https://pith.science/api/pith-number/NZIAIOIEGO2OYHTUYQWVC4A7JP/graph.json","fetch_events":"https://pith.science/api/pith-number/NZIAIOIEGO2OYHTUYQWVC4A7JP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZIAIOIEGO2OYHTUYQWVC4A7JP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZIAIOIEGO2OYHTUYQWVC4A7JP/action/storage_attestation","attest_author":"https://pith.science/pith/NZIAIOIEGO2OYHTUYQWVC4A7JP/action/author_attestation","sign_citation":"https://pith.science/pith/NZIAIOIEGO2OYHTUYQWVC4A7JP/action/citation_signature","submit_replication":"https://pith.science/pith/NZIAIOIEGO2OYHTUYQWVC4A7JP/action/replication_record"}},"created_at":"2026-05-18T00:08:37.270607+00:00","updated_at":"2026-05-18T00:08:37.270607+00:00"}