{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OT3YFYEVAWWGFJ7ZDMFMMRGSPG","short_pith_number":"pith:OT3YFYEV","schema_version":"1.0","canonical_sha256":"74f782e09505ac62a7f91b0ac644d279a2cb51155cf1b0742ad2db8284a15727","source":{"kind":"arxiv","id":"2009.11073","version":1},"attestation_state":"computed","paper":{"title":"Optimal Resource Allocation for Multi-user OFDMA-URLLC MEC Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Robert Schober, Vahid Jamali, Walid R. Ghanem","submitted_at":"2020-09-22T10:20:29Z","abstract_excerpt":"In this paper, we study resource allocation algorithm design for multi-user orthogonal frequency division multiple access (OFDMA) ultra-reliable low latency communication (URLLC) in mobile edge computing (MEC) systems. To meet the stringent end-to-end delay and reliability requirements of URLLC MEC systems, we propose joint uplink-downlink resource allocation and finite blocklength transmission. Furthermore, we employ a partial time overlap between the uplink and downlink frames to minimize the end-to-end delay, which introduces a new time causality constraint. The proposed resource allocation"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2009.11073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-22T10:20:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6d747a7f2ae17ea6be15ce79e385dbfdbbeb33aa3b1b9040aaa279b2772798d","abstract_canon_sha256":"b16e56998d0c42aeb3ff066c92619960a228dbc4e28291478fd9e5c4bc57507d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:14:30.715915Z","signature_b64":"DP9oZF2go/sS6FdEMm5bZAtnCSUxGirQH1+JS2/3FB+fwuluCtkc41dDfycAixO9vTZoufzmJdmtSgvyRDjWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74f782e09505ac62a7f91b0ac644d279a2cb51155cf1b0742ad2db8284a15727","last_reissued_at":"2026-07-05T05:14:30.715272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:14:30.715272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Resource Allocation for Multi-user OFDMA-URLLC MEC Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Robert Schober, Vahid Jamali, Walid R. Ghanem","submitted_at":"2020-09-22T10:20:29Z","abstract_excerpt":"In this paper, we study resource allocation algorithm design for multi-user orthogonal frequency division multiple access (OFDMA) ultra-reliable low latency communication (URLLC) in mobile edge computing (MEC) systems. To meet the stringent end-to-end delay and reliability requirements of URLLC MEC systems, we propose joint uplink-downlink resource allocation and finite blocklength transmission. Furthermore, we employ a partial time overlap between the uplink and downlink frames to minimize the end-to-end delay, which introduces a new time causality constraint. The proposed resource allocation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11073","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/2009.11073/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2009.11073","created_at":"2026-07-05T05:14:30.715360+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.11073v1","created_at":"2026-07-05T05:14:30.715360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11073","created_at":"2026-07-05T05:14:30.715360+00:00"},{"alias_kind":"pith_short_12","alias_value":"OT3YFYEVAWWG","created_at":"2026-07-05T05:14:30.715360+00:00"},{"alias_kind":"pith_short_16","alias_value":"OT3YFYEVAWWGFJ7Z","created_at":"2026-07-05T05:14:30.715360+00:00"},{"alias_kind":"pith_short_8","alias_value":"OT3YFYEV","created_at":"2026-07-05T05:14:30.715360+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OT3YFYEVAWWGFJ7ZDMFMMRGSPG","json":"https://pith.science/pith/OT3YFYEVAWWGFJ7ZDMFMMRGSPG.json","graph_json":"https://pith.science/api/pith-number/OT3YFYEVAWWGFJ7ZDMFMMRGSPG/graph.json","events_json":"https://pith.science/api/pith-number/OT3YFYEVAWWGFJ7ZDMFMMRGSPG/events.json","paper":"https://pith.science/paper/OT3YFYEV"},"agent_actions":{"view_html":"https://pith.science/pith/OT3YFYEVAWWGFJ7ZDMFMMRGSPG","download_json":"https://pith.science/pith/OT3YFYEVAWWGFJ7ZDMFMMRGSPG.json","view_paper":"https://pith.science/paper/OT3YFYEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.11073&json=true","fetch_graph":"https://pith.science/api/pith-number/OT3YFYEVAWWGFJ7ZDMFMMRGSPG/graph.json","fetch_events":"https://pith.science/api/pith-number/OT3YFYEVAWWGFJ7ZDMFMMRGSPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OT3YFYEVAWWGFJ7ZDMFMMRGSPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OT3YFYEVAWWGFJ7ZDMFMMRGSPG/action/storage_attestation","attest_author":"https://pith.science/pith/OT3YFYEVAWWGFJ7ZDMFMMRGSPG/action/author_attestation","sign_citation":"https://pith.science/pith/OT3YFYEVAWWGFJ7ZDMFMMRGSPG/action/citation_signature","submit_replication":"https://pith.science/pith/OT3YFYEVAWWGFJ7ZDMFMMRGSPG/action/replication_record"}},"created_at":"2026-07-05T05:14:30.715360+00:00","updated_at":"2026-07-05T05:14:30.715360+00:00"}