{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RIAYJSZEDE2IZGMC3Y3BE3P33D","short_pith_number":"pith:RIAYJSZE","schema_version":"1.0","canonical_sha256":"8a0184cb2419348c9982de36126dfbd8c5aa23409dc2f8e853edbb9ddce315e6","source":{"kind":"arxiv","id":"2406.05418","version":1},"attestation_state":"computed","paper":{"title":"Multi-attribute Auction-based Resource Allocation for Twins Migration in Vehicular Metaverses: A GPT-based DRL Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.AI","authors_text":"Chau Yuen, Dusit Niyato, Jiawen Kang, Junlong Chen, Minrui Xu, Yongju Tong, Zehui Xiong, Zhu Han","submitted_at":"2024-06-08T09:41:38Z","abstract_excerpt":"Vehicular Metaverses are developed to enhance the modern automotive industry with an immersive and safe experience among connected vehicles and roadside infrastructures, e.g., RoadSide Units (RSUs). For seamless synchronization with virtual spaces, Vehicle Twins (VTs) are constructed as digital representations of physical entities. However, resource-intensive VTs updating and high mobility of vehicles require intensive computation, communication, and storage resources, especially for their migration among RSUs with limited coverages. To address these issues, we propose an attribute-aware aucti"},"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":"2406.05418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-06-08T09:41:38Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"09d3682e2bba7a0ea52f61c9189118acd0908c3f93e57e5bd841b8ba0b703548","abstract_canon_sha256":"9ad780a74a6373d3076b4fffaff56ecd7c0037a1d2bf582ef0c53dc48c1c9298"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:05.269492Z","signature_b64":"Kbb053RPFMQOi4z588VbVyhWj5M+7GgEITs1eBiOuBwJYP0FUmQv64wN4PBXNC4giIdYsh4tLfasAQQjKixhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a0184cb2419348c9982de36126dfbd8c5aa23409dc2f8e853edbb9ddce315e6","last_reissued_at":"2026-07-05T08:29:05.269010Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:05.269010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-attribute Auction-based Resource Allocation for Twins Migration in Vehicular Metaverses: A GPT-based DRL Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.AI","authors_text":"Chau Yuen, Dusit Niyato, Jiawen Kang, Junlong Chen, Minrui Xu, Yongju Tong, Zehui Xiong, Zhu Han","submitted_at":"2024-06-08T09:41:38Z","abstract_excerpt":"Vehicular Metaverses are developed to enhance the modern automotive industry with an immersive and safe experience among connected vehicles and roadside infrastructures, e.g., RoadSide Units (RSUs). For seamless synchronization with virtual spaces, Vehicle Twins (VTs) are constructed as digital representations of physical entities. However, resource-intensive VTs updating and high mobility of vehicles require intensive computation, communication, and storage resources, especially for their migration among RSUs with limited coverages. To address these issues, we propose an attribute-aware aucti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05418","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/2406.05418/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.05418","created_at":"2026-07-05T08:29:05.269075+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.05418v1","created_at":"2026-07-05T08:29:05.269075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05418","created_at":"2026-07-05T08:29:05.269075+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIAYJSZEDE2I","created_at":"2026-07-05T08:29:05.269075+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIAYJSZEDE2IZGMC","created_at":"2026-07-05T08:29:05.269075+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIAYJSZE","created_at":"2026-07-05T08:29:05.269075+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19823","citing_title":"A Survey on Large Language Models for Communication, Network, and Service Management: Application Insights, Challenges, and Future Directions","ref_index":187,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RIAYJSZEDE2IZGMC3Y3BE3P33D","json":"https://pith.science/pith/RIAYJSZEDE2IZGMC3Y3BE3P33D.json","graph_json":"https://pith.science/api/pith-number/RIAYJSZEDE2IZGMC3Y3BE3P33D/graph.json","events_json":"https://pith.science/api/pith-number/RIAYJSZEDE2IZGMC3Y3BE3P33D/events.json","paper":"https://pith.science/paper/RIAYJSZE"},"agent_actions":{"view_html":"https://pith.science/pith/RIAYJSZEDE2IZGMC3Y3BE3P33D","download_json":"https://pith.science/pith/RIAYJSZEDE2IZGMC3Y3BE3P33D.json","view_paper":"https://pith.science/paper/RIAYJSZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.05418&json=true","fetch_graph":"https://pith.science/api/pith-number/RIAYJSZEDE2IZGMC3Y3BE3P33D/graph.json","fetch_events":"https://pith.science/api/pith-number/RIAYJSZEDE2IZGMC3Y3BE3P33D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIAYJSZEDE2IZGMC3Y3BE3P33D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIAYJSZEDE2IZGMC3Y3BE3P33D/action/storage_attestation","attest_author":"https://pith.science/pith/RIAYJSZEDE2IZGMC3Y3BE3P33D/action/author_attestation","sign_citation":"https://pith.science/pith/RIAYJSZEDE2IZGMC3Y3BE3P33D/action/citation_signature","submit_replication":"https://pith.science/pith/RIAYJSZEDE2IZGMC3Y3BE3P33D/action/replication_record"}},"created_at":"2026-07-05T08:29:05.269075+00:00","updated_at":"2026-07-05T08:29:05.269075+00:00"}