The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The pinocchio algorithm: pinpointing orbit-crossing collapsed hierarchical objects in a linear density field
Open accessAbstract
PINOCCHIO (PINpointing Orbit-Crossing Collapsed HIerarchical Objects) is a new algorithm proposed recently by Monaco et al. (Paper I) for identifying dark matter haloes in a given numerical realization of the linear density field in a hierarchical universe.Mass elements are assumed to have collapsed after undergoing orbit crossing, as computed using perturbation theory.It is shown that Lagrangian perturbation theory, and in particular its ellipsoidal truncation, is able to predict accurately the collapse, in the orbit-crossing sense, of generic mass elements.Collapsed points are grouped into haloes using an algorithm that mimics the hierarchical growth of structure through accretion and mergers.Some points that have undergone orbit crossing are assigned to the network of filaments and sheets that connects the haloes; it is demonstrated that this network resembles closely that found in N-body simulations.The code generates a catalogue of dark matter haloes with known mass, position, velocity, merging history and angular momentum.It is shown that the predictions of the code are very accurate when compared with the results of large N-body simulations that cover a range of cosmological models, box sizes and numerical resolutions.The mass function is recovered with an accuracy of better than 10 per cent in number density for haloes with at least 30 -50 particles.A similar accuracy is reached in the estimate of the correlation length r 0 .The good agreement is still valid on the object-by-object level, with 70 -100 per cent of the objects with more than 50 particles in the simulations also identified by our algorithm.For these objects the masses are recovered with an error of 20 -40 per cent, and positions and velocities with a root mean square error of ,1 -2 Mpc ð0:5 -2 grid lengths) and ,100 km s 21 , respectively.The recovery of the angular momentum of haloes is considerably noisier, and accuracy at the statistical level is achieved only by introducing free parameters.The algorithm requires negligible computer time as compared with performing a numerical N-body simulation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The statistics of peaks of Gaussian random fields
Bardeen, J. M., Bond, J. R., Kaiser, N., & Szalay, A. S. (1986) · The Astrophysical Journal · doi:10.1086/164143 · Cited by 3,270
Cited by
Galaxy Evolution from Halo Occupation Distribution Modeling of DEEP2 and SDSS Galaxy Clustering
Zheng, Z., Coil, A. L., & Zehavi, I. (2007) · The Astrophysical Journal · doi:10.1086/521074 · Cited by 603
Detection of gravitational lensing in the cosmic microwave background
Smith, K. M., Zahn, O., & Doré, O. (2007) · Physical Review D · doi:10.1103/physrevd.76.043510 · Cited by 369
The halo mass function from the dark ages through the present day
Reed, D. S., Bower, R., Frenk, C. S., Jenkins, A., & Theuns, T. (2007) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2006.11204.x · Cited by 365
Self-citationBenson, A. J. (2010) · Physics Reports · doi:10.1016/j.physrep.2010.06.001 · Cited by 343
THE NON-CAUSAL ORIGIN OF THE BLACK-HOLE-GALAXY SCALING RELATIONS
Jahnke, K., & Macciò, A. V. (2011) · The Astrophysical Journal · doi:10.1088/0004-637x/734/2/92 · Cited by 319
Metadata
- Authors
- Monaco, P., Theuns, T., & Taffoni, G.
- Venue
- Monthly Notices of the Royal Astronomical Society
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-04
- Volume
- 331
- Issue
- 3
- Pages
- 587-608
- ISSN
- 0035-8711 (ISSN-L)
- 1365-2966
- OpenAlex
- W2050469528
- Cited by
- 227
- References
- 1
- FWCI
- 2.75
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The pinocchio algorithm: pinpointing orbit-crossing collapsed hierarchical objects in a linear density field. https://app.cochat.ai/papers/10.1046/j.1365-8711.2002.05162.x
- The paper
- Monaco, P., Theuns, T., & Taffoni, G. (2002). The pinocchio algorithm: pinpointing orbit-crossing collapsed hierarchical objects in a linear density field. Monthly Notices of the Royal Astronomical Society. https://doi.org/10.1046/j.1365-8711.2002.05162.x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.