{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FOVFPG77VW6YM7HVHGAQ2MNHUS","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":"1509ed89d391104a94a38c7314d895eb18dc9b482b81ccd8c1f84bb2c8856cb6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-24T15:43:57Z","title_canon_sha256":"a704d03ff1893deb2dd021fba695d9725be0f0252dd8339923f9c0b46d8a9089"},"schema_version":"1.0","source":{"id":"1605.07505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07505","created_at":"2026-05-18T00:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07505v1","created_at":"2026-05-18T00:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07505","created_at":"2026-05-18T00:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"FOVFPG77VW6Y","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOVFPG77VW6YM7HV","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOVFPG77","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:1291e8e0eaa12f4ae4e53c278c649a1068dd62864e4694229b80a1eaa39ba696","target":"graph","created_at":"2026-05-18T00:49:32Z","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":"Blind algorithms for multiple-input multiple-output (MIMO) signals interception have recently received considerable attention because of their important applications in modern civil and military communication fields. One key step in the interception process is to blindly recognize the modulation type of the MIMO signals. This can be performed by employing a Modulation Classification (MC) algorithm, which can be feature-based or likelihood-based. To overcome the problems associated with the existing likelihood-based MC algorithms, a new algorithm is developed in this paper. We formulated the MC","authors_text":"Abdel-Haleem Abdel-Aty, M Naufal M Saad, Mohammad Rida Bahloul, Mohd Zuki Yusoff","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-24T15:43:57Z","title":"An Efficient Likelihood-Based Modulation Classification Algorithm for MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07505","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:7701f1f0b69e331147fa99d25dd76cf3d7eb2c6323b20de4c48c33c9e7e7ef8d","target":"record","created_at":"2026-05-18T00:49:32Z","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":"1509ed89d391104a94a38c7314d895eb18dc9b482b81ccd8c1f84bb2c8856cb6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-24T15:43:57Z","title_canon_sha256":"a704d03ff1893deb2dd021fba695d9725be0f0252dd8339923f9c0b46d8a9089"},"schema_version":"1.0","source":{"id":"1605.07505","kind":"arxiv","version":1}},"canonical_sha256":"2baa579bffadbd867cf539810d31a7a48dba8a59923a76c22f9145015f5dd925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2baa579bffadbd867cf539810d31a7a48dba8a59923a76c22f9145015f5dd925","first_computed_at":"2026-05-18T00:49:32.552573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:32.552573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QUAbgLVoQF7/l3769AkD7PTwEzWlZ4QNttd7iimkSeP18wMvrhqA+LOR4iybTtxl4p5a0TUtNOy7a2VVcEb/CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:32.553154Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7701f1f0b69e331147fa99d25dd76cf3d7eb2c6323b20de4c48c33c9e7e7ef8d","sha256:1291e8e0eaa12f4ae4e53c278c649a1068dd62864e4694229b80a1eaa39ba696"],"state_sha256":"932fb760f3657eda2457cdc4dbb828a837e359b905e6d2483c0002c6764f1703"}