{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EIEJ6S5PRO4H2O5EQMAXOQ7DKY","short_pith_number":"pith:EIEJ6S5P","canonical_record":{"source":{"id":"1310.7425","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-28T14:12:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a6f5695eff6f26430df304370a16ad9f1490f213690d7d3280ef63cad49209ee","abstract_canon_sha256":"d3254954c8664a03151f61fa28ee68e86407708a1573d0229dab32287c9005fa"},"schema_version":"1.0"},"canonical_sha256":"22089f4baf8bb87d3ba483017743e35604239159a4a61b1907a396fa45a9762f","source":{"kind":"arxiv","id":"1310.7425","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7425","created_at":"2026-05-18T02:49:28Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7425v4","created_at":"2026-05-18T02:49:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7425","created_at":"2026-05-18T02:49:28Z"},{"alias_kind":"pith_short_12","alias_value":"EIEJ6S5PRO4H","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EIEJ6S5PRO4H2O5E","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EIEJ6S5P","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EIEJ6S5PRO4H2O5EQMAXOQ7DKY","target":"record","payload":{"canonical_record":{"source":{"id":"1310.7425","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-28T14:12:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a6f5695eff6f26430df304370a16ad9f1490f213690d7d3280ef63cad49209ee","abstract_canon_sha256":"d3254954c8664a03151f61fa28ee68e86407708a1573d0229dab32287c9005fa"},"schema_version":"1.0"},"canonical_sha256":"22089f4baf8bb87d3ba483017743e35604239159a4a61b1907a396fa45a9762f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:28.728500Z","signature_b64":"PCUhFV+CpyQNq6BYEqprTm5wz/FPpoFb5tQoRKLVgXknx5wtWpyR0mlPV7yfqncGfEnHgxgCaVlNZGKUYXTlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22089f4baf8bb87d3ba483017743e35604239159a4a61b1907a396fa45a9762f","last_reissued_at":"2026-05-18T02:49:28.727962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:28.727962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.7425","source_version":4,"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-18T02:49:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mv9JK3Zm1vZw/GplyLZN8g9McI6aEOCXvtQ2J7SrHUwadH2w7Ed9icHBQMzc3VBTaw0q3ySMRr+mypbvZ8SCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:04:27.196807Z"},"content_sha256":"63d49ac0e9537f5fc13b2b9835afbde2c17d807fd154fb2f3657cf70e55ea147","schema_version":"1.0","event_id":"sha256:63d49ac0e9537f5fc13b2b9835afbde2c17d807fd154fb2f3657cf70e55ea147"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EIEJ6S5PRO4H2O5EQMAXOQ7DKY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"User Selection in MIMO Interfering Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ajit K Chaturvedi, Gaurav Gupta","submitted_at":"2013-10-28T14:12:52Z","abstract_excerpt":"Interference alignment aims to achieve maximum degrees of freedom in an interference system. For achieving Interference alignment in interfering broadcast systems a closed-form solution is proposed in [1] which is an extension of the grouping scheme in [2]. In a downlink scenario where there are a large number of users, the base station is required to select a subset of users such that the sum rate is maximized. To search for the optimal user subset using brute-force approach is computationally exhaustive because of the large number of possible user subset combinations. We propose a user selec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7425","kind":"arxiv","version":4},"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-18T02:49:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOdtqUIzclIkgZ+kCPyL1u54VNlliV4wK9kByaQobOUYi68TTiLGPLujM+CfLhLxKD87pye2sb1tzjK2IbKnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:04:27.197496Z"},"content_sha256":"367d2092bb4d5c403c0b28a5b7cd305a7e888c61c39a0e14dfd6060642daaa57","schema_version":"1.0","event_id":"sha256:367d2092bb4d5c403c0b28a5b7cd305a7e888c61c39a0e14dfd6060642daaa57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/bundle.json","state_url":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/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-26T22:04:27Z","links":{"resolver":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY","bundle":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/bundle.json","state":"https://pith.science/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIEJ6S5PRO4H2O5EQMAXOQ7DKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EIEJ6S5PRO4H2O5EQMAXOQ7DKY","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":"d3254954c8664a03151f61fa28ee68e86407708a1573d0229dab32287c9005fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-28T14:12:52Z","title_canon_sha256":"a6f5695eff6f26430df304370a16ad9f1490f213690d7d3280ef63cad49209ee"},"schema_version":"1.0","source":{"id":"1310.7425","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7425","created_at":"2026-05-18T02:49:28Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7425v4","created_at":"2026-05-18T02:49:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7425","created_at":"2026-05-18T02:49:28Z"},{"alias_kind":"pith_short_12","alias_value":"EIEJ6S5PRO4H","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EIEJ6S5PRO4H2O5E","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EIEJ6S5P","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:367d2092bb4d5c403c0b28a5b7cd305a7e888c61c39a0e14dfd6060642daaa57","target":"graph","created_at":"2026-05-18T02:49:28Z","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":"Interference alignment aims to achieve maximum degrees of freedom in an interference system. For achieving Interference alignment in interfering broadcast systems a closed-form solution is proposed in [1] which is an extension of the grouping scheme in [2]. In a downlink scenario where there are a large number of users, the base station is required to select a subset of users such that the sum rate is maximized. To search for the optimal user subset using brute-force approach is computationally exhaustive because of the large number of possible user subset combinations. We propose a user selec","authors_text":"Ajit 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-28T14:12:52Z","title":"User Selection in MIMO Interfering Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7425","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:63d49ac0e9537f5fc13b2b9835afbde2c17d807fd154fb2f3657cf70e55ea147","target":"record","created_at":"2026-05-18T02:49:28Z","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":"d3254954c8664a03151f61fa28ee68e86407708a1573d0229dab32287c9005fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-28T14:12:52Z","title_canon_sha256":"a6f5695eff6f26430df304370a16ad9f1490f213690d7d3280ef63cad49209ee"},"schema_version":"1.0","source":{"id":"1310.7425","kind":"arxiv","version":4}},"canonical_sha256":"22089f4baf8bb87d3ba483017743e35604239159a4a61b1907a396fa45a9762f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22089f4baf8bb87d3ba483017743e35604239159a4a61b1907a396fa45a9762f","first_computed_at":"2026-05-18T02:49:28.727962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:28.727962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PCUhFV+CpyQNq6BYEqprTm5wz/FPpoFb5tQoRKLVgXknx5wtWpyR0mlPV7yfqncGfEnHgxgCaVlNZGKUYXTlBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:28.728500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7425","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63d49ac0e9537f5fc13b2b9835afbde2c17d807fd154fb2f3657cf70e55ea147","sha256:367d2092bb4d5c403c0b28a5b7cd305a7e888c61c39a0e14dfd6060642daaa57"],"state_sha256":"ffd3835c2166f85af6745a36d48d692ebb74a8b4e921f2fc3f201a2ed25d422c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caU6WwboPUzZiF+3sj+Oa8T9T36vgZNqgYkqIk1R2cQ1vkUJgKyqEa4aAONapBAd6YXWuiAnYQiU6Vwkti4FDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:04:27.200975Z","bundle_sha256":"d15e895f72273c0551d355834c2657114dd435c45ab175e34e087bc92a32a3df"}}