{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:L7YCPY4CQ4MHZTGZ7GAUZNES4I","short_pith_number":"pith:L7YCPY4C","canonical_record":{"source":{"id":"1109.2891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-13T19:40:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3aa81ad4494b5b1f3254cf405b90fcd41657b0bd96d7a7d4f5e3e412a094e0a4","abstract_canon_sha256":"c3b74e19fbda48fb48a2f2c63b22a99e06bd893ef8d458726369f705527d8414"},"schema_version":"1.0"},"canonical_sha256":"5ff027e38287187cccd9f9814cb492e23446601b7665246d1cdcc1b383b902f2","source":{"kind":"arxiv","id":"1109.2891","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:L7YCPY4CQ4MHZTGZ7GAUZNES4I","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-13T19:40:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3aa81ad4494b5b1f3254cf405b90fcd41657b0bd96d7a7d4f5e3e412a094e0a4","abstract_canon_sha256":"c3b74e19fbda48fb48a2f2c63b22a99e06bd893ef8d458726369f705527d8414"},"schema_version":"1.0"},"canonical_sha256":"5ff027e38287187cccd9f9814cb492e23446601b7665246d1cdcc1b383b902f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:07.494139Z","signature_b64":"JP3BYWpaH/wBWMXjqwtEMfrEv3jJSKv+tSKkAromzuFGKv8usa6F61Z7lL1THM2zC0x49gLUApRtXCZQSpqDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ff027e38287187cccd9f9814cb492e23446601b7665246d1cdcc1b383b902f2","last_reissued_at":"2026-05-18T04:13:07.493680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:07.493680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2891","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:13:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOFbrGD/ltV30moyD4iI25lFgmK9+agq3nOkspeSoMsVUeLckjLOX2o9hJnCEh29DrTKTF3vEAIHJXkgDPelDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:00:41.203932Z"},"content_sha256":"ad0b4f1eabf7015e2edf3ed49aa6b13552de58b9dd613ad7625e7220715d46e4","schema_version":"1.0","event_id":"sha256:ad0b4f1eabf7015e2edf3ed49aa6b13552de58b9dd613ad7625e7220715d46e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:L7YCPY4CQ4MHZTGZ7GAUZNES4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the nonexistence of $[\\binom{2m}{m-1}, 2m, \\binom{2m-1}{m-1}]$, $m$ odd, 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, Yuan Li","submitted_at":"2011-09-13T19:40:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2891","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:13:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pkg2DrIHPsQ+7PnhIPFjFzDUJoepTsRzcymBH2kdnFbIHAsEP9S0dx61bquPu+eTdS3+mB7nJmDRsObvbSmkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:00:41.204342Z"},"content_sha256":"77d17caec55cadd2ecd36b656fdb2d8d6d1024d65c215511b678fc69d5099512","schema_version":"1.0","event_id":"sha256:77d17caec55cadd2ecd36b656fdb2d8d6d1024d65c215511b678fc69d5099512"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7YCPY4CQ4MHZTGZ7GAUZNES4I/bundle.json","state_url":"https://pith.science/pith/L7YCPY4CQ4MHZTGZ7GAUZNES4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7YCPY4CQ4MHZTGZ7GAUZNES4I/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-26T12:00:41Z","links":{"resolver":"https://pith.science/pith/L7YCPY4CQ4MHZTGZ7GAUZNES4I","bundle":"https://pith.science/pith/L7YCPY4CQ4MHZTGZ7GAUZNES4I/bundle.json","state":"https://pith.science/pith/L7YCPY4CQ4MHZTGZ7GAUZNES4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7YCPY4CQ4MHZTGZ7GAUZNES4I/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kU2rqrlNlyWMOxADbLhkBPy9gDV+JVZAwBKMJIVVH71Sk/RS54Fq4Kn+uwmH4aK47W08hmJ2GkXUUg11WE66Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:00:41.207655Z","bundle_sha256":"e658951f769783f54b111d0bbdae4c1ed232068a2937eb26f4bbceef2b76c686"}}