MétaCan
Menu
Back to cohort
Record W1989598883 · doi:10.1108/02686900310474307

Assurance and e‐auctions: are the existing business models still relevant?

2003· article· en· W1989598883 on OpenAlexaff
Jagdish Pathak

Bibliographic record

VenueManagerial Auditing Journal · 2003
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsComputer scienceCommon value auctionCorrectnessComputer securityBusiness processAuditContext (archaeology)Transaction processingThe InternetBusiness modelProcess managementProcess (computing)Separation of dutiesConsumer-to-businessSecurity controlsDatabase transactionControl (management)BusinessAccess controlDatabaseWorld Wide WebMarketingAccountingEconomics

Abstract

fetched live from OpenAlex

The security of e‐commerce is a serious concern of all the major players in the digital business arena who rely heavily on distributed processing in their routine daily operational chores. The security breaches and the related frauds have cost billions of dollars to the businesses and the industries as a whole and consumers suffer also. It is possible that business models of transaction processing that are viable in conventional commerce might be wrong abinitio in the context of digital business. There is a growing need for robust tools and equally rigorous auditable methodologies in the design and verification of the correctness of the digital processing systems that operate over the Internet. This paper focuses on the economic reasoning of business process design. The author has decided to develop a secure online auction protocol as an attempt to apply the design of mechanism reasoning framework in the direction of information systems audit and control of e‐commerce.

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.016
metaresearch head score (Gemma)0.039
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.016
Threshold uncertainty score0.087

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0160.039
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0020.018
Scholarly communication0.0140.037
Open science0.0030.003
Research integrity0.0060.008
Insufficient payload (model declined to judge)0.0050.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.110
GPT teacher head0.340
Teacher spread0.230 · 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

Citations4
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueManagerial Auditing JournalSame topicAuction Theory and ApplicationsFrench-language works237,207