{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004236374,0.0003565208,0.0003288699,0.0000628569,0.000323817,0.0001909068,0.0006963335,0.0001255316,0.00003395195],"category_scores_gemma":[0.00004507813,0.0002403567,0.00008561919,0.00006173884,0.003653083,0.000002845224,0.0008833984,0.0002470844,0.000007012778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001968999,"about_ca_system_score_gemma":0.00003981792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001462182,"about_ca_topic_score_gemma":0.00001089442,"domain_scores_codex":[0.9983827,0.00001870726,0.0003418621,0.0006136026,0.0002795191,0.00036354],"domain_scores_gemma":[0.9990066,0.0001154092,0.0001133365,0.0006095401,0.00005999916,0.00009516839],"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.0000331254,0.00001587683,0.000005946029,0.00003535006,0.00001842796,0.00000552948,0.0003868277,0.00005132478,0.0001726466,0.9945964,0.00003085422,0.00464774],"study_design_scores_gemma":[0.0003033546,0.0007451238,0.0001246514,0.0004513755,0.00003119366,0.00005259888,0.00006399327,0.01216155,0.000570097,0.970132,0.01466853,0.0006955707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1674054,0.003872427,0.05234484,0.001962501,0.001339209,0.001873863,0.0003019696,0.00003800002,0.7708619],"genre_scores_gemma":[0.9914299,0.0009556997,0.005225864,0.0004074805,0.0002511816,0.000009545773,0.0000142416,0.00004902393,0.001657094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8240245,"threshold_uncertainty_score":0.9990584,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004208002,0.0004130149,0.0006844946,0.0003498337,0.0005985248,0.0002242577,0.001120457,0.0002170819,0.00007046669],"category_scores_gemma":[0.0001797047,0.0002865879,0.0002065186,0.0004219431,0.007858342,0.0001821393,0.0006717776,0.0004567556,0.000001065514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003189153,"about_ca_system_score_gemma":0.00009485373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001545498,"about_ca_topic_score_gemma":0.000002741741,"domain_scores_codex":[0.9973024,0.00003492404,0.0008153719,0.0006106652,0.000665299,0.0005714107],"domain_scores_gemma":[0.9963578,0.00196704,0.0002993601,0.0009476977,0.0002720349,0.0001560482],"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.00003188716,0.00007250073,0.000005433967,0.0005354519,0.00003392493,0.000002721953,0.0008669227,0.000003479792,0.00005862246,0.9976872,0.000008634521,0.0006931936],"study_design_scores_gemma":[0.0002307912,0.0001401694,0.000005416749,0.0004565449,0.00008316771,0.00005411364,0.00011595,0.007392158,0.0004190542,0.990586,0.0001908693,0.0003257302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003718812,0.0001712267,0.808218,0.0002575454,0.0002173647,0.0017096,0.0001440152,0.00006179861,0.1855016],"genre_scores_gemma":[0.3963723,0.00009614748,0.600789,0.00009070285,0.0001448135,0.0001156267,0.00002036318,0.000130768,0.002240338],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3926535,"threshold_uncertainty_score":0.9999586,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001470021,0.0004789178,0.0006329577,0.0004541133,0.0003546985,0.0007629676,0.001501429,0.0002283674,0.00003729771],"category_scores_gemma":[0.0001076578,0.0004133425,0.0001069758,0.0003327875,0.00279253,0.0005568583,0.001321092,0.0004490135,0.000007441529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008031735,"about_ca_system_score_gemma":0.0001116131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001300354,"about_ca_topic_score_gemma":7.632435e-7,"domain_scores_codex":[0.9970977,0.00005538968,0.0006670677,0.001026571,0.0006478278,0.0005054449],"domain_scores_gemma":[0.9980859,0.0002679297,0.0002381982,0.0009831913,0.0002069818,0.00021782],"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.00000258497,0.00001565144,0.000001939157,0.00006122898,0.000008861172,0.00001477932,0.0003940415,0.0001002934,0.00001107358,0.9909878,0.00003239463,0.00836932],"study_design_scores_gemma":[0.0001167003,0.000103597,0.000001453378,0.0002367115,0.000008784574,0.0002161177,0.000008205386,0.300336,0.0002924814,0.6966432,0.001637254,0.000399394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002111456,0.0001145934,0.8568093,0.0004883794,0.0003111637,0.0002542343,0.000004051292,0.0002135633,0.1417836],"genre_scores_gemma":[0.001370091,0.0002005402,0.9963813,0.0002773649,0.00005004837,0.000009689395,0.000003159383,0.00003154591,0.001676215],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3002357,"threshold_uncertainty_score":0.9999213,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007638992,0.0004334017,0.000500831,0.0001116579,0.0001979838,0.0004689315,0.0005776504,0.0002261808,0.0000238512],"category_scores_gemma":[0.0001110784,0.0003929608,0.00008512085,0.00008826362,0.001252727,0.0005695589,0.0003584475,0.0003678845,0.000002827395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001227993,"about_ca_system_score_gemma":0.00003505163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.022235e-7,"about_ca_topic_score_gemma":0.000003929483,"domain_scores_codex":[0.998096,0.000008835063,0.0005220122,0.0005186197,0.0003973063,0.0004571891],"domain_scores_gemma":[0.9989622,0.0002038929,0.00009400847,0.0005246099,0.0001033406,0.0001119191],"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.000003661859,0.000006419419,8.356988e-7,0.0001799475,0.000008788556,0.000003112663,0.0005501615,0.00454963,0.0004928854,0.9919868,0.00007709947,0.002140721],"study_design_scores_gemma":[0.00009742726,0.00005229509,0.000001143553,0.000267532,0.00001287204,0.00001024872,0.000007654048,0.5229259,0.001342382,0.4733107,0.001569127,0.0004026431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00375094,0.0004215273,0.9635602,0.000178561,0.000391589,0.0007663948,0.0001105267,0.0004259754,0.03039433],"genre_scores_gemma":[0.109655,0.0003111874,0.8886274,0.00007256626,0.0002523754,0.0000256866,0.00003267933,0.0001160455,0.0009070392],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.518676,"threshold_uncertainty_score":0.9998522,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003504858,0.0005922659,0.0008009273,0.000671463,0.0002889954,0.0007180146,0.001032985,0.0002891051,0.0001349809],"category_scores_gemma":[0.0003426805,0.0004514956,0.0001564168,0.0002815448,0.006378499,0.0005847146,0.0009414688,0.0007662623,0.000006595746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006449503,"about_ca_system_score_gemma":0.00005001286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.195852e-7,"about_ca_topic_score_gemma":0.00002875405,"domain_scores_codex":[0.9968776,0.00004499688,0.0009898039,0.000836391,0.0005812683,0.0006700042],"domain_scores_gemma":[0.9966777,0.001777868,0.0003332969,0.0008760894,0.0001265218,0.0002085388],"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.00003344902,0.00005493646,0.000009148039,0.0002544584,0.00001614987,0.00003212876,0.002828112,0.000005088125,0.00001151857,0.9923188,0.000004478647,0.004431749],"study_design_scores_gemma":[0.0002549127,0.0001129127,0.000009134367,0.001898755,0.0000322205,0.0000876067,0.0007560275,0.002171331,0.0001892496,0.9937746,0.0001657144,0.000547544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.06163309,0.001241451,0.2742515,0.0006025809,0.0009918994,0.003092816,0.00008846868,0.0003178044,0.6577804],"genre_scores_gemma":[0.87059,0.0006743227,0.1247309,0.0003345069,0.0001673158,0.00008038529,0.00001809633,0.0001853126,0.003219096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.808957,"threshold_uncertainty_score":0.9997937,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001438896,0.0004622462,0.0006594716,0.0004568477,0.0002844859,0.001418356,0.00177179,0.0002085054,0.000005858715],"category_scores_gemma":[0.0001238081,0.0003509439,0.00007985759,0.0004456517,0.007456147,0.001177301,0.002874244,0.0004201824,0.000004433884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005721287,"about_ca_system_score_gemma":0.000172342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002768565,"about_ca_topic_score_gemma":0.000006564393,"domain_scores_codex":[0.9969847,0.00002857149,0.0005666288,0.001020833,0.0007171133,0.0006821868],"domain_scores_gemma":[0.9980299,0.0005484873,0.0001766286,0.0009340266,0.00009080178,0.0002201621],"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.000004838385,0.00002371878,0.00002183929,0.0001664298,0.000008457634,0.00006364718,0.000776623,0.000001502093,0.000007762941,0.9929072,0.0000547524,0.005963289],"study_design_scores_gemma":[0.0001699794,0.0001620799,0.0001500175,0.000357609,0.00001281295,0.0001675125,0.00004091506,0.03126264,0.00009952963,0.9666225,0.0004814992,0.0004728681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00389319,0.000936281,0.8298592,0.0006456696,0.0007384887,0.0004556677,0.00001141596,0.0001988927,0.1632612],"genre_scores_gemma":[0.1658229,0.001521425,0.8167541,0.0009005727,0.0002019111,0.00003025125,0.00001148026,0.0000893125,0.01466807],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1619297,"threshold_uncertainty_score":0.9998943,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002977581,0.0007232992,0.0008386245,0.0008250354,0.0003852498,0.001523263,0.001943024,0.0003901725,0.00001900725],"category_scores_gemma":[0.00009436061,0.0005793929,0.00009512642,0.0005958669,0.006364327,0.00134584,0.001233334,0.0008337875,0.000001118236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000043269,"about_ca_system_score_gemma":0.0001023005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.410183e-7,"about_ca_topic_score_gemma":0.000007652429,"domain_scores_codex":[0.9961138,0.00007862588,0.0006669909,0.001405971,0.0009049309,0.0008296763],"domain_scores_gemma":[0.99782,0.0004373809,0.0002905334,0.0009929155,0.0001529249,0.0003062808],"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.0000188908,0.00004535646,0.000008923223,0.000205929,0.0000141954,0.0001069617,0.00508309,0.00001903197,0.00001341859,0.9878453,0.000002065584,0.006636859],"study_design_scores_gemma":[0.0002509897,0.0002435098,0.00002217016,0.0004889229,0.00001491205,0.0001568219,0.0001740513,0.2011207,0.0001523241,0.7966199,0.0001385286,0.0006171865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006589992,0.0008310701,0.9560279,0.001331441,0.0004892957,0.001003824,0.00005255427,0.0005472901,0.03312668],"genre_scores_gemma":[0.8269851,0.0002943499,0.1704107,0.00148208,0.0001014534,0.00002709668,0.00001143039,0.00009992701,0.0005879286],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8203951,"threshold_uncertainty_score":0.9996657,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004813307,0.0003322072,0.0005113187,0.0004405391,0.0001055343,0.0002439049,0.0002904828,0.0001337113,0.00001387377],"category_scores_gemma":[0.0000180794,0.0002855651,0.00002744364,0.0001609329,0.001457754,0.000255148,0.0004212762,0.0002429919,5.891619e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004739818,"about_ca_system_score_gemma":0.00003397725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.49258e-7,"about_ca_topic_score_gemma":4.299841e-7,"domain_scores_codex":[0.9985357,0.0000139367,0.0004193476,0.0004077776,0.0003103998,0.0003128714],"domain_scores_gemma":[0.9992411,0.0002411509,0.00009979918,0.0002456017,0.00003873197,0.0001336305],"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.000008806159,0.0000232866,0.000002100586,0.002236039,0.00002957105,0.00001436612,0.0009118359,0.03443282,0.00001229139,0.9084931,0.00001692108,0.05381889],"study_design_scores_gemma":[0.0002005662,0.0001144439,0.00006389346,0.0004588446,0.00002238031,0.00005181723,0.000008197397,0.8064054,0.002236918,0.1900089,0.0000903157,0.0003383279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005365143,0.000662925,0.9834891,0.00002557964,0.0001427908,0.0003638265,0.000009788826,0.00007640951,0.00986447],"genre_scores_gemma":[0.3252835,0.001912922,0.6722009,0.0000243402,0.0001557405,0.00001314725,0.00000840846,0.00007279614,0.0003282495],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7719726,"threshold_uncertainty_score":0.9999596,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001501776,0.0003676151,0.001506073,0.0004590438,0.0001569933,0.00004214262,0.0002893064,0.0003691509,0.0001233028],"category_scores_gemma":[0.0002062086,0.0002506845,0.0002117889,0.0003470975,0.00759885,0.0001558905,0.0003675615,0.0006495841,0.000001002662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002267495,"about_ca_system_score_gemma":0.0001594856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001262123,"about_ca_topic_score_gemma":9.585876e-7,"domain_scores_codex":[0.9976166,0.0000422884,0.0008408088,0.0006863548,0.0003796757,0.0004342555],"domain_scores_gemma":[0.998104,0.000569589,0.0001295206,0.0005242162,0.0001112097,0.0005614879],"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.0001400066,0.0001074707,0.00001388121,0.0007837328,0.0001366661,0.00001639022,0.0004655075,0.001202552,0.00001436432,0.9961872,0.000001750831,0.0009304442],"study_design_scores_gemma":[0.000137078,0.00009823921,0.00001282555,0.0002846783,0.00058335,0.00001055216,0.000005085928,0.5048323,0.00000720248,0.4938875,0.000007633665,0.000133511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02682617,0.0003715742,0.9188763,0.0007438193,0.00006685346,0.0004785538,0.0000399998,0.00003383102,0.05256292],"genre_scores_gemma":[0.9129456,0.0007558161,0.08466209,0.0002481818,0.00004719824,0.00002289338,0.0000472151,0.00003709182,0.001233928],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8861194,"threshold_uncertainty_score":0.9999945,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001735437,0.0005571698,0.001370033,0.0003491161,0.0002636346,0.0001295353,0.0007217004,0.0002803332,0.0004614451],"category_scores_gemma":[0.004240486,0.0004136717,0.0001769355,0.0002345407,0.00424493,0.0001875541,0.001764552,0.0006322172,0.00002899519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000100297,"about_ca_system_score_gemma":0.00006849637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001993757,"about_ca_topic_score_gemma":0.000005668707,"domain_scores_codex":[0.9965337,0.00003705678,0.001194899,0.0009493458,0.0007501378,0.0005348918],"domain_scores_gemma":[0.9965058,0.001656126,0.0003169281,0.000931453,0.0002804318,0.0003092538],"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.00002547432,0.00008423407,0.00000783038,0.0006955304,0.00002477284,0.00000610546,0.0005156879,0.0001455756,0.00004023963,0.9975474,0.00003021004,0.0008768798],"study_design_scores_gemma":[0.0001414239,0.0002810529,0.000004535625,0.0004374445,0.00007599312,0.00002810593,0.00002420246,0.06885769,0.00005502177,0.9292843,0.0003795568,0.0004306496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01294863,0.0001560076,0.8817849,0.003735029,0.0006059838,0.001751565,0.00009745845,0.0002839288,0.09863651],"genre_scores_gemma":[0.4427214,0.0002648366,0.5506416,0.0003620556,0.00145732,0.0001247416,0.00001364994,0.00021221,0.004202174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4297728,"threshold_uncertainty_score":0.9998315,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006678361,0.0003853984,0.0004995343,0.00009709944,0.0003921259,0.000225689,0.0005039981,0.0001330691,0.0002948662],"category_scores_gemma":[0.000135554,0.0002704478,0.00004535352,0.0001748124,0.008211247,0.0002174434,0.0001239408,0.0002622985,0.00002175194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001702698,"about_ca_system_score_gemma":0.0000924722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000337205,"about_ca_topic_score_gemma":0.001084938,"domain_scores_codex":[0.9979907,0.00004247939,0.0003816238,0.0006195251,0.0004798612,0.000485829],"domain_scores_gemma":[0.9987364,0.000416825,0.0001707442,0.0003611477,0.0001059572,0.000208919],"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.00003173002,0.000007226792,0.01152518,0.00006905638,0.00001705323,0.00004170036,0.0001804798,0.00004185734,7.263321e-7,0.9842048,0.00000825714,0.003871964],"study_design_scores_gemma":[0.0004089448,0.0005090305,0.01916421,0.0005996895,0.0000667097,0.0009406266,0.0001156833,0.02750705,0.000007938148,0.9482531,0.001541082,0.0008859598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03056282,0.002233761,0.01501261,0.0006222688,0.0004490516,0.0005811656,0.0001490602,0.00007089824,0.9503183],"genre_scores_gemma":[0.8522518,0.0008007357,0.1452525,0.000603888,0.00008510152,0.000003254741,0.00002163066,0.00001540385,0.0009656719],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9493527,"threshold_uncertainty_score":0.9999748,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006099956,0.0002306613,0.000234014,0.0001012809,0.0004286768,0.0002900802,0.0003988993,0.00009931,0.00000740197],"category_scores_gemma":[0.0001019054,0.0001668426,0.0000464871,0.00007809486,0.001222477,0.0002045892,0.0002077686,0.0002262396,8.483738e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000100899,"about_ca_system_score_gemma":0.00003051373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.799919e-7,"about_ca_topic_score_gemma":0.000003735329,"domain_scores_codex":[0.9987078,0.000008787312,0.0004059818,0.0002792275,0.0002939593,0.0003042053],"domain_scores_gemma":[0.9988135,0.0006133582,0.00008656143,0.000319412,0.00009379136,0.0000733994],"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.000006297312,0.000001007898,0.000001079701,0.00009039626,0.000005589664,7.678067e-7,0.0002683398,0.000348816,0.00003720014,0.9743252,0.000007589809,0.02490774],"study_design_scores_gemma":[0.00006323997,0.0000439545,0.00002734243,0.0001544515,0.000008032291,0.00001664582,0.00001809356,0.2663758,0.001271485,0.7309804,0.0008501084,0.000190424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02828404,0.001100927,0.8673344,0.001062695,0.002948557,0.002807359,0.00008898957,0.0009621316,0.09541086],"genre_scores_gemma":[0.5433339,0.0007527989,0.4537603,0.00003233192,0.0007387192,0.00008948777,0.00001264706,0.00009594114,0.00118388],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5150499,"threshold_uncertainty_score":0.6803643,"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001139426,0.0001959271,0.0002032468,0.00006276269,0.0003262204,0.000320872,0.001590803,0.000045602,0.00001318962],"category_scores_gemma":[0.0002965815,0.000104433,0.00007432405,0.0009015154,0.002840431,0.0004431501,0.001029762,0.0002137832,0.000005106356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008498911,"about_ca_system_score_gemma":0.0001130315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002847064,"about_ca_topic_score_gemma":7.956747e-7,"domain_scores_codex":[0.9981021,0.00007082228,0.0003522524,0.0004265204,0.0006985063,0.0003498106],"domain_scores_gemma":[0.9984798,0.0002424792,0.0001335234,0.0009239056,0.0001289663,0.00009131834],"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.000006416394,0.00007515752,0.000009632387,0.00001035373,0.000002909643,0.00000224069,0.001010656,0.0004775934,0.001733731,0.9964527,0.000006404677,0.0002121552],"study_design_scores_gemma":[0.0002517211,0.0002291733,0.0007282297,0.0001472865,0.000003923614,0.00002648305,0.00004528377,0.1224218,0.03097367,0.8449824,0.00001522075,0.0001747326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3802661,0.0000144394,0.6165913,0.002200041,0.0001862866,0.0002278848,0.000007605699,0.00002547409,0.0004807921],"genre_scores_gemma":[0.9699089,0.000003864841,0.02975396,0.0002966561,0.00001325212,0.00001173011,7.741409e-7,0.000007541212,0.000003355154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5896427,"threshold_uncertainty_score":0.9998733,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008765453,0.0003290017,0.0006890123,0.0001528164,0.00007323404,0.0001251992,0.0005213807,0.0001316977,0.00002259883],"category_scores_gemma":[0.000162641,0.000276117,0.00009904741,0.0001718878,0.001435892,0.0002454116,0.0002313781,0.0002092033,9.577777e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005480455,"about_ca_system_score_gemma":0.00003359393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002122539,"about_ca_topic_score_gemma":0.000006066714,"domain_scores_codex":[0.9982871,0.00001023965,0.0006217312,0.0003909892,0.0003766242,0.0003133223],"domain_scores_gemma":[0.9984289,0.0007277661,0.0001007617,0.0004345531,0.0002016266,0.0001063553],"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.00001016828,0.00001283276,0.000002550561,0.000234617,0.00001150131,9.773266e-7,0.0000592586,0.05933706,0.00004666317,0.9351025,0.00000217128,0.005179667],"study_design_scores_gemma":[0.00007361409,0.00006280882,0.000002788204,0.0002472694,0.0000137371,9.648646e-7,0.000002610075,0.736488,0.0004798336,0.2623482,0.00003851834,0.0002416373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002792828,0.0001941342,0.9890577,0.00002388058,0.00004665858,0.0003274196,0.00009765887,0.0001016057,0.007358098],"genre_scores_gemma":[0.6267929,0.0001302557,0.3728591,0.00001702689,0.00001991165,0.000009178335,0.00002357241,0.00005410703,0.00009398042],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.677151,"threshold_uncertainty_score":0.9999691,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009715594,0.0004273308,0.0005392759,0.0003441994,0.0003869232,0.001592459,0.001438581,0.0001668072,0.00003551284],"category_scores_gemma":[0.00003199754,0.0003716186,0.00009512754,0.0001951221,0.001672255,0.0007339214,0.0006952409,0.0002273668,0.000004710536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007129728,"about_ca_system_score_gemma":0.0002185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003703385,"about_ca_topic_score_gemma":0.000002454762,"domain_scores_codex":[0.9973673,0.00002480645,0.0007017516,0.0008685114,0.0005230731,0.0005145159],"domain_scores_gemma":[0.9983289,0.0002972938,0.0002615779,0.0007481752,0.0002041421,0.0001599108],"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.00000552189,0.0000129348,8.236663e-7,0.0001076367,0.000009095879,0.000006413616,0.0007309887,0.0004513585,0.000001837618,0.9897506,0.00006597315,0.008856812],"study_design_scores_gemma":[0.0001824464,0.0002485939,0.000001920578,0.0002526868,0.000009496649,0.00004705751,0.00004911303,0.1985667,0.00002690792,0.7980695,0.002138059,0.0004074983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008106051,0.0002877636,0.9593598,0.0001411316,0.0002874956,0.0007379662,0.00003624112,0.0002913928,0.03877719],"genre_scores_gemma":[0.04350727,0.0003571237,0.9547178,0.0001502139,0.00009452576,0.00007707471,0.00002839243,0.00005669537,0.001010905],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1981153,"threshold_uncertainty_score":0.9998736,"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001224946,0.0003405904,0.0006056502,0.00009843322,0.0001394248,0.0001222053,0.0004802457,0.0002384481,0.000002717618],"category_scores_gemma":[0.0008774704,0.0002173191,0.00008666349,0.0001199706,0.01473297,0.000003699696,0.0006081224,0.0002814574,1.746318e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002836381,"about_ca_system_score_gemma":0.0001240575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002520702,"about_ca_topic_score_gemma":0.00003369502,"domain_scores_codex":[0.998072,0.00008577284,0.0005138489,0.0006121492,0.0003482759,0.0003680002],"domain_scores_gemma":[0.9985271,0.0004003622,0.0002356266,0.000585186,0.000165342,0.00008641256],"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.00002909756,0.00006136204,0.0003134592,0.0003268208,0.00005293333,0.0000348459,0.0008928475,0.0000396578,0.002282314,0.990794,0.00003636834,0.005136302],"study_design_scores_gemma":[0.0009986461,0.001229046,0.0006661443,0.001382327,0.0001108195,0.0002890819,0.002346362,0.005836227,0.009607129,0.9736899,0.002759606,0.001084775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9481076,0.008787452,0.005324267,0.008067315,0.0007158035,0.001172845,0.0001323796,0.00003755956,0.02765478],"genre_scores_gemma":[0.9673606,0.0005292484,0.0311753,0.0001032044,0.0000447467,0.00001179274,0.000005017027,0.00002396102,0.0007461749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02690861,"threshold_uncertainty_score":0.9879484,"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008251164,0.0003087297,0.0006278487,0.0002215612,0.0001234394,0.0001385725,0.0003860061,0.0002669256,0.0002871911],"category_scores_gemma":[0.0003678163,0.0002108384,0.00009298667,0.0003585289,0.01152092,0.00006330253,0.0006219151,0.0006854141,0.00002672429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001071723,"about_ca_system_score_gemma":0.0004770218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.062291e-7,"about_ca_topic_score_gemma":2.469025e-7,"domain_scores_codex":[0.9973692,0.00001925431,0.0004521383,0.0006129934,0.0009645644,0.0005818229],"domain_scores_gemma":[0.998465,0.0002820992,0.00007158834,0.0005072565,0.0001377821,0.0005362964],"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.00002768389,0.00007549799,0.000005462783,0.0006078059,0.00001291131,0.0001048527,0.0001050351,5.335776e-8,0.0001796703,0.9948537,0.0007769799,0.003250326],"study_design_scores_gemma":[0.0005261315,0.0004064006,0.00001602595,0.001120249,0.00004066471,0.000380831,0.00002459573,0.00563235,0.0011738,0.9782329,0.01207604,0.0003699791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.005198501,0.0006396553,0.009116262,0.003105476,0.0003094399,0.0008324786,0.00003718053,0.0000767196,0.9806843],"genre_scores_gemma":[0.1327458,0.002987104,0.4289537,0.004325385,0.001340525,0.000144524,0.0001795752,0.0003744308,0.428949],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5517353,"threshold_uncertainty_score":0.9911692,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001142579,0.0004409741,0.001620031,0.0003440213,0.0001619729,0.00005030286,0.0001599962,0.0004035484,0.0003641089],"category_scores_gemma":[0.0002022215,0.0002673647,0.0001423147,0.0002020691,0.009022485,0.0001250207,0.0002993059,0.0004622816,0.000003715761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006112511,"about_ca_system_score_gemma":0.0001530454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002793546,"about_ca_topic_score_gemma":0.000006434027,"domain_scores_codex":[0.9978022,0.00002330579,0.0007306653,0.0006401871,0.0003979499,0.0004056937],"domain_scores_gemma":[0.9981574,0.0006314925,0.0002162066,0.0005334447,0.000171323,0.0002901023],"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.0001339522,0.0001749677,0.0001046104,0.0004570047,0.0003328194,0.00001463691,0.0004821734,0.0002040126,0.0000536777,0.9977769,7.390578e-7,0.0002644973],"study_design_scores_gemma":[0.000304665,0.0005275545,0.00003774452,0.0002364879,0.0009504149,0.00005872237,0.000005500264,0.4051325,0.00007845814,0.592473,0.00001725166,0.0001777013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06273546,0.00008110021,0.7672228,0.0005961407,0.00004810592,0.0007438225,0.00006986214,0.00005482009,0.1684479],"genre_scores_gemma":[0.6401029,0.0004914578,0.353003,0.0001854552,0.0000533114,0.00004603273,0.00003192278,0.00006069467,0.00602519],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5773675,"threshold_uncertainty_score":0.9999778,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00193063,0.0004040121,0.00113293,0.0002204728,0.0002460433,0.000121681,0.0003766338,0.0003588661,0.0004389184],"category_scores_gemma":[0.002170151,0.0002971418,0.0001788486,0.00006511927,0.006404762,0.0001747931,0.0004083152,0.0006476757,0.00003039375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004906804,"about_ca_system_score_gemma":0.0002513675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.087397e-7,"about_ca_topic_score_gemma":9.900049e-7,"domain_scores_codex":[0.9973488,0.00001762041,0.0008959837,0.0007093286,0.0003555464,0.0006727292],"domain_scores_gemma":[0.9962769,0.001916615,0.0001963047,0.0007152126,0.0001737517,0.0007212284],"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.00008870986,0.00005352829,0.000008807504,0.001324359,0.00001064883,0.00002270582,0.0002107112,3.611448e-7,0.00001444218,0.9942487,0.00002562535,0.003991407],"study_design_scores_gemma":[0.0005039774,0.0004689343,0.00003717217,0.0006593647,0.0000764022,0.0001679713,0.00001624952,0.01239171,0.00004202173,0.9815559,0.003768547,0.0003116948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.008529873,0.000690644,0.3924322,0.007555217,0.0009117987,0.004934669,0.0002517223,0.0002250555,0.5844688],"genre_scores_gemma":[0.06429134,0.0003416154,0.9197487,0.004026883,0.0009671021,0.000195532,0.0001074831,0.0001762781,0.01014513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5743237,"threshold_uncertainty_score":0.9999481,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001047974,0.0004124927,0.0004961097,0.000771041,0.0003535957,0.0007450811,0.001304675,0.0001602572,0.00003654733],"category_scores_gemma":[0.00007985656,0.0003621556,0.0001195687,0.0003281977,0.001077857,0.000691876,0.0008902777,0.0002679468,0.00001120322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009402208,"about_ca_system_score_gemma":0.000110061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.764384e-7,"about_ca_topic_score_gemma":0.000001482648,"domain_scores_codex":[0.9972771,0.00001278061,0.0005965966,0.0009214547,0.0006923116,0.0004997054],"domain_scores_gemma":[0.9983327,0.0004467747,0.0002120398,0.0006198213,0.0001795274,0.0002090906],"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.000004860851,0.00002163094,2.439796e-7,0.00008616969,0.00001005146,0.000006215808,0.0002031761,0.0008091817,0.00000921138,0.927677,0.00002151484,0.0711507],"study_design_scores_gemma":[0.0002209492,0.0001487482,0.00001022699,0.0001169366,0.000008696348,0.00005125157,0.000004774372,0.3903305,0.0007810032,0.603806,0.004140011,0.0003808895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001556327,0.000235796,0.9652481,0.0004882295,0.0004493369,0.0004951012,0.00002315158,0.00008026756,0.03282436],"genre_scores_gemma":[0.04212087,0.0001558841,0.9518085,0.0002137666,0.0004034389,0.00003752503,0.00002168688,0.00004062817,0.00519774],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3895213,"threshold_uncertainty_score":0.9998831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}