Unverified50% confidenceFactExact time
In order theory, a lattice is an algebraic structure with a partial order relation in which any two elements have a unique least upper bound (join) and greatest lower bound (meet).
1
Sources
50%
Confidence
Long-term
Relevance
10/15/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedWhen there is no ordering relationship between the rows of matrix data (swapping rows does not affect the classification result), the data is essentially a Set rather than a Sequence.66% similarUnverifiedThe floating-point to string problem has deep connections with continued fraction theory and Stern-Brocot trees in number theory, and finding the rational number with the smallest denominator within an interval is equivalent to searching in a Stern-Brocot tree.63% similarUnverifiedThe Partition Principle states: if there exists a surjection from set A to set B, then the cardinality of B is no greater than the cardinality of A.62% similarVerifiedCosine similarity only cares about vector direction and not length, with values strictly falling in the range [-1, 1].61% similarUnverifiedSequence parallelism splits the inputs of operators such as LayerNorm and Dropout along the sequence dimension, causing activation memory to decrease linearly with the degree of parallelism59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1033009API
curl https://kongchang.com/api/v1/knowledge/claims/1033009MCP
get_claim(id=1033009)