{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":20,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":20,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"5b3be212440d","filters":{"venue":"DIMACS series in discrete mathematics and theoretical computer science"}},"results":[{"id":"W1531547509","doi":"10.1090/dimacs/055/09","title":"On computing the nearest neighbor interchange distance","year":2000,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"k-nearest neighbors algorithm; Computer science; Nearest neighbor search; Artificial intelligence","authors":[{"name":"Bhaskar Dasgupta","is_ca":false},{"name":"Xin He","is_ca":false},{"name":"Tao Jiang","is_ca":false},{"name":"Ming Li","is_ca":false},{"name":"John Tromp","is_ca":false},{"name":"Louxin Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009468099680436316,"gpt":0.2323020704692751,"spread":0.2228339707888388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002451414,0.001359771,0.002564995,0.003196978,0.00185081,0.002702356,0.004049787,0.002310342,0.005448278],"category_scores_gemma":[0.02197619,0.000572596,0.001448124,0.00553706,0.001657802,0.006934296,0.003891293,0.003549027,0.003471753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002227175,"about_ca_system_score_gemma":0.001912076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005006228,"about_ca_topic_score_gemma":0.00492171,"domain_scores_codex":[0.9939492,0.001266884,0.0003879458,0.001214188,0.002794185,0.0003876705],"domain_scores_gemma":[0.9933971,0.003235741,0.0005538224,0.001275245,0.001306429,0.0002316078],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007019392,0.0002946044,0.004186301,0.0004637281,0.0001938077,0.0002645256,0.0003831805,0.2611492,0.00410929,0.1486072,0.01711447,0.5625318],"study_design_scores_gemma":[0.00005295725,0.0001593573,0.0009052064,0.0000721754,0.0000384793,0.0004040016,0.0001607763,0.7538167,0.003014614,0.2280261,0.01327744,0.00007223021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02042662,0.002007984,0.9684257,0.0006733228,0.0002793773,0.0001427257,0.0005008386,0.0009498955,0.006593633],"genre_scores_gemma":[0.1691844,0.001550171,0.8198995,0.00061318,0.0003243654,0.0002957012,0.002603593,0.0003238197,0.005205316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005448278,"threshold_uncertainty_score":0.01822633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W105367266","doi":"10.1090/dimacs/069/13","title":"Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph","year":2007,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Graph theory and applications","field":"Mathematics","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Bounding overwatch; Variable (mathematics); Combinatorics; Graph; Mathematics; Computer science; Artificial intelligence; Mathematical analysis","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Hadrien Mélot","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03964920218428527,"gpt":0.3063905946128505,"spread":0.2667413924285653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004766324,0.0003704544,0.0007519553,0.0007563265,0.0005521102,0.001043471,0.001516751,0.001000462,0.01097222],"category_scores_gemma":[0.00423631,0.0003895402,0.0003364371,0.0008921951,0.0007432618,0.001735733,0.001056368,0.001510288,0.002280378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008584416,"about_ca_system_score_gemma":0.0003974515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009166953,"about_ca_topic_score_gemma":0.001886033,"domain_scores_codex":[0.9997044,0.00006386152,0.000009459951,0.00006384186,0.0001260254,0.00003249814],"domain_scores_gemma":[0.9989024,0.0007231098,0.00006032255,0.0001297349,0.0001257168,0.00005854411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001535002,0.00008038368,0.001142897,0.0004520037,0.0000634707,0.0001783807,0.0001712412,0.09471752,0.003579101,0.5950604,0.08617191,0.2182292],"study_design_scores_gemma":[0.00003175468,0.00006877764,0.0008924232,0.0001176037,0.00003232206,0.0003029586,0.00008017161,0.2617998,0.00335041,0.6739774,0.05932085,0.00002548931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06948449,0.02169933,0.6894992,0.005010208,0.001319208,0.0001288107,0.0008452251,0.00119127,0.2108223],"genre_scores_gemma":[0.5724429,0.009335271,0.2727707,0.000826407,0.001144564,0.0002232494,0.001960422,0.0009706182,0.1403258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01097222,"threshold_uncertainty_score":0.03670579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2579372702","doi":"10.1090/dimacs/061/10","title":"Flipping: A supertree construction method","year":2003,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Supertree; Computer science; Chemistry; Biochemistry","authors":[{"name":"D. Chen","is_ca":false},{"name":"Lixia Diao","is_ca":true},{"name":"Oliver Eulenstein","is_ca":false},{"name":"David Fernández‐Baca","is_ca":false},{"name":"Michael J. Sanderson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01212681984366686,"gpt":0.2587338422978282,"spread":0.2466070224541613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005890027,0.0006391841,0.0008266687,0.001327663,0.0009219684,0.0008910795,0.001862737,0.00101274,0.01607524],"category_scores_gemma":[0.0021902,0.0006246378,0.0009865994,0.001793153,0.0008538655,0.002231925,0.002657549,0.001563815,0.003307184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000372341,"about_ca_system_score_gemma":0.0007165198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008785086,"about_ca_topic_score_gemma":0.001862211,"domain_scores_codex":[0.9995778,0.00009327943,0.00002184652,0.0000940591,0.0001543671,0.00005877368],"domain_scores_gemma":[0.9989772,0.0003214509,0.00004141377,0.0003910623,0.0002074264,0.00006142176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001594534,0.0001027264,0.0004861632,0.0003566441,0.00003969441,0.0001736319,0.0003211431,0.03032702,0.01590224,0.1685237,0.0197229,0.7638847],"study_design_scores_gemma":[0.00007935701,0.0001123394,0.0004107549,0.00009941891,0.0000955007,0.0004581809,0.0001808509,0.5521047,0.01360478,0.3842197,0.04858815,0.00004629908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006314549,0.0001264774,0.9866005,0.00009327395,0.00007244784,0.00007056854,0.0001228181,0.0007455404,0.005853932],"genre_scores_gemma":[0.08112083,0.0002749781,0.9084998,0.0001450854,0.00006943822,0.0002022546,0.0006255506,0.0006906154,0.008371372],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01607524,"threshold_uncertainty_score":0.0537771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W118194434","doi":"10.1090/dimacs/067/10","title":"Zig-zag tool path generation for sculptured surface finishing","year":2005,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Advanced Surface Polishing Techniques","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Path (computing); Surface (topology); Tool path; Materials science; Computer science; Engineering drawing; Engineering; Mechanical engineering; Geometry; Mathematics; Operating system","authors":[{"name":"Debananda Misra","is_ca":false},{"name":"V. Sundararajan","is_ca":true},{"name":"Paul Wright","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01272073520751136,"gpt":0.2405924932477845,"spread":0.2278717580402732,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001301705,0.0004381705,0.0002179329,0.000431023,0.0002100775,0.0003810332,0.0008051425,0.0003783859,0.005769859],"category_scores_gemma":[0.0003581143,0.0002747576,0.0002870128,0.0004549426,0.0002588905,0.0004425961,0.0003952957,0.0005531465,0.001590515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002013936,"about_ca_system_score_gemma":0.000234128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005273459,"about_ca_topic_score_gemma":0.001123377,"domain_scores_codex":[0.9998993,0.000009064916,0.000004325329,0.0000222872,0.00005521356,0.000009860842],"domain_scores_gemma":[0.9998831,0.00004361338,0.000009410501,0.00002714144,0.00003061622,0.000006090339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001140411,0.00006775209,0.0004897005,0.0003441864,0.00002078996,0.0003071548,0.0002292819,0.1140925,0.1106106,0.03400348,0.009356929,0.7303635],"study_design_scores_gemma":[0.00005952251,0.0002004938,0.0006524361,0.0000619857,0.00002548533,0.0005957427,0.00006500923,0.7977126,0.1115335,0.03516395,0.05388644,0.00004286746],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01464415,0.000305597,0.973624,0.0000359777,0.00004015777,0.00007657542,0.000165177,0.002247899,0.008860535],"genre_scores_gemma":[0.1895343,0.00047538,0.794386,0.00002990395,0.00001142835,0.00008394572,0.0009311097,0.0005392183,0.01400873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005769859,"threshold_uncertainty_score":0.01930207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2573265953","doi":"10.1090/dimacs/069/12","title":"What forms do interesting conjectures have in graph theory?","year":2007,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Graph theory and applications","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Mathematics","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Mustapha Aouchiche","is_ca":false},{"name":"Gilles Caporossi","is_ca":false},{"name":"Hadrien Mélot","is_ca":false},{"name":"Dragan Stevanović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02904496289547472,"gpt":0.306054419543861,"spread":0.2770094566483863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006098935,0.0005403475,0.001150749,0.002324118,0.002988926,0.007737347,0.002097895,0.00418432,0.03887998],"category_scores_gemma":[0.05041967,0.0005266608,0.0005527583,0.002834776,0.007471605,0.02215938,0.002507814,0.004629641,0.007439748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002201995,"about_ca_system_score_gemma":0.001686933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006431708,"about_ca_topic_score_gemma":0.0009403828,"domain_scores_codex":[0.9961175,0.001447546,0.0001158626,0.0006117332,0.001483397,0.0002240101],"domain_scores_gemma":[0.9546115,0.0317582,0.002001879,0.004436424,0.005823822,0.001368147],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000520399,0.00006128694,0.0007972106,0.0004225102,0.00003007229,0.0001455861,0.0006304514,0.0009446719,0.000133907,0.7977828,0.1308683,0.06813119],"study_design_scores_gemma":[0.0000091894,0.000007366546,0.0001736239,0.0001138967,0.000006387202,0.00007384021,0.0002512498,0.0005762032,0.00006757258,0.9558333,0.04287849,0.00000889026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.03457232,0.0438986,0.03290385,0.3747556,0.01804468,0.00008978985,0.0008685038,0.0004736722,0.4943931],"genre_scores_gemma":[0.646107,0.04622046,0.02136699,0.02379237,0.04809885,0.0003085143,0.002023985,0.0007446641,0.2113372],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.03887998,"threshold_uncertainty_score":0.1300665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2607961321","doi":"10.1090/dimacs/069","title":"Graphs and Discovery","year":2007,"lang":"en","type":"book","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"History; Computer science; Geography","authors":[{"name":"Siemion Fajtlowicz","is_ca":false},{"name":"Patrick W. Fowler","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"M. F. Janowitz","is_ca":false},{"name":"Fred S. Roberts","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009241024057159654,"gpt":0.2428785634756622,"spread":0.2336375394185026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009796754,0.0008529993,0.001157606,0.003204476,0.001979746,0.005642545,0.001223259,0.001920317,0.01514271],"category_scores_gemma":[0.003218266,0.0006600429,0.0007936606,0.005357472,0.006731372,0.01218737,0.002482892,0.002855888,0.004428437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003145522,"about_ca_system_score_gemma":0.001443399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003591271,"about_ca_topic_score_gemma":0.003210833,"domain_scores_codex":[0.999113,0.0003057874,0.00004088418,0.0002182105,0.0002692369,0.00005280457],"domain_scores_gemma":[0.9987671,0.0006949716,0.00006493773,0.0002712567,0.0001416305,0.00006012119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003001575,0.000005383538,0.00003694683,0.00004728457,0.000005098845,0.00001322742,0.0001228647,0.0002809677,0.0000313335,0.9686772,0.01692625,0.01385034],"study_design_scores_gemma":[0.000001616225,0.00000110063,0.00002737522,0.00002639877,0.000002718827,0.0000339804,0.00004690131,0.0003567327,0.00003304523,0.9474689,0.05199849,0.000002724475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.00849608,0.1684792,0.1669976,0.04335681,0.004013746,0.0001078038,0.001143825,0.0008581923,0.6065468],"genre_scores_gemma":[0.3372993,0.1363992,0.1067093,0.01107015,0.006359718,0.000480669,0.002980995,0.0009702487,0.3977305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01514271,"threshold_uncertainty_score":0.05065739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2579550659","doi":"10.1090/dimacs/069/11","title":"How far is, should and could be conjecture-making in graph theory an automated process?","year":2007,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Process (computing); Conjecture; Graph; Graph theory; Mathematics; Theoretical computer science; Combinatorics; Programming language","authors":[{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02330091641513424,"gpt":0.295659915652048,"spread":0.2723589992369137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01123387,0.0007177852,0.001140768,0.001770936,0.003648206,0.007786543,0.003321654,0.003927671,0.01500587],"category_scores_gemma":[0.04895265,0.0007644534,0.001721434,0.002242826,0.01872266,0.03153361,0.002999049,0.007114904,0.004251679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002430632,"about_ca_system_score_gemma":0.002978232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002208352,"about_ca_topic_score_gemma":0.001728866,"domain_scores_codex":[0.9946062,0.003341801,0.0002387411,0.0006742313,0.0008298757,0.0003092074],"domain_scores_gemma":[0.9515603,0.03530817,0.001563459,0.007419548,0.003465821,0.0006827523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000203677,0.00003010312,0.0002511709,0.00008480718,0.00001837515,0.00002339243,0.0003969446,0.00107752,0.00005864341,0.9692457,0.009414483,0.01937855],"study_design_scores_gemma":[0.00000376727,0.00000194428,0.00002997591,0.00001665279,0.000003700769,0.0000088119,0.00009464727,0.001191046,0.00006264161,0.9952285,0.003354566,0.000003811699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03970628,0.004886181,0.5300739,0.2454956,0.003666716,0.0002082286,0.0007331113,0.001798266,0.1734316],"genre_scores_gemma":[0.7324427,0.003764451,0.2213243,0.00744117,0.003928567,0.0002405593,0.0007201212,0.0006699694,0.02946824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01500587,"threshold_uncertainty_score":0.05941105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2608174757","doi":"10.1090/dimacs/067","title":"Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing","year":2005,"lang":"en","type":"book","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Engineering drawing; Computer science; Engineering","authors":[{"name":"Ravi Janardan","is_ca":false},{"name":"Michiel Smid","is_ca":true},{"name":"Debasish Dutta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007173733932739998,"gpt":0.2042790193554292,"spread":0.1971052854226892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004133258,0.001601201,0.001358899,0.001597105,0.0006424806,0.002307347,0.001739797,0.00103362,0.01252525],"category_scores_gemma":[0.001362238,0.0009108971,0.0008083116,0.003130065,0.002669831,0.002351742,0.001013401,0.002140821,0.004075103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0010278,"about_ca_system_score_gemma":0.0008592866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001582933,"about_ca_topic_score_gemma":0.002031717,"domain_scores_codex":[0.9993543,0.0001062725,0.00002783973,0.0000684644,0.0004127633,0.00003033388],"domain_scores_gemma":[0.9995368,0.0002215451,0.00003065846,0.00009739922,0.0001005836,0.00001312535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001331108,0.00002389978,0.0001480592,0.00031933,0.00002253392,0.0000525665,0.00006870941,0.04474491,0.0008520535,0.7679607,0.02538105,0.1604129],"study_design_scores_gemma":[0.000008154653,0.00003071576,0.0004128315,0.0001115038,0.00001814668,0.0003013952,0.00004104645,0.08115609,0.0007253652,0.7252669,0.1919081,0.00001981206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00429824,0.04384078,0.6953538,0.002150693,0.001752368,0.00007494048,0.0002529221,0.0006561272,0.2516201],"genre_scores_gemma":[0.1711028,0.06524099,0.5606069,0.0008367436,0.003370813,0.0003582851,0.0009427709,0.0005129098,0.1970277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01252525,"threshold_uncertainty_score":0.04190117,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W584348562","doi":"10.1090/dimacs/075","title":"Modeling Paradigms and Analysis of Disease Transmission Models","year":2010,"lang":"en","type":"book","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Disease; Transmission (telecommunications); Medicine; Telecommunications","authors":[{"name":"Abba B. Gumel","is_ca":true},{"name":"Suzanne Lenhart","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01747800500188925,"gpt":0.2752609431465875,"spread":0.2577829381446983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447147,0.001560814,0.001002823,0.001458584,0.0005467406,0.002799675,0.001771737,0.001503984,0.005215819],"category_scores_gemma":[0.003683922,0.000479385,0.001452927,0.001501312,0.001211037,0.002988217,0.001727298,0.002915057,0.001691847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001863761,"about_ca_system_score_gemma":0.001055192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00169385,"about_ca_topic_score_gemma":0.001330349,"domain_scores_codex":[0.9990819,0.0003441689,0.00005502697,0.0001548796,0.0003033234,0.00006068296],"domain_scores_gemma":[0.9990317,0.0005567104,0.0001078949,0.0001146514,0.0001372176,0.00005190168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004241575,0.00002106611,0.0002032909,0.0001074297,0.0000444316,0.00007974269,0.0001227917,0.02023954,0.0002705374,0.9536183,0.010317,0.01497175],"study_design_scores_gemma":[0.000003585173,0.000008535676,0.0000938259,0.00003959422,0.00001180973,0.0001048569,0.00003481767,0.05169098,0.00006869237,0.9132577,0.03467624,0.000009390909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008048501,0.03169845,0.8281121,0.01142582,0.001993196,0.00008073689,0.0008355567,0.0003232686,0.1174822],"genre_scores_gemma":[0.4491163,0.08158402,0.3026022,0.004771008,0.006424397,0.0008469676,0.002336292,0.0005932954,0.1517254],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005215819,"threshold_uncertainty_score":0.01744866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2607827127","doi":"10.1090/dimacs/075/01","title":"Introduction to mathematical modeling of infectious diseases","year":2010,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"COVID-19 epidemiological studies","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","authors":[{"name":"Sourya Shrestha","is_ca":true},{"name":"James O. Lloyd‐Smith","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04145353288225818,"gpt":0.3261013245072224,"spread":0.2846477916249642,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007158591,0.001046807,0.0007699846,0.0009986103,0.0003976509,0.001381406,0.001250483,0.001495925,0.02031013],"category_scores_gemma":[0.001557998,0.0004453432,0.001013713,0.001272964,0.001037326,0.001821596,0.0008589799,0.003207419,0.005680322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001072236,"about_ca_system_score_gemma":0.0009263231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001927318,"about_ca_topic_score_gemma":0.001852283,"domain_scores_codex":[0.9997655,0.00006852707,0.00001696407,0.00004780549,0.00008593465,0.00001534537],"domain_scores_gemma":[0.9992419,0.0005138495,0.00004031964,0.00006393561,0.0001023398,0.00003766831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000081145,0.00003733849,0.0001860978,0.0002239762,0.00002142887,0.0000847698,0.0001410678,0.009668689,0.0004435139,0.8681799,0.07768038,0.04332466],"study_design_scores_gemma":[0.000005431828,0.00001738908,0.0002708585,0.0001252128,0.00001282201,0.0001927282,0.0000244287,0.01328033,0.00009899917,0.6728123,0.3131416,0.00001785633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002892855,0.08479041,0.6042215,0.02816388,0.00624257,0.0001156199,0.003635328,0.0009923717,0.2689455],"genre_scores_gemma":[0.1317899,0.1560098,0.3431068,0.01047818,0.01416904,0.0008169768,0.003069331,0.0006272327,0.3399328],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02031013,"threshold_uncertainty_score":0.06794417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2577195055","doi":"10.1090/dimacs/061/15","title":"Increasing phylogenetic accuracy with global congruence","year":2003,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Evolution and Paleontology Studies","field":"Earth and Planetary Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Congruence (geometry); Phylogenetic tree; Evolutionary biology; Mathematics; Psychology; Biology; Social psychology; Genetics","authors":[{"name":"Claudine Levasseur","is_ca":false},{"name":"François‐Joseph Lapointe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01015022959875532,"gpt":0.2278465778795377,"spread":0.2176963482807823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003902582,0.0004410061,0.001131448,0.00138984,0.001060274,0.002777681,0.001172226,0.00109056,0.009006573],"category_scores_gemma":[0.03719255,0.0005699296,0.0005259705,0.002371136,0.004615345,0.008613784,0.006051542,0.0025408,0.001057244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007911711,"about_ca_system_score_gemma":0.0004040073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002104273,"about_ca_topic_score_gemma":0.0003402298,"domain_scores_codex":[0.9968316,0.001070544,0.0001983465,0.0007212966,0.000862733,0.0003154842],"domain_scores_gemma":[0.9681254,0.01909621,0.001782974,0.008312693,0.001721977,0.0009607387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000145898,0.00004209056,0.004206039,0.0001181434,0.0000262758,0.0001369615,0.0008767922,0.008391909,0.004176689,0.9080948,0.00170075,0.07208368],"study_design_scores_gemma":[0.00003029486,0.00005205848,0.001788199,0.00002163603,0.00001903097,0.0001892949,0.0001220132,0.01029369,0.001727992,0.981876,0.003869992,0.000009873335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.4666645,0.001819237,0.3478919,0.004751668,0.0003810964,0.00008029459,0.0003728798,0.00080463,0.1772337],"genre_scores_gemma":[0.9694915,0.0003636305,0.02472023,0.0001990307,0.0002437168,0.00004899826,0.0000838932,0.0001838119,0.004665027],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.009006573,"threshold_uncertainty_score":0.03012997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2573862310","doi":"10.1090/dimacs/067/12","title":"The exact rational univariate representation for detecting degeneracies","year":2005,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Structural Health Monitoring Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Univariate; Representation (politics); Computer science; Mathematics; Statistics; Multivariate statistics; Political science","authors":[{"name":"John Keyser","is_ca":false},{"name":"Koji Ōuchi","is_ca":true},{"name":"Jose I. Rojas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01824440201206458,"gpt":0.2854292105186446,"spread":0.2671848085065801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001349097,0.0006537405,0.0007525893,0.001834059,0.0004158326,0.001703139,0.001029046,0.0008744947,0.004079166],"category_scores_gemma":[0.006753579,0.000345878,0.0004671207,0.00145213,0.001592202,0.003563511,0.001657833,0.001706569,0.0007993985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004495384,"about_ca_system_score_gemma":0.0004469342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004733171,"about_ca_topic_score_gemma":0.0003287071,"domain_scores_codex":[0.9993174,0.000214763,0.00004289141,0.0001283731,0.0002156001,0.00008094168],"domain_scores_gemma":[0.9987884,0.0004898919,0.0001348969,0.0003559467,0.0001582815,0.00007259087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002090219,0.00004949191,0.0007946963,0.00009541125,0.00001723629,0.0001106765,0.0001646295,0.01870206,0.008839859,0.7296346,0.003360261,0.2380222],"study_design_scores_gemma":[0.00001397599,0.00004922369,0.0003874902,0.00002325916,0.00001223418,0.0002021018,0.00004932557,0.2255654,0.002349339,0.7685265,0.002791389,0.00002985443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03963701,0.0004182998,0.9493976,0.0003272823,0.00008632432,0.00002517107,0.000133968,0.0004290859,0.009545336],"genre_scores_gemma":[0.6970721,0.0009813309,0.2907219,0.000313865,0.0003907444,0.000085101,0.000416046,0.0002417487,0.009777158],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004079166,"threshold_uncertainty_score":0.01364619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W87405696","doi":"10.1090/dimacs/064/08","title":"On the distribution of the power generator modulo a prime power","year":2004,"lang":"en","type":"article","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Modulo; Power (physics); Prime power; Mathematics; Prime (order theory); Computer science; Discrete mathematics; Combinatorics; Physics; Thermodynamics","authors":[{"name":"John Friedlander","is_ca":true},{"name":"Jan Hansen","is_ca":false},{"name":"Igor E. Shparlinski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005591287886771758,"gpt":0.2172659822683793,"spread":0.2116746943816075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001795854,0.0008104047,0.0008091716,0.002259922,0.0008103471,0.001977555,0.001162034,0.0007292219,0.008258899],"category_scores_gemma":[0.01033654,0.0004145368,0.0003727677,0.0013754,0.003396444,0.003404948,0.001389296,0.001504597,0.00115449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009654172,"about_ca_system_score_gemma":0.00050836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003375716,"about_ca_topic_score_gemma":0.0001989254,"domain_scores_codex":[0.9995077,0.0002229819,0.00001435271,0.00008178759,0.000105773,0.00006743292],"domain_scores_gemma":[0.9948086,0.003711462,0.0003955884,0.0003321336,0.0004266636,0.0003254965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001717931,0.00002531637,0.0006372296,0.00004010912,0.000009400293,0.000145047,0.0001900296,0.008281688,0.002242816,0.9747118,0.001809688,0.011735],"study_design_scores_gemma":[0.00004720861,0.00005164302,0.0005874217,0.00003720988,0.00001380197,0.0003706427,0.00009261191,0.07773222,0.001526288,0.9167396,0.002774306,0.00002693279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4068544,0.002387363,0.5101379,0.003769349,0.0004313856,0.00007185936,0.0003456375,0.0002780474,0.0757241],"genre_scores_gemma":[0.9643307,0.002243049,0.01600255,0.0002512464,0.001037126,0.00008643231,0.0002402281,0.0002066565,0.015602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008258899,"threshold_uncertainty_score":0.02762878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2572442296","doi":"10.1090/dimacs/067/01","title":"A survey of subdivision-based tools for surface modeling","year":2005,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Subdivision; Subdivision surface; Surface (topology); Computer science; Geography; Mathematics; Archaeology; Geometry","authors":[{"name":"Ioana Boier-Martin","is_ca":false},{"name":"Denis Zorin","is_ca":true},{"name":"Fausto Bernardini","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02114662761456256,"gpt":0.2635102341949396,"spread":0.242363606580377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007585504,0.0009810798,0.001317236,0.00293503,0.0005074239,0.001889325,0.001773278,0.001136871,0.009560063],"category_scores_gemma":[0.001556001,0.0008786969,0.001327637,0.007328867,0.0007331291,0.002366044,0.001306109,0.001488976,0.006205114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005850802,"about_ca_system_score_gemma":0.0006715273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001189533,"about_ca_topic_score_gemma":0.001299737,"domain_scores_codex":[0.9991608,0.00009413892,0.00007910586,0.00008621718,0.0005425502,0.00003729825],"domain_scores_gemma":[0.9995068,0.0002123492,0.0000183035,0.00009223812,0.0001470295,0.0000231601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002987604,0.00004920501,0.000269797,0.001606006,0.00004049165,0.0001482234,0.00030335,0.01458279,0.005927733,0.08738616,0.02012221,0.8695341],"study_design_scores_gemma":[0.00002306442,0.00007452795,0.0004993704,0.0006614599,0.00005320804,0.001376577,0.00008238618,0.07484172,0.004874656,0.1109395,0.8065045,0.00006907956],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.002937023,0.1190139,0.8445324,0.0003888247,0.0004605178,0.00007695767,0.0002441685,0.001920502,0.03042579],"genre_scores_gemma":[0.0367697,0.1887312,0.7419114,0.0003794777,0.0006400266,0.0002098553,0.001455058,0.001019877,0.02888337],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.009560063,"threshold_uncertainty_score":0.03198153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2574022650","doi":"10.1090/dimacs/052/16","title":"Software implementation strategies for power-conscious systems","year":2000,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Energy consumption; Variety (cybernetics); Software; Embedded system; Sorting; Compiler; Energy (signal processing); Power (physics); Distributed computing; Computer engineering; Algorithm; Engineering; Programming language; Artificial intelligence; Electrical engineering","authors":[{"name":"Kshirasagar Naik","is_ca":true},{"name":"David S. L. Wei","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01115404849982929,"gpt":0.269717060057407,"spread":0.2585630115575777,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008654048,0.0006487181,0.0002897689,0.0006686393,0.000497872,0.001362613,0.001363742,0.0006905694,0.003443161],"category_scores_gemma":[0.003782122,0.0004133988,0.0003673566,0.0006338538,0.0007783644,0.001969741,0.0008474571,0.0008045159,0.0006654457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006383151,"about_ca_system_score_gemma":0.0008897438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008977951,"about_ca_topic_score_gemma":0.001628323,"domain_scores_codex":[0.9991373,0.0002771231,0.00009226022,0.00009894065,0.0002964264,0.00009790722],"domain_scores_gemma":[0.9984294,0.0007081672,0.0001284308,0.0004308332,0.0002642834,0.00003897961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002549695,0.0003457006,0.002313142,0.0005836274,0.0000701782,0.0002415972,0.001120678,0.1317793,0.1048006,0.3042571,0.002937682,0.4512955],"study_design_scores_gemma":[0.000164859,0.0004093884,0.0008145713,0.0001102899,0.0001201903,0.0003171424,0.0003184354,0.7797103,0.08448948,0.1041367,0.02934683,0.00006183959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08382192,0.0003074079,0.906601,0.0002963588,0.00003027453,0.0002005888,0.00002951706,0.001847256,0.006865755],"genre_scores_gemma":[0.407443,0.0003396442,0.5870281,0.0001478301,0.00001643881,0.0003511302,0.00009352962,0.00033439,0.004245881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003443161,"threshold_uncertainty_score":0.01151848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W178313090","doi":"10.1090/dimacs/061/14","title":"How good can a consensus get? Assessing the reliability of consensus trees in phylogenetic studies","year":2003,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Phylogenetic tree; Reliability (semiconductor); Computer science; Biology; Genetics; Physics; Gene","authors":[{"name":"François‐Joseph Lapointe","is_ca":true},{"name":"Guy Cucumel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02023087159474874,"gpt":0.2870178750129633,"spread":0.2667870034182145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07206026,0.001237113,0.003109138,0.009774715,0.003480337,0.007087406,0.004414887,0.007941742,0.002198511],"category_scores_gemma":[0.5455394,0.001478591,0.002349913,0.01086254,0.00696162,0.01816137,0.005248572,0.005686683,0.0008775573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001775971,"about_ca_system_score_gemma":0.001524341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002065729,"about_ca_topic_score_gemma":0.002937727,"domain_scores_codex":[0.9245274,0.04876011,0.005235866,0.009884989,0.01038993,0.001201658],"domain_scores_gemma":[0.3922826,0.5272963,0.02041339,0.03325989,0.02258579,0.004162123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001681104,0.0002904635,0.3167259,0.003020161,0.008440174,0.001665054,0.01543507,0.1949884,0.004707346,0.08694792,0.01576903,0.3503295],"study_design_scores_gemma":[0.0001478101,0.000353695,0.04204838,0.000667638,0.00128155,0.001078187,0.004189245,0.2507901,0.003043693,0.6912786,0.004846911,0.0002741765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4262117,0.009396678,0.5469887,0.006878108,0.0005605437,0.000191212,0.001607683,0.001021199,0.007144333],"genre_scores_gemma":[0.9064736,0.0008875971,0.09000171,0.0004154028,0.0002400863,0.0001361954,0.001253451,0.0003182147,0.0002738213],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07206026,"threshold_uncertainty_score":0.3810956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4214715666","doi":"10.1090/dimacs/061","title":"Bioconsensus","year":2003,"lang":"en","type":"book","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Biomedical and Chemical Research","field":"Medicine","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","authors":[{"name":"M. F. Janowitz","is_ca":false},{"name":"François‐Joseph Lapointe","is_ca":true},{"name":"F.R. McMorris","is_ca":false},{"name":"Boris Mirkin","is_ca":false},{"name":"Fred S. Roberts","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01303050890325409,"gpt":0.2860274778890046,"spread":0.2729969689857505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107617,0.001036136,0.001199626,0.002117454,0.001455035,0.002929697,0.002352989,0.001063468,0.2328087],"category_scores_gemma":[0.00470989,0.0006345263,0.0008449077,0.002710936,0.0006862391,0.002344844,0.002167933,0.001503254,0.1886449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000781854,"about_ca_system_score_gemma":0.001599323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003583526,"about_ca_topic_score_gemma":0.006762996,"domain_scores_codex":[0.9990849,0.0001406493,0.00006432675,0.0002987972,0.0003253251,0.00008586847],"domain_scores_gemma":[0.99794,0.0005035528,0.00006685522,0.0008465291,0.0004632956,0.0001798121],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008866807,0.00001759856,0.0001565402,0.0001417006,0.00001283875,0.0000428086,0.00003164031,0.00030069,0.0006522934,0.01514067,0.8830759,0.1003386],"study_design_scores_gemma":[0.00004200057,0.00001701225,0.0003107189,0.00006195258,0.00001888467,0.0001501646,0.00004049426,0.002047801,0.001664652,0.03488776,0.9607401,0.0000184717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00367017,0.007470243,0.09752809,0.009289547,0.007492003,0.0002251382,0.05855361,0.09157977,0.7241914],"genre_scores_gemma":[0.04600941,0.004911769,0.1213645,0.007289663,0.002531538,0.0007572027,0.1654817,0.03624194,0.6154122],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2328087,"threshold_uncertainty_score":0.7788226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2571993771","doi":"10.1090/dimacs/075/09","title":"Mathematical analysis of HIV treatment model with variable viral load and infection stages","year":2010,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Human immunodeficiency virus (HIV); Viral load; Virology; Variable (mathematics); Biology; Immunology; Mathematics; Mathematical analysis","authors":[{"name":"Oluwaseun Sharomi","is_ca":false},{"name":"Abba B. Gumel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01324988230066562,"gpt":0.2610525358223277,"spread":0.2478026535216621,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001625386,0.0009629605,0.001626061,0.001018571,0.0006955194,0.001623635,0.002648682,0.002555049,0.008885437],"category_scores_gemma":[0.005898834,0.0007105671,0.001686038,0.0008561686,0.001218491,0.002328447,0.001332177,0.002790391,0.0008071051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002672927,"about_ca_system_score_gemma":0.00215099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01049969,"about_ca_topic_score_gemma":0.007265216,"domain_scores_codex":[0.9993799,0.0002390604,0.00002546082,0.0001042295,0.0001269998,0.0001243459],"domain_scores_gemma":[0.9978895,0.001388476,0.0002849894,0.00007196511,0.0002510273,0.0001140358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005356475,0.0000585966,0.001391131,0.0001759509,0.0001047769,0.0003154973,0.000177556,0.4013701,0.0009097687,0.5782338,0.00901004,0.008199112],"study_design_scores_gemma":[0.00001294903,0.00002023263,0.0004197183,0.0000188511,0.00003592596,0.0001357116,0.0000262877,0.8823828,0.00008439449,0.1153951,0.001447044,0.00002104826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06953255,0.007559389,0.8465607,0.0127414,0.0007529667,0.000145625,0.002015148,0.0003741764,0.06031806],"genre_scores_gemma":[0.8405085,0.00559244,0.04253703,0.001653221,0.001269481,0.0004800048,0.001134125,0.0002244406,0.1066008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01049969,"threshold_uncertainty_score":0.02972478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2577444682","doi":"10.1090/dimacs/075/02","title":"Tools for mathematical epidemiology","year":2010,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Human Health and Disease","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Epidemiology; Medicine; Pathology","authors":[{"name":"Edward M. Lungu","is_ca":true},{"name":"Moatlhodi Kgosimore","is_ca":true},{"name":"Farai Nyabadza","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04192694941517486,"gpt":0.336791619984756,"spread":0.2948646705695812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003688138,0.001530737,0.001613279,0.004690681,0.001198168,0.00472849,0.001238374,0.001966761,0.0203884],"category_scores_gemma":[0.009768227,0.0007431358,0.001197784,0.002937564,0.005184647,0.008114164,0.003700925,0.004429347,0.006397883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002300218,"about_ca_system_score_gemma":0.001325917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00122982,"about_ca_topic_score_gemma":0.001105948,"domain_scores_codex":[0.9983901,0.0008338754,0.0001206868,0.0002212213,0.0003601088,0.00007403902],"domain_scores_gemma":[0.995949,0.002601823,0.000224171,0.0006761771,0.0003905523,0.0001582064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001057953,0.000003618234,0.00004814779,0.0000344846,0.000006539452,0.00001324669,0.00007754088,0.0002714443,0.00002280509,0.9818779,0.009362846,0.008280487],"study_design_scores_gemma":[0.000001349477,0.000001498155,0.00003287255,0.00002736817,0.000003233938,0.00002812317,0.00002204211,0.0006251871,0.00001431676,0.967517,0.03172397,0.000003012017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002599059,0.05106524,0.7210466,0.02696516,0.004301178,0.00007730522,0.001052162,0.0008930715,0.1920002],"genre_scores_gemma":[0.2729454,0.07631871,0.2839781,0.01126405,0.0169455,0.001008357,0.001900251,0.001283115,0.3343565],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0203884,"threshold_uncertainty_score":0.06820595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1503263721","doi":"10.1090/dimacs/067/07","title":"Geometric algorithms for layered manufacturing","year":2005,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Algorithm","authors":[{"name":"Ravi Janardan","is_ca":false},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01684826391080185,"gpt":0.2565476044589772,"spread":0.2396993405481753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005886464,0.001202456,0.001189316,0.001338587,0.0007461314,0.002380536,0.002424656,0.001155793,0.01288675],"category_scores_gemma":[0.00256313,0.0009295838,0.001781307,0.001806913,0.001254341,0.00317911,0.003018446,0.002960884,0.004061513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001199185,"about_ca_system_score_gemma":0.0006599184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001552104,"about_ca_topic_score_gemma":0.001852983,"domain_scores_codex":[0.9994738,0.0001047796,0.00003629359,0.0001021683,0.000232927,0.00005008602],"domain_scores_gemma":[0.9993217,0.0002486584,0.00005650945,0.0002197576,0.0001166023,0.00003682046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005275528,0.00004946933,0.0002397628,0.000180208,0.00004678546,0.00005200842,0.0001193385,0.1365813,0.002677168,0.6002769,0.008017927,0.2517064],"study_design_scores_gemma":[0.00001897964,0.00003290949,0.0001378202,0.00004513104,0.00002185844,0.00008616125,0.00004345544,0.4390415,0.001513647,0.5399265,0.01911012,0.00002185871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003092256,0.0004609228,0.9869658,0.0001234602,0.0000621674,0.00002503539,0.00007750949,0.0006375645,0.008555236],"genre_scores_gemma":[0.1305306,0.001376641,0.8471521,0.0001276808,0.0001017873,0.0001640675,0.0005510234,0.0004649127,0.0195312],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01288675,"threshold_uncertainty_score":0.04311049,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}