{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IN7VA5ZOS74RWBV7LM7RFREAOY","short_pith_number":"pith:IN7VA5ZO","schema_version":"1.0","canonical_sha256":"437f50772e97f91b06bf5b3f12c480762924f6718d5ccee7a272d245cbee4dd8","source":{"kind":"arxiv","id":"1207.3316","version":3},"attestation_state":"computed","paper":{"title":"SUMIS: Near-Optimal Soft-In Soft-Out MIMO Detection With Low and Fixed Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erik G. Larsson, Mirsad \\v{C}irki\\'c","submitted_at":"2012-07-13T17:52:38Z","abstract_excerpt":"The fundamental problem of our interest here is soft-input soft-output multiple-input multiple-output (MIMO) detection. We propose a method, referred to as subspace marginalization with interference suppression (SUMIS), that yields unprecedented performance at low and fixed (deterministic) complexity. Our method provides a well-defined tradeoff between computational complexity and performance. Apart from an initial sorting step consisting of selecting channel-matrix columns, the algorithm involves no searching nor algorithmic branching; hence the algorithm has a completely predictable run-time"},"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":"1207.3316","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-13T17:52:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e2b1345064832f9d50ddc607a83661d6382b880f809b9d666c19afd34edbc829","abstract_canon_sha256":"8e6061f1d4d155faa45a27d8188323e9784e7b0335e088fd8d8a54485959bbe3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:37.487092Z","signature_b64":"K4AoeEFHMXVSCHNuv5gwNHyFF3rVWAO9wBL0A81L4pmUiPvh30NCzqvEVi/UesqWZd/4KwehMSjvIIou6uD6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"437f50772e97f91b06bf5b3f12c480762924f6718d5ccee7a272d245cbee4dd8","last_reissued_at":"2026-05-18T03:00:37.486518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:37.486518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SUMIS: Near-Optimal Soft-In Soft-Out MIMO Detection With Low and Fixed Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erik G. Larsson, Mirsad \\v{C}irki\\'c","submitted_at":"2012-07-13T17:52:38Z","abstract_excerpt":"The fundamental problem of our interest here is soft-input soft-output multiple-input multiple-output (MIMO) detection. We propose a method, referred to as subspace marginalization with interference suppression (SUMIS), that yields unprecedented performance at low and fixed (deterministic) complexity. Our method provides a well-defined tradeoff between computational complexity and performance. Apart from an initial sorting step consisting of selecting channel-matrix columns, the algorithm involves no searching nor algorithmic branching; hence the algorithm has a completely predictable run-time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3316","kind":"arxiv","version":3},"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":"1207.3316","created_at":"2026-05-18T03:00:37.486609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3316v3","created_at":"2026-05-18T03:00:37.486609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3316","created_at":"2026-05-18T03:00:37.486609+00:00"},{"alias_kind":"pith_short_12","alias_value":"IN7VA5ZOS74R","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IN7VA5ZOS74RWBV7","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IN7VA5ZO","created_at":"2026-05-18T12:27:09.501522+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/IN7VA5ZOS74RWBV7LM7RFREAOY","json":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY.json","graph_json":"https://pith.science/api/pith-number/IN7VA5ZOS74RWBV7LM7RFREAOY/graph.json","events_json":"https://pith.science/api/pith-number/IN7VA5ZOS74RWBV7LM7RFREAOY/events.json","paper":"https://pith.science/paper/IN7VA5ZO"},"agent_actions":{"view_html":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY","download_json":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY.json","view_paper":"https://pith.science/paper/IN7VA5ZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3316&json=true","fetch_graph":"https://pith.science/api/pith-number/IN7VA5ZOS74RWBV7LM7RFREAOY/graph.json","fetch_events":"https://pith.science/api/pith-number/IN7VA5ZOS74RWBV7LM7RFREAOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/action/storage_attestation","attest_author":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/action/author_attestation","sign_citation":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/action/citation_signature","submit_replication":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/action/replication_record"}},"created_at":"2026-05-18T03:00:37.486609+00:00","updated_at":"2026-05-18T03:00:37.486609+00:00"}