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
Advanced Queuing Theory Analysis
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.

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

Labels cover 1 of 777 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 777 of 777 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.

afffundno abstractunlabeled
Vacation models in discrete time
Attahiru Sule Alfa
2003· article· en· Queueing Systems· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
55
citations
afffundunlabeled
<i>M/M/c</i> Queue with Two Priority Classes
Jianfu Wang, Opher Baron, Alan Scheller‐Wolf
2015· article· en· Operations Research· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
53
citations
affno abstractunlabeled
The erlangization method for Markovian fluid flows
V. Ramaswami, Douglas G. Woolford, David A. Stanford
2008· article· en· Annals of Operations Research· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
51
citations
afffundno abstractunlabeled
A MAP/G/1 Queue with Negative Customers
Quan‐Lin Li, Yiqiang Q. Zhao
2004· article· en· Queueing Systems· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
50
citations
affunlabeled
Queueing Models of Case Managers
Fernanda Campello, Ármann Ingólfsson, Robert A. Shumsky
2016· article· en· Management Science· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
50
citations
afffundaboutunlabeled
Modeling Security-Check Queues
Zhe George Zhang, Hsing Luh, Chia‐Hung Wang
2011· article· en· Management Science· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
State-dependent M/G/1 queueing systems
Hossein Abouee‐Mehrizi, Opher Baron
2015· article· en· Queueing Systems· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
49
citations
affunlabeled
Cutting in Line: Social Norms in Queues
Gad Allon, Eran Hanany
2011· article· en· Management Science· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
48
citations
afffundunlabeled
Modeling and Simulation of Call Centers
Athanassios N. Avramidis, Pierre L’Ecuyer
2006· article· en· Proceedings of the Winter Simulation Conference, 2005.· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
45
citations
affunlabeled
Modeling and simulation of call centers
Athanassios N. Avramidis, Pierre L’Ecuyer
2005· article· en· Winter Simulation Conference· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Compensating for Failures with Flexible Servers
Sigrún Andradóttir, Hayriye Ayhan, Douglas G. Down
2007· article· en· Operations Research· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
Discrete-time <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si53.gif" display="inline" overflow="scroll"><mml:msup><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>Geo</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msup><mml:mo>/</mml:mo><mml:msup><mml:mrow><mml:mi>G</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>/</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mi>N</mml:mi></mml:math> queues with single and multiple vacations
S. K. Samanta, M. L. Chaudhry, Umesh Gupta
2006· article· lv· Mathematical and Computer Modelling· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
35
citations
afffundunlabeled
Bridges and networks: Exact asymptotics
Robert D. Foley, David McDonald
2005· article· en· The Annals of Applied Probability· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Mean Waiting Time Approximations in the G/G/1 Queue
David L. Jagerman, Barış Balciog̃lu, Tayfur Altıok, Benjamin Melamed
2004· article· en· Queueing Systems· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
33
citations
← previousnext →

How this was built: Screen · Findings · About