{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WCXDXT2VLOJEQAKPQODYIMIH54","short_pith_number":"pith:WCXDXT2V","canonical_record":{"source":{"id":"1310.7852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-29T15:53:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aed3f49ff973f672d937503c06ad31fa607f14ad0aa564dd220bbbdbe27fc2ed","abstract_canon_sha256":"a16dba879719850f678d25de38390da0d1713632a5ffbe08bf2ebfedca5ef34f"},"schema_version":"1.0"},"canonical_sha256":"b0ae3bcf555b9248014f8387843107ef3112ba07a37e3ba2ec2e1d3e26ea70e4","source":{"kind":"arxiv","id":"1310.7852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7852","created_at":"2026-05-18T03:08:06Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7852v1","created_at":"2026-05-18T03:08:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7852","created_at":"2026-05-18T03:08:06Z"},{"alias_kind":"pith_short_12","alias_value":"WCXDXT2VLOJE","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WCXDXT2VLOJEQAKP","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WCXDXT2V","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WCXDXT2VLOJEQAKPQODYIMIH54","target":"record","payload":{"canonical_record":{"source":{"id":"1310.7852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-29T15:53:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aed3f49ff973f672d937503c06ad31fa607f14ad0aa564dd220bbbdbe27fc2ed","abstract_canon_sha256":"a16dba879719850f678d25de38390da0d1713632a5ffbe08bf2ebfedca5ef34f"},"schema_version":"1.0"},"canonical_sha256":"b0ae3bcf555b9248014f8387843107ef3112ba07a37e3ba2ec2e1d3e26ea70e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:06.428570Z","signature_b64":"Nuj6DLmyUypFYLKlgQFYidjdhmEcIt9/2385sd9fRhJ0ZEExkMB9/SY5Xx09iLOZDviVCfX0pBai88cJOawyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0ae3bcf555b9248014f8387843107ef3112ba07a37e3ba2ec2e1d3e26ea70e4","last_reissued_at":"2026-05-18T03:08:06.427926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:06.427926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.7852","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:08:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zmUn4eW2CbGyypGVAgok4uOEZRwbsYnXBlKId2IfqDVbCF5BjC0vFQ1TM5UwQeUZyNrxEENu9Up3ckXKeDdkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:57:08.767612Z"},"content_sha256":"b71e280d6494adb29505548768a7ebd6c2d997bd5c0071e6d20fc4550b67d255","schema_version":"1.0","event_id":"sha256:b71e280d6494adb29505548768a7ebd6c2d997bd5c0071e6d20fc4550b67d255"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WCXDXT2VLOJEQAKPQODYIMIH54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conditional Entropy based User Selection for Multiuser MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. K. Chaturvedi, Gaurav Gupta","submitted_at":"2013-10-29T15:53:54Z","abstract_excerpt":"We consider the problem of user subset selection for maximizing the sum rate of downlink multi-user MIMO systems. The brute-force search for the optimal user set becomes impractical as the total number of users in a cell increase. We propose a user selection algorithm based on conditional differential entropy. We apply the proposed algorithm on Block diagonalization scheme. Simulation results show that the proposed conditional entropy based algorithm offers better alternatives than the existing user selection algorithms. Furthermore, in terms of sum rate, the solution obtained by the proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7852","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:08:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JBInwcSEnsqNP//0Hh+zVwR2BoXRZmEvcnUAZ3MnP+Vjsgu3p5KCX9cjOKfyQ4zih6d0Ls1eham9PQIamannDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:57:08.768358Z"},"content_sha256":"212be5a6cca33e7c185cc45fec7aceba0aea707f86ac37a55629f0a847efff45","schema_version":"1.0","event_id":"sha256:212be5a6cca33e7c185cc45fec7aceba0aea707f86ac37a55629f0a847efff45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCXDXT2VLOJEQAKPQODYIMIH54/bundle.json","state_url":"https://pith.science/pith/WCXDXT2VLOJEQAKPQODYIMIH54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCXDXT2VLOJEQAKPQODYIMIH54/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:57:08Z","links":{"resolver":"https://pith.science/pith/WCXDXT2VLOJEQAKPQODYIMIH54","bundle":"https://pith.science/pith/WCXDXT2VLOJEQAKPQODYIMIH54/bundle.json","state":"https://pith.science/pith/WCXDXT2VLOJEQAKPQODYIMIH54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCXDXT2VLOJEQAKPQODYIMIH54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WCXDXT2VLOJEQAKPQODYIMIH54","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":"a16dba879719850f678d25de38390da0d1713632a5ffbe08bf2ebfedca5ef34f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-29T15:53:54Z","title_canon_sha256":"aed3f49ff973f672d937503c06ad31fa607f14ad0aa564dd220bbbdbe27fc2ed"},"schema_version":"1.0","source":{"id":"1310.7852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7852","created_at":"2026-05-18T03:08:06Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7852v1","created_at":"2026-05-18T03:08:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7852","created_at":"2026-05-18T03:08:06Z"},{"alias_kind":"pith_short_12","alias_value":"WCXDXT2VLOJE","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WCXDXT2VLOJEQAKP","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WCXDXT2V","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:212be5a6cca33e7c185cc45fec7aceba0aea707f86ac37a55629f0a847efff45","target":"graph","created_at":"2026-05-18T03:08:06Z","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 consider the problem of user subset selection for maximizing the sum rate of downlink multi-user MIMO systems. The brute-force search for the optimal user set becomes impractical as the total number of users in a cell increase. We propose a user selection algorithm based on conditional differential entropy. We apply the proposed algorithm on Block diagonalization scheme. Simulation results show that the proposed conditional entropy based algorithm offers better alternatives than the existing user selection algorithms. Furthermore, in terms of sum rate, the solution obtained by the proposed ","authors_text":"A. K. Chaturvedi, Gaurav Gupta","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-29T15:53:54Z","title":"Conditional Entropy based User Selection for Multiuser MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7852","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:b71e280d6494adb29505548768a7ebd6c2d997bd5c0071e6d20fc4550b67d255","target":"record","created_at":"2026-05-18T03:08:06Z","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":"a16dba879719850f678d25de38390da0d1713632a5ffbe08bf2ebfedca5ef34f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-29T15:53:54Z","title_canon_sha256":"aed3f49ff973f672d937503c06ad31fa607f14ad0aa564dd220bbbdbe27fc2ed"},"schema_version":"1.0","source":{"id":"1310.7852","kind":"arxiv","version":1}},"canonical_sha256":"b0ae3bcf555b9248014f8387843107ef3112ba07a37e3ba2ec2e1d3e26ea70e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0ae3bcf555b9248014f8387843107ef3112ba07a37e3ba2ec2e1d3e26ea70e4","first_computed_at":"2026-05-18T03:08:06.427926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:06.427926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nuj6DLmyUypFYLKlgQFYidjdhmEcIt9/2385sd9fRhJ0ZEExkMB9/SY5Xx09iLOZDviVCfX0pBai88cJOawyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:06.428570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b71e280d6494adb29505548768a7ebd6c2d997bd5c0071e6d20fc4550b67d255","sha256:212be5a6cca33e7c185cc45fec7aceba0aea707f86ac37a55629f0a847efff45"],"state_sha256":"37c0b8f86f3908ca29cc0d3ed1cdf5cff0d3660c0e40e55d7ddfec8d6736f5f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJ8TFPU+PzceSSdnJ5E6dLIpSCjqMq+9YIaBa5Su1bfQ2F7z79GJhCQxPs4iGDJm3d9GkG5HakbvoHySYRaUDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:57:08.771048Z","bundle_sha256":"affd628aeb178091ad2b5d9f836bf446ae7eb0ce3b6ee81ed1af344bac71e183"}}