{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TQPWRAF4OZN23BI7K5UGCGQ4XR","short_pith_number":"pith:TQPWRAF4","schema_version":"1.0","canonical_sha256":"9c1f6880bc765bad851f5768611a1cbc58a24e98e1808daac6673948d7658191","source":{"kind":"arxiv","id":"1312.1880","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.1880","created_at":"2026-05-18T03:05:19.546619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1880v1","created_at":"2026-05-18T03:05:19.546619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1880","created_at":"2026-05-18T03:05:19.546619+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQPWRAF4OZN2","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQPWRAF4OZN23BI7","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQPWRAF4","created_at":"2026-05-18T12:28:02.375192+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/TQPWRAF4OZN23BI7K5UGCGQ4XR","json":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR.json","graph_json":"https://pith.science/api/pith-number/TQPWRAF4OZN23BI7K5UGCGQ4XR/graph.json","events_json":"https://pith.science/api/pith-number/TQPWRAF4OZN23BI7K5UGCGQ4XR/events.json","paper":"https://pith.science/paper/TQPWRAF4"},"agent_actions":{"view_html":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR","download_json":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR.json","view_paper":"https://pith.science/paper/TQPWRAF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1880&json=true","fetch_graph":"https://pith.science/api/pith-number/TQPWRAF4OZN23BI7K5UGCGQ4XR/graph.json","fetch_events":"https://pith.science/api/pith-number/TQPWRAF4OZN23BI7K5UGCGQ4XR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/action/storage_attestation","attest_author":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/action/author_attestation","sign_citation":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/action/citation_signature","submit_replication":"https://pith.science/pith/TQPWRAF4OZN23BI7K5UGCGQ4XR/action/replication_record"}},"created_at":"2026-05-18T03:05:19.546619+00:00","updated_at":"2026-05-18T03:05:19.546619+00:00"}