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
Algorithmic operations research
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.

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

Labels cover 0 of 40 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 40 of 40 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.

venueno affunlabeled
Recoverable Robustness for Train Shunting Problems
Serafino Cicerone, Gianlorenzo D’Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2009· article· en· Algorithmic operations research· Engineering
machine prediction:candidate · noneconsensus · none
20
citations
venueno affunlabeled
Variants of Shortest Path Problems
Lara Turner
2011· article· en· Algorithmic operations research· Engineering
machine prediction:candidate · noneconsensus · none
17
citations
venueno affunlabeled
Complementarity Problems And Positive Definite Matrices
P. Bhimashankaram, T. Parthasarathy, A. L. N. Murthy, G. S. R. Murthy
2012· article· en· Algorithmic operations research· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
K 3,3 Minors and the Maximum-Flow Problem
Donald K. Wagner
2008· article· en· Algorithmic operations research· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The alpha-reliable shortest path problem.
Francesca Guerriero, Patrizia Beraldi
2008· article· en· Algorithmic operations research· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Reductions for the stable set problem
Edward C. Sewell, Sheldon H. Jacobson, Hemanshu Kaul
2011· article· en· Algorithmic operations research· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Optimization in 2 m 3 n Factorial Experiments
G. S. R. Murthy, D.K. Manna
2012· article· en· Algorithmic operations research· Decision Sciences
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
The α-reliable shortest path problem
Francesca Guerriero, Patrizia Beraldi
2008· article· en· Algorithmic operations research· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Probabilistic optimization in graph-problems
Cécile Murat, Vangélis Th. Paschos
2010· article· en· Algorithmic operations research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Santosh Narayan Kabadi 1956-2010
R. Chandrasekaran
2010· article· en· Algorithmic operations research· Social Sciences
machine prediction:candidate · noneconsensus · none
0
citations
affvenueunlabeled
The AID Method for Global Optimization
Mahamed G. H. Omran, Fred Glover
2011· article· en· Algorithmic operations research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Nachruf. Zum Tode von Winfried Brugger
Stephan Kirste
2011· article· de· Algorithmic operations research· Social Sciences
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Nachruf. Zum Tode von Gerd Roelcke
Stephan Kirste
2012· article· de· Algorithmic operations research· Arts and Humanities
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Robust Selling Times in Adaptive Portfolio Management
Michael Dziecichowicz, Aurélie Thiele
2009· article· en· Algorithmic operations research· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Simplex Adjacency Graphs in Linear Optimization
Gerard Sierksma, Gert A. Tijssen
2006· article· en· Algorithmic operations research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About