跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 21:56各信源进度 →

统计口径与数据新鲜度

统计 2026-11-16 03:54 — 2026-11-17 03:54(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 21:56库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
新论文 · v1arXiv:2611.13437

5G CATS: 5G-Based Cryptographic Authorization Against Trafficking of Semiconductor Devices

Sreevikram Rajaraman, Derek Ladd, Nicholas Heinrich-Barna, Srinivas Shakkottai, Jeyavijayan Rajendran

原文摘要

Enforcing export controls on AI accelerators requires verifying where a chip operates after deployment. Round-trip time measurements can bound a chip's distance from a trusted landmark, but any jitter in honest replies forces the verifier to loosen its timeout, giving an attacker slack to relay traffic over fiber from a restricted region. Prior approaches either cross the untrusted host stack or rely on noisy power-line channels that inflate this slack. We present 5G CATS, a location certification system that pairs a co-packaged 5G radio, cryptographic engine, and hardware interlock on the GPU package with 5G Ultra-Reliable Low-Latency Communication (URLLC) base stations. Terminating the radio link inside the package removes the host software, PCIe fabric, and baseboard management controller from the verification path. We map an authenticated challenge-response protocol onto 5G's slot structure, replace permanent key erasure with short-lived execution leases, and specify a cross-check of the chip's reported serving cell against the carrier's own attachment records. In ns-3 and 5G-LENA simulations of an unloaded cell, our URLLC-based radio profile narrows the 99.9th percentile round-trip spread to 2.60 ms, more than ten times narrower than default 5G. A tracer rejects every round of a fiber relay from 300 km, against 2,000 km for default 5G. Against a 3,000 km attacker, a tracer stays safe at up to 1,410 km from the chip, against at most 619 km for PowerCATS's published model, while default 5G is never safe.

cs.CR · cs.NI

版本更新 · v2arXiv:2607.06724

EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees

Bhavya Sai Nukapotula, Samin Moosavi, Haoze Wang, Luke Duncan, Diya Shakkottai, Varun Murali, Srinivas Shakkottai

原文摘要

LLM-based robot planners are fluent but cannot guarantee that their plans are executable or safe. Classical PDDL planners can guarantee symbolic validity, but only once the problem is fully specified, and they make poor use of an LLM's ability to read context and repair plans. We present EvoPlan, a neuro-symbolic framework whose guarantees are symbolic validity and satisfaction of a constraint learned from data. The planner works with locally-hosted open-weight models, so it does not require a cloud service. EvoPlan has three parts. First, an offline procedure that mines a single global Signal Temporal Logic (STL) mobility constraint from demonstrations. Perturbed demonstrations supply the missing negatives without encoding any rule, and evolutionary search fits the constraint, which captures driving rules or social-navigation preferences within a modelled taxonomy of norms. We use the mined constraint to shield driving and navigation policies on Bench2Drive and HA-VLN-CE. Second, an evolutionary PDDL planner: an LLM proposes and repairs plans, programmatic validators decide which ones survive, and the validated portion of the plan grows over iterations. On open-world ALFWorld and NL-PDDL Blocksworld, it approaches classical planning when the goal vocabulary agrees with the action model, and it stays robust when the two disagree and classical planning fails. Third, a constrained execution loop: Nav2 uses the costmap to ground the plan into waypoints, which are checked against the mined constraint. Violations and execution failures update the PDDL problem for re-planning. We demonstrate the full pipeline in Gazebo and on a Clearpath Jackal robot. More details and videos are on the project page: https://nbhavyasai.github.io/evoplan/

cs.RO