{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UJ2PUJYYFIIWXZK26AEBVM6KTM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"526001de96d98ddc54fd69690ac395f488bb567abddb45f3a0c1249530dfaf8d","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T08:46:28Z","title_canon_sha256":"d0ed89b9d95eef6497df06aa83d95737dadf192f32cd58f754ef0dbeaf8e17b9"},"schema_version":"1.0","source":{"id":"1202.0119","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0119","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0119v4","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0119","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"UJ2PUJYYFIIW","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UJ2PUJYYFIIWXZK2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UJ2PUJYY","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:2f9076c99469ee956d7324c70c07d2d339503308d486ab335de3514e3b3818ca","target":"graph","created_at":"2026-05-18T02:21:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Asaf Cohen, Joseph Kampeas, Omer Gurewitz","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T08:46:28Z","title":"Opportunistic Scheduling in Heterogeneous Networks: Distributed Algorithms and System Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0119","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f817faa75fc99a8913ce8b1730df1e5499b1a0959f9204e0fa5215a92788efb3","target":"record","created_at":"2026-05-18T02:21:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"526001de96d98ddc54fd69690ac395f488bb567abddb45f3a0c1249530dfaf8d","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T08:46:28Z","title_canon_sha256":"d0ed89b9d95eef6497df06aa83d95737dadf192f32cd58f754ef0dbeaf8e17b9"},"schema_version":"1.0","source":{"id":"1202.0119","kind":"arxiv","version":4}},"canonical_sha256":"a274fa27182a116be55af0081ab3ca9b352f6b51aa5477aa99d31e790a73af64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a274fa27182a116be55af0081ab3ca9b352f6b51aa5477aa99d31e790a73af64","first_computed_at":"2026-05-18T02:21:18.194745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:18.194745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XJZ3g25UohSOc11TDGKgS7JRfJBOODb73aUeKwrp/IA4cT4OBf065OUcC0vnNTtlt/6f+s6mRN9EM+tn18A2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:18.195503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0119","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f817faa75fc99a8913ce8b1730df1e5499b1a0959f9204e0fa5215a92788efb3","sha256:2f9076c99469ee956d7324c70c07d2d339503308d486ab335de3514e3b3818ca"],"state_sha256":"5fc8cea030b7109689046d772ef8e45f9b886ee06f55e316a46a146c23af73de"}