{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XGSLFDV4YJNBULX64P6Q42ZW7W","short_pith_number":"pith:XGSLFDV4","canonical_record":{"source":{"id":"1202.5857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-27T08:44:28Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"4f934f386472624949ebf9a5ba4f4e86927cd86e1f0f0c520062196d4044ec2c","abstract_canon_sha256":"2228284a11e55ea22e8c76784acf51432e991e8ed5f6d21fba4e87dcbd596470"},"schema_version":"1.0"},"canonical_sha256":"b9a4b28ebcc25a1a2efee3fd0e6b36fda5aa6b66ab110b68b60216a4f5e9bec1","source":{"kind":"arxiv","id":"1202.5857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5857","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5857v1","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5857","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"XGSLFDV4YJNB","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XGSLFDV4YJNBULX6","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XGSLFDV4","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XGSLFDV4YJNBULX64P6Q42ZW7W","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-27T08:44:28Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"4f934f386472624949ebf9a5ba4f4e86927cd86e1f0f0c520062196d4044ec2c","abstract_canon_sha256":"2228284a11e55ea22e8c76784acf51432e991e8ed5f6d21fba4e87dcbd596470"},"schema_version":"1.0"},"canonical_sha256":"b9a4b28ebcc25a1a2efee3fd0e6b36fda5aa6b66ab110b68b60216a4f5e9bec1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:24.473625Z","signature_b64":"cdPnKsI5Qgr3eNF8VpQ4Fu0at4/TEnny1rrBlcIiQcCY4zDSmcmWjOQgl7bECboy3vFQ9htfbtVrnyGHT39VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a4b28ebcc25a1a2efee3fd0e6b36fda5aa6b66ab110b68b60216a4f5e9bec1","last_reissued_at":"2026-05-18T04:01:24.472901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:24.472901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5857","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-18T04:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zVuigfI/Xeonsu/GqdOAnJp/cg3dJMJj8nmLgR9zPPJJK+CcwScEPvTFqFfAz+VjzKw1gdoOdp4ZgxjQBVZ9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T19:18:22.281193Z"},"content_sha256":"91aa1557a999f5b9527f7d4d06e9c6966b88df3df98ebf98fbc5d29a2b304df4","schema_version":"1.0","event_id":"sha256:91aa1557a999f5b9527f7d4d06e9c6966b88df3df98ebf98fbc5d29a2b304df4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XGSLFDV4YJNBULX64P6Q42ZW7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic Fast-Decodable Relay Codes for Distributed Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Nadya Markin","submitted_at":"2012-02-27T08:44:28Z","abstract_excerpt":"In this paper, fast-decodable lattice code constructions are designed for the nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO) channel. The constructions are based on different types of algebraic structures, e.g. quaternion division algebras. When satisfying certain properties, these algebras provide us with codes whose structure naturally reduces the decoding complexity. The complexity can be further reduced by shortening the block length, i.e., by considering rectangular codes called less than minimum delay (LMD) codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5857","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-18T04:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ea+AZx4BhoT65Eibkg0VZJU131dHaLMWurln7TPjBZSLQAaVkleng3RzRfC5zWjcxQ0D4anh5duuF1XxwxXTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T19:18:22.281863Z"},"content_sha256":"ad6575dd614c7ac208c0e542afc61565e0bff69c37b0a0c78721860a8310c7f1","schema_version":"1.0","event_id":"sha256:ad6575dd614c7ac208c0e542afc61565e0bff69c37b0a0c78721860a8310c7f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGSLFDV4YJNBULX64P6Q42ZW7W/bundle.json","state_url":"https://pith.science/pith/XGSLFDV4YJNBULX64P6Q42ZW7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGSLFDV4YJNBULX64P6Q42ZW7W/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-21T19:18:22Z","links":{"resolver":"https://pith.science/pith/XGSLFDV4YJNBULX64P6Q42ZW7W","bundle":"https://pith.science/pith/XGSLFDV4YJNBULX64P6Q42ZW7W/bundle.json","state":"https://pith.science/pith/XGSLFDV4YJNBULX64P6Q42ZW7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGSLFDV4YJNBULX64P6Q42ZW7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XGSLFDV4YJNBULX64P6Q42ZW7W","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":"2228284a11e55ea22e8c76784acf51432e991e8ed5f6d21fba4e87dcbd596470","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-27T08:44:28Z","title_canon_sha256":"4f934f386472624949ebf9a5ba4f4e86927cd86e1f0f0c520062196d4044ec2c"},"schema_version":"1.0","source":{"id":"1202.5857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5857","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5857v1","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5857","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"XGSLFDV4YJNB","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XGSLFDV4YJNBULX6","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XGSLFDV4","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:ad6575dd614c7ac208c0e542afc61565e0bff69c37b0a0c78721860a8310c7f1","target":"graph","created_at":"2026-05-18T04:01:24Z","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 paper, fast-decodable lattice code constructions are designed for the nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO) channel. The constructions are based on different types of algebraic structures, e.g. quaternion division algebras. When satisfying certain properties, these algebras provide us with codes whose structure naturally reduces the decoding complexity. The complexity can be further reduced by shortening the block length, i.e., by considering rectangular codes called less than minimum delay (LMD) codes.","authors_text":"Camilla Hollanti, Nadya Markin","cross_cats":["math.IT","math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-27T08:44:28Z","title":"Algebraic Fast-Decodable Relay Codes for Distributed Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5857","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:91aa1557a999f5b9527f7d4d06e9c6966b88df3df98ebf98fbc5d29a2b304df4","target":"record","created_at":"2026-05-18T04:01:24Z","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":"2228284a11e55ea22e8c76784acf51432e991e8ed5f6d21fba4e87dcbd596470","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-27T08:44:28Z","title_canon_sha256":"4f934f386472624949ebf9a5ba4f4e86927cd86e1f0f0c520062196d4044ec2c"},"schema_version":"1.0","source":{"id":"1202.5857","kind":"arxiv","version":1}},"canonical_sha256":"b9a4b28ebcc25a1a2efee3fd0e6b36fda5aa6b66ab110b68b60216a4f5e9bec1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9a4b28ebcc25a1a2efee3fd0e6b36fda5aa6b66ab110b68b60216a4f5e9bec1","first_computed_at":"2026-05-18T04:01:24.472901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:24.472901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cdPnKsI5Qgr3eNF8VpQ4Fu0at4/TEnny1rrBlcIiQcCY4zDSmcmWjOQgl7bECboy3vFQ9htfbtVrnyGHT39VCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:24.473625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91aa1557a999f5b9527f7d4d06e9c6966b88df3df98ebf98fbc5d29a2b304df4","sha256:ad6575dd614c7ac208c0e542afc61565e0bff69c37b0a0c78721860a8310c7f1"],"state_sha256":"a7dd38e02a9389428cfa5bf5c8bac1c62a6ab1fe241daa0ba7b532a38a6ee3c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPNPnJy0Oh9UYVFNRCwdVL0weNF9YsVEYGB7u3ZWz/Ms1Z9MzTIbfd6YOMR+IjKZrYi8hg0+mAFE+aq7c8hWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T19:18:22.284951Z","bundle_sha256":"84fc34d6fbd26f08d47a18ffd4fad40b01dcf373fed6dd8021668fe552b45f6f"}}