Pith. sign in

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis , booktitle =

4 Pith papers cite this work, alongside 7 external citations. Polarity classification is still indexing.

4 Pith papers citing it
7 external citations · external index

years

2026 4

representative citing papers

Covering Points with Rectangular Boundaries

cs.CG · 2026-07-09 · conditional · novelty 7.0

Covering points by boundaries of axis-parallel rectangles is NP-complete in the free-placement setting, W[1]-hard when rectangles are preset, and fixed-parameter tractable in the solution size k.

Innovation: An Almost Characterization of Hallucination

cs.LG · 2026-05-26 · unverdicted · novelty 7.0

Introduces the 'innovation' property of LLMs and proves it is an almost characterization of hallucination while deriving new lower bounds on hallucination rates via missing mass.

Fine-grained Claim-level RAG Benchmark for Law

cs.CL · 2026-05-20 · unverdicted · novelty 7.0 · 3 refs

ClaimRAG-LAW is a French-English legal RAG benchmark with claim-level granularity for experts and non-experts that reveals limitations in current retrieval and generation performance.

citing papers explorer

Showing 4 of 4 citing papers.

  • Covering Points with Rectangular Boundaries cs.CG · 2026-07-09 · conditional · none · ref 25

    Covering points by boundaries of axis-parallel rectangles is NP-complete in the free-placement setting, W[1]-hard when rectangles are preset, and fixed-parameter tractable in the solution size k.

  • Innovation: An Almost Characterization of Hallucination cs.LG · 2026-05-26 · unverdicted · none · ref 3

    Introduces the 'innovation' property of LLMs and proves it is an almost characterization of hallucination while deriving new lower bounds on hallucination rates via missing mass.

  • Fine-grained Claim-level RAG Benchmark for Law cs.CL · 2026-05-20 · unverdicted · none · ref 22 · 3 links

    ClaimRAG-LAW is a French-English legal RAG benchmark with claim-level granularity for experts and non-experts that reveals limitations in current retrieval and generation performance.

  • Stop When Reasoning Converges: Semantic-Preserving Early Exit for Reasoning Models cs.CL · 2026-05-17 · unverdicted · none · ref 67

    PUMA detects reasoning-level semantic redundancy to enable early exit in chains of thought, achieving 26.2% average token reduction across five LRMs and five benchmarks while preserving accuracy and CoT quality.