{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1464,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1464,"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":"25cd3a93dcdb","filters":{"topic":"graph theory and CDMA systems"}},"results":[{"id":"W2008104692","doi":"10.1109/vtcfall.2014.6966170","title":"SCMA Codebook Design","year":2014,"lang":"en","type":"article","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":642,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Codebook; Computer science; Algorithm; QAM; Quadrature amplitude modulation; Code division multiple access; Code (set theory); Theoretical computer science; Bit error rate; Telecommunications; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.007264408937287988,"gpt":0.1498062417669913,"spread":0.1425418328297033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001600922,0.00004810136,0.00005569079,0.00002055457,0.0000181745,0.00001080296,0.00005636351,0.00002575185,0.0001735141],"category_scores_gemma":[0.000004648122,0.00004035313,0.00001913124,0.0000307584,0.000008021884,0.00002875135,0.000003201998,0.00002894408,0.0004808377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003986903,"about_ca_system_score_gemma":0.000001004945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001384698,"about_ca_topic_score_gemma":0.000001022972,"domain_scores_codex":[0.9997426,0.00002712427,0.0000599915,0.00004444679,0.00003556798,0.00009030553],"domain_scores_gemma":[0.999815,0.00003804004,0.000003276567,0.0001074886,0.00000497623,0.00003114587],"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.00001299747,0.00001833614,0.0003639723,0.0001174852,0.00007767328,0.00000367223,0.0005050167,0.05597872,0.04385054,0.8036949,0.06438693,0.03098975],"study_design_scores_gemma":[0.0006782187,0.0001068178,0.0005541578,0.00004962003,0.00001803292,0.0000261337,0.0001182833,0.4915954,0.1304504,0.05742588,0.3183363,0.0006407276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01126441,0.00004300534,0.6417758,0.00000739617,0.0002462452,0.00006188563,1.92042e-7,0.0004731626,0.3461279],"genre_scores_gemma":[0.9967337,0.000001240471,0.0009053685,0.00004400305,0.00004489175,0.000007647939,2.978795e-7,0.00001046638,0.002252376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9854693,"threshold_uncertainty_score":0.6180356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979946760","doi":"10.1007/b97564","title":"Combinatorial Designs : Constructions and Analysis","year":2004,"lang":"en","type":"book","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":444,"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":"Combinatorial design; Automorphism; Hadamard transform; Pairwise comparison; Mathematics; Hadamard matrix; Orthogonal array; Combinatorics; Complex Hadamard matrix; Discrete mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.007955915025722161,"gpt":0.1802990552509861,"spread":0.1723431402252639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006763294,0.0001779688,0.000338967,0.0002728551,0.00005329548,0.00003453357,0.00006591416,0.0002434889,0.0002925183],"category_scores_gemma":[0.00000227486,0.0001762656,0.00014639,0.0001541632,0.00007959928,0.00003373237,0.00001026397,0.00017529,0.00002250343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001195785,"about_ca_system_score_gemma":0.00007946608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005236128,"about_ca_topic_score_gemma":0.00001378383,"domain_scores_codex":[0.9994654,0.00001373164,0.0001786228,0.0001404404,0.00008457902,0.0001172133],"domain_scores_gemma":[0.9996681,0.00003759166,0.00002380706,0.0001814063,0.00001969676,0.00006939413],"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.000001681675,0.000003543393,0.00003585405,0.00008138012,0.00174864,0.000005899142,0.00008537929,0.00180895,0.00001219166,0.9936972,0.002307727,0.0002115768],"study_design_scores_gemma":[0.0009205971,0.00005294042,0.00009315288,0.0001205967,0.003959556,0.00006354889,0.00008993919,0.001176511,0.0001293878,0.7971088,0.1952385,0.001046485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0002322933,0.0004800844,0.009350752,0.000002376955,0.001374934,0.0001302353,0.00003880253,0.000351443,0.9880391],"genre_scores_gemma":[0.3464327,0.0001187937,0.000355257,0.00001402585,0.0005294494,0.00003163421,0.0001932023,0.00009492813,0.65223],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3462004,"threshold_uncertainty_score":0.7187905,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130257952","doi":"10.1109/mcom.2002.1031833","title":"The role of optical CDMA in access networks","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":286,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Code division multiple access; Computer science; Computer network; Flexibility (engineering); Access control; Access network; Service (business); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02320050447022416,"gpt":0.2472705338644828,"spread":0.2240700293942587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002268344,0.00007398495,0.0001113836,0.00005367675,0.00008734634,0.0000327192,0.001147378,0.00005001032,0.00002514814],"category_scores_gemma":[0.00001917406,0.0000610052,0.00003877246,0.0003494038,0.0001305032,0.00009582823,0.00008967548,0.0002130483,0.00005514027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001607189,"about_ca_system_score_gemma":0.000001916678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004979061,"about_ca_topic_score_gemma":0.0001467745,"domain_scores_codex":[0.9993904,0.00008133813,0.0002642419,0.00005522184,0.00006188214,0.0001468938],"domain_scores_gemma":[0.998359,0.0002944331,0.00002949186,0.001258642,0.00002864941,0.00002979502],"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.00003725174,0.0007784786,0.01723337,0.0001059221,0.0002596333,0.000004847701,0.001999518,0.2939726,0.01702328,0.4016613,0.01972858,0.2471952],"study_design_scores_gemma":[0.0002828189,0.00001714043,0.005891199,0.00006259075,0.00001309204,0.000007808702,0.0001190443,0.8768041,0.0008748342,0.004571885,0.111183,0.0001725099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2543676,0.06317826,0.003962378,0.001408771,0.001236085,0.0008655865,0.00001485753,0.0005067938,0.6744596],"genre_scores_gemma":[0.9976794,0.00193031,0.0001393426,0.000009449397,0.00002923896,0.00005097907,0.000002719626,0.00001365815,0.000144874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7433118,"threshold_uncertainty_score":0.248772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068457180","doi":"10.1006/jctb.2000.1996","title":"Cycle Decompositions of K and K−I","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":261,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Graph; Mathematics; Combinatorics; Order (exchange); Complete graph; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.004295824774612166,"gpt":0.2010974239650139,"spread":0.1968015991904017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004742698,0.00008092896,0.0002258189,0.00009030112,0.00004419679,0.00001640935,0.0001066494,0.00005049675,0.00005322202],"category_scores_gemma":[0.00002889037,0.00007171052,0.0000746821,0.0001169309,0.00007924925,0.000258753,0.00001217698,0.0001172499,0.000001362504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001187963,"about_ca_system_score_gemma":0.000009388163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.017948e-7,"about_ca_topic_score_gemma":2.672277e-7,"domain_scores_codex":[0.999345,0.00008728271,0.0003293105,0.00003573526,0.0001074206,0.00009524781],"domain_scores_gemma":[0.9995456,0.0001099059,0.0001073843,0.00009070192,0.00008100847,0.00006541278],"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.0003936947,0.00005034072,0.000364762,0.00004434268,0.0001283735,0.0000263034,0.000551719,0.0007144907,0.01030752,0.9861447,0.0002703638,0.001003399],"study_design_scores_gemma":[0.0009079485,0.0003454719,0.000480426,0.00007473859,0.00004459083,0.000592104,0.0004987034,0.00004451033,0.009965682,0.9741711,0.01275594,0.0001187811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9880575,0.0008902439,0.000630157,0.00003179293,0.002722148,0.00004120209,0.000002643521,0.00002340307,0.007600932],"genre_scores_gemma":[0.9994337,0.0001932185,0.00008987056,0.000006426771,0.0002250079,8.276225e-7,3.060927e-7,0.00001164752,0.00003899152],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01248557,"threshold_uncertainty_score":0.292427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1541637185","doi":"10.1002/jcd.1027","title":"Cycle decompositions III: Complete graphs and fixed length cycles","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":200,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Capilano University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Order (exchange); Decomposition; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01793181826664051,"gpt":0.2281622899208836,"spread":0.2102304716542431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003888014,0.0001545992,0.0003301179,0.0001981265,0.0001436793,0.00007093642,0.0001753822,0.00008510484,0.00003456846],"category_scores_gemma":[0.0000174895,0.0001441106,0.000137625,0.0002115707,0.00005745806,0.0002505468,0.00001421512,0.0002428631,0.00000714402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003114018,"about_ca_system_score_gemma":0.00001506538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005389993,"about_ca_topic_score_gemma":0.000001760108,"domain_scores_codex":[0.9989346,0.0001121543,0.0004543162,0.00008109139,0.0002059864,0.0002118938],"domain_scores_gemma":[0.9993094,0.0001751423,0.0001240744,0.0001284016,0.00009380272,0.0001691858],"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.0007562682,0.0005474479,0.005168225,0.0001661348,0.001120863,0.0005369452,0.002105855,0.008607464,0.1702849,0.7920014,0.01465031,0.004054158],"study_design_scores_gemma":[0.009977377,0.001233243,0.01203595,0.0003717644,0.0003363844,0.002462271,0.0005838915,0.00446172,0.007732155,0.9291021,0.03068775,0.001015365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9882368,0.0008352453,0.004103056,0.00006617569,0.004052607,0.0001152279,0.000005564119,0.00008614622,0.00249919],"genre_scores_gemma":[0.9991876,0.0002270835,0.0002770023,0.00002030376,0.0002469851,0.000002967093,0.000001387364,0.00002362031,0.00001308009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1625528,"threshold_uncertainty_score":0.5876658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066218472","doi":"10.1023/b:desi.0000029212.52214.71","title":"Constructions for Permutation Codes in Powerline Communications","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":177,"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":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Hamming distance; Permutation (music); Partial permutation; Mathematics; Hamming weight; Hamming code; Discrete mathematics; Combinatorics; Coding theory; Coding (social sciences); Cyclic permutation; Set (abstract data type); Automorphism; Permutation graph; Hamming graph; Block code; Computer science; Algorithm; Symmetric group; Decoding methods; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02147336466098679,"gpt":0.2456515097056048,"spread":0.224178145044618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001625452,0.0001143252,0.0001508229,0.0002406167,0.0001483092,0.00004202822,0.000113841,0.0000656997,0.000004864921],"category_scores_gemma":[0.000008007473,0.0001181867,0.00007288098,0.0003476177,0.0001529178,0.0001021281,0.000009542111,0.00008652829,0.000001559895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001305834,"about_ca_system_score_gemma":0.000009127113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002238932,"about_ca_topic_score_gemma":0.0001519005,"domain_scores_codex":[0.9994376,0.00003122337,0.0002070501,0.0001149049,0.0000491584,0.0001600418],"domain_scores_gemma":[0.999565,0.0000974201,0.00002426293,0.000226561,0.00003673497,0.00005000028],"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.00002601522,0.00008370254,0.004092077,0.0001206094,0.00009324885,0.000001560312,0.001714282,0.007885891,0.01299561,0.9678135,0.00009100553,0.005082492],"study_design_scores_gemma":[0.007300362,0.0005379173,0.02011678,0.0005491134,0.0002183572,0.0001713017,0.01304534,0.02964278,0.008636417,0.8955593,0.02257717,0.001645201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5533248,0.002743595,0.4398288,0.0001622524,0.0002062707,0.0006558743,0.0001266305,0.0002889772,0.002662799],"genre_scores_gemma":[0.9799125,0.0003879725,0.01943584,0.00002549411,0.00001741118,0.0001526149,0.00004971287,0.00001634704,0.000002167698],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4265876,"threshold_uncertainty_score":0.4819514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161993469","doi":"10.1109/65.885669","title":"Lighting the local area: optical code-division multiple access and quality of service provisioning","year":2000,"lang":"en","type":"article","venue":"IEEE Network","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":176,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Asynchronous communication; Code division multiple access; Time division multiple access; Physical layer; Quality of service; Provisioning; Flexibility (engineering); Distributed computing; Telecommunications; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.02798485384185452,"gpt":0.25668734396197,"spread":0.2287024901201155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006608394,0.0001288342,0.0002156045,0.00001509618,0.0001471117,0.00005367134,0.0002218061,0.00008706168,0.00002203101],"category_scores_gemma":[0.00001442169,0.0000912332,0.00004420789,0.0002559498,0.0000562233,0.0001270614,0.00003191189,0.0001795924,0.000009857253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001013605,"about_ca_system_score_gemma":0.000005430009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005205697,"about_ca_topic_score_gemma":0.0001478923,"domain_scores_codex":[0.9990076,0.0001047681,0.0003310941,0.0001559362,0.0001555336,0.0002450294],"domain_scores_gemma":[0.9991579,0.0004678562,0.00004214207,0.0002394758,0.0000319806,0.00006062737],"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.00008100298,0.00002005986,0.0083521,0.0002160772,0.00004573227,0.000002223842,0.0005916642,0.9666253,0.001109786,0.0006526384,0.0007784987,0.02152489],"study_design_scores_gemma":[0.00151379,0.0001001643,0.07172441,0.001329912,0.00006254546,0.00002154263,0.0004680436,0.9008341,0.008391233,0.004527261,0.01022993,0.0007970828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9899213,0.0004369624,0.005044296,0.00004720619,0.0006248589,0.0001851842,0.000004221731,0.0001246753,0.003611296],"genre_scores_gemma":[0.9993708,0.0000199583,0.00007836956,0.0000698018,0.0003980018,0.00001189252,0.000002160722,0.00001923276,0.00002979554],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06579124,"threshold_uncertainty_score":0.3720382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047595535","doi":"10.1016/j.ejc.2008.01.002","title":"Equiangular lines, mutually unbiased bases, and spin models","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":168,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Mathematics; Mutually unbiased bases; Combinatorics; Conjecture; Prime (order theory); Commutative property; Association scheme; Prime power; Discrete mathematics; Pure mathematics; Hilbert space","retraction":null,"screen_n_in":null,"score":{"opus":0.01916857852181212,"gpt":0.1819355989369194,"spread":0.1627670204151073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161964,0.0001531057,0.0002444217,0.0001436504,0.00007857501,0.00002656781,0.0002189438,0.00002679761,0.000007943542],"category_scores_gemma":[0.00003744987,0.0001410187,0.00008843645,0.0001991986,0.00004790979,0.0002208925,0.00002687512,0.0002650326,0.00001303557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002526007,"about_ca_system_score_gemma":0.00001997836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.836287e-7,"about_ca_topic_score_gemma":1.139275e-7,"domain_scores_codex":[0.9988416,0.0002169738,0.0004558353,0.00008000986,0.0002273842,0.0001781699],"domain_scores_gemma":[0.999366,0.00004492137,0.0001237302,0.000166552,0.000122595,0.0001762183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006156438,0.001411917,0.009726401,0.001629294,0.001844794,0.04596396,0.01627083,0.2964202,0.03303111,0.461681,0.1033219,0.02808299],"study_design_scores_gemma":[0.03540687,0.008013596,0.03437653,0.003327246,0.000826486,0.03429829,0.002612164,0.2394476,0.01780637,0.1436841,0.4736012,0.006599602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9655216,0.00503095,0.01654044,0.00002984146,0.001117055,0.0000605623,0.000003200027,0.00008037078,0.01161592],"genre_scores_gemma":[0.9989038,0.0005358442,0.0001677234,0.00003938889,0.0001588186,2.511992e-7,0.000001072462,0.00004983887,0.0001433276],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3702793,"threshold_uncertainty_score":0.5750574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154750111","doi":"10.1002/jcd.20105","title":"Small latin squares, quasigroups, and loops","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":159,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Latin square; Combinatorics; Order (exchange); Quasigroup; Orthogonal array; Discrete mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01644457004630602,"gpt":0.190534576478463,"spread":0.174090006432157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004807284,0.0001313087,0.0002676252,0.0001633711,0.00005082066,0.00005995923,0.0001302125,0.00009775398,0.00001500991],"category_scores_gemma":[0.00002566735,0.0001173393,0.00008732156,0.0001712607,0.00002968756,0.0001232663,0.000009040813,0.0002130899,0.000005617465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003129699,"about_ca_system_score_gemma":0.00001798291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001368828,"about_ca_topic_score_gemma":0.000002710923,"domain_scores_codex":[0.9990652,0.00009153895,0.0004345372,0.0000643247,0.000172708,0.000171656],"domain_scores_gemma":[0.9994831,0.0001324247,0.0001232761,0.00009847502,0.0000778611,0.00008486513],"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.0003127192,0.0002837949,0.007387415,0.0002763191,0.0002315613,0.0002792914,0.0005767467,0.005372966,0.06782772,0.9016407,0.01291847,0.002892321],"study_design_scores_gemma":[0.01035712,0.001863294,0.01405811,0.0005223873,0.0002693374,0.0007059615,0.0003144627,0.002779326,0.03989156,0.8649866,0.06302714,0.001224688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9787485,0.002412514,0.007529963,0.00002968344,0.005803862,0.0001185157,0.000002950397,0.000072161,0.005281842],"genre_scores_gemma":[0.9987805,0.00002825475,0.0002672253,0.000005721267,0.0008275357,0.000001531136,7.885801e-7,0.00002280302,0.0000656331],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05010867,"threshold_uncertainty_score":0.4784959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1485965721","doi":"10.1023/a:1012504516447","title":"Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":148,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Crosslight Software (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders","keywords":"Visual cryptography; Computer science; Cryptography; Pixel; Computation; Theoretical computer science; Transparency (behavior); Integer (computer science); Algorithm; Steganography; Discrete mathematics; Mathematics; Image (mathematics); Secret sharing; Artificial intelligence; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02859812944527219,"gpt":0.2067404513237735,"spread":0.1781423218785013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001924593,0.0003927285,0.0005376563,0.0006027878,0.0001428066,0.00008561933,0.0002057436,0.0001703624,0.0002489176],"category_scores_gemma":[0.000003849217,0.0003336028,0.0002067277,0.001289658,0.0004018259,0.0002224539,0.00002008164,0.0002034622,0.000004179958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005594626,"about_ca_system_score_gemma":0.000005081421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000354244,"about_ca_topic_score_gemma":0.000007012579,"domain_scores_codex":[0.9984323,0.0000671717,0.0004503451,0.0003530064,0.0002620647,0.0004351317],"domain_scores_gemma":[0.9992217,0.00008892574,0.00007784411,0.0003362006,0.0001027337,0.0001725914],"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.0006740026,0.0007608476,0.220616,0.002146941,0.003824092,0.0001079685,0.003923694,0.001537894,0.3376184,0.3364967,0.001958239,0.09033525],"study_design_scores_gemma":[0.01648648,0.005853328,0.2506778,0.004348962,0.001799467,0.001150166,0.01271191,0.03995575,0.5392815,0.09436478,0.0213511,0.01201874],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9522416,0.002971156,0.03765225,0.000008819899,0.0001710021,0.0003333291,0.00006579248,0.0003267962,0.006229265],"genre_scores_gemma":[0.9953853,0.0003918469,0.004032367,0.0000206697,0.00005723766,0.00004090739,0.000006420953,0.0000576794,0.000007510564],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2421319,"threshold_uncertainty_score":0.9999116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125862453","doi":"10.1016/s0012-365x(01)00466-6","title":"On the injective chromatic number of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds pour la Formation de Chercheurs et l'Aide à la Recherche; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Injective function; Mathematics; Chromatic scale; Combinatorics; Graph; Discrete mathematics; Monomorphism; Upper and lower bounds; Hypercube; Critical graph; Context (archaeology); Line graph; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01241056388756599,"gpt":0.2081247982007641,"spread":0.1957142343131981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001537699,0.0001247382,0.0001835685,0.00003453094,0.00004327012,0.00001448844,0.0001655598,0.00004279061,0.0005825274],"category_scores_gemma":[0.0000473065,0.00007834503,0.00009744853,0.0001903848,0.00006090426,0.00003718207,0.00001202528,0.00009728389,0.0002921654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009954559,"about_ca_system_score_gemma":9.089104e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.683943e-7,"about_ca_topic_score_gemma":5.591323e-7,"domain_scores_codex":[0.9993784,0.00003230634,0.0002329543,0.00006576638,0.0001561765,0.0001343457],"domain_scores_gemma":[0.9993042,0.000269121,0.00005283195,0.0003312705,0.00001588378,0.00002663497],"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.00000128643,0.00005213992,0.00005775954,0.0004172009,0.0001185392,0.000001828376,0.008427766,0.0004130401,0.0005491009,0.9877007,0.002143387,0.0001172455],"study_design_scores_gemma":[0.0003036033,0.00006869034,0.0001475601,0.0005754982,0.00007313305,0.00003898844,0.003839,0.1198024,0.00717573,0.8674098,0.0001853514,0.0003802759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8609872,0.00006517881,0.001216257,0.00002371892,0.0001182325,0.0002064324,0.00001124324,0.0001091406,0.1372626],"genre_scores_gemma":[0.9994625,0.000009270313,0.000254818,0.00001620082,0.00001164093,0.00002617491,8.126506e-7,0.00002552336,0.0001930985],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1384752,"threshold_uncertainty_score":0.6378267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997203758","doi":"10.1002/jcd.10002","title":"On the state of strength‐three covering arrays","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":130,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Michigan Technological University","keywords":"Mathematics; Combinatorics; Constructive; Product (mathematics); Column (typography); Order (exchange); Discrete mathematics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02112653195116119,"gpt":0.1988343033484486,"spread":0.1777077713972875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000535802,0.0001213568,0.000259242,0.0000964892,0.00004741898,0.00002744836,0.0002654193,0.00004417905,0.0001033403],"category_scores_gemma":[0.00009118037,0.00008453023,0.0001467933,0.0001662527,0.00003441376,0.0001096134,0.000008701414,0.0002810572,0.00001492495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003547245,"about_ca_system_score_gemma":0.000008550105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001498786,"about_ca_topic_score_gemma":5.943825e-7,"domain_scores_codex":[0.998946,0.00009166639,0.0004451802,0.00004951459,0.0003106301,0.0001569819],"domain_scores_gemma":[0.9990864,0.0003957087,0.0001946792,0.0001730279,0.00008424472,0.00006597467],"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.0004675121,0.0006049814,0.0003423331,0.0002567086,0.001060169,0.0001428517,0.003270343,0.1261603,0.09731451,0.7376595,0.02285676,0.00986403],"study_design_scores_gemma":[0.004435028,0.002391436,0.0005481813,0.0007484596,0.0001384018,0.0001067551,0.0002194542,0.01961334,0.1514968,0.812104,0.007575148,0.0006229223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9840437,0.0003749777,0.005444787,0.00003312178,0.006098025,0.0001116814,0.00000467452,0.00002808642,0.003861006],"genre_scores_gemma":[0.999631,0.00004595856,0.00003707693,0.00000792735,0.0002316358,0.000001566494,8.961761e-8,0.00001961739,0.0000250541],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1065469,"threshold_uncertainty_score":0.3447043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143668983","doi":"10.46298/dmtcs.317","title":"On Linear Layouts of Graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Discrete mathematics; Mathematical proof","retraction":null,"screen_n_in":null,"score":{"opus":0.00802119738390963,"gpt":0.2237613964525075,"spread":0.2157401990685979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005132013,0.0001779871,0.0002544301,0.0001602751,0.0001027819,0.00004850346,0.0006467925,0.00005109513,0.0000341561],"category_scores_gemma":[0.00004482743,0.0001356032,0.0001040239,0.0005798976,0.001416796,0.0001086365,0.00008694777,0.0001426399,0.00006019406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001957819,"about_ca_system_score_gemma":0.0000175221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.882962e-7,"about_ca_topic_score_gemma":1.408786e-7,"domain_scores_codex":[0.9986316,0.00001978468,0.0003299182,0.0002237024,0.0004645702,0.0003304276],"domain_scores_gemma":[0.9991177,0.00013654,0.00004416515,0.0004975153,0.00006029474,0.0001437955],"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.000003285995,0.00004252091,0.000002652775,0.00008337264,0.000008623246,0.000003330008,0.001229384,0.01129963,0.001447271,0.9857106,0.000004681467,0.0001647102],"study_design_scores_gemma":[0.0001877943,0.0001094524,0.00001578165,0.0001853601,0.000008456031,0.00001162988,0.00006656185,0.1554078,0.01389834,0.8299422,0.000004582892,0.0001620048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4399654,0.00002566502,0.546449,0.00003688031,0.0003703727,0.0001657529,0.000007179059,0.0001878217,0.01279195],"genre_scores_gemma":[0.969673,0.000002274788,0.03023475,0.00003481431,0.00002830246,0.000005121653,8.838245e-7,0.00001867655,0.00000212057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5297077,"threshold_uncertainty_score":0.5529737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126578673","doi":"10.1109/68.998735","title":"Design and performance of 2-D codes for wavelength-time optical CDMA","year":2002,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":114,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Code division multiple access; Computer science; Bit error rate; Algorithm; Interference (communication); Code (set theory); Chip; Wavelength; Wavelength-division multiplexing; Electronic engineering; Optics; Telecommunications; Decoding methods; Physics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.00900347565889971,"gpt":0.1797155167589452,"spread":0.1707120411000455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001812558,0.0001448065,0.0002461858,0.0001885898,0.00005109956,0.000007298412,0.0001823971,0.0001934679,0.000008586458],"category_scores_gemma":[0.00001214343,0.0001472713,0.00003943616,0.0001677904,0.0002202123,0.00005665709,0.00001253839,0.0001656195,0.0000168546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001907544,"about_ca_system_score_gemma":0.000002073505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.037475e-7,"about_ca_topic_score_gemma":1.084837e-7,"domain_scores_codex":[0.9992648,0.00001175631,0.0002292329,0.0001605304,0.00006188518,0.0002717435],"domain_scores_gemma":[0.9995717,0.0001045553,0.00003624697,0.0002382698,0.00001908051,0.00003010391],"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.00003135856,0.00002658676,0.0001407037,0.0001837232,0.00010635,0.000005301619,0.0001459741,0.004674332,0.9863635,0.001828091,0.001161059,0.005332964],"study_design_scores_gemma":[0.0003337356,0.0001327137,0.00001342696,0.00002912367,0.00002155765,0.00004331523,0.00001270303,0.4593129,0.5390791,0.0003645966,0.0005013285,0.0001555321],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.982847,0.0002647901,0.01566377,0.0002802201,0.0001765553,0.000330755,0.000005805418,0.0003387582,0.00009237658],"genre_scores_gemma":[0.9910709,0.0001142042,0.008591505,0.00007049079,0.00001067649,0.00009235658,7.110525e-7,0.00002842643,0.00002076191],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4546385,"threshold_uncertainty_score":0.6005549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985009561","doi":"10.1109/4234.864189","title":"Impact of the beat noise on the performance of 2-D optical CDMA systems","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Beat (acoustics); Computer science; Spread spectrum; Noise (video); Telecommunications; Noise measurement; Bit error rate; Speech recognition; Code division multiple access; Acoustics; Electronic engineering; Algorithm; Physics; Noise reduction; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01527324171479927,"gpt":0.2243418110542265,"spread":0.2090685693394272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000220189,0.00009300962,0.000129359,0.00003465721,0.0001188038,0.0000123207,0.001080607,0.0000345653,0.00002502391],"category_scores_gemma":[0.000006839497,0.00005321089,0.000132667,0.0002191906,0.0002234933,0.00004901388,0.00002400527,0.0001958004,0.00002543028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003447524,"about_ca_system_score_gemma":0.000007473148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003981568,"about_ca_topic_score_gemma":0.000001753247,"domain_scores_codex":[0.9993398,0.0001457949,0.0002415792,0.00005258986,0.0001039863,0.0001162492],"domain_scores_gemma":[0.9977553,0.0002351202,0.00004416665,0.00192318,0.00002079351,0.00002137268],"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.0000419259,0.0001877842,0.01449913,0.0001835267,0.0004125493,2.470904e-7,0.002118607,0.6540667,0.3026365,0.01674641,0.00643403,0.002672566],"study_design_scores_gemma":[0.002280154,0.0006782127,0.2600969,0.003315295,0.0004035456,0.00009035996,0.0008724565,0.5958143,0.115314,0.0002745045,0.01918738,0.001672859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9938605,0.0001965979,0.00002820022,0.0005124524,0.0001243892,0.0002049654,0.0000162885,0.0000336851,0.005022874],"genre_scores_gemma":[0.9997241,0.00009082881,0.00002038281,0.00005670359,0.00001890661,0.00003629737,0.000001969872,0.00001344392,0.00003738028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2455977,"threshold_uncertainty_score":0.2169877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970894474","doi":"10.1109/50.983229","title":"Multirate optical fast frequency hopping CDMA system using power control","year":2002,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Code division multiple access; Computer science; Power control; Electronic engineering; Frequency-hopping spread spectrum; Transmission (telecommunications); Quality of service; Interference (communication); Computer network; Spread spectrum; Bit error rate; Power (physics); Real-time computing; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.009444941127040595,"gpt":0.188031789657725,"spread":0.1785868485306844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378369,0.0002214083,0.0005538893,0.000689188,0.0000831262,0.00003373091,0.0003354378,0.000372611,0.00006629822],"category_scores_gemma":[0.00005364346,0.0001877473,0.0001763836,0.0004197371,0.0001028427,0.0001890759,0.00002073218,0.0005915513,0.00006204178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001655379,"about_ca_system_score_gemma":0.000009761336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.153941e-7,"about_ca_topic_score_gemma":7.497117e-7,"domain_scores_codex":[0.998432,0.00005264712,0.0007917896,0.0001321449,0.0001972602,0.0003941915],"domain_scores_gemma":[0.9991602,0.00005749112,0.0002511238,0.0002677024,0.0001556223,0.000107897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004803722,0.0001697694,0.00369448,0.0003755624,0.001113352,0.002702844,0.0008203327,0.00766778,0.8666905,0.112399,0.0005644172,0.00375403],"study_design_scores_gemma":[0.02232695,0.003965722,0.001649067,0.007536982,0.001563055,0.08359614,0.01686479,0.5751587,0.2544501,0.01378613,0.01403906,0.005063239],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9554594,0.003096439,0.03373926,0.0002241627,0.001620289,0.0001612864,0.000005241349,0.000430722,0.005263174],"genre_scores_gemma":[0.9974786,0.00002154266,0.002254495,0.00001759565,0.0001617942,0.000002053115,1.074424e-7,0.00003971951,0.00002409744],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6122403,"threshold_uncertainty_score":0.7656114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080824882","doi":"10.1016/j.dam.2005.09.009","title":"On constant composition codes","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":102,"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":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Constant (computer programming); Code word; Composition (language); Permutation (music); Alphabet; Combinatorics; Discrete mathematics; Block code; Linear code; Binary number; Arithmetic; Algorithm; Computer science; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.00705399009592934,"gpt":0.202820232867502,"spread":0.1957662427715727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001096937,0.0001423498,0.0001796523,0.00004617134,0.00005477332,0.00003063506,0.00009728249,0.00004725851,0.00005909855],"category_scores_gemma":[0.000002182522,0.0001247268,0.0000446947,0.00007196996,0.00003792154,0.00003392096,0.000009382373,0.0001060432,0.0003913412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002742175,"about_ca_system_score_gemma":0.00000271347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.305464e-7,"about_ca_topic_score_gemma":8.63115e-7,"domain_scores_codex":[0.9993865,0.000005426346,0.000217451,0.00009399831,0.0001300191,0.0001666082],"domain_scores_gemma":[0.9996109,0.00007931625,0.0000315451,0.000219098,0.000008145667,0.00005096745],"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.000006598769,0.00003343859,5.880394e-7,0.0001310464,0.00003221918,0.000001111959,0.0006352792,0.006736872,0.02318465,0.9667447,0.000816993,0.001676492],"study_design_scores_gemma":[0.00189619,0.0001094192,0.00003338526,0.00054001,0.000150663,0.00004668841,0.001947574,0.2036152,0.1920904,0.5882409,0.00976173,0.001567861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3576514,0.00008586352,0.0759709,0.00004636375,0.00013739,0.0004417856,0.00004135806,0.0007366775,0.5648883],"genre_scores_gemma":[0.9943208,0.000007261607,0.005440217,0.00005354635,0.00005355044,0.00003977735,0.00001746424,0.00003042607,0.00003702261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6366693,"threshold_uncertainty_score":0.5086213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148158683","doi":"10.1002/0471224561.ch4","title":"Channel Assignment and Graph Multicoloring","year":2002,"lang":"en","type":"other","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Base station; Graph; Channel (broadcasting); Interference (communication); Base (topology); Computer science; Frequency reuse; Reuse; Topology (electrical circuits); Mathematics; Algorithm; Combinatorics; Theoretical computer science; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.009913741816565786,"gpt":0.1704579556576848,"spread":0.160544213841119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004216003,0.0001802338,0.000181897,0.0001526934,0.00001570719,0.00001742109,0.00006084242,0.0001638338,0.00145808],"category_scores_gemma":[0.000001189012,0.000159534,0.00003731481,0.00005123097,0.00001818727,0.00001495166,0.00001263984,0.00009175736,0.000123916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009356171,"about_ca_system_score_gemma":5.234621e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001788612,"about_ca_topic_score_gemma":0.00001177976,"domain_scores_codex":[0.999534,0.00001123449,0.00009234706,0.0001326592,0.00007079853,0.0001589714],"domain_scores_gemma":[0.9997646,0.00001025433,0.00001681408,0.0001470427,0.000001989406,0.00005931361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001813344,0.00003347757,0.00003740508,0.0009118544,0.0003708707,0.00002792631,0.0003574671,0.001981634,0.0002099348,0.004552862,0.9878035,0.003711283],"study_design_scores_gemma":[0.0003992665,0.00002490096,0.00002202575,0.0003671106,0.00003991976,0.00001223841,0.0001443097,0.006463238,0.0002505765,0.0003930066,0.9912457,0.0006376373],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00005138736,0.002853953,0.003793593,0.000003700986,0.0007311382,0.0001884117,0.000007428451,0.0008092074,0.9915612],"genre_scores_gemma":[0.1129459,0.0006911141,0.0001064536,0.00001484842,0.0002277069,0.00005636206,0.000003185876,0.0004224088,0.885532],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1128945,"threshold_uncertainty_score":0.9994547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403826439","doi":"10.1109/comst.2024.3487112","title":"RIS-Assisted Physical Layer Security in Emerging RF and Optical Wireless Communications Systems: A Comprehensive Survey","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; University of Guelph; McMaster University","funders":"HORIZON EUROPE Framework Programme; Natural Sciences and Engineering Research Council of Canada; European Commission; McMaster University; Agence Nationale de la Recherche; University of Guelph","keywords":"Physical layer; Wireless; Layer (electronics); Computer science; Telecommunications; Materials science; Nanotechnology","retraction":null,"screen_n_in":null,"score":{"opus":0.06455284319399247,"gpt":0.3188448688402552,"spread":0.2542920256462627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004591481,0.0003563615,0.00073223,0.0003120331,0.0003265374,0.000335734,0.001450146,0.0002172753,0.000004649147],"category_scores_gemma":[0.0001515518,0.0003748637,0.0001204631,0.001118474,0.0004924492,0.0003367407,0.0003802021,0.0008112125,0.00006762151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001680443,"about_ca_system_score_gemma":0.00007178987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001681678,"about_ca_topic_score_gemma":0.00265561,"domain_scores_codex":[0.9924633,0.005657825,0.0008515017,0.0003551474,0.0002625848,0.0004096218],"domain_scores_gemma":[0.9904776,0.005839736,0.00008076763,0.003212322,0.0002355995,0.0001539509],"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.0002131722,0.00474576,0.05863164,0.007176425,0.005352907,0.0001350286,0.0734183,0.01665373,0.2430083,0.5366299,0.01726083,0.03677405],"study_design_scores_gemma":[0.002879785,0.0001732665,0.2232351,0.00348898,0.0004398426,0.0001750656,0.005945184,0.6669993,0.002228956,0.006066812,0.08478274,0.003584935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9763351,0.01453122,0.001239615,0.0001827614,0.003272676,0.0008332047,0.0004378375,0.0007725402,0.002395024],"genre_scores_gemma":[0.9973814,0.001601004,0.000123136,0.000007880481,0.0002181743,0.0003133888,0.000240978,0.00007725495,0.00003678989],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6503456,"threshold_uncertainty_score":0.9998703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074982499","doi":"10.1007/s004530010067","title":"Static Frequency Assignment in Cellular Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Frequency assignment; Theory of computation; Mathematics; Combinatorics; Graph; Vertex (graph theory); Vertex connectivity; Discrete mathematics; Integer (computer science); Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.004934258321494517,"gpt":0.1739740494944223,"spread":0.1690397911729278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001656229,0.0001203779,0.0001418219,0.00007195814,0.0000250796,0.00001793866,0.0001200665,0.0000682613,0.0001362045],"category_scores_gemma":[0.000003520403,0.0001217804,0.00003777547,0.0002326783,0.00001768983,0.00007075986,0.000009642783,0.0001510087,0.00008017796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005640128,"about_ca_system_score_gemma":0.000004574591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002782838,"about_ca_topic_score_gemma":0.000009614278,"domain_scores_codex":[0.9992325,0.00004354401,0.0002124293,0.0001253994,0.00009803713,0.0002880614],"domain_scores_gemma":[0.9996888,0.00003599998,0.00001582223,0.0001889621,0.000007482756,0.00006292728],"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.00003361873,0.000406309,0.01480589,0.0002610974,0.0003719167,0.002128646,0.002784652,0.7258879,0.02335358,0.03369351,0.008119614,0.1881533],"study_design_scores_gemma":[0.001205997,0.0001094009,0.002430158,0.0001710812,0.00003059577,0.00005739021,0.0004811016,0.9473156,0.003648649,0.02673816,0.01693081,0.0008810206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4755813,0.002298828,0.4903247,0.0001215587,0.001828216,0.0005097649,0.000007846699,0.0005683048,0.02875942],"genre_scores_gemma":[0.9991104,0.00005852367,0.0004838658,0.00003721525,0.0001125088,0.00003429942,0.00000818056,0.00002455515,0.0001304548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5235291,"threshold_uncertainty_score":0.4966061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075649093","doi":"10.1016/s0012-365x(03)00283-8","title":"New combinatorial designs and their applications to authentication codes and secret sharing schemes","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":89,"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":"Secret sharing; Mathematics; Converse; Combinatorial design; Discrete mathematics; Upper and lower bounds; Type (biology); Construct (python library); Combinatorics; Scheme (mathematics); Equivalence (formal languages); Cryptography; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01896666334119578,"gpt":0.2364626543621001,"spread":0.2174959910209043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001966381,0.0001299998,0.0001571959,0.00004972143,0.00008219675,0.00008323838,0.00008504464,0.00005071293,0.00001365861],"category_scores_gemma":[0.00002845317,0.0001128044,0.00002189667,0.000117314,0.0000222717,0.00006508981,0.00002216378,0.00005807367,0.00001068246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001049938,"about_ca_system_score_gemma":0.00000590522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001429836,"about_ca_topic_score_gemma":0.000001334907,"domain_scores_codex":[0.9994799,0.00001457344,0.0001748028,0.0001332081,0.00006119985,0.0001362622],"domain_scores_gemma":[0.9995463,0.00007017547,0.00002640971,0.0002208066,0.00001569064,0.0001206039],"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.000001274613,0.000008686522,0.0001409201,0.0002044797,0.00003375911,1.298429e-7,0.003765339,0.00002750984,0.006557524,0.9887468,0.00006752327,0.0004460164],"study_design_scores_gemma":[0.0004965254,0.00004013452,0.00009204281,0.0001706014,0.00006002412,0.00002442041,0.003367838,0.01864408,0.02356219,0.9453549,0.00772211,0.0004651677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3070267,0.0003938063,0.6878508,0.00002307341,0.000115408,0.0005502703,0.00001324679,0.0001911341,0.003835548],"genre_scores_gemma":[0.9905607,0.00001358448,0.009200746,0.000007070261,0.00003332114,0.00006939033,0.000005603187,0.00002544238,0.00008410256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6835341,"threshold_uncertainty_score":0.4600031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133225860","doi":"10.1109/jlt.2004.839984","title":"Experimental verification and capacity prediction of FE-OCDMA using superimposed FBG","year":2005,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Code division multiple access; Decoding methods; Bit error rate; Encoding (memory); Fiber Bragg grating; Computer science; Electronic engineering; Interference (communication); Optical fiber; Code (set theory); Algorithm; Telecommunications; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01754751312011811,"gpt":0.2128023967833709,"spread":0.1952548836632528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001856908,0.00009012591,0.0002147256,0.0003335112,0.00003427544,0.000007043289,0.00009459861,0.0001692115,0.00001297796],"category_scores_gemma":[0.00001325513,0.000083079,0.00004755957,0.0001692477,0.00009538665,0.0001798516,0.00001168345,0.0001741786,0.00000118478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006856886,"about_ca_system_score_gemma":0.000008805812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001456105,"about_ca_topic_score_gemma":6.032468e-7,"domain_scores_codex":[0.9992958,0.00002251592,0.0004088534,0.00006723188,0.00009737537,0.0001082257],"domain_scores_gemma":[0.9996279,0.00001249921,0.0001444169,0.0001213259,0.00005919376,0.00003464735],"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.00001646791,0.00003485508,0.00112932,0.0000198738,0.00004358481,0.000002466112,0.0003768485,0.0002543633,0.9949762,0.002434341,0.00002913109,0.0006825691],"study_design_scores_gemma":[0.0004427466,0.0001845821,0.001120734,0.00005375112,0.00002275396,0.0005881389,0.0005958627,0.00386643,0.9913183,0.0004754744,0.001260646,0.00007054009],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9965047,0.001335622,0.001535931,0.00005688183,0.0002624064,0.00006336931,0.000005198359,0.00006597499,0.0001699034],"genre_scores_gemma":[0.9976662,0.00003517771,0.002178355,0.00000348821,0.00009911972,0.000001394951,4.517323e-7,0.00001190016,0.000003868526],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00365784,"threshold_uncertainty_score":0.3387864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031991359","doi":"10.1080/00029890.2001.11919801","title":"Bidiagonal Factorizations of Totally Nonnegative Matrices","year":2001,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.006938435479803908,"gpt":0.2107897587797465,"spread":0.2038513232999426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008623724,0.0001374328,0.0003041401,0.00008490643,0.00003333342,0.00001441781,0.0001504495,0.0000317792,0.0002149424],"category_scores_gemma":[0.00006295782,0.0001190334,0.00008860996,0.0004957812,0.0001792293,0.00009068342,0.00001628653,0.00007951349,0.0001011306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001740902,"about_ca_system_score_gemma":0.000008455349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001764817,"about_ca_topic_score_gemma":0.000004329294,"domain_scores_codex":[0.9991812,0.00003293761,0.0003126574,0.0001125731,0.0001635089,0.0001971868],"domain_scores_gemma":[0.9993381,0.0002557303,0.00007480111,0.000199764,0.00004086355,0.00009074712],"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.000042818,0.0003945144,0.002487903,0.0004239977,0.0004170644,0.00003434293,0.004563519,0.01670944,0.008479754,0.9610146,0.0009516599,0.004480432],"study_design_scores_gemma":[0.001036714,0.0008269144,0.01704649,0.0005366384,0.0002424688,0.0000722884,0.00813728,0.1300185,0.009207246,0.8254827,0.005761091,0.001631684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6267281,0.0001636107,0.03913405,0.00004977705,0.0001270452,0.0002352733,0.00005281026,0.0002999965,0.3332094],"genre_scores_gemma":[0.9977775,0.00002209855,0.00199296,0.00001322249,0.00004314545,0.00002589555,0.000004812132,0.00002497335,0.00009537634],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3710495,"threshold_uncertainty_score":0.4854043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170886510","doi":"10.1002/jcd.21323","title":"Hadamard Matrices of Order 32","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Institute for Research in Fundamental Sciences; University of Lethbridge","keywords":"Mathematics; Hadamard transform; Combinatorics; Hadamard matrix; Complex Hadamard matrix; Hadamard's inequality; Hadamard's maximal determinant problem; Equivalence (formal languages); Sequence (biology); Order (exchange); Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01570326075954689,"gpt":0.2239582354616199,"spread":0.208254974702073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008075973,0.0001050046,0.0003008369,0.0001449207,0.00002561594,0.00001529171,0.0001852969,0.0000861467,0.00005308195],"category_scores_gemma":[0.00005891772,0.00008775435,0.000124464,0.0002526788,0.00002307834,0.0003084302,0.000009795863,0.000169258,0.00001260775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002792563,"about_ca_system_score_gemma":0.00002397011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001877438,"about_ca_topic_score_gemma":9.053511e-8,"domain_scores_codex":[0.9989557,0.00009239445,0.0004651467,0.00003213047,0.0002613151,0.0001933169],"domain_scores_gemma":[0.9992931,0.0001250241,0.0002020015,0.0001089414,0.0001630677,0.0001079056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00076767,0.001105153,0.02593459,0.001057843,0.001605295,0.00005957432,0.004723731,0.004398457,0.2354163,0.6679262,0.052686,0.004319196],"study_design_scores_gemma":[0.01550966,0.003311001,0.019484,0.001362432,0.001219505,0.001076904,0.002186091,0.001063712,0.4775479,0.2294292,0.2455008,0.002308817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9602918,0.004320309,0.006260102,0.00001845481,0.02201028,0.0001163894,0.000002939567,0.00004511272,0.006934599],"genre_scores_gemma":[0.9986441,0.00006120148,0.000349507,0.000004144459,0.0008937609,0.000001052875,2.254917e-7,0.00001884353,0.00002720581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4384969,"threshold_uncertainty_score":0.3578519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116924935","doi":"10.1016/s0012-365x(03)00272-3","title":"On group-divisible designs with block size four and group-type 6um1","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Group (periodic table); Block size; Block (permutation group theory); Type (biology); Class (philosophy); Spectrum (functional analysis); Construct (python library); Discrete mathematics; Automorphism group; Automorphism; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01639847693871242,"gpt":0.202553247140071,"spread":0.1861547702013586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000276539,0.0002338505,0.0002607367,0.00004402849,0.0001360339,0.0001086909,0.0001365951,0.000077805,0.00004390084],"category_scores_gemma":[0.00009252387,0.0001789577,0.00004267461,0.0001395884,0.00005644477,0.00009512368,0.00001618781,0.0001356391,0.00004033157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001547835,"about_ca_system_score_gemma":0.00000401041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001820648,"about_ca_topic_score_gemma":0.000007201281,"domain_scores_codex":[0.9991276,0.00004051408,0.0002147114,0.0001693555,0.0001798782,0.0002679649],"domain_scores_gemma":[0.999166,0.0002349069,0.00005596187,0.0004237588,0.0000191862,0.0001002179],"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.00003432846,0.0001008865,0.0008600742,0.001080011,0.0002323309,0.00004548947,0.001862044,0.001572146,0.004991573,0.9885595,0.0005235219,0.000138061],"study_design_scores_gemma":[0.007420957,0.003223378,0.005499611,0.003352786,0.0007838989,0.0009911829,0.00817166,0.06617604,0.01593256,0.87676,0.006606278,0.005081649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9511483,0.0001513122,0.01316598,0.00001327401,0.0002058117,0.0003681854,0.00000760353,0.0002575105,0.03468207],"genre_scores_gemma":[0.9929399,0.00001757154,0.006661768,0.00002484831,0.00002195944,0.00001919568,0.000001605321,0.00006438974,0.000248713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1117995,"threshold_uncertainty_score":0.7297685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3101372095","doi":"","title":"Weighted complex projective 2-designs from bases: optimal state determination by orthogonal measurements","year":2007,"lang":"en","type":"article","venue":"CERN Document Server (European Organization for Nuclear Research)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Orthonormal basis; Mutually unbiased bases; Mathematics; Abelian group; Dimension (graph theory); Prime (order theory); Projective test; Basis (linear algebra); Prime power; State (computer science); Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Hilbert space","retraction":null,"screen_n_in":null,"score":{"opus":0.04871629245866747,"gpt":0.2702320760458275,"spread":0.22151578358716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001562871,0.0002127745,0.0001688401,0.0002173359,0.0005190523,0.0003330215,0.0004653387,0.00005821764,0.001793939],"category_scores_gemma":[0.00007474828,0.0002256799,0.00005706348,0.0005432057,0.00007867096,0.0004973108,0.0001447265,0.000201546,0.0006966584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003317767,"about_ca_system_score_gemma":0.000009030562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002546961,"about_ca_topic_score_gemma":0.000006396905,"domain_scores_codex":[0.9977822,0.0003799062,0.0003889513,0.0003586018,0.0006247949,0.000465583],"domain_scores_gemma":[0.998949,0.00006677319,0.00007904425,0.0002926563,0.0004312827,0.0001812434],"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.005036493,0.004222306,0.01685863,0.003106854,0.005422742,0.000496371,0.07690826,0.01184762,0.55594,0.1133791,0.1291011,0.07768057],"study_design_scores_gemma":[0.02372613,0.003838929,0.1079913,0.001187321,0.0004979163,0.0001278064,0.01105296,0.008522348,0.4541124,0.0507628,0.3309171,0.007263005],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9933203,0.00003951931,0.003418605,0.0000373515,0.0001781256,0.0008469779,0.00004062878,0.0005734927,0.001544945],"genre_scores_gemma":[0.9980608,0.00001229404,0.0001098987,0.00004284934,0.00008199762,0.000001725903,0.001007326,0.000333472,0.0003496103],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2018159,"threshold_uncertainty_score":0.9991186,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159330890","doi":"10.1007/s00493-006-0030-1","title":"Packing Non-Zero A-Paths In Group-Labelled Graphs","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Vertex (graph theory); Abelian group; Zero (linguistics); Induced path; Integer (computer science); Path (computing); Graph; Matching (statistics); Discrete mathematics; Group (periodic table); Longest path problem; Shortest path problem","retraction":null,"screen_n_in":null,"score":{"opus":0.003633343370027868,"gpt":0.1708830790441692,"spread":0.1672497356741413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002102691,0.0001832869,0.0002471377,0.0002022202,0.00006623653,0.00003201321,0.0001976407,0.0001092951,0.00001898603],"category_scores_gemma":[0.000007363179,0.0001920604,0.0000791352,0.000664852,0.00002434452,0.0001050274,0.00002548488,0.0001989733,0.00007160333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007034172,"about_ca_system_score_gemma":0.000004534652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006494675,"about_ca_topic_score_gemma":0.00001437611,"domain_scores_codex":[0.9989975,0.00004242603,0.0002873831,0.0001840067,0.0001393706,0.0003493052],"domain_scores_gemma":[0.9995589,0.00005749248,0.00003083625,0.0002798893,0.00001791922,0.0000549099],"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.00001741995,0.0003423212,0.04561594,0.0001975468,0.00004491395,0.0001405432,0.0005003359,0.001622032,0.01272444,0.9283365,0.008419693,0.002038303],"study_design_scores_gemma":[0.004342583,0.0001648841,0.05553648,0.000277285,0.00003437678,0.00002722715,0.0001726332,0.007582218,0.006563864,0.889198,0.03478643,0.001314032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9554579,0.001268339,0.0007906072,0.00001194664,0.001418483,0.0002190794,0.000002184145,0.0003660486,0.04046543],"genre_scores_gemma":[0.9996481,0.00002468643,0.00003474448,0.00001072991,0.00003058675,0.00004659251,0.000007873276,0.00003970034,0.0001569691],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04419024,"threshold_uncertainty_score":0.7831995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001092675","doi":"10.1016/j.jcta.2007.04.005","title":"On generalized separating hash families","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Hash function; Double hashing; Mathematics; Hash chain; SHA-2; Collision resistance; Computer science; Theoretical computer science; Hash table; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.005995814983847147,"gpt":0.2191459336961046,"spread":0.2131501187122574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002296665,0.0001838877,0.0003639938,0.000185687,0.0001072306,0.00005588772,0.0002296266,0.0001084408,0.00007346395],"category_scores_gemma":[0.0001448733,0.0001542356,0.0001825985,0.000203339,0.00006885463,0.0002797882,0.00001540042,0.0003070331,0.00001176966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000554596,"about_ca_system_score_gemma":0.00001962841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.686364e-7,"about_ca_topic_score_gemma":9.713945e-7,"domain_scores_codex":[0.9986185,0.0001499037,0.0006079254,0.0000748622,0.0002862654,0.0002625244],"domain_scores_gemma":[0.9990602,0.0003522726,0.0001890503,0.0001676373,0.000115851,0.0001149649],"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.001081999,0.00003758888,0.0000418266,0.00003077936,0.0001296764,0.00006297645,0.0007791968,0.001622597,0.008820896,0.9853133,0.001035695,0.001043454],"study_design_scores_gemma":[0.002043549,0.0007682043,0.0001152551,0.0001479636,0.00004019351,0.0001949766,0.00162849,0.00004495558,0.04208721,0.925055,0.02757208,0.0003021511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9629962,0.0004403931,0.001706426,0.00001416991,0.01270185,0.00008566729,0.000002168045,0.00008764507,0.0219655],"genre_scores_gemma":[0.9985705,0.00004429601,0.0001701215,0.00003468001,0.0009526511,0.000001437042,6.635054e-7,0.0000315348,0.0001941245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06025834,"threshold_uncertainty_score":0.6289548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100729666","doi":"10.1364/jon.6.000819","title":"Code-division multiplexing for in-service out-of-band monitoring of live FTTH-PONs","year":2007,"lang":"en","type":"article","venue":"Journal of Optical Networking","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Passive optical network; Time-division multiplexing; Computer network; Wavelength-division multiplexing; Fiber to the x; Optical line termination; Access network; Computer science; Multiplexing; Electronic engineering; Telecommunications; Engineering; Wavelength; Optoelectronics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0348798881626936,"gpt":0.2790841773070041,"spread":0.2442042891443105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001607098,0.0001216862,0.0003903074,0.0001658689,0.00003323103,0.00001416422,0.0001723462,0.0001113892,0.000002089743],"category_scores_gemma":[0.0000720699,0.000111559,0.0001490436,0.0002166774,0.00002491945,0.0001223772,0.00001824845,0.000278767,5.458318e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004324722,"about_ca_system_score_gemma":0.00001063729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002216652,"about_ca_topic_score_gemma":0.00001265263,"domain_scores_codex":[0.9985212,0.00002225393,0.0008760326,0.00007810608,0.000211496,0.00029093],"domain_scores_gemma":[0.9985377,0.0008827224,0.0002327252,0.00009984001,0.000151825,0.00009523311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006455255,0.0001990788,0.0892274,0.0008499629,0.00028824,0.0000559053,0.004508669,0.6303878,0.2536887,0.001959542,0.00002792758,0.01816128],"study_design_scores_gemma":[0.01443796,0.002027317,0.1516405,0.03001156,0.000455252,0.0002503511,0.01255219,0.3853506,0.3883702,0.006665974,0.006187809,0.002050362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.877578,0.0009294396,0.1186595,0.00001166671,0.002236593,0.0001150982,0.000001786619,0.0000134179,0.0004545378],"genre_scores_gemma":[0.9902669,0.00003898764,0.008902412,0.000003991601,0.0007595335,0.00000112504,3.684827e-7,0.00002418331,0.000002524393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2450372,"threshold_uncertainty_score":0.4549243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153537785","doi":"10.1109/lcomm.2002.803478","title":"System performance comparison of optical CDMA and WDMA in a broadcast local area network","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Code division multiple access; Wavelength-division multiplexing; Computer network; Network packet; Throughput; Electronic engineering; Wavelength; Telecommunications; Optics; Wireless; Engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02923335358460266,"gpt":0.2206466313431016,"spread":0.1914132777584989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001761142,0.0001086843,0.0002340226,0.00008268988,0.00008163211,0.00001596923,0.0003910271,0.00005821536,0.000004703331],"category_scores_gemma":[0.000003090714,0.0001157052,0.00003257173,0.0002591507,0.0002032204,0.00008525543,0.00004537211,0.0002368369,0.00001664854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004688786,"about_ca_system_score_gemma":0.000001546407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001050987,"about_ca_topic_score_gemma":0.00002211311,"domain_scores_codex":[0.9992045,0.00008599783,0.000353478,0.0000885376,0.00008224312,0.0001851983],"domain_scores_gemma":[0.9989799,0.0001387528,0.0000425613,0.0007801911,0.00001402247,0.00004453466],"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.00003904674,0.000294491,0.09392226,0.001274314,0.0001943787,0.000008838077,0.008060316,0.7923114,0.01453121,0.01266723,0.01175728,0.06493928],"study_design_scores_gemma":[0.0003268236,0.00002332014,0.003809808,0.0003927795,0.00001575702,0.00002442028,0.0005951527,0.9921236,0.0005289686,0.000006081082,0.001980803,0.0001724548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9888141,0.002331564,0.005104609,0.0002280097,0.0001562214,0.0001493008,0.000002898952,0.0001038084,0.00310947],"genre_scores_gemma":[0.9990646,0.0001307377,0.0006817169,0.00003975778,0.00002284073,0.00003640786,0.000003314506,0.00001515908,0.00000551799],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1998123,"threshold_uncertainty_score":0.4718321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050823015","doi":"10.1006/jcta.2001.3230","title":"Tree-like Properties of Cycle Factorizations","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":61,"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":"Bijection; Combinatorics; Mathematics; Vertex (graph theory); Factorization; Generalization; Tree (set theory); Tuple; Product (mathematics); Degree (music); Class (philosophy); Set (abstract data type); Discrete mathematics; Computer science; Graph; Algorithm; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01084859978924495,"gpt":0.1736988289356489,"spread":0.1628502291464039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003641556,0.0001303805,0.0003213934,0.0001221138,0.00006111735,0.00002737031,0.0002222075,0.00007753018,0.0002059153],"category_scores_gemma":[0.00007389892,0.0001039938,0.000149357,0.0002061317,0.0000944733,0.0004101361,0.00001511892,0.0001665021,0.000006481473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002159362,"about_ca_system_score_gemma":0.00001075377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.35069e-7,"about_ca_topic_score_gemma":4.301303e-7,"domain_scores_codex":[0.9989469,0.000130528,0.0005087511,0.00005228431,0.0002162211,0.0001453195],"domain_scores_gemma":[0.9993765,0.0000555507,0.0001834071,0.0001563382,0.0001559653,0.0000722624],"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.0004069404,0.0002431668,0.00024362,0.0002466466,0.0004425482,0.0000187524,0.005899955,0.002033825,0.06967581,0.9167781,0.001863172,0.002147415],"study_design_scores_gemma":[0.004195848,0.001699743,0.0002564834,0.0007551204,0.0002494638,0.0003652405,0.006342308,0.001041536,0.2251187,0.6960431,0.06307817,0.0008543169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9726735,0.002776579,0.0005822701,0.00003948666,0.01190909,0.0001311303,0.000006878445,0.0000799534,0.01180105],"genre_scores_gemma":[0.9991889,0.0001303108,0.00003190631,0.000005006693,0.0003403971,0.00000247756,2.840233e-7,0.00002359917,0.0002771185],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.220735,"threshold_uncertainty_score":0.4240744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135107686","doi":"10.1109/tsmcb.2002.999810","title":"Assigning cells to switches in cellular mobile networks using taboo search","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Taboo; Computer science; Heuristic; Process (computing); Mathematical optimization; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02238897447906088,"gpt":0.2100556800581403,"spread":0.1876667055790794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000490967,0.0005165702,0.000598526,0.0004444525,0.0002009286,0.0002375405,0.0002815137,0.0003427516,0.000130144],"category_scores_gemma":[0.000001588376,0.0005656097,0.000136825,0.0006357885,0.00009798851,0.0001162322,0.000006301133,0.0006353511,0.0001864739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001398794,"about_ca_system_score_gemma":0.00001024247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000199421,"about_ca_topic_score_gemma":0.00009181193,"domain_scores_codex":[0.997155,0.0002068006,0.0007960537,0.0005805866,0.0004230689,0.0008384864],"domain_scores_gemma":[0.9987478,0.0001441886,0.00006790584,0.0005658295,0.00006297387,0.0004112632],"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.00001426836,0.0001208057,0.0001134423,0.0001698998,0.00007725102,0.00002903859,0.001672366,0.9776683,0.01762895,0.0001300749,0.0003363578,0.002039199],"study_design_scores_gemma":[0.0009372892,0.0002930021,0.00005721154,0.000772125,0.0001014028,0.00005413817,0.001730994,0.9397421,0.04552181,0.00002564502,0.009680216,0.001084061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8012432,0.002884667,0.1887326,0.000011278,0.002576852,0.001242011,0.0000371344,0.0003051575,0.002967079],"genre_scores_gemma":[0.9966283,0.0004822154,0.0001232475,0.00003318312,0.0002211918,0.0001786348,0.000002480594,0.0001358958,0.002194791],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1953852,"threshold_uncertainty_score":0.9996796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1568296425","doi":"10.37236/1533","title":"Large Equiangular Sets of Lines in Euclidean Space","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equiangular polygon; Mathematics; Combinatorics; Euclidean space; Upper and lower bounds; Constructive; Euclidean geometry; Integer (computer science); Euclidean distance; Space (punctuation); Order (exchange); Dimension (graph theory); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis; Regular polygon; Process (computing); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.00353167202720187,"gpt":0.200087413656909,"spread":0.1965557416297072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240919,0.0001146448,0.0002720809,0.0001104407,0.00003034359,0.00000972874,0.0003379878,0.00006128487,0.0000575319],"category_scores_gemma":[0.00002053593,0.00008456927,0.0001089087,0.0004178778,0.00002305513,0.00009395496,0.000009704084,0.0004915923,0.000007981342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009799472,"about_ca_system_score_gemma":0.00005672805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003149662,"about_ca_topic_score_gemma":0.000009171376,"domain_scores_codex":[0.9988015,0.0001110055,0.0004175706,0.00004879861,0.0002114634,0.0004096532],"domain_scores_gemma":[0.999531,0.0000798559,0.0001094455,0.0001845496,0.00005466705,0.00004049285],"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.0001109389,0.0002047843,0.001181053,0.0001057879,0.0002030746,0.0000361972,0.002242399,0.01126356,0.002657792,0.9798656,0.0006636636,0.001465124],"study_design_scores_gemma":[0.002612866,0.0006323789,0.001193815,0.0002347351,0.00008070702,0.0003298635,0.0007469524,0.003246437,0.01156613,0.9500837,0.0289519,0.0003205373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9870125,0.01007234,0.0004484102,0.0001025826,0.000277361,0.00006924574,0.000001157541,0.00001754897,0.001998854],"genre_scores_gemma":[0.9985778,0.001134212,0.000002099465,0.00001016965,0.00004866644,9.743108e-7,3.729301e-7,0.00002049055,0.0002051616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02978194,"threshold_uncertainty_score":0.3448635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094667324","doi":"10.1006/jctb.2001.2051","title":"A Characterization of Weakly Bipartite Graphs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":53,"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":"Bipartite graph; Combinatorics; Mathematics; Discrete mathematics; Conjecture; Minor (academic); Strong perfect graph theorem; Robertson–Seymour theorem; Edge-transitive graph; Graph; Voltage graph; Line graph; 1-planar graph; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.005445700705337558,"gpt":0.1884680764193055,"spread":0.183022375713968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007820774,0.0001289437,0.0003331343,0.0001896626,0.00004147511,0.0000246576,0.0001793686,0.00008411442,0.000106498],"category_scores_gemma":[0.0000484428,0.0001136581,0.0001579418,0.0003297054,0.00007409035,0.0004997302,0.00001231117,0.0001577359,0.000004645457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001830006,"about_ca_system_score_gemma":0.00001846577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.129576e-7,"about_ca_topic_score_gemma":2.350508e-7,"domain_scores_codex":[0.9988635,0.0001515287,0.0005720145,0.00005436218,0.0002084119,0.000150212],"domain_scores_gemma":[0.9992656,0.00006265347,0.000275978,0.0001512875,0.0001684265,0.00007611908],"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.0006763797,0.00005649973,0.0005667278,0.00005532904,0.0001360526,0.00002107428,0.0005800604,0.0001089775,0.3453283,0.6517143,0.00006421436,0.0006920178],"study_design_scores_gemma":[0.001403031,0.0006970584,0.002388743,0.0002335998,0.00008647796,0.0003531274,0.0004438041,0.00003796097,0.1624971,0.7887211,0.04284387,0.0002941214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9891112,0.0002108035,0.0006589277,0.00002080727,0.007146918,0.00007350973,0.000004735727,0.00004144472,0.00273158],"genre_scores_gemma":[0.9992424,0.0002419909,0.00001895364,0.000007659924,0.0003433843,0.000002123552,0.00000208267,0.00002209789,0.0001193064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1828313,"threshold_uncertainty_score":0.4634841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999323173","doi":"10.1016/j.disc.2004.04.005","title":"Spanning spiders and light-splitting switches","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Spanning tree; Mathematics; Combinatorics; Minimum degree spanning tree; Subdivision; Connected dominating set; Minimum spanning tree; Discrete mathematics; Bounded function; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.007775992139421603,"gpt":0.1969796497024935,"spread":0.1892036575630719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001963769,0.0001451729,0.0001842624,0.00005081607,0.00007459935,0.00005883465,0.00008351142,0.00005563679,0.000006201772],"category_scores_gemma":[0.00002988572,0.0001271008,0.00004765662,0.00009425006,0.00002653112,0.0001010696,0.00002278706,0.00009805757,0.00003032137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001766035,"about_ca_system_score_gemma":0.000003908553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002688457,"about_ca_topic_score_gemma":0.000001900938,"domain_scores_codex":[0.9993591,0.000005842599,0.0002255665,0.0001063538,0.00009806649,0.0002050742],"domain_scores_gemma":[0.9996749,0.00003502247,0.00003513687,0.0001784468,0.000009862239,0.00006663503],"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.000007864252,0.00006897494,0.001335462,0.004619419,0.0003695084,0.00005388641,0.06510406,0.01987921,0.0825178,0.8228419,0.0002870004,0.002914907],"study_design_scores_gemma":[0.001982768,0.0001230342,0.0008612055,0.002816183,0.0002104084,0.0002858195,0.03881797,0.02377078,0.09863103,0.8273877,0.003199041,0.001914059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9582048,0.0005993842,0.01856063,0.0000872775,0.0001521796,0.0001408331,0.000002216881,0.0003553157,0.02189734],"genre_scores_gemma":[0.9948428,0.0000135119,0.004975901,0.0000153389,0.00005345006,0.000009914393,0.000001454499,0.00003564217,0.00005193257],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03663803,"threshold_uncertainty_score":0.518302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024021998","doi":"10.1016/j.jctb.2005.03.005","title":"Covering arrays on graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"University of Alberta","keywords":"Combinatorics; Clique number; Mathematics; Clique; Homomorphism; Graph; Discrete mathematics; Row; Extension (predicate logic); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.005227173648065162,"gpt":0.1918191603417305,"spread":0.1865919866936653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000893791,0.0001779671,0.0003184603,0.0001678135,0.00008118482,0.00005233987,0.0002667447,0.00009312072,0.0001254929],"category_scores_gemma":[0.00006442182,0.0001544981,0.0001977734,0.0001712508,0.00005984277,0.0004710004,0.0000131876,0.000337965,0.00003073497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006166517,"about_ca_system_score_gemma":0.00001697745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.863747e-7,"about_ca_topic_score_gemma":2.77747e-7,"domain_scores_codex":[0.9988607,0.0001265698,0.0004593513,0.00007300874,0.0002656169,0.0002147951],"domain_scores_gemma":[0.9993256,0.0001467144,0.0001446098,0.00018783,0.00007995499,0.0001152922],"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.0005456658,0.00005141984,0.00003361748,0.00002696432,0.0001281365,0.00002113569,0.000491994,0.008096062,0.004504906,0.9828386,0.001275337,0.001986107],"study_design_scores_gemma":[0.00147402,0.0006544485,0.00007709469,0.0001535363,0.0000388557,0.0001962243,0.0004583385,0.00005607306,0.04298304,0.8117177,0.1418859,0.0003047214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9383671,0.0007337951,0.0009244647,0.00009440756,0.01768904,0.0001131661,0.000004618231,0.000152283,0.04192116],"genre_scores_gemma":[0.9983809,0.00008337586,0.00009773757,0.00003965773,0.001204416,0.000002150256,4.347652e-7,0.00003282258,0.00015851],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1711209,"threshold_uncertainty_score":0.6300251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119307154","doi":"10.1016/j.ejc.2012.10.008","title":"Resolving sets for Johnson and Kneser graphs","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Indifference graph; Discrete mathematics; Metric dimension; 1-planar graph; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01434686287249292,"gpt":0.2139818547159782,"spread":0.1996349918434853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446054,0.0001033173,0.0001614085,0.0001210752,0.00006302434,0.00003293132,0.000127844,0.00002012623,0.000004252225],"category_scores_gemma":[0.00005365587,0.00009077349,0.00007955422,0.0001243799,0.00001788786,0.0002382129,0.00001651191,0.0001590752,0.000005668463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001553066,"about_ca_system_score_gemma":0.000003426413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.379445e-8,"about_ca_topic_score_gemma":2.952265e-8,"domain_scores_codex":[0.9992047,0.00013945,0.0002924904,0.00004268847,0.000115032,0.0002056227],"domain_scores_gemma":[0.9994904,0.00008494712,0.00009912749,0.00009758443,0.0000745959,0.0001533613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000314436,0.0005063815,0.07604633,0.001686547,0.0009204532,0.0002833294,0.0111715,0.001171579,0.01367005,0.749503,0.1100321,0.03469434],"study_design_scores_gemma":[0.006356277,0.001310348,0.08641478,0.0007215185,0.0002842286,0.00148183,0.001210792,0.001401406,0.003868252,0.05898854,0.8366956,0.001266477],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9746955,0.009003851,0.00306886,0.00002552459,0.002927006,0.000085719,0.000002322406,0.00004805528,0.01014314],"genre_scores_gemma":[0.9993406,0.000179755,0.0002312822,0.00001340281,0.0001388631,5.745907e-7,4.018267e-7,0.0000400431,0.00005509684],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7266635,"threshold_uncertainty_score":0.3701636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043898581","doi":"10.1002/jcd.20219","title":"The Hamilton–Waterloo problem for cycle sizes 3 and 4","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Università di Catania; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Combinatorics; Hamiltonian path; Graph; Resolution (logic); Class (philosophy); Complete graph; Decomposition; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.00926922698022215,"gpt":0.2136291923050667,"spread":0.2043599653248446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007044816,0.00009755187,0.0001856341,0.00004189075,0.0001386425,0.0000949692,0.0001545273,0.00005816222,0.000001317348],"category_scores_gemma":[0.00002991253,0.00006324804,0.00008929809,0.00006494809,0.00002641219,0.0001385024,0.000003312724,0.0001241672,0.000001140808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001977763,"about_ca_system_score_gemma":0.00001306933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.571677e-7,"about_ca_topic_score_gemma":3.781988e-7,"domain_scores_codex":[0.9992803,0.00005302627,0.0003187204,0.00004821285,0.0001286123,0.000171121],"domain_scores_gemma":[0.9994418,0.0002209989,0.00009162221,0.00008598986,0.00008669226,0.00007287351],"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.001165125,0.0002194696,0.000192381,0.0002077447,0.0004937449,0.00003901371,0.0043365,0.003611058,0.1100602,0.8241971,0.02007381,0.03540386],"study_design_scores_gemma":[0.002576047,0.001324741,0.0004150596,0.00009702628,0.00006297335,0.000100011,0.0001847362,0.0009726163,0.01417144,0.9344632,0.04542323,0.0002089375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9772218,0.003779286,0.007102338,0.0003745697,0.008732831,0.0006055639,0.000004062653,0.00009437827,0.002085137],"genre_scores_gemma":[0.9990303,0.0001198171,0.0003004745,0.0000139045,0.000452489,0.000004229576,1.816581e-7,0.00001191653,0.00006669921],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.110266,"threshold_uncertainty_score":0.2579181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973378877","doi":"10.1109/tit.2012.2196021","title":"A Construction of Codebooks Associated With Binary Sequences","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Codebook; Combinatorics; Hamming space; Binary code; Binary number; Sequence (biology); Hadamard matrix; Hadamard transform; Matrix (chemical analysis); Hamming distance; Hamming code; Matrix norm; Discrete mathematics; Hamming weight; Algorithm; Block code; Eigenvalues and eigenvectors; Arithmetic; Mathematical analysis; Physics; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.006846413880487452,"gpt":0.1794938830672758,"spread":0.1726474691867884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003614581,0.000105486,0.0001196138,0.0001946162,0.00008556931,0.0000122975,0.00005887276,0.00008192514,0.0001036276],"category_scores_gemma":[0.00000336274,0.00008972211,0.00004935954,0.0001852534,0.0001346529,0.000968176,1.957426e-7,0.0001293276,0.00004366739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004074562,"about_ca_system_score_gemma":0.00001240646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002300221,"about_ca_topic_score_gemma":0.000001551296,"domain_scores_codex":[0.9993519,0.0000721159,0.0002580116,0.00003261824,0.0001364256,0.0001489162],"domain_scores_gemma":[0.9996142,0.00008919575,0.00007844741,0.000115344,0.00005041223,0.00005241108],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001028837,0.0003697127,0.0004912323,0.0007993967,0.001612093,0.000001480222,0.03824843,0.4329114,0.009177589,0.4021187,0.0002567381,0.1129844],"study_design_scores_gemma":[0.005754864,0.001445879,0.002914514,0.001664441,0.0006867041,0.000341618,0.03852637,0.03835984,0.8716018,0.03286814,0.003371957,0.002463832],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4579659,0.00003142072,0.5244848,0.00000460922,0.0008402179,0.0001969704,0.00006762957,0.0003247888,0.01608364],"genre_scores_gemma":[0.9997005,0.00000767394,0.0001589739,0.00002056847,0.00001052951,0.00003670255,0.00000732006,0.000008729204,0.00004903324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8624243,"threshold_uncertainty_score":0.3658761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049467095","doi":"10.1007/s10801-007-0104-1","title":"On Weyl-Heisenberg orbits of equiangular lines","year":2007,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":47,"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","keywords":"Mathematics; Dimension (graph theory); Prime (order theory); Heisenberg group; Modulo; Characterization (materials science); Fiducial marker; Combinatorics; Pure mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.00506895160961069,"gpt":0.2042556152827603,"spread":0.1991866636731496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001022279,0.0001612582,0.0003710138,0.0003303754,0.00003403125,0.00001381423,0.0002686692,0.000119531,0.00003293254],"category_scores_gemma":[0.0001258039,0.000140759,0.0002004397,0.0004773104,0.00003355934,0.0001160631,0.00001840684,0.0003200133,0.0000113954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006328595,"about_ca_system_score_gemma":0.00002479456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001220261,"about_ca_topic_score_gemma":0.000001075434,"domain_scores_codex":[0.9985334,0.00003487282,0.0007168343,0.00007331913,0.0004022511,0.0002393612],"domain_scores_gemma":[0.9989123,0.0002597971,0.0002640228,0.0002061898,0.0002138248,0.000143897],"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.0002224982,0.000504557,0.002203272,0.0005026648,0.0005093545,0.0004298687,0.001153959,0.003952964,0.02549235,0.9532638,0.007072189,0.004692575],"study_design_scores_gemma":[0.00552274,0.002887032,0.01211225,0.001341998,0.0002689463,0.000838453,0.001021333,0.001239884,0.2013088,0.747637,0.02468112,0.001140482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9895099,0.001658664,0.001660345,0.0000312013,0.003081913,0.00006384424,0.000001641453,0.00003895216,0.003953506],"genre_scores_gemma":[0.9995026,0.00006506073,0.00006111526,0.00002253164,0.0001744238,4.17884e-7,4.877586e-7,0.00003033606,0.000143011],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2056267,"threshold_uncertainty_score":0.5739987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038004087","doi":"10.1016/s0097-3165(03)00098-0","title":"Cycle decompositions IV: complete directed graphs and fixed length directed cycles","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Directed graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.006390053528123849,"gpt":0.2002197457387437,"spread":0.1938296922106199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008098922,0.0002497335,0.0005011627,0.0002158067,0.0002348083,0.00009564752,0.0001902465,0.0001185835,0.00009032003],"category_scores_gemma":[0.0001595064,0.0002274424,0.0001770021,0.000352215,0.0001578997,0.0004136024,0.00001913448,0.0003256777,0.000004156984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003787097,"about_ca_system_score_gemma":0.00002586159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002160511,"about_ca_topic_score_gemma":0.000002266162,"domain_scores_codex":[0.9982396,0.0005462199,0.0005815802,0.000126719,0.0002223751,0.0002835522],"domain_scores_gemma":[0.9988649,0.0003791835,0.0001934758,0.0002028649,0.0001699705,0.0001896172],"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.0003573181,0.00009743719,0.0003231505,0.00005633951,0.0003670179,0.00003821299,0.0006769419,0.0002899523,0.01412737,0.9826253,0.0007418048,0.0002991563],"study_design_scores_gemma":[0.002210951,0.0003265401,0.00169377,0.0001362378,0.0001280982,0.0005549737,0.0006027382,0.0001474685,0.007118147,0.9670801,0.01958628,0.000414717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9847071,0.001794531,0.0002188841,0.00003533434,0.005797379,0.0001642263,0.00002339353,0.0003748664,0.006884336],"genre_scores_gemma":[0.9990946,0.0002168557,0.00044949,0.00001757812,0.0001274335,0.000006838744,0.000003284493,0.00004255666,0.00004137074],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01884447,"threshold_uncertainty_score":0.9274833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132589312","doi":"10.1016/j.jcta.2010.10.003","title":"Divisible design graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Adjacency matrix; Combinatorics; Mathematics; Indifference graph; Discrete mathematics; Chordal graph; Adjacency list; Strongly regular graph; Incidence matrix; Generalization; Cograph; Pathwidth; Line graph; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.006352779784245656,"gpt":0.1935049568511631,"spread":0.1871521770669175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001814632,0.000164329,0.0003132731,0.0001631622,0.00008968486,0.00007229172,0.0003502047,0.0001287142,0.0002476787],"category_scores_gemma":[0.0001383331,0.0001368614,0.000181109,0.0002269303,0.0001001317,0.0004615372,0.00001881528,0.0005340885,0.00001543632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001288443,"about_ca_system_score_gemma":0.00003165399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.831957e-7,"about_ca_topic_score_gemma":3.804944e-7,"domain_scores_codex":[0.9988689,0.0001774735,0.0004371623,0.00006842594,0.0002307008,0.0002173809],"domain_scores_gemma":[0.9991184,0.000245207,0.0001459766,0.0002178643,0.0001362084,0.0001363214],"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.0003338733,0.00003828392,0.00007193255,0.00002434613,0.0001156873,0.00003046424,0.0003394063,0.0003353069,0.03529382,0.9610706,0.001505856,0.0008404044],"study_design_scores_gemma":[0.0007222516,0.0003085652,0.00008101892,0.00003133663,0.00003224231,0.0002385507,0.0001977994,0.00002560598,0.03061543,0.9443271,0.02324924,0.0001709179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9320276,0.0005298496,0.006973273,0.00004623861,0.04770232,0.0001924492,0.000003676891,0.0001529502,0.01237164],"genre_scores_gemma":[0.9986471,0.00003959327,0.0004832226,0.00001127129,0.0006445622,0.0000035224,2.973004e-7,0.00003145814,0.0001390039],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06661947,"threshold_uncertainty_score":0.5581045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111082420","doi":"10.1109/lpt.2002.805760","title":"A new family of 2-D wavelength-time codes for optical CDMA with differential detection","year":2003,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Antipodal point; Code division multiple access; Computer science; Bit error rate; Coding gain; Coding (social sciences); Electronic engineering; Algorithm; Telecommunications; Mathematics; Decoding methods; Engineering; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.004285446923828448,"gpt":0.1767569174152327,"spread":0.1724714704914043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009936767,0.0001937735,0.0003042122,0.0002459238,0.00005013971,0.0000105529,0.0001756461,0.0002468882,0.00000833978],"category_scores_gemma":[0.00001683289,0.000179605,0.00008183647,0.0002788838,0.0001245672,0.00004557135,0.00000664953,0.0002237258,0.000009355156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004052876,"about_ca_system_score_gemma":0.0000160528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003171096,"about_ca_topic_score_gemma":0.000006781295,"domain_scores_codex":[0.9991043,0.00001465061,0.0002557545,0.0002071882,0.00009974823,0.000318416],"domain_scores_gemma":[0.9995159,0.00005740028,0.00005332294,0.0002979658,0.00002772436,0.00004768424],"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.00004740871,0.00001704699,0.00003279802,0.00004956938,0.000129115,0.000003824742,0.00003848414,0.0006923825,0.9928749,0.004039119,0.0001956292,0.001879787],"study_design_scores_gemma":[0.0008880621,0.000172831,0.00003191335,0.00003175929,0.0000605219,0.0000502888,0.00005096681,0.006831299,0.9892057,0.001259942,0.001188907,0.0002277914],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8381011,0.00005270987,0.1605504,0.0000620108,0.0003677351,0.0003113476,0.000007996801,0.0003857379,0.0001609409],"genre_scores_gemma":[0.9945747,0.000007826584,0.005207836,0.00004066215,0.00001865143,0.00008247702,0.000001733507,0.00004391045,0.00002215278],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1564737,"threshold_uncertainty_score":0.732408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130929828","doi":"10.1109/jlt.2005.844201","title":"Analysis of the spectral efficiency of frequency-encoded OCDMA systems with incoherent sources","year":2005,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Spectral efficiency; Code division multiple access; Electronic engineering; Computer science; Quadratic equation; Bit error rate; Gaussian; Mathematics; Algorithm; Decoding methods; Telecommunications; Physics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.003601745719525955,"gpt":0.1778302328698998,"spread":0.1742284871503738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004001487,0.0001521538,0.0006548766,0.001034775,0.0000382766,0.00000859047,0.0005704543,0.0001696427,0.00002379749],"category_scores_gemma":[0.00002618315,0.00008786395,0.0002515925,0.001853685,0.0002071325,0.00007563532,0.00002567927,0.0003312328,0.000001417271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006159962,"about_ca_system_score_gemma":0.00003381408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001136984,"about_ca_topic_score_gemma":0.00005474015,"domain_scores_codex":[0.9985152,0.00006321901,0.0008289259,0.0000940082,0.0002959265,0.0002026445],"domain_scores_gemma":[0.9987654,0.00005361244,0.0006132501,0.0003669761,0.0001625679,0.00003816044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001195019,0.000487876,0.2297429,0.0004302465,0.008352077,0.00005586228,0.002891717,0.3623317,0.3314619,0.06261756,0.0001977012,0.001310891],"study_design_scores_gemma":[0.002501641,0.002157882,0.02228912,0.001305734,0.004555718,0.001300354,0.006051252,0.03046615,0.9225062,0.00405564,0.001961754,0.0008485683],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9940615,0.002137523,0.002008282,0.0001305618,0.0002353376,0.0001148565,0.000006260662,0.00004887184,0.0012568],"genre_scores_gemma":[0.9995443,0.00003046457,0.0003191164,0.000002921027,0.00005863621,0.000002788999,2.329828e-7,0.00001358326,0.000027985],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5910443,"threshold_uncertainty_score":0.3582988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146551015","doi":"10.1016/j.disc.2009.03.047","title":"Hamiltonian decompositions of complete<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-uniform hypergraphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Hamiltonian (control theory); Scroll; Discrete mathematics; Combinatorics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01353898309012999,"gpt":0.2282907591119615,"spread":0.2147517760218315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004105098,0.0004069465,0.0003920617,0.0001673061,0.0003370111,0.0001532331,0.0005514871,0.0003278189,0.00004337176],"category_scores_gemma":[0.00006586158,0.0004506246,0.0005388175,0.0003573829,0.000193888,0.0002953806,0.0001152791,0.0003631363,0.0003442142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001601989,"about_ca_system_score_gemma":0.0000482451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002759715,"about_ca_topic_score_gemma":0.00004369454,"domain_scores_codex":[0.9976532,0.00004371918,0.0008651372,0.0003312215,0.0005166531,0.0005900222],"domain_scores_gemma":[0.998239,0.0002295225,0.0003242547,0.0009349659,0.00005391731,0.0002183815],"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.00003483548,0.0001254383,0.000008176461,0.0006584991,0.0002478786,0.00004244113,0.001696244,0.003012829,0.007027314,0.9866967,0.0002514289,0.0001981896],"study_design_scores_gemma":[0.0005487252,0.0002711925,0.0001212187,0.0006792124,0.0002522689,0.0002082575,0.001032996,0.9772614,0.006832686,0.01134804,0.0009449706,0.0004990143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9825945,0.0002569958,0.0055592,0.00007542148,0.0004046056,0.0001126032,0.0002526079,0.000284457,0.01045964],"genre_scores_gemma":[0.9916821,0.0001011951,0.007495997,0.0001210052,0.0001598203,0.00007842663,0.0001911847,0.0001223549,0.00004796666],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9753487,"threshold_uncertainty_score":0.9997945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765403799","doi":"10.1007/pl00011389","title":"The packing property","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":43,"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":"Combinatorics; Mathematics; Clutter; Matrix (chemical analysis); Disjoint sets; Incidence matrix; Vertex (graph theory); Set (abstract data type); Matching (statistics); Algorithm; Graph; Computer science; Radar","retraction":null,"screen_n_in":null,"score":{"opus":0.008940437827761731,"gpt":0.1975003397861044,"spread":0.1885599019583426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003858139,0.0001108757,0.0001161221,0.00001233828,0.0002146548,0.0001471353,0.0001699276,0.00004378407,0.0002744788],"category_scores_gemma":[0.00002680159,0.00005331078,0.00006633321,0.0001239217,0.00007013761,0.00006381506,0.000009707261,0.0001314149,0.0006276844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001318395,"about_ca_system_score_gemma":0.000002520366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.428077e-7,"about_ca_topic_score_gemma":0.000001126668,"domain_scores_codex":[0.9992099,0.00003099045,0.0002151204,0.00009067671,0.000137056,0.0003162781],"domain_scores_gemma":[0.9995801,0.0001081737,0.00001025338,0.0002292713,0.000009909799,0.00006231802],"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.000004260548,0.00002355968,0.00001785398,0.0001422648,0.00003157627,0.000005580894,0.0005427032,0.0001430346,0.0001209219,0.03166063,0.0003329089,0.9669747],"study_design_scores_gemma":[0.0002549451,0.00005087258,0.00003161365,0.0002344323,0.00002986044,0.00008778555,0.0006346258,0.04483553,0.0008949037,0.08978018,0.8627369,0.0004283765],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4267485,0.002162031,0.02241668,0.00053878,0.0006264073,0.002088277,0.000002128321,0.004182384,0.5412347],"genre_scores_gemma":[0.996053,0.00001340982,0.001240746,0.00001272395,0.00007546553,0.0001011762,5.947044e-7,0.00002998557,0.002472938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9665464,"threshold_uncertainty_score":0.8067822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069955765","doi":"10.1006/jcta.2001.3246","title":"Group-Divisible Designs with Block Size Four and Group-Type gum1 with m as Large or as Small as Possible","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Suzhou University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Group (periodic table); Type (biology); Mathematics; Block (permutation group theory); Combinatorics; Block size; Spectrum (functional analysis); Physics; Computer science; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01417728954953936,"gpt":0.1983650972140626,"spread":0.1841878076645232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001119403,0.0004031032,0.0006369794,0.0001425973,0.0003584244,0.0003281122,0.0004347534,0.0001837439,0.0005151785],"category_scores_gemma":[0.0002396454,0.0002725831,0.0001058436,0.0003813577,0.0001704779,0.0007571179,0.00006218356,0.0005014825,0.00003243477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005240571,"about_ca_system_score_gemma":0.00004898007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001141695,"about_ca_topic_score_gemma":0.00001709201,"domain_scores_codex":[0.9980408,0.0002658682,0.0005456082,0.000216502,0.0004317125,0.0004995076],"domain_scores_gemma":[0.9983181,0.0004029001,0.0003534856,0.0003900147,0.0002213066,0.0003141561],"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.01542119,0.0004907082,0.001696546,0.0003611231,0.001191212,0.001773973,0.002611459,0.0002863577,0.00444897,0.970531,0.000823279,0.000364208],"study_design_scores_gemma":[0.02372588,0.03915985,0.001574284,0.002024259,0.0007644054,0.01784804,0.006498299,0.0001869068,0.01468658,0.8659281,0.02535546,0.002247917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9879359,0.0007542522,0.0001958795,0.00007734774,0.002486508,0.0003000413,0.00000437071,0.0001123356,0.008133381],"genre_scores_gemma":[0.9972426,0.0002485253,0.0003767067,0.00007470739,0.0005311825,0.000009160654,6.293571e-7,0.00009371107,0.001422821],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1046028,"threshold_uncertainty_score":0.9999726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154661743","doi":"10.1109/jlt.2007.893917","title":"Spectral-Amplitude-Coded OCDMA Optimized for a Realistic FBG Frequency Response","year":2007,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Bit error rate; Fiber Bragg grating; Code division multiple access; Encoder; Amplitude; Computer science; Transmission (telecommunications); Electronic engineering; Optics; Optical fiber; Physics; Algorithm; Telecommunications; Decoding methods; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01067272240430178,"gpt":0.2460834639006537,"spread":0.2354107414963519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026824,0.0002168573,0.000539796,0.001031852,0.00007269769,0.00002310367,0.0004324212,0.0003747759,0.00004041974],"category_scores_gemma":[0.0005840929,0.0001875729,0.0002338901,0.0005036156,0.0001052276,0.0001082798,0.00001908431,0.0004441289,0.00001235627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001884173,"about_ca_system_score_gemma":0.00005610076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002343454,"about_ca_topic_score_gemma":0.00000926253,"domain_scores_codex":[0.9981919,0.00005685839,0.0009210411,0.0001463412,0.0002098718,0.000473967],"domain_scores_gemma":[0.9985437,0.0004510943,0.0002834922,0.0003411762,0.0002653066,0.0001151963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004287289,0.000167507,0.0007931238,0.0001873229,0.0006545617,0.0007913286,0.0006225275,0.001334121,0.8287765,0.1567696,0.003243641,0.002372438],"study_design_scores_gemma":[0.01076081,0.003603315,0.004541669,0.0006390851,0.0004403348,0.008242116,0.001509136,0.001390891,0.4484998,0.4844084,0.03450578,0.001458624],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7988768,0.001000213,0.1949935,0.0006667738,0.00109736,0.0003303299,0.00001456609,0.000387754,0.002632635],"genre_scores_gemma":[0.9720328,0.00003981445,0.02752123,0.00002494982,0.0002014745,0.00001069522,0.00000107665,0.00004518324,0.0001227988],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3802767,"threshold_uncertainty_score":0.7649001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024144406","doi":"10.1007/s10623-007-9163-5","title":"Williamson matrices up to order 59","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Class (philosophy); Order (exchange); Mathematics; Combinatorics; Pure mathematics; Computer science; Artificial intelligence; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01850153224551272,"gpt":0.2070204207014444,"spread":0.1885188884559317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001257111,0.0001876194,0.0002045512,0.0002584234,0.00017358,0.00004196079,0.0001209906,0.00007864121,0.00005510509],"category_scores_gemma":[0.00000477679,0.0001704139,0.00008211546,0.0007919489,0.00005962786,0.0001033095,0.00001451806,0.00008843743,0.00003859337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004638255,"about_ca_system_score_gemma":0.000004486686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001529611,"about_ca_topic_score_gemma":0.000007688201,"domain_scores_codex":[0.9991879,0.00003738331,0.0001767856,0.0001912275,0.0001282902,0.0002784503],"domain_scores_gemma":[0.9995556,0.00004316168,0.00001837768,0.0001870428,0.00003806787,0.0001577876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006538176,0.0004478663,0.1748686,0.002186028,0.002344048,0.0004838446,0.03946728,0.01991264,0.1814966,0.3348588,0.1786501,0.06463046],"study_design_scores_gemma":[0.00581209,0.002042253,0.1071921,0.0009028823,0.0004484999,0.001122863,0.00755917,0.01131243,0.03907305,0.04950331,0.7678251,0.007206243],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9231137,0.002683175,0.06893977,0.00002289504,0.0003993158,0.0002394516,0.00001611291,0.0003995588,0.004186012],"genre_scores_gemma":[0.996064,0.0008262701,0.002792965,0.00008924081,0.00007126054,0.00004395957,0.000004481099,0.00003037052,0.00007744523],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5891751,"threshold_uncertainty_score":0.6949276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2513299842","doi":"10.1088/1751-8113/49/8/085301","title":"Quantum conical designs","year":2016,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Combinatorics; Simplex; Mathematics; Rank (graph theory); Conical surface; Quantum entanglement; Discrete mathematics; Quantum; Geometry; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0134626798123978,"gpt":0.2154243639745183,"spread":0.2019616841621205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004577428,0.0001195443,0.0003149071,0.00002609814,0.00002566421,0.00002482505,0.0001193515,0.00006499762,0.0001789172],"category_scores_gemma":[0.0001036791,0.0000612987,0.000125902,0.00005643236,0.0004249991,0.0001015411,0.00002021457,0.000138875,0.00004464465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001142338,"about_ca_system_score_gemma":0.000009959824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.497228e-8,"about_ca_topic_score_gemma":6.715657e-9,"domain_scores_codex":[0.9991252,0.00006194644,0.0003795319,0.00006575516,0.0001859948,0.0001815152],"domain_scores_gemma":[0.9990215,0.0005904812,0.0000514599,0.0001084774,0.00005052488,0.0001775288],"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.00002429192,0.00005443862,0.00001383227,0.0000575827,0.00005300577,0.00001557882,0.00008755241,0.000003082476,0.007221973,0.989426,0.0001002263,0.002942486],"study_design_scores_gemma":[0.0003979834,0.0001317617,0.00001660473,0.000202841,0.00003732596,0.000209473,0.00003674317,0.001926062,0.005191864,0.9916164,0.0001305872,0.0001023763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7340589,0.0001352485,0.2628871,0.0002886779,0.0001676822,0.00006061469,0.000003525897,0.00003763952,0.002360635],"genre_scores_gemma":[0.9991531,0.00003447391,0.0005601223,0.00001858755,0.0002019219,0.000001691175,5.568699e-8,0.00001739482,0.00001267581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2650942,"threshold_uncertainty_score":0.2499688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}