Token rankings from language models are unique and NP-hard to forge, providing the first polynomially unforgeable model signature.
Directed Switching Games on graphs and matroids
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Token Rankings are Unforgeable Language Model Signatures
Token rankings from language models are unique and NP-hard to forge, providing the first polynomially unforgeable model signature.