Bibliographic record
Abstract
Approximation algorithm and limits of approximation is one of the major topics in algorithms, complexity theory, and computer science in general. The area uses multiple algorithmic techniques such as Semidefinite Programming (SDP), as well as advanced tools of proving inapproximabily, one of the most important of which is the PCP Theorem. The overall goal is, of course, to determine the best attainable approximability ration and provide an algorithm capable of achieving this ratio. Unconditional inapproximability results are generally very difficult, which prompted the use of the Unique Games Conjecture (UGC) introduced by S.Khot that posits the inapproxibality of a certain basic problem. The UGC, as well as the majority of the problems researchers are focusing on can be formulated withing the general framework of the Constraint Satisfaction Problem (CSP).
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.002 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.008 | 0.009 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.002 | 0.007 |
| Insufficient payload (model declined to judge) | 0.051 | 0.016 |
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".