{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UJ2PUJYYFIIWXZK26AEBVM6KTM","short_pith_number":"pith:UJ2PUJYY","schema_version":"1.0","canonical_sha256":"a274fa27182a116be55af0081ab3ca9b352f6b51aa5477aa99d31e790a73af64","source":{"kind":"arxiv","id":"1202.0119","version":4},"attestation_state":"computed","paper":{"title":"Opportunistic Scheduling in Heterogeneous Networks: Distributed Algorithms and System Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Joseph Kampeas, Omer Gurewitz","submitted_at":"2012-02-01T08:46:28Z","abstract_excerpt":"In this work, we design and analyze novel distributed scheduling algorithms for multi-user MIMO systems. In particular, we consider algorithms which do not require sending channel state information to a central processing unit, nor do they require communication between the users themselves, yet, we prove their performance closely approximates that of a centrally-controlled system, which is able to schedule the strongest user in each time-slot.\n  Our analysis is based on a novel application of the Point-Process approximation. This novel technique allows us to examine non-homogeneous cases, such"},"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":"1202.0119","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T08:46:28Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"d0ed89b9d95eef6497df06aa83d95737dadf192f32cd58f754ef0dbeaf8e17b9","abstract_canon_sha256":"526001de96d98ddc54fd69690ac395f488bb567abddb45f3a0c1249530dfaf8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.195503Z","signature_b64":"XJZ3g25UohSOc11TDGKgS7JRfJBOODb73aUeKwrp/IA4cT4OBf065OUcC0vnNTtlt/6f+s6mRN9EM+tn18A2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a274fa27182a116be55af0081ab3ca9b352f6b51aa5477aa99d31e790a73af64","last_reissued_at":"2026-05-18T02:21:18.194745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.194745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Opportunistic Scheduling in Heterogeneous Networks: Distributed Algorithms and System Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Joseph Kampeas, Omer Gurewitz","submitted_at":"2012-02-01T08:46:28Z","abstract_excerpt":"In this work, we design and analyze novel distributed scheduling algorithms for multi-user MIMO systems. In particular, we consider algorithms which do not require sending channel state information to a central processing unit, nor do they require communication between the users themselves, yet, we prove their performance closely approximates that of a centrally-controlled system, which is able to schedule the strongest user in each time-slot.\n  Our analysis is based on a novel application of the Point-Process approximation. This novel technique allows us to examine non-homogeneous cases, such"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0119","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":"1202.0119","created_at":"2026-05-18T02:21:18.194871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0119v4","created_at":"2026-05-18T02:21:18.194871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0119","created_at":"2026-05-18T02:21:18.194871+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJ2PUJYYFIIW","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJ2PUJYYFIIWXZK2","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJ2PUJYY","created_at":"2026-05-18T12:27:23.164592+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/UJ2PUJYYFIIWXZK26AEBVM6KTM","json":"https://pith.science/pith/UJ2PUJYYFIIWXZK26AEBVM6KTM.json","graph_json":"https://pith.science/api/pith-number/UJ2PUJYYFIIWXZK26AEBVM6KTM/graph.json","events_json":"https://pith.science/api/pith-number/UJ2PUJYYFIIWXZK26AEBVM6KTM/events.json","paper":"https://pith.science/paper/UJ2PUJYY"},"agent_actions":{"view_html":"https://pith.science/pith/UJ2PUJYYFIIWXZK26AEBVM6KTM","download_json":"https://pith.science/pith/UJ2PUJYYFIIWXZK26AEBVM6KTM.json","view_paper":"https://pith.science/paper/UJ2PUJYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0119&json=true","fetch_graph":"https://pith.science/api/pith-number/UJ2PUJYYFIIWXZK26AEBVM6KTM/graph.json","fetch_events":"https://pith.science/api/pith-number/UJ2PUJYYFIIWXZK26AEBVM6KTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJ2PUJYYFIIWXZK26AEBVM6KTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJ2PUJYYFIIWXZK26AEBVM6KTM/action/storage_attestation","attest_author":"https://pith.science/pith/UJ2PUJYYFIIWXZK26AEBVM6KTM/action/author_attestation","sign_citation":"https://pith.science/pith/UJ2PUJYYFIIWXZK26AEBVM6KTM/action/citation_signature","submit_replication":"https://pith.science/pith/UJ2PUJYYFIIWXZK26AEBVM6KTM/action/replication_record"}},"created_at":"2026-05-18T02:21:18.194871+00:00","updated_at":"2026-05-18T02:21:18.194871+00:00"}