{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GI3LSULSVQQXNO2ISWMMV443XZ","short_pith_number":"pith:GI3LSULS","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"},"canonical_sha256":"3236b95172ac2176bb489598caf39bbe53573a7551f2df55bdcf45a7cf1c47fd","source":{"kind":"arxiv","id":"1204.4252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4252","created_at":"2026-05-18T03:57:28Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4252v1","created_at":"2026-05-18T03:57:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4252","created_at":"2026-05-18T03:57:28Z"},{"alias_kind":"pith_short_12","alias_value":"GI3LSULSVQQX","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GI3LSULSVQQXNO2I","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GI3LSULS","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GI3LSULSVQQXNO2ISWMMV443XZ","target":"record","payload":{"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"},"canonical_sha256":"3236b95172ac2176bb489598caf39bbe53573a7551f2df55bdcf45a7cf1c47fd","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"},"source_kind":"arxiv","source_id":"1204.4252","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:57:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQXbWc1AMfyIUB1ddxZz16YEf/Rw1xkvmiuhGFbDASStkuSyKCN74op8/rpTY3OUwU9GnC2Yvyw8rTNgtuGAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:16:56.618351Z"},"content_sha256":"46af2c5351df86f713ab40306f97c7f25fdf30ae66d882f03f290a0e469adf3a","schema_version":"1.0","event_id":"sha256:46af2c5351df86f713ab40306f97c7f25fdf30ae66d882f03f290a0e469adf3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GI3LSULSVQQXNO2ISWMMV443XZ","target":"graph","payload":{"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"},"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:57:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gGvE+HlPg6nKJXLFC+YQDARSD1silt+fC58EfL4TH1gUabEuMTWqBz+TtHVOud/rLl826p/x09N6a8mEbBIFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:16:56.619019Z"},"content_sha256":"6f549b55f962471999986b61cb155383780e6d0cf239e626a774bb9f0da718d0","schema_version":"1.0","event_id":"sha256:6f549b55f962471999986b61cb155383780e6d0cf239e626a774bb9f0da718d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ/bundle.json","state_url":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GI3LSULSVQQXNO2ISWMMV443XZ/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-05-27T03:16:56Z","links":{"resolver":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ","bundle":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ/bundle.json","state":"https://pith.science/pith/GI3LSULSVQQXNO2ISWMMV443XZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GI3LSULSVQQXNO2ISWMMV443XZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GI3LSULSVQQXNO2ISWMMV443XZ","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":"3777c150eb646a5ad32cb317f08edc8391c393d9cd4408f787d44bbbc4282a68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-19T05:19:57Z","title_canon_sha256":"1753580d6f1619b704fabf911ff80b68c7dc703cb924b2a4cdd2ba0e8cd90bd6"},"schema_version":"1.0","source":{"id":"1204.4252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4252","created_at":"2026-05-18T03:57:28Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4252v1","created_at":"2026-05-18T03:57:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4252","created_at":"2026-05-18T03:57:28Z"},{"alias_kind":"pith_short_12","alias_value":"GI3LSULSVQQX","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GI3LSULSVQQXNO2I","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GI3LSULS","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:6f549b55f962471999986b61cb155383780e6d0cf239e626a774bb9f0da718d0","target":"graph","created_at":"2026-05-18T03:57:28Z","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 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.","authors_text":"Bin Liu, Jun-Ming Xu, Meijie Ma, Xiang-jun Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-19T05:19:57Z","title":"Many-to-many disjoint paths in hypercubes with faulty vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4252","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:46af2c5351df86f713ab40306f97c7f25fdf30ae66d882f03f290a0e469adf3a","target":"record","created_at":"2026-05-18T03:57:28Z","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":"3777c150eb646a5ad32cb317f08edc8391c393d9cd4408f787d44bbbc4282a68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-19T05:19:57Z","title_canon_sha256":"1753580d6f1619b704fabf911ff80b68c7dc703cb924b2a4cdd2ba0e8cd90bd6"},"schema_version":"1.0","source":{"id":"1204.4252","kind":"arxiv","version":1}},"canonical_sha256":"3236b95172ac2176bb489598caf39bbe53573a7551f2df55bdcf45a7cf1c47fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3236b95172ac2176bb489598caf39bbe53573a7551f2df55bdcf45a7cf1c47fd","first_computed_at":"2026-05-18T03:57:28.015827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:28.015827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"amzUm/zkxh3ptiEmvWSV5ZuSzQrVN/AOKHaE5WykDVzLO3ePtb8orEPoOr0l+gxaW9UyzCLtKxESEQPzrh/4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:28.016541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46af2c5351df86f713ab40306f97c7f25fdf30ae66d882f03f290a0e469adf3a","sha256:6f549b55f962471999986b61cb155383780e6d0cf239e626a774bb9f0da718d0"],"state_sha256":"99d5a3a2e60cbe8155f063531ce9a5549a28a7eaad63313ded6f133b5f6b31ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGpjedQtcY1cLh8zKaBwOZk7fHPyjtwo4oZE42z9/Ha9dCr3TN7HVjSHlRt7XBTD6u/aBxsCP89YOQP3wB9xCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:16:56.622416Z","bundle_sha256":"f0b20a0e26fb56f5c6e323135af4c8ac9405a79480ed75254719c5efaf3aadca"}}