{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z5N36T3WVEXHMPTWWV43WBH3QP","short_pith_number":"pith:Z5N36T3W","schema_version":"1.0","canonical_sha256":"cf5bbf4f76a92e763e76b579bb04fb83dd343f30e1b087a1bcbb9b938f4d5dbd","source":{"kind":"arxiv","id":"1701.08111","version":1},"attestation_state":"computed","paper":{"title":"The Hybrid k-Deck Problem: Reconstructing Sequences from Short and Long Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Olgica Milenkovic, Ryan Gabrys","submitted_at":"2017-01-27T16:47:27Z","abstract_excerpt":"We introduce a new variant of the $k$-deck problem, which in its traditional formulation asks for determining the smallest $k$ that allows one to reconstruct any binary sequence of length $n$ from the multiset of its $k$-length subsequences. In our version of the problem, termed the hybrid k-deck problem, one is given a certain number of special subsequences of the sequence of length $n - t$, $t > 0$, and the question of interest is to determine the smallest value of $k$ such that the $k$-deck, along with the subsequences, allows for reconstructing the original sequence in an error-free manner"},"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":"1701.08111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-27T16:47:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"82275cb16b2349608e401d8f5f77d459e3417f8bd3cf5aa247a269224f6602ec","abstract_canon_sha256":"9827d2efbf26b0daf373af5a43354b645f8f797ec02ec5b6b467c248591930ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:58.816584Z","signature_b64":"yJyRr00vQirnPbvvoaKWkhgEP6e6x0GYKjCXVTWDqwnue6W8u7Uh12IwihZ0/nSLfRH2F5dTJ/geAYdprAGrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf5bbf4f76a92e763e76b579bb04fb83dd343f30e1b087a1bcbb9b938f4d5dbd","last_reissued_at":"2026-05-18T00:51:58.815954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:58.815954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hybrid k-Deck Problem: Reconstructing Sequences from Short and Long Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Olgica Milenkovic, Ryan Gabrys","submitted_at":"2017-01-27T16:47:27Z","abstract_excerpt":"We introduce a new variant of the $k$-deck problem, which in its traditional formulation asks for determining the smallest $k$ that allows one to reconstruct any binary sequence of length $n$ from the multiset of its $k$-length subsequences. In our version of the problem, termed the hybrid k-deck problem, one is given a certain number of special subsequences of the sequence of length $n - t$, $t > 0$, and the question of interest is to determine the smallest value of $k$ such that the $k$-deck, along with the subsequences, allows for reconstructing the original sequence in an error-free manner"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08111","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":"1701.08111","created_at":"2026-05-18T00:51:58.816047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08111v1","created_at":"2026-05-18T00:51:58.816047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08111","created_at":"2026-05-18T00:51:58.816047+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5N36T3WVEXH","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5N36T3WVEXHMPTW","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5N36T3W","created_at":"2026-05-18T12:31:59.375834+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/Z5N36T3WVEXHMPTWWV43WBH3QP","json":"https://pith.science/pith/Z5N36T3WVEXHMPTWWV43WBH3QP.json","graph_json":"https://pith.science/api/pith-number/Z5N36T3WVEXHMPTWWV43WBH3QP/graph.json","events_json":"https://pith.science/api/pith-number/Z5N36T3WVEXHMPTWWV43WBH3QP/events.json","paper":"https://pith.science/paper/Z5N36T3W"},"agent_actions":{"view_html":"https://pith.science/pith/Z5N36T3WVEXHMPTWWV43WBH3QP","download_json":"https://pith.science/pith/Z5N36T3WVEXHMPTWWV43WBH3QP.json","view_paper":"https://pith.science/paper/Z5N36T3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08111&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5N36T3WVEXHMPTWWV43WBH3QP/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5N36T3WVEXHMPTWWV43WBH3QP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5N36T3WVEXHMPTWWV43WBH3QP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5N36T3WVEXHMPTWWV43WBH3QP/action/storage_attestation","attest_author":"https://pith.science/pith/Z5N36T3WVEXHMPTWWV43WBH3QP/action/author_attestation","sign_citation":"https://pith.science/pith/Z5N36T3WVEXHMPTWWV43WBH3QP/action/citation_signature","submit_replication":"https://pith.science/pith/Z5N36T3WVEXHMPTWWV43WBH3QP/action/replication_record"}},"created_at":"2026-05-18T00:51:58.816047+00:00","updated_at":"2026-05-18T00:51:58.816047+00:00"}