Adapting REST To REAST, Building Smarter Interactions for Personal Web Tasking
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
REpresentational State Transfer (REST) today represents and transfers the data-states of distrib-uted resources. Through hypermedia-based inter-actions among these representations and transfers, the web's original goal of information retrieval is accomplished. However, despite of the fact that the web today has evolved beyond information retrieval into task executions, the original web interaction model built for information browsing has not been enhanced accordingly. This paper proposes a hypermedia-based RESTful model for task expression, delegation and execution through the representations and transfers of action-states of distributed resources, termed as REpresentational Action State Transfer (REAST). The con-tributions of this paper are (1) a representation of hypermedia-based task expressions that enables the building of user-controlled interactive apps, (2) a technique for Resource Oriented Web Auto-mation (ROWA) using a dedicated media type designed for machine processing as well as ma-chine-initiated and machine-executed task expressions within the RESTful HATEOAS constraints, (3) REST-based Resource Oriented Intelligent Agents (ROIA) to act on users' behalf across the web without domain-specificity, and (4) an in-teroperability model for tasks execution involving diversified resources types (e.g., enterprise re-sources and internet of things) working seamlessly together within the RESTful architecture.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
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 it