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
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 ·
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.
349 works in the cohort · of 4,299,418page 2 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. 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
Smart-Grid Electricity Allocation via Strip Packing with Slicing
Soroush Alamdari, Thérèse Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav +2 more
2013· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
The <i>k</i>‐piece packing problem
David Hartvigsen, Pavol Hell, Jácint Szabó
2006· article· en· Journal of Graph Theory· Engineering
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Heuristics for the mixed swapping problem
Charles Bordenave, Michel Gendreau
2009· article· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
17
citations
venueno affunlabeled
Variants of Shortest Path Problems
Lara Turner
2011· article· en· Algorithmic operations research· Engineering
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Approximability of Packing Disjoint Cycles
Zachary Friggstad, Mohammad R. Salavatipour
2007· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
On Convexified Packing and Entropy Duality
Shiri Artstein, Vitali Milman, Stanisław J. Szarek, Nicole Tomczak-Jaegermann
2004· article· en· Geometric and Functional Analysis· Engineering
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
The PrePack Optimization Problem
Maxim Hoskins, Renaud Masson, Gabrielle Gauthier Melançon, Jorge E. Mendoza, Christophe Meyer, Louis-Martin Rousseau
2014· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Integral simplex using decomposition with primal cutting planes
Samuel Rosat, Issmail Elhallaoui, François Soumis, Andrea Lodi
2017· article· en· Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)· Engineering
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Static symmetry breaking in circle packing
Alberto Costa, Pierre Hansen, Leo Liberti
2010· article· en· Cologne Twente Workshop on Graphs and Combinatorial Optimization· Engineering
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Evaluation of Offset Assignment Heuristics
Johnny Huynh, José Nelson Amaral, Paul Berube, Sid‐Ahmed‐Ali Touati
2007· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Quadratic bottleneck knapsack problems
Ruonan Zhang, Abraham P. Punnen
2011· article· fr· Journal of Heuristics· Engineering
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
An approximation algorithm for the subpath planning problem
Masoud Safilian, S. Mehdi Hashemi, Sepehr Eghbali, Aliakbar Safilian
2016· article· en· International Joint Conference on Artificial Intelligence· Engineering
machine prediction:candidate · noneconsensus · none
6
citations

How this was built: Screen · Findings · About