Papers › CPRet: A Dataset, Benchmark, and Model for Retrieval in Competitive Programming

CPRet: A Dataset, Benchmark, and Model for Retrieval in Competitive Programming

19 May 2025arXiv:2505.12925archive 2025-07-28

Han Deng, Yuan Meng, Shixiang Tang, Wanli Ouyang, Xinzhu Ma

Competitive programming benchmarks are widely used in scenarios such as programming contests and large language model assessments. However, the growing presence of duplicate or highly similar problems raises concerns not only about competition fairness, but also about the validity of competitive programming as a benchmark for model evaluation. In this paper, we propose a new problem -- similar question retrieval -- to address this issue. Due to the lack of both data and models, solving this problem is challenging. To this end, we introduce CPRet, a retrieval-oriented benchmark suite for competitive programming, covering four retrieval tasks: two code-centric (i.e., Text-to-Code and Code-to-Code) and two newly proposed problem-centric tasks (i.e., Problem-to-Duplicate and Simplified-to-Full), built from a combination of automatically crawled problem-solution data and manually curated annotations. Our contribution includes both high-quality training data and temporally separated test sets for reliable evaluation. In addition, we develop two task-specialized retrievers based on this dataset: CPRetriever-Code, trained with a novel Group-InfoNCE loss for problem-code alignment, and CPRetriever-Prob, fine-tuned for identifying problem-level similarity. Both models achieve strong results and are open-sourced for local use. Finally, we analyze LiveCodeBench and find that high-similarity problems inflate model pass rates and reduce differentiation, underscoring the need for similarity-aware evaluation in future benchmarks. Code and data are available at: https://github.com/coldchair/CPRet

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2505.12925")

Code

Syntology Ran 0 of 11 code samples harvested from 2 repositories linked to this paper; 11 have no recorded run.

By repository: found in paper text by Syntology: 11 samples from 2 repositories, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

coldchair/cpret officialmentioned in papermentioned on GitHubjax report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 0 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

11unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

bytes_to_hex lexiforest/curl_cffi/curl_cffi/curl.py found in paper text by Syntology unverified MIT (permissive) · 9669a50ca25cddf8 · report
calculate_batch_size unclecode/crawl4ai/crawl4ai/model_loader.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 99a7758c99fcc47d · report
determine_print_spec lexiforest/curl_cffi/curl_cffi/cli/output.py found in paper text by Syntology unverified MIT (permissive) · 8cac0a862bf83a39 · report
from_serializable_dict unclecode/crawl4ai/crawl4ai/async_configs.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 500a790da96ce931 · report
get_available_memory unclecode/crawl4ai/crawl4ai/model_loader.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 5c8d701fb3651833 · report
is_blocked unclecode/crawl4ai/crawl4ai/antibot_detector.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 4c469c8cc18a0a56 · report
is_empty_value unclecode/crawl4ai/crawl4ai/async_configs.py found in paper text by Syntology unverified Apache-2.0 (permissive) · a035ccc8ea9189ee · report
parse_request_items lexiforest/curl_cffi/curl_cffi/cli/parse.py found in paper text by Syntology unverified MIT (permissive) · 6b0c83ffd8abd55c · report
process_url lexiforest/curl_cffi/curl_cffi/cli/parse.py found in paper text by Syntology unverified MIT (permissive) · 9092bccbef30f7b3 · report
set_model_device unclecode/crawl4ai/crawl4ai/model_loader.py found in paper text by Syntology unverified Apache-2.0 (permissive) · 2ec152ff8b3aa899 · report
to_serializable_dict unclecode/crawl4ai/crawl4ai/async_configs.py found in paper text by Syntology unverified Apache-2.0 (permissive) · fb6814e51f39f7ea · report

Tasks

FairnessLarge Language ModelRetrieval

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections