Draft:Golubev's ordering

Submission declined on 4 March 2025 by Dan arndt (talk).

This draft's references do not show that the subject qualifies for a Wikipedia article. In summary, the draft needs multiple published sources that are:

in-depth (not just passing mentions about the subject)
reliable
secondary
independent of the subject

Make sure you add references that meet these criteria before resubmitting. Learn about mistakes to avoid when addressing this issue. If no additional references exist, the subject is not suitable for Wikipedia.

This submission is not adequately supported by reliable sources. Reliable sources are required so that information can be verified. If you need help with referencing, please see Referencing for beginners and Citing sources.

If you would like to continue working on the submission, click on the "Edit" tab at the top of the window.
If you have not resolved the issues listed above, your draft will be declined again and potentially deleted.
If you need extra help, please ask us a question at the AfC Help Desk or get live help from experienced editors.
Please do not remove reviewer comments or this notice until the submission is accepted.

Where to get help

If you need help editing or submitting your draft, please ask us a question at the AfC Help Desk or get live help from experienced editors. These venues are only for help with editing and the submission process, not to get reviews.
If you need feedback on your draft, or if the review is taking a lot of time, you can try asking for help on the talk page of a relevant WikiProject. Some WikiProjects are more active than others so a speedy reply is not guaranteed.

How to improve a draft

Wikipedia:Contributing to Wikipedia – a basic overview on how to edit Wikipedia.
Help:Wikitext – how to use the markup
Help:Referencing for beginners – how to include references
Wikipedia:Article development – how to develop your article
Wikipedia:Writing better articles – how to improve your article
Wikipedia:Verifiability – make sure your article includes reliable third-party sources

You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article.

Improving your odds of a speedy review

To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags.

Add tags to your draft

Editor resources

Easy tools: Citation bot (help) | Advanced: Fix bare URLs

Declined by Dan arndt 36 days ago. Last edited by Dan arndt 36 days ago. Reviewer: Inform author.

Resubmit

Please note that if the issues are not fixed, the draft will be declined again.

Comment: Undeclared WP:COI - clearly WP:SELFPROMOTION. Fails WP:GNG, noting GitHub, gitflic and Codeberg are not acceptable or reliable sources. Dan arndt (talk) 08:21, 4 March 2025 (UTC)

Golubev's ordering is a way of ordering values in binary presentation. When ordering by this way Golubev's tree is used.

Golubev's tree is data structure of the following: every link contains two values which can be either pointers or naught values: if a link has a marking zero-value descender the first value points to the marking zero-value descender link and in another case is naught value, if a link has a marking one-value descender the second value points to that marking one-value descender and in another case is naught value and links are joined so that link-by-link paths link-by-link bit-by-bit represents bits presentation of values.

As a first step of Golubev's ordering values are to be put into Golubev's tree and then both link-by-link reading from the tree in zero-marking-descender-first depth-first order with hierarchically sharing prefixes among values automatically provides bit-by-bit presentations of values in increasing order and link-by-link reading from the tree in one-marking-descender-first depth-first order with hierarchically sharing prefixes among values automatically provides bit-by-bit presentations of values in decreasing order.

Arthur Golubev (Arthur Golubev 1985) first time published code which demonstrates idea of this ordering in 2025-02-26 in public repository services github.com (https://github.com/ArthurGolubev1985/FastOrderingIdeaDemo), codeberg.org (https://codeberg.org/ArthurGolubev1985/FastOrderingIdeaDemo) ang gitflic.ru (https://gitflic.ru/project/arturische/fastorderingideademo).

References