MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
Advances in Computer Games
Topic
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

6 results · 1 filter active ·
Results by year
20042004
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
6 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 6 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 6 of 6 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Building the Checkers 10-Piece Endgame Databases
Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Robert W. Lake, P. Lu, Steve Sutphen
2004· book-chapter· en· Advances in Computer Games· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
Solving the Oshi-Zumo Game
Michael Buro
2004· book-chapter· en· Advances in Computer Games· Decision Sciences
machine prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
Solving 7×7 Hex: Virtual Connections and Game-State Reduction
Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck
2004· book-chapter· en· Advances in Computer Games· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Search and Knowledge in Lines of Action
Darse Billings, Yngvi Björnsson
2004· book-chapter· en· Advances in Computer Games· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Evaluation Function Tuning via Ordinal Correlation
Dave Gomboc, T.A. Marsland, Michael Buro
2004· book-chapter· en· Advances in Computer Games· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About