ResearchForge
ProductPrivacyFAQHelp
Log inSign up free

Knowwhat’salreadybeendone beforeyouruntheexperiment.

See if your idea is already published, or get your paper reviewed before you submit. Every claim quotes a real paper.

Has request-aware KV-cache eviction already been tried?

Idea check · 20–60 min · Closest published work, the strongest objections, and an experiment plan.

Searches arXiv, OpenAlex, Semantic Scholar and Crossref.

Step 1 of 7
  1. 1Turn the idea into a testable questionrecord_idea_analysis
  2. 2Search arXiv, OpenAlex, Semantic Scholar, Crossrefsearch_papers
  3. 3Read the closest papersrecord_paper_analysis
  4. 4Follow citations to related workexpand_citations
  5. 5Argue against the idearecord_critique
  6. 6Keep only gaps backed by quotesrecord_gap
  7. 7Plan an experiment that could disprove itrecord_experiment_plan
Closest published workarXiv:2404.14469

SnapKV: LLM Knows What You are Looking for Before Generation

Li et al., 2024

“SnapKV achieves a consistent decoding speed with a 3.6x increase in generation speed and an 8.2x enhancement in memory efficiency compared to the baseline when processing inputs of 16K tokens.”

Quote found word for word in the abstract

Strongest objection

SnapKV already compresses the cache per request. The idea is only new if the budget adapts across turns of a conversation without recalibration.

Outcome

Promising, needs validation. Two refined directions and an experiment plan that states which result would disprove the idea.

An abridged example. Real runs take 20 to 60 minutes, and you can close the tab while they work.

Three tools. One goal: no surprises from reviewers.

Autonomous scholarly investigation and pre-submission peer review.

01

Idea check

Has it been done? Get the closest papers, the best objections and a test plan.

  • Discovers closest prior work across arXiv, OpenAlex & Semantic Scholar
  • Stress-tests novelty with counter-arguments & reviewer objections
  • Generates concrete falsification experiments before you build
20–60 minExplore
02

Paper review

Two reviewer reports and a fix list for your draft, before you submit.

  • Dual independent reviewer reports with standard conference rubrics
  • Identifies missing baselines and unaddressed counterexamples
  • Target venue recommendations categorized by SCImago quartile
15–40 minExplore
03

Reference check

Catch wrong, mismatched or made-up references. Free forever.

  • Audits DOIs, titles, authors, and publication years against Crossref
  • Flags phantom references, hallucinations, and broken links
  • One-click BibTeX export with validated and corrected citations
2 min · FreeExplore

No source, no claim.

Every quote is checked word for word against the paper. Anything unsupported is dropped.

arXiv:2404.14469 [cs.CL]/SnapKV: LLM Knows What You are Looking for Before Generation
Strict claim audit
Kept in synthesis100% verbatim match

“SnapKV achieves … an 8.2x enhancement in memory efficiency compared to the baseline when processing inputs of 16K tokens.”

Li et al., 2024 · Page 2, Abstract line 14 · Verified against official PDF

Dropped claimZero citations found

KV-cache eviction never loses accuracy, at any context length.

Unsubstantiated generalization · Dropped by citation gate

Questions

More in Help.

No tool can. It shows you the closest published work and how much it overlaps, so you can decide.

Yes. Only you can see it, it is never used to train models, and you can delete it any time.

An idea check takes 20 to 60 minutes, a paper review 15 to 40, a reference check about 2. You can close the tab while it works.

Any field in OpenAlex, Crossref, arXiv and Semantic Scholar, from computer science to medicine and economics.

Test your next idea before you spend months on it.

Verify prior art, pressure-test claims, and check citations before you submit to reviewers.

Start free
No credit card required Reference checks are always free Private by default
ResearchForge

Check research ideas and review papers, with evidence behind every claim.

Idea checkPaper reviewReference checkerDocumentation
GitHub (MIT)