{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UBJAAHGARR2FIDDPJO2W6XOCVC","short_pith_number":"pith:UBJAAHGA","canonical_record":{"source":{"id":"1811.05155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T08:17:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b8d971583ff3bea48b0e67bf1420a5557360c9924f353486e844c651f835c63","abstract_canon_sha256":"f15fa1a1dd8aa9c38bbc7c96d31334e0efbf135381005b96c54fc39ff52f9485"},"schema_version":"1.0"},"canonical_sha256":"a052001cc08c74540c6f4bb56f5dc2a89abf46df0d24e6c54a29bbcdc31baaa9","source":{"kind":"arxiv","id":"1811.05155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05155","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05155v1","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05155","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"UBJAAHGARR2F","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UBJAAHGARR2FIDDP","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UBJAAHGA","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UBJAAHGARR2FIDDPJO2W6XOCVC","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T08:17:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b8d971583ff3bea48b0e67bf1420a5557360c9924f353486e844c651f835c63","abstract_canon_sha256":"f15fa1a1dd8aa9c38bbc7c96d31334e0efbf135381005b96c54fc39ff52f9485"},"schema_version":"1.0"},"canonical_sha256":"a052001cc08c74540c6f4bb56f5dc2a89abf46df0d24e6c54a29bbcdc31baaa9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:46.767366Z","signature_b64":"OPF1DOA64bvIa5GCWOnuAwP+AksxHFF3F/3JTMKyaAk3vDCOO0rUG9jS1uz2rViFPwN5nSBAlc4Sp8AO2z8KBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a052001cc08c74540c6f4bb56f5dc2a89abf46df0d24e6c54a29bbcdc31baaa9","last_reissued_at":"2026-05-18T00:00:46.766736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:46.766736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05155","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-18T00:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbZVo0uq7t0StIj3/REZj/VTkhxa8UMMmOcLLIhiv3IPFD2oBLBKxiqcGK+Kfjse22zaePZprQezoG3pHtHBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:49:25.478903Z"},"content_sha256":"fc76402e53d602691ef0c9d3ca1949ea0c233c908b80c44db445e245e6471377","schema_version":"1.0","event_id":"sha256:fc76402e53d602691ef0c9d3ca1949ea0c233c908b80c44db445e245e6471377"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UBJAAHGARR2FIDDPJO2W6XOCVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Throughput of Large-but-Finite MIMO Networks using Schedulers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Makki, Mohamed-Slim Alouini, Tommy Svensson","submitted_at":"2018-11-13T08:17:02Z","abstract_excerpt":"This paper studies the sum throughput of the {multi-user} multiple-input-single-output (MISO) networks in the cases with large but finite number of transmit antennas and users. Considering continuous and bursty communication scenarios with different users' data request probabilities, we derive quasi-closed-form expressions for the maximum achievable throughput of the networks using optimal schedulers. The results are obtained in various cases with different levels of interference cancellation. Also, we develop an efficient scheduling scheme using genetic algorithms (GAs), and evaluate the effe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05155","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-18T00:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TgYPCK+PIJDe9O7DeeRk3vRU5OLkvqzOQ4ZBOBfA7p2HC+X2ktigWngY7abVzZuxKTIi7FMVr6usVk3qMgnLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:49:25.479656Z"},"content_sha256":"3bb3ab46eea398c99e6e6f8f1b29e8f58e07c59dc76bff327035dcca28772aad","schema_version":"1.0","event_id":"sha256:3bb3ab46eea398c99e6e6f8f1b29e8f58e07c59dc76bff327035dcca28772aad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBJAAHGARR2FIDDPJO2W6XOCVC/bundle.json","state_url":"https://pith.science/pith/UBJAAHGARR2FIDDPJO2W6XOCVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBJAAHGARR2FIDDPJO2W6XOCVC/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-11T00:49:25Z","links":{"resolver":"https://pith.science/pith/UBJAAHGARR2FIDDPJO2W6XOCVC","bundle":"https://pith.science/pith/UBJAAHGARR2FIDDPJO2W6XOCVC/bundle.json","state":"https://pith.science/pith/UBJAAHGARR2FIDDPJO2W6XOCVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBJAAHGARR2FIDDPJO2W6XOCVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UBJAAHGARR2FIDDPJO2W6XOCVC","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":"f15fa1a1dd8aa9c38bbc7c96d31334e0efbf135381005b96c54fc39ff52f9485","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T08:17:02Z","title_canon_sha256":"1b8d971583ff3bea48b0e67bf1420a5557360c9924f353486e844c651f835c63"},"schema_version":"1.0","source":{"id":"1811.05155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05155","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05155v1","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05155","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"UBJAAHGARR2F","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UBJAAHGARR2FIDDP","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UBJAAHGA","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:3bb3ab46eea398c99e6e6f8f1b29e8f58e07c59dc76bff327035dcca28772aad","target":"graph","created_at":"2026-05-18T00:00:46Z","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":"This paper studies the sum throughput of the {multi-user} multiple-input-single-output (MISO) networks in the cases with large but finite number of transmit antennas and users. Considering continuous and bursty communication scenarios with different users' data request probabilities, we derive quasi-closed-form expressions for the maximum achievable throughput of the networks using optimal schedulers. The results are obtained in various cases with different levels of interference cancellation. Also, we develop an efficient scheduling scheme using genetic algorithms (GAs), and evaluate the effe","authors_text":"Behrooz Makki, Mohamed-Slim Alouini, Tommy Svensson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T08:17:02Z","title":"On the Throughput of Large-but-Finite MIMO Networks using Schedulers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05155","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:fc76402e53d602691ef0c9d3ca1949ea0c233c908b80c44db445e245e6471377","target":"record","created_at":"2026-05-18T00:00:46Z","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":"f15fa1a1dd8aa9c38bbc7c96d31334e0efbf135381005b96c54fc39ff52f9485","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T08:17:02Z","title_canon_sha256":"1b8d971583ff3bea48b0e67bf1420a5557360c9924f353486e844c651f835c63"},"schema_version":"1.0","source":{"id":"1811.05155","kind":"arxiv","version":1}},"canonical_sha256":"a052001cc08c74540c6f4bb56f5dc2a89abf46df0d24e6c54a29bbcdc31baaa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a052001cc08c74540c6f4bb56f5dc2a89abf46df0d24e6c54a29bbcdc31baaa9","first_computed_at":"2026-05-18T00:00:46.766736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:46.766736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OPF1DOA64bvIa5GCWOnuAwP+AksxHFF3F/3JTMKyaAk3vDCOO0rUG9jS1uz2rViFPwN5nSBAlc4Sp8AO2z8KBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:46.767366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc76402e53d602691ef0c9d3ca1949ea0c233c908b80c44db445e245e6471377","sha256:3bb3ab46eea398c99e6e6f8f1b29e8f58e07c59dc76bff327035dcca28772aad"],"state_sha256":"9c9195d63b20d210d87b92c7aebcab88588edca9b4758d29a917aee91ee090f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3aWQkJ50BOZJphDEDjwdNaLgHoTtb9EBImmHuv9MHqNg9Y9AWw/WlpBjw8KmE7DZ0ybuJFdcKifw7eGf+6EAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:49:25.483871Z","bundle_sha256":"68f269aca6d609cb1e5ecebb3d47b00cc6cd12d7f6601baaa3a9c8f059fc6e40"}}