{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":23,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":23,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"664228451d50","filters":{"venue":"Journal of Algorithms"}},"results":[{"id":"W2156623776","doi":"10.1006/jagm.2001.1195","title":"On Graph Powers for Leaf-Labeled Trees","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Gomory–Hu tree; Mathematics; Tree (set theory); Graph; K-ary tree; Spanning tree; Path (computing); Basis (linear algebra); Trémaux tree; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Computer science; Binary tree; Line graph; Artificial intelligence; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.03359346603976615,"gpt":0.3027998815668668,"spread":0.2692064155271007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006395846,0.0001273793,0.0002354613,0.0004244435,0.0001217402,0.00009093311,0.001045074,0.00005107694,0.00004433647],"category_scores_gemma":[0.0002179893,0.00009901651,0.0002315064,0.00050154,0.00007128929,0.0005336372,0.00005814444,0.0002902137,0.00002593883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004903602,"about_ca_system_score_gemma":0.00002407752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.431888e-7,"about_ca_topic_score_gemma":6.311886e-7,"domain_scores_codex":[0.9985064,0.00007176486,0.0003409511,0.0001877468,0.0005465663,0.000346585],"domain_scores_gemma":[0.9984966,0.0004571131,0.0002420202,0.0003318491,0.0002942011,0.0001782268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003722315,0.001290388,0.0001163931,0.00003790876,0.0004032319,0.0004687269,0.002169072,0.004201855,0.007837825,0.1827552,0.03441151,0.7659357],"study_design_scores_gemma":[0.009287728,0.01096123,0.0005601627,0.0002232687,0.00004353909,0.0007936193,0.0002757831,0.1835527,0.01590231,0.7330955,0.04439,0.0009142273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00971924,0.0006946633,0.9855723,0.002310569,0.000749701,0.0001735396,0.000003724788,0.00003619088,0.0007400155],"genre_scores_gemma":[0.4085287,0.0006586592,0.5845398,0.001246507,0.0008120199,0.00002209856,0.000001339647,0.00006987902,0.004121083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7650214,"threshold_uncertainty_score":0.4037776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114790712","doi":"10.1006/jagm.2000.1151","title":"Space Efficient Suffix Trees","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Space (punctuation); Computer science; Suffix tree; Artificial intelligence; Mathematics; Combinatorics; Linguistics; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01461430931628228,"gpt":0.2550175803153401,"spread":0.2404032709990578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000532933,0.0001431509,0.0002518429,0.0002047758,0.0001154866,0.000176401,0.00109397,0.0000579452,0.00004191485],"category_scores_gemma":[0.00005010357,0.000102865,0.0001462411,0.0004328592,0.00003616105,0.000539145,0.0002498618,0.0002550907,0.00004409507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005400351,"about_ca_system_score_gemma":0.00009498464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001506679,"about_ca_topic_score_gemma":0.000001331436,"domain_scores_codex":[0.9984152,0.00005821914,0.000423128,0.0001944132,0.000627315,0.000281665],"domain_scores_gemma":[0.9986703,0.00008882173,0.0003608662,0.0004215573,0.0002480759,0.0002104284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001054952,0.001431972,0.001372004,0.00001789955,0.0001629235,0.003005179,0.002184517,0.01655254,0.004415274,0.01428351,0.0406463,0.9158224],"study_design_scores_gemma":[0.002202529,0.001005101,0.01154974,0.0001920001,0.00003307231,0.004137198,0.0002121139,0.7194228,0.003439207,0.002406405,0.2548571,0.0005427315],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03197483,0.0008876005,0.962519,0.00192448,0.001448762,0.00005676291,0.000002247514,0.0000435877,0.001142665],"genre_scores_gemma":[0.3307252,0.0006837249,0.6649441,0.0004282363,0.001917217,0.000002328869,0.000002221731,0.00002989315,0.001267019],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9152797,"threshold_uncertainty_score":0.4194713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077583313","doi":"10.1006/jagm.2000.1108","title":"Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Necklace; Alphabet; Permutation (music); Algorithm; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01128066133810982,"gpt":0.2575280766633357,"spread":0.2462474153252258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001103193,0.0004485161,0.0007589398,0.0004367206,0.0003273809,0.0007739387,0.0015422,0.000181806,0.000399034],"category_scores_gemma":[0.00005291653,0.0003617124,0.000185948,0.0008638393,0.00008440263,0.002051366,0.0004568794,0.0004942092,0.0001065264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001216125,"about_ca_system_score_gemma":0.000279517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001661195,"about_ca_topic_score_gemma":0.000005749015,"domain_scores_codex":[0.9963835,0.0001795058,0.001080631,0.0006958219,0.0009360369,0.0007244547],"domain_scores_gemma":[0.9974239,0.0001272355,0.0004920425,0.0008263938,0.0003103511,0.0008200455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001007276,0.0002581525,0.0001615194,0.00001796835,0.0001209028,0.0002623814,0.0008049802,0.001447919,0.003423872,0.0002407755,0.0448735,0.9482873],"study_design_scores_gemma":[0.008751879,0.003280756,0.01337137,0.000678158,0.0001759516,0.003659684,0.0002597121,0.3790326,0.01658377,0.00206959,0.5696835,0.002453035],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5164453,0.01063307,0.4542044,0.009247213,0.005449508,0.0009968819,0.0001649502,0.000299811,0.002558904],"genre_scores_gemma":[0.03517928,0.002829263,0.9484095,0.002772768,0.003735807,0.00001964966,0.00001704988,0.0001075149,0.006929172],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9458343,"threshold_uncertainty_score":0.9998835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972805029","doi":"10.1006/jagm.2000.1133","title":"Constructing Optimal Trees from Quartets","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":77,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Phylogenetic tree; Tree rearrangement; Weight-balanced tree; Mathematics; Constraint (computer-aided design); Bounded function; Sequence (biology); Phylogenetic network; Time complexity; Combinatorics; Tree (set theory); Algorithm; Discrete mathematics; Biology; Binary search tree; Binary tree","retraction":null,"screen_n_in":null,"score":{"opus":0.01216860082937625,"gpt":0.2448619570061711,"spread":0.2326933561767948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001185387,0.00009561696,0.0001636579,0.00003086658,0.00004838346,0.00001990817,0.0001382343,0.00006151185,0.00002200034],"category_scores_gemma":[0.00003684581,0.00008082832,0.0001135996,0.00003826906,0.00005238292,0.000001085867,0.00004409154,0.00007931284,0.000002792204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001014086,"about_ca_system_score_gemma":0.00004328619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001771134,"about_ca_topic_score_gemma":0.00001724094,"domain_scores_codex":[0.9993552,0.00002354287,0.0002662064,0.0001098065,0.0001064446,0.0001387906],"domain_scores_gemma":[0.9994824,0.00001775471,0.0001982758,0.0001093835,0.0001251837,0.00006698671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002273406,0.0001256138,0.06488992,0.000003739076,0.0007332683,0.0001316092,0.0003917007,0.0005665419,0.7179931,0.00005042773,0.002972867,0.2119139],"study_design_scores_gemma":[0.008784433,0.005262681,0.1928498,0.0001358937,0.0004489097,0.004379855,0.01320215,0.001815183,0.4446501,0.001945418,0.3249569,0.00156871],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.992928,0.002823939,0.002802683,0.0002021445,0.000448958,0.00002804621,0.00001402099,9.729827e-7,0.0007512018],"genre_scores_gemma":[0.9747687,0.0006918602,0.02316478,0.00006937524,0.001176996,6.168109e-7,0.000004727277,0.00001059971,0.0001123161],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.321984,"threshold_uncertainty_score":0.3296083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137498124","doi":"10.1006/jagm.2000.1132","title":"Efficient Algorithms for Petersen's Matching Theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Carleton University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Algorithm; Planar graph; Discrete mathematics; Graph algorithms; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02189423848872213,"gpt":0.2809147616313767,"spread":0.2590205231426546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009394324,0.000124759,0.0001998103,0.0002616922,0.0001555481,0.0001644622,0.0004388571,0.00004526262,0.00001128937],"category_scores_gemma":[0.00005953081,0.000102486,0.0001962055,0.0003870031,0.00002106226,0.0002563613,0.00006682112,0.0001429057,0.000009473863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006341947,"about_ca_system_score_gemma":0.0001120583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002082536,"about_ca_topic_score_gemma":3.847944e-7,"domain_scores_codex":[0.9986444,0.00005212073,0.0004438589,0.0001787183,0.000449665,0.0002312753],"domain_scores_gemma":[0.9987185,0.0002258097,0.0003360417,0.0001707815,0.0004210463,0.0001278209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007553714,0.0003625984,0.00002722448,0.00002230393,0.000123549,0.0001782988,0.001787364,0.3513112,0.003272425,0.04746327,0.001693009,0.5936832],"study_design_scores_gemma":[0.001169854,0.0004405018,0.0006613691,0.00004263046,0.00002151333,0.001283424,0.0001243449,0.948006,0.001198061,0.03418802,0.01264864,0.0002156842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03921706,0.0002254088,0.9568641,0.001690489,0.001594943,0.000118683,0.000002199258,0.00002671662,0.0002604171],"genre_scores_gemma":[0.3059763,0.00003339555,0.6919147,0.0004046193,0.001309101,0.000004827707,0.000002451188,0.00001271884,0.0003418901],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5966948,"threshold_uncertainty_score":0.4179258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994612875","doi":"10.1006/jagm.2002.1221","title":"Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Háskóli Íslands; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Rectangle; Approximation algorithm; Combinatorics; Mathematics; Constant (computer programming); Space (punctuation); Algorithm; Discrete mathematics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04323806333478964,"gpt":0.2569635155234735,"spread":0.2137254521886838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002795875,0.0001990976,0.0003397874,0.0001309909,0.0009014231,0.0006142355,0.0007431805,0.00006729265,0.00001765332],"category_scores_gemma":[0.0002049498,0.0001113029,0.0002089756,0.0005322928,0.0003272132,0.0008849648,0.0001421426,0.0004368998,0.000002564677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005816306,"about_ca_system_score_gemma":0.00006302611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001619814,"about_ca_topic_score_gemma":0.00000669317,"domain_scores_codex":[0.9978724,0.0002144795,0.0007813481,0.0002640128,0.000526422,0.000341305],"domain_scores_gemma":[0.9970217,0.001329271,0.0007055541,0.0003466402,0.0005015933,0.00009519776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001171942,0.0002294961,0.00004408547,0.00008254737,0.0003308785,0.00002101446,0.01049564,0.001811537,0.0001906154,0.1714045,0.004454114,0.8108184],"study_design_scores_gemma":[0.002888644,0.0002918095,0.00002512654,0.0001110419,0.00006169373,0.0005239366,0.0005263662,0.9180301,0.0005061555,0.06944918,0.007405109,0.0001808138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003372891,0.003244258,0.98474,0.009290598,0.0006362885,0.0008930271,0.000006999462,0.00005238313,0.0007991136],"genre_scores_gemma":[0.03486161,0.001198206,0.9621176,0.0004852504,0.0009080879,0.0001313186,0.0000018152,0.00002780662,0.0002682727],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9162186,"threshold_uncertainty_score":0.6933109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065654144","doi":"10.1016/j.jalgor.2005.01.009","title":"Refinements of Miller's algorithm for computing the Weil/Tate pairing","year":2005,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computation; Cryptography; Algorithm; Hamming weight; Integer (computer science); Hamming distance; Computer science; Field (mathematics); Binary number; Finite field; Pairing; Elliptic curve; Mathematics; Theoretical computer science; Discrete mathematics; Hamming code; Arithmetic; Programming language; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01407102858777722,"gpt":0.2615776276533546,"spread":0.2475065990655774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240056,0.0001431799,0.0002976006,0.0002193843,0.0001988225,0.0000794293,0.001020072,0.00005003242,0.000006287328],"category_scores_gemma":[0.00003925797,0.00009124276,0.0003339035,0.0004178489,0.00007983023,0.0003115248,0.000153381,0.0002308017,0.000002062861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002949866,"about_ca_system_score_gemma":0.00007061672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009144029,"about_ca_topic_score_gemma":0.000002186459,"domain_scores_codex":[0.9982921,0.00006944085,0.000719336,0.0001629722,0.00045973,0.0002963521],"domain_scores_gemma":[0.9982922,0.0002941721,0.0006669588,0.0002920528,0.0003621456,0.00009245629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000668715,0.0001149583,0.00009316044,0.00001499342,0.0001337064,0.000008254715,0.0008098407,0.001216727,0.0002314038,0.000604343,0.001325043,0.9954409],"study_design_scores_gemma":[0.003199789,0.0009029263,0.005318552,0.0002904726,0.00009869975,0.0004548057,0.0003961042,0.9271824,0.0108712,0.003322058,0.04759488,0.0003681009],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00960762,0.001375476,0.9854995,0.00241507,0.0007584885,0.0001561548,0.000003883957,0.00002020036,0.0001636309],"genre_scores_gemma":[0.08474067,0.0001502823,0.9140199,0.0002723543,0.0007339377,0.000002137851,4.421067e-7,0.00001317209,0.00006705099],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9950728,"threshold_uncertainty_score":0.3720772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055960596","doi":"10.1006/jagm.1999.1068","title":"Distributed Online Frequency Assignment in Cellular Networks","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; Carleton University; Dalhousie University","funders":"","keywords":"Frequency assignment; Vertex (graph theory); Competitive analysis; Computer science; Online algorithm; Graph; Lattice (music); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Upper and lower bounds; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01410412832036778,"gpt":0.2485955839195235,"spread":0.2344914555991557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004970863,0.00008857228,0.0001757876,0.0001136087,0.00004007568,0.00009392919,0.0005628293,0.00005583314,0.0002460404],"category_scores_gemma":[0.00001699193,0.00007223809,0.0000693144,0.0004660619,0.00002182154,0.0004318357,0.00003722645,0.0003221121,0.00001013331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009329802,"about_ca_system_score_gemma":0.00008431043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001137628,"about_ca_topic_score_gemma":0.000002834986,"domain_scores_codex":[0.9987013,0.0001010143,0.0004771015,0.0001210532,0.0003638411,0.0002356905],"domain_scores_gemma":[0.9993777,0.00003891261,0.000145932,0.0001779998,0.0001150353,0.0001443771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001358111,0.0007352435,0.0008959885,0.000006234834,0.00003742112,0.0005551311,0.0003618575,0.6863847,0.0002138497,0.0009841485,0.001413489,0.3083983],"study_design_scores_gemma":[0.0008583999,0.000243987,0.002259699,0.0000509247,0.000003381212,0.00006017464,0.0000187584,0.9912841,0.00008276539,0.001429163,0.003587358,0.0001212839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004276195,0.0003745885,0.9931056,0.001614756,0.0002253029,0.00007094393,0.000004049392,0.00001602364,0.0003124799],"genre_scores_gemma":[0.4694101,0.001498589,0.5269703,0.0007368127,0.0006101255,0.000003631938,0.00002782349,0.00002113815,0.0007214813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4661353,"threshold_uncertainty_score":0.2945784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079313211","doi":"10.1016/j.jalgor.2004.02.001","title":"The dominating set problem is fixed parameter tractable for graphs of bounded genus","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Victoria","funders":"","keywords":"Bounded function; Mathematics; Combinatorics; Genus; Planar graph; Maximal independent set; Dominating set; Discrete mathematics; Set (abstract data type); Planar; Pathwidth; Chordal graph; 1-planar graph; Graph; Computer science; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02940947855945121,"gpt":0.3175157692308598,"spread":0.2881062906714086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001940318,0.0001274403,0.0002730866,0.0001814916,0.0002811272,0.0001703902,0.001178796,0.00005686437,0.00000326597],"category_scores_gemma":[0.0002639146,0.00008284775,0.0002708369,0.0004965146,0.0001524829,0.0006810447,0.0001032659,0.0003138821,0.000001590755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006941253,"about_ca_system_score_gemma":0.0002029058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006790684,"about_ca_topic_score_gemma":0.000002253594,"domain_scores_codex":[0.9981486,0.0000825439,0.0006106907,0.0001729954,0.0005812942,0.000403913],"domain_scores_gemma":[0.997429,0.0008758609,0.0006303812,0.0003511728,0.0006009986,0.0001126534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005727804,0.0006092343,0.0002533543,0.0001964162,0.0006852918,0.000125774,0.0097559,0.003359505,0.01612355,0.1636304,0.001657194,0.8030306],"study_design_scores_gemma":[0.002281324,0.00100031,0.0001605777,0.00009731692,0.00001998788,0.0002599781,0.0002587534,0.008377116,0.05257212,0.9316086,0.003197926,0.0001660414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07631182,0.0006974135,0.919313,0.002687803,0.0003875929,0.0004456389,0.00001234155,0.00001706551,0.0001272892],"genre_scores_gemma":[0.199518,0.0001088661,0.7999569,0.0001158048,0.0001016645,0.00001871487,4.410926e-7,0.00001883089,0.000160819],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8028646,"threshold_uncertainty_score":0.3378433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120749565","doi":"10.1006/jagm.2001.1158","title":"The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Factorization of polynomials; Factorization; Finite field; Mathematics; Polynomial; Factoring; Degree (music); Square-free polynomial; Algorithm; Singularity; Algebra over a field; Discrete mathematics; Pure mathematics; Matrix polynomial; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01655281649807776,"gpt":0.2534935249891276,"spread":0.2369407084910499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006918323,0.0001036288,0.0002806669,0.0004238931,0.0001602783,0.0001219694,0.0007944182,0.00005757519,0.00003262776],"category_scores_gemma":[0.00006287089,0.00006976686,0.0004138576,0.001692645,0.00006356995,0.0003330021,0.00008751934,0.0001941563,0.000001332384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002086401,"about_ca_system_score_gemma":0.0000473248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001639207,"about_ca_topic_score_gemma":0.000007258716,"domain_scores_codex":[0.9986774,0.0001176188,0.0005016018,0.0001178031,0.0004064681,0.0001790749],"domain_scores_gemma":[0.9983333,0.0005100447,0.0005285605,0.0003127037,0.0002370908,0.0000783486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001228965,0.0002395262,0.006183843,0.000005952606,0.002750834,0.00008201048,0.002592527,0.00502943,0.0005692161,0.008521521,0.00138925,0.972513],"study_design_scores_gemma":[0.001316895,0.000936724,0.05671414,0.00004287834,0.0007449673,0.00009657707,0.0001959471,0.8808863,0.000575382,0.01191567,0.04620917,0.0003653511],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01533741,0.0002147984,0.9831149,0.0003974642,0.0007045641,0.00003659398,0.000006839436,0.00001271066,0.0001747392],"genre_scores_gemma":[0.9477864,0.0004061055,0.05099386,0.0002142044,0.0004736155,0.000001315123,0.000002750573,0.000008842441,0.0001129399],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9721476,"threshold_uncertainty_score":0.284501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085072732","doi":"10.1016/s0196-6774(03)00126-3","title":"Rectangular drawings of planar graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Planar graph; Book embedding; Planar straight-line graph; Outerplanar graph; Combinatorics; Rectangle; Mathematics; Planar; Graph; Polyhedral graph; Embedding; Vertex (graph theory); Plane (geometry); 1-planar graph; Geometry; Line graph; Computer science; Pathwidth; Computer graphics (images); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01117526013837925,"gpt":0.23730742971907,"spread":0.2261321695806907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005899918,0.00006227987,0.0001472475,0.0002369234,0.00004216753,0.000032146,0.0002359164,0.00003166236,0.00001130921],"category_scores_gemma":[0.00009547002,0.00005317157,0.0001030632,0.0004811842,0.00001742173,0.0003330309,0.0000119641,0.00009838551,0.000002647349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001709256,"about_ca_system_score_gemma":0.0001112026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001863565,"about_ca_topic_score_gemma":2.599975e-7,"domain_scores_codex":[0.9990708,0.00006492595,0.0003398551,0.00008324149,0.0003459015,0.00009527081],"domain_scores_gemma":[0.9991647,0.0000726246,0.0003026791,0.0001159012,0.0002786762,0.0000654102],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004452179,0.0005875708,0.001328027,0.0000587059,0.0003335355,0.0002892756,0.002958738,0.009406687,0.03768194,0.712891,0.01147365,0.2229463],"study_design_scores_gemma":[0.003645441,0.002494676,0.01094022,0.0002224082,0.00009373955,0.003564915,0.0002680095,0.03815717,0.2237837,0.6355931,0.08048157,0.000755132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05230027,0.0008529876,0.9446744,0.0003659202,0.0008745302,0.00003829293,8.376618e-7,0.000009151326,0.0008836443],"genre_scores_gemma":[0.4654197,0.00005794813,0.5341148,0.0001404556,0.0001183317,4.606181e-7,6.250182e-7,0.000004830034,0.0001428187],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4131195,"threshold_uncertainty_score":0.2168274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090986925","doi":"10.1016/s0196-6774(02)00251-1","title":"A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Approximation algorithm; Open shop; Mathematics; Algorithm; Mathematical optimization; Computer science; Job shop scheduling; Flow shop scheduling","retraction":null,"screen_n_in":null,"score":{"opus":0.02441659351704695,"gpt":0.2462396156049676,"spread":0.2218230220879206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005480985,0.0002445432,0.0003748029,0.000150256,0.0001781247,0.0002669322,0.0005658198,0.0001010627,0.00009796116],"category_scores_gemma":[0.00004273888,0.000153748,0.000136529,0.0003900453,0.00006198096,0.0005842618,0.00004246086,0.0003098476,0.000009344883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001316197,"about_ca_system_score_gemma":0.00004425985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008949107,"about_ca_topic_score_gemma":0.000004015275,"domain_scores_codex":[0.9985694,0.00005055226,0.0005305199,0.0001741211,0.0003766384,0.0002987666],"domain_scores_gemma":[0.9985582,0.0002204716,0.0003021848,0.0002139439,0.0005834793,0.0001217016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001200224,0.0002641385,0.00003969155,0.00005621869,0.001215335,0.00002620438,0.004944615,0.3788858,0.00009513689,0.000183348,0.006397756,0.6077718],"study_design_scores_gemma":[0.002834538,0.0004280185,0.00005198521,0.0000824384,0.0001435107,0.0001988162,0.0007605726,0.991533,0.001141475,0.0002311057,0.002351141,0.000243419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007605253,0.001458977,0.9944738,0.0004347306,0.0005400076,0.001033841,0.00003244503,0.00007166513,0.001194074],"genre_scores_gemma":[0.002841986,0.0003855425,0.9950391,0.00008771419,0.0006026574,0.0001073653,0.000007628575,0.00007276869,0.0008552127],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6126472,"threshold_uncertainty_score":0.6269662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046592997","doi":"10.1016/s0196-6774(02)00215-8","title":"A constructive enumeration of fusenes and benzenoids","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Graph theory and applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Enumeration; Constructive; Mathematics; Computer science; Combinatorics; Programming language; Process (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.05096497404794445,"gpt":0.2903613363710243,"spread":0.2393963623230798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001903017,0.00004962101,0.0001477759,0.00007048688,0.00004200347,0.000009408009,0.00005292079,0.00003216668,0.00006978711],"category_scores_gemma":[0.00007125606,0.00003977074,0.00004870151,0.00008324373,0.0000730134,0.00009898776,0.000008999248,0.00008249567,0.000001208795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000568025,"about_ca_system_score_gemma":0.000006123501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.732723e-7,"about_ca_topic_score_gemma":3.165076e-7,"domain_scores_codex":[0.9994985,0.00003073442,0.0002698476,0.00004192031,0.0001071175,0.00005186361],"domain_scores_gemma":[0.9993026,0.0001548495,0.0002933147,0.00006797235,0.0001447424,0.00003656729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003514361,0.0004632352,0.001003575,0.00008975336,0.0002582647,0.00001245223,0.005531283,0.000009280218,0.01508009,0.8953786,0.003373928,0.07876437],"study_design_scores_gemma":[0.0008278204,0.0002598598,0.0007936396,0.00006802083,0.0001174062,0.0004778759,0.001046924,0.0011382,0.01345311,0.9805025,0.001207367,0.0001072116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9886509,0.0005888479,0.009114875,0.0003394801,0.0001135726,0.00008304777,0.000009163145,0.000006654267,0.001093486],"genre_scores_gemma":[0.9510042,0.0001362536,0.04864547,0.00001431223,0.0001126989,0.000001206763,1.665001e-7,0.000005826021,0.00007982889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08512394,"threshold_uncertainty_score":0.1621804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049328058","doi":"10.1006/jagm.1999.1050","title":"Some Open Problems in Computational Molecular Biology","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network topology; Property (philosophy); Mathematics; Consistency (knowledge bases); Tree (set theory); Set (abstract data type); Function (biology); Combinatorics; Domain (mathematical analysis); Discrete mathematics; Upper and lower bounds; Algorithm; Computer science; Biology; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01820542960905682,"gpt":0.3037905689558141,"spread":0.2855851393467573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005532388,0.0001108475,0.0002597864,0.0001728727,0.00005154248,0.0001889271,0.001716267,0.0000624747,0.00008444833],"category_scores_gemma":[0.0000133667,0.00008718902,0.00006396955,0.0002920471,0.00003478631,0.001387078,0.0003041861,0.0002403337,0.00002953523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004373719,"about_ca_system_score_gemma":0.0001427387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004406205,"about_ca_topic_score_gemma":9.188489e-7,"domain_scores_codex":[0.9987248,0.0001036271,0.0005041934,0.0002017424,0.0002524884,0.0002131091],"domain_scores_gemma":[0.9992894,0.00005808664,0.0002119031,0.0002274268,0.0001078212,0.000105373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000287898,0.0005796247,0.0005641627,0.00001254926,0.00006266648,0.0004161777,0.0005066198,0.08219881,0.0009348077,0.04785981,0.00205398,0.864782],"study_design_scores_gemma":[0.002783192,0.0006638695,0.004452516,0.0001618155,0.00000728105,0.0006263803,0.00001532756,0.4505066,0.0003159449,0.5204003,0.01973036,0.0003363711],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01503736,0.001244592,0.9804648,0.001975246,0.000453592,0.0001901134,0.000007981249,0.00001808887,0.0006082167],"genre_scores_gemma":[0.09859698,0.0002196175,0.8995648,0.001030513,0.0003665963,0.000006876827,0.00001143902,0.00001602675,0.0001871724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8644456,"threshold_uncertainty_score":0.3555465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085524666","doi":"10.1006/jagm.2001.1189","title":"Fly Cheaply: On the Minimum Fuel Consumption Problem","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Subdivision; Function (biology); Fuel efficiency; Path (computing); Class (philosophy); Sequence (biology); Set (abstract data type); Mathematical optimization; Computer science; Combinatorics; Mathematics; Engineering; Artificial intelligence; Aerospace engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03404273858224385,"gpt":0.2688807568102196,"spread":0.2348380182279758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006926589,0.0000833147,0.0001081722,0.0001372349,0.0001064053,0.0001310102,0.0003617767,0.00003516446,0.00003838702],"category_scores_gemma":[0.0000457739,0.00005334033,0.00008328323,0.0003103145,0.00002301661,0.0003491418,0.00003947617,0.0001833904,0.00006249607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004173892,"about_ca_system_score_gemma":0.00008285425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001196503,"about_ca_topic_score_gemma":7.83577e-7,"domain_scores_codex":[0.9989484,0.00007774957,0.0003050157,0.0001115862,0.0004266742,0.0001305937],"domain_scores_gemma":[0.9990988,0.0001870151,0.0002535311,0.0001550111,0.0002363381,0.00006925008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001580524,0.0008563967,0.0009853833,0.00004455778,0.00022548,0.000306054,0.002729851,0.02226768,0.005900167,0.1594557,0.04035478,0.7667159],"study_design_scores_gemma":[0.003818551,0.003120171,0.03831367,0.000323178,0.00007544468,0.004726763,0.0001949898,0.5473677,0.00772629,0.1952711,0.1982184,0.00084372],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1051545,0.0006437249,0.8680605,0.02201641,0.001453845,0.0001852991,0.000001137203,0.00003511243,0.002449513],"genre_scores_gemma":[0.8809603,0.0004060375,0.1137731,0.002187558,0.001370688,0.000006009937,0.000002054662,0.00001066691,0.001283478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7758059,"threshold_uncertainty_score":0.2175155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992517803","doi":"10.1016/j.jalgor.2004.04.011","title":"A polynomial-time algorithm for near-unanimity graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Time complexity; Unanimity; Algorithm; Combinatorics; Polynomial; Mathematics; Computer science; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01618163022204756,"gpt":0.2872839656478463,"spread":0.2711023354257988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302144,0.0002079433,0.0004139813,0.0003335242,0.0002731619,0.0002540574,0.001574959,0.0001004275,0.0000139258],"category_scores_gemma":[0.0001533159,0.0001753239,0.00041794,0.0007331198,0.0001809935,0.001137604,0.0001919837,0.0004076565,0.00003813539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499167,"about_ca_system_score_gemma":0.0004579985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008880475,"about_ca_topic_score_gemma":7.80766e-7,"domain_scores_codex":[0.9977977,0.00008184788,0.0005873626,0.0002992196,0.0006741456,0.000559772],"domain_scores_gemma":[0.9979412,0.0002398637,0.0004182765,0.0004615553,0.000604258,0.0003348673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000978124,0.0004479803,0.0000272383,0.00001791036,0.0002029211,0.0002756802,0.0006743121,0.00124915,0.003970396,0.006935403,0.003619155,0.982482],"study_design_scores_gemma":[0.0175605,0.007368229,0.001547858,0.0003085429,0.0001114698,0.004402134,0.0001791266,0.2313463,0.04547009,0.6353648,0.0546672,0.001673751],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005499127,0.0004106601,0.9917136,0.001199576,0.0006646909,0.0002678261,0.0000133973,0.00005635418,0.0001748037],"genre_scores_gemma":[0.006499431,0.00004971782,0.9926227,0.0002336647,0.0003273895,0.000009633986,9.994026e-7,0.00002745943,0.0002289896],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9808083,"threshold_uncertainty_score":0.71495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029731475","doi":"10.1016/s0196-6774(03)00004-x","title":"Elastic labels around the perimeter of a map","year":2003,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"","keywords":"Panning (audio); Rectangle; Perimeter; Clipping (morphology); Zoom; Mathematics; Boundary (topology); Time complexity; Achromatic lens; Artificial intelligence; Computer science; Computer vision; Combinatorics; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01757324017823872,"gpt":0.255436192997203,"spread":0.2378629528189643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894495,0.00005893461,0.0001148173,0.00009936578,0.00005809636,0.00006090496,0.0002831309,0.00002199969,0.0000222472],"category_scores_gemma":[0.00008148309,0.00003711261,0.00008270921,0.0002821541,0.00002169866,0.0002676961,0.00002678042,0.0001089936,0.00000811323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001826712,"about_ca_system_score_gemma":0.0001192322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001019221,"about_ca_topic_score_gemma":2.272348e-7,"domain_scores_codex":[0.9991313,0.00009070175,0.0002918473,0.00006993312,0.0003254714,0.00009075498],"domain_scores_gemma":[0.99913,0.0001783001,0.0002481103,0.0001316118,0.0002688359,0.00004313737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000775921,0.001041958,0.001191504,0.0001138111,0.0007601956,0.0001957762,0.006083129,0.09099606,0.0385179,0.428294,0.0166788,0.4160493],"study_design_scores_gemma":[0.005592915,0.004280395,0.0174574,0.000293753,0.0002386632,0.00481045,0.0007951738,0.3886511,0.1619434,0.2196914,0.1951867,0.00105861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02373271,0.0007307156,0.9734399,0.0006738522,0.001034817,0.00003954886,5.737436e-7,0.000004083166,0.0003437753],"genre_scores_gemma":[0.7337946,0.0000155324,0.2654546,0.0001438944,0.0002432322,7.771783e-7,2.019538e-7,0.000003705557,0.0003434918],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7100619,"threshold_uncertainty_score":0.1513408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054626845","doi":"10.1016/s0196-6774(02)00003-2","title":"A linear time algorithm for recognizing regular Boolean functions","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Simon Fraser University; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Monotonic function; Boolean function; Monotone polygon; Corollary; Time complexity; Combinatorics; Function (biology); Algorithm; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02007652376892932,"gpt":0.245157775995278,"spread":0.2250812522263487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041814,0.0002379896,0.0004293296,0.0003518025,0.0003086064,0.0001924482,0.0008773103,0.0001161477,0.0001494233],"category_scores_gemma":[0.00019717,0.0002037266,0.0004007483,0.000512563,0.0000457239,0.0007219259,0.0001103736,0.0005293743,0.0002172858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006886262,"about_ca_system_score_gemma":0.00005473868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005183135,"about_ca_topic_score_gemma":1.97778e-7,"domain_scores_codex":[0.9978963,0.0001036725,0.0007032491,0.0003267826,0.0005238051,0.0004461783],"domain_scores_gemma":[0.9980168,0.0002152753,0.0005720418,0.0004127819,0.0005134976,0.0002695495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003892008,0.0001421158,0.000008776011,0.000008506756,0.00009139317,0.00005638682,0.0002849566,0.0003327937,0.0001650398,0.00005636642,0.01904975,0.9798],"study_design_scores_gemma":[0.0009996489,0.0006906581,0.00003258308,0.00006413418,0.00003996875,0.0007001484,0.00003498022,0.8709782,0.0002993156,0.000729794,0.1251891,0.0002414881],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000397906,0.0008083669,0.9936092,0.002747484,0.001473056,0.0001543696,0.00001377925,0.0001044679,0.000691343],"genre_scores_gemma":[0.0005895511,0.0000812701,0.9845701,0.0003437047,0.002471812,0.000007989638,0.000004489994,0.00003877705,0.01189224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9795585,"threshold_uncertainty_score":0.8307728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W298519903","doi":"10.1006/jagm.2000.1147","title":"Fault-Tolerant Broadcasting in Radio Networks","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Computer science; Broadcasting (networking); Node (physics); Computer network; Upper and lower bounds; RADIUS; Situated; Range (aeronautics); Fault tolerance; Topology (electrical circuits); Algorithm; Distributed computing; Mathematics; Combinatorics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01400393204816866,"gpt":0.2460030780370555,"spread":0.2319991459888868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552914,0.0001342309,0.0003467111,0.0001602941,0.00006146056,0.0001685515,0.0007652671,0.00007815164,0.0000109151],"category_scores_gemma":[0.00004101877,0.000110209,0.0001223979,0.000663971,0.00002141799,0.0006671751,0.00006671163,0.0003928593,0.000006230951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008427303,"about_ca_system_score_gemma":0.00006942257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003259725,"about_ca_topic_score_gemma":0.000005738895,"domain_scores_codex":[0.9982966,0.00007121413,0.000731803,0.0001731609,0.0003800655,0.0003472229],"domain_scores_gemma":[0.9989467,0.00007357087,0.0004193373,0.0002374231,0.0001809674,0.0001419846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005032264,0.0003387582,0.009234882,0.00001726991,0.00007204244,0.004665961,0.00130555,0.1619324,0.0001971418,0.001268154,0.006985469,0.8139321],"study_design_scores_gemma":[0.00118441,0.0001425717,0.009000627,0.0002445518,0.000004578829,0.002750073,0.00007722164,0.9537213,0.00002620128,0.0002002624,0.03245743,0.0001907788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03045203,0.001992412,0.9644836,0.0005371438,0.001430921,0.00006747588,0.000001000292,0.00002385931,0.001011539],"genre_scores_gemma":[0.9628651,0.0002170889,0.03551404,0.0001784161,0.0009181234,0.000001956474,6.995502e-7,0.00001148135,0.0002931667],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.932413,"threshold_uncertainty_score":0.4494192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089329507","doi":"10.1016/j.jalgor.2004.01.002","title":"Simple constant amortized time generation of fixed length numeric partitions","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Amortized analysis; Simple (philosophy); Constant (computer programming); Mathematics; Combinatorics; Algorithm; Discrete mathematics; Data structure; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03443542798261186,"gpt":0.2942649265590317,"spread":0.2598294985764199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006382685,0.000140979,0.000421017,0.0001537717,0.00009855078,0.00007326952,0.0004697533,0.00005608572,0.00006307297],"category_scores_gemma":[0.0001474978,0.0001108942,0.0002106678,0.0005575386,0.00008764233,0.0005306484,0.00007127896,0.0002050494,0.00002057014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000697555,"about_ca_system_score_gemma":0.0002280199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001967224,"about_ca_topic_score_gemma":5.98283e-7,"domain_scores_codex":[0.9981898,0.0001306682,0.0007880934,0.0001752757,0.0004732786,0.0002428801],"domain_scores_gemma":[0.998377,0.0001129569,0.0006820734,0.0002735052,0.0003737714,0.0001806997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005605843,0.001623966,0.0002137176,0.00003919534,0.000433907,0.000388171,0.001260327,0.01501027,0.2656025,0.02072214,0.003079651,0.69157],"study_design_scores_gemma":[0.01120976,0.005447797,0.003782594,0.0003010144,0.0002696387,0.00171684,0.000258052,0.4795243,0.2971725,0.1836374,0.01519044,0.00148955],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02220749,0.0002297404,0.9758301,0.0008680964,0.0005279493,0.0000914634,0.000008755589,0.00002671665,0.0002097178],"genre_scores_gemma":[0.1322545,0.00008497918,0.8670399,0.0001696901,0.0003886741,0.00000289525,0.000002267599,0.00001131541,0.00004587304],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6900805,"threshold_uncertainty_score":0.4522134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122491543","doi":"10.1016/j.jalgor.2004.04.005","title":"Estimating the maximum","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Graph; Sample (material); Property (philosophy); Sampling (signal processing); Maximum likelihood; Discrete mathematics; Sample complexity; Algorithm; Statistics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02866371422076207,"gpt":0.3065240418121284,"spread":0.2778603275913664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297564,0.00008753734,0.0001709755,0.0000543048,0.0002080542,0.00003363773,0.0003154139,0.00004347582,0.000035377],"category_scores_gemma":[0.0003391358,0.00004442071,0.0001494527,0.00009934973,0.00007556829,0.0001011666,0.00005128044,0.0003033963,0.00000240051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000340845,"about_ca_system_score_gemma":0.00004161332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000236282,"about_ca_topic_score_gemma":5.233372e-7,"domain_scores_codex":[0.9991062,0.00003650102,0.0003663852,0.00005380968,0.0002975129,0.0001396084],"domain_scores_gemma":[0.9991069,0.0002004154,0.0003500043,0.0001750643,0.0001164959,0.00005111378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001028014,0.0003198081,0.0003634919,0.0001353178,0.0006544007,0.0004912749,0.01657697,0.007084162,0.0005457362,0.7753925,0.004776479,0.193557],"study_design_scores_gemma":[0.0004486416,0.00009090692,0.0002231222,0.00005696834,0.00004124227,0.0007359876,0.0002194377,0.0003149369,0.0004599354,0.9967877,0.0005578065,0.00006335429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7864504,0.0005018664,0.2029979,0.002304927,0.003454832,0.0001462569,0.000003076442,0.00003320968,0.004107541],"genre_scores_gemma":[0.5598952,0.000009253486,0.4386895,0.0002199339,0.001105606,6.885003e-7,8.50498e-8,0.00001754607,0.00006228042],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2356916,"threshold_uncertainty_score":0.1811424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1572683371","doi":"10.1016/s0196-6774(03)00086-5","title":"Selecting the branches for an evolutionary tree.","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Tree (set theory); Polynomial; Polynomial-time approximation scheme; Computer science; Integer (computer science); Time complexity; Mathematics; Approximation algorithm; Scheme (mathematics); Algorithm; Mathematical optimization; Combinatorics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01867079115041825,"gpt":0.2659172230674615,"spread":0.2472464319170432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002252583,0.00007013035,0.00009190621,0.0000189405,0.0001335205,0.00001357067,0.0001460022,0.00004298519,7.893636e-7],"category_scores_gemma":[0.00005017034,0.0000465063,0.0001062902,0.00003736524,0.00003863178,0.000001285274,0.0000237936,0.00005831552,3.664291e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001358049,"about_ca_system_score_gemma":0.00009340582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005883,"about_ca_topic_score_gemma":0.00001132255,"domain_scores_codex":[0.9995258,0.00001646855,0.0001776915,0.00008386651,0.00007541123,0.0001207809],"domain_scores_gemma":[0.9995502,0.00001548025,0.0001306429,0.00009425123,0.0001705659,0.0000388163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001975498,0.0001884995,0.001688347,0.00001401089,0.0003925588,0.000003254787,0.0006664013,0.004059002,0.924658,0.0002128329,0.00248413,0.06543539],"study_design_scores_gemma":[0.008473122,0.01259451,0.09871821,0.00007745191,0.0003456059,0.001774591,0.00348866,0.0009751768,0.5507178,0.02717306,0.2947308,0.0009310622],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9799742,0.004737535,0.01381489,0.0007825447,0.0003769558,0.0001146398,0.000009131705,0.000001139814,0.0001889766],"genre_scores_gemma":[0.9741591,0.0002436892,0.02406473,0.0001699016,0.00128791,0.000004122159,0.000002823548,0.00001073025,0.00005699148],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3739402,"threshold_uncertainty_score":0.1896472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1546783087","doi":"10.1006/jagm.2001.1169","title":"How Helpers Hasten h-Relations","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Attachment and Relationship Dynamics","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Network packet; Scheduling (production processes); Set (abstract data type); Computer network; Distributed computing; Parallel computing; Theoretical computer science; Mathematics; Mathematical optimization; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02137014463455823,"gpt":0.3530840445356046,"spread":0.3317138999010464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002013045,0.00008759499,0.0001468536,0.0001270793,0.0001051674,0.00004961863,0.0001460708,0.0001164199,0.003285913],"category_scores_gemma":[0.00001234918,0.00006861094,0.0001468018,0.0001721912,0.00005397361,0.0002188992,0.000005920925,0.0003413481,0.0003080737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004425446,"about_ca_system_score_gemma":0.00003160576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004363836,"about_ca_topic_score_gemma":0.000001537916,"domain_scores_codex":[0.999222,0.00005974221,0.0002730362,0.00008152309,0.0002010734,0.0001625553],"domain_scores_gemma":[0.9994432,0.00006767631,0.0001843201,0.0001246781,0.00008506864,0.00009500496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002754367,0.0009946291,0.111149,0.00001065652,0.001499818,0.0004652752,0.01537963,0.003790169,0.0001230745,0.01218946,0.07637586,0.777747],"study_design_scores_gemma":[0.007152901,0.001522453,0.3557716,0.0001343117,0.0006481044,0.002560447,0.01166535,0.01261057,0.00002333257,0.007305493,0.5997033,0.0009021451],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6423458,0.004100918,0.07257522,0.03387938,0.006190392,0.0003845771,0.00002803815,0.0000981351,0.2403975],"genre_scores_gemma":[0.7594462,0.00007325637,0.01043504,0.000172482,0.001005306,0.000002574691,0.000006581226,0.00002540119,0.2288331],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7768449,"threshold_uncertainty_score":0.9976252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}