{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WIBYU4QRTON6NBNV55HZHLQKGR","short_pith_number":"pith:WIBYU4QR","canonical_record":{"source":{"id":"2507.19050","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2025-07-25T08:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"bfe4f9918949c33e27a8e5059a700d44db246e398ba242d3c9b55fc18802af1e","abstract_canon_sha256":"e25c2a2c3344fcdefb26e5696ddadc034f5555a1ced602d997c28eb1c9f31e80"},"schema_version":"1.0"},"canonical_sha256":"b2038a72119b9be685b5ef4f93ae0a346fd899d75185036070e074c650687eb1","source":{"kind":"arxiv","id":"2507.19050","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19050","created_at":"2026-07-05T11:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19050v1","created_at":"2026-07-05T11:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19050","created_at":"2026-07-05T11:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"WIBYU4QRTON6","created_at":"2026-07-05T11:43:18Z"},{"alias_kind":"pith_short_16","alias_value":"WIBYU4QRTON6NBNV","created_at":"2026-07-05T11:43:18Z"},{"alias_kind":"pith_short_8","alias_value":"WIBYU4QR","created_at":"2026-07-05T11:43:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WIBYU4QRTON6NBNV55HZHLQKGR","target":"record","payload":{"canonical_record":{"source":{"id":"2507.19050","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2025-07-25T08:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"bfe4f9918949c33e27a8e5059a700d44db246e398ba242d3c9b55fc18802af1e","abstract_canon_sha256":"e25c2a2c3344fcdefb26e5696ddadc034f5555a1ced602d997c28eb1c9f31e80"},"schema_version":"1.0"},"canonical_sha256":"b2038a72119b9be685b5ef4f93ae0a346fd899d75185036070e074c650687eb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:18.744030Z","signature_b64":"7bwG/MTrlydDMkGEsWnD3Hfv1VTKK1ijW3SdpGZ+MMt/dkAjzaqWCLFA1/XfiGDAJJxY1R44haC1z8oRhF+iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2038a72119b9be685b5ef4f93ae0a346fd899d75185036070e074c650687eb1","last_reissued_at":"2026-07-05T11:43:18.743366Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:18.743366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.19050","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-07-05T11:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmmVkxKnoczv7uNGCqTXw05UFLC27qGh1ua7ib2crkizQbCX/Z98LDGBVrT7Cs9e1aR1Q5OfPY/ZaYDznjz5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:44:52.064033Z"},"content_sha256":"980f14fa3d3a8b8206b846eeb077b8c7a5f05323f728fe37447e41ac9dfed2b4","schema_version":"1.0","event_id":"sha256:980f14fa3d3a8b8206b846eeb077b8c7a5f05323f728fe37447e41ac9dfed2b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WIBYU4QRTON6NBNV55HZHLQKGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Language Model-Based Task Offloading and Resource Allocation for Digital Twin Edge Computing Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dong Qin, Kezhi Wang, Khaled B. Letaief, Nan Cheng, Pingyi Fan, Qiong Wu, Yu Xie","submitted_at":"2025-07-25T08:11:09Z","abstract_excerpt":"In this paper, we propose a general digital twin edge computing network comprising multiple vehicles and a server. Each vehicle generates multiple computing tasks within a time slot, leading to queuing challenges when offloading tasks to the server. The study investigates task offloading strategies, queue stability, and resource allocation. Lyapunov optimization is employed to transform long-term constraints into tractable short-term decisions. To solve the resulting problem, an in-context learning approach based on large language model (LLM) is adopted, replacing the conventional multi-agent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19050","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.19050/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ceUq+2TM5eam+SmuDEVGrHcVUx0mff5h3/NySrLFfwsZYUCzQFuCUzqQR0dAU/e32WUwZ5fg3YA9ttQi1MWhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:44:52.064552Z"},"content_sha256":"1a2b2271de5dfc45e06e44ff0e207897d27af4fa1b9b555cac71ebecbce69f4e","schema_version":"1.0","event_id":"sha256:1a2b2271de5dfc45e06e44ff0e207897d27af4fa1b9b555cac71ebecbce69f4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIBYU4QRTON6NBNV55HZHLQKGR/bundle.json","state_url":"https://pith.science/pith/WIBYU4QRTON6NBNV55HZHLQKGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIBYU4QRTON6NBNV55HZHLQKGR/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-08-16T22:44:52Z","links":{"resolver":"https://pith.science/pith/WIBYU4QRTON6NBNV55HZHLQKGR","bundle":"https://pith.science/pith/WIBYU4QRTON6NBNV55HZHLQKGR/bundle.json","state":"https://pith.science/pith/WIBYU4QRTON6NBNV55HZHLQKGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIBYU4QRTON6NBNV55HZHLQKGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WIBYU4QRTON6NBNV55HZHLQKGR","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":"e25c2a2c3344fcdefb26e5696ddadc034f5555a1ced602d997c28eb1c9f31e80","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2025-07-25T08:11:09Z","title_canon_sha256":"bfe4f9918949c33e27a8e5059a700d44db246e398ba242d3c9b55fc18802af1e"},"schema_version":"1.0","source":{"id":"2507.19050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19050","created_at":"2026-07-05T11:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19050v1","created_at":"2026-07-05T11:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19050","created_at":"2026-07-05T11:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"WIBYU4QRTON6","created_at":"2026-07-05T11:43:18Z"},{"alias_kind":"pith_short_16","alias_value":"WIBYU4QRTON6NBNV","created_at":"2026-07-05T11:43:18Z"},{"alias_kind":"pith_short_8","alias_value":"WIBYU4QR","created_at":"2026-07-05T11:43:18Z"}],"graph_snapshots":[{"event_id":"sha256:1a2b2271de5dfc45e06e44ff0e207897d27af4fa1b9b555cac71ebecbce69f4e","target":"graph","created_at":"2026-07-05T11:43:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.19050/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a general digital twin edge computing network comprising multiple vehicles and a server. Each vehicle generates multiple computing tasks within a time slot, leading to queuing challenges when offloading tasks to the server. The study investigates task offloading strategies, queue stability, and resource allocation. Lyapunov optimization is employed to transform long-term constraints into tractable short-term decisions. To solve the resulting problem, an in-context learning approach based on large language model (LLM) is adopted, replacing the conventional multi-agent ","authors_text":"Dong Qin, Kezhi Wang, Khaled B. Letaief, Nan Cheng, Pingyi Fan, Qiong Wu, Yu Xie","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2025-07-25T08:11:09Z","title":"Large Language Model-Based Task Offloading and Resource Allocation for Digital Twin Edge Computing Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19050","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:980f14fa3d3a8b8206b846eeb077b8c7a5f05323f728fe37447e41ac9dfed2b4","target":"record","created_at":"2026-07-05T11:43:18Z","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":"e25c2a2c3344fcdefb26e5696ddadc034f5555a1ced602d997c28eb1c9f31e80","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2025-07-25T08:11:09Z","title_canon_sha256":"bfe4f9918949c33e27a8e5059a700d44db246e398ba242d3c9b55fc18802af1e"},"schema_version":"1.0","source":{"id":"2507.19050","kind":"arxiv","version":1}},"canonical_sha256":"b2038a72119b9be685b5ef4f93ae0a346fd899d75185036070e074c650687eb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2038a72119b9be685b5ef4f93ae0a346fd899d75185036070e074c650687eb1","first_computed_at":"2026-07-05T11:43:18.743366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:18.743366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7bwG/MTrlydDMkGEsWnD3Hfv1VTKK1ijW3SdpGZ+MMt/dkAjzaqWCLFA1/XfiGDAJJxY1R44haC1z8oRhF+iCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:18.744030Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.19050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:980f14fa3d3a8b8206b846eeb077b8c7a5f05323f728fe37447e41ac9dfed2b4","sha256:1a2b2271de5dfc45e06e44ff0e207897d27af4fa1b9b555cac71ebecbce69f4e"],"state_sha256":"134358c4cbd7849e196f727c67f4f4accfa15f1942e5975adca75e31e85a4e77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBSFatKTlrg9qVUBpAeIYasS5qG82eZh8ZnT6pvyWpNlLLNmHwbzIABsGn/BUWC4BuL8jiXsiRuzUyBQ8oV8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T22:44:52.070219Z","bundle_sha256":"f742f97a22ec2ef8c1e813a08af11e65327cf7b7f329a61e2df23ae023d619a3"}}