{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:64WT5BAX6PSKNU5QSYSL2ODEWS","short_pith_number":"pith:64WT5BAX","schema_version":"1.0","canonical_sha256":"f72d3e8417f3e4a6d3b09624bd3864b4b387a41e6f799d08325dc3e48706a82c","source":{"kind":"arxiv","id":"1301.5695","version":2},"attestation_state":"computed","paper":{"title":"Optimal Amplify-and-Forward Schemes for Relay Channels with Correlated Relay Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Binyue Liu, Ning Cai, Ye Yang","submitted_at":"2013-01-24T03:58:39Z","abstract_excerpt":"This paper investigates amplify-and-forward (AF) schemes for both one and two-way relay channels. Unlike most existing works assuming independent noise at the relays, we consider a more general scenario with correlated relay noise. We first propose an approach to efficiently solve a class of quadratically constrained fractional problems via second-order cone programming (SOCP). Then it is shown that the AF relay optimization problems studied in this paper can be incorporated into such quadratically constrained fractional problems. As a consequence, the proposed approach can be used as a unifie"},"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":"1301.5695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T03:58:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a83fed8d01bada9c7c8037c2b02734b6a49cc0d55cb41eee304f7725bb8bed4d","abstract_canon_sha256":"96349010b17a7c97b55a220cb15435a67c1c81ccd8a67408f0904bbb8bbfa4d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:04.522032Z","signature_b64":"Vq6QI6wC4/fCLDEKWJZ9zJx3Ui8CkMzuYoYxXw/SqKBWdz6MWvCzdIW+5V7qyxW6oxOQUIvMrCISo/G4ujmjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f72d3e8417f3e4a6d3b09624bd3864b4b387a41e6f799d08325dc3e48706a82c","last_reissued_at":"2026-05-18T03:19:04.521477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:04.521477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Amplify-and-Forward Schemes for Relay Channels with Correlated Relay Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Binyue Liu, Ning Cai, Ye Yang","submitted_at":"2013-01-24T03:58:39Z","abstract_excerpt":"This paper investigates amplify-and-forward (AF) schemes for both one and two-way relay channels. Unlike most existing works assuming independent noise at the relays, we consider a more general scenario with correlated relay noise. We first propose an approach to efficiently solve a class of quadratically constrained fractional problems via second-order cone programming (SOCP). Then it is shown that the AF relay optimization problems studied in this paper can be incorporated into such quadratically constrained fractional problems. As a consequence, the proposed approach can be used as a unifie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5695","kind":"arxiv","version":2},"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":"1301.5695","created_at":"2026-05-18T03:19:04.521562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5695v2","created_at":"2026-05-18T03:19:04.521562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5695","created_at":"2026-05-18T03:19:04.521562+00:00"},{"alias_kind":"pith_short_12","alias_value":"64WT5BAX6PSK","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"64WT5BAX6PSKNU5Q","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"64WT5BAX","created_at":"2026-05-18T12:27:34.582898+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/64WT5BAX6PSKNU5QSYSL2ODEWS","json":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS.json","graph_json":"https://pith.science/api/pith-number/64WT5BAX6PSKNU5QSYSL2ODEWS/graph.json","events_json":"https://pith.science/api/pith-number/64WT5BAX6PSKNU5QSYSL2ODEWS/events.json","paper":"https://pith.science/paper/64WT5BAX"},"agent_actions":{"view_html":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS","download_json":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS.json","view_paper":"https://pith.science/paper/64WT5BAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5695&json=true","fetch_graph":"https://pith.science/api/pith-number/64WT5BAX6PSKNU5QSYSL2ODEWS/graph.json","fetch_events":"https://pith.science/api/pith-number/64WT5BAX6PSKNU5QSYSL2ODEWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/action/storage_attestation","attest_author":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/action/author_attestation","sign_citation":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/action/citation_signature","submit_replication":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/action/replication_record"}},"created_at":"2026-05-18T03:19:04.521562+00:00","updated_at":"2026-05-18T03:19:04.521562+00:00"}