{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TVCQYULBVX6HBBRI5PDHHLQSF2","short_pith_number":"pith:TVCQYULB","canonical_record":{"source":{"id":"1210.3449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-12T07:54:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d47060e1174bf8fc7fa06a422374951a1473c5c59722169036e5074c9b9aac4","abstract_canon_sha256":"54c2ea441e9c15e9161a48fb8bbec6756f0cc10e72bc3b339e1ceceb8fe20c12"},"schema_version":"1.0"},"canonical_sha256":"9d450c5161adfc708628ebc673ae122e8d4f0059ce2ecc1729fd9a6d66b56473","source":{"kind":"arxiv","id":"1210.3449","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3449","created_at":"2026-05-18T03:35:40Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3449v2","created_at":"2026-05-18T03:35:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3449","created_at":"2026-05-18T03:35:40Z"},{"alias_kind":"pith_short_12","alias_value":"TVCQYULBVX6H","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TVCQYULBVX6HBBRI","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TVCQYULB","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TVCQYULBVX6HBBRI5PDHHLQSF2","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-12T07:54:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d47060e1174bf8fc7fa06a422374951a1473c5c59722169036e5074c9b9aac4","abstract_canon_sha256":"54c2ea441e9c15e9161a48fb8bbec6756f0cc10e72bc3b339e1ceceb8fe20c12"},"schema_version":"1.0"},"canonical_sha256":"9d450c5161adfc708628ebc673ae122e8d4f0059ce2ecc1729fd9a6d66b56473","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:40.849152Z","signature_b64":"4Kb7U0i8El090D6xYzmZmloZe2wx4GfWFlXLLre0+157/yfkXOZ3PGZafCmW5jcrqKZ/xw9/Ip6Ck1ujj5KYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d450c5161adfc708628ebc673ae122e8d4f0059ce2ecc1729fd9a6d66b56473","last_reissued_at":"2026-05-18T03:35:40.848092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:40.848092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3449","source_version":2,"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:35:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qTtR5XBWKTynt31j+HBUIbE7hXZRx1cPpgfrobftNew0Tpc/cDkvg+syXEPvudat7RhzbVqFLvcyqQ8OpA5mDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:36:11.694641Z"},"content_sha256":"a703537c5c1f8bffd611802f38efea53d58459bcbbafc896c37f3ebc70cf339e","schema_version":"1.0","event_id":"sha256:a703537c5c1f8bffd611802f38efea53d58459bcbbafc896c37f3ebc70cf339e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TVCQYULBVX6HBBRI5PDHHLQSF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, G. R. Jithamithra","submitted_at":"2012-10-12T07:54:06Z","abstract_excerpt":"Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M paths (QRDM decoder). Recently Ren et al., presented a new class of STBCs known as the block orthogonal STBCs (BOSTBCs), which could be exploited by the QRDM decoders to achieve significant decoding complexity reduction without performance loss. The block orthogonal property of the codes constructed was however only shown via simulations. In this paper, we give "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3449","kind":"arxiv","version":2},"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:35:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afP0EWEsv8iTKHqQQ0I+yMcOnY9aZjPG/7GuffTiw8Hy1JSf518iBcWBEKwuQH4/GSxVlV1r4WHNqSInUjPTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:36:11.695219Z"},"content_sha256":"371363532fea6fb6921e1993e41cf3bb4c556b656ec704ce80689d43c5bebf41","schema_version":"1.0","event_id":"sha256:371363532fea6fb6921e1993e41cf3bb4c556b656ec704ce80689d43c5bebf41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVCQYULBVX6HBBRI5PDHHLQSF2/bundle.json","state_url":"https://pith.science/pith/TVCQYULBVX6HBBRI5PDHHLQSF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVCQYULBVX6HBBRI5PDHHLQSF2/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-04T23:36:11Z","links":{"resolver":"https://pith.science/pith/TVCQYULBVX6HBBRI5PDHHLQSF2","bundle":"https://pith.science/pith/TVCQYULBVX6HBBRI5PDHHLQSF2/bundle.json","state":"https://pith.science/pith/TVCQYULBVX6HBBRI5PDHHLQSF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVCQYULBVX6HBBRI5PDHHLQSF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TVCQYULBVX6HBBRI5PDHHLQSF2","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":"54c2ea441e9c15e9161a48fb8bbec6756f0cc10e72bc3b339e1ceceb8fe20c12","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-12T07:54:06Z","title_canon_sha256":"1d47060e1174bf8fc7fa06a422374951a1473c5c59722169036e5074c9b9aac4"},"schema_version":"1.0","source":{"id":"1210.3449","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3449","created_at":"2026-05-18T03:35:40Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3449v2","created_at":"2026-05-18T03:35:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3449","created_at":"2026-05-18T03:35:40Z"},{"alias_kind":"pith_short_12","alias_value":"TVCQYULBVX6H","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TVCQYULBVX6HBBRI","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TVCQYULB","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:371363532fea6fb6921e1993e41cf3bb4c556b656ec704ce80689d43c5bebf41","target":"graph","created_at":"2026-05-18T03:35:40Z","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":"Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M paths (QRDM decoder). Recently Ren et al., presented a new class of STBCs known as the block orthogonal STBCs (BOSTBCs), which could be exploited by the QRDM decoders to achieve significant decoding complexity reduction without performance loss. The block orthogonal property of the codes constructed was however only shown via simulations. In this paper, we give ","authors_text":"B. Sundar Rajan, G. R. Jithamithra","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-12T07:54:06Z","title":"Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3449","kind":"arxiv","version":2},"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:a703537c5c1f8bffd611802f38efea53d58459bcbbafc896c37f3ebc70cf339e","target":"record","created_at":"2026-05-18T03:35:40Z","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":"54c2ea441e9c15e9161a48fb8bbec6756f0cc10e72bc3b339e1ceceb8fe20c12","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-12T07:54:06Z","title_canon_sha256":"1d47060e1174bf8fc7fa06a422374951a1473c5c59722169036e5074c9b9aac4"},"schema_version":"1.0","source":{"id":"1210.3449","kind":"arxiv","version":2}},"canonical_sha256":"9d450c5161adfc708628ebc673ae122e8d4f0059ce2ecc1729fd9a6d66b56473","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d450c5161adfc708628ebc673ae122e8d4f0059ce2ecc1729fd9a6d66b56473","first_computed_at":"2026-05-18T03:35:40.848092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:40.848092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Kb7U0i8El090D6xYzmZmloZe2wx4GfWFlXLLre0+157/yfkXOZ3PGZafCmW5jcrqKZ/xw9/Ip6Ck1ujj5KYBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:40.849152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3449","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a703537c5c1f8bffd611802f38efea53d58459bcbbafc896c37f3ebc70cf339e","sha256:371363532fea6fb6921e1993e41cf3bb4c556b656ec704ce80689d43c5bebf41"],"state_sha256":"c9b5d1b9b3408c34cdcb529d0e84afcab679605c473816266e927f58573da4cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCR+gbuTnH1IXVLThKm0ZjLoftR69TXWWFe226O2LvEf1GpREFqOCmIcfi2xBvjwPn6y0C5Mq4n0kQ0LVP9aAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:36:11.698639Z","bundle_sha256":"e31c20916bc5d8911fcc0641fa7b2e7798c564957aa9b140f5a558649ac7a18b"}}