{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:BZJRRSHCZPHIRBLXENMDQQRTPQ","short_pith_number":"pith:BZJRRSHC","canonical_record":{"source":{"id":"0810.1260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-07T18:08:10Z","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"title_canon_sha256":"cee9951d21e13fa32ab3f6740d79cbae68aa2758d9e31b620a3c027512f9e402","abstract_canon_sha256":"bb4fb3fe9ada8f741729149edb2af2b60e59b983ec0f45a4140da954c45fe92d"},"schema_version":"1.0"},"canonical_sha256":"0e5318c8e2cbce88857723583842337c38e153bdb8b3547f69e4e7381805470f","source":{"kind":"arxiv","id":"0810.1260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.1260","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"arxiv_version","alias_value":"0810.1260v1","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.1260","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_12","alias_value":"BZJRRSHCZPHI","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_16","alias_value":"BZJRRSHCZPHIRBLX","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_8","alias_value":"BZJRRSHC","created_at":"2026-07-04T15:14:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:BZJRRSHCZPHIRBLXENMDQQRTPQ","target":"record","payload":{"canonical_record":{"source":{"id":"0810.1260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-07T18:08:10Z","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"title_canon_sha256":"cee9951d21e13fa32ab3f6740d79cbae68aa2758d9e31b620a3c027512f9e402","abstract_canon_sha256":"bb4fb3fe9ada8f741729149edb2af2b60e59b983ec0f45a4140da954c45fe92d"},"schema_version":"1.0"},"canonical_sha256":"0e5318c8e2cbce88857723583842337c38e153bdb8b3547f69e4e7381805470f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:14:56.117587Z","signature_b64":"wIzePXJqSmO8qnk/nV1QIB7/q+L+ju5jTiWIfMAWKYXsh7t3D2MQd4oVjFPivnYNJVprUmxXu5U/QwWDCjA3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e5318c8e2cbce88857723583842337c38e153bdb8b3547f69e4e7381805470f","last_reissued_at":"2026-07-04T15:14:56.117198Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:14:56.117198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0810.1260","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-07-04T15:14:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlpabrUsTujwzndC/6SLlSoLQC6PpTc/3QfJ8TVordHhtikTPCDi2AzRHvEl2d28irpKvf73svf6PeooYwg7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:26:47.246312Z"},"content_sha256":"e9c11b619426a1b372599ed03541e94ebed6fa3f7647d2b5a5239f27d445d65c","schema_version":"1.0","event_id":"sha256:e9c11b619426a1b372599ed03541e94ebed6fa3f7647d2b5a5239f27d445d65c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:BZJRRSHCZPHIRBLXENMDQQRTPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rate and Power Allocation in Fading Multiple Access Channels","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-07T18:08:10Z","abstract_excerpt":"We consider the problem of rate and power allocation in a fading multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a utility function defined over average transmission rates. In contrast with the literature, which focuses on the linear case, we present results for general concave utility functions. We consider two cases. In the first case, we assume that power control is possible and channel statistics are known. In this case, we show that the optimal policies can be obtained greedily by maximizing a linear utility function at each channel sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.1260","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0810.1260/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:14:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHdYbTKmc4GjIQlVU2aEp+CVGMd150EkBYRXUc7RegT6huYLbMdbcUJbAmYx3B8N+m4qpnAQGLrACZv6wubfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:26:47.247119Z"},"content_sha256":"f0ae394f535e2b16dda1d8753d68d9aec7e65f54c4270a3040f2a2d8a4236fea","schema_version":"1.0","event_id":"sha256:f0ae394f535e2b16dda1d8753d68d9aec7e65f54c4270a3040f2a2d8a4236fea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZJRRSHCZPHIRBLXENMDQQRTPQ/bundle.json","state_url":"https://pith.science/pith/BZJRRSHCZPHIRBLXENMDQQRTPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZJRRSHCZPHIRBLXENMDQQRTPQ/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-08-06T01:26:47Z","links":{"resolver":"https://pith.science/pith/BZJRRSHCZPHIRBLXENMDQQRTPQ","bundle":"https://pith.science/pith/BZJRRSHCZPHIRBLXENMDQQRTPQ/bundle.json","state":"https://pith.science/pith/BZJRRSHCZPHIRBLXENMDQQRTPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZJRRSHCZPHIRBLXENMDQQRTPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:BZJRRSHCZPHIRBLXENMDQQRTPQ","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":"bb4fb3fe9ada8f741729149edb2af2b60e59b983ec0f45a4140da954c45fe92d","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-07T18:08:10Z","title_canon_sha256":"cee9951d21e13fa32ab3f6740d79cbae68aa2758d9e31b620a3c027512f9e402"},"schema_version":"1.0","source":{"id":"0810.1260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.1260","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"arxiv_version","alias_value":"0810.1260v1","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.1260","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_12","alias_value":"BZJRRSHCZPHI","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_16","alias_value":"BZJRRSHCZPHIRBLX","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_8","alias_value":"BZJRRSHC","created_at":"2026-07-04T15:14:56Z"}],"graph_snapshots":[{"event_id":"sha256:f0ae394f535e2b16dda1d8753d68d9aec7e65f54c4270a3040f2a2d8a4236fea","target":"graph","created_at":"2026-07-04T15:14:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0810.1260/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of rate and power allocation in a fading multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a utility function defined over average transmission rates. In contrast with the literature, which focuses on the linear case, we present results for general concave utility functions. We consider two cases. In the first case, we assume that power control is possible and channel statistics are known. In this case, we show that the optimal policies can be obtained greedily by maximizing a linear utility function at each channel sta","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-07T18:08:10Z","title":"Rate and Power Allocation in Fading Multiple Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.1260","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:e9c11b619426a1b372599ed03541e94ebed6fa3f7647d2b5a5239f27d445d65c","target":"record","created_at":"2026-07-04T15:14:56Z","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":"bb4fb3fe9ada8f741729149edb2af2b60e59b983ec0f45a4140da954c45fe92d","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-07T18:08:10Z","title_canon_sha256":"cee9951d21e13fa32ab3f6740d79cbae68aa2758d9e31b620a3c027512f9e402"},"schema_version":"1.0","source":{"id":"0810.1260","kind":"arxiv","version":1}},"canonical_sha256":"0e5318c8e2cbce88857723583842337c38e153bdb8b3547f69e4e7381805470f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e5318c8e2cbce88857723583842337c38e153bdb8b3547f69e4e7381805470f","first_computed_at":"2026-07-04T15:14:56.117198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:14:56.117198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wIzePXJqSmO8qnk/nV1QIB7/q+L+ju5jTiWIfMAWKYXsh7t3D2MQd4oVjFPivnYNJVprUmxXu5U/QwWDCjA3DA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:14:56.117587Z","signed_message":"canonical_sha256_bytes"},"source_id":"0810.1260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9c11b619426a1b372599ed03541e94ebed6fa3f7647d2b5a5239f27d445d65c","sha256:f0ae394f535e2b16dda1d8753d68d9aec7e65f54c4270a3040f2a2d8a4236fea"],"state_sha256":"d041b22929f16f3bb5be8b32867a76d2baa77ba31b5aa326c0419af317e01b1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G6/TgI7ee/D3QPeipyO7r512RcRhDsNtscg0UD2zw22azwVjmqpgzmEqd8BeS+PVxbLMrsQ5cqwTrlhWCx0rDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:26:47.254270Z","bundle_sha256":"2493b6a0ce169d69163ccf81eabc01653d547810d23bc43eb4e345d603a31ee7"}}