Human Feedback Types
missingNone explicit
No explicit feedback protocol extracted.
"We present CombEval, a dynamic benchmark for evaluating combinatorial counting in large language models."
HFEPX · Eval paper review
Yuxu Zhou, Ondřej Kuželka, Yuyi Wang, Yuanhong Wang +1 more
Published
Jun 18, 2026
Citations
0
Trust level
Low
Usefulness score
0/100 (Low)
Extraction confidence
25% (Low)
Derived from extracted protocol signals and abstract evidence.
Rater population
Not reported
Signals refreshed
Jun 18, 2026
This paper is adjacent to HFEPX scope and is best used for background context, not as a primary protocol reference.
Use this as background context only. Do not make protocol decisions from this page alone.
All signals on this page are inferred from the abstract only and may be inaccurate. Do not use this page as a primary protocol reference.
Best use
Background context only
Use if you need
Background context only.
What to verify
Validate the evaluation procedure and quality controls in the full paper before operational use.
Main weakness
This paper looks adjacent to evaluation work, but not like a strong protocol reference.
Treat as adjacent context, not a core eval-method reference.
If you are doing eval pipeline work, start here
We present CombEval, a dynamic benchmark for evaluating combinatorial counting in large language models. CombEval represents each problem as a typed Cofola specification over entities, combinatorial objects, object dependencies, and constraints, enabling controlled generation of natural-language counting problems with exact solver-verified answers. Unlike static collections, CombEval supports systematic variation of object type, entity scale, constraint count, and reasoning depth. We evaluate 11 LLMs under direct and code-augmented settings and find that models remain brittle on ordered objects, indistinguishable elements, relatively positional constraints, and nested object dependencies. Error analysis further identifies failures in constraint interpretation and counting principles. CombEval provides a diagnostic testbed for studying when and why LLMs fail at combinatorial reasoning. The code and generated benchmark suites are publicly available at \url{https://github.com/YuxuZhou-CN/combination-problem-generation}.
These are the protocol signals we could actually recover from the available paper metadata. Use them to decide whether this paper is worth deeper reading.
None explicit
No explicit feedback protocol extracted.
"We present CombEval, a dynamic benchmark for evaluating combinatorial counting in large language models."
None explicit
Validate eval design from full paper text.
"We present CombEval, a dynamic benchmark for evaluating combinatorial counting in large language models."
Not reported
No explicit QC controls found.
"We present CombEval, a dynamic benchmark for evaluating combinatorial counting in large language models."
Combeval
Useful for quick benchmark comparison.
"We present CombEval, a dynamic benchmark for evaluating combinatorial counting in large language models."
Not extracted
No metric anchors detected.
"We present CombEval, a dynamic benchmark for evaluating combinatorial counting in large language models."
No metric terms were extracted from the available abstract.
We present CombEval, a dynamic benchmark for evaluating combinatorial counting in large language models.
Based on abstract + metadata only. Check the source paper before making high-confidence protocol decisions.
Human feedback protocol is explicit
No explicit human feedback protocol detected.
Evaluation mode is explicit
No clear evaluation mode extracted.
Quality control reporting appears
No calibration/adjudication/IAA control explicitly detected.
Benchmark or dataset anchors are present
Detected: Combeval
Metric reporting is present
No metric terms extracted.