MétaCan
Menu
Back to cohort
Record W2117913134 · doi:10.1109/cibcb.2009.4925708

Using diffusion characters for the taxonomy of self-organizing social networks

2009· article· en· W2117913134 on OpenAlexaff
Daniel Ashlock, Colin Lee

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldSocial Sciences
TopicEvolutionary Game Theory and Cooperation
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsTaxonomy (biology)DilemmaComputer scienceIterated functionArtificial intelligencePrisoner's dilemmaSocial network (sociolinguistics)Theoretical computer scienceMachine learningMathematicsWorld Wide WebSocial media

Abstract

fetched live from OpenAlex

This study evolves agents to play iterated prisoners dilemma with choice and refusal. The choice and refusal mechanism causes the agents to self-organize social networks. We then apply a novel technique for inducing a pseudometric on the space of networks using diffusion characters to analyze the resulting social networks, and create an exploratory taxonomy of the social networks. The taxonomy agrees well with features visible in rendered drawing of the networks as well as with similarities in the fitness trajectories of the populations that give rise to those networks.

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.002
metaresearch head score (Gemma)0.008
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.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.008
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0030.003
Science and technology studies0.0020.003
Scholarly communication0.0030.006
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.055
GPT teacher head0.301
Teacher spread0.245 · 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

Citations2
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicEvolutionary Game Theory and CooperationFrench-language works237,207