% refs_sel.bib : references of sel_draft_v0.tex (internal draft). Entries copied from paper/refs.bib keep their xnote;
% the others were checked in the selection literature checks (lit_selection/candidates.tsv) unless an xnote says "verify".

@article{Alek69,
  author  = {Alekseev, V. E.},
  title   = {Sorting algorithms with minimum memory},
  journal = {Kibernetika},
  volume  = {5},
  number  = {5},
  year    = {1969},
  pages   = {99--103},
  note    = {English translation: Cybernetics 5 (1969), 642--648},
  doi     = {10.1007/BF01267888},
  xnote   = {pp. 642-643 read (Springer preview); Section 4 (the bounds) not read}
}

@book{Knu98,
  author    = {Knuth, Donald E.},
  title     = {The Art of Computer Programming, Vol.~3: Sorting and Searching},
  edition   = {2nd},
  publisher = {Addison-Wesley},
  address   = {Reading, MA},
  year      = {1998}
}

@misc{KnuErr,
  author       = {Knuth, Donald E.},
  title        = {Errata for {The Art of Computer Programming}, Vol.~3, second edition},
  howpublished = {\url{https://www-cs-faculty.stanford.edu/~knuth/taocp.html}},
  note         = {Entries of 12 September 2003: replacement of exercise 5.3.4--20 and its answer},
  xnote        = {read from Wayback copies of all3-prepre.ps.gz (lit_selection/raw/step/wayback/); page images checked; verify the exact file name and URL before release}
}

@inproceedings{Yao74,
  author    = {Yao, Andrew C.},
  title     = {Bounds on selection networks},
  booktitle = {15th Annual Symposium on Switching and Automata Theory},
  year      = {1974},
  pages     = {110--116},
  doi       = {10.1109/SWAT.1974.6},
  xnote     = {abstract only}
}

@phdthesis{Yao75,
  author = {Yao, Andrew Chi-Chih},
  title  = {A Study of Concrete Computational Complexity},
  school = {University of Illinois at Urbana-Champaign},
  year   = {1975},
  note   = {Report UIUCDCS-R-75-716},
  xnote  = {full text read (archive.org studyofconcretec716yaoa); Thm 2.6, 2.7, Sec. 2.5 checked on page images}
}

@article{Yao80,
  author  = {Yao, Andrew C.},
  title   = {Bounds on selection networks},
  journal = {SIAM J. Comput.},
  volume  = {9},
  number  = {3},
  year    = {1980},
  pages   = {566--582},
  doi     = {10.1137/0209043},
  xnote   = {abstract only; theorem numbers of the journal version not checked}
}

@article{Pip91,
  author  = {Pippenger, Nicholas},
  title   = {Selection networks},
  journal = {SIAM J. Comput.},
  volume  = {20},
  number  = {5},
  year    = {1991},
  pages   = {878--887},
  doi     = {10.1137/0220054}
}

@article{JM96,
  author  = {Jimbo, Shuji and Maruoka, Akira},
  title   = {A method of constructing selection networks with {$O(\log n)$} depth},
  journal = {SIAM J. Comput.},
  volume  = {25},
  number  = {4},
  year    = {1996},
  doi     = {10.1137/S0097539793248329},
  xnote   = {pages not verified}
}

@article{QTK25,
  author  = {Qu, Yicheng and Tasbihi, Amir and Kschischang, Frank R.},
  title   = {Constituent automorphism decoding of {Reed--Muller} codes},
  journal = {IEEE Trans. Commun.},
  year    = {2025},
  doi     = {10.1109/TCOMM.2025.3535882},
  note    = {arXiv:2409.03700},
  xnote   = {Sec. IV-C1, Fig. 4, Table II read in arXiv v1 (HTML); journal volume/pages not verified}
}

@inproceedings{CZ10,
  author    = {Codish, Michael and Zazon-Ivry, Moshe},
  title     = {Pairwise cardinality networks},
  booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-16)},
  series    = {Lecture Notes in Comput. Sci.},
  volume    = {6355},
  publisher = {Springer},
  year      = {2010},
  pages     = {154--172},
  doi       = {10.1007/978-3-642-17511-4_10},
  xnote     = {abstract only; verify pages}
}

