{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K25Y7U3PP3ETIUXROQ77KEAK5U","short_pith_number":"pith:K25Y7U3P","canonical_record":{"source":{"id":"1607.00964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T17:12:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5f1ac5938e2f1f4fee6c23ba99d770d89c74ec9973c7c1becf3a6bd6111fce81","abstract_canon_sha256":"ef1b99675307518c5760148c93369fab76e7b4c88b674360f508b84f38588cc7"},"schema_version":"1.0"},"canonical_sha256":"56bb8fd36f7ec93452f1743ff5100aed27b99e579d792c3670af2b90cf71ac2d","source":{"kind":"arxiv","id":"1607.00964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00964","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00964v1","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00964","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"K25Y7U3PP3ET","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K25Y7U3PP3ETIUXR","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K25Y7U3P","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K25Y7U3PP3ETIUXROQ77KEAK5U","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T17:12:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5f1ac5938e2f1f4fee6c23ba99d770d89c74ec9973c7c1becf3a6bd6111fce81","abstract_canon_sha256":"ef1b99675307518c5760148c93369fab76e7b4c88b674360f508b84f38588cc7"},"schema_version":"1.0"},"canonical_sha256":"56bb8fd36f7ec93452f1743ff5100aed27b99e579d792c3670af2b90cf71ac2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:33.976092Z","signature_b64":"SsLTAH4BLs5sHXj7KU3VvS5VyTOmugWMq+ev4wlbOHv3YWwZMTHefnRi9/7uQXZC2iexTBLzutZFrU9Kg1XRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56bb8fd36f7ec93452f1743ff5100aed27b99e579d792c3670af2b90cf71ac2d","last_reissued_at":"2026-05-18T01:11:33.975713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:33.975713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00964","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-18T01:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwvjgAbDIVmFLZwQGiwatyYB0WfrrMF3dUMU5PKai5YJHgof8LTq7eRU3aMwROQTXJ5xBIgVl13LPHa0f4r0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:56:17.981970Z"},"content_sha256":"e9b567944ba7b0a0773d3522b3dd26807c2f4a82952563b5b98fd6dbd0cd7b88","schema_version":"1.0","event_id":"sha256:e9b567944ba7b0a0773d3522b3dd26807c2f4a82952563b5b98fd6dbd0cd7b88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K25Y7U3PP3ETIUXROQ77KEAK5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A general framework for weighted sum-rate and common-rate optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chintha Tellambura, Koosha Pourtahmasi Roshandeh, Masoud Ardakani","submitted_at":"2016-07-04T17:12:35Z","abstract_excerpt":"In this paper, we propose a framework for solving a class of optimization problems encountered in a range of power allocation problems in wireless relay networks. In particular, power allocation for weighted sum-rate and common-rate optimization problems fall in this framework. Subject to some conditions on the region of feasible powers, the optimal solutions are analytically found. The optimization problems are posed in a general form and their solutions are shown to have applications in a number of practical scenarios. Numerical results verify the optimality of the analytical approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00964","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-18T01:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8BYf40aRM5uuUSro9HDQnxqVX9hHoDwNpuuQa5GsPZSsXlXHuWNi5amWwWIII5oVGE+ZSVQ+n8qIOAoQAR9LBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:56:17.982682Z"},"content_sha256":"04f3ec7872ca0e44e448ad8c8d84e6715b8c264c9024765d994df09f6bbe942d","schema_version":"1.0","event_id":"sha256:04f3ec7872ca0e44e448ad8c8d84e6715b8c264c9024765d994df09f6bbe942d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K25Y7U3PP3ETIUXROQ77KEAK5U/bundle.json","state_url":"https://pith.science/pith/K25Y7U3PP3ETIUXROQ77KEAK5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K25Y7U3PP3ETIUXROQ77KEAK5U/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-08T02:56:17Z","links":{"resolver":"https://pith.science/pith/K25Y7U3PP3ETIUXROQ77KEAK5U","bundle":"https://pith.science/pith/K25Y7U3PP3ETIUXROQ77KEAK5U/bundle.json","state":"https://pith.science/pith/K25Y7U3PP3ETIUXROQ77KEAK5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K25Y7U3PP3ETIUXROQ77KEAK5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K25Y7U3PP3ETIUXROQ77KEAK5U","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":"ef1b99675307518c5760148c93369fab76e7b4c88b674360f508b84f38588cc7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T17:12:35Z","title_canon_sha256":"5f1ac5938e2f1f4fee6c23ba99d770d89c74ec9973c7c1becf3a6bd6111fce81"},"schema_version":"1.0","source":{"id":"1607.00964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00964","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00964v1","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00964","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"K25Y7U3PP3ET","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K25Y7U3PP3ETIUXR","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K25Y7U3P","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:04f3ec7872ca0e44e448ad8c8d84e6715b8c264c9024765d994df09f6bbe942d","target":"graph","created_at":"2026-05-18T01:11:33Z","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 propose a framework for solving a class of optimization problems encountered in a range of power allocation problems in wireless relay networks. In particular, power allocation for weighted sum-rate and common-rate optimization problems fall in this framework. Subject to some conditions on the region of feasible powers, the optimal solutions are analytically found. The optimization problems are posed in a general form and their solutions are shown to have applications in a number of practical scenarios. Numerical results verify the optimality of the analytical approach.","authors_text":"Chintha Tellambura, Koosha Pourtahmasi Roshandeh, Masoud Ardakani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T17:12:35Z","title":"A general framework for weighted sum-rate and common-rate optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00964","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:e9b567944ba7b0a0773d3522b3dd26807c2f4a82952563b5b98fd6dbd0cd7b88","target":"record","created_at":"2026-05-18T01:11:33Z","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":"ef1b99675307518c5760148c93369fab76e7b4c88b674360f508b84f38588cc7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T17:12:35Z","title_canon_sha256":"5f1ac5938e2f1f4fee6c23ba99d770d89c74ec9973c7c1becf3a6bd6111fce81"},"schema_version":"1.0","source":{"id":"1607.00964","kind":"arxiv","version":1}},"canonical_sha256":"56bb8fd36f7ec93452f1743ff5100aed27b99e579d792c3670af2b90cf71ac2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56bb8fd36f7ec93452f1743ff5100aed27b99e579d792c3670af2b90cf71ac2d","first_computed_at":"2026-05-18T01:11:33.975713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:33.975713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SsLTAH4BLs5sHXj7KU3VvS5VyTOmugWMq+ev4wlbOHv3YWwZMTHefnRi9/7uQXZC2iexTBLzutZFrU9Kg1XRAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:33.976092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9b567944ba7b0a0773d3522b3dd26807c2f4a82952563b5b98fd6dbd0cd7b88","sha256:04f3ec7872ca0e44e448ad8c8d84e6715b8c264c9024765d994df09f6bbe942d"],"state_sha256":"fac74d3e42066e21aba5c1d73a4270be41ed62b9eb6c59a73ebf498d7e68a9c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYk00HjWuGt1Cel7hxKHM6gVTVnrJO/syOla2OKsHtLvP7YFzTv2gERAkHFj1ZBXTx5Jscw+YvovrKnBWy2AAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:56:17.986780Z","bundle_sha256":"328ebe3b1d40ee6d301bc3c867f758169ab63dfbebe9ebdc11e0e7de830e894f"}}