{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LMCHVGGLJIRHK3ZNEXFUR7WVVA","short_pith_number":"pith:LMCHVGGL","canonical_record":{"source":{"id":"1811.03748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-09T02:49:53Z","cross_cats_sorted":["cs.LG","cs.NI"],"title_canon_sha256":"e905bf7af282d30757ffdf948f4da2db7123d2af47d646ca137a2eb3003fef5f","abstract_canon_sha256":"dcf55c8d7a7b16777cd34fa28cb6b1488649aa9c69a0585acce8d667bbcdce26"},"schema_version":"1.0"},"canonical_sha256":"5b047a98cb4a22756f2d25cb48fed5a808cf3f250490ce4faa6e24709e8d39a3","source":{"kind":"arxiv","id":"1811.03748","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03748","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03748v2","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03748","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"LMCHVGGLJIRH","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LMCHVGGLJIRHK3ZN","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LMCHVGGL","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LMCHVGGLJIRHK3ZNEXFUR7WVVA","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-09T02:49:53Z","cross_cats_sorted":["cs.LG","cs.NI"],"title_canon_sha256":"e905bf7af282d30757ffdf948f4da2db7123d2af47d646ca137a2eb3003fef5f","abstract_canon_sha256":"dcf55c8d7a7b16777cd34fa28cb6b1488649aa9c69a0585acce8d667bbcdce26"},"schema_version":"1.0"},"canonical_sha256":"5b047a98cb4a22756f2d25cb48fed5a808cf3f250490ce4faa6e24709e8d39a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:03.137397Z","signature_b64":"sjB4Ee34d0fxQJFyoFNAjiO49sYBF9vqxw1WG+m4Lrv8UlOTLr+6anrkTuEvnIzYNXmLijEnsl/1O7++h3ckCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b047a98cb4a22756f2d25cb48fed5a808cf3f250490ce4faa6e24709e8d39a3","last_reissued_at":"2026-05-17T23:55:03.136970Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:03.136970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03748","source_version":2,"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-17T23:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxCfA2sG5lZCZ6CISjhW1Zwpg4JNNi6OlFAUD0/TJFVfdOFNZ17qdsCGdp+skYLw/cfNSUvHlcfFnCqiCYjbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:44:09.002587Z"},"content_sha256":"97e8ae370277149c08a12bb0629ec0a6343648b8839428b7c2925d0b1b150247","schema_version":"1.0","event_id":"sha256:97e8ae370277149c08a12bb0629ec0a6343648b8839428b7c2925d0b1b150247"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LMCHVGGLJIRHK3ZNEXFUR7WVVA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Task Allocation for Mobile Edge Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NI"],"primary_cat":"cs.DC","authors_text":"Sameh Sorour, Umair Mohammad","submitted_at":"2018-11-09T02:49:53Z","abstract_excerpt":"This paper aims to establish a new optimization paradigm for implementing realistic distributed learning algorithms, with performance guarantees, on wireless edge nodes with heterogeneous computing and communication capacities. We will refer to this new paradigm as `Mobile Edge Learning (MEL)'. The problem of dynamic task allocation for MEL is considered in this paper with the aim to maximize the learning accuracy, while guaranteeing that the total times of data distribution/aggregation over heterogeneous channels, and local computing iterations at the heterogeneous nodes, are bounded by a pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03748","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"},"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-17T23:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTJxOzYiqgtuRfGVap14+n7h/3PZ92rgh0O56DYXWwFZpHN8Xd1DP9NJXSPygCD7qIzZ2ZgWzYlrg65x29kfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:44:09.002916Z"},"content_sha256":"742994b2259a5c00295311dbfddac428aae80ca45ad6d04462a6dd453c146c33","schema_version":"1.0","event_id":"sha256:742994b2259a5c00295311dbfddac428aae80ca45ad6d04462a6dd453c146c33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMCHVGGLJIRHK3ZNEXFUR7WVVA/bundle.json","state_url":"https://pith.science/pith/LMCHVGGLJIRHK3ZNEXFUR7WVVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMCHVGGLJIRHK3ZNEXFUR7WVVA/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-25T08:44:09Z","links":{"resolver":"https://pith.science/pith/LMCHVGGLJIRHK3ZNEXFUR7WVVA","bundle":"https://pith.science/pith/LMCHVGGLJIRHK3ZNEXFUR7WVVA/bundle.json","state":"https://pith.science/pith/LMCHVGGLJIRHK3ZNEXFUR7WVVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMCHVGGLJIRHK3ZNEXFUR7WVVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LMCHVGGLJIRHK3ZNEXFUR7WVVA","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":"dcf55c8d7a7b16777cd34fa28cb6b1488649aa9c69a0585acce8d667bbcdce26","cross_cats_sorted":["cs.LG","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-09T02:49:53Z","title_canon_sha256":"e905bf7af282d30757ffdf948f4da2db7123d2af47d646ca137a2eb3003fef5f"},"schema_version":"1.0","source":{"id":"1811.03748","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03748","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03748v2","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03748","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"LMCHVGGLJIRH","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LMCHVGGLJIRHK3ZN","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LMCHVGGL","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:742994b2259a5c00295311dbfddac428aae80ca45ad6d04462a6dd453c146c33","target":"graph","created_at":"2026-05-17T23:55:03Z","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":"This paper aims to establish a new optimization paradigm for implementing realistic distributed learning algorithms, with performance guarantees, on wireless edge nodes with heterogeneous computing and communication capacities. We will refer to this new paradigm as `Mobile Edge Learning (MEL)'. The problem of dynamic task allocation for MEL is considered in this paper with the aim to maximize the learning accuracy, while guaranteeing that the total times of data distribution/aggregation over heterogeneous channels, and local computing iterations at the heterogeneous nodes, are bounded by a pre","authors_text":"Sameh Sorour, Umair Mohammad","cross_cats":["cs.LG","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-09T02:49:53Z","title":"Adaptive Task Allocation for Mobile Edge Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03748","kind":"arxiv","version":2},"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:97e8ae370277149c08a12bb0629ec0a6343648b8839428b7c2925d0b1b150247","target":"record","created_at":"2026-05-17T23:55:03Z","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":"dcf55c8d7a7b16777cd34fa28cb6b1488649aa9c69a0585acce8d667bbcdce26","cross_cats_sorted":["cs.LG","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-09T02:49:53Z","title_canon_sha256":"e905bf7af282d30757ffdf948f4da2db7123d2af47d646ca137a2eb3003fef5f"},"schema_version":"1.0","source":{"id":"1811.03748","kind":"arxiv","version":2}},"canonical_sha256":"5b047a98cb4a22756f2d25cb48fed5a808cf3f250490ce4faa6e24709e8d39a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b047a98cb4a22756f2d25cb48fed5a808cf3f250490ce4faa6e24709e8d39a3","first_computed_at":"2026-05-17T23:55:03.136970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:03.136970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sjB4Ee34d0fxQJFyoFNAjiO49sYBF9vqxw1WG+m4Lrv8UlOTLr+6anrkTuEvnIzYNXmLijEnsl/1O7++h3ckCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:03.137397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03748","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97e8ae370277149c08a12bb0629ec0a6343648b8839428b7c2925d0b1b150247","sha256:742994b2259a5c00295311dbfddac428aae80ca45ad6d04462a6dd453c146c33"],"state_sha256":"bafcd9f9e5f3578a9f7af9c154c04555fc1c9ad0f1fb6cfd5cb201d1140c8d0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMW4vzDVgU7UBbyUK6Qudfch05Byq423ot7T1VZaT24CDHLP8OPpWXRUWvnOo9qA/YfXivTLdiSF1BqVWK5SDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:44:09.004736Z","bundle_sha256":"dc6a46ce2b02eb0fc0aa91a78542126926a6c4534ab817f74c4577cbb7814b93"}}