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
Journal of Discrete Algorithms
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.

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

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

affno abstractunlabeled
Broadcasting in geometric radio networks
2006· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
64
citations
affno abstractunlabeled
Strictly chordal graphs are leaf powers
2005· article· en· Journal of Discrete Algorithms· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
The strength of weak proximity
2006· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Algorithms for optimal outlier removal
2009· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Counting distance permutations
2008· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
String matching with alphabet sampling
2010· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
The three squares lemma revisited
2011· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Indexing hypertext
2012· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Utilitarian resource assignment
2005· article· en· Journal of Discrete Algorithms· Decision Sciences
distilled prediction:candidate · insufficient_payloadconsensus · none
16
citations
affno abstractunlabeled
More results on overlapping squares
2012· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Generating simple convex Venn diagrams
2012· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
The complexity of string partitioning
2014· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Quasi-cyclic codes over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">F</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math> and enumeration of defining polynomials
2012· article· lv· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+research_integrity+insufficient_payloadconsensus · none
8
citations
next →

How this was built: Screen · Findings · About