pith. sign in
Pith Number

pith:K5ODWVEU

pith:2023:K5ODWVEULPANCEPKPBKSGVI2QE
not attested not anchored not stored refs resolved

RepoBench: Benchmarking Repository-Level Code Auto-Completion Systems

Canwen Xu, Julian McAuley, Tianyang Liu

RepoBench introduces a benchmark for repository-level code auto-completion with three tasks covering retrieval, next-line prediction, and combined pipelines in Python and Java.

arxiv:2306.03091 v2 · 2023-06-05 · cs.CL · cs.AI · cs.SE

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{K5ODWVEULPANCEPKPBKSGVI2QE}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

Current benchmarks mainly focus on single-file tasks, leaving an assessment gap for more complex, real-world, multi-file programming scenarios. To fill this gap, we introduce RepoBench.

C2weakest assumption

That the three constructed tasks and data selection in RepoBench faithfully capture the challenges of real repository-level code completion without introducing selection biases or artificial simplifications.

C3one line summary

RepoBench is a new benchmark with retrieval, completion, and pipeline tasks to evaluate code auto-completion systems on entire repositories instead of single files.

References

55 extracted · 55 resolved · 8 Pith anchors

[1] Colt5: Faster long-range transformers with conditional computation, 2023 2023
[2] Santacoder: don’t reach for the stars!,
[3] Santacoder: don’t reach for the stars! arXiv preprint arXiv:2301.03988
[4] In: 2013 10th Working Conference on Mining Software Repositories (MSR), pp 207--216, doi:10.1109/MSR.2013.6624029 2013 · doi:10.1109/msr.2013.6624029
[5] Program Synthesis with Large Language Models 2021 · arXiv:2108.07732

Formal links

1 machine-checked theorem link

Cited by

35 papers in Pith

Receipt and verification
First computed 2026-05-17T23:38:49.935497Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

575c3b54945bc0d111ea785523551a8123e1e3d8a5a42b1432ca5680245c7d90

Aliases

arxiv: 2306.03091 · arxiv_version: 2306.03091v2 · doi: 10.48550/arxiv.2306.03091 · pith_short_12: K5ODWVEULPAN · pith_short_16: K5ODWVEULPANCEPK · pith_short_8: K5ODWVEU
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/K5ODWVEULPANCEPKPBKSGVI2QE \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 575c3b54945bc0d111ea785523551a8123e1e3d8a5a42b1432ca5680245c7d90
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "4f978ce0679f6aabc1c24ac4fc16504d52bc907f4a781464e0adb1868eafb631",
    "cross_cats_sorted": [
      "cs.AI",
      "cs.SE"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.CL",
    "submitted_at": "2023-06-05T17:59:41Z",
    "title_canon_sha256": "ceeff49f7ba0aa32aaa1c831c5b85f9963b1d30673b021f87425e0b866202c81"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2306.03091",
    "kind": "arxiv",
    "version": 2
  }
}