{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:L7YCPY4CQ4MHZTGZ7GAUZNES4I","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":"c3b74e19fbda48fb48a2f2c63b22a99e06bd893ef8d458726369f705527d8414","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-13T19:40:00Z","title_canon_sha256":"3aa81ad4494b5b1f3254cf405b90fcd41657b0bd96d7a7d4f5e3e412a094e0a4"},"schema_version":"1.0","source":{"id":"1109.2891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2891","created_at":"2026-05-18T04:13:07Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2891v1","created_at":"2026-05-18T04:13:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2891","created_at":"2026-05-18T04:13:07Z"},{"alias_kind":"pith_short_12","alias_value":"L7YCPY4CQ4MH","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L7YCPY4CQ4MHZTGZ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L7YCPY4C","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:77d17caec55cadd2ecd36b656fdb2d8d6d1024d65c215511b678fc69d5099512","target":"graph","created_at":"2026-05-18T04:13:07Z","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 designs (CODs) are used to construct space-time block codes. COD $\\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p\\times n$ matrix, where nonzero entries are filled by $\\pm z_i$ or $\\pm z^*_i$, $i = 1, 2,..., k$, such that $\\mathcal{O}^H_z \\mathcal{O}_z = (|z_1|^2+|z_2|^2+...+|z_k|^2)I_{n \\times n}$. Adams et al. in \"The final case of the decoding delay problem for maximum rate complex orthogonal designs,\" IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 103-122, Jan. 2010, first proved the nonexistence of $[\\binom{2m}{m-1}, 2m, \\binom{2m-1}{m-1}]$, $m$ odd, COD. Combining with","authors_text":"Haibin Kan, Yuan Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-13T19:40:00Z","title":"On the nonexistence of $[\\binom{2m}{m-1}, 2m, \\binom{2m-1}{m-1}]$, $m$ odd, complex orthogonal design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2891","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:ad0b4f1eabf7015e2edf3ed49aa6b13552de58b9dd613ad7625e7220715d46e4","target":"record","created_at":"2026-05-18T04:13:07Z","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":"c3b74e19fbda48fb48a2f2c63b22a99e06bd893ef8d458726369f705527d8414","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-13T19:40:00Z","title_canon_sha256":"3aa81ad4494b5b1f3254cf405b90fcd41657b0bd96d7a7d4f5e3e412a094e0a4"},"schema_version":"1.0","source":{"id":"1109.2891","kind":"arxiv","version":1}},"canonical_sha256":"5ff027e38287187cccd9f9814cb492e23446601b7665246d1cdcc1b383b902f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ff027e38287187cccd9f9814cb492e23446601b7665246d1cdcc1b383b902f2","first_computed_at":"2026-05-18T04:13:07.493680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:07.493680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JP3BYWpaH/wBWMXjqwtEMfrEv3jJSKv+tSKkAromzuFGKv8usa6F61Z7lL1THM2zC0x49gLUApRtXCZQSpqDBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:07.494139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad0b4f1eabf7015e2edf3ed49aa6b13552de58b9dd613ad7625e7220715d46e4","sha256:77d17caec55cadd2ecd36b656fdb2d8d6d1024d65c215511b678fc69d5099512"],"state_sha256":"5b7d8fc9b703bf66de5241117e8f5f336b15b90f11f05b8d4f86888272113a69"}