{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CDQAWZ5RBW3IJVSMDXNTVNG7O6","short_pith_number":"pith:CDQAWZ5R","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"},"canonical_sha256":"10e00b67b10db684d64c1ddb3ab4df77b42d52d409b0179f15b831601d39fd53","source":{"kind":"arxiv","id":"1802.01049","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01049","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01049v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01049","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"CDQAWZ5RBW3I","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CDQAWZ5RBW3IJVSM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CDQAWZ5R","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CDQAWZ5RBW3IJVSMDXNTVNG7O6","target":"record","payload":{"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"},"canonical_sha256":"10e00b67b10db684d64c1ddb3ab4df77b42d52d409b0179f15b831601d39fd53","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"},"source_kind":"arxiv","source_id":"1802.01049","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iWNcJJZzZtfHwtY9nui7illgwuhXFZFa73zCwyNIUJ+v8c97MonKBNdngfeFztHm5PDBTwTEyZqXWPRT1ZBfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:02:49.486422Z"},"content_sha256":"1a35121afa23bd31ec6af1d774dcd0c6b883b76a432fe361f19630d9b9692a73","schema_version":"1.0","event_id":"sha256:1a35121afa23bd31ec6af1d774dcd0c6b883b76a432fe361f19630d9b9692a73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CDQAWZ5RBW3IJVSMDXNTVNG7O6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pa3f9L2wJLtQReHFQV+t9dlCL6cNTwn+vOnHal12EUI06wrlXH+YHcmfSVxyuvB13JIqWri7XlvCOR8mHXSzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:02:49.487155Z"},"content_sha256":"c016fd063d1966d4f14eade33dd3f90a128c356e82fec86ac9a78a06db6fc25b","schema_version":"1.0","event_id":"sha256:c016fd063d1966d4f14eade33dd3f90a128c356e82fec86ac9a78a06db6fc25b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/bundle.json","state_url":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T11:02:49Z","links":{"resolver":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6","bundle":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/bundle.json","state":"https://pith.science/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CDQAWZ5RBW3IJVSMDXNTVNG7O6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CDQAWZ5RBW3IJVSMDXNTVNG7O6","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":"3a2f02014cf9ae21d400122796f302f6f3b256d805a9fd5f9b7f4c9b08ccbb59","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-03T23:40:26Z","title_canon_sha256":"956ef3b14d5881a6d7200cfe506ccf3f0f6d92b42b73b000903303996f3e9f61"},"schema_version":"1.0","source":{"id":"1802.01049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01049","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01049v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01049","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"CDQAWZ5RBW3I","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CDQAWZ5RBW3IJVSM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CDQAWZ5R","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:c016fd063d1966d4f14eade33dd3f90a128c356e82fec86ac9a78a06db6fc25b","target":"graph","created_at":"2026-05-18T00:24:27Z","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 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","authors_text":"Andrea J. Goldsmith, Mary Wootters, Thomas R. Dean","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-03T23:40:26Z","title":"Blind Joint MIMO Channel Estimation and Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01049","kind":"arxiv","version":1},"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:1a35121afa23bd31ec6af1d774dcd0c6b883b76a432fe361f19630d9b9692a73","target":"record","created_at":"2026-05-18T00:24:27Z","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":"3a2f02014cf9ae21d400122796f302f6f3b256d805a9fd5f9b7f4c9b08ccbb59","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-03T23:40:26Z","title_canon_sha256":"956ef3b14d5881a6d7200cfe506ccf3f0f6d92b42b73b000903303996f3e9f61"},"schema_version":"1.0","source":{"id":"1802.01049","kind":"arxiv","version":1}},"canonical_sha256":"10e00b67b10db684d64c1ddb3ab4df77b42d52d409b0179f15b831601d39fd53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10e00b67b10db684d64c1ddb3ab4df77b42d52d409b0179f15b831601d39fd53","first_computed_at":"2026-05-18T00:24:27.512442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:27.512442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"umw1fU+HeA3AMSseskJdH1C06SxSJDMhc7u9b06AV32HGCI75aIp7CwoXbWFwtBCXRIyVkoi8SErnu5cg1WWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:27.513037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a35121afa23bd31ec6af1d774dcd0c6b883b76a432fe361f19630d9b9692a73","sha256:c016fd063d1966d4f14eade33dd3f90a128c356e82fec86ac9a78a06db6fc25b"],"state_sha256":"c195f23b70f19752052c05fb0b2dd8e3aeea5e9e268c32f67d679c619b1d6c37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBR1X6kF+JMMRP25kOpDzLafJDBmOT5p2fOqZOv59H+o3FLK197bu7zzKDLPhU55pM3ZSFhvThAFODUsw4DKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T11:02:49.490549Z","bundle_sha256":"2227334d76c53678ab280fa6bdc004dcd282ac05091a07664fefd8291f06e1fa"}}