@article{ANORC11,
  author  = {As{\'\i}n, Roberto and Nieuwenhuis, Robert and Oliveras, Albert and Rodr{\'\i}guez-Carbonell, Enric},
  title   = {Cardinality networks: a theoretical and empirical study},
  journal = {Constraints},
  volume  = {16},
  number  = {2},
  year    = {2011},
  doi     = {10.1007/s10601-010-9105-0},
  xnote   = {author copy read; pages not verified}
}

@inproceedings{KP15,
  author    = {Karpi{\'n}ski, Micha{\l} and Piotr{\'o}w, Marek},
  title     = {Smaller selection networks for cardinality constraints encoding},
  booktitle = {Principles and Practice of Constraint Programming (CP 2015)},
  series    = {Lecture Notes in Comput. Sci.},
  publisher = {Springer},
  year      = {2015},
  doi       = {10.1007/978-3-319-23219-5_16},
  note      = {arXiv:1502.04551},
  xnote     = {full text read (arXiv); LNCS volume and pages not verified}
}

@article{CCEMS,
  author  = {Codish, Michael and Cruz-Filipe, Lu{\'\i}s and Ehlers, Thorsten and M{\"u}ller, Mike and Schneider-Kamp, Peter},
  title   = {Sorting networks: to the end and back again},
  journal = {J. Comput. System Sci.},
  doi     = {10.1016/j.jcss.2016.04.004},
  note    = {arXiv:1507.01428},
  xnote   = {full text read; verify year, volume, pages}
}

@misc{Gre72,
  author       = {Green, Milton W.},
  title        = {Some improvements in non-adaptive sorting algorithms},
  howpublished = {Proc. 6th Annual Princeton Conference on Information Sciences and Systems, 1972, pp.~387--391},
  xnote        = {from secondary sources only; verify; the U_4 construction is known to us only through Knuth's answer}
}

@misc{Har22,
  author = {Harder, Jannis},
  title  = {An answer to the {Bose--Nelson} sorting problem for 11 and 12 channels},
  year   = {2022},
  howpublished = {arXiv:2012.04400v3 [cs.DS]},
  xnote   = {verified: REFS_VERIFY.md (7), v3 of 2022-07-24 is current, first posted 2020-12-08}
}

@misc{HarRepo,
  author = {Harder, Jannis},
  title  = {Lower size bounds for sorting networks},
  year   = {2020},
  howpublished = {source code, \url{https://github.com/jix/sortnetopt}, commit \texttt{0b5d09c}},
  xnote  = {base commit 0b5d09c47446096f9e3a0812b35afc72b7f2a718 confirmed (REFS_VERIFY.md item 6)}
}

@inproceedings{Lean4,
  author    = {de Moura, Leonardo and Ullrich, Sebastian},
  title     = {The {Lean}~4 theorem prover and programming language},
  booktitle = {Automated Deduction -- CADE 28},
  series    = {Lecture Notes in Comput. Sci.},
  volume    = {12699},
  publisher = {Springer},
  year      = {2021},
  pages     = {625--635},
  doi       = {10.1007/978-3-030-79876-5_37}
}

@misc{LTP,
  author       = {Tomar, Tejasvi Singh},
  title        = {Lead-pattern potentials and exact values of merging networks},
  howpublished = {Zenodo, version 5, \href{https://doi.org/10.5281/zenodo.23756850}{doi:10.5281/zenodo.23756850}},
  year         = {2026}
}

@misc{Supp,
  author       = {Tomar, Tejasvi Singh},
  title        = {Supplement to ``{E}xact sizes of networks that select the three or four largest of $n$ elements''},
  year         = {2026},
  howpublished = {Zenodo, \href{https://doi.org/\suppdoi}{doi:\suppdoi}},
  note         = {Checksum file \texttt{SHA256SUMS} with SHA-256 hash \texttt{\suppsums}\dots}
}

@misc{LeanRec,
  author       = {Tomar, Tejasvi Singh},
  title        = {{L}ean development for ``{E}xact sizes of networks that select the three or four largest of $n$ elements''},
  year         = {2026},
  howpublished = {Zenodo, \href{https://doi.org/\leandoi}{doi:\leandoi}}
}