CrushSCI.com
133.5平均天数
132中位天数
13最短天数
216最长天数
922025发文量

Paper Review Records

全部论文审稿周期

15 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接

188 天

SoK: A taxonomy of LLM threats

作者
Ioannis Stylianou; Panagiotis Bountakas; Apostolis Zarras; Aristeidis Farao; Vaios Bolgouras; Christos Xenakis展开收起
作者单位
University of Piraeus, 80 Karaoli & Dimitriou, Piraeus, 18534, Attica, Greece; InQbit Innovations SRL, Bucharest, Romania展开收起
PDF源文件 DOI 网页
126 天

Locate, steer, and improve: A practical survey of actionable mechanistic interpretability in large language models

作者
Hengyuan Zhang; Zhihao Zhang; Mingyang Wang; Zunhai Su; Yiwei Wang; Qianli Wang; Shuzhou Yuan; Ercong Nie; Xufeng Duan; Qibo Xue; Zeping Yu; Chenming Shang; Xiao Liang; Jing Xiong; Hui Shen; Chaofan Tao; Zhengwu Liu; Senjie Jin; Zhiheng Xi; Dongdong Zhang; Sophia Ananiadou; Tao Gui; Ruobing Xie; Hayden Kwok-Hay So; Hinrich Schütze; Xuanjing Huang; Qi Zhang; Ngai Wong展开收起
作者单位
The University of Hong Kong, Hong Kong, China; Fudan University, Shanghai, China; LMU Munich, Munich, Germany; Tsinghua University, Beijing, China; Technische Universität Darmstadt, Darmstadt, Germany; Technische Universität Berlin, Berlin, Germany; Technische Universität Dresden, Dresden, Germany; The Chinese University of Hong Kong, Hong Kong, China; Nanjing University, Nanjing, China; University of Manchester, Manchester, United Kingdom; Dartmouth College, Hanover, NH, USA; University of California, Los Angeles, Los Angeles, CA, USA; University of Michigan, Ann Arbor, MI, USA; Microsoft Research Asia, Beijing, China; Tencent, Shenzhen, China展开收起
PDF源文件 DOI 网页
159 天

Natural language processing at the crossroads: Integrating federated and reinforcement learning for emerging intelligent systems

作者
Tesfahunegn Minwuyelet Mengistu; K.M. Faisal; Wooyeol Choi; Taewoon Kim展开收起
作者单位
Department of Information Convergence Engineering, Pusan National University, 2 Busandaehak-ro 63beon-gil, Geumjeong-gu, Busan, 46241, Republic of Korea; Department of Electrical and Computer Engineering, University at Albany, 1400 Washington Ave, Albany, NY 12222, United States; School of Computer Science and Engineering, Chung-Ang University, 84 Heukseok-ro, Dongjak-gu, Seoul, 06974, Republic of Korea展开收起
PDF源文件 DOI 网页
115 天

Service function chain optimal composition and embedding: A systematic survey of optimisation approaches

作者
Theviyanthan Krishnamohan; Paul Harvey展开收起
作者单位
School of Computing Science, University of Glasgow, Glasgow, United Kingdom展开收起
PDF源文件 DOI 网页
116 天

Artificial intelligence driven channel coding and resource optimization for wireless networks: A systematic survey

作者
Yasir Ali; Tayyab Manzoor; Huan Yang; Chenhang Yan; Yuanqing Xia展开收起
作者单位
School of Automation, Beijing Institute of Technology, Beijing 100081, China; Zhengzhou Research Institute, Beijing Institute of Technology, Zhengzhou 450000, Henan Province, China; School of Automation and Electrical Engineering, Zhongyuan University of Technology, Zhengzhou 450007, Henan Province, China; Zhongyuan University of Technology, Zhengzhou 450007, Henan Province, China; Zhejiang Key Laboratory of Intelligent Perception and Control for Complex Systems, Zhejiang University of Technology, Hangzhou, China展开收起
PDF源文件 DOI 网页
13 天

Graphs of large girth

作者
Christian Reiher展开收起
作者单位
Fachbereich Mathematik, Universität Hamburg, Hamburg, Germany展开收起
PDF源文件 DOI 网页

FAQ

Computer Science Review审稿要多久?

截至2026-11-16,CrushSCI 收录了 Computer Science Review 的 15 篇完整审稿记录。最快一篇从收稿到录用用了 13 天(Graphs of large girth,2025-11-01 收稿,2025-11-14 录用),最慢一篇用了 216 天;平均 133.5 天,中位数 132 天。

Expert Matching · Case Demo

把投稿要求,转成可验证的期刊方案

说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。

我们会在半小时内回复。

CrushSCI 在线

客户询问

我是环境工程专业,需要一篇 SCI,希望 3 个月内见刊。没有基金,也没有大牛挂名,可以投哪些期刊?

CrushSCI回复

可以。先按 90 天时限做可行性筛选,同步查找无基金、无知名作者挂靠的典型论文案例,作为选刊依据。重点核对研究质量与期刊 scope。

拟题建议
《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》

样本口径2026 年最近 5 篇有效论文样本

平均审稿59.6 天

中位数65 天

Contact CrushSCI

联系 CrushSCI

留下手机号或微信号,我们将与你确认学术润色、结构优化或一对一辅导咨询需求。

我们会在半小时内回复。

当前选择:学术咨询服务

预留联系方式

也可以直接发送邮件至 leader@crushsci.com

手机号和微信号至少填写一项,仅用于本次咨询联系,不会公开。