{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AY64IMO66SMLUJHADHLHNI4VJB","short_pith_number":"pith:AY64IMO6","canonical_record":{"source":{"id":"1608.08521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-30T15:52:48Z","cross_cats_sorted":["cs.DC","cs.GT"],"title_canon_sha256":"0fffdfe910f6e0ac019b71b530865d78963d502605fc9da0f30b34dd7935f1bd","abstract_canon_sha256":"0e4f554a6d4567fb4fb803ac3818f26df3251b3ad3492d1578888f7dab1c6509"},"schema_version":"1.0"},"canonical_sha256":"063dc431def498ba24e019d676a395484e680fc0d017c9d550ebd22d336e4c7b","source":{"kind":"arxiv","id":"1608.08521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08521","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08521v1","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08521","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"AY64IMO66SML","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AY64IMO66SMLUJHA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AY64IMO6","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AY64IMO66SMLUJHADHLHNI4VJB","target":"record","payload":{"canonical_record":{"source":{"id":"1608.08521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-30T15:52:48Z","cross_cats_sorted":["cs.DC","cs.GT"],"title_canon_sha256":"0fffdfe910f6e0ac019b71b530865d78963d502605fc9da0f30b34dd7935f1bd","abstract_canon_sha256":"0e4f554a6d4567fb4fb803ac3818f26df3251b3ad3492d1578888f7dab1c6509"},"schema_version":"1.0"},"canonical_sha256":"063dc431def498ba24e019d676a395484e680fc0d017c9d550ebd22d336e4c7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:17.921387Z","signature_b64":"jDEjzRVVITIBY/AHHEcv7uV6K1mlK4+wvdwpMjn5ZuXOZ8i4TeYMEBS8d3xcNqTosgg1+hAVpX0gBrdWzftRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"063dc431def498ba24e019d676a395484e680fc0d017c9d550ebd22d336e4c7b","last_reissued_at":"2026-05-18T01:07:17.920782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:17.920782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.08521","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-18T01:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JwrfPfy/Qf6T52WbujRPMjb51seEORATk3+ev/ieaDnBFYw0qV20jALkt+TUI/ItdYsree12a8OMGQZfLKNuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:24:07.045523Z"},"content_sha256":"fdac5054705d834df409c9484b988f45ead9835ec4643a5af9a8d5a868ce78c3","schema_version":"1.0","event_id":"sha256:fdac5054705d834df409c9484b988f45ead9835ec4643a5af9a8d5a868ce78c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AY64IMO66SMLUJHADHLHNI4VJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Profitable Task Allocation in Mobile Cloud Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.GT"],"primary_cat":"cs.NI","authors_text":"Mehrdad Khaledi, Mojgan Khaledi, Sneha Kumar Kasera","submitted_at":"2016-08-30T15:52:48Z","abstract_excerpt":"We propose a game theoretic framework for task allocation in mobile cloud computing that corresponds to offloading of compute tasks to a group of nearby mobile devices. Specifically, in our framework, a distributor node holds a multidimensional auction for allocating the tasks of a job among nearby mobile nodes based on their computational capabilities and also the cost of computation at these nodes, with the goal of reducing the overall job completion time. Our proposed auction also has the desired incentive compatibility property that ensures that mobile devices truthfully reveal their capab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08521","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-18T01:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tCNP0nkiYXGGWdor3L5KSo6pQnlOs3X0hvTJVQ9z2pCCvuSvtW8fv1ksjbRd/GSw7dbL+R+29NJ9b4MK7THBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:24:07.045899Z"},"content_sha256":"94ac8117c97870756e728813f45d4a54291df8c00c184dcc2c18a6cda04a0c10","schema_version":"1.0","event_id":"sha256:94ac8117c97870756e728813f45d4a54291df8c00c184dcc2c18a6cda04a0c10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AY64IMO66SMLUJHADHLHNI4VJB/bundle.json","state_url":"https://pith.science/pith/AY64IMO66SMLUJHADHLHNI4VJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AY64IMO66SMLUJHADHLHNI4VJB/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-27T00:24:07Z","links":{"resolver":"https://pith.science/pith/AY64IMO66SMLUJHADHLHNI4VJB","bundle":"https://pith.science/pith/AY64IMO66SMLUJHADHLHNI4VJB/bundle.json","state":"https://pith.science/pith/AY64IMO66SMLUJHADHLHNI4VJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AY64IMO66SMLUJHADHLHNI4VJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AY64IMO66SMLUJHADHLHNI4VJB","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":"0e4f554a6d4567fb4fb803ac3818f26df3251b3ad3492d1578888f7dab1c6509","cross_cats_sorted":["cs.DC","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-30T15:52:48Z","title_canon_sha256":"0fffdfe910f6e0ac019b71b530865d78963d502605fc9da0f30b34dd7935f1bd"},"schema_version":"1.0","source":{"id":"1608.08521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08521","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08521v1","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08521","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"AY64IMO66SML","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AY64IMO66SMLUJHA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AY64IMO6","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:94ac8117c97870756e728813f45d4a54291df8c00c184dcc2c18a6cda04a0c10","target":"graph","created_at":"2026-05-18T01:07:17Z","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":"We propose a game theoretic framework for task allocation in mobile cloud computing that corresponds to offloading of compute tasks to a group of nearby mobile devices. Specifically, in our framework, a distributor node holds a multidimensional auction for allocating the tasks of a job among nearby mobile nodes based on their computational capabilities and also the cost of computation at these nodes, with the goal of reducing the overall job completion time. Our proposed auction also has the desired incentive compatibility property that ensures that mobile devices truthfully reveal their capab","authors_text":"Mehrdad Khaledi, Mojgan Khaledi, Sneha Kumar Kasera","cross_cats":["cs.DC","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-30T15:52:48Z","title":"Profitable Task Allocation in Mobile Cloud Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08521","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:fdac5054705d834df409c9484b988f45ead9835ec4643a5af9a8d5a868ce78c3","target":"record","created_at":"2026-05-18T01:07:17Z","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":"0e4f554a6d4567fb4fb803ac3818f26df3251b3ad3492d1578888f7dab1c6509","cross_cats_sorted":["cs.DC","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-30T15:52:48Z","title_canon_sha256":"0fffdfe910f6e0ac019b71b530865d78963d502605fc9da0f30b34dd7935f1bd"},"schema_version":"1.0","source":{"id":"1608.08521","kind":"arxiv","version":1}},"canonical_sha256":"063dc431def498ba24e019d676a395484e680fc0d017c9d550ebd22d336e4c7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"063dc431def498ba24e019d676a395484e680fc0d017c9d550ebd22d336e4c7b","first_computed_at":"2026-05-18T01:07:17.920782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:17.920782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jDEjzRVVITIBY/AHHEcv7uV6K1mlK4+wvdwpMjn5ZuXOZ8i4TeYMEBS8d3xcNqTosgg1+hAVpX0gBrdWzftRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:17.921387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdac5054705d834df409c9484b988f45ead9835ec4643a5af9a8d5a868ce78c3","sha256:94ac8117c97870756e728813f45d4a54291df8c00c184dcc2c18a6cda04a0c10"],"state_sha256":"fcc1185e28d44f8a16b72f2ef7ef920c62d04a192fb11f897d8d805ebda66282"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GC1utgtwJkqB7kquyFQEQ7HO+w+2ogvcbxBNm/pVFfqQiyxESlU9bxvzV27CVSeR7PvK5Ykvh1usohWohReXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:24:07.049121Z","bundle_sha256":"a560e7eb898c2b67f3c6c17ecc0e3f3344ffe94345d318e9d0b8c0e9a23e3d95"}}