{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069484495,0.021699326,0.6894992,0.0050102076,0.0013192078,0.00012881072,0.00084522506,0.0011912697,0.21082228],"genre_scores_gemma":[0.5724429,0.009335271,0.2727707,0.00082640705,0.0011445641,0.00022324942,0.0019604221,0.0009706182,0.14032583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997044,0.000063861524,0.000009459951,0.00006384186,0.00012602542,0.000032498137],"domain_scores_gemma":[0.99890244,0.0007231098,0.000060322545,0.00012973488,0.00012571676,0.000058544112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047663238,0.0003704544,0.00075195526,0.0007563265,0.0005521102,0.0010434714,0.0015167508,0.001000462,0.010972217],"category_scores_gemma":[0.00423631,0.00038954016,0.00033643714,0.0008921951,0.00074326183,0.0017357325,0.0010563682,0.0015102884,0.0022803782],"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.00015350021,0.00008038368,0.0011428972,0.00045200367,0.0000634707,0.00017838065,0.00017124119,0.094717525,0.003579101,0.5950604,0.08617191,0.21822916],"study_design_scores_gemma":[0.00003175468,0.00006877764,0.0008924232,0.0001176037,0.000032322056,0.00030295862,0.00008017161,0.2617998,0.0033504097,0.6739774,0.05932085,0.000025489311],"about_ca_topic_score_codex":0.00091669534,"about_ca_topic_score_gemma":0.0018860328,"teacher_disagreement_score":0.010972217,"about_ca_system_score_codex":0.0008584416,"about_ca_system_score_gemma":0.00039745154,"threshold_uncertainty_score":0.036705792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014644148,0.00030559703,0.973624,0.0000359777,0.00004015777,0.000076575416,0.000165177,0.0022478986,0.008860535],"genre_scores_gemma":[0.1895343,0.00047537996,0.79438597,0.00002990395,0.000011428354,0.00008394572,0.00093110965,0.00053921825,0.0140087325],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989927,0.000009064916,0.0000043253285,0.0000222872,0.000055213564,0.000009860842],"domain_scores_gemma":[0.99988306,0.00004361338,0.000009410501,0.00002714144,0.00003061622,0.0000060903385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013017052,0.00043817048,0.00021793286,0.00043102296,0.0002100775,0.00038103317,0.00080514245,0.00037838586,0.0057698586],"category_scores_gemma":[0.00035811425,0.0002747576,0.00028701275,0.00045494258,0.00025889053,0.00044259612,0.00039529568,0.0005531465,0.0015905155],"study_design_candidate":"bench_or_experimental","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.00011404106,0.00006775209,0.0004897005,0.0003441864,0.000020789961,0.00030715478,0.00022928193,0.1140925,0.110610604,0.034003478,0.009356929,0.73036355],"study_design_scores_gemma":[0.00005952251,0.00020049381,0.00065243605,0.0000619857,0.000025485335,0.0005957427,0.00006500923,0.79771256,0.111533456,0.035163946,0.053886443,0.000042867465],"about_ca_topic_score_codex":0.0005273459,"about_ca_topic_score_gemma":0.0011233767,"teacher_disagreement_score":0.0057698586,"about_ca_system_score_codex":0.0002013936,"about_ca_system_score_gemma":0.00023412802,"threshold_uncertainty_score":0.01930207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030922564,0.00046092283,0.9869658,0.00012346015,0.000062167404,0.000025035393,0.00007750949,0.0006375645,0.008555236],"genre_scores_gemma":[0.13053064,0.0013766412,0.8471521,0.00012768077,0.00010178726,0.00016406752,0.0005510234,0.00046491268,0.019531196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947375,0.000104779596,0.00003629359,0.00010216826,0.00023292704,0.000050086015],"domain_scores_gemma":[0.9993217,0.0002486584,0.000056509445,0.00021975757,0.00011660233,0.000036820456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005886464,0.0012024564,0.0011893156,0.0013385868,0.00074613135,0.0023805357,0.002424656,0.0011557934,0.012886752],"category_scores_gemma":[0.00256313,0.0009295838,0.0017813068,0.0018069131,0.0012543411,0.0031791104,0.0030184458,0.0029608842,0.0040615126],"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.000052755284,0.00004946933,0.00023976277,0.00018020801,0.00004678546,0.000052008418,0.00011933854,0.1365813,0.0026771678,0.6002769,0.008017927,0.25170642],"study_design_scores_gemma":[0.000018979643,0.000032909487,0.0001378202,0.000045131037,0.000021858437,0.00008616125,0.00004345544,0.43904147,0.0015136466,0.53992647,0.019110119,0.000021858708],"about_ca_topic_score_codex":0.0015521041,"about_ca_topic_score_gemma":0.0018529826,"teacher_disagreement_score":0.012886752,"about_ca_system_score_codex":0.0011991846,"about_ca_system_score_gemma":0.00065991835,"threshold_uncertainty_score":0.04311049},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020426616,0.0020079843,0.9684257,0.0006733228,0.00027937733,0.00014272572,0.0005008386,0.00094989553,0.0065936325],"genre_scores_gemma":[0.16918445,0.0015501712,0.8198995,0.00061318,0.0003243654,0.00029570117,0.002603593,0.0003238197,0.0052053165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939492,0.0012668837,0.00038794582,0.0012141884,0.002794185,0.00038767047],"domain_scores_gemma":[0.9933971,0.003235741,0.00055382244,0.0012752446,0.0013064289,0.00023160785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024514138,0.0013597705,0.0025649946,0.0031969778,0.0018508099,0.0027023559,0.004049787,0.0023103424,0.0054482776],"category_scores_gemma":[0.021976186,0.000572596,0.0014481243,0.00553706,0.0016578016,0.0069342963,0.0038912927,0.003549027,0.0034717529],"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.00070193916,0.00029460443,0.004186301,0.00046372807,0.00019380772,0.00026452556,0.00038318054,0.2611492,0.0041092904,0.14860722,0.01711447,0.56253177],"study_design_scores_gemma":[0.000052957254,0.00015935727,0.00090520637,0.0000721754,0.000038479302,0.0004040016,0.0001607763,0.75381666,0.0030146136,0.2280261,0.013277443,0.000072230214],"about_ca_topic_score_codex":0.005006228,"about_ca_topic_score_gemma":0.0049217097,"teacher_disagreement_score":0.0054482776,"about_ca_system_score_codex":0.002227175,"about_ca_system_score_gemma":0.001912076,"threshold_uncertainty_score":0.018226326},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42621166,0.009396678,0.54698867,0.0068781083,0.00056054373,0.00019121204,0.0016076834,0.0010211994,0.0071443333],"genre_scores_gemma":[0.9064736,0.0008875971,0.09000171,0.0004154028,0.00024008629,0.00013619539,0.0012534506,0.0003182147,0.00027382132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9245274,0.048760112,0.005235866,0.009884989,0.010389932,0.001201658],"domain_scores_gemma":[0.39228258,0.5272963,0.020413386,0.033259887,0.022585794,0.004162123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.072060265,0.0012371134,0.0031091385,0.009774715,0.003480337,0.0070874062,0.004414887,0.007941742,0.002198511],"category_scores_gemma":[0.5455394,0.0014785914,0.0023499127,0.0108625395,0.00696162,0.018161373,0.0052485717,0.005686683,0.0008775573],"study_design_candidate":"simulation_or_modeling","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.0016811043,0.0002904635,0.31672585,0.003020161,0.008440174,0.0016650537,0.015435068,0.1949884,0.004707346,0.08694792,0.015769035,0.3503295],"study_design_scores_gemma":[0.0001478101,0.000353695,0.04204838,0.00066763797,0.0012815502,0.0010781874,0.004189245,0.25079006,0.003043693,0.69127864,0.0048469114,0.00027417648],"about_ca_topic_score_codex":0.0020657287,"about_ca_topic_score_gemma":0.0029377271,"teacher_disagreement_score":0.072060265,"about_ca_system_score_codex":0.0017759706,"about_ca_system_score_gemma":0.0015243406,"threshold_uncertainty_score":0.38109565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06953255,0.0075593893,0.8465607,0.0127414,0.0007529667,0.00014562503,0.002015148,0.0003741764,0.060318064],"genre_scores_gemma":[0.8405085,0.00559244,0.042537026,0.0016532214,0.0012694809,0.00048000485,0.0011341248,0.00022444058,0.10660079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993799,0.0002390604,0.000025460824,0.000104229504,0.00012699976,0.00012434588],"domain_scores_gemma":[0.99788946,0.0013884756,0.00028498936,0.000071965114,0.0002510273,0.0001140358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016253863,0.0009629605,0.0016260613,0.0010185713,0.0006955194,0.0016236354,0.0026486823,0.0025550495,0.008885437],"category_scores_gemma":[0.005898834,0.0007105671,0.0016860379,0.00085616857,0.001218491,0.002328447,0.0013321774,0.0027903905,0.0008071051],"study_design_candidate":"simulation_or_modeling","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.00005356475,0.000058596605,0.0013911307,0.00017595092,0.00010477692,0.00031549734,0.000177556,0.40137014,0.00090976874,0.57823384,0.00901004,0.0081991125],"study_design_scores_gemma":[0.00001294903,0.000020232628,0.00041971827,0.000018851099,0.000035925957,0.0001357116,0.0000262877,0.88238275,0.000084394494,0.115395084,0.0014470438,0.00002104826],"about_ca_topic_score_codex":0.0104996925,"about_ca_topic_score_gemma":0.0072652157,"teacher_disagreement_score":0.0104996925,"about_ca_system_score_codex":0.0026729272,"about_ca_system_score_gemma":0.00215099,"threshold_uncertainty_score":0.029724777},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002937023,0.11901394,0.8445324,0.0003888247,0.00046051777,0.00007695767,0.0002441685,0.0019205019,0.030425787],"genre_scores_gemma":[0.036769703,0.18873118,0.7419114,0.00037947766,0.00064002664,0.00020985534,0.0014550575,0.0010198766,0.02888337],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916077,0.000094138915,0.00007910586,0.00008621718,0.00054255023,0.00003729825],"domain_scores_gemma":[0.99950683,0.00021234917,0.000018303504,0.000092238115,0.00014702954,0.000023160095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007585504,0.0009810798,0.0013172356,0.00293503,0.00050742395,0.0018893254,0.0017732776,0.001136871,0.009560063],"category_scores_gemma":[0.0015560011,0.0008786969,0.0013276372,0.0073288674,0.0007331291,0.002366044,0.0013061085,0.0014889756,0.0062051136],"study_design_candidate":"not_applicable","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.000029876039,0.000049205006,0.000269797,0.0016060061,0.00004049165,0.00014822336,0.00030335,0.014582787,0.005927733,0.08738616,0.02012221,0.86953413],"study_design_scores_gemma":[0.00002306442,0.00007452795,0.00049937045,0.0006614599,0.00005320804,0.0013765771,0.000082386185,0.074841715,0.0048746564,0.11093947,0.8065045,0.00006907956],"about_ca_topic_score_codex":0.0011895326,"about_ca_topic_score_gemma":0.0012997375,"teacher_disagreement_score":0.009560063,"about_ca_system_score_codex":0.00058508024,"about_ca_system_score_gemma":0.00067152735,"threshold_uncertainty_score":0.031981528},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034572322,0.043898605,0.032903846,0.3747556,0.018044682,0.00008978985,0.00086850376,0.00047367217,0.49439305],"genre_scores_gemma":[0.646107,0.04622046,0.021366993,0.02379237,0.04809885,0.00030851428,0.002023985,0.0007446641,0.21133721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961175,0.0014475463,0.00011586258,0.0006117332,0.0014833974,0.00022401015],"domain_scores_gemma":[0.95461154,0.0317582,0.0020018788,0.004436424,0.005823822,0.0013681474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006098935,0.00054034754,0.0011507488,0.0023241176,0.002988926,0.007737347,0.0020978954,0.0041843196,0.038879983],"category_scores_gemma":[0.050419666,0.00052666076,0.00055275834,0.0028347757,0.0074716047,0.022159385,0.0025078144,0.0046296413,0.0074397484],"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.0000520399,0.00006128694,0.0007972106,0.00042251023,0.000030072286,0.00014558612,0.00063045137,0.0009446719,0.00013390703,0.7977828,0.13086826,0.068131186],"study_design_scores_gemma":[0.0000091894,0.0000073665465,0.0001736239,0.00011389673,0.000006387202,0.00007384021,0.00025124985,0.00057620317,0.000067572575,0.9558333,0.04287849,0.00000889026],"about_ca_topic_score_codex":0.0006431708,"about_ca_topic_score_gemma":0.00094038283,"teacher_disagreement_score":0.038879983,"about_ca_system_score_codex":0.0022019949,"about_ca_system_score_gemma":0.0016869331,"threshold_uncertainty_score":0.13006651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03963701,0.00041829978,0.94939756,0.0003272823,0.00008632432,0.000025171068,0.00013396797,0.00042908586,0.0095453365],"genre_scores_gemma":[0.6970721,0.0009813309,0.29072192,0.00031386505,0.00039074442,0.000085101005,0.000416046,0.00024174867,0.009777158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993174,0.00021476301,0.000042891406,0.00012837311,0.00021560008,0.00008094168],"domain_scores_gemma":[0.9987884,0.0004898919,0.00013489692,0.00035594674,0.00015828155,0.00007259087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001349097,0.0006537405,0.0007525893,0.001834059,0.0004158326,0.0017031392,0.0010290464,0.0008744947,0.0040791663],"category_scores_gemma":[0.006753579,0.00034587798,0.00046712073,0.0014521304,0.001592202,0.0035635112,0.0016578331,0.0017065689,0.0007993985],"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.00020902194,0.000049491908,0.0007946963,0.000095411255,0.000017236287,0.00011067646,0.00016462948,0.018702058,0.008839859,0.7296346,0.003360261,0.23802216],"study_design_scores_gemma":[0.00001397599,0.00004922369,0.00038749017,0.000023259165,0.000012234181,0.0002021018,0.000049325572,0.22556537,0.0023493392,0.7685265,0.002791389,0.000029854426],"about_ca_topic_score_codex":0.0004733171,"about_ca_topic_score_gemma":0.0003287071,"teacher_disagreement_score":0.0040791663,"about_ca_system_score_codex":0.00044953843,"about_ca_system_score_gemma":0.0004469342,"threshold_uncertainty_score":0.013646185},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083821915,0.00030740787,0.90660095,0.00029635883,0.000030274528,0.00020058878,0.000029517065,0.0018472559,0.006865755],"genre_scores_gemma":[0.40744302,0.00033964418,0.58702815,0.00014783014,0.000016438811,0.00035113018,0.00009352962,0.00033439,0.0042458805],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991373,0.0002771231,0.00009226022,0.000098940654,0.0002964264,0.00009790722],"domain_scores_gemma":[0.99842936,0.0007081672,0.00012843077,0.0004308332,0.00026428342,0.00003897961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086540484,0.0006487181,0.00028976885,0.00066863926,0.00049787195,0.0013626134,0.0013637416,0.0006905694,0.0034431608],"category_scores_gemma":[0.0037821217,0.00041339884,0.0003673566,0.00063385384,0.0007783644,0.0019697412,0.0008474571,0.0008045159,0.0006654457],"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.0002549695,0.00034570057,0.0023131424,0.0005836274,0.0000701782,0.00024159717,0.0011206777,0.13177928,0.10480062,0.30425707,0.0029376815,0.45129547],"study_design_scores_gemma":[0.00016485903,0.00040938836,0.00081457134,0.00011028988,0.00012019031,0.00031714237,0.0003184354,0.7797103,0.08448948,0.10413671,0.029346827,0.000061839586],"about_ca_topic_score_codex":0.00089779514,"about_ca_topic_score_gemma":0.0016283225,"teacher_disagreement_score":0.0034431608,"about_ca_system_score_codex":0.0006383151,"about_ca_system_score_gemma":0.0008897438,"threshold_uncertainty_score":0.011518478},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4666645,0.0018192374,0.3478919,0.004751668,0.00038109638,0.00008029459,0.0003728798,0.00080463,0.17723374],"genre_scores_gemma":[0.96949154,0.00036363053,0.024720225,0.00019903069,0.00024371684,0.00004899826,0.0000838932,0.00018381192,0.0046650274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968316,0.0010705435,0.00019834648,0.00072129664,0.000862733,0.00031548415],"domain_scores_gemma":[0.9681254,0.019096205,0.0017829735,0.008312693,0.0017219774,0.0009607387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039025818,0.00044100612,0.0011314481,0.0013898404,0.0010602742,0.0027776805,0.001172226,0.0010905598,0.009006573],"category_scores_gemma":[0.037192546,0.0005699296,0.0005259705,0.0023711359,0.004615345,0.008613784,0.006051542,0.0025408005,0.0010572441],"study_design_candidate":"simulation_or_modeling","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.00014589795,0.000042090556,0.0042060385,0.00011814342,0.000026275797,0.00013696149,0.0008767922,0.008391909,0.0041766893,0.90809476,0.0017007495,0.07208368],"study_design_scores_gemma":[0.000030294865,0.000052058484,0.0017881986,0.000021636028,0.000019030971,0.0001892949,0.00012201325,0.0102936905,0.0017279917,0.98187596,0.003869992,0.000009873335],"about_ca_topic_score_codex":0.00021042732,"about_ca_topic_score_gemma":0.0003402298,"teacher_disagreement_score":0.009006573,"about_ca_system_score_codex":0.0007911711,"about_ca_system_score_gemma":0.0004040073,"threshold_uncertainty_score":0.03012997},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025990594,0.05106524,0.7210466,0.026965158,0.0043011783,0.00007730522,0.0010521625,0.00089307147,0.19200018],"genre_scores_gemma":[0.2729454,0.07631871,0.28397813,0.011264048,0.016945502,0.0010083568,0.0019002515,0.0012831151,0.33435646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983901,0.0008338754,0.000120686804,0.00022122127,0.0003601088,0.000074039024],"domain_scores_gemma":[0.99594903,0.0026018233,0.00022417099,0.0006761771,0.00039055233,0.00015820636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036881384,0.001530737,0.0016132793,0.004690681,0.0011981684,0.00472849,0.0012383744,0.0019667607,0.020388396],"category_scores_gemma":[0.009768227,0.00074313575,0.0011977837,0.0029375637,0.0051846467,0.008114164,0.0037009248,0.0044293473,0.0063978834],"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.0000010579525,0.0000036182337,0.000048147787,0.000034484605,0.000006539452,0.000013246692,0.000077540884,0.00027144427,0.000022805089,0.9818779,0.009362846,0.008280487],"study_design_scores_gemma":[0.0000013494772,0.0000014981548,0.000032872547,0.000027368174,0.0000032339378,0.000028123171,0.000022042113,0.0006251871,0.000014316756,0.96751696,0.031723972,0.000003012017],"about_ca_topic_score_codex":0.0012298204,"about_ca_topic_score_gemma":0.0011059485,"teacher_disagreement_score":0.020388396,"about_ca_system_score_codex":0.0023002175,"about_ca_system_score_gemma":0.0013259174,"threshold_uncertainty_score":0.06820595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063145487,0.00012647737,0.98660046,0.00009327395,0.00007244784,0.00007056854,0.0001228181,0.00074554037,0.0058539324],"genre_scores_gemma":[0.08112083,0.00027497808,0.90849984,0.00014508537,0.00006943822,0.00020225457,0.0006255506,0.00069061544,0.008371372],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995778,0.00009327943,0.000021846517,0.0000940591,0.00015436707,0.000058773683],"domain_scores_gemma":[0.9989772,0.00032145093,0.00004141377,0.00039106235,0.0002074264,0.00006142176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058900274,0.00063918415,0.0008266687,0.0013276626,0.0009219684,0.00089107954,0.0018627367,0.0010127404,0.01607524],"category_scores_gemma":[0.0021902001,0.0006246378,0.0009865994,0.0017931535,0.00085386547,0.002231925,0.0026575488,0.0015638154,0.0033071844],"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.00015945335,0.00010272643,0.00048616316,0.0003566441,0.000039694412,0.00017363188,0.00032114307,0.030327024,0.015902236,0.16852373,0.019722898,0.76388466],"study_design_scores_gemma":[0.000079357014,0.00011233936,0.00041075493,0.00009941891,0.0000955007,0.0004581809,0.00018085088,0.55210465,0.013604779,0.38421968,0.048588153,0.000046299083],"about_ca_topic_score_codex":0.00087850855,"about_ca_topic_score_gemma":0.0018622112,"teacher_disagreement_score":0.01607524,"about_ca_system_score_codex":0.00037234102,"about_ca_system_score_gemma":0.0007165198,"threshold_uncertainty_score":0.0537771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039706282,0.004886181,0.53007394,0.24549562,0.003666716,0.00020822855,0.0007331113,0.0017982662,0.17343162],"genre_scores_gemma":[0.7324427,0.0037644508,0.22132428,0.00744117,0.003928567,0.00024055933,0.0007201212,0.0006699694,0.029468242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946062,0.0033418005,0.00023874106,0.0006742313,0.0008298757,0.0003092074],"domain_scores_gemma":[0.95156026,0.035308175,0.0015634586,0.0074195475,0.003465821,0.0006827523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011233872,0.0007177852,0.0011407677,0.0017709362,0.0036482064,0.007786543,0.0033216544,0.003927671,0.015005865],"category_scores_gemma":[0.048952647,0.0007644534,0.0017214344,0.0022428264,0.018722657,0.031533614,0.0029990487,0.007114904,0.004251679],"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.000020367703,0.000030103121,0.00025117092,0.00008480718,0.000018375154,0.000023392431,0.0003969446,0.0010775198,0.00005864341,0.9692457,0.009414483,0.019378547],"study_design_scores_gemma":[0.0000037672703,0.0000019442798,0.000029975907,0.00001665279,0.0000037007694,0.0000088119,0.00009464727,0.0011910461,0.00006264161,0.9952285,0.0033545662,0.0000038116993],"about_ca_topic_score_codex":0.002208352,"about_ca_topic_score_gemma":0.0017288662,"teacher_disagreement_score":0.015005865,"about_ca_system_score_codex":0.002430632,"about_ca_system_score_gemma":0.0029782322,"threshold_uncertainty_score":0.05941105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002892855,0.08479041,0.60422146,0.028163882,0.0062425695,0.000115619885,0.0036353285,0.0009923717,0.2689455],"genre_scores_gemma":[0.13178988,0.1560098,0.34310684,0.010478177,0.014169045,0.00081697677,0.0030693307,0.00062723266,0.3399328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976546,0.00006852707,0.000016964066,0.00004780549,0.000085934655,0.000015345368],"domain_scores_gemma":[0.99924195,0.00051384955,0.000040319643,0.000063935615,0.00010233977,0.000037668306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071585906,0.0010468069,0.00076998456,0.0009986103,0.00039765087,0.0013814055,0.0012504833,0.0014959245,0.02031013],"category_scores_gemma":[0.0015579981,0.0004453432,0.001013713,0.001272964,0.0010373263,0.0018215957,0.00085897994,0.003207419,0.0056803217],"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.0000081145,0.000037338486,0.00018609782,0.00022397623,0.000021428872,0.0000847698,0.0001410678,0.009668689,0.00044351394,0.8681799,0.07768038,0.043324664],"study_design_scores_gemma":[0.000005431828,0.000017389078,0.00027085852,0.00012521283,0.000012822013,0.00019272818,0.000024428698,0.013280333,0.000098999175,0.67281234,0.31314155,0.000017856333],"about_ca_topic_score_codex":0.0019273178,"about_ca_topic_score_gemma":0.0018522826,"teacher_disagreement_score":0.02031013,"about_ca_system_score_codex":0.0010722363,"about_ca_system_score_gemma":0.00092632306,"threshold_uncertainty_score":0.06794417},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00849608,0.16847916,0.16699755,0.04335681,0.004013746,0.00010780378,0.0011438248,0.0008581923,0.6065468],"genre_scores_gemma":[0.33729926,0.1363992,0.10670932,0.011070146,0.0063597183,0.00048066903,0.0029809945,0.0009702487,0.39773047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999113,0.0003057874,0.000040884177,0.00021821048,0.00026923692,0.00005280457],"domain_scores_gemma":[0.99876714,0.00069497165,0.000064937725,0.0002712567,0.00014163047,0.000060121187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009796754,0.00085299934,0.0011576059,0.0032044763,0.001979746,0.005642545,0.0012232589,0.0019203174,0.015142714],"category_scores_gemma":[0.003218266,0.00066004286,0.00079366064,0.0053574718,0.0067313723,0.012187368,0.0024828918,0.0028558879,0.0044284365],"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.0000030015754,0.0000053835383,0.000036946833,0.000047284568,0.0000050988447,0.000013227416,0.0001228647,0.00028096774,0.0000313335,0.9686772,0.016926248,0.013850342],"study_design_scores_gemma":[0.0000016162252,0.00000110063,0.000027375223,0.000026398775,0.000002718827,0.0000339804,0.00004690131,0.00035673272,0.000033045235,0.9474689,0.05199849,0.000002724475],"about_ca_topic_score_codex":0.0035912711,"about_ca_topic_score_gemma":0.0032108326,"teacher_disagreement_score":0.015142714,"about_ca_system_score_codex":0.0031455217,"about_ca_system_score_gemma":0.0014433992,"threshold_uncertainty_score":0.05065739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042982404,0.043840785,0.6953538,0.0021506927,0.0017523677,0.00007494048,0.00025292207,0.00065612723,0.25162014],"genre_scores_gemma":[0.17110279,0.065240994,0.5606069,0.00083674357,0.0033708133,0.00035828515,0.00094277086,0.00051290984,0.19702774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993543,0.00010627249,0.000027839727,0.000068464404,0.0004127633,0.000030333878],"domain_scores_gemma":[0.99953675,0.00022154507,0.00003065846,0.00009739922,0.000100583624,0.000013125353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041332576,0.0016012006,0.0013588986,0.0015971046,0.0006424806,0.002307347,0.0017397966,0.0010336195,0.012525248],"category_scores_gemma":[0.0013622377,0.0009108971,0.00080831157,0.003130065,0.0026698313,0.0023517422,0.0010134011,0.0021408214,0.0040751025],"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.000013311075,0.000023899778,0.00014805919,0.00031932996,0.00002253392,0.000052566502,0.00006870941,0.044744905,0.00085205346,0.76796067,0.025381055,0.1604129],"study_design_scores_gemma":[0.000008154653,0.000030715757,0.00041283155,0.0001115038,0.000018146684,0.00030139522,0.000041046445,0.08115609,0.00072536524,0.7252669,0.19190809,0.000019812056],"about_ca_topic_score_codex":0.0015829327,"about_ca_topic_score_gemma":0.002031717,"teacher_disagreement_score":0.012525248,"about_ca_system_score_codex":0.0010278005,"about_ca_system_score_gemma":0.0008592866,"threshold_uncertainty_score":0.04190117},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00367017,0.007470243,0.097528085,0.009289547,0.0074920035,0.0002251382,0.05855361,0.09157977,0.7241914],"genre_scores_gemma":[0.04600941,0.004911769,0.12136449,0.0072896634,0.0025315376,0.0007572027,0.16548172,0.036241937,0.61541224],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908495,0.00014064934,0.00006432675,0.00029879718,0.00032532515,0.00008586847],"domain_scores_gemma":[0.99794,0.00050355284,0.00006685522,0.0008465291,0.00046329555,0.00017981205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107617,0.0010361361,0.0011996261,0.0021174538,0.0014550353,0.0029296973,0.0023529888,0.0010634677,0.23280868],"category_scores_gemma":[0.00470989,0.00063452625,0.00084490766,0.002710936,0.0006862391,0.0023448442,0.0021679334,0.0015032543,0.18864489],"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.00008866807,0.000017598564,0.00015654018,0.00014170064,0.000012838747,0.000042808602,0.000031640313,0.00030069,0.0006522934,0.015140668,0.8830759,0.100338586],"study_design_scores_gemma":[0.000042000567,0.00001701225,0.00031071887,0.00006195258,0.00001888467,0.00015016457,0.000040494262,0.0020478014,0.0016646516,0.03488776,0.9607401,0.000018471696],"about_ca_topic_score_codex":0.0035835258,"about_ca_topic_score_gemma":0.006762996,"teacher_disagreement_score":0.23280868,"about_ca_system_score_codex":0.000781854,"about_ca_system_score_gemma":0.0015993234,"threshold_uncertainty_score":0.7788226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008048501,0.031698447,0.8281121,0.01142582,0.0019931963,0.000080736885,0.00083555665,0.0003232686,0.11748224],"genre_scores_gemma":[0.44911626,0.08158402,0.30260223,0.004771008,0.0064243968,0.00084696757,0.002336292,0.00059329544,0.15172541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908185,0.00034416892,0.000055026972,0.00015487957,0.00030332335,0.000060682956],"domain_scores_gemma":[0.99903166,0.0005567104,0.000107894935,0.00011465143,0.00013721756,0.000051901683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447147,0.0015608141,0.0010028229,0.0014585839,0.0005467406,0.0027996753,0.001771737,0.0015039839,0.005215819],"category_scores_gemma":[0.0036839216,0.000479385,0.0014529265,0.0015013118,0.001211037,0.002988217,0.0017272984,0.002915057,0.0016918475],"study_design_candidate":"simulation_or_modeling","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.000004241575,0.000021066107,0.00020329093,0.00010742972,0.0000444316,0.00007974269,0.00012279172,0.020239543,0.00027053742,0.9536183,0.010316997,0.014971746],"study_design_scores_gemma":[0.000003585173,0.000008535676,0.000093825896,0.00003959422,0.000011809727,0.00010485688,0.00003481767,0.051690985,0.00006869237,0.9132577,0.034676235,0.000009390909],"about_ca_topic_score_codex":0.00169385,"about_ca_topic_score_gemma":0.0013303485,"teacher_disagreement_score":0.005215819,"about_ca_system_score_codex":0.0018637611,"about_ca_system_score_gemma":0.0010551915,"threshold_uncertainty_score":0.017448664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4068544,0.002387363,0.51013786,0.0037693486,0.00043138562,0.00007185936,0.00034563747,0.00027804737,0.0757241],"genre_scores_gemma":[0.96433073,0.0022430487,0.016002554,0.00025124644,0.0010371258,0.00008643231,0.00024022807,0.00020665649,0.015602003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950767,0.00022298186,0.000014352711,0.00008178759,0.000105773,0.00006743292],"domain_scores_gemma":[0.9948086,0.0037114616,0.00039558843,0.00033213355,0.0004266636,0.0003254965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017958542,0.00081040466,0.0008091716,0.0022599224,0.00081034715,0.0019775548,0.001162034,0.00072922185,0.008258899],"category_scores_gemma":[0.010336539,0.00041453677,0.00037276774,0.0013753996,0.0033964445,0.0034049484,0.0013892964,0.0015045968,0.00115449],"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.0001717931,0.000025316369,0.0006372296,0.00004010912,0.0000094002935,0.00014504696,0.00019002965,0.008281688,0.0022428164,0.97471184,0.0018096883,0.011734998],"study_design_scores_gemma":[0.000047208607,0.000051643023,0.0005874217,0.000037209884,0.00001380197,0.0003706427,0.00009261191,0.07773222,0.0015262885,0.91673964,0.0027743063,0.000026932794],"about_ca_topic_score_codex":0.00033757158,"about_ca_topic_score_gemma":0.0001989254,"teacher_disagreement_score":0.008258899,"about_ca_system_score_codex":0.00096541725,"about_ca_system_score_gemma":0.00050836,"threshold_uncertainty_score":0.02762878},"labels":[],"label_agreement":null}]}