{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KZAYSSZPIYWYVUN6N5YYIBKRBF","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":"87bbe4e768fe4ac29e107102d711432bee248e626f7610571bc52f03cc8ad917","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-02T14:36:41Z","title_canon_sha256":"3a0d44cb49e1eb77d0b7693da0e76f2c0c9d1e613138e793df0c30b563fa7236"},"schema_version":"1.0","source":{"id":"1203.0474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0474","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0474v1","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0474","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"KZAYSSZPIYWY","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KZAYSSZPIYWYVUN6","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KZAYSSZP","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:dc33c2ad13c77a8ec026426c577ebeac717522fe32d899df5ab60751c1d1495b","target":"graph","created_at":"2026-05-18T04:01:00Z","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":"Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is to construct designs maximizing the rate and minimizing the decoding delay. All known constructions of CODs are inductive or algorithmic. In this paper, we present an explicit construction of optimal CODs. We do not apply recurrent procedures and do calculate the matrix elements directly. Our formula is based on a cubic function in two binary n-vectors. In ","authors_text":"Sophie Morier-Genoud, Valentin Ovsienko","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-02T14:36:41Z","title":"Orthogonal Designs and a Cubic Binary Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0474","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:d0c402ca3d66d200f5a89f330e1d452ac0ba35344c97f6c322ea441839b98d89","target":"record","created_at":"2026-05-18T04:01:00Z","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":"87bbe4e768fe4ac29e107102d711432bee248e626f7610571bc52f03cc8ad917","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-02T14:36:41Z","title_canon_sha256":"3a0d44cb49e1eb77d0b7693da0e76f2c0c9d1e613138e793df0c30b563fa7236"},"schema_version":"1.0","source":{"id":"1203.0474","kind":"arxiv","version":1}},"canonical_sha256":"5641894b2f462d8ad1be6f718405510955da552723f035e47083ecf774a75ff3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5641894b2f462d8ad1be6f718405510955da552723f035e47083ecf774a75ff3","first_computed_at":"2026-05-18T04:01:00.607356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:00.607356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ayBpW73VpBeN06sgXo6YdYR1YoQOr2hLOQWxgrmVSu9cNH/NdH5wj9s+wSghDUsx75HVFS3BK+w0oXq8m8lfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:00.608137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0c402ca3d66d200f5a89f330e1d452ac0ba35344c97f6c322ea441839b98d89","sha256:dc33c2ad13c77a8ec026426c577ebeac717522fe32d899df5ab60751c1d1495b"],"state_sha256":"1663b7715f24244ee57b075cd9acd6b39dfac46d986ceb4a53bf8a9f79fa9dcc"}