Cited by 397Algorithms and Data CompressionData Quality and ManagementInformation Retrieval and Search Behavior

The DOI matches its Crossref record; 16 of the 17 references it cites were found in a registry or an index.

Identifying and Filtering Near-Duplicate Documents

Broder, Andrei Z.·2000·Lecture Notes in Computer Science

Overview

Integrity signals

Registry

Crossref · 10.1007/3-540-45123-4_1

Cites

16 of 16 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 17 references

Research works printed but not linked: 2

  1. A. Z. Broder and U. Feige. Min-Wise versus Linear Independence. In Proceedings of the Eleventh Annual ACM-SI AM Symposium on Discrete Algorithms, pages 147–154, 2000.
  2. N. Heintze. Scalable Document Fingerprinting. Proceedings of the Second USENIX Workshop on Electronic Commerce, pages 191–200, 1996.

Cited by

Sorted by citations

Metadata

Authors
Broder, A. Z.
Corresponding author
Broder, Andrei Z.
Venue
Lecture Notes in Computer Science
Published
2000
Pages
1-10
ISSN
0302-9743 (ISSN-L)
OpenAlex
W2148885851
Cited by
395
References
17
Citations by year
2026: 15 · 2025: 18 · 2024: 12 · 2023: 11 · 2022: 19 · 2021: 18 · 2020: 12 · 2019: 14 · 2018: 11 · 2017: 13 · 2016: 31 · 2015: 23 · 2014: 20 · 2013: 28 · 2012: 29
FWCI
0.85
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
  • Physical Sciences › Computer Science › Information Systems › Data Quality and Management
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
Keywords
near-duplicate detection, document filtering, random sampling, sketching, web indexing, search engine indexing, AltaVista

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