{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UUCZNBAALVF4YTR73O4FVAK22W","short_pith_number":"pith:UUCZNBAA","schema_version":"1.0","canonical_sha256":"a5059684005d4bcc4e3fdbb85a815ad58085c39b299153706a9e8a304e831182","source":{"kind":"arxiv","id":"1806.10547","version":2},"attestation_state":"computed","paper":{"title":"Online optimal task offloading with one-bit feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fuqian Yang, Shangshu Zhao, Xiliang Luo, Zhaowei Zhu","submitted_at":"2018-06-27T16:04:00Z","abstract_excerpt":"Task offloading is an emerging technology in fog-enabled networks. It allows users to transmit tasks to neighbor fog nodes so as to utilize the computing resources of the networks. In this paper, we investigate a stochastic task offloading model and propose a multi-armed bandit framework to formulate this model. We consider the fact that different helper nodes prefer different kinds of tasks. Further, we assume each helper node just feeds back one-bit information to the task node to indicate the level of happiness. The key challenge of this problem lies in the exploration-exploitation tradeoff"},"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":"1806.10547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-27T16:04:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"34b79bed58d1aedb6424ceeabb20e4926b36df379039ee6b4656c69eec3645db","abstract_canon_sha256":"08bda24f2ba3a3f58df8acdfe1ffe28a995a881e9bdac9d0c7164dd0c34ba244"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:56.454094Z","signature_b64":"zC1A41KXtCPRbazoY53F8vhyXvyPZNl83cyXyTd8YMefZJ56lJphOFKzOK9kw+hPiJgLsYegrN5vW0sIo9kBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5059684005d4bcc4e3fdbb85a815ad58085c39b299153706a9e8a304e831182","last_reissued_at":"2026-05-18T00:11:56.453429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:56.453429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online optimal task offloading with one-bit feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fuqian Yang, Shangshu Zhao, Xiliang Luo, Zhaowei Zhu","submitted_at":"2018-06-27T16:04:00Z","abstract_excerpt":"Task offloading is an emerging technology in fog-enabled networks. It allows users to transmit tasks to neighbor fog nodes so as to utilize the computing resources of the networks. In this paper, we investigate a stochastic task offloading model and propose a multi-armed bandit framework to formulate this model. We consider the fact that different helper nodes prefer different kinds of tasks. Further, we assume each helper node just feeds back one-bit information to the task node to indicate the level of happiness. The key challenge of this problem lies in the exploration-exploitation tradeoff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10547","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":"1806.10547","created_at":"2026-05-18T00:11:56.453531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10547v2","created_at":"2026-05-18T00:11:56.453531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10547","created_at":"2026-05-18T00:11:56.453531+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUCZNBAALVF4","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUCZNBAALVF4YTR7","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUCZNBAA","created_at":"2026-05-18T12:32:56.356000+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/UUCZNBAALVF4YTR73O4FVAK22W","json":"https://pith.science/pith/UUCZNBAALVF4YTR73O4FVAK22W.json","graph_json":"https://pith.science/api/pith-number/UUCZNBAALVF4YTR73O4FVAK22W/graph.json","events_json":"https://pith.science/api/pith-number/UUCZNBAALVF4YTR73O4FVAK22W/events.json","paper":"https://pith.science/paper/UUCZNBAA"},"agent_actions":{"view_html":"https://pith.science/pith/UUCZNBAALVF4YTR73O4FVAK22W","download_json":"https://pith.science/pith/UUCZNBAALVF4YTR73O4FVAK22W.json","view_paper":"https://pith.science/paper/UUCZNBAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10547&json=true","fetch_graph":"https://pith.science/api/pith-number/UUCZNBAALVF4YTR73O4FVAK22W/graph.json","fetch_events":"https://pith.science/api/pith-number/UUCZNBAALVF4YTR73O4FVAK22W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUCZNBAALVF4YTR73O4FVAK22W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUCZNBAALVF4YTR73O4FVAK22W/action/storage_attestation","attest_author":"https://pith.science/pith/UUCZNBAALVF4YTR73O4FVAK22W/action/author_attestation","sign_citation":"https://pith.science/pith/UUCZNBAALVF4YTR73O4FVAK22W/action/citation_signature","submit_replication":"https://pith.science/pith/UUCZNBAALVF4YTR73O4FVAK22W/action/replication_record"}},"created_at":"2026-05-18T00:11:56.453531+00:00","updated_at":"2026-05-18T00:11:56.453531+00:00"}