{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RPGTASZQUZ7AXTCTWF4SD2HOWE","short_pith_number":"pith:RPGTASZQ","canonical_record":{"source":{"id":"1001.2947","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T03:21:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"02722236b7479eadacda0846fde4256fad87ce7cab281ffa515038fcf98de82a","abstract_canon_sha256":"b9e00cbb86b0341aeefdbe8554dbb0aa9a37775855e5c453c2c8ff74928d8124"},"schema_version":"1.0"},"canonical_sha256":"8bcd304b30a67e0bcc53b17921e8eeb10f5fcf5df805c7431a9e990fbf13cfe2","source":{"kind":"arxiv","id":"1001.2947","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2947","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2947v2","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2947","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"RPGTASZQUZ7A","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RPGTASZQUZ7AXTCT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RPGTASZQ","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RPGTASZQUZ7AXTCTWF4SD2HOWE","target":"record","payload":{"canonical_record":{"source":{"id":"1001.2947","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T03:21:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"02722236b7479eadacda0846fde4256fad87ce7cab281ffa515038fcf98de82a","abstract_canon_sha256":"b9e00cbb86b0341aeefdbe8554dbb0aa9a37775855e5c453c2c8ff74928d8124"},"schema_version":"1.0"},"canonical_sha256":"8bcd304b30a67e0bcc53b17921e8eeb10f5fcf5df805c7431a9e990fbf13cfe2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:47.771738Z","signature_b64":"pHp+izLCAlfwrzyqdsID6XuYSozUUeh0cjxSQL65CzUrcbWet+GZu2vEGd+qi3M2Xpl8lLOVSDR2gZfkO0+EAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bcd304b30a67e0bcc53b17921e8eeb10f5fcf5df805c7431a9e990fbf13cfe2","last_reissued_at":"2026-05-18T00:58:47.771237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:47.771237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.2947","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-18T00:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2iBG4HL7GJe7Gb0ywqHfZEtUgIrL79Db0GRh5UNZZiALFUXJ93Hkq0CtVyd5GJMHFyjihe6e588CMaDIwA3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:31:23.598770Z"},"content_sha256":"27aa94fbf5eb4a7ed718a2a7e5a0727faa735b46ce0ab2b0f722bd8d5f5d8331","schema_version":"1.0","event_id":"sha256:27aa94fbf5eb4a7ed718a2a7e5a0727faa735b46ce0ab2b0f722bd8d5f5d8331"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RPGTASZQUZ7AXTCTWF4SD2HOWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design and Analysis of Multi-User SDMA Systems with Noisy Limited CSIT Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tianyu Wu, Vincent K.N. Lau","submitted_at":"2010-01-18T03:21:10Z","abstract_excerpt":"In this paper, we consider spatial-division multiple-access (SDMA) systems with one base station with multiple antennae and a number of single antenna mobiles under noisy limited CSIT feedback. We propose a robust noisy limited feedback design for SDMA systems. The solution consists of a real-time robust SDMA precoding, user selection and rate adaptation as well as an offline feedback index assignment algorithm. The index assignment problem is cast into a Traveling Sales Man problem (TSP). Based on the specific structure of the feedback constellation and the precoder, we derive a low complex b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2947","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-18T00:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CjTKm0xkxtuGIJaPbea0wDUpub/v1gSlgr2vieu1Gt1bcImDY8gjhdCA71t5WKBXjsutxyRaBm7I9u47joUJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:31:23.599602Z"},"content_sha256":"929fc46b09ac73a39a4a0b2b828d446ed60a05b10dab7c19e9d130ae2d1420ff","schema_version":"1.0","event_id":"sha256:929fc46b09ac73a39a4a0b2b828d446ed60a05b10dab7c19e9d130ae2d1420ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPGTASZQUZ7AXTCTWF4SD2HOWE/bundle.json","state_url":"https://pith.science/pith/RPGTASZQUZ7AXTCTWF4SD2HOWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPGTASZQUZ7AXTCTWF4SD2HOWE/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-06-01T02:31:23Z","links":{"resolver":"https://pith.science/pith/RPGTASZQUZ7AXTCTWF4SD2HOWE","bundle":"https://pith.science/pith/RPGTASZQUZ7AXTCTWF4SD2HOWE/bundle.json","state":"https://pith.science/pith/RPGTASZQUZ7AXTCTWF4SD2HOWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPGTASZQUZ7AXTCTWF4SD2HOWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RPGTASZQUZ7AXTCTWF4SD2HOWE","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":"b9e00cbb86b0341aeefdbe8554dbb0aa9a37775855e5c453c2c8ff74928d8124","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T03:21:10Z","title_canon_sha256":"02722236b7479eadacda0846fde4256fad87ce7cab281ffa515038fcf98de82a"},"schema_version":"1.0","source":{"id":"1001.2947","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2947","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2947v2","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2947","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"RPGTASZQUZ7A","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RPGTASZQUZ7AXTCT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RPGTASZQ","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:929fc46b09ac73a39a4a0b2b828d446ed60a05b10dab7c19e9d130ae2d1420ff","target":"graph","created_at":"2026-05-18T00:58:47Z","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 paper, we consider spatial-division multiple-access (SDMA) systems with one base station with multiple antennae and a number of single antenna mobiles under noisy limited CSIT feedback. We propose a robust noisy limited feedback design for SDMA systems. The solution consists of a real-time robust SDMA precoding, user selection and rate adaptation as well as an offline feedback index assignment algorithm. The index assignment problem is cast into a Traveling Sales Man problem (TSP). Based on the specific structure of the feedback constellation and the precoder, we derive a low complex b","authors_text":"Tianyu Wu, Vincent K.N. Lau","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T03:21:10Z","title":"Design and Analysis of Multi-User SDMA Systems with Noisy Limited CSIT Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2947","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:27aa94fbf5eb4a7ed718a2a7e5a0727faa735b46ce0ab2b0f722bd8d5f5d8331","target":"record","created_at":"2026-05-18T00:58:47Z","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":"b9e00cbb86b0341aeefdbe8554dbb0aa9a37775855e5c453c2c8ff74928d8124","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T03:21:10Z","title_canon_sha256":"02722236b7479eadacda0846fde4256fad87ce7cab281ffa515038fcf98de82a"},"schema_version":"1.0","source":{"id":"1001.2947","kind":"arxiv","version":2}},"canonical_sha256":"8bcd304b30a67e0bcc53b17921e8eeb10f5fcf5df805c7431a9e990fbf13cfe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bcd304b30a67e0bcc53b17921e8eeb10f5fcf5df805c7431a9e990fbf13cfe2","first_computed_at":"2026-05-18T00:58:47.771237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:47.771237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pHp+izLCAlfwrzyqdsID6XuYSozUUeh0cjxSQL65CzUrcbWet+GZu2vEGd+qi3M2Xpl8lLOVSDR2gZfkO0+EAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:47.771738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.2947","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27aa94fbf5eb4a7ed718a2a7e5a0727faa735b46ce0ab2b0f722bd8d5f5d8331","sha256:929fc46b09ac73a39a4a0b2b828d446ed60a05b10dab7c19e9d130ae2d1420ff"],"state_sha256":"e5becb9f0e586529e0c86b6bd6c8c64a8c29507dddf0a740a33c50803d05b870"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6jjZEDV7EVaioUBM1t/jpPgecFn7YEt8n0zfmGGcIUqwEZc/XDvP/ygStZzP2yUQwf9iXSxg/H+NDASxFb5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:31:23.604516Z","bundle_sha256":"d994af38cfd78ee706086b85cba803abaa1f463e67993ed4de455976087d4e89"}}