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 8 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
A Meeting Scheduling Problem Respecting Time and Space
Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Bias in algorithm portfolio performance evaluation
C. Cameron, Holger H. Hoos, Kevin Leyton‐Brown
2016· article· en· International Joint Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
3
citations
affunlabeled
SOLVING INCREMENTAL SATISFIABILITY
Malek Mouhoub, Samira Sadaoui
2007· article· en· International Journal of Artificial Intelligence Tools· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Managing Conditional and Composite CSPs
Malek Mouhoub, Amrudee Sukpan
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Exploiting Entropy in Constraint Programming
Auguste Burlats, Gilles Pesant
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
afffundunlabeled
An intelligent basis for design
Thomas Calvert, John Dickinson, John C. Dill, W.S. Havens, J. D. Jones, Lyn Bartram
2002· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Abstraction de réseaux de contraintes
Sylvain Merchez, Christophe Lecoutre, Frédéric Boussemart
2006· article· fr· Revue d intelligence artificielle· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
3
citations
affno abstractunlabeled
The Confidence Constraint: A Step Towards Stochastic CP Solvers
Alexandre Mercier-Aubin, Ludwig Dumetz, Jonathan Gaudreault, Claude-Guy Quimper
2020· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
3
citations
affno abstractunlabeled
Representation by Graphs
David B. Skillicorn
2012· book-chapter· en· SpringerBriefs in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundunlabeled
Core Expansion in Optimization Crosswords
Adi Botea, Vadim Bulitko
2023· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Formal Description Techniques for CSPs and TCSPs.
Malek Mouhoub, Samira Sadaoui, Amrudee Sukpan
2004· article· en· Software Engineering and Knowledge Engineering· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Constraint Metrics for Local Search
Finnegan Southey
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
The SoftCumulative Constraint with Quadratic Penalty
Yanick Ouellet, Claude-Guy Quimper
2022· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Modeling, Global Constraints, and Decomposition
J. Christopher Beck
2013· article· en· Symposium on Abstraction, Reformulation and Approximation· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Constraint propagation as information maximization
Areski Nait Abdallah, M. H. van Emden
2013· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations

How this was built: Screen · Findings · About