{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:LV5MVWND6VN6E3IGYVNNPCLIFP","short_pith_number":"pith:LV5MVWND","canonical_record":{"source":{"id":"0810.1234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-07T16:29:10Z","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"title_canon_sha256":"e13154bd8adb7f39b709ab5e9dda2052b6989ad339f46d4f5c4006bc363ab2c1","abstract_canon_sha256":"10e1a68b8770dcc0ccebe8f09aa2ba3358edde59e98cf036e0f556f752ce0854"},"schema_version":"1.0"},"canonical_sha256":"5d7acad9a3f55be26d06c55ad789682bec89812053e98061bff0cef64adb8f7c","source":{"kind":"arxiv","id":"0810.1234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.1234","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0810.1234v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.1234","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"LV5MVWND6VN6","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LV5MVWND6VN6E3IG","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LV5MVWND","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:LV5MVWND6VN6E3IGYVNNPCLIFP","target":"record","payload":{"canonical_record":{"source":{"id":"0810.1234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-07T16:29:10Z","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"title_canon_sha256":"e13154bd8adb7f39b709ab5e9dda2052b6989ad339f46d4f5c4006bc363ab2c1","abstract_canon_sha256":"10e1a68b8770dcc0ccebe8f09aa2ba3358edde59e98cf036e0f556f752ce0854"},"schema_version":"1.0"},"canonical_sha256":"5d7acad9a3f55be26d06c55ad789682bec89812053e98061bff0cef64adb8f7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.649546Z","signature_b64":"75Y1xoXRe4rE+QKn6GnZPZbMTjcYDjBPlhTFJC0JjSuQ+pi2zGM88bu0d9HRFwU8K3gJyE4s4MIf7LMmvi7EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d7acad9a3f55be26d06c55ad789682bec89812053e98061bff0cef64adb8f7c","last_reissued_at":"2026-05-18T00:59:11.649058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.649058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0810.1234","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPqJS+6v6SUTNTLQrigjKNfwa26vAAWZM/eBfQoeXLYIiLWxTAoPQnd7/M1NQuKnP0l/qNMQogu91L5AKsgqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:56:22.247125Z"},"content_sha256":"ad4a04668d0d465274187cc243bdea07a58d79bb2660944bdd66d8ca5ea8e86a","schema_version":"1.0","event_id":"sha256:ad4a04668d0d465274187cc243bdea07a58d79bb2660944bdd66d8ca5ea8e86a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:LV5MVWND6VN6E3IGYVNNPCLIFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Resource Allocation in Fading Multiple Access Channels - An Efficient Approximate Projection Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ali ParandehGheibi, Asuman Ozdaglar, Atilla Eryilmaz, Muriel Medard","submitted_at":"2008-10-07T16:29:10Z","abstract_excerpt":"We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates on the information theoretic capacity region of the multiple-access channel. Our policies does not require queue-length information. We consider several different scenarios. First, we address the utility maximization problem in a nonfading channel to obtain the optimal operating rates, and present an iterative gradient projection algorithm that uses approximate projection. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.1234","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hl01Cf2GF99aekVzAiz5+Ogmho6+RZbFZhSI60cOT9KXcux3dxazcdtfm/ejlkSEV47jaP3psMaJW6RAdH6xBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:56:22.247805Z"},"content_sha256":"f37d32795048298d7d0a2b58af77f2d7a2646e5b894a7c611409f0c19394deb9","schema_version":"1.0","event_id":"sha256:f37d32795048298d7d0a2b58af77f2d7a2646e5b894a7c611409f0c19394deb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/bundle.json","state_url":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/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-24T23:56:22Z","links":{"resolver":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP","bundle":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/bundle.json","state":"https://pith.science/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LV5MVWND6VN6E3IGYVNNPCLIFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:LV5MVWND6VN6E3IGYVNNPCLIFP","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":"10e1a68b8770dcc0ccebe8f09aa2ba3358edde59e98cf036e0f556f752ce0854","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-07T16:29:10Z","title_canon_sha256":"e13154bd8adb7f39b709ab5e9dda2052b6989ad339f46d4f5c4006bc363ab2c1"},"schema_version":"1.0","source":{"id":"0810.1234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.1234","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0810.1234v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.1234","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"LV5MVWND6VN6","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LV5MVWND6VN6E3IG","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LV5MVWND","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:f37d32795048298d7d0a2b58af77f2d7a2646e5b894a7c611409f0c19394deb9","target":"graph","created_at":"2026-05-18T00:59:11Z","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 rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates on the information theoretic capacity region of the multiple-access channel. Our policies does not require queue-length information. We consider several different scenarios. First, we address the utility maximization problem in a nonfading channel to obtain the optimal operating rates, and present an iterative gradient projection algorithm that uses approximate projection. ","authors_text":"Ali ParandehGheibi, Asuman Ozdaglar, Atilla Eryilmaz, Muriel Medard","cross_cats":["cs.NI","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-07T16:29:10Z","title":"On Resource Allocation in Fading Multiple Access Channels - An Efficient Approximate Projection Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.1234","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:ad4a04668d0d465274187cc243bdea07a58d79bb2660944bdd66d8ca5ea8e86a","target":"record","created_at":"2026-05-18T00:59:11Z","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":"10e1a68b8770dcc0ccebe8f09aa2ba3358edde59e98cf036e0f556f752ce0854","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-07T16:29:10Z","title_canon_sha256":"e13154bd8adb7f39b709ab5e9dda2052b6989ad339f46d4f5c4006bc363ab2c1"},"schema_version":"1.0","source":{"id":"0810.1234","kind":"arxiv","version":1}},"canonical_sha256":"5d7acad9a3f55be26d06c55ad789682bec89812053e98061bff0cef64adb8f7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d7acad9a3f55be26d06c55ad789682bec89812053e98061bff0cef64adb8f7c","first_computed_at":"2026-05-18T00:59:11.649058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.649058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"75Y1xoXRe4rE+QKn6GnZPZbMTjcYDjBPlhTFJC0JjSuQ+pi2zGM88bu0d9HRFwU8K3gJyE4s4MIf7LMmvi7EDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.649546Z","signed_message":"canonical_sha256_bytes"},"source_id":"0810.1234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad4a04668d0d465274187cc243bdea07a58d79bb2660944bdd66d8ca5ea8e86a","sha256:f37d32795048298d7d0a2b58af77f2d7a2646e5b894a7c611409f0c19394deb9"],"state_sha256":"ac30a84bfcb4ee6ccba73decee6d031253043b1e9868b05f8134597bd480c5d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g53KJ+EXreWgCGCrj7p1C+Om4HLT4R4B/39BPklgxPb8r/63WZkh3cNvyw/Gt7Z69GMF2bICu8VZenCAsi5mAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:56:22.251326Z","bundle_sha256":"0ffa56a7c7182fff6a50ffe88bc22c7cf3fca66879132813a45a451d277ce3ca"}}