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

892 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.
892 works in the cohort · of 4,299,418page 18 of 18

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

fundno affunlabeled
Fast Deterministic Rendezvous in Labeled Lines
Avery Miller, Andrzej Pelc
2023· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
fundno affunlabeled
Approximation Algorithms for Flexible Graph Connectivity
Sylvia Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
2021· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Mechanism Design for Online Resource Allocation
Xiaoqi Tan, Bo Sun, Alberto Leon‐Garcia, Yuan Wu, Danny H. K. Tsang
2020· article· en· ACM SIGMETRICS Performance Evaluation Review· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On the Fault-Tolerant Online Bin Packing Problem
Shahin Kamali, Pooya Nikbakht
2021· preprint· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
0
citations
affunlabeled
Cognitive intelligent personal assistants / agents
Hausi Müller, Norha M. Villegas, Ulrike Stege, Yu Zhao
2017· article· en· Computer Science and Software Engineering· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
0
citations
affno abstractunlabeled
Explorable Families of Graphs
Andrzej Pelc
2018· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
afffundunlabeled
Scheduling Problems over Network of Machines
Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour +2 more
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Variable Neighborhood Search with Dynamic Exploration for the Set Union Knapsack Problem
Igor Machado Coelho, Saïd Hanafi, Raca Todosijević, Mustapha Ratli, Bernard Gendron
2024· book-chapter· en· International series in management science/operations research/International series in operations research & management science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · sts+scholarly_communication
0
citations
affno abstractunlabeled
Models for Network Flow and Network Design Problems with Piecewise Linear Costs
Bernard Fortz, Bernard Gendron, Luı́s Gouveia
2024· book-chapter· en· International series in management science/operations research/International series in operations research & management science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · sts
0
citations
affno abstractunlabeled
On the Computational Power of Energy-Constrained Mobile Robots
Koichi Wada, Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro
2024· preprint· en· SSRN Electronic Journal· Computer Science
distilled prediction:candidate · research_integrityconsensus · none
0
citations
fundno affunlabeled
Efficient Caching with Reserves via Marking
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
2023· preprint· en· London School of Economics and Political Science Research Online (London School of Economics and Political Science)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · none
0
citations
afffundunlabeled
Competitive local routing with constraints
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2016· article· en· University of Southern Denmark Research Portal (University of Southern Denmark)· Computer Science
distilled prediction:candidate · sts+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Applications of a special polynomial class of TSP
Jack Brimberg, Ephraim Korach, Mokhtar Amami
2005· article· en· Yugoslav journal of operations research· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On Online Self-Organizing Linear Search
2025· book-chapter· en· Communications in computer and information science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
2005
Marek Chrobák
2006· article· en· ACM SIGACT News· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
← previous

How this was built: Screen · Findings · About