{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2F26BM7LJR7OAHBDP7YPFPQFZ7","short_pith_number":"pith:2F26BM7L","canonical_record":{"source":{"id":"1107.1038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-06T06:54:55Z","cross_cats_sorted":[],"title_canon_sha256":"de86008babe712509834c84ac066d2f8472c041febb1cf3b1839bf5da510ab8e","abstract_canon_sha256":"1e1ad472118bf4c6ce352f12b316292ceb3bcd295580f68812b25ff865fb9bef"},"schema_version":"1.0"},"canonical_sha256":"d175e0b3eb4c7ee01c237ff0f2be05cfcecf0cdf9245c5a8f47bf83a08ef46c9","source":{"kind":"arxiv","id":"1107.1038","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1038","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1038v1","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1038","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"2F26BM7LJR7O","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2F26BM7LJR7OAHBD","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2F26BM7L","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2F26BM7LJR7OAHBDP7YPFPQFZ7","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-06T06:54:55Z","cross_cats_sorted":[],"title_canon_sha256":"de86008babe712509834c84ac066d2f8472c041febb1cf3b1839bf5da510ab8e","abstract_canon_sha256":"1e1ad472118bf4c6ce352f12b316292ceb3bcd295580f68812b25ff865fb9bef"},"schema_version":"1.0"},"canonical_sha256":"d175e0b3eb4c7ee01c237ff0f2be05cfcecf0cdf9245c5a8f47bf83a08ef46c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:45.758995Z","signature_b64":"/jKnENZ2q27ENtWcDbD6edwtLvOJJdVTyi4s7ixjMY1XoAX7riW84ByrEaFkrIyW043E6xBklGqhYarWf7E4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d175e0b3eb4c7ee01c237ff0f2be05cfcecf0cdf9245c5a8f47bf83a08ef46c9","last_reissued_at":"2026-05-18T04:18:45.758537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:45.758537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1038","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-18T04:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4DsVtvQX83UbHy7jah6W0kjtTLPrqZXv47SenyY7bQjloFvWIDyJNda3ook4Gv6rJr5PiLeIcOBe+vLvEyjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:40:18.589245Z"},"content_sha256":"167c9670858ddc4e0a9056dbf577440a43dcb61c0bc70d42e8e9e5414fea656c","schema_version":"1.0","event_id":"sha256:167c9670858ddc4e0a9056dbf577440a43dcb61c0bc70d42e8e9e5414fea656c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2F26BM7LJR7OAHBDP7YPFPQFZ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic OFDMA Resource Allocation for QoS Guarantee and System Optimization of Best Effort and Non Real-time Traffic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arijit Ukil, Debasish Bera, Jaydip Sen","submitted_at":"2011-07-06T06:54:55Z","abstract_excerpt":"To achieve the requirement of high data rate, low latency, user fairness for next generation wireless networks, proper designing of cross-layer optimized dynamic resource allocation algorithm is prerequisite. In this paper, we propose a dynamic resource allocation scheme in Orthogonal Frequency Division Multiple Access (OFDMA) systems to optimize the non real-time (NRT) traffic, which requires allocation of minimum quantum of data within a predefined time that does not incur packet loss. Most existing and proposed works on resource allocation schemes focused on traffic consisting of delay cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1038","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-18T04:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WDKJPC9n/OG/gkVQ5RsnhlBbiY7Euaes0DoTnNxat06jv7u7KN33kxJxvR22C5ijpEOK/RPJDpMJUFIvhTqvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:40:18.589626Z"},"content_sha256":"891b627a9d0b2b6de6d7a73b71e715c975d2aa8c90912d2c9950bdfbdffbfbd0","schema_version":"1.0","event_id":"sha256:891b627a9d0b2b6de6d7a73b71e715c975d2aa8c90912d2c9950bdfbdffbfbd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/bundle.json","state_url":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/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-09T09:40:18Z","links":{"resolver":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7","bundle":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/bundle.json","state":"https://pith.science/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2F26BM7LJR7OAHBDP7YPFPQFZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2F26BM7LJR7OAHBDP7YPFPQFZ7","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":"1e1ad472118bf4c6ce352f12b316292ceb3bcd295580f68812b25ff865fb9bef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-06T06:54:55Z","title_canon_sha256":"de86008babe712509834c84ac066d2f8472c041febb1cf3b1839bf5da510ab8e"},"schema_version":"1.0","source":{"id":"1107.1038","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1038","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1038v1","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1038","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"2F26BM7LJR7O","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2F26BM7LJR7OAHBD","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2F26BM7L","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:891b627a9d0b2b6de6d7a73b71e715c975d2aa8c90912d2c9950bdfbdffbfbd0","target":"graph","created_at":"2026-05-18T04:18:45Z","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":"To achieve the requirement of high data rate, low latency, user fairness for next generation wireless networks, proper designing of cross-layer optimized dynamic resource allocation algorithm is prerequisite. In this paper, we propose a dynamic resource allocation scheme in Orthogonal Frequency Division Multiple Access (OFDMA) systems to optimize the non real-time (NRT) traffic, which requires allocation of minimum quantum of data within a predefined time that does not incur packet loss. Most existing and proposed works on resource allocation schemes focused on traffic consisting of delay cons","authors_text":"Arijit Ukil, Debasish Bera, Jaydip Sen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-06T06:54:55Z","title":"Dynamic OFDMA Resource Allocation for QoS Guarantee and System Optimization of Best Effort and Non Real-time Traffic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1038","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:167c9670858ddc4e0a9056dbf577440a43dcb61c0bc70d42e8e9e5414fea656c","target":"record","created_at":"2026-05-18T04:18:45Z","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":"1e1ad472118bf4c6ce352f12b316292ceb3bcd295580f68812b25ff865fb9bef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-06T06:54:55Z","title_canon_sha256":"de86008babe712509834c84ac066d2f8472c041febb1cf3b1839bf5da510ab8e"},"schema_version":"1.0","source":{"id":"1107.1038","kind":"arxiv","version":1}},"canonical_sha256":"d175e0b3eb4c7ee01c237ff0f2be05cfcecf0cdf9245c5a8f47bf83a08ef46c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d175e0b3eb4c7ee01c237ff0f2be05cfcecf0cdf9245c5a8f47bf83a08ef46c9","first_computed_at":"2026-05-18T04:18:45.758537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:45.758537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/jKnENZ2q27ENtWcDbD6edwtLvOJJdVTyi4s7ixjMY1XoAX7riW84ByrEaFkrIyW043E6xBklGqhYarWf7E4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:45.758995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1038","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:167c9670858ddc4e0a9056dbf577440a43dcb61c0bc70d42e8e9e5414fea656c","sha256:891b627a9d0b2b6de6d7a73b71e715c975d2aa8c90912d2c9950bdfbdffbfbd0"],"state_sha256":"52d6dffc3a3a0dc2edaf7b6c6fbe4a797ccf2ea00b15f971067e5322964c2d55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HxoZxaCS9qJRU5FCMZDApmlDg5twiUsC9eq7O7k68MSwFo6w7/B8mjd05QxkuCsY8qumK+PFBGdeaK09EEnYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:40:18.591467Z","bundle_sha256":"544421316fc1cf3c8176868fe9153006b425499303c49f357d1e4cd928465267"}}