{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:64WT5BAX6PSKNU5QSYSL2ODEWS","short_pith_number":"pith:64WT5BAX","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"},"canonical_sha256":"f72d3e8417f3e4a6d3b09624bd3864b4b387a41e6f799d08325dc3e48706a82c","source":{"kind":"arxiv","id":"1301.5695","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5695","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5695v2","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5695","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"64WT5BAX6PSK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"64WT5BAX6PSKNU5Q","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"64WT5BAX","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:64WT5BAX6PSKNU5QSYSL2ODEWS","target":"record","payload":{"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"},"canonical_sha256":"f72d3e8417f3e4a6d3b09624bd3864b4b387a41e6f799d08325dc3e48706a82c","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"},"source_kind":"arxiv","source_id":"1301.5695","source_version":2,"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:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aW58Yjw6TnMcU2/RQamuYHd2YLMrwtbLy0QmeF+W5gbMvi/p8cFEi2hVJK4FUM/NCo70h6W5o1FBSwlNJRGCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T04:08:41.731506Z"},"content_sha256":"3970bb49f31ee8612607f4b3906a43f9e0fea0b0e158b96973e328a9f10f7a4a","schema_version":"1.0","event_id":"sha256:3970bb49f31ee8612607f4b3906a43f9e0fea0b0e158b96973e328a9f10f7a4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:64WT5BAX6PSKNU5QSYSL2ODEWS","target":"graph","payload":{"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"},"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:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkFuZdR+mB7Pynf76le7Y/kyKvemYCRKMe+saBnofotZorHlJt4gK7OftPJU97U93l0dOYJrIoWmIKvs1hh9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T04:08:41.732208Z"},"content_sha256":"80e45e09bcafb324c9722a4232d3e9a3172c68ed852254522568c1c4fcff63cc","schema_version":"1.0","event_id":"sha256:80e45e09bcafb324c9722a4232d3e9a3172c68ed852254522568c1c4fcff63cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/bundle.json","state_url":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/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-06T04:08:41Z","links":{"resolver":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS","bundle":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/bundle.json","state":"https://pith.science/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64WT5BAX6PSKNU5QSYSL2ODEWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:64WT5BAX6PSKNU5QSYSL2ODEWS","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":"96349010b17a7c97b55a220cb15435a67c1c81ccd8a67408f0904bbb8bbfa4d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T03:58:39Z","title_canon_sha256":"a83fed8d01bada9c7c8037c2b02734b6a49cc0d55cb41eee304f7725bb8bed4d"},"schema_version":"1.0","source":{"id":"1301.5695","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5695","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5695v2","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5695","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"64WT5BAX6PSK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"64WT5BAX6PSKNU5Q","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"64WT5BAX","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:80e45e09bcafb324c9722a4232d3e9a3172c68ed852254522568c1c4fcff63cc","target":"graph","created_at":"2026-05-18T03:19:04Z","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":"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","authors_text":"Binyue Liu, Ning Cai, Ye Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T03:58:39Z","title":"Optimal Amplify-and-Forward Schemes for Relay Channels with Correlated Relay Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5695","kind":"arxiv","version":2},"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:3970bb49f31ee8612607f4b3906a43f9e0fea0b0e158b96973e328a9f10f7a4a","target":"record","created_at":"2026-05-18T03:19:04Z","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":"96349010b17a7c97b55a220cb15435a67c1c81ccd8a67408f0904bbb8bbfa4d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T03:58:39Z","title_canon_sha256":"a83fed8d01bada9c7c8037c2b02734b6a49cc0d55cb41eee304f7725bb8bed4d"},"schema_version":"1.0","source":{"id":"1301.5695","kind":"arxiv","version":2}},"canonical_sha256":"f72d3e8417f3e4a6d3b09624bd3864b4b387a41e6f799d08325dc3e48706a82c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f72d3e8417f3e4a6d3b09624bd3864b4b387a41e6f799d08325dc3e48706a82c","first_computed_at":"2026-05-18T03:19:04.521477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:04.521477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vq6QI6wC4/fCLDEKWJZ9zJx3Ui8CkMzuYoYxXw/SqKBWdz6MWvCzdIW+5V7qyxW6oxOQUIvMrCISo/G4ujmjAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:04.522032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5695","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3970bb49f31ee8612607f4b3906a43f9e0fea0b0e158b96973e328a9f10f7a4a","sha256:80e45e09bcafb324c9722a4232d3e9a3172c68ed852254522568c1c4fcff63cc"],"state_sha256":"4b6c498dfbfa90a90f76a4c7f274dd1d6606d7002308904d37f002ad7e730ccc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHnoh0J14HeQVOPY2Et7af1xTERnZ7JsohqLOGLlFB+wzY5svTbfNCuTAI0PB3j8kX9qe/9jnnNJ4q6KzlXuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T04:08:41.736024Z","bundle_sha256":"c99191070a23a11cf684692eb11b9cd11ccb73a4642493e89f03b86b8b58a949"}}