Unverified50% confidenceFactExact time
Tree traversal is essentially greedy: once the model makes a mistake at a certain node, it cannot return to the correct branch, and the correct category is permanently removed from the candidate set, which the paper calls 'irreversible exclusion'.
1
Sources
50%
Confidence
Long-term
Relevance
10/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe pruned model cannot have its reasoning intensity set to the MAX level; otherwise, it easily falls into inference loops.66% similarUnverifiedPrompt filtering cannot fundamentally solve the prompt injection problem, because bypass techniques keep emerging and model behavior is non-deterministic; the real line of defense lies in permission boundaries.66% similarUnverifiedA perfect score may indicate that the set of questions has lost its ability to differentiate between models.64% similarUnverifiedFor unknown failure categories, the arbiter must stop rather than automatically inventing a new category.63% similarUnverifiedEven if model-level guardrails are bypassed, the model's capability ceiling still exists; jailbreaking more often relaxes the model's tendency to refuse rather than genuinely granting it the ability to complete illegal tasks.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1046720API
curl https://kongchang.com/api/v1/knowledge/claims/1046720MCP
get_claim(id=1046720)