{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:ACRXRU4EJBPOAVU5LZ5FBL6ZR5","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":"553eb3e2fba1f36537cb4190abd87539ab8884239ddaa7331f556088b99058fa","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-06-15T15:14:01Z","title_canon_sha256":"09eb4707be40ead58a9573393436e5ba37f15581b28716915c93413c70a46b9f"},"schema_version":"1.0","source":{"id":"0706.2310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.2310","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"0706.2310v1","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.2310","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"ACRXRU4EJBPO","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"ACRXRU4EJBPOAVU5","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"ACRXRU4E","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:380450d40e8a5348464515f826b8615c4ed6f4f2c9e6a8077fa76472259135d6","target":"graph","created_at":"2026-05-18T00:59:12Z","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":"The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving conditions, which enables a global optimization taking into account channel coding. Thanks to a diversity upperbound derived from the Singleton bound, an appropriate choice of the time dimension of the space-time coding is possible, which maximizes diversity while minimizing complexity. Based on the analysis, an optimized interleaver and a set of linear precoders,","authors_text":"Joseph Boutros, Loic Brunel, Nicolas Gresset","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-06-15T15:14:01Z","title":"Space-time coding techniques with bit-interleaved coded modulations for MIMO block-fading channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.2310","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:7906df361e71f26d77e64f1822d34c1cbeda7dba5c9434e2b4fc27f6d3012430","target":"record","created_at":"2026-05-18T00:59:12Z","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":"553eb3e2fba1f36537cb4190abd87539ab8884239ddaa7331f556088b99058fa","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-06-15T15:14:01Z","title_canon_sha256":"09eb4707be40ead58a9573393436e5ba37f15581b28716915c93413c70a46b9f"},"schema_version":"1.0","source":{"id":"0706.2310","kind":"arxiv","version":1}},"canonical_sha256":"00a378d384485ee0569d5e7a50afd98f5c3ed21392bad3d089165d097149025e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00a378d384485ee0569d5e7a50afd98f5c3ed21392bad3d089165d097149025e","first_computed_at":"2026-05-18T00:59:12.093889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:12.093889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QMm/7wtgGGZvGCHl9M8oyNpZ4rJBNrqIk6S7K4TZ8P2Mp7YtKFfSDLjZ/5Mw6Po0CEOymoO7BWItgvTJUTSaDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:12.094472Z","signed_message":"canonical_sha256_bytes"},"source_id":"0706.2310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7906df361e71f26d77e64f1822d34c1cbeda7dba5c9434e2b4fc27f6d3012430","sha256:380450d40e8a5348464515f826b8615c4ed6f4f2c9e6a8077fa76472259135d6"],"state_sha256":"f9ffdb81c562de863268a41dcaff5a4ae94ac62d633cf942ce2c8b1722796f17"}