{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WMANRHXJR4EK4MKT6B7FEZN7YW","short_pith_number":"pith:WMANRHXJ","schema_version":"1.0","canonical_sha256":"b300d89ee98f08ae3153f07e5265bfc5b2502e06e0f9f07fcb4cde8524ccb695","source":{"kind":"arxiv","id":"1605.09038","version":2},"attestation_state":"computed","paper":{"title":"Quickest Sequence Phase Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lele Wang, Ofer Shayevitz, Sihuang Hu","submitted_at":"2016-05-29T17:42:57Z","abstract_excerpt":"A phase detection sequence is a length-$n$ cyclic sequence, such that the location of any length-$k$ contiguous subsequence can be determined from a noisy observation of that subsequence. In this paper, we derive bounds on the minimal possible $k$ in the limit of $n\\to\\infty$, and describe some sequence constructions. We further consider multiple phase detection sequences, where the location of any length-$k$ contiguous subsequence of each sequence can be determined simultaneously from a noisy mixture of those subsequences. We study the optimal trade-offs between the lengths of the sequences, "},"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":"1605.09038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-29T17:42:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"665cd9ffd9cd1c801c7b5d1d69770d1c0067e07d0da2b87aa2fd7f80536f6d4d","abstract_canon_sha256":"1c6db4fe4c421dafaccd7a62716eed8205360d3339e2819c1b322e752be5d023"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:31.127205Z","signature_b64":"N1tTZ0jpXvwV/HqSaBE5BAHTQ5AuYW7boImlq8Vn5LzDYYOdAO7cbo8EeXKhWs+PChfkOqCSyRnqYieUFCSXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b300d89ee98f08ae3153f07e5265bfc5b2502e06e0f9f07fcb4cde8524ccb695","last_reissued_at":"2026-05-18T00:15:31.126484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:31.126484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quickest Sequence Phase Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lele Wang, Ofer Shayevitz, Sihuang Hu","submitted_at":"2016-05-29T17:42:57Z","abstract_excerpt":"A phase detection sequence is a length-$n$ cyclic sequence, such that the location of any length-$k$ contiguous subsequence can be determined from a noisy observation of that subsequence. In this paper, we derive bounds on the minimal possible $k$ in the limit of $n\\to\\infty$, and describe some sequence constructions. We further consider multiple phase detection sequences, where the location of any length-$k$ contiguous subsequence of each sequence can be determined simultaneously from a noisy mixture of those subsequences. We study the optimal trade-offs between the lengths of the sequences, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09038","kind":"arxiv","version":2},"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":"1605.09038","created_at":"2026-05-18T00:15:31.126597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.09038v2","created_at":"2026-05-18T00:15:31.126597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09038","created_at":"2026-05-18T00:15:31.126597+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMANRHXJR4EK","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMANRHXJR4EK4MKT","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMANRHXJ","created_at":"2026-05-18T12:30:48.956258+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/WMANRHXJR4EK4MKT6B7FEZN7YW","json":"https://pith.science/pith/WMANRHXJR4EK4MKT6B7FEZN7YW.json","graph_json":"https://pith.science/api/pith-number/WMANRHXJR4EK4MKT6B7FEZN7YW/graph.json","events_json":"https://pith.science/api/pith-number/WMANRHXJR4EK4MKT6B7FEZN7YW/events.json","paper":"https://pith.science/paper/WMANRHXJ"},"agent_actions":{"view_html":"https://pith.science/pith/WMANRHXJR4EK4MKT6B7FEZN7YW","download_json":"https://pith.science/pith/WMANRHXJR4EK4MKT6B7FEZN7YW.json","view_paper":"https://pith.science/paper/WMANRHXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.09038&json=true","fetch_graph":"https://pith.science/api/pith-number/WMANRHXJR4EK4MKT6B7FEZN7YW/graph.json","fetch_events":"https://pith.science/api/pith-number/WMANRHXJR4EK4MKT6B7FEZN7YW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMANRHXJR4EK4MKT6B7FEZN7YW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMANRHXJR4EK4MKT6B7FEZN7YW/action/storage_attestation","attest_author":"https://pith.science/pith/WMANRHXJR4EK4MKT6B7FEZN7YW/action/author_attestation","sign_citation":"https://pith.science/pith/WMANRHXJR4EK4MKT6B7FEZN7YW/action/citation_signature","submit_replication":"https://pith.science/pith/WMANRHXJR4EK4MKT6B7FEZN7YW/action/replication_record"}},"created_at":"2026-05-18T00:15:31.126597+00:00","updated_at":"2026-05-18T00:15:31.126597+00:00"}