Evidence map›Paper›PMID 28931033›Full record

ArticlePloS one2017

Artificial intelligence in peer review: How can evolutionary computation support journal editors?

Maciej J Mrowinski, Piotr Fronczak, Agata Fronczak, Marcel Ausloos, Olgica Nedic

Abstract read
In one paragraph

Article in PloS one, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

0numbers the graph read from it
0cells of the map it votes in
9citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

9 citing papers in PubMed.

  1. Article
  2. Review
  3. Article
  4. Review
  5. Review
  6. Article
  7. Article
  8. Article
  9. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Maciej J MrowinskiFaculty of Physics, Warsaw University of Technology, Koszykowa 75, PL-00-662, Warsaw, Poland.ORCID http://orcid.org/0000-0002-3952-0260
Piotr FronczakFaculty of Physics, Warsaw University of Technology, Koszykowa 75, PL-00-662, Warsaw, Poland.
Agata FronczakFaculty of Physics, Warsaw University of Technology, Koszykowa 75, PL-00-662, Warsaw, Poland.
Marcel AusloosSchool of Management, University of Leicester, University Road, Leicester LE1 7RH, United Kingdom.
Olgica NedicInstitute for the Application of Nuclear Energy (INEP), University of Belgrade, Banatska 31b, Belgrade-Zemun, Serbia.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

With the volume of manuscripts submitted for publication growing every year, the deficiencies of peer review (e.g. long review times) are becoming more apparent. Editorial strategies, sets of guidelines designed to speed up the process and reduce editors' workloads, are treated as trade secrets by publishing houses and are not shared publicly. To improve the effectiveness of their strategies, editors in small publishing groups are faced with undertaking an iterative trial-and-error approach. We show that Cartesian Genetic Programming, a nature-inspired evolutionary algorithm, can dramatically improve editorial strategies. The artificially evolved strategy reduced the duration of the peer review process by 30%, without increasing the pool of reviewers (in comparison to a typical human-developed strategy). Evolutionary computation has typically been used in technological processes or biological ecosystems. Our results demonstrate that genetic programs can improve real-world social systems that are usually much harder to understand and control than physical systems.

Indexed as

Artificial IntelligenceComputer SimulationEditorial PoliciesAlgorithmsEvolution, MolecularHumansModels, GeneticPeer Review, ResearchPublishingQuality Control

Identifiers

PMID28931033
PMCPMC5607159

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.