{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QHCDILUC6V27YXP2LTIXIEGT7T","short_pith_number":"pith:QHCDILUC","canonical_record":{"source":{"id":"1312.7650","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-30T08:43:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be1e9ffade774d653e26d8bf3824a8b498ecd0188c3d985b02c956604cbb0308","abstract_canon_sha256":"abb99d4361954fd465bfb25b1bf5cb549f046c756e88446d9c884881504ac8a7"},"schema_version":"1.0"},"canonical_sha256":"81c4342e82f575fc5dfa5cd17410d3fcc6f1fb90910b720c12bfcdb38769d3de","source":{"kind":"arxiv","id":"1312.7650","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7650","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7650v3","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7650","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"QHCDILUC6V27","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QHCDILUC6V27YXP2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QHCDILUC","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QHCDILUC6V27YXP2LTIXIEGT7T","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7650","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-30T08:43:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be1e9ffade774d653e26d8bf3824a8b498ecd0188c3d985b02c956604cbb0308","abstract_canon_sha256":"abb99d4361954fd465bfb25b1bf5cb549f046c756e88446d9c884881504ac8a7"},"schema_version":"1.0"},"canonical_sha256":"81c4342e82f575fc5dfa5cd17410d3fcc6f1fb90910b720c12bfcdb38769d3de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:30.555039Z","signature_b64":"uRdtOND+kUaVfr8ZDFxahfjf3JiYErxoEyszCEA8Oqh5sc18KSespZBFl5UR+dMtB89/21fZg+6Y5ihVjUelDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81c4342e82f575fc5dfa5cd17410d3fcc6f1fb90910b720c12bfcdb38769d3de","last_reissued_at":"2026-05-18T01:04:30.554307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:30.554307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7650","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-18T01:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whIAfM9m4+0eLL/Qo785ngQs5bKPeqwe4lsy7BikcDQq55Vxt9WOkZuQ5UuwRM25UKzPic7eS1aTI6/vXmE7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:58:18.658548Z"},"content_sha256":"2b957df4b02867a55d2627605b13963788a1ee6326e3293c5544000b35f779ae","schema_version":"1.0","event_id":"sha256:2b957df4b02867a55d2627605b13963788a1ee6326e3293c5544000b35f779ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QHCDILUC6V27YXP2LTIXIEGT7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Minimum Decoding Delay of Balanced Complex Orthogonal Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haibin Kan, XiaoDong Liu, Yuan Li","submitted_at":"2013-12-30T08:43:59Z","abstract_excerpt":"Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$ COD called balanced complex orthogonal design (BCOD) has been proposed by Adams et al., and they constructed BCODs with rate $k/p = 1/2$ and decoding delay $p = 2^m$ for $n=2m$. Furthermore, they prove that the constructions have optimal decoding delay when $m$ is congruent to $1$, $2$, or $3$ module $4$. They conjecture that for the case $m \\equiv 0 \\pmod 4$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7650","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-18T01:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wb4SJMrI05kOscHba/xCwtU7ZpzzGWRSHYEP5lFtvXKTWEPH08u8qbK+5HwwCOj3tqKttmIlI7T/70+nEhZUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:58:18.659205Z"},"content_sha256":"84e9a08d89ad339544ae516a207c16557fde7e98d482d9145a5b1e6cfbe8c19a","schema_version":"1.0","event_id":"sha256:84e9a08d89ad339544ae516a207c16557fde7e98d482d9145a5b1e6cfbe8c19a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T/bundle.json","state_url":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHCDILUC6V27YXP2LTIXIEGT7T/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-26T04:58:18Z","links":{"resolver":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T","bundle":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T/bundle.json","state":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHCDILUC6V27YXP2LTIXIEGT7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QHCDILUC6V27YXP2LTIXIEGT7T","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":"abb99d4361954fd465bfb25b1bf5cb549f046c756e88446d9c884881504ac8a7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-30T08:43:59Z","title_canon_sha256":"be1e9ffade774d653e26d8bf3824a8b498ecd0188c3d985b02c956604cbb0308"},"schema_version":"1.0","source":{"id":"1312.7650","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7650","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7650v3","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7650","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"QHCDILUC6V27","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QHCDILUC6V27YXP2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QHCDILUC","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:84e9a08d89ad339544ae516a207c16557fde7e98d482d9145a5b1e6cfbe8c19a","target":"graph","created_at":"2026-05-18T01:04:30Z","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":"Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$ COD called balanced complex orthogonal design (BCOD) has been proposed by Adams et al., and they constructed BCODs with rate $k/p = 1/2$ and decoding delay $p = 2^m$ for $n=2m$. Furthermore, they prove that the constructions have optimal decoding delay when $m$ is congruent to $1$, $2$, or $3$ module $4$. They conjecture that for the case $m \\equiv 0 \\pmod 4$,","authors_text":"Haibin Kan, XiaoDong Liu, Yuan Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-30T08:43:59Z","title":"On the Minimum Decoding Delay of Balanced Complex Orthogonal Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7650","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:2b957df4b02867a55d2627605b13963788a1ee6326e3293c5544000b35f779ae","target":"record","created_at":"2026-05-18T01:04:30Z","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":"abb99d4361954fd465bfb25b1bf5cb549f046c756e88446d9c884881504ac8a7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-30T08:43:59Z","title_canon_sha256":"be1e9ffade774d653e26d8bf3824a8b498ecd0188c3d985b02c956604cbb0308"},"schema_version":"1.0","source":{"id":"1312.7650","kind":"arxiv","version":3}},"canonical_sha256":"81c4342e82f575fc5dfa5cd17410d3fcc6f1fb90910b720c12bfcdb38769d3de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81c4342e82f575fc5dfa5cd17410d3fcc6f1fb90910b720c12bfcdb38769d3de","first_computed_at":"2026-05-18T01:04:30.554307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:30.554307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uRdtOND+kUaVfr8ZDFxahfjf3JiYErxoEyszCEA8Oqh5sc18KSespZBFl5UR+dMtB89/21fZg+6Y5ihVjUelDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:30.555039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7650","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b957df4b02867a55d2627605b13963788a1ee6326e3293c5544000b35f779ae","sha256:84e9a08d89ad339544ae516a207c16557fde7e98d482d9145a5b1e6cfbe8c19a"],"state_sha256":"1606eddab849360117b6c9cf2f79144e3a5e46b7e8473d5280e9cf1604c9490d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4vbHX/LM2/1pLtTlP1xHqk0CwQprDwgJOp/ICHceHdB6TcahEQzpMHCcP0x7ZEyExNXtVklodIyvskb80nVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:58:18.662886Z","bundle_sha256":"d417811b889719da6ca27e3feccbc9f7932b39d3d07e058f11ed4b0a20ea4c8d"}}