{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IUSRZPXJ4D6NU47MZ65Y7CGJYO","short_pith_number":"pith:IUSRZPXJ","schema_version":"1.0","canonical_sha256":"45251cbee9e0fcda73eccfbb8f88c9c397be8b2f7ef3ef4e9e6b5bef2db7d38e","source":{"kind":"arxiv","id":"1211.5884","version":1},"attestation_state":"computed","paper":{"title":"Low complexity sum rate maximization for single and multiple stream MIMO AF relay networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Sun, Eduard Jorswieck","submitted_at":"2012-11-26T08:35:45Z","abstract_excerpt":"A multiple-antenna amplify-and-forward two-hop interference network with multiple links and multiple relays is considered. We optimize transmit precoders, receive decoders and relay AF matrices to maximize the achievable sum rate. Under per user and total relay sum power constraints, we propose an efficient algorithm to maximize the total signal to total interference plus noise ratio (TSTINR). Computational complexity analysis shows that our proposed algorithm for TSTINR has lower complexity than the existing weighted minimum mean square error (WMMSE) algorithm. We analyze and confirm by simul"},"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":"1211.5884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-26T08:35:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3fef40511c4ef626b8f39935d11c76d4b61a38e3caf425693fef87e5897ff7d7","abstract_canon_sha256":"b51a23e5636e0efce2d0987d65e4df72cb426b0e4129f391d3d0d3769597136d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:01.709280Z","signature_b64":"y87L9w2M0dmDlBpmkJ5DhFwv2jcNX00ihqXoghdLZUqYGzA9PBcncjuS6icNDIVjWRfed9NP9AQ4ghov5YDWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45251cbee9e0fcda73eccfbb8f88c9c397be8b2f7ef3ef4e9e6b5bef2db7d38e","last_reissued_at":"2026-05-18T03:40:01.708841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:01.708841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low complexity sum rate maximization for single and multiple stream MIMO AF relay networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Sun, Eduard Jorswieck","submitted_at":"2012-11-26T08:35:45Z","abstract_excerpt":"A multiple-antenna amplify-and-forward two-hop interference network with multiple links and multiple relays is considered. We optimize transmit precoders, receive decoders and relay AF matrices to maximize the achievable sum rate. Under per user and total relay sum power constraints, we propose an efficient algorithm to maximize the total signal to total interference plus noise ratio (TSTINR). Computational complexity analysis shows that our proposed algorithm for TSTINR has lower complexity than the existing weighted minimum mean square error (WMMSE) algorithm. We analyze and confirm by simul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5884","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":"1211.5884","created_at":"2026-05-18T03:40:01.708906+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5884v1","created_at":"2026-05-18T03:40:01.708906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5884","created_at":"2026-05-18T03:40:01.708906+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUSRZPXJ4D6N","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUSRZPXJ4D6NU47M","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUSRZPXJ","created_at":"2026-05-18T12:27:09.501522+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/IUSRZPXJ4D6NU47MZ65Y7CGJYO","json":"https://pith.science/pith/IUSRZPXJ4D6NU47MZ65Y7CGJYO.json","graph_json":"https://pith.science/api/pith-number/IUSRZPXJ4D6NU47MZ65Y7CGJYO/graph.json","events_json":"https://pith.science/api/pith-number/IUSRZPXJ4D6NU47MZ65Y7CGJYO/events.json","paper":"https://pith.science/paper/IUSRZPXJ"},"agent_actions":{"view_html":"https://pith.science/pith/IUSRZPXJ4D6NU47MZ65Y7CGJYO","download_json":"https://pith.science/pith/IUSRZPXJ4D6NU47MZ65Y7CGJYO.json","view_paper":"https://pith.science/paper/IUSRZPXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5884&json=true","fetch_graph":"https://pith.science/api/pith-number/IUSRZPXJ4D6NU47MZ65Y7CGJYO/graph.json","fetch_events":"https://pith.science/api/pith-number/IUSRZPXJ4D6NU47MZ65Y7CGJYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUSRZPXJ4D6NU47MZ65Y7CGJYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUSRZPXJ4D6NU47MZ65Y7CGJYO/action/storage_attestation","attest_author":"https://pith.science/pith/IUSRZPXJ4D6NU47MZ65Y7CGJYO/action/author_attestation","sign_citation":"https://pith.science/pith/IUSRZPXJ4D6NU47MZ65Y7CGJYO/action/citation_signature","submit_replication":"https://pith.science/pith/IUSRZPXJ4D6NU47MZ65Y7CGJYO/action/replication_record"}},"created_at":"2026-05-18T03:40:01.708906+00:00","updated_at":"2026-05-18T03:40:01.708906+00:00"}