MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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
Year range
→
Sort
Language
Type
Field
Venue
Topic
Optimization and Packing Problems
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.

349 results · 1 filter active ·
Categories
Machine labels · sparse coverage
Evidence
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
349 works in the cohort · of 4,299,418page 3 of 7

Labels cover 0 of 349 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 349 of 349 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Bound constraints for Point Packing in a Square
2011· article· en· Cologne Twente Workshop on Graphs and Combinatorial Optimization· Engineering
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Evolving Point Packings in the Plane
2015· book-chapter· en· Lecture notes in computer science· Engineering
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Dyadic Packing of Dijoins
2025· article· es· SIAM Journal on Discrete Mathematics· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Chains-into-bins processes
2011· article· en· Journal of Discrete Algorithms· Engineering
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Split cuts from sparse disjunctions
2020· article· en· Mathematical Programming Computation· Engineering
distilled prediction:candidate · noneconsensus · none
3
citations
fundno affunlabeled
Worst-case analysis for new online bin packing problems
2013· article· en· PORTO Publications Open Repository TOrino (Politecnico di Torino)· Engineering
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About