{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TTZMH7RPUHI7Y7C7JBMXSIA4JY","short_pith_number":"pith:TTZMH7RP","canonical_record":{"source":{"id":"1303.0699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-04T13:49:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c889d02cea3b8effdf71040aeeee580ae56f958d8641b584d0ec413ff78f635","abstract_canon_sha256":"a95446968e7d49fe0ad2f89e6d19d36396361731446f6b2718b8c2f7ed032ff4"},"schema_version":"1.0"},"canonical_sha256":"9cf2c3fe2fa1d1fc7c5f485979201c4e28cca98a02cc1e0b0e4c1a9975e7bbfd","source":{"kind":"arxiv","id":"1303.0699","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0699","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0699v1","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0699","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"TTZMH7RPUHI7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TTZMH7RPUHI7Y7C7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TTZMH7RP","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TTZMH7RPUHI7Y7C7JBMXSIA4JY","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-04T13:49:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c889d02cea3b8effdf71040aeeee580ae56f958d8641b584d0ec413ff78f635","abstract_canon_sha256":"a95446968e7d49fe0ad2f89e6d19d36396361731446f6b2718b8c2f7ed032ff4"},"schema_version":"1.0"},"canonical_sha256":"9cf2c3fe2fa1d1fc7c5f485979201c4e28cca98a02cc1e0b0e4c1a9975e7bbfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:55.180216Z","signature_b64":"G9cUevlkA+R0gGmScki2jN2d0gcFx6NbVOlRfxlFT0MXCckTdwByqDJBAiwA58xupwMQcOQ+59jLmr5wfyKfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cf2c3fe2fa1d1fc7c5f485979201c4e28cca98a02cc1e0b0e4c1a9975e7bbfd","last_reissued_at":"2026-05-18T03:31:55.179380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:55.179380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0699","source_version":1,"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:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZVXjJQFvxzXdGlWlz4EpT0ifhgWXbLgHkmhNknokBLcf+9JuN2y+i/KZ181JasIN7ETzvxpjxqMyJYS5fk+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T05:03:11.831624Z"},"content_sha256":"62476e18f3db6a08e26f21656e3c677b993b088c7896c1f5950667b2ed927175","schema_version":"1.0","event_id":"sha256:62476e18f3db6a08e26f21656e3c677b993b088c7896c1f5950667b2ed927175"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TTZMH7RPUHI7Y7C7JBMXSIA4JY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-complexity dominance-based Sphere Decoder for MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Domenico Ciuonzo, Francesco Palmieri, Gianmarco Romano, Pierluigi Salvo Rossi","submitted_at":"2013-03-04T13:49:07Z","abstract_excerpt":"The sphere decoder (SD) is an attractive low-complexity alternative to maximum likelihood (ML) detection in a variety of communication systems. It is also employed in multiple-input multiple-output (MIMO) systems where the computational complexity of the optimum detector grows exponentially with the number of transmit antennas. We propose an enhanced version of the SD based on an additional cost function derived from conditions on worst case interference, that we call dominance conditions. The proposed detector, the king sphere decoder (KSD), has a computational complexity that results to be n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0699","kind":"arxiv","version":1},"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:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRxcPKtbV+9EP1OJXSzgww5rd9v37x1PtYVvxFunr8lE0Fu57QP4nos8662FTOolOrgjMv3+Kg3IlBKzLk8DDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T05:03:11.831972Z"},"content_sha256":"6601fcbc943e744b600dbed5111aa5312c2405dd4eae49706ffd6b53d33666c2","schema_version":"1.0","event_id":"sha256:6601fcbc943e744b600dbed5111aa5312c2405dd4eae49706ffd6b53d33666c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTZMH7RPUHI7Y7C7JBMXSIA4JY/bundle.json","state_url":"https://pith.science/pith/TTZMH7RPUHI7Y7C7JBMXSIA4JY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTZMH7RPUHI7Y7C7JBMXSIA4JY/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-30T05:03:11Z","links":{"resolver":"https://pith.science/pith/TTZMH7RPUHI7Y7C7JBMXSIA4JY","bundle":"https://pith.science/pith/TTZMH7RPUHI7Y7C7JBMXSIA4JY/bundle.json","state":"https://pith.science/pith/TTZMH7RPUHI7Y7C7JBMXSIA4JY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTZMH7RPUHI7Y7C7JBMXSIA4JY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TTZMH7RPUHI7Y7C7JBMXSIA4JY","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":"a95446968e7d49fe0ad2f89e6d19d36396361731446f6b2718b8c2f7ed032ff4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-04T13:49:07Z","title_canon_sha256":"0c889d02cea3b8effdf71040aeeee580ae56f958d8641b584d0ec413ff78f635"},"schema_version":"1.0","source":{"id":"1303.0699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0699","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0699v1","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0699","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"TTZMH7RPUHI7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TTZMH7RPUHI7Y7C7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TTZMH7RP","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:6601fcbc943e744b600dbed5111aa5312c2405dd4eae49706ffd6b53d33666c2","target":"graph","created_at":"2026-05-18T03:31:55Z","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 sphere decoder (SD) is an attractive low-complexity alternative to maximum likelihood (ML) detection in a variety of communication systems. It is also employed in multiple-input multiple-output (MIMO) systems where the computational complexity of the optimum detector grows exponentially with the number of transmit antennas. We propose an enhanced version of the SD based on an additional cost function derived from conditions on worst case interference, that we call dominance conditions. The proposed detector, the king sphere decoder (KSD), has a computational complexity that results to be n","authors_text":"Domenico Ciuonzo, Francesco Palmieri, Gianmarco Romano, Pierluigi Salvo Rossi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-04T13:49:07Z","title":"Low-complexity dominance-based Sphere Decoder for MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0699","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:62476e18f3db6a08e26f21656e3c677b993b088c7896c1f5950667b2ed927175","target":"record","created_at":"2026-05-18T03:31:55Z","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":"a95446968e7d49fe0ad2f89e6d19d36396361731446f6b2718b8c2f7ed032ff4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-04T13:49:07Z","title_canon_sha256":"0c889d02cea3b8effdf71040aeeee580ae56f958d8641b584d0ec413ff78f635"},"schema_version":"1.0","source":{"id":"1303.0699","kind":"arxiv","version":1}},"canonical_sha256":"9cf2c3fe2fa1d1fc7c5f485979201c4e28cca98a02cc1e0b0e4c1a9975e7bbfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cf2c3fe2fa1d1fc7c5f485979201c4e28cca98a02cc1e0b0e4c1a9975e7bbfd","first_computed_at":"2026-05-18T03:31:55.179380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:55.179380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G9cUevlkA+R0gGmScki2jN2d0gcFx6NbVOlRfxlFT0MXCckTdwByqDJBAiwA58xupwMQcOQ+59jLmr5wfyKfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:55.180216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62476e18f3db6a08e26f21656e3c677b993b088c7896c1f5950667b2ed927175","sha256:6601fcbc943e744b600dbed5111aa5312c2405dd4eae49706ffd6b53d33666c2"],"state_sha256":"0233b27ca94df90ed9fb4389abe6917a605fb5fa5488f22b6deb45a5eff687bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bzK7b48KUxDS2sIZwXRyArE5s4x3FP5RLMl/9nvclXInr8I1bzEACsSM2cFehfl2qdcMC3EOHCEbV6PpafSCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T05:03:11.834117Z","bundle_sha256":"e232ddfe67f160f9ab43089eee288db9bf4830e30d7a6612188d2f9be3645cb6"}}