{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IN7VA5ZOS74RWBV7LM7RFREAOY","short_pith_number":"pith:IN7VA5ZO","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"},"canonical_sha256":"437f50772e97f91b06bf5b3f12c480762924f6718d5ccee7a272d245cbee4dd8","source":{"kind":"arxiv","id":"1207.3316","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3316","created_at":"2026-05-18T03:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3316v3","created_at":"2026-05-18T03:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3316","created_at":"2026-05-18T03:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"IN7VA5ZOS74R","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IN7VA5ZOS74RWBV7","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IN7VA5ZO","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IN7VA5ZOS74RWBV7LM7RFREAOY","target":"record","payload":{"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"},"canonical_sha256":"437f50772e97f91b06bf5b3f12c480762924f6718d5ccee7a272d245cbee4dd8","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"},"source_kind":"arxiv","source_id":"1207.3316","source_version":3,"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-18T03:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8D/jkBpXn1IGNP83d7KB1P9URPD/dXzJiT4+4H4i+UB3QRTNXTaaj4unHpfPk2NFnda4/4IuKLgQ9l/Lo7H1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:19:41.712158Z"},"content_sha256":"2d8d149325caac69c1294f2788580fecc60c7bda5ffb0530b0f1d9cfd8a444bc","schema_version":"1.0","event_id":"sha256:2d8d149325caac69c1294f2788580fecc60c7bda5ffb0530b0f1d9cfd8a444bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IN7VA5ZOS74RWBV7LM7RFREAOY","target":"graph","payload":{"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"},"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-18T03:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPk/PKsAiShkcses2W0LyJ5auSx3uN2/JMOgOpUSZ6gEFBQbwiln7EUFVu4IfcFiJ556viOEEmXg8etEzpJxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:19:41.712525Z"},"content_sha256":"090dbce238aeecfb625438336f88c035fbaef120fa21b1d33bae2c6813ad08ae","schema_version":"1.0","event_id":"sha256:090dbce238aeecfb625438336f88c035fbaef120fa21b1d33bae2c6813ad08ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/bundle.json","state_url":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/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-06-22T23:19:41Z","links":{"resolver":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY","bundle":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/bundle.json","state":"https://pith.science/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IN7VA5ZOS74RWBV7LM7RFREAOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IN7VA5ZOS74RWBV7LM7RFREAOY","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":"8e6061f1d4d155faa45a27d8188323e9784e7b0335e088fd8d8a54485959bbe3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-13T17:52:38Z","title_canon_sha256":"e2b1345064832f9d50ddc607a83661d6382b880f809b9d666c19afd34edbc829"},"schema_version":"1.0","source":{"id":"1207.3316","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3316","created_at":"2026-05-18T03:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3316v3","created_at":"2026-05-18T03:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3316","created_at":"2026-05-18T03:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"IN7VA5ZOS74R","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IN7VA5ZOS74RWBV7","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IN7VA5ZO","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:090dbce238aeecfb625438336f88c035fbaef120fa21b1d33bae2c6813ad08ae","target":"graph","created_at":"2026-05-18T03:00:37Z","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":"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","authors_text":"Erik G. Larsson, Mirsad \\v{C}irki\\'c","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-13T17:52:38Z","title":"SUMIS: Near-Optimal Soft-In Soft-Out MIMO Detection With Low and Fixed Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3316","kind":"arxiv","version":3},"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:2d8d149325caac69c1294f2788580fecc60c7bda5ffb0530b0f1d9cfd8a444bc","target":"record","created_at":"2026-05-18T03:00:37Z","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":"8e6061f1d4d155faa45a27d8188323e9784e7b0335e088fd8d8a54485959bbe3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-13T17:52:38Z","title_canon_sha256":"e2b1345064832f9d50ddc607a83661d6382b880f809b9d666c19afd34edbc829"},"schema_version":"1.0","source":{"id":"1207.3316","kind":"arxiv","version":3}},"canonical_sha256":"437f50772e97f91b06bf5b3f12c480762924f6718d5ccee7a272d245cbee4dd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"437f50772e97f91b06bf5b3f12c480762924f6718d5ccee7a272d245cbee4dd8","first_computed_at":"2026-05-18T03:00:37.486518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:37.486518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K4AoeEFHMXVSCHNuv5gwNHyFF3rVWAO9wBL0A81L4pmUiPvh30NCzqvEVi/UesqWZd/4KwehMSjvIIou6uD6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:37.487092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3316","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d8d149325caac69c1294f2788580fecc60c7bda5ffb0530b0f1d9cfd8a444bc","sha256:090dbce238aeecfb625438336f88c035fbaef120fa21b1d33bae2c6813ad08ae"],"state_sha256":"a687f2dc99d9174887c3e64b4eba17558f139ead07906a89fd303e7bd9be49ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVCJRAHBo+d/uGV0gqV4RYe+WXEEjOAQTZpZZouW48n05JRB2yB8OBtDZ8XZdtS5FYb0EWl4Kno+mDECp3r7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:19:41.714531Z","bundle_sha256":"0e13817d3ea75efb3fd2234b45b07c4368ce1f782ffa941e47cce0dac4296c59"}}