Bibliographic record
Abstract
Abstract — Researchers have been attracted for years to studies on solving imprecise problems. The first step for solving an imprecise problem is to clarify the problem itself. However, in many of cases, the impreciseness of a problem is due to its own nature and often leaves them unsolvable. There are at least two reasons for the impreciseness and unclearness of a problem. The first reason is that there may not be a suitable language to present the problem in an understandable and clear way. The second reason is that the problem itself is not well-definable. This is quite similar to a research question that a researcher is trying to specify. A problem may only be fully understood and specified after all solutions are available. In this paper, we introduce a problem solving approach by searching possible solutions to an imprecise problem. This is an approach to specify and solve an imprecise problem by matching the problem with its solutions. We present a Solution-To-Problem (STP) model as a new approach for imprecise problem solving. Basic notions, measures and algorithms for such a problem solving process are studied. I.
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.005 | 0.022 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.003 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.005 | 0.009 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.003 | 0.005 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
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".