A method infers conservative lower bounds on LLM parameter counts from next-token accuracy profiles on popular texts using pairwise tests and PCA-based scaling-law estimation.
Are you getting what you pay for? auditing model substitution in llm apis, 2025,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proposes referential security as a paradigm for AI evaluations that reframes model identity as verifiable to support reproducible audits and regulatory decisions despite system changes.
citing papers explorer
-
Inferring the Size of Large Language Models From Popular Text Memorization
A method infers conservative lower bounds on LLM parameter counts from next-token accuracy profiles on popular texts using pairwise tests and PCA-based scaling-law estimation.
-
Referential Security as a New Paradigm for AI Evaluations
Proposes referential security as a paradigm for AI evaluations that reframes model identity as verifiable to support reproducible audits and regulatory decisions despite system changes.