跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

采集已暂停
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+0新增 AI 导读

arXiv 最近完成扫描:等待完成 · 全站最近入库:2026-11-02 00:39各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:尚未完成最近发现新增版本:2026-11-02 00:39库内论文最新更新时间:2026-10-30 01:59

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

8,677 已收录论文7,675 AI 相关1,866 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。

找到 2 篇论文 · 按版本更新时间排序等待首次采集
新论文 · v1arXiv:2610.38096

Calculation and rejection diverge in language models tested at known mechanical limits

Shaoliang Yang, Jun Wang

When a language model returns engineering quantities with the status "solved", software that trusts it passes them on, even when the requested design is physically impossible. Such failures could reflect poor calculation, how the answer is requested, or a failure to judge feasibility. We set beam loads and disk speeds at known percentages above or below plastic collapse or burst, measured each model's limit calculation separately and tested 12 models in 4,860 calls, including follow-up experiments on new designs. We find that a model can recognize an impossible design when asked only whether it is feasible, yet accept the same design, reporting "solved", when asked for a full answer. Three models accepted beams 10 to 30% beyond collapse despite precise limit calculations in separate questions, and many accepted replies stated the violation. Asked only about feasibility, Opus 5 and Gemini 3.8 Flash rejected every impossible new design they were given, including those accepted in full answers, without false alarms. Rewording when to decline or changing the answer format raised rejection on the original beams, but not consistently on new designs. Software and benchmarks using a model's status should test feasibility judgment and full-answer rejection separately, and report the exact prompt.

尚无 AI 解读,展示原文摘要

cs.CE · cs.AI · cs.CL
arXiv ↗PDF ↗
新论文 · v1arXiv:2610.34957

Consequence-guided clarification: releasing minimum-compliance topology-optimized designs from incomplete specifications

Shaoliang Yang, Jun Wang

A converged topology optimization can solve the wrong problem when loads, supports, or the domain are underspecified. Assuming defaults, or asking the problem's author about every detail, ignores how much each answer changes the design. We propose consequence-guided clarification (CGC), which bases acceptance on computed mechanical consequences. CGC computes a reference design for each of a finite list of complete specifications, called readings. A design is accepted only if its compliance is at most 5% above the reference at every reading consistent with the answers. Otherwise, CGC asks the question whose worst answer leaves the smallest worst-case excess, and withholds acceptance at its question limit. To save optimizations, the screening variant CGC-S postpones some references until a candidate must be checked. We developed and evaluated both on 36 arXiv-derived tasks, treating each of 134 readings in turn as intended and simulating correct answers. In 26 tasks, the default-reading design failed another reading. Apart from always-asked questions on load direction, sign, and material budget, asking everything took 188 questions; CGC and CGC-S each took 105. The acceptance test supplied most of this saving: applying it to the default design alone took 117. Relative to asking everything, CGC-S requested 4.6 extra reference designs per avoided question, each from two optimization starts, counting optimization time only. References are not certified optima: better ones pushed three accepted cases above tolerance, and finer meshes changed some decisions. Within these limits, the test shows which readings a design covers and which details block acceptance.

尚无 AI 解读,展示原文摘要

cs.CE
arXiv ↗PDF ↗