{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JJXKPMML7AG7QN33BAOXIU3CLP","short_pith_number":"pith:JJXKPMML","schema_version":"1.0","canonical_sha256":"4a6ea7b18bf80df8377b081d7453625be160263f9d788b03a8e1ac6b2ae23ecd","source":{"kind":"arxiv","id":"1804.01949","version":1},"attestation_state":"computed","paper":{"title":"Paired many-to-many 2-disjoint path cover of balanced hypercubes with faulty edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huazhong L\\\"u","submitted_at":"2018-04-05T16:51:08Z","abstract_excerpt":"As a variant of the well-known hypercube, the balanced hypercube $BH_n$ was proposed as a novel interconnection network topology for parallel computing. It is known that $BH_n$ is bipartite. Assume that $S=\\{s_1,s_2\\}$ and $T=\\{t_1,t_2\\}$ are any two sets of two vertices in different partite sets of $BH_n$ ($n\\geq1$). It has been proved that there exist two vertex-disjoint $s_1,t_1$-path and $s_2,t_2$-path of $BH_n$ covering all vertices of it. In this paper, we prove that there always exist two vertex-disjoint $s_1,t_1$-path and $s_2,t_2$-path covering all vertices of $BH_n$ with at most $2n-"},"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":"1804.01949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-05T16:51:08Z","cross_cats_sorted":[],"title_canon_sha256":"164a54adf57058a626f59e0b6e98a77ebfa6420c9af68a4c6d0f25021974f542","abstract_canon_sha256":"1eac985eac5aa2dd2a2701eb4fa497cbd12a391809a982c1e6ef499770c569f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:09.461534Z","signature_b64":"iK4zGuNmvlbPMMGeGLguJ8WPsuB4keSZkCZfL8NWMH3CGWBPPhWYf6dwxTtznLZntHHSlcZDfDZBsx6flHP2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a6ea7b18bf80df8377b081d7453625be160263f9d788b03a8e1ac6b2ae23ecd","last_reissued_at":"2026-05-18T00:19:09.460897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:09.460897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Paired many-to-many 2-disjoint path cover of balanced hypercubes with faulty edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huazhong L\\\"u","submitted_at":"2018-04-05T16:51:08Z","abstract_excerpt":"As a variant of the well-known hypercube, the balanced hypercube $BH_n$ was proposed as a novel interconnection network topology for parallel computing. It is known that $BH_n$ is bipartite. Assume that $S=\\{s_1,s_2\\}$ and $T=\\{t_1,t_2\\}$ are any two sets of two vertices in different partite sets of $BH_n$ ($n\\geq1$). It has been proved that there exist two vertex-disjoint $s_1,t_1$-path and $s_2,t_2$-path of $BH_n$ covering all vertices of it. In this paper, we prove that there always exist two vertex-disjoint $s_1,t_1$-path and $s_2,t_2$-path covering all vertices of $BH_n$ with at most $2n-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01949","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":"1804.01949","created_at":"2026-05-18T00:19:09.460988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01949v1","created_at":"2026-05-18T00:19:09.460988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01949","created_at":"2026-05-18T00:19:09.460988+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJXKPMML7AG7","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJXKPMML7AG7QN33","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJXKPMML","created_at":"2026-05-18T12:32:31.084164+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/JJXKPMML7AG7QN33BAOXIU3CLP","json":"https://pith.science/pith/JJXKPMML7AG7QN33BAOXIU3CLP.json","graph_json":"https://pith.science/api/pith-number/JJXKPMML7AG7QN33BAOXIU3CLP/graph.json","events_json":"https://pith.science/api/pith-number/JJXKPMML7AG7QN33BAOXIU3CLP/events.json","paper":"https://pith.science/paper/JJXKPMML"},"agent_actions":{"view_html":"https://pith.science/pith/JJXKPMML7AG7QN33BAOXIU3CLP","download_json":"https://pith.science/pith/JJXKPMML7AG7QN33BAOXIU3CLP.json","view_paper":"https://pith.science/paper/JJXKPMML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01949&json=true","fetch_graph":"https://pith.science/api/pith-number/JJXKPMML7AG7QN33BAOXIU3CLP/graph.json","fetch_events":"https://pith.science/api/pith-number/JJXKPMML7AG7QN33BAOXIU3CLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJXKPMML7AG7QN33BAOXIU3CLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJXKPMML7AG7QN33BAOXIU3CLP/action/storage_attestation","attest_author":"https://pith.science/pith/JJXKPMML7AG7QN33BAOXIU3CLP/action/author_attestation","sign_citation":"https://pith.science/pith/JJXKPMML7AG7QN33BAOXIU3CLP/action/citation_signature","submit_replication":"https://pith.science/pith/JJXKPMML7AG7QN33BAOXIU3CLP/action/replication_record"}},"created_at":"2026-05-18T00:19:09.460988+00:00","updated_at":"2026-05-18T00:19:09.460988+00:00"}