{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OTMDBAOGSFR5BEXDVDI4DHOMIR","short_pith_number":"pith:OTMDBAOG","canonical_record":{"source":{"id":"1107.2101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-11T19:34:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cf6a11ca467b784822a1845b9ec21044e8f7001842e88a428e1fb55952add93c","abstract_canon_sha256":"5f083309c8e5f9a9f1b6e06a23d455907769f9cdaf924c0a94e7d81eee19bea0"},"schema_version":"1.0"},"canonical_sha256":"74d83081c69163d092e3a8d1c19dcc446039578c924810a0ea7c29cd0419c076","source":{"kind":"arxiv","id":"1107.2101","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2101","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2101v2","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2101","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"OTMDBAOGSFR5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OTMDBAOGSFR5BEXD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OTMDBAOG","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OTMDBAOGSFR5BEXDVDI4DHOMIR","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-11T19:34:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cf6a11ca467b784822a1845b9ec21044e8f7001842e88a428e1fb55952add93c","abstract_canon_sha256":"5f083309c8e5f9a9f1b6e06a23d455907769f9cdaf924c0a94e7d81eee19bea0"},"schema_version":"1.0"},"canonical_sha256":"74d83081c69163d092e3a8d1c19dcc446039578c924810a0ea7c29cd0419c076","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:56.825005Z","signature_b64":"Z17d0J9xA54TBZIS3c58tC1uoU6qrjSpBnWrdNCYGGp6J4rTQ5fIRybyUUhvf8R/eIGiIsYmHLnns4FzzfaZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74d83081c69163d092e3a8d1c19dcc446039578c924810a0ea7c29cd0419c076","last_reissued_at":"2026-05-18T03:36:56.824589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:56.824589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2101","source_version":2,"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:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LkqCv5pXh6d+Fbj+AsKRUiMH2OpkdgHRnNaW5mjwomkaB/FgNK+Lqv8M3BirWZj9lKMPErNMRoQwxhYERIF5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:02:55.201405Z"},"content_sha256":"f7ce8520446df56b3f4406b5067cd726739b8fb3691e5ab41da2839f5e60dab5","schema_version":"1.0","event_id":"sha256:f7ce8520446df56b3f4406b5067cd726739b8fb3691e5ab41da2839f5e60dab5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OTMDBAOGSFR5BEXDVDI4DHOMIR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Doubling the Throughput of Multiuser MIMO Systems Using Codebook Tailored Limited Feedback Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Wunder, Jan Schreck, Peter Jung","submitted_at":"2011-07-11T19:34:37Z","abstract_excerpt":"We present and analyze a new robust feedback and transmit strategy for multiuser MIMO downlink communication systems, termed Rate Approximation (RA). RA combines the flexibility and robustness needed for reliable communications with the user terminal under a limited feedback constraint. It responds to two important observations. First, it is not so significant to approximate the channel but rather the rate, such that the optimal scheduling decision can be mimicked at the base station. Second, a fixed transmit codebook at the transmitter is often better when therefore the channel state informat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2101","kind":"arxiv","version":2},"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:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LNLn4FqHtefYAnTUypBGuCY3+gfQJAGs8GmJPbMstOz+Vwm4Z8o6BrR1i6uqI1r3xb6V1HvsukkNjxdPmspDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:02:55.202135Z"},"content_sha256":"0522e8e73d1c55cd0e486f6543c229d5bfd84ceade20004427c0e4c40400bd23","schema_version":"1.0","event_id":"sha256:0522e8e73d1c55cd0e486f6543c229d5bfd84ceade20004427c0e4c40400bd23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTMDBAOGSFR5BEXDVDI4DHOMIR/bundle.json","state_url":"https://pith.science/pith/OTMDBAOGSFR5BEXDVDI4DHOMIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTMDBAOGSFR5BEXDVDI4DHOMIR/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-30T18:02:55Z","links":{"resolver":"https://pith.science/pith/OTMDBAOGSFR5BEXDVDI4DHOMIR","bundle":"https://pith.science/pith/OTMDBAOGSFR5BEXDVDI4DHOMIR/bundle.json","state":"https://pith.science/pith/OTMDBAOGSFR5BEXDVDI4DHOMIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTMDBAOGSFR5BEXDVDI4DHOMIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OTMDBAOGSFR5BEXDVDI4DHOMIR","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":"5f083309c8e5f9a9f1b6e06a23d455907769f9cdaf924c0a94e7d81eee19bea0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-11T19:34:37Z","title_canon_sha256":"cf6a11ca467b784822a1845b9ec21044e8f7001842e88a428e1fb55952add93c"},"schema_version":"1.0","source":{"id":"1107.2101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2101","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2101v2","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2101","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"OTMDBAOGSFR5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OTMDBAOGSFR5BEXD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OTMDBAOG","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:0522e8e73d1c55cd0e486f6543c229d5bfd84ceade20004427c0e4c40400bd23","target":"graph","created_at":"2026-05-18T03:36:56Z","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 present and analyze a new robust feedback and transmit strategy for multiuser MIMO downlink communication systems, termed Rate Approximation (RA). RA combines the flexibility and robustness needed for reliable communications with the user terminal under a limited feedback constraint. It responds to two important observations. First, it is not so significant to approximate the channel but rather the rate, such that the optimal scheduling decision can be mimicked at the base station. Second, a fixed transmit codebook at the transmitter is often better when therefore the channel state informat","authors_text":"Gerhard Wunder, Jan Schreck, Peter Jung","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-11T19:34:37Z","title":"Nearly Doubling the Throughput of Multiuser MIMO Systems Using Codebook Tailored Limited Feedback Protocol"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2101","kind":"arxiv","version":2},"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:f7ce8520446df56b3f4406b5067cd726739b8fb3691e5ab41da2839f5e60dab5","target":"record","created_at":"2026-05-18T03:36:56Z","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":"5f083309c8e5f9a9f1b6e06a23d455907769f9cdaf924c0a94e7d81eee19bea0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-11T19:34:37Z","title_canon_sha256":"cf6a11ca467b784822a1845b9ec21044e8f7001842e88a428e1fb55952add93c"},"schema_version":"1.0","source":{"id":"1107.2101","kind":"arxiv","version":2}},"canonical_sha256":"74d83081c69163d092e3a8d1c19dcc446039578c924810a0ea7c29cd0419c076","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74d83081c69163d092e3a8d1c19dcc446039578c924810a0ea7c29cd0419c076","first_computed_at":"2026-05-18T03:36:56.824589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:56.824589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z17d0J9xA54TBZIS3c58tC1uoU6qrjSpBnWrdNCYGGp6J4rTQ5fIRybyUUhvf8R/eIGiIsYmHLnns4FzzfaZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:56.825005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7ce8520446df56b3f4406b5067cd726739b8fb3691e5ab41da2839f5e60dab5","sha256:0522e8e73d1c55cd0e486f6543c229d5bfd84ceade20004427c0e4c40400bd23"],"state_sha256":"abd03147a2d1f69869197e45fbdc6bc4e54c577d7670dc42fe63e1e101c44cb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TJpXyF+w0/dpuXwrx3E8fh7D/YejGg2OIprfOYX8dD8k2m91Yp9l5qUxlT+71gzuSFyJCiTm6otzQMZnhrZvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:02:55.206529Z","bundle_sha256":"53ca9190ad37c18d92ef85d3c74e877269a54ddcb71aab38e62d5655f929883a"}}