{"meta":{"query_hash":"5b3be212440d","filters":{"venue":"DIMACS series in discrete mathematics and theoretical computer science"},"cohort_total":20,"direct_labels_cover":0,"predictions_cover":20,"exported":20,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/5b3be212440d","api":"https://metacan.xera.ac/api/v1/cohort?venue=DIMACS+series+in+discrete+mathematics+and+theoretical+computer+science"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Bounding overwatch; Variable (mathematics); Combinatorics; Graph; Mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.03964920218428527,"score_gpt":0.3063905946128505,"score_spread":0.26674139242856526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105367266","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003718812,0.0001712267,0.808218,0.00025754544,0.00021736474,0.0017095996,0.00014401515,0.00006179861,0.18550162],"genre_scores_gemma":[0.39637226,0.00009614748,0.60078895,0.00009070285,0.00014481347,0.00011562668,0.000020363183,0.00013076799,0.0022403381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730235,0.000034924036,0.0008153719,0.00061066524,0.000665299,0.0005714107],"domain_scores_gemma":[0.9963578,0.0019670404,0.00029936005,0.00094769767,0.00027203487,0.00015604823],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0042080022,0.0004130149,0.0006844946,0.00034983366,0.00059852476,0.00022425772,0.0011204568,0.00021708194,0.00007046669],"category_scores_gemma":[0.00017970473,0.00028658786,0.00020651858,0.0004219431,0.0078583425,0.00018213927,0.00067177764,0.0004567556,0.0000010655135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031887164,0.00007250073,0.000005433967,0.00053545187,0.000033924927,0.000002721953,0.00086692267,0.0000034797915,0.00005862246,0.9976872,0.000008634521,0.0006931936],"study_design_scores_gemma":[0.00023079118,0.00014016936,0.000005416749,0.0004565449,0.00008316771,0.000054113636,0.00011595002,0.0073921583,0.00041905424,0.99058604,0.00019086932,0.0003257302],"about_ca_topic_score_codex":0.0000015454984,"about_ca_topic_score_gemma":0.0000027417411,"teacher_disagreement_score":0.39265347,"about_ca_system_score_codex":0.000031891534,"about_ca_system_score_gemma":0.00009485373,"threshold_uncertainty_score":0.99995863},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012720735207511357,"score_gpt":0.24059249324778453,"score_spread":0.22787175804027318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118194434","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00375094,0.00042152734,0.96356016,0.000178561,0.00039158904,0.0007663948,0.00011052669,0.00042597542,0.03039433],"genre_scores_gemma":[0.109654985,0.00031118738,0.8886274,0.00007256626,0.0002523754,0.000025686604,0.00003267933,0.0001160455,0.00090703915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809605,0.0000088350625,0.00052201224,0.00051861966,0.00039730634,0.00045718913],"domain_scores_gemma":[0.9989622,0.00020389294,0.00009400847,0.0005246099,0.00010334059,0.00011191909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076389924,0.0004334017,0.000500831,0.000111657944,0.00019798377,0.00046893148,0.0005776504,0.00022618077,0.000023851198],"category_scores_gemma":[0.00011107844,0.00039296082,0.00008512085,0.00008826362,0.0012527265,0.0005695589,0.00035844755,0.0003678845,0.000002827395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036618587,0.000006419419,8.3569876e-7,0.00017994747,0.000008788556,0.0000031126633,0.00055016147,0.0045496295,0.00049288536,0.99198675,0.00007709947,0.002140721],"study_design_scores_gemma":[0.00009742726,0.000052295094,0.0000011435529,0.00026753204,0.00001287204,0.000010248725,0.000007654048,0.5229259,0.0013423819,0.47331074,0.001569127,0.00040264308],"about_ca_topic_score_codex":4.0222346e-7,"about_ca_topic_score_gemma":0.0000039294832,"teacher_disagreement_score":0.518676,"about_ca_system_score_codex":0.00012279929,"about_ca_system_score_gemma":0.00003505163,"threshold_uncertainty_score":0.99985224},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.01684826391080185,"score_gpt":0.2565476044589772,"score_spread":0.23969934054817532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503263721","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015563266,0.00023579605,0.9652481,0.00048822947,0.0004493369,0.00049510115,0.000023151582,0.00008026756,0.032824364],"genre_scores_gemma":[0.042120874,0.00015588409,0.95180845,0.00021376659,0.0004034389,0.00003752503,0.00002168688,0.00004062817,0.00519774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727714,0.000012780614,0.00059659657,0.0009214547,0.0006923116,0.00049970543],"domain_scores_gemma":[0.99833274,0.00044677473,0.00021203977,0.0006198213,0.00017952743,0.00020909063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001047974,0.0004124927,0.0004961097,0.00077104097,0.00035359568,0.00074508105,0.0013046747,0.00016025722,0.000036547328],"category_scores_gemma":[0.00007985656,0.00036215558,0.00011956867,0.0003281977,0.0010778573,0.00069187605,0.00089027773,0.00026794683,0.000011203219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004860851,0.000021630942,2.4397957e-7,0.00008616969,0.0000100514635,0.000006215808,0.00020317608,0.0008091817,0.00000921138,0.92767704,0.000021514836,0.0711507],"study_design_scores_gemma":[0.00022094924,0.0001487482,0.000010226991,0.0001169366,0.000008696348,0.000051251565,0.000004774372,0.3903305,0.0007810032,0.603806,0.0041400106,0.0003808895],"about_ca_topic_score_codex":5.764384e-7,"about_ca_topic_score_gemma":0.0000014826478,"teacher_disagreement_score":0.3895213,"about_ca_system_score_codex":0.00009402208,"about_ca_system_score_gemma":0.00011006099,"threshold_uncertainty_score":0.99988306},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"k-nearest neighbors algorithm; Computer science; Nearest neighbor search; Artificial intelligence","score_opus":0.009468099680436316,"score_gpt":0.23230207046927515,"score_spread":0.22283397078883882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531547509","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16740535,0.0038724274,0.052344844,0.0019625013,0.0013392086,0.0018738626,0.00030196956,0.00003800002,0.77086186],"genre_scores_gemma":[0.99142987,0.00095569965,0.0052258642,0.00040748055,0.00025118157,0.000009545773,0.000014241602,0.000049023933,0.0016570941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838275,0.000018707262,0.00034186212,0.00061360263,0.00027951912,0.00036354005],"domain_scores_gemma":[0.99900657,0.000115409224,0.00011333648,0.00060954015,0.00005999916,0.00009516839],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042363736,0.0003565208,0.00032886988,0.000062856896,0.00032381702,0.00019090684,0.00069633353,0.00012553157,0.00003395195],"category_scores_gemma":[0.000045078126,0.00024035673,0.00008561919,0.00006173884,0.0036530832,0.0000028452243,0.0008833984,0.00024708445,0.0000070127776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033125398,0.000015876825,0.0000059460294,0.000035350058,0.000018427956,0.0000055294804,0.00038682768,0.000051324776,0.00017264664,0.99459636,0.000030854222,0.00464774],"study_design_scores_gemma":[0.00030335455,0.0007451238,0.00012465136,0.00045137547,0.000031193664,0.00005259888,0.00006399327,0.012161549,0.000570097,0.970132,0.014668525,0.0006955707],"about_ca_topic_score_codex":0.0000014621817,"about_ca_topic_score_gemma":0.000010894416,"teacher_disagreement_score":0.8240245,"about_ca_system_score_codex":0.000019689987,"about_ca_system_score_gemma":0.00003981792,"threshold_uncertainty_score":0.9990584},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Phylogenetic tree; Reliability (semiconductor); Computer science; Biology; Genetics; Physics; Gene","score_opus":0.020230871594748744,"score_gpt":0.2870178750129633,"score_spread":0.26678700341821454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178313090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9481076,0.008787452,0.0053242673,0.0080673145,0.0007158035,0.0011728449,0.00013237965,0.000037559555,0.027654784],"genre_scores_gemma":[0.96736056,0.0005292484,0.0311753,0.00010320436,0.0000447467,0.0000117927375,0.0000050170274,0.000023961024,0.00074617495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807197,0.000085772845,0.0005138489,0.0006121492,0.00034827593,0.0003680002],"domain_scores_gemma":[0.99852705,0.00040036216,0.00023562665,0.000585186,0.00016534199,0.00008641256],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012249456,0.0003405904,0.00060565025,0.00009843322,0.0001394248,0.00012220528,0.00048024568,0.00023844812,0.000002717618],"category_scores_gemma":[0.00087747036,0.00021731912,0.00008666349,0.0001199706,0.014732965,0.000003699696,0.00060812244,0.0002814574,1.7463175e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002909756,0.000061362036,0.0003134592,0.0003268208,0.000052933334,0.000034845896,0.0008928475,0.000039657803,0.0022823145,0.990794,0.000036368336,0.005136302],"study_design_scores_gemma":[0.0009986461,0.0012290461,0.0006661443,0.0013823268,0.00011081954,0.00028908195,0.0023463622,0.0058362274,0.009607129,0.97368985,0.002759606,0.0010847751],"about_ca_topic_score_codex":0.000002520702,"about_ca_topic_score_gemma":0.00003369502,"teacher_disagreement_score":0.02690861,"about_ca_system_score_codex":0.00002836381,"about_ca_system_score_gemma":0.00012405752,"threshold_uncertainty_score":0.98794836},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Human immunodeficiency virus (HIV); Viral load; Virology; Variable (mathematics); Biology; Immunology; Mathematics; Mathematical analysis","score_opus":0.01324988230066562,"score_gpt":0.26105253582232774,"score_spread":0.24780265352166211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571993771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06273546,0.00008110021,0.7672228,0.00059614074,0.000048105918,0.0007438225,0.000069862144,0.000054820088,0.16844787],"genre_scores_gemma":[0.6401029,0.00049145776,0.353003,0.00018545515,0.000053311403,0.00004603273,0.00003192278,0.00006069467,0.00602519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978022,0.000023305789,0.00073066534,0.0006401871,0.00039794992,0.00040569372],"domain_scores_gemma":[0.99815744,0.00063149247,0.00021620658,0.00053344475,0.00017132304,0.00029010227],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011425785,0.00044097414,0.0016200306,0.0003440213,0.00016197286,0.000050302864,0.00015999621,0.00040354845,0.00036410886],"category_scores_gemma":[0.0002022215,0.00026736473,0.00014231466,0.00020206915,0.0090224845,0.00012502068,0.0002993059,0.0004622816,0.0000037157606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013395216,0.00017496767,0.00010461043,0.0004570047,0.00033281944,0.000014636915,0.00048217337,0.00020401263,0.0000536777,0.9977769,7.3905784e-7,0.00026449733],"study_design_scores_gemma":[0.00030466495,0.00052755454,0.000037744525,0.0002364879,0.0009504149,0.000058722366,0.0000055002643,0.40513247,0.00007845814,0.59247303,0.000017251661,0.00017770128],"about_ca_topic_score_codex":0.0000027935462,"about_ca_topic_score_gemma":0.0000064340275,"teacher_disagreement_score":0.5773675,"about_ca_system_score_codex":0.00006112511,"about_ca_system_score_gemma":0.00015304543,"threshold_uncertainty_score":0.9999778},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Subdivision; Subdivision surface; Surface (topology); Computer science; Geography; Mathematics; Archaeology; Geometry","score_opus":0.021146627614562562,"score_gpt":0.2635102341949396,"score_spread":0.242363606580377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572442296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027928278,0.00019413418,0.9890577,0.000023880584,0.00004665858,0.00032741964,0.00009765887,0.00010160574,0.0073580984],"genre_scores_gemma":[0.6267929,0.00013025574,0.37285906,0.000017026889,0.000019911646,0.000009178335,0.000023572407,0.000054107026,0.000093980416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982871,0.000010239646,0.0006217312,0.00039098918,0.00037662423,0.0003133223],"domain_scores_gemma":[0.99842894,0.00072776614,0.00010076166,0.0004345531,0.00020162658,0.00010635534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087654527,0.0003290017,0.00068901235,0.00015281641,0.00007323404,0.00012519924,0.0005213807,0.00013169767,0.000022598826],"category_scores_gemma":[0.000162641,0.00027611697,0.000099047415,0.00017188776,0.0014358923,0.00024541165,0.0002313781,0.00020920327,9.577777e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010168282,0.000012832759,0.0000025505606,0.00023461702,0.00001150131,9.773266e-7,0.0000592586,0.059337065,0.00004666317,0.9351025,0.00000217128,0.005179667],"study_design_scores_gemma":[0.00007361409,0.000062808824,0.0000027882043,0.00024726943,0.000013737101,9.648646e-7,0.0000026100754,0.736488,0.0004798336,0.2623482,0.000038518338,0.0002416373],"about_ca_topic_score_codex":0.000002122539,"about_ca_topic_score_gemma":0.0000060667144,"teacher_disagreement_score":0.67715096,"about_ca_system_score_codex":0.000054804554,"about_ca_system_score_gemma":0.000033593933,"threshold_uncertainty_score":0.9999691},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Mathematics","score_opus":0.029044962895474716,"score_gpt":0.30605441954386103,"score_spread":0.27700945664838633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573265953","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06163309,0.0012414514,0.27425152,0.0006025809,0.0009918994,0.0030928163,0.00008846868,0.00031780437,0.6577804],"genre_scores_gemma":[0.87059003,0.0006743227,0.12473091,0.00033450685,0.0001673158,0.00008038529,0.000018096329,0.0001853126,0.003219096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687755,0.000044996883,0.0009898039,0.000836391,0.00058126834,0.00067000417],"domain_scores_gemma":[0.9966777,0.0017778683,0.00033329692,0.0008760894,0.00012652183,0.00020853883],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0035048581,0.00059226586,0.00080092734,0.00067146297,0.00028899545,0.0007180146,0.0010329853,0.0002891051,0.00013498092],"category_scores_gemma":[0.00034268052,0.00045149555,0.00015641676,0.00028154478,0.006378499,0.0005847146,0.00094146875,0.0007662623,0.0000065957456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033449018,0.000054936463,0.000009148039,0.00025445843,0.000016149866,0.000032128755,0.0028281123,0.000005088125,0.0000115185685,0.9923188,0.000004478647,0.004431749],"study_design_scores_gemma":[0.00025491265,0.00011291272,0.000009134367,0.001898755,0.000032220498,0.0000876067,0.0007560275,0.0021713313,0.00018924956,0.9937746,0.00016571443,0.00054754404],"about_ca_topic_score_codex":9.195852e-7,"about_ca_topic_score_gemma":0.00002875405,"teacher_disagreement_score":0.808957,"about_ca_system_score_codex":0.000064495034,"about_ca_system_score_gemma":0.000050012863,"threshold_uncertainty_score":0.9997937},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Univariate; Representation (politics); Computer science; Mathematics; Statistics; Multivariate statistics; Political science","score_opus":0.018244402012064582,"score_gpt":0.2854292105186446,"score_spread":0.26718480850658005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573862310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028284043,0.0011009274,0.8673344,0.0010626949,0.0029485568,0.002807359,0.00008898957,0.0009621316,0.09541086],"genre_scores_gemma":[0.5433339,0.00075279886,0.4537603,0.000032331922,0.0007387192,0.000089487774,0.00001264706,0.00009594114,0.0011838799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870783,0.000008787312,0.00040598185,0.00027922748,0.00029395928,0.0003042053],"domain_scores_gemma":[0.99881345,0.00061335816,0.00008656143,0.00031941198,0.00009379136,0.0000733994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006099956,0.00023066126,0.00023401399,0.00010128091,0.00042867684,0.00029008018,0.00039889925,0.000099310004,0.00000740197],"category_scores_gemma":[0.0001019054,0.00016684257,0.0000464871,0.00007809486,0.0012224771,0.00020458922,0.00020776858,0.00022623956,8.483738e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062973118,0.0000010078984,0.0000010797013,0.00009039626,0.0000055896644,7.6780674e-7,0.00026833982,0.00034881604,0.000037200138,0.9743252,0.0000075898092,0.02490774],"study_design_scores_gemma":[0.00006323997,0.000043954497,0.00002734243,0.00015445147,0.000008032291,0.000016645825,0.000018093564,0.26637584,0.0012714855,0.7309804,0.0008501084,0.00019042396],"about_ca_topic_score_codex":7.799919e-7,"about_ca_topic_score_gemma":0.0000037353286,"teacher_disagreement_score":0.5150499,"about_ca_system_score_codex":0.00010089904,"about_ca_system_score_gemma":0.000030513727,"threshold_uncertainty_score":0.68036425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011154048499829294,"score_gpt":0.269717060057407,"score_spread":0.25856301155757766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574022650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008106051,0.00028776357,0.95935977,0.00014113163,0.00028749564,0.0007379662,0.000036241116,0.00029139282,0.03877719],"genre_scores_gemma":[0.043507274,0.00035712367,0.9547178,0.00015021389,0.00009452576,0.00007707471,0.000028392427,0.000056695368,0.0010109055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973673,0.00002480645,0.00070175156,0.00086851144,0.00052307313,0.00051451585],"domain_scores_gemma":[0.9983289,0.00029729377,0.00026157786,0.0007481752,0.00020414211,0.00015991076],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00097155944,0.0004273308,0.0005392759,0.00034419942,0.00038692317,0.0015924594,0.0014385806,0.00016680724,0.00003551284],"category_scores_gemma":[0.00003199754,0.0003716186,0.000095127536,0.00019512212,0.0016722553,0.0007339214,0.00069524086,0.00022736676,0.0000047105364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055218898,0.000012934799,8.2366626e-7,0.00010763673,0.000009095879,0.0000064136157,0.0007309887,0.00045135853,0.0000018376176,0.9897506,0.00006597315,0.008856812],"study_design_scores_gemma":[0.00018244643,0.0002485939,0.000001920578,0.00025268676,0.000009496649,0.000047057514,0.000049113027,0.1985667,0.000026907916,0.79806954,0.0021380594,0.00040749827],"about_ca_topic_score_codex":0.0000037033851,"about_ca_topic_score_gemma":0.0000024547624,"teacher_disagreement_score":0.19811535,"about_ca_system_score_codex":0.00007129728,"about_ca_system_score_gemma":0.00021850002,"threshold_uncertainty_score":0.9998736},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Congruence (geometry); Phylogenetic tree; Evolutionary biology; Mathematics; Psychology; Biology; Social psychology; Genetics","score_opus":0.010150229598755322,"score_gpt":0.22784657787953766,"score_spread":0.21769634828078233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577195055","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030562822,0.0022337614,0.015012607,0.00062226877,0.00044905164,0.0005811656,0.00014906023,0.00007089824,0.95031834],"genre_scores_gemma":[0.85225177,0.00080073567,0.14525253,0.00060388795,0.00008510152,0.0000032547407,0.000021630662,0.000015403846,0.0009656719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799067,0.000042479387,0.0003816238,0.0006195251,0.00047986125,0.00048582902],"domain_scores_gemma":[0.9987364,0.00041682497,0.0001707442,0.00036114772,0.00010595719,0.00020891902],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006678361,0.00038539842,0.0004995343,0.000097099444,0.00039212586,0.00022568899,0.0005039981,0.0001330691,0.00029486624],"category_scores_gemma":[0.00013555397,0.0002704478,0.000045353518,0.00017481245,0.008211247,0.0002174434,0.00012394079,0.00026229848,0.000021751941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031730022,0.0000072267917,0.011525176,0.000069056376,0.000017053235,0.000041700365,0.00018047976,0.000041857344,7.2633213e-7,0.98420477,0.00000825714,0.0038719638],"study_design_scores_gemma":[0.00040894476,0.0005090305,0.019164208,0.00059968955,0.000066709705,0.0009406266,0.00011568329,0.027507048,0.000007938148,0.9482531,0.0015410824,0.00088595983],"about_ca_topic_score_codex":0.000033720502,"about_ca_topic_score_gemma":0.0010849377,"teacher_disagreement_score":0.9493527,"about_ca_system_score_codex":0.000017026981,"about_ca_system_score_gemma":0.000092472204,"threshold_uncertainty_score":0.9999748},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Epidemiology; Medicine; Pathology","score_opus":0.04192694941517486,"score_gpt":0.33679161998475604,"score_spread":0.2948646705695812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577444682","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008529873,0.000690644,0.3924322,0.0075552175,0.0009117987,0.0049346685,0.00025172232,0.00022505545,0.5844688],"genre_scores_gemma":[0.06429134,0.00034161544,0.91974866,0.0040268833,0.0009671021,0.00019553205,0.00010748313,0.00017627812,0.010145127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973488,0.000017620412,0.0008959837,0.0007093286,0.0003555464,0.00067272916],"domain_scores_gemma":[0.9962769,0.0019166154,0.00019630474,0.0007152126,0.00017375173,0.0007212284],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0019306301,0.0004040121,0.0011329299,0.00022047276,0.00024604326,0.00012168102,0.0003766338,0.0003588661,0.00043891836],"category_scores_gemma":[0.0021701509,0.0002971418,0.00017884858,0.000065119275,0.0064047617,0.0001747931,0.00040831522,0.0006476757,0.000030393754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088709865,0.000053528285,0.000008807504,0.0013243593,0.0000106488305,0.000022705817,0.0002107112,3.6114477e-7,0.000014442184,0.9942487,0.000025625352,0.0039914073],"study_design_scores_gemma":[0.0005039774,0.0004689343,0.000037172165,0.00065936474,0.0000764022,0.00016797129,0.000016249516,0.012391713,0.00004202173,0.98155594,0.0037685465,0.00031169484],"about_ca_topic_score_codex":3.0873974e-7,"about_ca_topic_score_gemma":9.900049e-7,"teacher_disagreement_score":0.57432365,"about_ca_system_score_codex":0.00004906804,"about_ca_system_score_gemma":0.00025136746,"threshold_uncertainty_score":0.9999481},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Supertree; Computer science; Chemistry; Biochemistry","score_opus":0.012126819843666859,"score_gpt":0.2587338422978282,"score_spread":0.24660702245416133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579372702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021114558,0.00011459343,0.85680926,0.0004883794,0.00031116372,0.0002542343,0.000004051292,0.00021356327,0.14178362],"genre_scores_gemma":[0.0013700909,0.00020054023,0.99638134,0.00027736492,0.000050048366,0.000009689395,0.0000031593831,0.000031545907,0.0016762146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970977,0.000055389675,0.0006670677,0.0010265711,0.0006478278,0.0005054449],"domain_scores_gemma":[0.99808586,0.00026792975,0.00023819818,0.0009831913,0.00020698179,0.00021781998],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014700205,0.00047891776,0.0006329577,0.0004541133,0.00035469848,0.0007629676,0.0015014292,0.0002283674,0.000037297712],"category_scores_gemma":[0.00010765778,0.00041334247,0.00010697579,0.00033278746,0.0027925298,0.0005568583,0.0013210924,0.00044901355,0.000007441529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025849697,0.000015651436,0.000001939157,0.00006122898,0.000008861172,0.000014779323,0.00039404148,0.00010029338,0.000011073576,0.99098784,0.00003239463,0.00836932],"study_design_scores_gemma":[0.000116700285,0.00010359702,0.0000014533776,0.00023671145,0.000008784574,0.00021611773,0.000008205386,0.30033603,0.00029248136,0.69664323,0.0016372545,0.000399394],"about_ca_topic_score_codex":0.0000013003545,"about_ca_topic_score_gemma":7.6324346e-7,"teacher_disagreement_score":0.30023575,"about_ca_system_score_codex":0.00008031735,"about_ca_system_score_gemma":0.000111613095,"threshold_uncertainty_score":0.9999213},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02330091641513424,"score_gpt":0.29565991565204797,"score_spread":0.2723589992369137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579550659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065899924,0.0008310701,0.95602787,0.001331441,0.0004892957,0.0010038243,0.00005255427,0.0005472901,0.03312668],"genre_scores_gemma":[0.82698506,0.00029434988,0.17041066,0.0014820803,0.000101453414,0.000027096681,0.000011430389,0.000099927005,0.00058792863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961138,0.00007862588,0.00066699093,0.001405971,0.0009049309,0.0008296763],"domain_scores_gemma":[0.99781996,0.00043738086,0.0002905334,0.0009929155,0.00015292485,0.00030628082],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029775805,0.00072329916,0.00083862455,0.0008250354,0.00038524985,0.0015232628,0.0019430239,0.00039017253,0.000019007248],"category_scores_gemma":[0.000094360614,0.00057939294,0.00009512642,0.0005958669,0.0063643274,0.0013458404,0.0012333344,0.0008337875,0.0000011182362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018890802,0.000045356457,0.000008923223,0.00020592901,0.000014195395,0.00010696171,0.0050830897,0.00001903197,0.000013418595,0.9878453,0.0000020655839,0.0066368594],"study_design_scores_gemma":[0.0002509897,0.00024350981,0.000022170165,0.0004889229,0.000014912052,0.0001568219,0.00017405134,0.20112069,0.0001523241,0.7966199,0.00013852856,0.0006171865],"about_ca_topic_score_codex":9.410183e-7,"about_ca_topic_score_gemma":0.000007652429,"teacher_disagreement_score":0.82039505,"about_ca_system_score_codex":0.000043268996,"about_ca_system_score_gemma":0.00010230045,"threshold_uncertainty_score":0.99966574},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","score_opus":0.041453532882258184,"score_gpt":0.3261013245072224,"score_spread":0.28464779162496423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607827127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012948628,0.00015600759,0.8817849,0.003735029,0.00060598383,0.0017515655,0.000097458455,0.00028392876,0.09863651],"genre_scores_gemma":[0.4427214,0.0002648366,0.5506416,0.0003620556,0.0014573202,0.00012474164,0.000013649942,0.00021221004,0.0042021745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965337,0.000037056776,0.0011948989,0.0009493458,0.0007501378,0.00053489185],"domain_scores_gemma":[0.9965058,0.0016561261,0.00031692814,0.00093145296,0.00028043176,0.00030925384],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017354374,0.00055716984,0.0013700327,0.00034911613,0.0002636346,0.00012953528,0.0007217004,0.0002803332,0.00046144513],"category_scores_gemma":[0.004240486,0.00041367175,0.00017693551,0.0002345407,0.0042449296,0.00018755408,0.0017645515,0.0006322172,0.00002899519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025474315,0.00008423407,0.00000783038,0.0006955304,0.000024772839,0.0000061054598,0.0005156879,0.0001455756,0.000040239625,0.99754745,0.000030210038,0.00087687984],"study_design_scores_gemma":[0.00014142388,0.00028105293,0.000004535625,0.0004374445,0.00007599312,0.000028105933,0.000024202462,0.06885769,0.000055021774,0.92928433,0.0003795568,0.00043064964],"about_ca_topic_score_codex":0.0000019937568,"about_ca_topic_score_gemma":0.0000056687068,"teacher_disagreement_score":0.4297728,"about_ca_system_score_codex":0.000100296995,"about_ca_system_score_gemma":0.00006849637,"threshold_uncertainty_score":0.9998315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"History; Computer science; Geography","score_opus":0.009241024057159654,"score_gpt":0.24287856347566222,"score_spread":0.23363753941850257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607961321","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00389319,0.000936281,0.8298592,0.0006456696,0.00073848874,0.0004556677,0.000011415965,0.0001988927,0.1632612],"genre_scores_gemma":[0.1658229,0.0015214252,0.8167541,0.0009005727,0.0002019111,0.000030251249,0.000011480256,0.0000893125,0.014668065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698466,0.000028571485,0.0005666288,0.0010208328,0.00071711326,0.0006821868],"domain_scores_gemma":[0.9980299,0.0005484873,0.0001766286,0.0009340266,0.000090801776,0.00022016208],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014388963,0.00046224624,0.0006594716,0.00045684775,0.00028448587,0.0014183563,0.0017717895,0.0002085054,0.000005858715],"category_scores_gemma":[0.00012380813,0.0003509439,0.00007985759,0.00044565173,0.0074561466,0.0011773014,0.002874244,0.00042018242,0.0000044338844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048383854,0.000023718778,0.000021839289,0.00016642976,0.000008457634,0.00006364718,0.00077662297,0.0000015020926,0.000007762941,0.99290717,0.000054752403,0.0059632887],"study_design_scores_gemma":[0.00016997938,0.00016207992,0.00015001751,0.00035760898,0.000012812953,0.00016751251,0.000040915056,0.031262636,0.00009952963,0.96662253,0.00048149924,0.0004728681],"about_ca_topic_score_codex":0.0000027685653,"about_ca_topic_score_gemma":0.0000065643926,"teacher_disagreement_score":0.1619297,"about_ca_system_score_codex":0.000057212874,"about_ca_system_score_gemma":0.00017234204,"threshold_uncertainty_score":0.99989426},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Engineering drawing; Computer science; Engineering","score_opus":0.007173733932739998,"score_gpt":0.20427901935542925,"score_spread":0.19710528542268924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608174757","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053651426,0.000662925,0.9834891,0.00002557964,0.00014279078,0.0003638265,0.000009788826,0.00007640951,0.00986447],"genre_scores_gemma":[0.3252835,0.0019129219,0.6722009,0.000024340197,0.00015574052,0.000013147247,0.0000084084595,0.00007279614,0.0003282495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985357,0.0000139367,0.0004193476,0.00040777755,0.00031039977,0.00031287136],"domain_scores_gemma":[0.9992411,0.00024115093,0.00009979918,0.00024560167,0.00003873197,0.0001336305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048133073,0.0003322072,0.0005113187,0.00044053912,0.00010553427,0.00024390494,0.00029048283,0.00013371134,0.000013873766],"category_scores_gemma":[0.000018079401,0.00028556513,0.000027443637,0.00016093292,0.0014577536,0.000255148,0.0004212762,0.00024299188,5.891619e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008806159,0.000023286599,0.0000021005858,0.0022360387,0.000029571049,0.000014366116,0.00091183593,0.034432817,0.000012291385,0.9084931,0.000016921078,0.05381889],"study_design_scores_gemma":[0.00020056624,0.00011444392,0.00006389346,0.00045884465,0.000022380314,0.000051817227,0.000008197397,0.8064054,0.0022369176,0.19000888,0.0000903157,0.00033832787],"about_ca_topic_score_codex":6.49258e-7,"about_ca_topic_score_gemma":4.2998414e-7,"teacher_disagreement_score":0.7719726,"about_ca_system_score_codex":0.000047398178,"about_ca_system_score_gemma":0.000033977245,"threshold_uncertainty_score":0.99995965},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.013030508903254086,"score_gpt":0.2860274778890046,"score_spread":0.27299696898575054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214715666","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005198501,0.00063965534,0.009116262,0.0031054763,0.00030943993,0.00083247863,0.00003718053,0.0000767196,0.9806843],"genre_scores_gemma":[0.13274579,0.0029871045,0.42895368,0.0043253847,0.0013405246,0.00014452405,0.00017957523,0.00037443085,0.428949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973692,0.000019254307,0.0004521383,0.00061299343,0.00096456445,0.00058182294],"domain_scores_gemma":[0.998465,0.00028209924,0.000071588336,0.0005072565,0.00013778206,0.0005362964],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00082511635,0.00030872974,0.00062784867,0.00022156117,0.00012343937,0.00013857255,0.00038600608,0.0002669256,0.0002871911],"category_scores_gemma":[0.0003678163,0.00021083844,0.00009298667,0.00035852892,0.011520918,0.000063302534,0.0006219151,0.0006854141,0.000026724289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002768389,0.00007549799,0.0000054627826,0.00060780585,0.000012911313,0.00010485274,0.00010503508,5.335776e-8,0.0001796703,0.99485373,0.0007769799,0.0032503256],"study_design_scores_gemma":[0.00052613154,0.0004064006,0.000016025946,0.0011202493,0.00004066471,0.00038083098,0.000024595729,0.0056323498,0.0011737996,0.9782329,0.012076039,0.0003699791],"about_ca_topic_score_codex":5.0622907e-7,"about_ca_topic_score_gemma":2.4690246e-7,"teacher_disagreement_score":0.5517353,"about_ca_system_score_codex":0.00010717228,"about_ca_system_score_gemma":0.0004770218,"threshold_uncertainty_score":0.99116915},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Disease; Transmission (telecommunications); Medicine; Telecommunications","score_opus":0.01747800500188925,"score_gpt":0.2752609431465875,"score_spread":0.25778293814469827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W584348562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026826167,0.00037157422,0.9188763,0.0007438193,0.000066853456,0.00047855382,0.0000399998,0.00003383102,0.052562922],"genre_scores_gemma":[0.91294557,0.0007558161,0.08466209,0.00024818184,0.00004719824,0.00002289338,0.000047215097,0.000037091824,0.0012339284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976166,0.000042288397,0.00084080885,0.0006863548,0.00037967568,0.00043425555],"domain_scores_gemma":[0.998104,0.000569589,0.00012952065,0.00052421616,0.00011120974,0.0005614879],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015017762,0.00036761508,0.0015060728,0.00045904377,0.00015699332,0.000042142623,0.00028930642,0.00036915086,0.00012330285],"category_scores_gemma":[0.00020620858,0.0002506845,0.00021178885,0.0003470975,0.0075988504,0.0001558905,0.00036756147,0.0006495841,0.0000010026616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014000664,0.00010747069,0.000013881207,0.0007837328,0.00013666607,0.000016390222,0.00046550747,0.0012025525,0.000014364324,0.9961872,0.0000017508306,0.0009304442],"study_design_scores_gemma":[0.00013707801,0.00009823921,0.000012825553,0.00028467827,0.00058334996,0.000010552157,0.0000050859285,0.5048323,0.0000072024795,0.49388754,0.000007633665,0.000133511],"about_ca_topic_score_codex":0.0000012621232,"about_ca_topic_score_gemma":9.585876e-7,"teacher_disagreement_score":0.8861194,"about_ca_system_score_codex":0.000022674945,"about_ca_system_score_gemma":0.00015948559,"threshold_uncertainty_score":0.9999945},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005591287886771758,"score_gpt":0.21726598226837932,"score_spread":0.21167469438160755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87405696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38026613,0.000014439402,0.61659133,0.0022000412,0.00018628665,0.00022788483,0.0000076056995,0.000025474093,0.00048079214],"genre_scores_gemma":[0.9699089,0.0000038648413,0.02975396,0.0002966561,0.000013252117,0.000011730111,7.7414086e-7,0.0000075412117,0.000003355154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810207,0.00007082228,0.00035225242,0.00042652045,0.00069850625,0.00034981055],"domain_scores_gemma":[0.9984798,0.00024247922,0.00013352338,0.00092390564,0.00012896633,0.00009131834],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001139426,0.00019592706,0.00020324676,0.00006276269,0.0003262204,0.000320872,0.0015908031,0.000045601995,0.000013189621],"category_scores_gemma":[0.00029658154,0.00010443305,0.00007432405,0.0009015154,0.0028404314,0.00044315011,0.0010297621,0.00021378316,0.0000051063557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064163937,0.00007515752,0.0000096323865,0.000010353735,0.0000029096434,0.0000022406898,0.0010106562,0.00047759336,0.0017337309,0.99645275,0.000006404677,0.00021215517],"study_design_scores_gemma":[0.0002517211,0.00022917328,0.0007282297,0.00014728647,0.000003923614,0.000026483049,0.00004528377,0.12242184,0.030973667,0.84498245,0.000015220752,0.00017473262],"about_ca_topic_score_codex":0.0000028470636,"about_ca_topic_score_gemma":7.9567474e-7,"teacher_disagreement_score":0.5896427,"about_ca_system_score_codex":0.00008498911,"about_ca_system_score_gemma":0.00011303147,"threshold_uncertainty_score":0.9998733},"labels":[],"label_agreement":null}]}