{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:JZP6MIAH65ISV5CLPWP4IBED2B","short_pith_number":"pith:JZP6MIAH","canonical_record":{"source":{"id":"0909.0555","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-03T00:46:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cd4f882c93c52c35176d25d230336f0e0063bbd374789bf0a775a92f76fd34e1","abstract_canon_sha256":"2ace6cf9b91a8ea3641a513c36b071336c0c29ec2945aac0e1510b73dc5f5691"},"schema_version":"1.0"},"canonical_sha256":"4e5fe62007f7512af44b7d9fc40483d045caae38ada4bee8032de01ca871e681","source":{"kind":"arxiv","id":"0909.0555","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.0555","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"arxiv_version","alias_value":"0909.0555v4","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0555","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"pith_short_12","alias_value":"JZP6MIAH65IS","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"JZP6MIAH65ISV5CL","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"JZP6MIAH","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:JZP6MIAH65ISV5CLPWP4IBED2B","target":"record","payload":{"canonical_record":{"source":{"id":"0909.0555","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-03T00:46:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cd4f882c93c52c35176d25d230336f0e0063bbd374789bf0a775a92f76fd34e1","abstract_canon_sha256":"2ace6cf9b91a8ea3641a513c36b071336c0c29ec2945aac0e1510b73dc5f5691"},"schema_version":"1.0"},"canonical_sha256":"4e5fe62007f7512af44b7d9fc40483d045caae38ada4bee8032de01ca871e681","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:47.416219Z","signature_b64":"s/DrU0GtXYRXbnbMEiYzlYG455IYHymMN2detP1HYnzSP2SFeI5/cFkj0Qt5EN9s2yAW1yPSL5XEDnX6yoAFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e5fe62007f7512af44b7d9fc40483d045caae38ada4bee8032de01ca871e681","last_reissued_at":"2026-05-18T02:24:47.415558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:47.415558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.0555","source_version":4,"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-18T02:24:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZGojTs92NL424+0EfcqrSEDONdEU+Ekb2KyDo9m3E2UlW/TRt0++VT7iEsxgt/rgj2ZzwgamPpgSDDsWrohCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:38:53.502281Z"},"content_sha256":"f5d9a3a2dcd595edcf29b84448cfd8a3252bdb55b0f2f4bab862990aa1a5f0f3","schema_version":"1.0","event_id":"sha256:f5d9a3a2dcd595edcf29b84448cfd8a3252bdb55b0f2f4bab862990aa1a5f0f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:JZP6MIAH65ISV5CLPWP4IBED2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduced Complexity Sphere Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boyu Li, Ender Ayanoglu","submitted_at":"2009-09-03T00:46:16Z","abstract_excerpt":"In Multiple-Input Multiple-Output (MIMO) systems, Sphere Decoding (SD) can achieve performance equivalent to full search Maximum Likelihood (ML) decoding, with reduced complexity. Several researchers reported techniques that reduce the complexity of SD further. In this paper, a new technique is introduced which decreases the computational complexity of SD substantially, without sacrificing performance. The reduction is accomplished by deconstructing the decoding metric to decrease the number of computations and exploiting the structure of a lattice representation. Furthermore, an application o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.0555","kind":"arxiv","version":4},"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-18T02:24:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"frQZjss30PFfCTB70M6LRF3NDpDyciu2S2Tw49uA5ocEXEaMMFlBjSQLna9tjhTQzTD+ijBuKfG5kmzetLAbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:38:53.502895Z"},"content_sha256":"150d57eed0aea978795557365e584f4151cfdcde9a8a854aa76b7a65fe8de50a","schema_version":"1.0","event_id":"sha256:150d57eed0aea978795557365e584f4151cfdcde9a8a854aa76b7a65fe8de50a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZP6MIAH65ISV5CLPWP4IBED2B/bundle.json","state_url":"https://pith.science/pith/JZP6MIAH65ISV5CLPWP4IBED2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZP6MIAH65ISV5CLPWP4IBED2B/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-30T08:38:53Z","links":{"resolver":"https://pith.science/pith/JZP6MIAH65ISV5CLPWP4IBED2B","bundle":"https://pith.science/pith/JZP6MIAH65ISV5CLPWP4IBED2B/bundle.json","state":"https://pith.science/pith/JZP6MIAH65ISV5CLPWP4IBED2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZP6MIAH65ISV5CLPWP4IBED2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:JZP6MIAH65ISV5CLPWP4IBED2B","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":"2ace6cf9b91a8ea3641a513c36b071336c0c29ec2945aac0e1510b73dc5f5691","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-03T00:46:16Z","title_canon_sha256":"cd4f882c93c52c35176d25d230336f0e0063bbd374789bf0a775a92f76fd34e1"},"schema_version":"1.0","source":{"id":"0909.0555","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.0555","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"arxiv_version","alias_value":"0909.0555v4","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0555","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"pith_short_12","alias_value":"JZP6MIAH65IS","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"JZP6MIAH65ISV5CL","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"JZP6MIAH","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:150d57eed0aea978795557365e584f4151cfdcde9a8a854aa76b7a65fe8de50a","target":"graph","created_at":"2026-05-18T02:24:47Z","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 Multiple-Input Multiple-Output (MIMO) systems, Sphere Decoding (SD) can achieve performance equivalent to full search Maximum Likelihood (ML) decoding, with reduced complexity. Several researchers reported techniques that reduce the complexity of SD further. In this paper, a new technique is introduced which decreases the computational complexity of SD substantially, without sacrificing performance. The reduction is accomplished by deconstructing the decoding metric to decrease the number of computations and exploiting the structure of a lattice representation. Furthermore, an application o","authors_text":"Boyu Li, Ender Ayanoglu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-03T00:46:16Z","title":"Reduced Complexity Sphere Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.0555","kind":"arxiv","version":4},"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:f5d9a3a2dcd595edcf29b84448cfd8a3252bdb55b0f2f4bab862990aa1a5f0f3","target":"record","created_at":"2026-05-18T02:24:47Z","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":"2ace6cf9b91a8ea3641a513c36b071336c0c29ec2945aac0e1510b73dc5f5691","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-03T00:46:16Z","title_canon_sha256":"cd4f882c93c52c35176d25d230336f0e0063bbd374789bf0a775a92f76fd34e1"},"schema_version":"1.0","source":{"id":"0909.0555","kind":"arxiv","version":4}},"canonical_sha256":"4e5fe62007f7512af44b7d9fc40483d045caae38ada4bee8032de01ca871e681","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e5fe62007f7512af44b7d9fc40483d045caae38ada4bee8032de01ca871e681","first_computed_at":"2026-05-18T02:24:47.415558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:47.415558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s/DrU0GtXYRXbnbMEiYzlYG455IYHymMN2detP1HYnzSP2SFeI5/cFkj0Qt5EN9s2yAW1yPSL5XEDnX6yoAFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:47.416219Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.0555","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5d9a3a2dcd595edcf29b84448cfd8a3252bdb55b0f2f4bab862990aa1a5f0f3","sha256:150d57eed0aea978795557365e584f4151cfdcde9a8a854aa76b7a65fe8de50a"],"state_sha256":"d6ba74c35c99dacb46343ff80c083ed7a330371ee8c427b3875065883c2df53b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AadCOM/iFVZkGINa3JRm6XHxmvS+hTCvDnft9qPqZCDsq0wVuogmfOtyLFEy23w3B3hoVQ40ZamL9hsh/i2IBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:38:53.507993Z","bundle_sha256":"1712774f2e0f55b8f60a6f180deddab0b7baa841884ade4dc43c30fc754a0814"}}