{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:AP4F4ZFBP6K3WAJMQZKYOKDJUV","short_pith_number":"pith:AP4F4ZFB","canonical_record":{"source":{"id":"0810.1267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-07T18:24:21Z","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"title_canon_sha256":"6a149e0aa9d94de3c3ecd41e9b78cd58dbd70e7188e70f054c276a328ca848c4","abstract_canon_sha256":"9e10a4ae634c603dd327852d434dba66d47dd32630a4548beea88932f32d1475"},"schema_version":"1.0"},"canonical_sha256":"03f85e64a17f95bb012c8655872869a55d1c37eb2dcd03c78255ed03e885ad8c","source":{"kind":"arxiv","id":"0810.1267","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.1267","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"arxiv_version","alias_value":"0810.1267v1","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.1267","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_12","alias_value":"AP4F4ZFBP6K3","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_16","alias_value":"AP4F4ZFBP6K3WAJM","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_8","alias_value":"AP4F4ZFB","created_at":"2026-07-04T15:14:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:AP4F4ZFBP6K3WAJMQZKYOKDJUV","target":"record","payload":{"canonical_record":{"source":{"id":"0810.1267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-07T18:24:21Z","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"title_canon_sha256":"6a149e0aa9d94de3c3ecd41e9b78cd58dbd70e7188e70f054c276a328ca848c4","abstract_canon_sha256":"9e10a4ae634c603dd327852d434dba66d47dd32630a4548beea88932f32d1475"},"schema_version":"1.0"},"canonical_sha256":"03f85e64a17f95bb012c8655872869a55d1c37eb2dcd03c78255ed03e885ad8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:14:56.199142Z","signature_b64":"QVJVmvtwnLtvvxYlwH103T0eybAJ7SecUJ+JwxtBY9vy0l5TJ4CMA2AZPCY4oD2WiXc6Wud3tjBhUs/uYOaNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03f85e64a17f95bb012c8655872869a55d1c37eb2dcd03c78255ed03e885ad8c","last_reissued_at":"2026-07-04T15:14:56.198765Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:14:56.198765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0810.1267","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":"XR/zyXDW6ipslNYvlCEIDQQp+GvAriY3x8MXrjU3nP7k/3ouz1e/eYLfgk0q1MJeGjV7Nj2HzWImoElxn6DUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:04:06.148106Z"},"content_sha256":"40fbac741bd4e106e95ab25c7d737c1241a11548824131b80f5d229cebc6627a","schema_version":"1.0","event_id":"sha256:40fbac741bd4e106e95ab25c7d737c1241a11548824131b80f5d229cebc6627a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:AP4F4ZFBP6K3WAJMQZKYOKDJUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Theory vs. Queueing Theory for Resource Allocation in 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:24:21Z","abstract_excerpt":"We consider the problem of rate allocation in a fading Gaussian multiple-access channel with fixed transmission powers. The goal is to maximize a general concave utility function of the expected achieved rates of the users. There are different approaches to this problem in the literature. From an information theoretic point of view, rates are allocated only by using the channel state information. The queueing theory approach utilizes the global queue-length information for rate allocation to guarantee throughput optimality as well as maximizing a utility function of the rates. In this work, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.1267","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.1267/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":"jMChcRy82HAYG9eqaIi7/fkQMGjZJWUgNLbqn55N7lPbEexl04ARznqFpeiBa26gw0k+QZkr8/Oz6BjDq68wBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:04:06.148705Z"},"content_sha256":"2dd97652f1d7f0bf2d1901f2f5b17e3ff28d9951ce93467231e4c404fc1054b9","schema_version":"1.0","event_id":"sha256:2dd97652f1d7f0bf2d1901f2f5b17e3ff28d9951ce93467231e4c404fc1054b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AP4F4ZFBP6K3WAJMQZKYOKDJUV/bundle.json","state_url":"https://pith.science/pith/AP4F4ZFBP6K3WAJMQZKYOKDJUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AP4F4ZFBP6K3WAJMQZKYOKDJUV/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-06T03:04:06Z","links":{"resolver":"https://pith.science/pith/AP4F4ZFBP6K3WAJMQZKYOKDJUV","bundle":"https://pith.science/pith/AP4F4ZFBP6K3WAJMQZKYOKDJUV/bundle.json","state":"https://pith.science/pith/AP4F4ZFBP6K3WAJMQZKYOKDJUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AP4F4ZFBP6K3WAJMQZKYOKDJUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:AP4F4ZFBP6K3WAJMQZKYOKDJUV","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":"9e10a4ae634c603dd327852d434dba66d47dd32630a4548beea88932f32d1475","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:24:21Z","title_canon_sha256":"6a149e0aa9d94de3c3ecd41e9b78cd58dbd70e7188e70f054c276a328ca848c4"},"schema_version":"1.0","source":{"id":"0810.1267","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.1267","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"arxiv_version","alias_value":"0810.1267v1","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.1267","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_12","alias_value":"AP4F4ZFBP6K3","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_16","alias_value":"AP4F4ZFBP6K3WAJM","created_at":"2026-07-04T15:14:56Z"},{"alias_kind":"pith_short_8","alias_value":"AP4F4ZFB","created_at":"2026-07-04T15:14:56Z"}],"graph_snapshots":[{"event_id":"sha256:2dd97652f1d7f0bf2d1901f2f5b17e3ff28d9951ce93467231e4c404fc1054b9","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.1267/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of rate allocation in a fading Gaussian multiple-access channel with fixed transmission powers. The goal is to maximize a general concave utility function of the expected achieved rates of the users. There are different approaches to this problem in the literature. From an information theoretic point of view, rates are allocated only by using the channel state information. The queueing theory approach utilizes the global queue-length information for rate allocation to guarantee throughput optimality as well as maximizing a utility function of the rates. In this work, we","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:24:21Z","title":"Information Theory vs. Queueing Theory for Resource Allocation in Multiple Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.1267","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:40fbac741bd4e106e95ab25c7d737c1241a11548824131b80f5d229cebc6627a","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":"9e10a4ae634c603dd327852d434dba66d47dd32630a4548beea88932f32d1475","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:24:21Z","title_canon_sha256":"6a149e0aa9d94de3c3ecd41e9b78cd58dbd70e7188e70f054c276a328ca848c4"},"schema_version":"1.0","source":{"id":"0810.1267","kind":"arxiv","version":1}},"canonical_sha256":"03f85e64a17f95bb012c8655872869a55d1c37eb2dcd03c78255ed03e885ad8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03f85e64a17f95bb012c8655872869a55d1c37eb2dcd03c78255ed03e885ad8c","first_computed_at":"2026-07-04T15:14:56.198765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:14:56.198765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QVJVmvtwnLtvvxYlwH103T0eybAJ7SecUJ+JwxtBY9vy0l5TJ4CMA2AZPCY4oD2WiXc6Wud3tjBhUs/uYOaNAg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:14:56.199142Z","signed_message":"canonical_sha256_bytes"},"source_id":"0810.1267","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40fbac741bd4e106e95ab25c7d737c1241a11548824131b80f5d229cebc6627a","sha256:2dd97652f1d7f0bf2d1901f2f5b17e3ff28d9951ce93467231e4c404fc1054b9"],"state_sha256":"d7d4cf54976b591442f565324de0e93d8cae065bb02642a2053c763adb8ba91a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdEpwnYx5k2WEMsM7WH/sCmGOKDjl4jYiPM/0OsKxY6rl8tYFzcBSmQho/UFrRPI04rqyc0Cx76A8gV/MrkwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T03:04:06.154470Z","bundle_sha256":"0765edbc4c97cc4bfcdc6599a24a8fc712809f1f5c75f91f30f510d2a27c9f3b"}}