{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2YMZPELALBFF4LXBR5XCP3CEBL","short_pith_number":"pith:2YMZPELA","schema_version":"1.0","canonical_sha256":"d619979160584a5e2ee18f6e27ec440af47391a77ea9dea1f4a0ecd40f9e9295","source":{"kind":"arxiv","id":"1905.09401","version":2},"attestation_state":"computed","paper":{"title":"Optimum Low-Complexity Decoder for Spatial Modulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ertugrul Basar, Ibrahim Al-Nahhal, Octavia A. Dobre, Salama Ikki","submitted_at":"2019-05-22T23:13:27Z","abstract_excerpt":"In this paper, a novel low-complexity detection algorithm for spatial modulation (SM), referred to as the minimum-distance of maximum-length (m-M) algorithm, is proposed and analyzed. The proposed m-M algorithm is a smart searching method that is applied for the SM tree-search decoders. The behavior of the m-M algorithm is studied for three different scenarios: i) perfect channel state information at the receiver side (CSIR), ii) imperfect CSIR of a fixed channel estimation error variance, and iii) imperfect CSIR of a variable channel estimation error variance. Moreover, the complexity of the "},"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":"1905.09401","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-05-22T23:13:27Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"066543d85ea1a9414785879a0353e79e24542ac6fb7bb0808044fc6ce0defa31","abstract_canon_sha256":"b2b01be3cb4cf517da8000f51a3d5a95fffa8dae4f4eed36f237e3f54b9565bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.767171Z","signature_b64":"Phzzl594mXpEcpIBdypFuNYgZ9VII6FKkzMXO+ks6cAHaV6P7+2ahmUWF6Pdj7ujUtpmtAALovZEKRYHKXnCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d619979160584a5e2ee18f6e27ec440af47391a77ea9dea1f4a0ecd40f9e9295","last_reissued_at":"2026-05-17T23:40:10.766551Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.766551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimum Low-Complexity Decoder for Spatial Modulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ertugrul Basar, Ibrahim Al-Nahhal, Octavia A. Dobre, Salama Ikki","submitted_at":"2019-05-22T23:13:27Z","abstract_excerpt":"In this paper, a novel low-complexity detection algorithm for spatial modulation (SM), referred to as the minimum-distance of maximum-length (m-M) algorithm, is proposed and analyzed. The proposed m-M algorithm is a smart searching method that is applied for the SM tree-search decoders. The behavior of the m-M algorithm is studied for three different scenarios: i) perfect channel state information at the receiver side (CSIR), ii) imperfect CSIR of a fixed channel estimation error variance, and iii) imperfect CSIR of a variable channel estimation error variance. Moreover, the complexity of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09401","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":"1905.09401","created_at":"2026-05-17T23:40:10.766645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09401v2","created_at":"2026-05-17T23:40:10.766645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09401","created_at":"2026-05-17T23:40:10.766645+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YMZPELALBFF","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YMZPELALBFF4LXB","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YMZPELA","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/2YMZPELALBFF4LXBR5XCP3CEBL","json":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL.json","graph_json":"https://pith.science/api/pith-number/2YMZPELALBFF4LXBR5XCP3CEBL/graph.json","events_json":"https://pith.science/api/pith-number/2YMZPELALBFF4LXBR5XCP3CEBL/events.json","paper":"https://pith.science/paper/2YMZPELA"},"agent_actions":{"view_html":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL","download_json":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL.json","view_paper":"https://pith.science/paper/2YMZPELA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09401&json=true","fetch_graph":"https://pith.science/api/pith-number/2YMZPELALBFF4LXBR5XCP3CEBL/graph.json","fetch_events":"https://pith.science/api/pith-number/2YMZPELALBFF4LXBR5XCP3CEBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL/action/storage_attestation","attest_author":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL/action/author_attestation","sign_citation":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL/action/citation_signature","submit_replication":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL/action/replication_record"}},"created_at":"2026-05-17T23:40:10.766645+00:00","updated_at":"2026-05-17T23:40:10.766645+00:00"}