MétaCan
Menu
Back to cohort

Reputation-Based Trust Assessment of Transacting Service Components

2023· article· en· W4385489151 on OpenAlexaff
Konstantinos Tsiounis, Kostas Kontogiannis

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldSocial Sciences
TopicAccess Control and Trust
Canadian institutionsWestern University
Fundersnot available
KeywordsReputationComputer scienceService (business)BusinessInternet privacyComputer securityMarketing

Abstract

fetched live from OpenAlex

We witness a paradigm shift where entities such as software applications, people, businesses and service providers increasingly interact in virtual rather than physical environments, such as social media, social commerce, and the metaverses. A key issue that emerges in such environments is how one entity can trust another. Here, the concept of trust is considered as a meta-requirement, that is, the level of belief a service requestor has that a service provider will provide the service in a way that meets the requestor’s expectations. We refer to the service offering entities as service providers (SPs) and the service requesting entities as service clients (SCs). In this paper, we propose a technique that allows for evaluating trust and assigning reputation to various service providers by considering first their ability to fulfill their clients’ expectations or policies, and second the reputation other service clients have, when acting as recommenders for the aforementioned service providers. In this work, service clients and service providers are considered as virtual entities that coordinate with each other, and may include physical users, avatars, micro-services, software agents, smart contracts or any other distributed inter-networked resource, without making any assumptions as to what a service client or a service provider entity is as long as it participates in an interaction.

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 imitation

Not 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.

metaresearch head score (Codex)0.013
metaresearch head score (Gemma)0.052
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.014
Threshold uncertainty score0.066

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0130.052
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0030.002
Science and technology studies0.0020.002
Scholarly communication0.0060.006
Open science0.0030.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.057
GPT teacher head0.379
Teacher spread0.322 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAccess Control and TrustFrench-language works237,207