{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EYFYFUF7T4IRQOKL3PDBFAJMDE","short_pith_number":"pith:EYFYFUF7","schema_version":"1.0","canonical_sha256":"260b82d0bf9f1118394bdbc612812c193acd16ffe39cf28dbcd90b0d19b27882","source":{"kind":"arxiv","id":"1503.05882","version":1},"attestation_state":"computed","paper":{"title":"Divisible Load Scheduling in Mobile Grid based on Stackelberg Pricing Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Hang Long, Jiadi Chen, Qiang Zheng, Wenbo Wang","submitted_at":"2015-03-18T02:52:18Z","abstract_excerpt":"Nowadays, it has become feasible to use mobile nodes as contributing entities in computing systems. In this paper, we consider a computational grid in which the mobile devices can share their idle resources to realize parallel processing. The overall computing task can be arbitrarily partitioned into multiple subtasks to be distributed to mobile resource providers (RPs). In this process, the computation load scheduling problem is highlighted. Based on the optimization objective, i.e., minimizing the task makespan, a buyer-seller model in which the task sponsor can inspire the SPs to share thei"},"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":"1503.05882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-18T02:52:18Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f87f6413241881e78f4bdaf0306f182788746e3c9c79f1231b9110dda0eb73fb","abstract_canon_sha256":"f72776100705d7c36a12518244575bacf008bdc1c78dbecff29e31b886c58fae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:50.864885Z","signature_b64":"PfGc8HqW/NRAfoTHr1c5qs15FI6KW5MtbT2bi0MyMex2cHknlTkzptJ6NYyzAq28slv6osMW7Ps0qHAt0zzLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"260b82d0bf9f1118394bdbc612812c193acd16ffe39cf28dbcd90b0d19b27882","last_reissued_at":"2026-05-18T02:20:50.864110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:50.864110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Divisible Load Scheduling in Mobile Grid based on Stackelberg Pricing Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Hang Long, Jiadi Chen, Qiang Zheng, Wenbo Wang","submitted_at":"2015-03-18T02:52:18Z","abstract_excerpt":"Nowadays, it has become feasible to use mobile nodes as contributing entities in computing systems. In this paper, we consider a computational grid in which the mobile devices can share their idle resources to realize parallel processing. The overall computing task can be arbitrarily partitioned into multiple subtasks to be distributed to mobile resource providers (RPs). In this process, the computation load scheduling problem is highlighted. Based on the optimization objective, i.e., minimizing the task makespan, a buyer-seller model in which the task sponsor can inspire the SPs to share thei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05882","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.05882","created_at":"2026-05-18T02:20:50.864223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05882v1","created_at":"2026-05-18T02:20:50.864223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05882","created_at":"2026-05-18T02:20:50.864223+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYFYFUF7T4IR","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYFYFUF7T4IRQOKL","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYFYFUF7","created_at":"2026-05-18T12:29:19.899920+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/EYFYFUF7T4IRQOKL3PDBFAJMDE","json":"https://pith.science/pith/EYFYFUF7T4IRQOKL3PDBFAJMDE.json","graph_json":"https://pith.science/api/pith-number/EYFYFUF7T4IRQOKL3PDBFAJMDE/graph.json","events_json":"https://pith.science/api/pith-number/EYFYFUF7T4IRQOKL3PDBFAJMDE/events.json","paper":"https://pith.science/paper/EYFYFUF7"},"agent_actions":{"view_html":"https://pith.science/pith/EYFYFUF7T4IRQOKL3PDBFAJMDE","download_json":"https://pith.science/pith/EYFYFUF7T4IRQOKL3PDBFAJMDE.json","view_paper":"https://pith.science/paper/EYFYFUF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05882&json=true","fetch_graph":"https://pith.science/api/pith-number/EYFYFUF7T4IRQOKL3PDBFAJMDE/graph.json","fetch_events":"https://pith.science/api/pith-number/EYFYFUF7T4IRQOKL3PDBFAJMDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYFYFUF7T4IRQOKL3PDBFAJMDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYFYFUF7T4IRQOKL3PDBFAJMDE/action/storage_attestation","attest_author":"https://pith.science/pith/EYFYFUF7T4IRQOKL3PDBFAJMDE/action/author_attestation","sign_citation":"https://pith.science/pith/EYFYFUF7T4IRQOKL3PDBFAJMDE/action/citation_signature","submit_replication":"https://pith.science/pith/EYFYFUF7T4IRQOKL3PDBFAJMDE/action/replication_record"}},"created_at":"2026-05-18T02:20:50.864223+00:00","updated_at":"2026-05-18T02:20:50.864223+00:00"}