{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:34HNWPZCDD6XCU2EVN5ZK733OH","short_pith_number":"pith:34HNWPZC","canonical_record":{"source":{"id":"0711.1273","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"2007-11-08T13:39:15Z","cross_cats_sorted":[],"title_canon_sha256":"29b965d3811b2aea951f8d8c50ad61378a85efbab1454658e4404b0ff5d2e988","abstract_canon_sha256":"f4c0e46631b720a5573c96a07c0efaaf3bb769cca7aec9a47ee94da83033d896"},"schema_version":"1.0"},"canonical_sha256":"df0edb3f2218fd715344ab7b957f7b71efaac6e03e680972d18868f6f5da77dd","source":{"kind":"arxiv","id":"0711.1273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.1273","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0711.1273v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.1273","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"34HNWPZCDD6X","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"34HNWPZCDD6XCU2E","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"34HNWPZC","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:34HNWPZCDD6XCU2EVN5ZK733OH","target":"record","payload":{"canonical_record":{"source":{"id":"0711.1273","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"2007-11-08T13:39:15Z","cross_cats_sorted":[],"title_canon_sha256":"29b965d3811b2aea951f8d8c50ad61378a85efbab1454658e4404b0ff5d2e988","abstract_canon_sha256":"f4c0e46631b720a5573c96a07c0efaaf3bb769cca7aec9a47ee94da83033d896"},"schema_version":"1.0"},"canonical_sha256":"df0edb3f2218fd715344ab7b957f7b71efaac6e03e680972d18868f6f5da77dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.808261Z","signature_b64":"QcKDy6junQCSe6LKc9J389oKv8+CuBh75uhsHVHhxB7zqY45hYmNzbTiI9WJcKZ7LpC4RuyTarzK35ZbFz7tCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df0edb3f2218fd715344ab7b957f7b71efaac6e03e680972d18868f6f5da77dd","last_reissued_at":"2026-05-18T00:57:58.807808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.807808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0711.1273","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:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mw5pS85bUDJkGT2G5mPwgyxbir538zvWqJSc1yoqftNvCMq3WIRInAidmkOQTgB0BtBV90NOa+pSFouYA/F8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:02:28.306116Z"},"content_sha256":"518a6abd18afa2e4a7e548f58f5bba50152b98d032ee1f53265f2809509e36be","schema_version":"1.0","event_id":"sha256:518a6abd18afa2e4a7e548f58f5bba50152b98d032ee1f53265f2809509e36be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:34HNWPZCDD6XCU2EVN5ZK733OH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Resource Allocation Algorithms for QoS in OFDMA-based Wireless Systems","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anthony Ephremides, Chenxi Zhu, Jonathan R. Agre, Tolga Girici","submitted_at":"2007-11-08T13:39:15Z","abstract_excerpt":"In this work we propose an efficient resource allocation algorithm for OFDMA based wireless systems supporting heterogeneous traffic. The proposed algorithm provides proportionally fairness to data users and short term rate guarantees to real-time users. Based on the QoS requirements, buffer occupancy and channel conditions, we propose a scheme for rate requirement determination for delay constrained sessions. Then we formulate and solve the proportional fair rate allocation problem subject to those rate requirements and power/bandwidth constraints. Simulations results show that the proposed a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.1273","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:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+YHKv10VxvKpa+i3gOjVEQQx26mi0ssAFZetBoDj17V3AomJk7//CP1TjnzRZuTxFsjKYE4c0JxBnQZGHbuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:02:28.306476Z"},"content_sha256":"4d8750a1b510231dd35b9683126c244d4cf8a634e1828d0c7cecfc6b93ed1e54","schema_version":"1.0","event_id":"sha256:4d8750a1b510231dd35b9683126c244d4cf8a634e1828d0c7cecfc6b93ed1e54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34HNWPZCDD6XCU2EVN5ZK733OH/bundle.json","state_url":"https://pith.science/pith/34HNWPZCDD6XCU2EVN5ZK733OH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34HNWPZCDD6XCU2EVN5ZK733OH/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-28T02:02:28Z","links":{"resolver":"https://pith.science/pith/34HNWPZCDD6XCU2EVN5ZK733OH","bundle":"https://pith.science/pith/34HNWPZCDD6XCU2EVN5ZK733OH/bundle.json","state":"https://pith.science/pith/34HNWPZCDD6XCU2EVN5ZK733OH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34HNWPZCDD6XCU2EVN5ZK733OH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:34HNWPZCDD6XCU2EVN5ZK733OH","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":"f4c0e46631b720a5573c96a07c0efaaf3bb769cca7aec9a47ee94da83033d896","cross_cats_sorted":[],"license":"","primary_cat":"cs.NI","submitted_at":"2007-11-08T13:39:15Z","title_canon_sha256":"29b965d3811b2aea951f8d8c50ad61378a85efbab1454658e4404b0ff5d2e988"},"schema_version":"1.0","source":{"id":"0711.1273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.1273","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0711.1273v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.1273","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"34HNWPZCDD6X","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"34HNWPZCDD6XCU2E","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"34HNWPZC","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:4d8750a1b510231dd35b9683126c244d4cf8a634e1828d0c7cecfc6b93ed1e54","target":"graph","created_at":"2026-05-18T00:57:58Z","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 work we propose an efficient resource allocation algorithm for OFDMA based wireless systems supporting heterogeneous traffic. The proposed algorithm provides proportionally fairness to data users and short term rate guarantees to real-time users. Based on the QoS requirements, buffer occupancy and channel conditions, we propose a scheme for rate requirement determination for delay constrained sessions. Then we formulate and solve the proportional fair rate allocation problem subject to those rate requirements and power/bandwidth constraints. Simulations results show that the proposed a","authors_text":"Anthony Ephremides, Chenxi Zhu, Jonathan R. Agre, Tolga Girici","cross_cats":[],"headline":"","license":"","primary_cat":"cs.NI","submitted_at":"2007-11-08T13:39:15Z","title":"Practical Resource Allocation Algorithms for QoS in OFDMA-based Wireless Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.1273","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:518a6abd18afa2e4a7e548f58f5bba50152b98d032ee1f53265f2809509e36be","target":"record","created_at":"2026-05-18T00:57:58Z","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":"f4c0e46631b720a5573c96a07c0efaaf3bb769cca7aec9a47ee94da83033d896","cross_cats_sorted":[],"license":"","primary_cat":"cs.NI","submitted_at":"2007-11-08T13:39:15Z","title_canon_sha256":"29b965d3811b2aea951f8d8c50ad61378a85efbab1454658e4404b0ff5d2e988"},"schema_version":"1.0","source":{"id":"0711.1273","kind":"arxiv","version":1}},"canonical_sha256":"df0edb3f2218fd715344ab7b957f7b71efaac6e03e680972d18868f6f5da77dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df0edb3f2218fd715344ab7b957f7b71efaac6e03e680972d18868f6f5da77dd","first_computed_at":"2026-05-18T00:57:58.807808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.807808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QcKDy6junQCSe6LKc9J389oKv8+CuBh75uhsHVHhxB7zqY45hYmNzbTiI9WJcKZ7LpC4RuyTarzK35ZbFz7tCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.808261Z","signed_message":"canonical_sha256_bytes"},"source_id":"0711.1273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:518a6abd18afa2e4a7e548f58f5bba50152b98d032ee1f53265f2809509e36be","sha256:4d8750a1b510231dd35b9683126c244d4cf8a634e1828d0c7cecfc6b93ed1e54"],"state_sha256":"5341c60d1c487e752fe9a565a11d7274803bac67205c2df5489d4f7baabb4646"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Huocf519W9h1N5ZRSyQai1oE5RjYFZ1mhVlDbXeCtboWCHtg+ssGrUkEeGS21tD/Ynne83fbO3hBdEguP1vaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:02:28.308513Z","bundle_sha256":"c57eaa88182859502d1bc349cfc44bf4577a60af54c8536775d5e4e0a069ed63"}}