{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EIEJ6S5PRO4H2O5EQMAXOQ7DKY","short_pith_number":"pith:EIEJ6S5P","schema_version":"1.0","canonical_sha256":"22089f4baf8bb87d3ba483017743e35604239159a4a61b1907a396fa45a9762f","source":{"kind":"arxiv","id":"1310.7425","version":4},"attestation_state":"computed","paper":{"title":"User Selection in MIMO Interfering Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ajit K Chaturvedi, Gaurav Gupta","submitted_at":"2013-10-28T14:12:52Z","abstract_excerpt":"Interference alignment aims to achieve maximum degrees of freedom in an interference system. For achieving Interference alignment in interfering broadcast systems a closed-form solution is proposed in [1] which is an extension of the grouping scheme in [2]. In a downlink scenario where there are a large number of users, the base station is required to select a subset of users such that the sum rate is maximized. To search for the optimal user subset using brute-force approach is computationally exhaustive because of the large number of possible user subset combinations. We propose a user selec"},"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":"1310.7425","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-28T14:12:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a6f5695eff6f26430df304370a16ad9f1490f213690d7d3280ef63cad49209ee","abstract_canon_sha256":"d3254954c8664a03151f61fa28ee68e86407708a1573d0229dab32287c9005fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:28.728500Z","signature_b64":"PCUhFV+CpyQNq6BYEqprTm5wz/FPpoFb5tQoRKLVgXknx5wtWpyR0mlPV7yfqncGfEnHgxgCaVlNZGKUYXTlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22089f4baf8bb87d3ba483017743e35604239159a4a61b1907a396fa45a9762f","last_reissued_at":"2026-05-18T02:49:28.727962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:28.727962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"User Selection in MIMO Interfering Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ajit K Chaturvedi, Gaurav Gupta","submitted_at":"2013-10-28T14:12:52Z","abstract_excerpt":"Interference alignment aims to achieve maximum degrees of freedom in an interference system. For achieving Interference alignment in interfering broadcast systems a closed-form solution is proposed in [1] which is an extension of the grouping scheme in [2]. In a downlink scenario where there are a large number of users, the base station is required to select a subset of users such that the sum rate is maximized. To search for the optimal user subset using brute-force approach is computationally exhaustive because of the large number of possible user subset combinations. We propose a user selec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7425","kind":"arxiv","version":4},"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":"1310.7425","created_at":"2026-05-18T02:49:28.728045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7425v4","created_at":"2026-05-18T02:49:28.728045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7425","created_at":"2026-05-18T02:49:28.728045+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIEJ6S5PRO4H","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIEJ6S5PRO4H2O5E","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIEJ6S5P","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/EIEJ6S5PRO4H2O5EQMAXOQ7DKY","json":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY.json","graph_json":"https://pith.science/api/pith-number/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/graph.json","events_json":"https://pith.science/api/pith-number/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/events.json","paper":"https://pith.science/paper/EIEJ6S5P"},"agent_actions":{"view_html":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY","download_json":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY.json","view_paper":"https://pith.science/paper/EIEJ6S5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7425&json=true","fetch_graph":"https://pith.science/api/pith-number/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/graph.json","fetch_events":"https://pith.science/api/pith-number/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/action/storage_attestation","attest_author":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/action/author_attestation","sign_citation":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/action/citation_signature","submit_replication":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/action/replication_record"}},"created_at":"2026-05-18T02:49:28.728045+00:00","updated_at":"2026-05-18T02:49:28.728045+00:00"}