{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:KWH4Q2NXWHEK2A5JATET73JXVI","short_pith_number":"pith:KWH4Q2NX","schema_version":"1.0","canonical_sha256":"558fc869b7b1c8ad03a904c93fed37aa05fc1c883c5eec00a36ec27bd1096531","source":{"kind":"arxiv","id":"math/0312467","version":1},"attestation_state":"computed","paper":{"title":"Nonintersecting Subspaces Based on Finite Alphabets","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. R. Calderbank, Frederique E. Oggier, N. J. A. Sloane, Suhas N. Diggavi","submitted_at":"2003-12-26T17:44:34Z","abstract_excerpt":"Two subspaces of a vector space are here called ``nonintersecting'' if they meet only in the zero vector. The following problem arises in the design of noncoherent multiple-antenna communications systems. How many pairwise nonintersecting M_t-dimensional subspaces of an m-dimensional vector space V over a field F can be found, if the generator matrices for the subspaces may contain only symbols from a given finite alphabet A subseteq F? The most important case is when F is the field of complex numbers C; then M_t is the number of antennas. If A = F = GF(q) it is shown that the number of nonint"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"math/0312467","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-12-26T17:44:34Z","cross_cats_sorted":[],"title_canon_sha256":"cbef05960f35724f217d3eb3926243d4bc11ff6a10beefdf26b9f3fae87b9db7","abstract_canon_sha256":"b4770b437543e67b196af418c5559fd36248a6e15c66d1f94bfe7cca391f06fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:40.004391Z","signature_b64":"LcYqHnw+GNCpjACRrGWLzjHrTwoBg8o/HfSlfIew4RXtuTUdLZV+pADMRxcjHUFkA8lZApR/yp0zdCYA3eWEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"558fc869b7b1c8ad03a904c93fed37aa05fc1c883c5eec00a36ec27bd1096531","last_reissued_at":"2026-05-18T02:42:40.003724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:40.003724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonintersecting Subspaces Based on Finite Alphabets","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. R. Calderbank, Frederique E. Oggier, N. J. A. Sloane, Suhas N. Diggavi","submitted_at":"2003-12-26T17:44:34Z","abstract_excerpt":"Two subspaces of a vector space are here called ``nonintersecting'' if they meet only in the zero vector. The following problem arises in the design of noncoherent multiple-antenna communications systems. How many pairwise nonintersecting M_t-dimensional subspaces of an m-dimensional vector space V over a field F can be found, if the generator matrices for the subspaces may contain only symbols from a given finite alphabet A subseteq F? The most important case is when F is the field of complex numbers C; then M_t is the number of antennas. If A = F = GF(q) it is shown that the number of nonint"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0312467","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0312467","created_at":"2026-05-18T02:42:40.003829+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0312467v1","created_at":"2026-05-18T02:42:40.003829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0312467","created_at":"2026-05-18T02:42:40.003829+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWH4Q2NXWHEK","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWH4Q2NXWHEK2A5J","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWH4Q2NX","created_at":"2026-05-18T12:25:52.051335+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KWH4Q2NXWHEK2A5JATET73JXVI","json":"https://pith.science/pith/KWH4Q2NXWHEK2A5JATET73JXVI.json","graph_json":"https://pith.science/api/pith-number/KWH4Q2NXWHEK2A5JATET73JXVI/graph.json","events_json":"https://pith.science/api/pith-number/KWH4Q2NXWHEK2A5JATET73JXVI/events.json","paper":"https://pith.science/paper/KWH4Q2NX"},"agent_actions":{"view_html":"https://pith.science/pith/KWH4Q2NXWHEK2A5JATET73JXVI","download_json":"https://pith.science/pith/KWH4Q2NXWHEK2A5JATET73JXVI.json","view_paper":"https://pith.science/paper/KWH4Q2NX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0312467&json=true","fetch_graph":"https://pith.science/api/pith-number/KWH4Q2NXWHEK2A5JATET73JXVI/graph.json","fetch_events":"https://pith.science/api/pith-number/KWH4Q2NXWHEK2A5JATET73JXVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWH4Q2NXWHEK2A5JATET73JXVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWH4Q2NXWHEK2A5JATET73JXVI/action/storage_attestation","attest_author":"https://pith.science/pith/KWH4Q2NXWHEK2A5JATET73JXVI/action/author_attestation","sign_citation":"https://pith.science/pith/KWH4Q2NXWHEK2A5JATET73JXVI/action/citation_signature","submit_replication":"https://pith.science/pith/KWH4Q2NXWHEK2A5JATET73JXVI/action/replication_record"}},"created_at":"2026-05-18T02:42:40.003829+00:00","updated_at":"2026-05-18T02:42:40.003829+00:00"}