{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2YMZPELALBFF4LXBR5XCP3CEBL","short_pith_number":"pith:2YMZPELA","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"},"canonical_sha256":"d619979160584a5e2ee18f6e27ec440af47391a77ea9dea1f4a0ecd40f9e9295","source":{"kind":"arxiv","id":"1905.09401","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09401","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09401v2","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09401","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"2YMZPELALBFF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2YMZPELALBFF4LXB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2YMZPELA","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2YMZPELALBFF4LXBR5XCP3CEBL","target":"record","payload":{"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"},"canonical_sha256":"d619979160584a5e2ee18f6e27ec440af47391a77ea9dea1f4a0ecd40f9e9295","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"},"source_kind":"arxiv","source_id":"1905.09401","source_version":2,"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-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"253xGk3SOuXFXeO/QCmYj2AN06mfBMSyrtZPDXxicAtxrCXcvwmBa5TBHIWK7eL1XKNZuoZ8ETtuGFDEpuByAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:31:32.252062Z"},"content_sha256":"263f07892e9c06b67cddef499191c4782b674c0cf03922a3d237812aba1ea510","schema_version":"1.0","event_id":"sha256:263f07892e9c06b67cddef499191c4782b674c0cf03922a3d237812aba1ea510"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2YMZPELALBFF4LXBR5XCP3CEBL","target":"graph","payload":{"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"},"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-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kot7S4OfQSARGEsEIJof5bUoThrc7GMwPuHRc3msiUKJNwgu9Mk3gJvJaKKTJ4Qnr0F8QyLbu8TwWNm81fCxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:31:32.252502Z"},"content_sha256":"ff1a4ed02959fc11bfa41921c69c2224983233ea49cbdb47cdc467075d3342fe","schema_version":"1.0","event_id":"sha256:ff1a4ed02959fc11bfa41921c69c2224983233ea49cbdb47cdc467075d3342fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL/bundle.json","state_url":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YMZPELALBFF4LXBR5XCP3CEBL/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-29T17:31:32Z","links":{"resolver":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL","bundle":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL/bundle.json","state":"https://pith.science/pith/2YMZPELALBFF4LXBR5XCP3CEBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YMZPELALBFF4LXBR5XCP3CEBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2YMZPELALBFF4LXBR5XCP3CEBL","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":"b2b01be3cb4cf517da8000f51a3d5a95fffa8dae4f4eed36f237e3f54b9565bb","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-05-22T23:13:27Z","title_canon_sha256":"066543d85ea1a9414785879a0353e79e24542ac6fb7bb0808044fc6ce0defa31"},"schema_version":"1.0","source":{"id":"1905.09401","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09401","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09401v2","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09401","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"2YMZPELALBFF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2YMZPELALBFF4LXB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2YMZPELA","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:ff1a4ed02959fc11bfa41921c69c2224983233ea49cbdb47cdc467075d3342fe","target":"graph","created_at":"2026-05-17T23:40:10Z","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":"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 ","authors_text":"Ertugrul Basar, Ibrahim Al-Nahhal, Octavia A. Dobre, Salama Ikki","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-05-22T23:13:27Z","title":"Optimum Low-Complexity Decoder for Spatial Modulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09401","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:263f07892e9c06b67cddef499191c4782b674c0cf03922a3d237812aba1ea510","target":"record","created_at":"2026-05-17T23:40:10Z","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":"b2b01be3cb4cf517da8000f51a3d5a95fffa8dae4f4eed36f237e3f54b9565bb","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-05-22T23:13:27Z","title_canon_sha256":"066543d85ea1a9414785879a0353e79e24542ac6fb7bb0808044fc6ce0defa31"},"schema_version":"1.0","source":{"id":"1905.09401","kind":"arxiv","version":2}},"canonical_sha256":"d619979160584a5e2ee18f6e27ec440af47391a77ea9dea1f4a0ecd40f9e9295","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d619979160584a5e2ee18f6e27ec440af47391a77ea9dea1f4a0ecd40f9e9295","first_computed_at":"2026-05-17T23:40:10.766551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:10.766551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Phzzl594mXpEcpIBdypFuNYgZ9VII6FKkzMXO+ks6cAHaV6P7+2ahmUWF6Pdj7ujUtpmtAALovZEKRYHKXnCBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:10.767171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09401","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:263f07892e9c06b67cddef499191c4782b674c0cf03922a3d237812aba1ea510","sha256:ff1a4ed02959fc11bfa41921c69c2224983233ea49cbdb47cdc467075d3342fe"],"state_sha256":"195d69eee5fc2fe28cdd1a8a26dfd220bc349c28dd5578a4e74e282d0f605c01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/coTr6X3N1Zj640+3pUo+R0KXT0WUNHsbeS9UZHZ/QZK9DnTJ17zMa2yI0fU6dYod8ise9WTUhTWpXx/3r0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:31:32.256077Z","bundle_sha256":"5978564c69e6fcd158e55a7ae1f342a63888ce05a08470cdaa4827526eeab25c"}}