{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EYOKUXZ4MMZVEIPWNEVTDMUDFM","short_pith_number":"pith:EYOKUXZ4","schema_version":"1.0","canonical_sha256":"261caa5f3c63335221f6692b31b2832b1f90576af81589d3e225bf4b4d880e57","source":{"kind":"arxiv","id":"1202.0675","version":1},"attestation_state":"computed","paper":{"title":"Construction of MIMO MAC Codes Achieving the Pigeon Hole Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.RA","authors_text":"Roope Vehkalahti, Toni Ernvall","submitted_at":"2012-02-03T12:13:06Z","abstract_excerpt":"This paper provides a general construction method for multiple-input multiple-output multiple access channel codes (MIMO MAC codes) that have so called generalized full rank property. The achieved constructions give a positive answer to the question whether it is generally possible to reach the so called pigeon hole bound, that is an upper bound for the decay of determinants of MIMO-MAC channel codes."},"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":"1202.0675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2012-02-03T12:13:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"65919f259595792e95dc29f261aa0a4bb8e58a22a230e8373d64a671c6039b46","abstract_canon_sha256":"af1c86bf7b09104fb0000dd12bdb9f7356be7c81c8e1dbfabd770c22e0e8e334"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:34.419490Z","signature_b64":"YUkuWiA++BGGuSzxjnlN9HVE20uE0wfmp9xkWsvktemtXqRGDnLA3bxnIJNet/FoCC0GfHWutX+G1IFUswrgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"261caa5f3c63335221f6692b31b2832b1f90576af81589d3e225bf4b4d880e57","last_reissued_at":"2026-05-18T02:19:34.418936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:34.418936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of MIMO MAC Codes Achieving the Pigeon Hole Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.RA","authors_text":"Roope Vehkalahti, Toni Ernvall","submitted_at":"2012-02-03T12:13:06Z","abstract_excerpt":"This paper provides a general construction method for multiple-input multiple-output multiple access channel codes (MIMO MAC codes) that have so called generalized full rank property. The achieved constructions give a positive answer to the question whether it is generally possible to reach the so called pigeon hole bound, that is an upper bound for the decay of determinants of MIMO-MAC channel codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0675","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":"1202.0675","created_at":"2026-05-18T02:19:34.419024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0675v1","created_at":"2026-05-18T02:19:34.419024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0675","created_at":"2026-05-18T02:19:34.419024+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYOKUXZ4MMZV","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYOKUXZ4MMZVEIPW","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYOKUXZ4","created_at":"2026-05-18T12:27:04.183437+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/EYOKUXZ4MMZVEIPWNEVTDMUDFM","json":"https://pith.science/pith/EYOKUXZ4MMZVEIPWNEVTDMUDFM.json","graph_json":"https://pith.science/api/pith-number/EYOKUXZ4MMZVEIPWNEVTDMUDFM/graph.json","events_json":"https://pith.science/api/pith-number/EYOKUXZ4MMZVEIPWNEVTDMUDFM/events.json","paper":"https://pith.science/paper/EYOKUXZ4"},"agent_actions":{"view_html":"https://pith.science/pith/EYOKUXZ4MMZVEIPWNEVTDMUDFM","download_json":"https://pith.science/pith/EYOKUXZ4MMZVEIPWNEVTDMUDFM.json","view_paper":"https://pith.science/paper/EYOKUXZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0675&json=true","fetch_graph":"https://pith.science/api/pith-number/EYOKUXZ4MMZVEIPWNEVTDMUDFM/graph.json","fetch_events":"https://pith.science/api/pith-number/EYOKUXZ4MMZVEIPWNEVTDMUDFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYOKUXZ4MMZVEIPWNEVTDMUDFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYOKUXZ4MMZVEIPWNEVTDMUDFM/action/storage_attestation","attest_author":"https://pith.science/pith/EYOKUXZ4MMZVEIPWNEVTDMUDFM/action/author_attestation","sign_citation":"https://pith.science/pith/EYOKUXZ4MMZVEIPWNEVTDMUDFM/action/citation_signature","submit_replication":"https://pith.science/pith/EYOKUXZ4MMZVEIPWNEVTDMUDFM/action/replication_record"}},"created_at":"2026-05-18T02:19:34.419024+00:00","updated_at":"2026-05-18T02:19:34.419024+00:00"}