{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CDQAWZ5RBW3IJVSMDXNTVNG7O6","short_pith_number":"pith:CDQAWZ5R","schema_version":"1.0","canonical_sha256":"10e00b67b10db684d64c1ddb3ab4df77b42d52d409b0179f15b831601d39fd53","source":{"kind":"arxiv","id":"1802.01049","version":1},"attestation_state":"computed","paper":{"title":"Blind Joint MIMO Channel Estimation and Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"eess.SP","authors_text":"Andrea J. Goldsmith, Mary Wootters, Thomas R. Dean","submitted_at":"2018-02-03T23:40:26Z","abstract_excerpt":"We propose a method for MIMO decoding when channel state information (CSI) is unknown to both the transmitter and receiver. The proposed method requires some structure in the transmitted signal for the decoding to be effective, in particular that the underlying sources are drawn from a hypercubic space. Our proposed technique fits a minimum volume parallelepiped to the received samples. This problem can be expressed as a non-convex optimization problem that can be solved with high probability by gradient descent. Our blind decoding algorithm can be used when communicating over unknown MIMO wir"},"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":"1802.01049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-03T23:40:26Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"956ef3b14d5881a6d7200cfe506ccf3f0f6d92b42b73b000903303996f3e9f61","abstract_canon_sha256":"3a2f02014cf9ae21d400122796f302f6f3b256d805a9fd5f9b7f4c9b08ccbb59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:27.513037Z","signature_b64":"umw1fU+HeA3AMSseskJdH1C06SxSJDMhc7u9b06AV32HGCI75aIp7CwoXbWFwtBCXRIyVkoi8SErnu5cg1WWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10e00b67b10db684d64c1ddb3ab4df77b42d52d409b0179f15b831601d39fd53","last_reissued_at":"2026-05-18T00:24:27.512442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:27.512442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blind Joint MIMO Channel Estimation and Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"eess.SP","authors_text":"Andrea J. Goldsmith, Mary Wootters, Thomas R. Dean","submitted_at":"2018-02-03T23:40:26Z","abstract_excerpt":"We propose a method for MIMO decoding when channel state information (CSI) is unknown to both the transmitter and receiver. The proposed method requires some structure in the transmitted signal for the decoding to be effective, in particular that the underlying sources are drawn from a hypercubic space. Our proposed technique fits a minimum volume parallelepiped to the received samples. This problem can be expressed as a non-convex optimization problem that can be solved with high probability by gradient descent. Our blind decoding algorithm can be used when communicating over unknown MIMO wir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01049","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":"1802.01049","created_at":"2026-05-18T00:24:27.512538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01049v1","created_at":"2026-05-18T00:24:27.512538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01049","created_at":"2026-05-18T00:24:27.512538+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDQAWZ5RBW3I","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDQAWZ5RBW3IJVSM","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDQAWZ5R","created_at":"2026-05-18T12:32:16.446611+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/CDQAWZ5RBW3IJVSMDXNTVNG7O6","json":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6.json","graph_json":"https://pith.science/api/pith-number/CDQAWZ5RBW3IJVSMDXNTVNG7O6/graph.json","events_json":"https://pith.science/api/pith-number/CDQAWZ5RBW3IJVSMDXNTVNG7O6/events.json","paper":"https://pith.science/paper/CDQAWZ5R"},"agent_actions":{"view_html":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6","download_json":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6.json","view_paper":"https://pith.science/paper/CDQAWZ5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01049&json=true","fetch_graph":"https://pith.science/api/pith-number/CDQAWZ5RBW3IJVSMDXNTVNG7O6/graph.json","fetch_events":"https://pith.science/api/pith-number/CDQAWZ5RBW3IJVSMDXNTVNG7O6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/action/storage_attestation","attest_author":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/action/author_attestation","sign_citation":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/action/citation_signature","submit_replication":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/action/replication_record"}},"created_at":"2026-05-18T00:24:27.512538+00:00","updated_at":"2026-05-18T00:24:27.512538+00:00"}