跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1171新增论文
+938其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 17:46各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 17:46库内论文最新更新时间:2026-11-19 02:59

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

27,410 已收录论文22,788 AI 相关8,343 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
新论文 · v1arXiv:2611.20538

Effective and Efficient Rumor Assertion Over Large-Scale Social Networks (Technical Report)

Qi Wen, Vipin Chaudhary, Xiang Lian, Yutong Ye, Mingsong Chen

原文摘要

Nowadays, social networks, like Facebook, X, Reddit, YouTube, and so on, have become essential online platforms for users to connect with friends daily, post/share news, and express their opinions/comments. Meanwhile, however, the rapid and widespread dissemination of rumors and misinformation across social networks has become a serious concern. Such misleading information can distort public opinion and potentially cause significant social and economic consequences in real-world scenarios, including product promotion, elections and voting, and even cyberbullying. Therefore, accurately and efficiently verifying whether news spread on social networks is rumor or truth has become an increasingly important yet challenging problem. While previous works usually identified rumors by their contents, in this paper, we propose a novel \textit{user behavior model} to capture the users' judgment/discriminative abilities, which is learned via our well-designed evidence-aware probability reconstructor. We develop a general framework for tackling \textit{rumor assertion over large-scale social networks} (RA-SN), which can efficiently and effectively determine whether a given news item is a rumor with high confidence, based on users' behaviors, in a scalable manner. Extensive experiments demonstrate the efficiency and effectiveness of our proposed RA-SN approach on both real-world and synthetic graphs.

cs.SI · cs.CY

新论文 · v1arXiv:2611.10038

Towards a Privacy-Preserving Reliability-Aware Entity Resolution for Attributed Graphs [Vision] (Technical Report)

Abdessamad Imine, Xiang Lian, Kambiz Ghazinour

原文摘要

Entity resolution (ER) on attributed graphs aims to identify nodes across multiple graphs that correspond to the same real-world entity and merge them into an integrated graph. When input graphs vary in quality and contain sensitive information, ER faces a dual challenge: while reliability information is crucial for accurate graph data integration, its presence in the published integrated graph can heighten privacy risks. This paper presents a research vision that unifies reliability assessment and privacy preservation within a single graph ER process. We highlight the inherent tension between these two objectives, propose a three-level coupled framework, and outline the remaining research challenges to enable the publication of integrated graphs that are both accurate and privacy-preserving.

cs.CR · cs.DB

新论文 · v1arXiv:2610.36013

OmniBrain-0: A Unified Agentic Model for Embodied Intelligence

Xiaomi Embodied Intelligence Team, Yuechen Luo, Chong He, Fang Li, Shaoqing Xu, Jingkai Wang, Menglun Su, Jiaxin Liu 等 32 位作者

原文摘要

General-purpose embodied intelligence requires robots to coordinate diverse skills over long horizons, track task progress, and recover from failures. Specialist policies alone do not ensure task-level reliability, while powerful multimodal agents rely on costly reasoning and external experience that compact models struggle to reproduce. We introduce OmniBrain-0, a lightweight unified embodied agent that coordinates manipulation and navigation through a shared high-level decision model, integrating task understanding, planning, progress tracking, and feedback-driven recovery. Our progressive training framework combines embodied pretraining, domain-specialized agent distillation, and multi-teacher on-policy distillation (MOPD). It distills powerful teachers' interaction experience into manipulation and navigation experts, then consolidates their decision capabilities into OmniBrain-0. Unification therefore occurs within the learned decision model rather than only at the tool interface. We further introduce Rubric-Guided Recursive Self-Improvement (RSI), a data flywheel in which a Meta-Agent turns execution evidence into refined rubrics, step-level reminders, and verified trajectories for domain-expert updates before their reconsolidation into OmniBrain-0 through MOPD. We evaluate OmniBrain-0 on LIBERO-Pro, LIBERO-Plus, RoboCasa365, RoboTwin 2.0, and R2R-CE Val-Unseen, as well as multiple real-world manipulation tasks. OmniBrain-0 combines strong cross-domain task performance with substantially lower inference and execution overhead than its closed-source teacher, demonstrating efficient transfer and consolidation of embodied capabilities into a compact unified agent.

cs.CL · cs.CV