{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FKUPMNOWBWZXURWUJGBYGZQQ5I","short_pith_number":"pith:FKUPMNOW","schema_version":"1.0","canonical_sha256":"2aa8f635d60db37a46d44983836610ea25e860cf6df06ca9745080513ae12f3d","source":{"kind":"arxiv","id":"1608.04213","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Precoder Design for Multiuser MIMO Cognitive Radio Networks with Interference Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Le-Nam Tran, Oh-Soon Shin, Ronan Farrell, Trung Q. Duong, Van-Dinh Nguyen","submitted_at":"2016-08-15T09:12:33Z","abstract_excerpt":"We consider a linear precoder design for an underlay cognitive radio multiple-input multiple-output broadcast channel, where the secondary system consisting of a secondary base-station (BS) and a group of secondary users (SUs) is allowed to share the same spectrum with the primary system. All the transceivers are equipped with multiple antennas, each of which has its own maximum power constraint. Assuming zero-forcing method to eliminate the multiuser interference, we study the sum rate maximization problem for the secondary system subject to both per-antenna power constraints at the secondary"},"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":"1608.04213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-15T09:12:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"adcd7e89d551e971449ba73476a688c30a640ef3c9754e4ee1228ae23c3314d5","abstract_canon_sha256":"f738fdb0a068ff8adcb7c1ec58cf610bde6c54deb5a1a155c43ffac9ed55e306"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.239220Z","signature_b64":"AvxlfCnPrDcYA5dKZhSTjH4P0n17ItRbdbmkOj8jnMM16EgBjK8MX1KIzBdv8hLSyYNLY+KpKGnUF0b4xJ0/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aa8f635d60db37a46d44983836610ea25e860cf6df06ca9745080513ae12f3d","last_reissued_at":"2026-05-18T00:58:09.238506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.238506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Precoder Design for Multiuser MIMO Cognitive Radio Networks with Interference Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Le-Nam Tran, Oh-Soon Shin, Ronan Farrell, Trung Q. Duong, Van-Dinh Nguyen","submitted_at":"2016-08-15T09:12:33Z","abstract_excerpt":"We consider a linear precoder design for an underlay cognitive radio multiple-input multiple-output broadcast channel, where the secondary system consisting of a secondary base-station (BS) and a group of secondary users (SUs) is allowed to share the same spectrum with the primary system. All the transceivers are equipped with multiple antennas, each of which has its own maximum power constraint. Assuming zero-forcing method to eliminate the multiuser interference, we study the sum rate maximization problem for the secondary system subject to both per-antenna power constraints at the secondary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04213","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":"1608.04213","created_at":"2026-05-18T00:58:09.238601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04213v1","created_at":"2026-05-18T00:58:09.238601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04213","created_at":"2026-05-18T00:58:09.238601+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKUPMNOWBWZX","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKUPMNOWBWZXURWU","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKUPMNOW","created_at":"2026-05-18T12:30:15.759754+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/FKUPMNOWBWZXURWUJGBYGZQQ5I","json":"https://pith.science/pith/FKUPMNOWBWZXURWUJGBYGZQQ5I.json","graph_json":"https://pith.science/api/pith-number/FKUPMNOWBWZXURWUJGBYGZQQ5I/graph.json","events_json":"https://pith.science/api/pith-number/FKUPMNOWBWZXURWUJGBYGZQQ5I/events.json","paper":"https://pith.science/paper/FKUPMNOW"},"agent_actions":{"view_html":"https://pith.science/pith/FKUPMNOWBWZXURWUJGBYGZQQ5I","download_json":"https://pith.science/pith/FKUPMNOWBWZXURWUJGBYGZQQ5I.json","view_paper":"https://pith.science/paper/FKUPMNOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04213&json=true","fetch_graph":"https://pith.science/api/pith-number/FKUPMNOWBWZXURWUJGBYGZQQ5I/graph.json","fetch_events":"https://pith.science/api/pith-number/FKUPMNOWBWZXURWUJGBYGZQQ5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKUPMNOWBWZXURWUJGBYGZQQ5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKUPMNOWBWZXURWUJGBYGZQQ5I/action/storage_attestation","attest_author":"https://pith.science/pith/FKUPMNOWBWZXURWUJGBYGZQQ5I/action/author_attestation","sign_citation":"https://pith.science/pith/FKUPMNOWBWZXURWUJGBYGZQQ5I/action/citation_signature","submit_replication":"https://pith.science/pith/FKUPMNOWBWZXURWUJGBYGZQQ5I/action/replication_record"}},"created_at":"2026-05-18T00:58:09.238601+00:00","updated_at":"2026-05-18T00:58:09.238601+00:00"}