{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RDWVNT4OHTBHJLUKREHS6AAO2B","short_pith_number":"pith:RDWVNT4O","canonical_record":{"source":{"id":"1303.4776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-19T22:06:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"adbcc22d054fd068418bdc98891337769f14bd2d2b2442c436ab341a75ac4d30","abstract_canon_sha256":"30232946f2bd48759fe7a3288eae2a9ff97a1c18de87455dcb8ff23c52a1007f"},"schema_version":"1.0"},"canonical_sha256":"88ed56cf8e3cc274ae8a890f2f000ed058173e37e4158213574c44a9ae285837","source":{"kind":"arxiv","id":"1303.4776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4776","created_at":"2026-05-18T03:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4776v1","created_at":"2026-05-18T03:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4776","created_at":"2026-05-18T03:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"RDWVNT4OHTBH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RDWVNT4OHTBHJLUK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RDWVNT4O","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RDWVNT4OHTBHJLUKREHS6AAO2B","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-19T22:06:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"adbcc22d054fd068418bdc98891337769f14bd2d2b2442c436ab341a75ac4d30","abstract_canon_sha256":"30232946f2bd48759fe7a3288eae2a9ff97a1c18de87455dcb8ff23c52a1007f"},"schema_version":"1.0"},"canonical_sha256":"88ed56cf8e3cc274ae8a890f2f000ed058173e37e4158213574c44a9ae285837","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:24.884974Z","signature_b64":"oZf3PumXxxugofZ+Mb1n12BG/VLUAiVbW861xq1bCFPz5v6xJy9HnpmNF6/UI2KoWXIdVUDCfJLMwGt0c+L3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88ed56cf8e3cc274ae8a890f2f000ed058173e37e4158213574c44a9ae285837","last_reissued_at":"2026-05-18T03:30:24.883949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:24.883949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4776","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DS6rjrRG7WE8WXf6mMlrVVDYGZOeShlcIBgRfNW9SCFohBvyjMOtPSBMkVWhyuFtMa6HCJuliH+Z9hgRjMrrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:20:29.954694Z"},"content_sha256":"f55373956683e558cc78ae56fed699dbd89c1eb21996be0ba56ea1ba8f24e668","schema_version":"1.0","event_id":"sha256:f55373956683e558cc78ae56fed699dbd89c1eb21996be0ba56ea1ba8f24e668"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RDWVNT4OHTBHJLUKREHS6AAO2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Hybrid Channel Information for Downlink Multi-User MIMO Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Narayan Prasad, Sampath Rangarajan, Wenzhuo Ouyang","submitted_at":"2013-03-19T22:06:40Z","abstract_excerpt":"We investigate the downlink multi-user MIMO (MU-MIMO) scheduling problem in the presence of imperfect Channel State Information at the transmitter (CSIT) that comprises of coarse and current CSIT as well as finer but delayed CSIT. This scheduling problem is characterized by an intricate `exploitation - exploration tradeoff' between scheduling the users based on current CSIT for immediate gains, and scheduling them to obtain finer albeit delayed CSIT and potentially larger future gains. We solve this scheduling problem by formulating a frame based joint scheduling and feedback approach, where i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4776","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PgpP1rLqd6VZS8FfzUcQtLGeNuvqzLyuOczyZad0I0eFEgm0PX5YX/jVHzjUX2z+5JP9q9GA3CcAqtqk70SVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:20:29.955293Z"},"content_sha256":"e861c8929440a003ca9d4218a2b06b808778fbad219772b708fbf058ad92f37f","schema_version":"1.0","event_id":"sha256:e861c8929440a003ca9d4218a2b06b808778fbad219772b708fbf058ad92f37f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDWVNT4OHTBHJLUKREHS6AAO2B/bundle.json","state_url":"https://pith.science/pith/RDWVNT4OHTBHJLUKREHS6AAO2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDWVNT4OHTBHJLUKREHS6AAO2B/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T07:20:29Z","links":{"resolver":"https://pith.science/pith/RDWVNT4OHTBHJLUKREHS6AAO2B","bundle":"https://pith.science/pith/RDWVNT4OHTBHJLUKREHS6AAO2B/bundle.json","state":"https://pith.science/pith/RDWVNT4OHTBHJLUKREHS6AAO2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDWVNT4OHTBHJLUKREHS6AAO2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RDWVNT4OHTBHJLUKREHS6AAO2B","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":"30232946f2bd48759fe7a3288eae2a9ff97a1c18de87455dcb8ff23c52a1007f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-19T22:06:40Z","title_canon_sha256":"adbcc22d054fd068418bdc98891337769f14bd2d2b2442c436ab341a75ac4d30"},"schema_version":"1.0","source":{"id":"1303.4776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4776","created_at":"2026-05-18T03:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4776v1","created_at":"2026-05-18T03:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4776","created_at":"2026-05-18T03:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"RDWVNT4OHTBH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RDWVNT4OHTBHJLUK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RDWVNT4O","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:e861c8929440a003ca9d4218a2b06b808778fbad219772b708fbf058ad92f37f","target":"graph","created_at":"2026-05-18T03:30:24Z","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":"We investigate the downlink multi-user MIMO (MU-MIMO) scheduling problem in the presence of imperfect Channel State Information at the transmitter (CSIT) that comprises of coarse and current CSIT as well as finer but delayed CSIT. This scheduling problem is characterized by an intricate `exploitation - exploration tradeoff' between scheduling the users based on current CSIT for immediate gains, and scheduling them to obtain finer albeit delayed CSIT and potentially larger future gains. We solve this scheduling problem by formulating a frame based joint scheduling and feedback approach, where i","authors_text":"Narayan Prasad, Sampath Rangarajan, Wenzhuo Ouyang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-19T22:06:40Z","title":"Exploiting Hybrid Channel Information for Downlink Multi-User MIMO Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4776","kind":"arxiv","version":1},"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:f55373956683e558cc78ae56fed699dbd89c1eb21996be0ba56ea1ba8f24e668","target":"record","created_at":"2026-05-18T03:30:24Z","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":"30232946f2bd48759fe7a3288eae2a9ff97a1c18de87455dcb8ff23c52a1007f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-19T22:06:40Z","title_canon_sha256":"adbcc22d054fd068418bdc98891337769f14bd2d2b2442c436ab341a75ac4d30"},"schema_version":"1.0","source":{"id":"1303.4776","kind":"arxiv","version":1}},"canonical_sha256":"88ed56cf8e3cc274ae8a890f2f000ed058173e37e4158213574c44a9ae285837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88ed56cf8e3cc274ae8a890f2f000ed058173e37e4158213574c44a9ae285837","first_computed_at":"2026-05-18T03:30:24.883949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:24.883949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oZf3PumXxxugofZ+Mb1n12BG/VLUAiVbW861xq1bCFPz5v6xJy9HnpmNF6/UI2KoWXIdVUDCfJLMwGt0c+L3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:24.884974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f55373956683e558cc78ae56fed699dbd89c1eb21996be0ba56ea1ba8f24e668","sha256:e861c8929440a003ca9d4218a2b06b808778fbad219772b708fbf058ad92f37f"],"state_sha256":"2ed0bec6fa198f337a5bb4deb49d5e6fc8cfbff65ffa75637a04a22c7def2b1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDqLqmO4tlFnU60lTmDTQdu65Q9Qg2e9cVy07QVL1sBO2XuO/8D3GUbRYc//kJeMvSzHO0YJSqPJqZtAtaAnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:20:29.957737Z","bundle_sha256":"ef7e6ec38e4fe2f67106622349f134a24ce7a7ad80ed5ab6777cdf17f0094de1"}}