Improved Trust Establishment Performance with Transaction-based Preprocessing
Bibliographic record
Abstract
In Multi-Agent Systems, trustees can utilize trust establishment models to help improve their trust with trustors in the environment. This improved trust helps to improve the quality of interactions in the environment and increases the viability of a trustee as an interaction partner. To help current and future trust establishment models become more modular to adapt to changes brought by future research and to introduce a method to allow for improved performance, a generalized trust establishment model architecture is presented. The proposed Generalized Trust Establishment Model is a simplistic model which illustrates how the generalized architecture can be used to design a competent trust establishment model. This model uses the architecture’s newly proposed transaction-level preprocessing module to achieve strong simulation results. This preprocessing module allows a model to fine-tune the amount of resources that will be given to trustors before the transactions occur to help more accurately meet the needs of trustors. Using the preprocessing module, the proposed model better meets a trustor’s needs and achieves a higher average trust in the environment faster than when the pre- processing is not performed. This exhibits that preprocessing is an important technique that can be used by any trust establishment model to improve the models performance.
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.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 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".