{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MGURBBFTUJXIJKVZR3ISKH5NZX","short_pith_number":"pith:MGURBBFT","canonical_record":{"source":{"id":"1212.6074","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-25T18:40:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a05f276eda3b3f263b89aad5e463dd0e6c97d0336f39510a77c48514f690295","abstract_canon_sha256":"2346c4c918f60080cf77a3dd3abd650ab1d9333f93b34e25da5131f480f0e6d6"},"schema_version":"1.0"},"canonical_sha256":"61a91084b3a26e84aab98ed1251fadcdcc89d6c79ac8e388b6d39f41aa229768","source":{"kind":"arxiv","id":"1212.6074","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6074","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6074v4","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6074","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"MGURBBFTUJXI","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MGURBBFTUJXIJKVZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MGURBBFT","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MGURBBFTUJXIJKVZR3ISKH5NZX","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6074","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-25T18:40:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a05f276eda3b3f263b89aad5e463dd0e6c97d0336f39510a77c48514f690295","abstract_canon_sha256":"2346c4c918f60080cf77a3dd3abd650ab1d9333f93b34e25da5131f480f0e6d6"},"schema_version":"1.0"},"canonical_sha256":"61a91084b3a26e84aab98ed1251fadcdcc89d6c79ac8e388b6d39f41aa229768","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:55.925755Z","signature_b64":"FtY5/MgYGg2LW2QnBwSijrZdmMOWptdezYDrRRri0u+/JrtzrmM4OHa81PKaYjKmGA8qfKucOrSSe1P6qCgdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61a91084b3a26e84aab98ed1251fadcdcc89d6c79ac8e388b6d39f41aa229768","last_reissued_at":"2026-05-18T02:03:55.925005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:55.925005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6074","source_version":4,"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-18T02:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHMiLOly8dH67fzT2e/DmxIVXHz9uS+1MutXragiEcz/jnV/n2wTyG6PVE6tDtNFauyYSDe/7frGcqKv6hHxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T07:57:02.198001Z"},"content_sha256":"96a69224e60c3621ea3147937d79e897ca6337cd45ed425936fe6055a136f9ad","schema_version":"1.0","event_id":"sha256:96a69224e60c3621ea3147937d79e897ca6337cd45ed425936fe6055a136f9ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MGURBBFTUJXIJKVZR3ISKH5NZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Diversity-Multiplexing Tradeoff of Unconstrained Multiple-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Meir Feder, Yair Yona","submitted_at":"2012-12-25T18:40:48Z","abstract_excerpt":"In this work the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channels with no power constraints (infinite constellations). For K users (K>1), M transmit antennas for each user, and N receive antennas, infinite constellations in general and lattices in particular are shown to attain the optimal DMT of finite constellations for the case N equals or greater than (K+1)M-1, i.e., user limited regime. On the other hand for N<(K+1)M-1 it is shown that infinite constellations can not attain the optimal DMT. This is in cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6074","kind":"arxiv","version":4},"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-18T02:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zNbE9arGNO2wWq2i37Ib6SBD3G5HAkYaI63j2F3gsnq/5LDwPnxrLh2PlcyQpPBPStiMgpcVz2qPsipRI0l8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T07:57:02.198448Z"},"content_sha256":"bb8e47897ffa89ad4acae751157c4cebb3b1725e8a6ca8049341c5bf818f8f98","schema_version":"1.0","event_id":"sha256:bb8e47897ffa89ad4acae751157c4cebb3b1725e8a6ca8049341c5bf818f8f98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGURBBFTUJXIJKVZR3ISKH5NZX/bundle.json","state_url":"https://pith.science/pith/MGURBBFTUJXIJKVZR3ISKH5NZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGURBBFTUJXIJKVZR3ISKH5NZX/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-08-23T07:57:02Z","links":{"resolver":"https://pith.science/pith/MGURBBFTUJXIJKVZR3ISKH5NZX","bundle":"https://pith.science/pith/MGURBBFTUJXIJKVZR3ISKH5NZX/bundle.json","state":"https://pith.science/pith/MGURBBFTUJXIJKVZR3ISKH5NZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGURBBFTUJXIJKVZR3ISKH5NZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MGURBBFTUJXIJKVZR3ISKH5NZX","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":"2346c4c918f60080cf77a3dd3abd650ab1d9333f93b34e25da5131f480f0e6d6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-25T18:40:48Z","title_canon_sha256":"7a05f276eda3b3f263b89aad5e463dd0e6c97d0336f39510a77c48514f690295"},"schema_version":"1.0","source":{"id":"1212.6074","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6074","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6074v4","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6074","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"MGURBBFTUJXI","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MGURBBFTUJXIJKVZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MGURBBFT","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:bb8e47897ffa89ad4acae751157c4cebb3b1725e8a6ca8049341c5bf818f8f98","target":"graph","created_at":"2026-05-18T02:03:55Z","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":"In this work the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channels with no power constraints (infinite constellations). For K users (K>1), M transmit antennas for each user, and N receive antennas, infinite constellations in general and lattices in particular are shown to attain the optimal DMT of finite constellations for the case N equals or greater than (K+1)M-1, i.e., user limited regime. On the other hand for N<(K+1)M-1 it is shown that infinite constellations can not attain the optimal DMT. This is in cont","authors_text":"Meir Feder, Yair Yona","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-25T18:40:48Z","title":"On the Diversity-Multiplexing Tradeoff of Unconstrained Multiple-Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6074","kind":"arxiv","version":4},"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:96a69224e60c3621ea3147937d79e897ca6337cd45ed425936fe6055a136f9ad","target":"record","created_at":"2026-05-18T02:03:55Z","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":"2346c4c918f60080cf77a3dd3abd650ab1d9333f93b34e25da5131f480f0e6d6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-25T18:40:48Z","title_canon_sha256":"7a05f276eda3b3f263b89aad5e463dd0e6c97d0336f39510a77c48514f690295"},"schema_version":"1.0","source":{"id":"1212.6074","kind":"arxiv","version":4}},"canonical_sha256":"61a91084b3a26e84aab98ed1251fadcdcc89d6c79ac8e388b6d39f41aa229768","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61a91084b3a26e84aab98ed1251fadcdcc89d6c79ac8e388b6d39f41aa229768","first_computed_at":"2026-05-18T02:03:55.925005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:55.925005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FtY5/MgYGg2LW2QnBwSijrZdmMOWptdezYDrRRri0u+/JrtzrmM4OHa81PKaYjKmGA8qfKucOrSSe1P6qCgdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:55.925755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6074","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96a69224e60c3621ea3147937d79e897ca6337cd45ed425936fe6055a136f9ad","sha256:bb8e47897ffa89ad4acae751157c4cebb3b1725e8a6ca8049341c5bf818f8f98"],"state_sha256":"2c5dcea48efc5f2c98f5341653618bfaf5164344a9ff4d3ccb1174b62feb957e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j4n4et0wkYZpxR5g1Joj8p62v965T/0wgFx9A+NAn1O7PfGU7HMFIigNKXuYRI04ICYaM2LD395HCwCjycJzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T07:57:02.203651Z","bundle_sha256":"c9bb2df711dc21b2a0a45d8c5f2245a0d433835e45b5432f11d41004b3a8e95b"}}