{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BLHRBEYAUPMKRTG5V37TQU56UD","short_pith_number":"pith:BLHRBEYA","schema_version":"1.0","canonical_sha256":"0acf109300a3d8a8ccddaeff3853bea0fe06489cbdca7417c44b937428ae0ab1","source":{"kind":"arxiv","id":"1504.05058","version":1},"attestation_state":"computed","paper":{"title":"Constructions of Fast-Decodable Distributed Space-Time Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amaro Barreal, Camilla Hollanti, Nadya Markin","submitted_at":"2015-04-20T13:43:46Z","abstract_excerpt":"Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable 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":"1504.05058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T13:43:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a6c3d6cceaafae45a70ae749c78a6c5915dc9fa080a4163233b6b397678c75b0","abstract_canon_sha256":"1340d9d392cd43edbbe39a169b5e1c17afe26dcf347489edf07744788fc0db95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:22.744605Z","signature_b64":"bKIm0nIuvO8Scacm7Q35or5iULd3oiEpLGV9m13xsOeW3VNxv6vXqCY+b+v/XehEAxiB8MVChWPlkyVSm2keBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0acf109300a3d8a8ccddaeff3853bea0fe06489cbdca7417c44b937428ae0ab1","last_reissued_at":"2026-05-18T02:18:22.743905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:22.743905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions of Fast-Decodable Distributed Space-Time Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amaro Barreal, Camilla Hollanti, Nadya Markin","submitted_at":"2015-04-20T13:43:46Z","abstract_excerpt":"Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05058","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":"1504.05058","created_at":"2026-05-18T02:18:22.743996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05058v1","created_at":"2026-05-18T02:18:22.743996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05058","created_at":"2026-05-18T02:18:22.743996+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLHRBEYAUPMK","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLHRBEYAUPMKRTG5","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLHRBEYA","created_at":"2026-05-18T12:29:14.074870+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/BLHRBEYAUPMKRTG5V37TQU56UD","json":"https://pith.science/pith/BLHRBEYAUPMKRTG5V37TQU56UD.json","graph_json":"https://pith.science/api/pith-number/BLHRBEYAUPMKRTG5V37TQU56UD/graph.json","events_json":"https://pith.science/api/pith-number/BLHRBEYAUPMKRTG5V37TQU56UD/events.json","paper":"https://pith.science/paper/BLHRBEYA"},"agent_actions":{"view_html":"https://pith.science/pith/BLHRBEYAUPMKRTG5V37TQU56UD","download_json":"https://pith.science/pith/BLHRBEYAUPMKRTG5V37TQU56UD.json","view_paper":"https://pith.science/paper/BLHRBEYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05058&json=true","fetch_graph":"https://pith.science/api/pith-number/BLHRBEYAUPMKRTG5V37TQU56UD/graph.json","fetch_events":"https://pith.science/api/pith-number/BLHRBEYAUPMKRTG5V37TQU56UD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLHRBEYAUPMKRTG5V37TQU56UD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLHRBEYAUPMKRTG5V37TQU56UD/action/storage_attestation","attest_author":"https://pith.science/pith/BLHRBEYAUPMKRTG5V37TQU56UD/action/author_attestation","sign_citation":"https://pith.science/pith/BLHRBEYAUPMKRTG5V37TQU56UD/action/citation_signature","submit_replication":"https://pith.science/pith/BLHRBEYAUPMKRTG5V37TQU56UD/action/replication_record"}},"created_at":"2026-05-18T02:18:22.743996+00:00","updated_at":"2026-05-18T02:18:22.743996+00:00"}