{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZIAJLDYXSOLIDQRIWZWQ3PK2MP","short_pith_number":"pith:ZIAJLDYX","schema_version":"1.0","canonical_sha256":"ca00958f17939681c228b66d0dbd5a63ed15c8c3455d86885d375996d5c1765c","source":{"kind":"arxiv","id":"1810.07856","version":2},"attestation_state":"computed","paper":{"title":"Fast Blind MIMO Decoding through Vertex Hopping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"eess.SP","authors_text":"Andrea Goldsmith, Jonathan Perlstein, Mary Wootters, Thomas Dean","submitted_at":"2018-10-18T01:24:46Z","abstract_excerpt":"We present an algorithm that efficiently performs blind decoding of MIMO signals. That is, given no channel state information (CSI) at either the transmitter or receiver, our algorithm takes a block of samples and returns an estimate of the underlying data symbols. In prior work, the problem of blind decoding was formulated as a non-convex optimization problem. In this work, we present an algorithm that efficiently solves this non-convex problem in practical settings. This algorithm leverages concepts of linear and mixed-integer linear programming. Empirically, we show that our technique has a"},"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":"1810.07856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-18T01:24:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1b55c0c2ab3460aebd98fb85b3eb423b23490c9192de52cf751f729f7df375f8","abstract_canon_sha256":"4d09b3a698b0d6b7c28acf771aba13b0dc047f7c406f081f6d35f537c06385bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:41.524263Z","signature_b64":"++yiU1FXWmFIlxy+VvZIJXn0sAGVz1AVyOUyLjj/Fb+z/kSGd14/BfL9jD6GSTtcvO7wg24KWhUmXNsf4IRCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca00958f17939681c228b66d0dbd5a63ed15c8c3455d86885d375996d5c1765c","last_reissued_at":"2026-05-17T23:46:41.523657Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:41.523657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Blind MIMO Decoding through Vertex Hopping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"eess.SP","authors_text":"Andrea Goldsmith, Jonathan Perlstein, Mary Wootters, Thomas Dean","submitted_at":"2018-10-18T01:24:46Z","abstract_excerpt":"We present an algorithm that efficiently performs blind decoding of MIMO signals. That is, given no channel state information (CSI) at either the transmitter or receiver, our algorithm takes a block of samples and returns an estimate of the underlying data symbols. In prior work, the problem of blind decoding was formulated as a non-convex optimization problem. In this work, we present an algorithm that efficiently solves this non-convex problem in practical settings. This algorithm leverages concepts of linear and mixed-integer linear programming. Empirically, we show that our technique has a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07856","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":"1810.07856","created_at":"2026-05-17T23:46:41.523808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07856v2","created_at":"2026-05-17T23:46:41.523808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07856","created_at":"2026-05-17T23:46:41.523808+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIAJLDYXSOLI","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIAJLDYXSOLIDQRI","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIAJLDYX","created_at":"2026-05-18T12:33:07.085635+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/ZIAJLDYXSOLIDQRIWZWQ3PK2MP","json":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP.json","graph_json":"https://pith.science/api/pith-number/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/graph.json","events_json":"https://pith.science/api/pith-number/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/events.json","paper":"https://pith.science/paper/ZIAJLDYX"},"agent_actions":{"view_html":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP","download_json":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP.json","view_paper":"https://pith.science/paper/ZIAJLDYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07856&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/action/storage_attestation","attest_author":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/action/author_attestation","sign_citation":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/action/citation_signature","submit_replication":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/action/replication_record"}},"created_at":"2026-05-17T23:46:41.523808+00:00","updated_at":"2026-05-17T23:46:41.523808+00:00"}