{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WI4FROW3REMVJYKI2KCIAK2Z44","short_pith_number":"pith:WI4FROW3","canonical_record":{"source":{"id":"1003.4302","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-22T22:56:40Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"cb1d852d1f3826a2586fa18229eda80efbf39ae3391b3107031fd4fcff575517","abstract_canon_sha256":"f58fc10b3854d0b0456b53e1dddca485ab7feb505d46d52f9d7706f82b8fb517"},"schema_version":"1.0"},"canonical_sha256":"b23858badb891954e148d284802b59e7286a189f5374abbc475df03a93f6e0a9","source":{"kind":"arxiv","id":"1003.4302","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.4302","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"arxiv_version","alias_value":"1003.4302v3","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.4302","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"pith_short_12","alias_value":"WI4FROW3REMV","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WI4FROW3REMVJYKI","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WI4FROW3","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WI4FROW3REMVJYKI2KCIAK2Z44","target":"record","payload":{"canonical_record":{"source":{"id":"1003.4302","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-22T22:56:40Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"cb1d852d1f3826a2586fa18229eda80efbf39ae3391b3107031fd4fcff575517","abstract_canon_sha256":"f58fc10b3854d0b0456b53e1dddca485ab7feb505d46d52f9d7706f82b8fb517"},"schema_version":"1.0"},"canonical_sha256":"b23858badb891954e148d284802b59e7286a189f5374abbc475df03a93f6e0a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:01.011201Z","signature_b64":"gsDFCtSsVVGHPbxn+J6lpYMVZi+qUn/engfM/aQJWXsOJuE/FNiWw0RsjEGzQ7mYzLfzZtZlYLmVNhuUtbgEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b23858badb891954e148d284802b59e7286a189f5374abbc475df03a93f6e0a9","last_reissued_at":"2026-05-18T03:57:01.010441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:01.010441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.4302","source_version":3,"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-18T03:57:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHJHlq0G0JMhNDsi909S3I0igqPiS4ck+M7cO9Eqp22CwY95PDzNpKZs/pBPHwfU/JPYGNL6wPJJqYMrlNqyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:31:04.689278Z"},"content_sha256":"cce8c8c7fc17d75b2384f61ea8c93fd13cd87f2ce222f90f4fa2c12a11717810","schema_version":"1.0","event_id":"sha256:cce8c8c7fc17d75b2384f61ea8c93fd13cd87f2ce222f90f4fa2c12a11717810"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WI4FROW3REMVJYKI2KCIAK2Z44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Unitary Linear Processing for Amplify-and-Forward Cooperative OFDM systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ben Liang, Mahdi Hajiaghayi, Min Dong","submitted_at":"2010-03-22T22:56:40Z","abstract_excerpt":"In this paper, we consider the amplified-and-forward relaying in an OFDM system with unitary linear processing at the relay. We proposed a general analytical framework to find the unitary linear processing matrix that maximizes the system achievable rate. We show that the optimal processing matrix is a permutation matrix, which implies that a subcarrier pairing strategy is optimal. We further derived the optimal subcarrier pairing schemes for scenarios with and without the direct source-destination path for diversity. Simulation results are presented to demonstrate the achievable gain of optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.4302","kind":"arxiv","version":3},"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-18T03:57:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usr3Z47lFGhbgX1MpJ3yGZuKRpgJtAJ5zyKtwNufW8G1jEHO9aQuKHnIsleOdMMnU85jz3nVyrUhp3wdAWb8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:31:04.689630Z"},"content_sha256":"c85d16f4f4d1623d14607943d9a966a3f31d4a2185b0ce8cabe6cf423dd7742e","schema_version":"1.0","event_id":"sha256:c85d16f4f4d1623d14607943d9a966a3f31d4a2185b0ce8cabe6cf423dd7742e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WI4FROW3REMVJYKI2KCIAK2Z44/bundle.json","state_url":"https://pith.science/pith/WI4FROW3REMVJYKI2KCIAK2Z44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WI4FROW3REMVJYKI2KCIAK2Z44/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-06-09T12:31:04Z","links":{"resolver":"https://pith.science/pith/WI4FROW3REMVJYKI2KCIAK2Z44","bundle":"https://pith.science/pith/WI4FROW3REMVJYKI2KCIAK2Z44/bundle.json","state":"https://pith.science/pith/WI4FROW3REMVJYKI2KCIAK2Z44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WI4FROW3REMVJYKI2KCIAK2Z44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WI4FROW3REMVJYKI2KCIAK2Z44","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":"f58fc10b3854d0b0456b53e1dddca485ab7feb505d46d52f9d7706f82b8fb517","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-22T22:56:40Z","title_canon_sha256":"cb1d852d1f3826a2586fa18229eda80efbf39ae3391b3107031fd4fcff575517"},"schema_version":"1.0","source":{"id":"1003.4302","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.4302","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"arxiv_version","alias_value":"1003.4302v3","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.4302","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"pith_short_12","alias_value":"WI4FROW3REMV","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WI4FROW3REMVJYKI","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WI4FROW3","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:c85d16f4f4d1623d14607943d9a966a3f31d4a2185b0ce8cabe6cf423dd7742e","target":"graph","created_at":"2026-05-18T03:57:01Z","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, we consider the amplified-and-forward relaying in an OFDM system with unitary linear processing at the relay. We proposed a general analytical framework to find the unitary linear processing matrix that maximizes the system achievable rate. We show that the optimal processing matrix is a permutation matrix, which implies that a subcarrier pairing strategy is optimal. We further derived the optimal subcarrier pairing schemes for scenarios with and without the direct source-destination path for diversity. Simulation results are presented to demonstrate the achievable gain of optim","authors_text":"Ben Liang, Mahdi Hajiaghayi, Min Dong","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-22T22:56:40Z","title":"Optimal Unitary Linear Processing for Amplify-and-Forward Cooperative OFDM systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.4302","kind":"arxiv","version":3},"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:cce8c8c7fc17d75b2384f61ea8c93fd13cd87f2ce222f90f4fa2c12a11717810","target":"record","created_at":"2026-05-18T03:57:01Z","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":"f58fc10b3854d0b0456b53e1dddca485ab7feb505d46d52f9d7706f82b8fb517","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-03-22T22:56:40Z","title_canon_sha256":"cb1d852d1f3826a2586fa18229eda80efbf39ae3391b3107031fd4fcff575517"},"schema_version":"1.0","source":{"id":"1003.4302","kind":"arxiv","version":3}},"canonical_sha256":"b23858badb891954e148d284802b59e7286a189f5374abbc475df03a93f6e0a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b23858badb891954e148d284802b59e7286a189f5374abbc475df03a93f6e0a9","first_computed_at":"2026-05-18T03:57:01.010441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:01.010441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gsDFCtSsVVGHPbxn+J6lpYMVZi+qUn/engfM/aQJWXsOJuE/FNiWw0RsjEGzQ7mYzLfzZtZlYLmVNhuUtbgEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:01.011201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.4302","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cce8c8c7fc17d75b2384f61ea8c93fd13cd87f2ce222f90f4fa2c12a11717810","sha256:c85d16f4f4d1623d14607943d9a966a3f31d4a2185b0ce8cabe6cf423dd7742e"],"state_sha256":"988d26ee9e9eceb37c8cfae1a2820be1c979303632ad423d20cde01adec0472c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehNFJA9fYfzg4rYj6/iv5r5xAA0Wb/NhSuGOjhJOIzxPQUHwqEgRxUeNuvfxruGVsZYicksjC2C5n1Z9GZcvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:31:04.691543Z","bundle_sha256":"511d7ae32eb108c167ad6f629d4059f3f656cb9ae8f3371d4f8d8fa7e2b7bf3c"}}