The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
The anti-ktjet clustering algorithm
Open accessAbstract
The k_t and Cambridge/Aachen inclusive jet finding algorithms for hadron-hadron collisions can be seen as belonging to a broader class of sequential recombination jet algorithms, parametrised by the power of the energy scale in the distance measure. We examine some properties of a new member of this class, for which the power is negative. This ``anti-k_t'' algorithm essentially behaves like an idealised cone algorithm, in that jets with only soft fragmentation are conical, active and passive areas are equal, the area anomalous dimensions are zero, the non-global logarithms are those of a rigid boundary and the Milan factor is universal. None of these properties hold for existing sequential recombination algorithms, nor for cone algorithms with split--merge steps, such as SISCone. They are however the identifying characteristics of the collinear unsafe plain ``iterative cone'' algorithm, for which the anti-k_t algorithm provides a natural, fast, infrared and collinear safe replacement.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Longitudinally-invariant k⊥-clustering algorithms for hadron-hadron collisions
Catani, S., Dokshitzer, Y. L., Seymour, M. H., & Webber, B. R. (1993) · Nuclear Physics B · doi:10.1016/0550-3213(93)90166-m · Cited by 1,187
Better jet clustering algorithms
Dokshitzer, Y. L., Leder, G. D., Moretti, S., & Webber, B. R. (1997) · Journal of High Energy Physics · doi:10.1088/1126-6708/1997/08/001 · Cited by 1,062
Boissonnat, J., Devillers, O., Pion, S., Teillaud, M., & Yvinec, M. (2002) · Computational Geometry · doi:10.1016/s0925-7721(01)00054-2 · Cited by 213
A practical seedless infrared-safe cone jet algorithm
Salam, G. P., & Soyez, G. (2007) · Journal of High Energy Physics · doi:10.1088/1126-6708/2007/05/086 · Cited by 211
Self-citation
Cited by
Aad, G., Abajyan, T., Abbott, B., Abdallah, J., Abdel Khalek, S., Abdelalim, A. A., Abdinov, O., Aben, R., Abi, B., Abolins, M., et al. (2012) · Physics Letters B · doi:10.1016/j.physletb.2012.08.020 · Cited by 10,526
Observation of a new boson at a mass of 125 GeV with the CMS experiment at the LHC
Chatrchyan, S., Khachatryan, V., Sirunyan, A. M., Tumasyan, A., Adam, W., Aguilo, E., Bergauer, T., Dragicevic, M., Erö, J., Fabjan, C., et al. (2012) · Physics Letters B · doi:10.1016/j.physletb.2012.08.021 · Cited by 9,874
Alwall, J., Frederix, R., Frixione, S., Hirschi, V., Maltoni, F., Mattelaer, O., Shao, H.-S., Stelzer, T., Torrielli, P., & Zaro, M. (2014) · Journal of High Energy Physics · doi:10.1007/jhep07(2014)079 · Cited by 7,579
DELPHES 3: a modular framework for fast simulation of a generic collider experiment
The DELPHES 3 collaboration, de Favereau, J., Delaere, C., Demin, P., Giammanco, A., Lemaître, V., Mertens, A., & Selvaggi, M. (2014) · Journal of High Energy Physics · doi:10.1007/jhep02(2014)057 · Cited by 2,966
Parton distributions with LHC data
Ball, R. D., Bertone, V., Carrazza, S., Deans, C. S., Del Debbio, L., Forte, S., Guffanti, A., Hartland, N. P., Latorre, J. I., Rojo, J., et al. (2013) · Nuclear Physics B · doi:10.1016/j.nuclphysb.2012.10.003 · Cited by 2,021
Metadata
- Authors
- Cacciari, M., Salam, G. P., & Soyez, G.
- Venue
- Journal of High Energy Physics
- Published
- 2008-04-16
- Volume
- 2008
- Issue
- 04
- Pages
- 063-063
- ISSN
- 1029-8479 (ISSN-L)
- OpenAlex
- W2100507804
- Cited by
- 7,140
- References
- 4
- FWCI
- 68.05
- 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
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.