{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:A4LRLWVVKB4ESSLUMBFHDBAH34","short_pith_number":"pith:A4LRLWVV","canonical_record":{"source":{"id":"1112.1593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T15:13:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac0f4900ca75aa80c1102aebfa41059d5a0813416453964d33b8748cc518cac8","abstract_canon_sha256":"97d9f4c92d175ece2fa7067cffbf5bd4e52d82a51e17f1d243503197666c464b"},"schema_version":"1.0"},"canonical_sha256":"071715dab55078494974604a718407df0e4bb28b1e745d34dbd8064482eeb865","source":{"kind":"arxiv","id":"1112.1593","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1593","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1593v1","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1593","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"A4LRLWVVKB4E","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"A4LRLWVVKB4ESSLU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"A4LRLWVV","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:A4LRLWVVKB4ESSLUMBFHDBAH34","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T15:13:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac0f4900ca75aa80c1102aebfa41059d5a0813416453964d33b8748cc518cac8","abstract_canon_sha256":"97d9f4c92d175ece2fa7067cffbf5bd4e52d82a51e17f1d243503197666c464b"},"schema_version":"1.0"},"canonical_sha256":"071715dab55078494974604a718407df0e4bb28b1e745d34dbd8064482eeb865","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:54.303171Z","signature_b64":"QZZwbHCfzk1Q4Gx8zYqiDHV9+M6EKfT6KFVBEljZJnq5C/+s1eA2xfgaA2x+z7c1fAZjiAuZfyEDE7SSWCLSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"071715dab55078494974604a718407df0e4bb28b1e745d34dbd8064482eeb865","last_reissued_at":"2026-05-18T04:06:54.302755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:54.302755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1593","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-18T04:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IuC/FumzkinXoG0Ym2dnXcRX049e9doq8CmOnGZOtyg0y82RnD8bXaJNFjahPoqdvNXEST5bOkylTsBPAY7bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:01:45.431693Z"},"content_sha256":"66b1d98660e3a6bbe7bc22c826c6184b83b0c97e9ba38c739d9c257bc235cd07","schema_version":"1.0","event_id":"sha256:66b1d98660e3a6bbe7bc22c826c6184b83b0c97e9ba38c739d9c257bc235cd07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:A4LRLWVVKB4ESSLUMBFHDBAH34","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-delay, High-rate Non-square Complex Orthogonal Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Smarajit Das","submitted_at":"2011-12-07T15:13:12Z","abstract_excerpt":"The maximal rate of a non-square complex orthogonal design for $n$ transmit antennas is $1/2+\\frac{1}{n}$ if $n$ is even and $1/2+\\frac{1}{n+1}$ if $n$ is odd and the codes have been constructed for all $n$ by Liang (IEEE Trans. Inform. Theory, 2003) and Lu et al. (IEEE Trans. Inform. Theory, 2005) to achieve this rate. A lower bound on the decoding delay of maximal-rate complex orthogonal designs has been obtained by Adams et al. (IEEE Trans. Inform. Theory, 2007) and it is observed that Liang's construction achieves the bound on delay for $n$ equal to 1 and 3 modulo 4 while Lu et al.'s const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1593","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-18T04:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hcq0FH+cxXT0kcGuBOg/PDhXCu9p8XLvf3cV/u96dokgp7w7iaR4pqaDEnthYim45CcQgY+a6XJsH5hifG0zAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:01:45.432045Z"},"content_sha256":"8a89425396413461bdc21fea97924c84c21410bcfdb1c647fcb8e2653c2f2c33","schema_version":"1.0","event_id":"sha256:8a89425396413461bdc21fea97924c84c21410bcfdb1c647fcb8e2653c2f2c33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/bundle.json","state_url":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/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-02T10:01:45Z","links":{"resolver":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34","bundle":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/bundle.json","state":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:A4LRLWVVKB4ESSLUMBFHDBAH34","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":"97d9f4c92d175ece2fa7067cffbf5bd4e52d82a51e17f1d243503197666c464b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T15:13:12Z","title_canon_sha256":"ac0f4900ca75aa80c1102aebfa41059d5a0813416453964d33b8748cc518cac8"},"schema_version":"1.0","source":{"id":"1112.1593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1593","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1593v1","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1593","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"A4LRLWVVKB4E","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"A4LRLWVVKB4ESSLU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"A4LRLWVV","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:8a89425396413461bdc21fea97924c84c21410bcfdb1c647fcb8e2653c2f2c33","target":"graph","created_at":"2026-05-18T04:06:54Z","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 maximal rate of a non-square complex orthogonal design for $n$ transmit antennas is $1/2+\\frac{1}{n}$ if $n$ is even and $1/2+\\frac{1}{n+1}$ if $n$ is odd and the codes have been constructed for all $n$ by Liang (IEEE Trans. Inform. Theory, 2003) and Lu et al. (IEEE Trans. Inform. Theory, 2005) to achieve this rate. A lower bound on the decoding delay of maximal-rate complex orthogonal designs has been obtained by Adams et al. (IEEE Trans. Inform. Theory, 2007) and it is observed that Liang's construction achieves the bound on delay for $n$ equal to 1 and 3 modulo 4 while Lu et al.'s const","authors_text":"B. Sundar Rajan, Smarajit Das","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T15:13:12Z","title":"Low-delay, High-rate Non-square Complex Orthogonal Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1593","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:66b1d98660e3a6bbe7bc22c826c6184b83b0c97e9ba38c739d9c257bc235cd07","target":"record","created_at":"2026-05-18T04:06:54Z","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":"97d9f4c92d175ece2fa7067cffbf5bd4e52d82a51e17f1d243503197666c464b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T15:13:12Z","title_canon_sha256":"ac0f4900ca75aa80c1102aebfa41059d5a0813416453964d33b8748cc518cac8"},"schema_version":"1.0","source":{"id":"1112.1593","kind":"arxiv","version":1}},"canonical_sha256":"071715dab55078494974604a718407df0e4bb28b1e745d34dbd8064482eeb865","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"071715dab55078494974604a718407df0e4bb28b1e745d34dbd8064482eeb865","first_computed_at":"2026-05-18T04:06:54.302755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:54.302755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QZZwbHCfzk1Q4Gx8zYqiDHV9+M6EKfT6KFVBEljZJnq5C/+s1eA2xfgaA2x+z7c1fAZjiAuZfyEDE7SSWCLSBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:54.303171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66b1d98660e3a6bbe7bc22c826c6184b83b0c97e9ba38c739d9c257bc235cd07","sha256:8a89425396413461bdc21fea97924c84c21410bcfdb1c647fcb8e2653c2f2c33"],"state_sha256":"861c4c0f54194c25ab13d89f7a83effc70d065d773f2e15dd2e63cdc40b04b78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jNvIsBg/73P4nwI4Wn48zHVWDG8Ro0rPJg1BowPycJl15PRGLYx2WBetW68FYtQnM2yCoeaaBv/GTwNSOH84DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:01:45.433998Z","bundle_sha256":"c063a089a4e38ea72d41c47f99a22c508b10191c909a56dc027054f6bfcf19be"}}