{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GI3LSULSVQQXNO2ISWMMV443XZ","short_pith_number":"pith:GI3LSULS","schema_version":"1.0","canonical_sha256":"3236b95172ac2176bb489598caf39bbe53573a7551f2df55bdcf45a7cf1c47fd","source":{"kind":"arxiv","id":"1204.4252","version":1},"attestation_state":"computed","paper":{"title":"Many-to-many disjoint paths in hypercubes with faulty vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Liu, Jun-Ming Xu, Meijie Ma, Xiang-jun Li","submitted_at":"2012-04-19T05:19:57Z","abstract_excerpt":"This paper considers the problem of many-to-many disjoint paths in the hypercube $Q_n$ with $f$ faulty vertices and obtains the following result. For any integer $k$ with $1\\leq k\\leq n-2$, any two sets $S$ and $T$ of $k$ fault-free vertices in different parts of $Q_n\\ (n\\geq 3)$, if $f\\leq 2n-2k-3$ and each fault-free vertex has at least two fault-free neighbors, then there exist $k$ fully disjoint fault-free paths linking $S$ and $T$ which contain at least $2^n-2f$ vertices. This result improves some known results in a sense."},"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":"1204.4252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-19T05:19:57Z","cross_cats_sorted":[],"title_canon_sha256":"1753580d6f1619b704fabf911ff80b68c7dc703cb924b2a4cdd2ba0e8cd90bd6","abstract_canon_sha256":"3777c150eb646a5ad32cb317f08edc8391c393d9cd4408f787d44bbbc4282a68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:28.016541Z","signature_b64":"amzUm/zkxh3ptiEmvWSV5ZuSzQrVN/AOKHaE5WykDVzLO3ePtb8orEPoOr0l+gxaW9UyzCLtKxESEQPzrh/4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3236b95172ac2176bb489598caf39bbe53573a7551f2df55bdcf45a7cf1c47fd","last_reissued_at":"2026-05-18T03:57:28.015827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:28.015827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Many-to-many disjoint paths in hypercubes with faulty vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Liu, Jun-Ming Xu, Meijie Ma, Xiang-jun Li","submitted_at":"2012-04-19T05:19:57Z","abstract_excerpt":"This paper considers the problem of many-to-many disjoint paths in the hypercube $Q_n$ with $f$ faulty vertices and obtains the following result. For any integer $k$ with $1\\leq k\\leq n-2$, any two sets $S$ and $T$ of $k$ fault-free vertices in different parts of $Q_n\\ (n\\geq 3)$, if $f\\leq 2n-2k-3$ and each fault-free vertex has at least two fault-free neighbors, then there exist $k$ fully disjoint fault-free paths linking $S$ and $T$ which contain at least $2^n-2f$ vertices. This result improves some known results in a sense."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4252","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":"1204.4252","created_at":"2026-05-18T03:57:28.015941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4252v1","created_at":"2026-05-18T03:57:28.015941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4252","created_at":"2026-05-18T03:57:28.015941+00:00"},{"alias_kind":"pith_short_12","alias_value":"GI3LSULSVQQX","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GI3LSULSVQQXNO2I","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GI3LSULS","created_at":"2026-05-18T12:27:06.952714+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/GI3LSULSVQQXNO2ISWMMV443XZ","json":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ.json","graph_json":"https://pith.science/api/pith-number/GI3LSULSVQQXNO2ISWMMV443XZ/graph.json","events_json":"https://pith.science/api/pith-number/GI3LSULSVQQXNO2ISWMMV443XZ/events.json","paper":"https://pith.science/paper/GI3LSULS"},"agent_actions":{"view_html":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ","download_json":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ.json","view_paper":"https://pith.science/paper/GI3LSULS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4252&json=true","fetch_graph":"https://pith.science/api/pith-number/GI3LSULSVQQXNO2ISWMMV443XZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GI3LSULSVQQXNO2ISWMMV443XZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ/action/storage_attestation","attest_author":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ/action/author_attestation","sign_citation":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ/action/citation_signature","submit_replication":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ/action/replication_record"}},"created_at":"2026-05-18T03:57:28.015941+00:00","updated_at":"2026-05-18T03:57:28.015941+00:00"}