- Least publishable unit
In academic publishing, the least publishable unit (LPU), also smallest publishable unit (SPU) or minimum publishable unit (MPU), colloquially "publon" - the smallest measurable quantum of publication, is the minimum amount of information that can generate a publication in a peer-reviewed journal. (Maximum publishable unit and optimum publishable unit are also used.) The term is often used as a joking, ironic, or sometimes derogatory reference to the strategy of pursuing the greatest quantity of publications at the expense of their quality.
Publication of the results of research is an essential part of science. The number of publications is sometimes used to assess the work of a scientist and as a basis for distributing research funds. In order to achieve a high rank in such an assessment, there is a trend to split up research results into smaller parts that are published separately, thus increasing the number of publications. This process has been described as splitting the results into the smallest publishable units.
"Salami publication" or "salami slicing" is a variant of the smallest-publishable-unit strategy. In salami slicing, data gathered by one research project is separately reported (wholly or in part) in multiple end publications. Salami slicing, apparently named by analogy with the thin slices made from larger pieces of salami meat, is generally considered questionable when not explicitly labeled, as it may lead to the same data being counted multiple times as apparently independent results in aggregate studies.
When data gathered in one research project are partially reported as if a single study, a problem of statistical significance can arise. Scientists typically use a 5% threshold (0.95 probability) to determine whether a hypothesis is supported by the results of a research project. If multiple hypotheses are being tested on a single research project, 1 in 20 hypotheses will by chance be supported by the research. Partially reported research projects must use a lower threshold when testing for statistical significance but often do not do this.
There is no consensus among academics about whether people should seek to make their publications least publishable units, and it has long been resisted by some journal editors. Particularly for people just getting started in academic publication, writing a few small papers provides a way of getting used to how the system of peer review and professional publication works, and it does indeed help to boost that all-important publication count. But publishing too many LPUs is thought not to impress peers when it comes time to seek promotion beyond the assistant professor (or equivalent) level. Also, LPUs are not an efficient way to pass on knowledge, because they break up ideas into small pieces, forcing people to look up many cross-references. On the other hand, a small piece of information is easily digestible, and the reader may not need more information than what is in the LPU.
- ^ Winning The Games Scientists Play, Carl J. Sindermann.
- ^ Broad, William J (13 March 1981), "The Publishing Game: Getting More for Less", Science 211: 1137–1139, doi:10.1126/science.7008199, PMID 7008199
- ^ a b Broad, William; Wade, Nicholas (1983), Betrayers of the Truth: Fraud and Deceit in the Halls of Science, London: Century Publishing, pp. 53–55, ISBN 0-7126-0243-7
- ^ Avoiding plagiarism, self-plagiarism, and other questionable writing practices: A guide to ethical writing
- ^ Duplicate and salami publications. Abraham P, - J Postgrad Med
- ^ "Signs of the times", The Economist, February 24th 2007. This article is based on a presentation by Peter Austin to the American Association for the Advancement of Science.
- ^ "In Defense of the Least Publishable Unit", The Chronicle of Higher Education, Whitney J. Owen.
Wikimedia Foundation. 2010.
Look at other dictionaries:
Salami slicing — is a series of many minor actions, often performed surreptitiously, that together results in a larger action that would be difficult or illegal to perform at once. The term is typically used pejoratively.An example of salami slicing, also known… … Wikipedia
Publish or perish — refers to the pressure to publish work constantly in order to further or sustain one s career in academia. The competition for tenure track faculty positions in academia puts increasing pressure on scholars to publish new work frequently.Frequent … Wikipedia
Doctorate — Aquatint of a Doctor of Divinity at the University of Oxford, in the scarlet and black academic robes corresponding to his position. From Rudolph Ackermann s History of Oxford, 1814. A doctorate is an academic degree or professional degree that… … Wikipedia
Paul Desmond — Infobox musical artist Name = Paul Desmond Img capt = Dave Brubeck and Paul Desmond, October 8, 1954. Img size = 200 Landscape = Background = non vocal instrumentalist Birth name = Paul Emil Breitenfeld Alias = The Stork Born = Birth… … Wikipedia
BpNichol — Barrie Phillip Nichol (September 30, 1944 September 25, 1988), who often went by his lower case initials and last name, with no spaces (bpNichol), was a Canadian poet. He was born in Vancouver, British Columbia, and became widely known for his… … Wikipedia
Natalie Clifford Barney — Natalie Clifford Barney, painted in 1896 by her mother Alice Pike Barney. Born October 31, 1876(1876 10 31) Dayton, Ohio … Wikipedia
map — mappable, adj. mapper, n. /map/, n., v., mapped, mapping. n. 1. a representation, usually on a flat surface, as of the features of an area of the earth or a portion of the heavens, showing them in their respective forms, sizes, and relationships… … Universalium
Map — /map/, n. Walter, c1140 1209?, Welsh ecclesiastic, poet, and satirist. Also, Mapes /mayps, may peez/. * * * I Graphic representation, drawn to scale and usually on a flat surface, of features usually geographic, geologic, or geopolitical of an… … Universalium
MAP — See modified American plan. * * * I Graphic representation, drawn to scale and usually on a flat surface, of features usually geographic, geologic, or geopolitical of an area of the Earth or of any celestial body. Globes are maps represented on… … Universalium
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia