Bibliographic record
Abstract
This Special Issue, entitled Algebraic Combinatorics and Applications, of the Journal of Algebra,Combinatorics, Discrete Structures, and Applications, contains selected papers submitted by conferenceparticipants at the "Algebraic Combinatorics and Applications: The First Annual Kliakhandler Conference",Houghton, Michigan, USA, August 26 - 30, 2015, as well as two additional papers submitted inresponse to our call for papers.The conference took place on the campus of Michigan Technological University, and was attendedby 43 researchers and graduate and postdoctoral students from USA, Canada, Croatia, Japan, SouthAfrica, and Turkey. Funding for the conference was provided by a generous gift of Igor Kliakhandler,and a grant from the National Science Foundation. The conference brought together researchers andstudents interested in combinatorics and its applications, to learn about the latest developments, andexplore different visions for future work and collaborations. Over thirty talks were presented on varioustopics from combinatorial designs, graphs, finite geometry, and their applications to error-correctingcodes, network coding, information security, quantum computing, DNA codes, mobile communications,and tournament scheduling.The current Special Issue contains papers on covering arrays and their applications, group divisibledesigns, automorphism groups of combinatorial designs, covering number of permutation groups, tournaments,large sets of geometric designs, partitions, quasi-symmetric functions, resolvable Steiner systems,and weak isometries of Hamming spaces.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.021 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.006 | 0.005 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.006 | 0.007 |
| Insufficient payload (model declined to judge) | 0.147 | 0.084 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".