{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LPELMN4W3GW4APLXALIF5DXRIX","short_pith_number":"pith:LPELMN4W","canonical_record":{"source":{"id":"1105.5861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T04:21:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7ee1ec765a57b40834f3026438b8078d5423538ee18b7b32b41c76b79e7f4d5","abstract_canon_sha256":"6ba78d3ed504d53ee00db37d050fbb8ec5c945c3f2abe259820d7914524fd773"},"schema_version":"1.0"},"canonical_sha256":"5bc8b63796d9adc03d7702d05e8ef145c77381a3aa610c8cc14bb0ddf0e90b73","source":{"kind":"arxiv","id":"1105.5861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5861","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5861v1","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5861","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"LPELMN4W3GW4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LPELMN4W3GW4APLX","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LPELMN4W","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LPELMN4W3GW4APLXALIF5DXRIX","target":"record","payload":{"canonical_record":{"source":{"id":"1105.5861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T04:21:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7ee1ec765a57b40834f3026438b8078d5423538ee18b7b32b41c76b79e7f4d5","abstract_canon_sha256":"6ba78d3ed504d53ee00db37d050fbb8ec5c945c3f2abe259820d7914524fd773"},"schema_version":"1.0"},"canonical_sha256":"5bc8b63796d9adc03d7702d05e8ef145c77381a3aa610c8cc14bb0ddf0e90b73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:01.361672Z","signature_b64":"PnNtM62uT1hnEi3Qg0FVZFNu6b0kWRFMW4LGJoU7CxoWPYr3th2ZbsceCttM1sWRVcrewPqYnEFAIemXCZeTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bc8b63796d9adc03d7702d05e8ef145c77381a3aa610c8cc14bb0ddf0e90b73","last_reissued_at":"2026-05-18T04:21:01.361056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:01.361056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.5861","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-18T04:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZ8kd+c1KYs5b44VNSuUpb1SoI3gh9mtM+pbcDsiTraipW6fEnJdb8Cuk1zybR59t/nAkEzxOds5BuW7N1JECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T00:48:05.687529Z"},"content_sha256":"448aec2b61b3d9e9c5ff630e2124f7717db8e352e2395e0c43ef98732089f95f","schema_version":"1.0","event_id":"sha256:448aec2b61b3d9e9c5ff630e2124f7717db8e352e2395e0c43ef98732089f95f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LPELMN4W3GW4APLXALIF5DXRIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimality of binary power-control in a single cell via majorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hazer Inaltekin, Stephen V. Hanly","submitted_at":"2011-05-30T04:21:26Z","abstract_excerpt":"This paper considers the optimum single cell power-control maximizing the aggregate (uplink) communication rate of the cell when there are peak power constraints at mobile users, and a low-complexity data decoder (without successive decoding) at the base station. It is shown, via the theory of majorization, that the optimum power allocation is binary, which means links are either \"on\" or \"off\". By exploiting further structure of the optimum binary power allocation, a simple polynomial-time algorithm for finding the optimum transmission power allocation is proposed, together with a reduced comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5861","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-18T04:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWwNhXVlEn17WVTW/qRh1HdPvx4tedX7c+l2ktUKXTbEvslCTOpRNfXyme+dz1GEtxPJ/EPk9ugHGZuHkadnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T00:48:05.687877Z"},"content_sha256":"6243d6a71c1df8a0de72b88f9f5fb25347348441c4cf02fded3351601e041d74","schema_version":"1.0","event_id":"sha256:6243d6a71c1df8a0de72b88f9f5fb25347348441c4cf02fded3351601e041d74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPELMN4W3GW4APLXALIF5DXRIX/bundle.json","state_url":"https://pith.science/pith/LPELMN4W3GW4APLXALIF5DXRIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPELMN4W3GW4APLXALIF5DXRIX/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-20T00:48:05Z","links":{"resolver":"https://pith.science/pith/LPELMN4W3GW4APLXALIF5DXRIX","bundle":"https://pith.science/pith/LPELMN4W3GW4APLXALIF5DXRIX/bundle.json","state":"https://pith.science/pith/LPELMN4W3GW4APLXALIF5DXRIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPELMN4W3GW4APLXALIF5DXRIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LPELMN4W3GW4APLXALIF5DXRIX","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":"6ba78d3ed504d53ee00db37d050fbb8ec5c945c3f2abe259820d7914524fd773","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T04:21:26Z","title_canon_sha256":"a7ee1ec765a57b40834f3026438b8078d5423538ee18b7b32b41c76b79e7f4d5"},"schema_version":"1.0","source":{"id":"1105.5861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5861","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5861v1","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5861","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"LPELMN4W3GW4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LPELMN4W3GW4APLX","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LPELMN4W","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:6243d6a71c1df8a0de72b88f9f5fb25347348441c4cf02fded3351601e041d74","target":"graph","created_at":"2026-05-18T04:21:01Z","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 considers the optimum single cell power-control maximizing the aggregate (uplink) communication rate of the cell when there are peak power constraints at mobile users, and a low-complexity data decoder (without successive decoding) at the base station. It is shown, via the theory of majorization, that the optimum power allocation is binary, which means links are either \"on\" or \"off\". By exploiting further structure of the optimum binary power allocation, a simple polynomial-time algorithm for finding the optimum transmission power allocation is proposed, together with a reduced comp","authors_text":"Hazer Inaltekin, Stephen V. Hanly","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T04:21:26Z","title":"Optimality of binary power-control in a single cell via majorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5861","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:448aec2b61b3d9e9c5ff630e2124f7717db8e352e2395e0c43ef98732089f95f","target":"record","created_at":"2026-05-18T04:21:01Z","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":"6ba78d3ed504d53ee00db37d050fbb8ec5c945c3f2abe259820d7914524fd773","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T04:21:26Z","title_canon_sha256":"a7ee1ec765a57b40834f3026438b8078d5423538ee18b7b32b41c76b79e7f4d5"},"schema_version":"1.0","source":{"id":"1105.5861","kind":"arxiv","version":1}},"canonical_sha256":"5bc8b63796d9adc03d7702d05e8ef145c77381a3aa610c8cc14bb0ddf0e90b73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bc8b63796d9adc03d7702d05e8ef145c77381a3aa610c8cc14bb0ddf0e90b73","first_computed_at":"2026-05-18T04:21:01.361056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:01.361056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PnNtM62uT1hnEi3Qg0FVZFNu6b0kWRFMW4LGJoU7CxoWPYr3th2ZbsceCttM1sWRVcrewPqYnEFAIemXCZeTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:01.361672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:448aec2b61b3d9e9c5ff630e2124f7717db8e352e2395e0c43ef98732089f95f","sha256:6243d6a71c1df8a0de72b88f9f5fb25347348441c4cf02fded3351601e041d74"],"state_sha256":"290254cfb056e790151cc6ca2fd7b57f42bf9d301e1faade24a864c51a92c596"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ncIiI+0hDp+KBZMTe5bnITRdExPEUvvX39+f8vwwippv/SLe5DxGDpku0EZSSST43lqE0cWDmvdIzoEALSP7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T00:48:05.689873Z","bundle_sha256":"d7351ecaed948d5e6f57e376eabd8727fa49657fb36a0e70247d6763d745ba28"}}