Pith. sign in

Paper Citation Record · LEDGER

FCoReBench: Can Large Language Models Solve Challenging First-Order Combinatorial Reasoning Problems?

As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.02611.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2402.02611 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-06T06:34:29.942622+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T18:08:42.697524Z

measured 0 of 1 external citation measurements

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 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-06T06:34:29.942622+00:00.

source=pdf_text observed=2026-05-21T22:33:09.674822Z digest=sha256:c03b2de367859d246fa7e875db6c9a6f06dc3ac3bb864ef87fa4ad8f8df3b2d0

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.

source=arxiv_source observed=2026-08-05T18:08:42.697524Z digest=sha256:fd707f7783454641af9a75dce37298d88ed2f4a7c849a699e0000d318f5d1b9c