{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2U3BPADZXHV76KFHVTY6H7UBBM","short_pith_number":"pith:2U3BPADZ","schema_version":"1.0","canonical_sha256":"d536178079b9ebff28a7acf1e3fe810b2e4e16b010792d7f659d19b905514398","source":{"kind":"arxiv","id":"1809.07453","version":2},"attestation_state":"computed","paper":{"title":"Uplink Resource Allocation for Multiple Access Computational Offloading (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahsa Salmani, Timothy N. Davidson","submitted_at":"2018-09-20T02:33:41Z","abstract_excerpt":"The mobile edge computing framework offers the opportunity to reduce the energy that devices must expend to complete computational tasks. The extent of that energy reduction depends on the nature of the tasks, and on the choice of the multiple access scheme. In this paper, we first address the uplink communication resource allocation for offloading systems that exploit the full capabilities of the multiple access channel (FullMA). For indivisible tasks we provide a closed-form optimal solution of the energy minimization problem when a given set of users with different latency constraints are o"},"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":"1809.07453","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-20T02:33:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5a073dbb54fd1b0073313a5b0a321133ed56d852dd2676cfdd9b58885bd08c2e","abstract_canon_sha256":"d5431670556132ed86965768eb1de8979ac70a26c7450974c9f10fa5db565a2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:30.245500Z","signature_b64":"ykjqcdI2lwWjzHCAMx7LH2wbTVQRgLYfCUvXSgojjunUILtMBGbTFuYfD4wPcdqnGJPi28iE+zIVltcPfSsLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d536178079b9ebff28a7acf1e3fe810b2e4e16b010792d7f659d19b905514398","last_reissued_at":"2026-05-17T23:47:30.245037Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:30.245037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uplink Resource Allocation for Multiple Access Computational Offloading (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahsa Salmani, Timothy N. Davidson","submitted_at":"2018-09-20T02:33:41Z","abstract_excerpt":"The mobile edge computing framework offers the opportunity to reduce the energy that devices must expend to complete computational tasks. The extent of that energy reduction depends on the nature of the tasks, and on the choice of the multiple access scheme. In this paper, we first address the uplink communication resource allocation for offloading systems that exploit the full capabilities of the multiple access channel (FullMA). For indivisible tasks we provide a closed-form optimal solution of the energy minimization problem when a given set of users with different latency constraints are o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07453","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.07453","created_at":"2026-05-17T23:47:30.245110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07453v2","created_at":"2026-05-17T23:47:30.245110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07453","created_at":"2026-05-17T23:47:30.245110+00:00"},{"alias_kind":"pith_short_12","alias_value":"2U3BPADZXHV7","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2U3BPADZXHV76KFH","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2U3BPADZ","created_at":"2026-05-18T12:32:02.567920+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/2U3BPADZXHV76KFHVTY6H7UBBM","json":"https://pith.science/pith/2U3BPADZXHV76KFHVTY6H7UBBM.json","graph_json":"https://pith.science/api/pith-number/2U3BPADZXHV76KFHVTY6H7UBBM/graph.json","events_json":"https://pith.science/api/pith-number/2U3BPADZXHV76KFHVTY6H7UBBM/events.json","paper":"https://pith.science/paper/2U3BPADZ"},"agent_actions":{"view_html":"https://pith.science/pith/2U3BPADZXHV76KFHVTY6H7UBBM","download_json":"https://pith.science/pith/2U3BPADZXHV76KFHVTY6H7UBBM.json","view_paper":"https://pith.science/paper/2U3BPADZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07453&json=true","fetch_graph":"https://pith.science/api/pith-number/2U3BPADZXHV76KFHVTY6H7UBBM/graph.json","fetch_events":"https://pith.science/api/pith-number/2U3BPADZXHV76KFHVTY6H7UBBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2U3BPADZXHV76KFHVTY6H7UBBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2U3BPADZXHV76KFHVTY6H7UBBM/action/storage_attestation","attest_author":"https://pith.science/pith/2U3BPADZXHV76KFHVTY6H7UBBM/action/author_attestation","sign_citation":"https://pith.science/pith/2U3BPADZXHV76KFHVTY6H7UBBM/action/citation_signature","submit_replication":"https://pith.science/pith/2U3BPADZXHV76KFHVTY6H7UBBM/action/replication_record"}},"created_at":"2026-05-17T23:47:30.245110+00:00","updated_at":"2026-05-17T23:47:30.245110+00:00"}