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
Topic
Constraint Satisfaction and Optimization
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.

698 results · 1 filter active ·
Results by year
20002025
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.
698 works in the cohort · of 4,299,418page 4 of 14

Labels cover 0 of 698 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 698 of 698 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
Conditional and composite temporal CSPs
Malek Mouhoub, Amrudee Sukpan
2010· article· en· Applied Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Characterizing temporal repetition
Diana Cukierman, James P. Delgrande
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Structure Detection in Mixed-Integer Programs
Taghi Khaniyev, Samir Elhedhli, Fatih Safa Erenay
2018· article· en· INFORMS journal on computing· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
afffundunlabeled
The ICON Challenge on Algorithm Selection
Lars Kotthoff, Barry Hurley, Barry O’Sullivan
2017· article· en· AI Magazine· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
afffundno abstractunlabeled
Centrality-Based Improvements to CDCL Heuristics
Sima Jamali, David G. M. Mitchell
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
On sharp transitions in making squares
Ernie Croot, Andrew Granville, Robin Pemantle, Prasad Tetali
2012· article· en· Annals of Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Propagating Conjunctions of AllDifferent Constraints
Christian Bessière, George Katsirelos, Nina Narodytska, Claude-Guy Quimper, Toby Walsh
2010· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
Optimal-Generation Variants of EPEA*
Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Robert C. Holte, Jonathan Schaeffer
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundvenueunlabeled
Toward Self-Generalizing Objects and On-the-Fly Map Generalization
Mamane Nouri Sabo, Yvan Bédard, Bernard Moulin, Éveline Bernier
2008· article· en· Cartographica The International Journal for Geographic Information and Geovisualization· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Improving Bidirectional Heuristic Search by Bounds Propagation
Shahaf Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan Sturtevant, Avi Hayoun
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Symmetric component caching
Matthew Kitching, Fahiem Bacchus
2007· article· en· International Joint Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations

How this was built: Screen · Findings · About