{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TQPWRAF4OZN23BI7K5UGCGQ4XR","short_pith_number":"pith:TQPWRAF4","canonical_record":{"source":{"id":"1312.1880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T15:05:57Z","cross_cats_sorted":[],"title_canon_sha256":"3c4e852927fc8ac290937ade78f9c46c2120bed77b45151d616f493f65bf4306","abstract_canon_sha256":"25a48595a89a0c530a879a94a3fc046f7ba6da4c63fae35fc709953baa0c3de5"},"schema_version":"1.0"},"canonical_sha256":"9c1f6880bc765bad851f5768611a1cbc58a24e98e1808daac6673948d7658191","source":{"kind":"arxiv","id":"1312.1880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1880","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1880v1","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1880","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"TQPWRAF4OZN2","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TQPWRAF4OZN23BI7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TQPWRAF4","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TQPWRAF4OZN23BI7K5UGCGQ4XR","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T15:05:57Z","cross_cats_sorted":[],"title_canon_sha256":"3c4e852927fc8ac290937ade78f9c46c2120bed77b45151d616f493f65bf4306","abstract_canon_sha256":"25a48595a89a0c530a879a94a3fc046f7ba6da4c63fae35fc709953baa0c3de5"},"schema_version":"1.0"},"canonical_sha256":"9c1f6880bc765bad851f5768611a1cbc58a24e98e1808daac6673948d7658191","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:19.547053Z","signature_b64":"3yUTv9o55lT+h+0+mFzoAH5P26qRe0YXfPkM7bGB5aWLjJB20+6u6GHO137VDgsX+yAHLeXJq9b3z2EtoeL4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c1f6880bc765bad851f5768611a1cbc58a24e98e1808daac6673948d7658191","last_reissued_at":"2026-05-18T03:05:19.546525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:19.546525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1880","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:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HrtFOu+Sozrx5xJ8AApipymN271rZGqMFOfazoPN/0WDFOsdGNzH/O41C/cVSdnDZTx8utU+NElv9fRKnd2zCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:44:15.915375Z"},"content_sha256":"653cb7bc953b7d6fb39e462a86ed35d5f066eaa82b4cdeb6e7b89622b13928d5","schema_version":"1.0","event_id":"sha256:653cb7bc953b7d6fb39e462a86ed35d5f066eaa82b4cdeb6e7b89622b13928d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TQPWRAF4OZN23BI7K5UGCGQ4XR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Path coverings with prescribed ends in faulty hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ivan S. Gotchev, Nelson Casta\\~neda","submitted_at":"2013-12-06T15:05:57Z","abstract_excerpt":"We discuss the existence of vertex disjoint path coverings with prescribed ends for the $n$-dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path coverings we establish the minimal integer $m$ such that for every $n \\ge m$ such path coverings exist. Using some of these results, for $k \\le 4$, we prove Locke's conjecture that a hypercube with $k$ deleted vertices of each parity is Hamiltonian if $n \\ge k +2.$ Some of our lemmas substantially generalize known results of I. Havel and T. Dvo\\v{r}\\'{a}k. At th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1880","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:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1RDXoNgzL26PuPcJNmtkHy/Z/OfFcBgrmw66vQnJsYyDO4FBZIgjlfkWdogukPTz/ajyDNKnVVwnzx9dFemgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:44:15.915723Z"},"content_sha256":"2892162c70cce3d306d10e9d5826e2a136d49345939693b879bace5745230cc8","schema_version":"1.0","event_id":"sha256:2892162c70cce3d306d10e9d5826e2a136d49345939693b879bace5745230cc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/bundle.json","state_url":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/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-06-20T09:44:15Z","links":{"resolver":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR","bundle":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/bundle.json","state":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TQPWRAF4OZN23BI7K5UGCGQ4XR","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":"25a48595a89a0c530a879a94a3fc046f7ba6da4c63fae35fc709953baa0c3de5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T15:05:57Z","title_canon_sha256":"3c4e852927fc8ac290937ade78f9c46c2120bed77b45151d616f493f65bf4306"},"schema_version":"1.0","source":{"id":"1312.1880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1880","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1880v1","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1880","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"TQPWRAF4OZN2","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TQPWRAF4OZN23BI7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TQPWRAF4","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:2892162c70cce3d306d10e9d5826e2a136d49345939693b879bace5745230cc8","target":"graph","created_at":"2026-05-18T03:05:19Z","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":"We discuss the existence of vertex disjoint path coverings with prescribed ends for the $n$-dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path coverings we establish the minimal integer $m$ such that for every $n \\ge m$ such path coverings exist. Using some of these results, for $k \\le 4$, we prove Locke's conjecture that a hypercube with $k$ deleted vertices of each parity is Hamiltonian if $n \\ge k +2.$ Some of our lemmas substantially generalize known results of I. Havel and T. Dvo\\v{r}\\'{a}k. At th","authors_text":"Ivan S. Gotchev, Nelson Casta\\~neda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T15:05:57Z","title":"Path coverings with prescribed ends in faulty hypercubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1880","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:653cb7bc953b7d6fb39e462a86ed35d5f066eaa82b4cdeb6e7b89622b13928d5","target":"record","created_at":"2026-05-18T03:05:19Z","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":"25a48595a89a0c530a879a94a3fc046f7ba6da4c63fae35fc709953baa0c3de5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T15:05:57Z","title_canon_sha256":"3c4e852927fc8ac290937ade78f9c46c2120bed77b45151d616f493f65bf4306"},"schema_version":"1.0","source":{"id":"1312.1880","kind":"arxiv","version":1}},"canonical_sha256":"9c1f6880bc765bad851f5768611a1cbc58a24e98e1808daac6673948d7658191","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c1f6880bc765bad851f5768611a1cbc58a24e98e1808daac6673948d7658191","first_computed_at":"2026-05-18T03:05:19.546525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:19.546525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3yUTv9o55lT+h+0+mFzoAH5P26qRe0YXfPkM7bGB5aWLjJB20+6u6GHO137VDgsX+yAHLeXJq9b3z2EtoeL4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:19.547053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:653cb7bc953b7d6fb39e462a86ed35d5f066eaa82b4cdeb6e7b89622b13928d5","sha256:2892162c70cce3d306d10e9d5826e2a136d49345939693b879bace5745230cc8"],"state_sha256":"a2964fc834a8a4652cd6ad18e3e398874ba0d4bd120157da086f91858e644624"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OEu023IEMRJT0NhoTk5IIDc+6Od6ig/syLOLtdis+fLHJMsyuUwysgPnkUJH/x6+JGuT+RWOv/sz6v3IwfupDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:44:15.917803Z","bundle_sha256":"6ba89d2ee79517fa5150165cc5f80d9064a09a52fc1daf91135767d1a401354e"}}