{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LMHHMQ6YDCBKIS6WBN4AVXO7CP","short_pith_number":"pith:LMHHMQ6Y","canonical_record":{"source":{"id":"1107.3268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-17T01:18:46Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"44d2efa97049de64916f65121ecd1a7ca4e7f48e67321924a1ca7edd1486a3e8","abstract_canon_sha256":"43f7b5beffc29bca4b0b8b2f1d383a2856ff304ac8226527af5f75268a1ce6c7"},"schema_version":"1.0"},"canonical_sha256":"5b0e7643d81882a44bd60b780adddf13db2d8da8e7fe8662a8c4fda2ee4984d0","source":{"kind":"arxiv","id":"1107.3268","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3268","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3268v2","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3268","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"LMHHMQ6YDCBK","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LMHHMQ6YDCBKIS6W","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LMHHMQ6Y","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LMHHMQ6YDCBKIS6WBN4AVXO7CP","target":"record","payload":{"canonical_record":{"source":{"id":"1107.3268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-17T01:18:46Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"44d2efa97049de64916f65121ecd1a7ca4e7f48e67321924a1ca7edd1486a3e8","abstract_canon_sha256":"43f7b5beffc29bca4b0b8b2f1d383a2856ff304ac8226527af5f75268a1ce6c7"},"schema_version":"1.0"},"canonical_sha256":"5b0e7643d81882a44bd60b780adddf13db2d8da8e7fe8662a8c4fda2ee4984d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:51.351273Z","signature_b64":"0o1uK1aLPAf6e01xKGOxjEVsTmDBSq2CUKzZ6KXtDv4/7jCirMaSGgrPfu4HGYx5ZJbxP3Ha4ZLzqcr2zp6IAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b0e7643d81882a44bd60b780adddf13db2d8da8e7fe8662a8c4fda2ee4984d0","last_reissued_at":"2026-05-18T03:58:51.350786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:51.350786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.3268","source_version":2,"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-18T03:58:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bo/zuFi0mwxByksE9CBGwdt/afN22Eyq/k7XaJKzKwDzOSuqTjeVQ7ZR9VvsK4+y9kI6txz7TZbtLcndhoKgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:10:31.071293Z"},"content_sha256":"e19cdd9632a543993f5c8efb00219b4eda8c1c6705394a84d813178131ca41bc","schema_version":"1.0","event_id":"sha256:e19cdd9632a543993f5c8efb00219b4eda8c1c6705394a84d813178131ca41bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LMHHMQ6YDCBKIS6WBN4AVXO7CP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complex Orthogonal Designs with Forbidden $2 \\times 2$ Submatrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Haibin Kan, Yuan Li","submitted_at":"2011-07-17T01:18:46Z","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}$. Define $\\mathcal{O}_z$ a first type COD if and only if $\\mathcal{O}_z$ does not contain submatrix {\\pm z_j & 0; \\ 0 & \\pm z^*_j}$ or ${\\pm z^*_j & 0; \\ 0 & \\pm z_j}$. It is already known that, all CODs with maximal rate, i.e., maximal $k/p$, are of the first type.\n  In this pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3268","kind":"arxiv","version":2},"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-18T03:58:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qk+3YMDMIhZ57RBMFRSJ7/0dXydSqeRKa176NJ2mQMHPOikd6GwhPAb53BBYYws5mnrCjufAiVJvmm8LR4CsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:10:31.072012Z"},"content_sha256":"8ab66e5d2a14dae47f69175ffa5ab8d29f8a786c0d6eb813fc3d3b2b9c0ae5a0","schema_version":"1.0","event_id":"sha256:8ab66e5d2a14dae47f69175ffa5ab8d29f8a786c0d6eb813fc3d3b2b9c0ae5a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMHHMQ6YDCBKIS6WBN4AVXO7CP/bundle.json","state_url":"https://pith.science/pith/LMHHMQ6YDCBKIS6WBN4AVXO7CP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMHHMQ6YDCBKIS6WBN4AVXO7CP/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-26T09:10:31Z","links":{"resolver":"https://pith.science/pith/LMHHMQ6YDCBKIS6WBN4AVXO7CP","bundle":"https://pith.science/pith/LMHHMQ6YDCBKIS6WBN4AVXO7CP/bundle.json","state":"https://pith.science/pith/LMHHMQ6YDCBKIS6WBN4AVXO7CP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMHHMQ6YDCBKIS6WBN4AVXO7CP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LMHHMQ6YDCBKIS6WBN4AVXO7CP","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":"43f7b5beffc29bca4b0b8b2f1d383a2856ff304ac8226527af5f75268a1ce6c7","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-17T01:18:46Z","title_canon_sha256":"44d2efa97049de64916f65121ecd1a7ca4e7f48e67321924a1ca7edd1486a3e8"},"schema_version":"1.0","source":{"id":"1107.3268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3268","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3268v2","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3268","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"LMHHMQ6YDCBK","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LMHHMQ6YDCBKIS6W","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LMHHMQ6Y","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:8ab66e5d2a14dae47f69175ffa5ab8d29f8a786c0d6eb813fc3d3b2b9c0ae5a0","target":"graph","created_at":"2026-05-18T03:58:51Z","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}$. Define $\\mathcal{O}_z$ a first type COD if and only if $\\mathcal{O}_z$ does not contain submatrix {\\pm z_j & 0; \\ 0 & \\pm z^*_j}$ or ${\\pm z^*_j & 0; \\ 0 & \\pm z_j}$. It is already known that, all CODs with maximal rate, i.e., maximal $k/p$, are of the first type.\n  In this pa","authors_text":"Haibin Kan, Yuan Li","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-17T01:18:46Z","title":"Complex Orthogonal Designs with Forbidden $2 \\times 2$ Submatrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3268","kind":"arxiv","version":2},"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:e19cdd9632a543993f5c8efb00219b4eda8c1c6705394a84d813178131ca41bc","target":"record","created_at":"2026-05-18T03:58:51Z","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":"43f7b5beffc29bca4b0b8b2f1d383a2856ff304ac8226527af5f75268a1ce6c7","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-17T01:18:46Z","title_canon_sha256":"44d2efa97049de64916f65121ecd1a7ca4e7f48e67321924a1ca7edd1486a3e8"},"schema_version":"1.0","source":{"id":"1107.3268","kind":"arxiv","version":2}},"canonical_sha256":"5b0e7643d81882a44bd60b780adddf13db2d8da8e7fe8662a8c4fda2ee4984d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b0e7643d81882a44bd60b780adddf13db2d8da8e7fe8662a8c4fda2ee4984d0","first_computed_at":"2026-05-18T03:58:51.350786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:51.350786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0o1uK1aLPAf6e01xKGOxjEVsTmDBSq2CUKzZ6KXtDv4/7jCirMaSGgrPfu4HGYx5ZJbxP3Ha4ZLzqcr2zp6IAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:51.351273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e19cdd9632a543993f5c8efb00219b4eda8c1c6705394a84d813178131ca41bc","sha256:8ab66e5d2a14dae47f69175ffa5ab8d29f8a786c0d6eb813fc3d3b2b9c0ae5a0"],"state_sha256":"f294df3be181fe780930ae76f1c589345e7dceb4159bebb0a894129da1b16f5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVF12xoLkPyFKMLa6HEB+GcYk0ZBwLa0X3koP5vsXBev03wd3vf+geeZkWWg4NAcmr304joamYom74cp89mfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:10:31.075733Z","bundle_sha256":"02c9f4723b828305d8ed7a8f02439e1a875555575c7683d1f8b8b28e5f952922"}}