Unverified50% confidenceFactExact time
Sorting with a random comparator violates the sorting algorithm's assumption of a consistent comparison relation, and the sorting implementations of different engines produce different bias patterns.
1
Sources
50%
Confidence
Long-term
Relevance
10/17/2026
First Seen
Sources
Related Entities
Related Claims
Unverifiedentries.sort(() => Math.random() - 0.5) is not a uniform shuffle; the result depends on the sorting algorithm and is biased; Fisher-Yates with unbiased random integers should be used instead.74% similarUnverifiedWhen multiple tools have insufficiently differentiated descriptions, the model's matching results tend toward randomness.73% similarUnverifiedThe results of a single-task evaluation are subject to randomness, and the same model may produce noticeably different answers under different prompts and different random seeds.69% similarUnverified浮点运算不满足结合律，不同线程束的执行顺序差异会导致数值结果出现细微偏差67% similarUnverifiedAblation experiments show that branching at uncertain decision points outperforms randomly selecting branching points and fixed turn-initial branching.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1051828API
curl https://kongchang.com/api/v1/knowledge/claims/1051828MCP
get_claim(id=1051828)