CrushSCI.com
190.3平均天数
144中位天数
80最短天数
523最长天数
512025发文量

Paper Review Records

全部论文审稿周期

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

523 天

A latent space convex hull model of hypergraphs

作者
Yichen He展开收起
作者单位
1. School of Statistics and Data Science, Zhejiang Gongshang University , No. 18 Xuezheng Street , Hangzhou 310019,展开收起
PDF源文件 DOI 网页
80 天

Synchronization on star-like graphs and emerging $\mathbb{Z}_{p}$ symmetries at strong coupling

作者
Artem Alexandrov; Pavel Arkhipov; Alexander Gorsky展开收起
作者单位
1. Moscow Institute of Physics and Technology, Dolgorpudny 141700, Russia; 2. Institute for Information Transmission Problems of the RAS, Moscow 127051 and Moscow Institute of Physics and Technology, Dolgorpudny 141700, Russia展开收起
PDF源文件 DOI 网页
140 天

Gauging node consistency in accusation–endorsement networks

作者
Oscar Goodloe; Zihan Zhou; Joel Nishimura展开收起
作者单位
1. School of Computer Science, Georgia Institute of Technology , 266 Ferst Drive, Atlanta, GA 30332, USA; 2. Department of Computer Science, University of British Columbia , Vancouver, BC 2178-2207, Canada; 3. School of Mathematical and Natural Sciences, Arizona State University , 4701 W. Thunderbird Rd, Glendale, AZ 85306, USA展开收起
PDF源文件 DOI 网页
148 天

An empirical comparison of connectivity-based distances on a graph and their computational scalability

作者
Pierre Miasnikof; Alexander Y Shestopaloff; Leonidas Pitsoulis; Alexander Ponomarenko展开收起
作者单位
1. The Edward S. Rogers Sr. Department of Electrical & Computer Engineering, 10 King’s College Road, Toronto, ON, M5S 3G4, Canada and Data Sciences Institute, University of Toronto, 700 University Avenue, 17th Floor, Toronto, ON, M5G 1Z5, Canada; 2. School of Mathematical Sciences, Queen Mary University of London, Mile End Road, London E1 4NS, UK; 3. Department of Electrical Engineering and Computer Science, Aristotle University of Thessaloniki, Thessaloniki 54125, Greece; 4. Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova str., Nizhny Novgorod 603093, Russia and Center for Hydroacoustics and Geophysical Research Division, Institute of Applied Physics of The Russian Academy of Sciences, 46 Ulyanova str., Nizhny Novgorod 603950, Russia展开收起
PDF源文件 DOI 网页
153 天

The performance of cooperation strategies for enhancing the efficiency of international oil trade networks

作者
Na Wei; Wen-Jie Xie; Wei-Xing Zhou展开收起
作者单位
1. School of Business, East China University of Science and Technology, 130 Meilong Road, Shanghai 200237, China; 2. School of Business and Research Center for Econophysics, East China University of Science and Technology, 130 Meilong Road, Shanghai 200237, China; 3. School of Business, Research Center for Econophysics, and School of Mathematics, East China University of Science and Technology, 130 Meilong Road, Shanghai 200237, China展开收起
PDF源文件 DOI 网页
98 天

Supernodes: a generalization of the rich-club

作者
Su Yuan Chan; Kerri Morgan; Nicholas Parsons; Julien Ugon展开收起
作者单位
1. Deakin University, Geelong, Australia and School of Information Technology , Faculty of Science Engineering & Built Environment, Australia; 2. Deakin University, Geelong, Australia and School of Psychology , Cognitive Neuroscience Unit, Australia展开收起
PDF源文件 DOI 网页

FAQ

Journal of Complex Networks审稿要多久?

截至2026-11-19,CrushSCI 收录了 Journal of Complex Networks 的 6 篇完整审稿记录。最快一篇从收稿到录用用了 80 天(Synchronization on star-like graphs and emerging $\mathbb{Z}_{p}$ symmetries at strong coupling,2022-02-06 收稿,2022-04-27 录用),最慢一篇用了 523 天;平均 190.3 天,中位数 144 天。

Expert Matching · Case Demo

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

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

我们会在半小时内回复。

CrushSCI 在线

客户询问

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

CrushSCI回复

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

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

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

平均审稿59.6 天

中位数65 天

Contact CrushSCI

联系 CrushSCI

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

我们会在半小时内回复。

当前选择:学术咨询服务

预留联系方式

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

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