Deletion of Sparse representation of a number

Comment: The first example given in the article is basically run length encoding for the digits of a binary number. RLE for binary strings is well known and has been used in some compression schemes. While figuring out arithmetic algorithms for the RLE representation is an interesting academic exercise, I was unable to find sources (other than the section of the paper discussed above) discussing this representation either as a sparse number or as a run length encoded number. It leads me to believe that the article, while well-intentioned, is |original research. Without multiple in-depth reliable sources per , this topic fails notability thresholds as described in . Given the mention in the paper above, this could be selectively merged into Skew binary number system, but just a single section of a single primary paper is a thin foundation for a merge. Deletion, until multiple sources become available that discuss this number system, may be the best course
Stance: delete
Cited policy: Wikipedia:No original research (WP:OR||WP:RS||WP:GNG)

Comment: Sparse representations of bitvectors are definitely important, and there has even been some interesting research on algorithmic problems of arithmetic with sparse binary numbers (those with few 1's in their binary representation; see Plaisted, "New NP-hard and NP-complete polynomial and integer divisibility problems", FOCS 1977). That said, this article doesn't touch on any of that, its references are useless for establishing notability of this topic (they're on something peripheral to it), and to the extent that what it says is non-obvious it appears to be original research. So, per , if this were to be turned into a usable article it would need to be completely rewritten, and there's no point in keeping the present version while we wait for that to happen
Stance: delete
Cited policy: Wikipedia:Blow it up and start over (WP:TNT)