{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DQJDUB3QM4MYIDADQLP4WI3REL","short_pith_number":"pith:DQJDUB3Q","schema_version":"1.0","canonical_sha256":"1c123a07706719840c0382dfcb237122f5f337988988d61f91b66478840804da","source":{"kind":"arxiv","id":"1307.5240","version":1},"attestation_state":"computed","paper":{"title":"Performance Analysis of Optimum Zero-Forcing Beamforming with Greedy User Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Murat Torlak, Serdar Ozyurt","submitted_at":"2013-07-19T14:44:46Z","abstract_excerpt":"In this letter, an exact performance analysis is presented on the sum rate of zero-forcing beamforming with a greedy user scheduling algorithm in a downlink system. Adopting water-filling power allocation, we derive a compact form for the joint probability density function of the scheduled users' squared subchannel gains when a transmitter with multiple antennas sends information to at most two scheduled users with each having a single antenna. The analysis is verified by numerical results."},"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":"1307.5240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-19T14:44:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"021615edb83fa3c3635ff46870959bffb48d912168e734c1928494d1ed452d7e","abstract_canon_sha256":"93e8c9928f53f5eed3fc3e91b4645a3ec38e510d6787cbd6babc352da7b8ea0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:05.360695Z","signature_b64":"4EC//M1UqMgMYle0SfNF05GYsC+x/IdDKiakvNjrcIXqBY1bNL8XaXAcMdw4PQXWHZY0uQS5EqWU+DyqmRSCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c123a07706719840c0382dfcb237122f5f337988988d61f91b66478840804da","last_reissued_at":"2026-05-18T03:18:05.359995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:05.359995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Analysis of Optimum Zero-Forcing Beamforming with Greedy User Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Murat Torlak, Serdar Ozyurt","submitted_at":"2013-07-19T14:44:46Z","abstract_excerpt":"In this letter, an exact performance analysis is presented on the sum rate of zero-forcing beamforming with a greedy user scheduling algorithm in a downlink system. Adopting water-filling power allocation, we derive a compact form for the joint probability density function of the scheduled users' squared subchannel gains when a transmitter with multiple antennas sends information to at most two scheduled users with each having a single antenna. The analysis is verified by numerical results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5240","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":"1307.5240","created_at":"2026-05-18T03:18:05.360110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5240v1","created_at":"2026-05-18T03:18:05.360110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5240","created_at":"2026-05-18T03:18:05.360110+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQJDUB3QM4MY","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQJDUB3QM4MYIDAD","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQJDUB3Q","created_at":"2026-05-18T12:27:43.054852+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/DQJDUB3QM4MYIDADQLP4WI3REL","json":"https://pith.science/pith/DQJDUB3QM4MYIDADQLP4WI3REL.json","graph_json":"https://pith.science/api/pith-number/DQJDUB3QM4MYIDADQLP4WI3REL/graph.json","events_json":"https://pith.science/api/pith-number/DQJDUB3QM4MYIDADQLP4WI3REL/events.json","paper":"https://pith.science/paper/DQJDUB3Q"},"agent_actions":{"view_html":"https://pith.science/pith/DQJDUB3QM4MYIDADQLP4WI3REL","download_json":"https://pith.science/pith/DQJDUB3QM4MYIDADQLP4WI3REL.json","view_paper":"https://pith.science/paper/DQJDUB3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5240&json=true","fetch_graph":"https://pith.science/api/pith-number/DQJDUB3QM4MYIDADQLP4WI3REL/graph.json","fetch_events":"https://pith.science/api/pith-number/DQJDUB3QM4MYIDADQLP4WI3REL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQJDUB3QM4MYIDADQLP4WI3REL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQJDUB3QM4MYIDADQLP4WI3REL/action/storage_attestation","attest_author":"https://pith.science/pith/DQJDUB3QM4MYIDADQLP4WI3REL/action/author_attestation","sign_citation":"https://pith.science/pith/DQJDUB3QM4MYIDADQLP4WI3REL/action/citation_signature","submit_replication":"https://pith.science/pith/DQJDUB3QM4MYIDADQLP4WI3REL/action/replication_record"}},"created_at":"2026-05-18T03:18:05.360110+00:00","updated_at":"2026-05-18T03:18:05.360110+00:00"}