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
Proceedings of the International Symposium on Combinatorial Search
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.

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

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

affunlabeled
Searching with a Corrupted Heuristic
Levi H. S. Lelis, Richard Valenzano, Gabriel L. Nazar, Roni Stern
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Core Expansion in Optimization Crosswords
Adi Botea, Vadim Bulitko
2023· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
On the Properties of All-Pair Heuristics
Shahaf Shperberg, Ariel Felner, Lior Siag, Nathan Sturtevant
2024· article· en· Proceedings of the International Symposium on Combinatorial Search· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
A Guide to Budgeted Tree Search
Nathan Sturtevant, Malte Helmert
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
The Spurious Path Problem in Abstraction
Gaojian Fan, Robert C. Holte
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
SoCS 2010 Organization
Ariel Felner, Nathan Sturtevant
2010· article· en· Proceedings of the International Symposium on Combinatorial Search· Engineering
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Invited Speakers
J. Christopher Beck, Gene Cooperman
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
afffundunlabeled
Position Paper: On the Impact of Direction-Selection in BAE*
Shahaf Shperberg, Lior Siag, Nathan Sturtevant, Ariel Felner
2025· article· en· Proceedings of the International Symposium on Combinatorial Search· Decision Sciences
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Avoiding Re-Expansions in Suboptimal Best-First Search
Jingwei Chen, Nathan Sturtevant
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Preface
Ariel Felner, Nathan Sturtevant
2010· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
SoCS 2014 Organization
Stefan Edelkamp, Roman Barták
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Decision Sciences
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
aboutno affunlabeled
Preface
Daniel Borrajo, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml +1 more
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
State-Set Search
Bo Pang, Robert C. Holte
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Frontmatter
Maxim Likhachev, Hana Rudová, Enrico Scala
2025· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
fundno affunlabeled
SoCS 2013 Organization
Malte Helmert, Gabriele Röger
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Business, Management and Accounting
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
afffundunlabeled
Augmenting Exploration with Locally Greedy Probes
Dawson Tomasz, Richard Valenzano
2025· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
The Bench Transition System and Stochastic Exploration
Dawson Tomasz, Richard Valenzano
2024· article· en· Proceedings of the International Symposium on Combinatorial Search· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Alternative Forms of Bounded Suboptimal Search
Richard Valenzano, Shahab Jabbari Arfaee, Jordan Thayer, Roni Stern
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About