{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZIAJLDYXSOLIDQRIWZWQ3PK2MP","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":"4d09b3a698b0d6b7c28acf771aba13b0dc047f7c406f081f6d35f537c06385bc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-18T01:24:46Z","title_canon_sha256":"1b55c0c2ab3460aebd98fb85b3eb423b23490c9192de52cf751f729f7df375f8"},"schema_version":"1.0","source":{"id":"1810.07856","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07856","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07856v2","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07856","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZIAJLDYXSOLI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZIAJLDYXSOLIDQRI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZIAJLDYX","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:173c50af6f5b6536172e0d555de8c44cbbee25d135f0cfb2afca8dc6687d6ae8","target":"graph","created_at":"2026-05-17T23:46:41Z","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 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","authors_text":"Andrea Goldsmith, Jonathan Perlstein, Mary Wootters, Thomas Dean","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-18T01:24:46Z","title":"Fast Blind MIMO Decoding through Vertex Hopping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07856","kind":"arxiv","version":2},"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:4c2947c702e7060ddb56459e8d28f9b00dcc731c1bddd03bce0da4099d4ff471","target":"record","created_at":"2026-05-17T23:46:41Z","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":"4d09b3a698b0d6b7c28acf771aba13b0dc047f7c406f081f6d35f537c06385bc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-18T01:24:46Z","title_canon_sha256":"1b55c0c2ab3460aebd98fb85b3eb423b23490c9192de52cf751f729f7df375f8"},"schema_version":"1.0","source":{"id":"1810.07856","kind":"arxiv","version":2}},"canonical_sha256":"ca00958f17939681c228b66d0dbd5a63ed15c8c3455d86885d375996d5c1765c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca00958f17939681c228b66d0dbd5a63ed15c8c3455d86885d375996d5c1765c","first_computed_at":"2026-05-17T23:46:41.523657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:41.523657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"++yiU1FXWmFIlxy+VvZIJXn0sAGVz1AVyOUyLjj/Fb+z/kSGd14/BfL9jD6GSTtcvO7wg24KWhUmXNsf4IRCDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:41.524263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07856","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c2947c702e7060ddb56459e8d28f9b00dcc731c1bddd03bce0da4099d4ff471","sha256:173c50af6f5b6536172e0d555de8c44cbbee25d135f0cfb2afca8dc6687d6ae8"],"state_sha256":"6edfe567a0bc2759655d2999f3d6c0ea22a1b2ad63cfa28db36175f3596a9e2b"}