{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GKZ7IQYGB2X7KRJWZBPNP7QZZZ","short_pith_number":"pith:GKZ7IQYG","canonical_record":{"source":{"id":"2605.05727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-07T06:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"96edc90ef7fc18a9d27ebd1ee09c619b99cf5c4ad23ace896f7fb1837308faae","abstract_canon_sha256":"88f5910788ce8d017d7273a782c12422b9b1ce67f87a38baade6e91dedb779e1"},"schema_version":"1.0"},"canonical_sha256":"32b3f443060eaff54536c85ed7fe19ce50db5fbaed44d83060f24d4f38338bbe","source":{"kind":"arxiv","id":"2605.05727","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.05727","created_at":"2026-06-11T01:09:37Z"},{"alias_kind":"arxiv_version","alias_value":"2605.05727v2","created_at":"2026-06-11T01:09:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.05727","created_at":"2026-06-11T01:09:37Z"},{"alias_kind":"pith_short_12","alias_value":"GKZ7IQYGB2X7","created_at":"2026-06-11T01:09:37Z"},{"alias_kind":"pith_short_16","alias_value":"GKZ7IQYGB2X7KRJW","created_at":"2026-06-11T01:09:37Z"},{"alias_kind":"pith_short_8","alias_value":"GKZ7IQYG","created_at":"2026-06-11T01:09:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GKZ7IQYGB2X7KRJWZBPNP7QZZZ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.05727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-07T06:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"96edc90ef7fc18a9d27ebd1ee09c619b99cf5c4ad23ace896f7fb1837308faae","abstract_canon_sha256":"88f5910788ce8d017d7273a782c12422b9b1ce67f87a38baade6e91dedb779e1"},"schema_version":"1.0"},"canonical_sha256":"32b3f443060eaff54536c85ed7fe19ce50db5fbaed44d83060f24d4f38338bbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:37.152946Z","signature_b64":"CNXVOGZVQhmGNZMU5VZBji8Ey9r6tpdn6JaoT/mcuNkzAshJMPixeVviuKz+IriW21tU91sV0KwrBkGK8v4xCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32b3f443060eaff54536c85ed7fe19ce50db5fbaed44d83060f24d4f38338bbe","last_reissued_at":"2026-06-11T01:09:37.152055Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:37.152055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.05727","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-06-11T01:09:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8iidvIOCL7ycVGQ2h/VmNhUrAX5h9CuTYzXO6njmrPh1Qxhz+L4u6rvjxUWAdcubxddWfRXM9T83dfhekoGzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:58:13.334443Z"},"content_sha256":"b5ac7daac6b3f10c89730651607048e82954721c377fa6b9cde84e1f2e6e6735","schema_version":"1.0","event_id":"sha256:b5ac7daac6b3f10c89730651607048e82954721c377fa6b9cde84e1f2e6e6735"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GKZ7IQYGB2X7KRJWZBPNP7QZZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LLM-Enhanced Deep Reinforcement Learning for Task Offloading in Collaborative Edge Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"LeDRL integrates a lightweight LLM to supply strategy priors that improve DRL-based task offloading decisions in collaborative edge networks.","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hao Guo, kaixiang Xu, Lei Yang, Ziwu Ge","submitted_at":"2026-05-07T06:19:07Z","abstract_excerpt":"Collaborative edge computing uses edge nodes in different locations to execute tasks, necessitating dynamic task offloading decisions to maintain low latency and high reliability, especially under unpredictable node failures. Although deep reinforcement learning (DRL) and large language models (LLMs) have shown promise for task offloading, DRL often suffers from poor sample efficiency and local optima, while LLMs are difficult to use directly due to inference overhead and output uncertainty. To address these limitations, we propose \\textbf{LeDRL}, a hybrid decision framework that couples a \\em"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Extensive experiments show that LeDRL outperforms baselines in task success rate, convergence speed, and real-time responsiveness across diverse network scales, achieving over 17% improvement in success rate. Furthermore, we deploy LeDRL on Jetson-based edge devices using our prototype system CoEdgeSys, demonstrating its robustness and feasibility under resource constraints.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the lightweight LLM can reliably generate useful, context-aware strategy priors from structured prompts in real time, and that the reflective evaluator produces temporally generalizable improvements without introducing prohibitive latency or instability.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"LeDRL integrates a lightweight LLM using structured prompts and a reflective evaluator with self-attention DRL to achieve over 17% higher task success rates and better convergence in edge computing task offloading.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"LeDRL integrates a lightweight LLM to supply strategy priors that improve DRL-based task offloading decisions in collaborative edge networks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"25a40a90d622b5a8280be2905f6ac0364e5937f768513cf33b96fecb53c9401b"},"source":{"id":"2605.05727","kind":"arxiv","version":2},"verdict":{"id":"02b1923a-424f-446a-84d5-d0092bb5c130","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T05:30:41.352065Z","strongest_claim":"Extensive experiments show that LeDRL outperforms baselines in task success rate, convergence speed, and real-time responsiveness across diverse network scales, achieving over 17% improvement in success rate. Furthermore, we deploy LeDRL on Jetson-based edge devices using our prototype system CoEdgeSys, demonstrating its robustness and feasibility under resource constraints.","one_line_summary":"LeDRL integrates a lightweight LLM using structured prompts and a reflective evaluator with self-attention DRL to achieve over 17% higher task success rates and better convergence in edge computing task offloading.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the lightweight LLM can reliably generate useful, context-aware strategy priors from structured prompts in real time, and that the reflective evaluator produces temporally generalizable improvements without introducing prohibitive latency or instability.","pith_extraction_headline":"LeDRL integrates a lightweight LLM to supply strategy priors that improve DRL-based task offloading decisions in collaborative edge networks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.05727/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T13:42:04.701452Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T09:36:10.762788Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.577580Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T13:18:26.686223Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"433da76d6563138faaab978a31ab960a4cc188c00a09da03b49a95804456f8c5"},"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":"02b1923a-424f-446a-84d5-d0092bb5c130"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:09:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nutQZxpZtulJn+AcrLOAgxBGlNe0oJ8XmvdNlb/rNzJxyMUvXC4BNQI4sil9Z+cCPsFTG+JF7uISW5KTbZgLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:58:13.334931Z"},"content_sha256":"b0c96e98e50e38a54c973a53fb1202eeb1c54a566dae85b51383a2bb40a25c86","schema_version":"1.0","event_id":"sha256:b0c96e98e50e38a54c973a53fb1202eeb1c54a566dae85b51383a2bb40a25c86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKZ7IQYGB2X7KRJWZBPNP7QZZZ/bundle.json","state_url":"https://pith.science/pith/GKZ7IQYGB2X7KRJWZBPNP7QZZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKZ7IQYGB2X7KRJWZBPNP7QZZZ/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-27T12:58:13Z","links":{"resolver":"https://pith.science/pith/GKZ7IQYGB2X7KRJWZBPNP7QZZZ","bundle":"https://pith.science/pith/GKZ7IQYGB2X7KRJWZBPNP7QZZZ/bundle.json","state":"https://pith.science/pith/GKZ7IQYGB2X7KRJWZBPNP7QZZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKZ7IQYGB2X7KRJWZBPNP7QZZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GKZ7IQYGB2X7KRJWZBPNP7QZZZ","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":"88f5910788ce8d017d7273a782c12422b9b1ce67f87a38baade6e91dedb779e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-07T06:19:07Z","title_canon_sha256":"96edc90ef7fc18a9d27ebd1ee09c619b99cf5c4ad23ace896f7fb1837308faae"},"schema_version":"1.0","source":{"id":"2605.05727","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.05727","created_at":"2026-06-11T01:09:37Z"},{"alias_kind":"arxiv_version","alias_value":"2605.05727v2","created_at":"2026-06-11T01:09:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.05727","created_at":"2026-06-11T01:09:37Z"},{"alias_kind":"pith_short_12","alias_value":"GKZ7IQYGB2X7","created_at":"2026-06-11T01:09:37Z"},{"alias_kind":"pith_short_16","alias_value":"GKZ7IQYGB2X7KRJW","created_at":"2026-06-11T01:09:37Z"},{"alias_kind":"pith_short_8","alias_value":"GKZ7IQYG","created_at":"2026-06-11T01:09:37Z"}],"graph_snapshots":[{"event_id":"sha256:b0c96e98e50e38a54c973a53fb1202eeb1c54a566dae85b51383a2bb40a25c86","target":"graph","created_at":"2026-06-11T01:09:37Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Extensive experiments show that LeDRL outperforms baselines in task success rate, convergence speed, and real-time responsiveness across diverse network scales, achieving over 17% improvement in success rate. Furthermore, we deploy LeDRL on Jetson-based edge devices using our prototype system CoEdgeSys, demonstrating its robustness and feasibility under resource constraints."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the lightweight LLM can reliably generate useful, context-aware strategy priors from structured prompts in real time, and that the reflective evaluator produces temporally generalizable improvements without introducing prohibitive latency or instability."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"LeDRL integrates a lightweight LLM using structured prompts and a reflective evaluator with self-attention DRL to achieve over 17% higher task success rates and better convergence in edge computing task offloading."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"LeDRL integrates a lightweight LLM to supply strategy priors that improve DRL-based task offloading decisions in collaborative edge networks."}],"snapshot_sha256":"25a40a90d622b5a8280be2905f6ac0364e5937f768513cf33b96fecb53c9401b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T13:42:04.701452Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T09:36:10.762788Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.577580Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T13:18:26.686223Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.05727/integrity.json","findings":[],"snapshot_sha256":"433da76d6563138faaab978a31ab960a4cc188c00a09da03b49a95804456f8c5","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Collaborative edge computing uses edge nodes in different locations to execute tasks, necessitating dynamic task offloading decisions to maintain low latency and high reliability, especially under unpredictable node failures. Although deep reinforcement learning (DRL) and large language models (LLMs) have shown promise for task offloading, DRL often suffers from poor sample efficiency and local optima, while LLMs are difficult to use directly due to inference overhead and output uncertainty. To address these limitations, we propose \\textbf{LeDRL}, a hybrid decision framework that couples a \\em","authors_text":"Hao Guo, kaixiang Xu, Lei Yang, Ziwu Ge","cross_cats":[],"headline":"LeDRL integrates a lightweight LLM to supply strategy priors that improve DRL-based task offloading decisions in collaborative edge networks.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-07T06:19:07Z","title":"LLM-Enhanced Deep Reinforcement Learning for Task Offloading in Collaborative Edge Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.05727","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T05:30:41.352065Z","id":"02b1923a-424f-446a-84d5-d0092bb5c130","model_set":{"reader":"grok-4.3"},"one_line_summary":"LeDRL integrates a lightweight LLM using structured prompts and a reflective evaluator with self-attention DRL to achieve over 17% higher task success rates and better convergence in edge computing task offloading.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"LeDRL integrates a lightweight LLM to supply strategy priors that improve DRL-based task offloading decisions in collaborative edge networks.","strongest_claim":"Extensive experiments show that LeDRL outperforms baselines in task success rate, convergence speed, and real-time responsiveness across diverse network scales, achieving over 17% improvement in success rate. Furthermore, we deploy LeDRL on Jetson-based edge devices using our prototype system CoEdgeSys, demonstrating its robustness and feasibility under resource constraints.","weakest_assumption":"That the lightweight LLM can reliably generate useful, context-aware strategy priors from structured prompts in real time, and that the reflective evaluator produces temporally generalizable improvements without introducing prohibitive latency or instability."}},"verdict_id":"02b1923a-424f-446a-84d5-d0092bb5c130"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b5ac7daac6b3f10c89730651607048e82954721c377fa6b9cde84e1f2e6e6735","target":"record","created_at":"2026-06-11T01:09:37Z","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":"88f5910788ce8d017d7273a782c12422b9b1ce67f87a38baade6e91dedb779e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-07T06:19:07Z","title_canon_sha256":"96edc90ef7fc18a9d27ebd1ee09c619b99cf5c4ad23ace896f7fb1837308faae"},"schema_version":"1.0","source":{"id":"2605.05727","kind":"arxiv","version":2}},"canonical_sha256":"32b3f443060eaff54536c85ed7fe19ce50db5fbaed44d83060f24d4f38338bbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32b3f443060eaff54536c85ed7fe19ce50db5fbaed44d83060f24d4f38338bbe","first_computed_at":"2026-06-11T01:09:37.152055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:09:37.152055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CNXVOGZVQhmGNZMU5VZBji8Ey9r6tpdn6JaoT/mcuNkzAshJMPixeVviuKz+IriW21tU91sV0KwrBkGK8v4xCA==","signature_status":"signed_v1","signed_at":"2026-06-11T01:09:37.152946Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.05727","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5ac7daac6b3f10c89730651607048e82954721c377fa6b9cde84e1f2e6e6735","sha256:b0c96e98e50e38a54c973a53fb1202eeb1c54a566dae85b51383a2bb40a25c86"],"state_sha256":"21efbb97bdccd3f4f83ec2eaea04a93aaabbe973d6d1a23212233da3b4bffa72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3F3luJTRvvUyd6ufsRHncpV1GIbOw03KdC3Gqi+k+t1ieV4z0i1me7Lwkq1COtVqzH8EV1T0JbTIa0D+jFaABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:58:13.337163Z","bundle_sha256":"6274fbb03a3d48f35fb1ded51e6c91afadce6209edf2a0b76eea9d8ef5096774"}}