Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?
As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2402.02611.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T23:30:43.595386Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-21T22:34:23.958381Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation d18500c4-f372-48a4-a7e0-2d5e38939151 · inbound
EnigmaEval: A Benchmark of Long Multimodal Reasoning Challenges cites this paper.
EnigmaEval: A Benchmark of Long Multimodal Reasoning Challenges FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T23:30:43.595386Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a5ba5abd-d9bb-45b5-b31a-b2af3979aeff · inbound
A Neuro-Symbolic Approach for Reliable Proof Generation with LLMs: A Case Study in Euclidean Geometry cites this paper.
A Neuro-Symbolic Approach for Reliable Proof Generation with LLMs: A Case Study in Euclidean Geometry FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T15:38:29.719822Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f2d4a53e-8611-431a-a283-7848ebe27d69 · inbound
Reasoning LLMs are Wandering Solution Explorers cites this paper.
Reasoning LLMs are Wandering Solution Explorers FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T14:01:12.762253Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a7c44ba6-481d-4dbb-ab15-381987856a58 · inbound
ACCORD: Autoregressive Constraint-satisfying Generation for COmbinatorial Optimization with Routing and Dynamic attention cites this paper.
ACCORD: Autoregressive Constraint-satisfying Generation for COmbinatorial Optimization with Routing and Dynamic attention FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?
Reference 22
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T15:04:34.700548Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a6a708bf-3284-4716-8d12-5081e73cb232 · inbound
InternBootcamp Technical Report: Boosting LLM Reasoning with Verifiable Task Scaling cites this paper.
InternBootcamp Technical Report: Boosting LLM Reasoning with Verifiable Task Scaling FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?
Reference 31
- Resolution
- verified exact
- arxiv_id, observed 2026-05-21T22:34:23.960679Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 044de025-daf2-46f3-99d2-bf13c184a109 · inbound
PuzzleClone: A DSL-Powered Framework for Synthesizing Verifiable Data cites this paper.
PuzzleClone: A DSL-Powered Framework for Synthesizing Verifiable Data FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?
Reference 38
- Resolution
- unresolved
- no resolver link, observed 2026-08-05T18:08:42.697524Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.