{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AUH44O5LJEEFUG7HXJ4N4UPRKW","short_pith_number":"pith:AUH44O5L","canonical_record":{"source":{"id":"1408.4630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-20T12:52:19Z","cross_cats_sorted":["math.IT","math.NT","math.RA"],"title_canon_sha256":"e68a26394bbe9f00cf3512b254a426ce77a7ce8f0f607ac49271ca948e30207c","abstract_canon_sha256":"d3504334e08ee628626557202a3bc240a5aaaca149355c850ae1c9f00457d0bd"},"schema_version":"1.0"},"canonical_sha256":"050fce3bab49085a1be7ba78de51f15585628208ccae53a49c1bd82dde77948f","source":{"kind":"arxiv","id":"1408.4630","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4630","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4630v1","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4630","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"AUH44O5LJEEF","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AUH44O5LJEEFUG7H","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AUH44O5L","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AUH44O5LJEEFUG7HXJ4N4UPRKW","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-20T12:52:19Z","cross_cats_sorted":["math.IT","math.NT","math.RA"],"title_canon_sha256":"e68a26394bbe9f00cf3512b254a426ce77a7ce8f0f607ac49271ca948e30207c","abstract_canon_sha256":"d3504334e08ee628626557202a3bc240a5aaaca149355c850ae1c9f00457d0bd"},"schema_version":"1.0"},"canonical_sha256":"050fce3bab49085a1be7ba78de51f15585628208ccae53a49c1bd82dde77948f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:48.496355Z","signature_b64":"Uo4FJYoyOZLDgBFUzGGzB3pEIT5O1xe+PaTtGzKillqPlEKq5rIbj9j3JzHPXOd7/7Ct/rgcUznfZ+Dsokw+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"050fce3bab49085a1be7ba78de51f15585628208ccae53a49c1bd82dde77948f","last_reissued_at":"2026-05-18T02:44:48.495994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:48.495994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4630","source_version":1,"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:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygEMoemN2RQ9AFgpPAxBJaG/0Txk/4tdED0lsFyT4ceXNR1QdXf4kijeiVeLYDspxRZ7qRIz+UQ8Ck4r29GzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:14:04.381865Z"},"content_sha256":"947c4ff411e74f4cf95e2a2c03f2a70e7bfe551160e81b639328a27e5186839a","schema_version":"1.0","event_id":"sha256:947c4ff411e74f4cf95e2a2c03f2a70e7bfe551160e81b639328a27e5186839a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AUH44O5LJEEFUG7HXJ4N4UPRKW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A non-commutative analogue of the Odlyzko bounds and bounds on performance for space-time lattice codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT","math.RA"],"primary_cat":"cs.IT","authors_text":"Benjamin Linowitz, Matthew Satriano, Roope Vehkalahti","submitted_at":"2014-08-20T12:52:19Z","abstract_excerpt":"This paper considers space-time coding over several independently Rayleigh faded blocks. In particular we will concentrate on giving upper bounds for the coding gain of lattice space-time codes as the number of blocks grow. This problem was previously considered in the single antenna case by Bayer et al. in 2006. Crucial to their work was Odlyzko's bound on the discriminant of an algebraic number field, as this provides an upper bound for the normalized coding gain of number field codes. In the MIMO context natural codes are constructed from division algebras defined over number fields and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4630","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"},"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:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYt/79g7nZU7a+4BOcOIuyZgcwaoWLVzUIjDrFYuseUCa7SpPwH8PrnD8Jk7OP2UGWkaweoEK8P8geShvkNtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:14:04.382646Z"},"content_sha256":"1064ba9e59a8980b128acdc2feda9b988df733d92cba359b66b60adb2bf17c3e","schema_version":"1.0","event_id":"sha256:1064ba9e59a8980b128acdc2feda9b988df733d92cba359b66b60adb2bf17c3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AUH44O5LJEEFUG7HXJ4N4UPRKW/bundle.json","state_url":"https://pith.science/pith/AUH44O5LJEEFUG7HXJ4N4UPRKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AUH44O5LJEEFUG7HXJ4N4UPRKW/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-31T00:14:04Z","links":{"resolver":"https://pith.science/pith/AUH44O5LJEEFUG7HXJ4N4UPRKW","bundle":"https://pith.science/pith/AUH44O5LJEEFUG7HXJ4N4UPRKW/bundle.json","state":"https://pith.science/pith/AUH44O5LJEEFUG7HXJ4N4UPRKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AUH44O5LJEEFUG7HXJ4N4UPRKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AUH44O5LJEEFUG7HXJ4N4UPRKW","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":"d3504334e08ee628626557202a3bc240a5aaaca149355c850ae1c9f00457d0bd","cross_cats_sorted":["math.IT","math.NT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-20T12:52:19Z","title_canon_sha256":"e68a26394bbe9f00cf3512b254a426ce77a7ce8f0f607ac49271ca948e30207c"},"schema_version":"1.0","source":{"id":"1408.4630","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4630","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4630v1","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4630","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"AUH44O5LJEEF","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AUH44O5LJEEFUG7H","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AUH44O5L","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:1064ba9e59a8980b128acdc2feda9b988df733d92cba359b66b60adb2bf17c3e","target":"graph","created_at":"2026-05-18T02:44:48Z","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":"This paper considers space-time coding over several independently Rayleigh faded blocks. In particular we will concentrate on giving upper bounds for the coding gain of lattice space-time codes as the number of blocks grow. This problem was previously considered in the single antenna case by Bayer et al. in 2006. Crucial to their work was Odlyzko's bound on the discriminant of an algebraic number field, as this provides an upper bound for the normalized coding gain of number field codes. In the MIMO context natural codes are constructed from division algebras defined over number fields and the","authors_text":"Benjamin Linowitz, Matthew Satriano, Roope Vehkalahti","cross_cats":["math.IT","math.NT","math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-20T12:52:19Z","title":"A non-commutative analogue of the Odlyzko bounds and bounds on performance for space-time lattice codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4630","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:947c4ff411e74f4cf95e2a2c03f2a70e7bfe551160e81b639328a27e5186839a","target":"record","created_at":"2026-05-18T02:44:48Z","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":"d3504334e08ee628626557202a3bc240a5aaaca149355c850ae1c9f00457d0bd","cross_cats_sorted":["math.IT","math.NT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-20T12:52:19Z","title_canon_sha256":"e68a26394bbe9f00cf3512b254a426ce77a7ce8f0f607ac49271ca948e30207c"},"schema_version":"1.0","source":{"id":"1408.4630","kind":"arxiv","version":1}},"canonical_sha256":"050fce3bab49085a1be7ba78de51f15585628208ccae53a49c1bd82dde77948f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"050fce3bab49085a1be7ba78de51f15585628208ccae53a49c1bd82dde77948f","first_computed_at":"2026-05-18T02:44:48.495994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:48.495994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uo4FJYoyOZLDgBFUzGGzB3pEIT5O1xe+PaTtGzKillqPlEKq5rIbj9j3JzHPXOd7/7Ct/rgcUznfZ+Dsokw+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:48.496355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4630","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:947c4ff411e74f4cf95e2a2c03f2a70e7bfe551160e81b639328a27e5186839a","sha256:1064ba9e59a8980b128acdc2feda9b988df733d92cba359b66b60adb2bf17c3e"],"state_sha256":"614575e433e1e2dae001988568b2ec4112b89e6033710c78f0b87ea5d05f512c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R7oKZnX9jTIypKOyUAjTIF9OkGeKhWnV4odkJoUXPAWn4Xj04vOJquwgK4K7BoM+U7WHl6gHKXojPGE3eGNxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:14:04.386671Z","bundle_sha256":"5ad50d8fe3bd09673d3d2a651a450a76abd68974dbf6d760e547d96052edc37a"}}