Definition
Plain language
A technique that uses individual bits of an integer to represent set membership, enabling fast operations.
As stated in the literature
A representation that packs boolean set membership into integer bits to enable bitwise operations for conflict detection or fast intersection; cited in the ScientistOne audit as a method-section claim not actually implemented in the submitted code.
Why it matters: It can turn slow set operations into single-cycle CPU instructions, which is why claiming it in a paper but not implementing it is a meaningful integrity gap.
For example, a constraint solver might pack the set {0, 2, 5} into the binary number 0b100101 so intersection becomes a single AND instruction.
Heard on the show
“… STAR is described in the paper as using bitwise integer encoding for conflict detection, an O-of-one surrogate cost model, and equidistant placement of high-contention …”Episode 089 — When AI-Written Papers Read Well But the Evidence Underneath Is Broken