{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Mahmoud Taherzadeh","is_ca":true},{"name":"Hosein Nikopour","is_ca":true},{"name":"Alireza Bayesteh","is_ca":true},{"name":"Hadi Baligh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003892313,0.0005615025,0.0005228163,0.0008155222,0.0005950627,0.0008708805,0.001320703,0.0006672131,0.003447934],"category_scores_gemma":[0.002041414,0.0002469106,0.0003622088,0.001084613,0.0004396258,0.0006945149,0.0007468922,0.00066698,0.001781068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007750774,"about_ca_system_score_gemma":0.001675741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002490682,"about_ca_topic_score_gemma":0.003324173,"domain_scores_codex":[0.9992365,0.000176694,0.00005460897,0.0001192029,0.0003478609,0.0000652107],"domain_scores_gemma":[0.9990608,0.0001586707,0.00005713371,0.0001182951,0.0005433285,0.00006174971],"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.0003165066,0.000118769,0.001487663,0.000585859,0.0001031921,0.0004258944,0.0003055772,0.2015024,0.08559655,0.1768,0.01788189,0.5148758],"study_design_scores_gemma":[0.00008979213,0.0002790134,0.0003587074,0.00007111894,0.00003811037,0.000759985,0.00008318326,0.8831049,0.03262779,0.03380265,0.04872234,0.0000623204],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006120267,0.0007370927,0.9853892,0.0001109364,0.0001270575,0.0002174935,0.0001757926,0.0003010919,0.006821035],"genre_scores_gemma":[0.300731,0.001214154,0.6838967,0.0002537217,0.0001117094,0.0006362548,0.000916238,0.000104791,0.01213561],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003447934,"threshold_uncertainty_score":0.01153445,"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","authors":[{"name":"Douglas R. Stinson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002892221,0.001735783,0.000962826,0.002443889,0.001083604,0.003173921,0.001079798,0.001022917,0.02567963],"category_scores_gemma":[0.001064823,0.001090718,0.0005643016,0.004299972,0.001808574,0.002514246,0.0006701503,0.002198574,0.009701259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001829023,"about_ca_system_score_gemma":0.0009181224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001122752,"about_ca_topic_score_gemma":0.002008288,"domain_scores_codex":[0.9996179,0.00006775244,0.00001440021,0.00006887736,0.0002061755,0.00002482803],"domain_scores_gemma":[0.9996122,0.0001662339,0.00002277531,0.00008251381,0.00009714338,0.00001925552],"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.000009940507,0.00002689312,0.00004891564,0.0001841569,0.000008808935,0.00003887622,0.0001064287,0.003100588,0.00103352,0.8161761,0.05762896,0.1216368],"study_design_scores_gemma":[0.00001063388,0.00002042253,0.0001010867,0.00009655024,0.00001676598,0.0002822304,0.00005841655,0.005747716,0.001340304,0.6598324,0.3324717,0.00002165206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.004933774,0.01863451,0.34925,0.001693796,0.001582445,0.000162489,0.0005922129,0.0009840135,0.6221667],"genre_scores_gemma":[0.09179751,0.02682565,0.226335,0.001347132,0.00155705,0.0006029146,0.001153073,0.00100741,0.6493743],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02567963,"threshold_uncertainty_score":0.08590686,"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","authors":[{"name":"A. Stok","is_ca":true},{"name":"Edward H. Sargent","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036096,0.0002951501,0.0002461744,0.0005345935,0.001208843,0.002229638,0.0004998072,0.001198346,0.001550775],"category_scores_gemma":[0.002081017,0.000198374,0.0001693134,0.0006631712,0.00313559,0.003451253,0.0006306178,0.001062145,0.000324832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001059536,"about_ca_system_score_gemma":0.0005122503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001168983,"about_ca_topic_score_gemma":0.0009996265,"domain_scores_codex":[0.9995196,0.0002114107,0.00001552754,0.00007342522,0.0001226211,0.00005752322],"domain_scores_gemma":[0.9989622,0.0006817909,0.00008870466,0.00009418342,0.0001130147,0.0000601265],"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.00000958022,0.00001058415,0.0002234931,0.00003990381,0.000003011883,0.00005623186,0.0001040183,0.003459577,0.001194728,0.9744354,0.00104933,0.01941413],"study_design_scores_gemma":[0.000006374688,0.00006494714,0.0003826862,0.00007413836,0.00000699361,0.0002305076,0.0001560718,0.01819972,0.001263466,0.9199556,0.05963901,0.00002045805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09123225,0.09989786,0.4509097,0.03618206,0.005046224,0.0001307057,0.00008846568,0.0002033816,0.3163093],"genre_scores_gemma":[0.7894358,0.06508733,0.1091271,0.002727402,0.004247722,0.0001212497,0.00002969582,0.00004630155,0.02917739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002229638,"threshold_uncertainty_score":0.007687509,"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","authors":[{"name":"Brian Alspach","is_ca":true},{"name":"Heather Gavlas","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002198427,0.0005054082,0.0003424797,0.002266746,0.001663146,0.002877288,0.0007662278,0.0007537564,0.01683303],"category_scores_gemma":[0.0009742396,0.0004817537,0.0005427894,0.001451658,0.001108438,0.001613762,0.000863926,0.001173557,0.002285474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074087,"about_ca_system_score_gemma":0.0006347709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002482454,"about_ca_topic_score_gemma":0.002773815,"domain_scores_codex":[0.9996942,0.00003179487,0.00001667072,0.00006908584,0.00006495437,0.0001233236],"domain_scores_gemma":[0.9993285,0.000144467,0.0001207735,0.00007968859,0.0001690037,0.0001575089],"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.0001339008,0.00005933115,0.0006902842,0.00008734241,0.00001089575,0.0001560216,0.0006639924,0.001441282,0.005663114,0.9690892,0.005699303,0.01630537],"study_design_scores_gemma":[0.0000379285,0.00003674887,0.002057524,0.00007639221,0.00002600411,0.0002723634,0.0006244603,0.01114195,0.004266926,0.9614778,0.01995165,0.00003030489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6762258,0.00118231,0.0799453,0.00160598,0.0003839166,0.0003529534,0.002619439,0.0004757213,0.2372085],"genre_scores_gemma":[0.8878435,0.000687682,0.03198518,0.0004065844,0.0001176661,0.000252614,0.002552855,0.0003541457,0.07579964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01683303,"threshold_uncertainty_score":0.05631214,"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","authors":[{"name":"Mateja Šajna","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006471657,0.0006683714,0.0006295303,0.001816448,0.0009229124,0.002171819,0.0006086943,0.0008472439,0.007126549],"category_scores_gemma":[0.00306374,0.0006177754,0.0009120856,0.001228822,0.001618009,0.00219461,0.001213854,0.00133981,0.0007654914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009048834,"about_ca_system_score_gemma":0.001038231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001638305,"about_ca_topic_score_gemma":0.002276832,"domain_scores_codex":[0.9990953,0.0001285926,0.00005254889,0.0002133253,0.0002497777,0.0002604612],"domain_scores_gemma":[0.9979247,0.0006538413,0.0003566059,0.0002802891,0.0004861036,0.0002984781],"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.0003594854,0.00009176625,0.002039591,0.0003255547,0.00005508105,0.0006163046,0.0005007309,0.01930824,0.0216021,0.9117623,0.006830346,0.03650852],"study_design_scores_gemma":[0.0001223274,0.0001177756,0.001526465,0.0002260343,0.00005215635,0.0007826337,0.0005218831,0.04479635,0.01370962,0.9149693,0.02312278,0.00005262836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4773253,0.002832816,0.4219384,0.001049029,0.0002688102,0.0005093674,0.002342536,0.0004908129,0.09324285],"genre_scores_gemma":[0.8981766,0.001573838,0.08224562,0.000435409,0.000151134,0.0003949416,0.003073193,0.0001633709,0.01378589],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007126549,"threshold_uncertainty_score":0.02384067,"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","authors":[{"name":"Wensong Chu","is_ca":false},{"name":"Charles J. Colbourn","is_ca":false},{"name":"Peter J. Dukes","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009775474,0.0007308968,0.0004841951,0.0009525896,0.001624923,0.001875499,0.0008519812,0.001414843,0.006039259],"category_scores_gemma":[0.003544965,0.0006174869,0.000796372,0.001421398,0.00208502,0.002630951,0.002093993,0.002509486,0.001944982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001369816,"about_ca_system_score_gemma":0.00106346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006319977,"about_ca_topic_score_gemma":0.0008723227,"domain_scores_codex":[0.9990844,0.0003711722,0.00003926985,0.0001018708,0.0002561419,0.000147128],"domain_scores_gemma":[0.9982332,0.0008444423,0.0001673654,0.0004703211,0.0001781548,0.0001065298],"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.00004752424,0.00001935065,0.0001090252,0.00003406051,0.000005384423,0.00006824902,0.0001571194,0.006027176,0.001913101,0.9736242,0.002227533,0.01576721],"study_design_scores_gemma":[0.00003197886,0.00005198067,0.00008122383,0.0000397309,0.00001298485,0.000179336,0.0000585673,0.02779824,0.006108489,0.9463907,0.01922172,0.00002494802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06070957,0.0004617169,0.8833715,0.001721754,0.0002008192,0.0001961853,0.0002306836,0.00056646,0.05254118],"genre_scores_gemma":[0.5961949,0.001270254,0.3535443,0.0008533982,0.0002832916,0.0005265033,0.0005815328,0.0004167625,0.04632908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006039259,"threshold_uncertainty_score":0.02020335,"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","authors":[{"name":"Edward H. Sargent","is_ca":true},{"name":"A. Stok","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005176994,0.0003611379,0.0003139084,0.0004877548,0.0007088124,0.001480929,0.0009664785,0.001088284,0.003887023],"category_scores_gemma":[0.001685849,0.0001406066,0.0001817554,0.001072823,0.0008791827,0.001576051,0.0009837769,0.000896554,0.0007499955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001232704,"about_ca_system_score_gemma":0.0009686683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002028261,"about_ca_topic_score_gemma":0.002665312,"domain_scores_codex":[0.9994735,0.0001547281,0.00001020279,0.0000837222,0.0001998656,0.00007801125],"domain_scores_gemma":[0.9992792,0.0002509093,0.00009518061,0.0001090802,0.0002036147,0.0000620076],"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.0001127653,0.00009485953,0.0006028296,0.000211458,0.00003354028,0.0001807466,0.0001077075,0.04580269,0.01389917,0.6952872,0.01688404,0.226783],"study_design_scores_gemma":[0.00003161042,0.00008499707,0.000952174,0.00005051157,0.00003489181,0.0003960568,0.00007612718,0.6038455,0.008836498,0.3117487,0.07390506,0.000037952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03083813,0.004671944,0.9115829,0.002832709,0.0006222777,0.00009281528,0.0001215412,0.0007080873,0.04852957],"genre_scores_gemma":[0.8333284,0.004278122,0.1339415,0.0006689585,0.000604524,0.0001432384,0.0001580425,0.0000729919,0.02680428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003887023,"threshold_uncertainty_score":0.01300341,"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","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Aidan Roy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009818878,0.0003486264,0.0005834277,0.001411167,0.001522558,0.002255472,0.0007747765,0.001490203,0.007410236],"category_scores_gemma":[0.003059755,0.0002821653,0.0003651825,0.0009663578,0.0022411,0.002907443,0.001337043,0.001591303,0.0008505766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005939006,"about_ca_system_score_gemma":0.0004670041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000824065,"about_ca_topic_score_gemma":0.001120244,"domain_scores_codex":[0.9993845,0.0002143252,0.00002378046,0.00008028349,0.0001545623,0.0001424587],"domain_scores_gemma":[0.9985597,0.0005311904,0.0002503805,0.0002547123,0.0002306026,0.0001735419],"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.00002000621,0.00001443278,0.0001111658,0.000007148738,0.000003063815,0.00002833173,0.00005497867,0.001000467,0.0002392786,0.9955296,0.0005930959,0.002398446],"study_design_scores_gemma":[0.000008675373,0.000007491617,0.00005641032,0.000006369633,0.000002681693,0.00004007957,0.00005198715,0.005500792,0.0001469789,0.9933669,0.0008057255,0.000005915515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6103439,0.001366849,0.2205088,0.00347849,0.0002724779,0.00007066607,0.0003378781,0.0002968747,0.163324],"genre_scores_gemma":[0.9710758,0.000451619,0.012039,0.0005578745,0.000186466,0.00006466346,0.000156557,0.0000525968,0.01541552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007410236,"threshold_uncertainty_score":0.02478969,"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","authors":[{"name":"Brendan D. McKay","is_ca":false},{"name":"Alison Meynert","is_ca":true},{"name":"Wendy Myrvold","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005539102,0.0003860879,0.0003221437,0.001901796,0.0009568457,0.00191658,0.00037172,0.000465182,0.01041734],"category_scores_gemma":[0.002342865,0.0001997091,0.0003965797,0.0007691372,0.00307317,0.002511854,0.00111495,0.0006234682,0.0007719785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006699382,"about_ca_system_score_gemma":0.0003609001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003693383,"about_ca_topic_score_gemma":0.0004745328,"domain_scores_codex":[0.9992647,0.0001457781,0.0000434502,0.0001644786,0.0002102065,0.0001713805],"domain_scores_gemma":[0.997032,0.001525779,0.0005349634,0.0004014817,0.0002114093,0.0002942481],"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.0006860673,0.0001325032,0.01373479,0.0002486933,0.00002863063,0.0005983318,0.0008482035,0.003671046,0.02375107,0.852577,0.002864875,0.1008589],"study_design_scores_gemma":[0.00007942194,0.0004119081,0.009295457,0.0001065379,0.00004914172,0.002094397,0.0007950048,0.009524113,0.02740618,0.9082442,0.0419327,0.00006105395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.907395,0.001429279,0.02960781,0.0005050432,0.0001655044,0.00005547872,0.00023739,0.0002529132,0.06035165],"genre_scores_gemma":[0.985709,0.0004230704,0.007353215,0.00007368809,0.0000989242,0.00003063153,0.0001672151,0.00002350875,0.006120805],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01041734,"threshold_uncertainty_score":0.03484946,"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","authors":[{"name":"Philip A. Eisen","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332863,0.0007825706,0.0005045698,0.0007533887,0.0005305965,0.001974181,0.0008613175,0.001059662,0.002920173],"category_scores_gemma":[0.004600488,0.000363048,0.0004226479,0.0009620746,0.0009712345,0.002192914,0.001394373,0.0009246556,0.0007586419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009824515,"about_ca_system_score_gemma":0.0006575515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001754138,"about_ca_topic_score_gemma":0.0002924334,"domain_scores_codex":[0.9989727,0.0002499231,0.00008942305,0.0001546495,0.0003596615,0.0001736549],"domain_scores_gemma":[0.9966124,0.0009845641,0.0004835952,0.00123909,0.0005521198,0.0001283026],"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.002213056,0.0001834065,0.001410696,0.0003207957,0.00009023493,0.0002591247,0.000431616,0.07602701,0.3552014,0.4618721,0.00161777,0.1003728],"study_design_scores_gemma":[0.0001700962,0.0004142938,0.0005868639,0.000143374,0.00007214881,0.0004388976,0.00009575462,0.361908,0.5283365,0.1033645,0.004384748,0.00008466384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.196672,0.0004004338,0.7896241,0.0003330708,0.00008848869,0.0001319367,0.0001681127,0.0008557545,0.01172611],"genre_scores_gemma":[0.8619091,0.0003330171,0.1313792,0.0001371685,0.0000407992,0.0001065912,0.0001508062,0.0001350334,0.00580822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002920173,"threshold_uncertainty_score":0.009768963,"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","authors":[{"name":"Geňa Hahn","is_ca":true},{"name":"Jan Kratochvı́l","is_ca":false},{"name":"Jozef Širáň","is_ca":false},{"name":"Dominique Sotteau","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001615508,0.001037762,0.0009463703,0.004468062,0.002239933,0.004508386,0.002070809,0.001352375,0.01074217],"category_scores_gemma":[0.01050066,0.0007741141,0.0005913022,0.003729011,0.006313661,0.007873175,0.002656892,0.00341242,0.0007430129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003461819,"about_ca_system_score_gemma":0.001001271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003879531,"about_ca_topic_score_gemma":0.003351499,"domain_scores_codex":[0.9990687,0.0002999194,0.00002788541,0.0002101012,0.0001869705,0.0002065265],"domain_scores_gemma":[0.987649,0.009165664,0.000933482,0.0007370175,0.0006296223,0.0008850702],"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.0001245556,0.00002788641,0.001003164,0.00006305792,0.00001153803,0.00003669709,0.0002737701,0.008179095,0.0008832511,0.979184,0.002644216,0.007568755],"study_design_scores_gemma":[0.00002383457,0.0000194643,0.000855365,0.00003454132,0.00001719046,0.00005911203,0.0001248904,0.02003791,0.0005326271,0.9756557,0.002616123,0.00002323282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6564007,0.003009041,0.1278535,0.005809218,0.0005323189,0.00008003603,0.0009356629,0.000400922,0.2049786],"genre_scores_gemma":[0.9672075,0.001907439,0.01240712,0.0004946722,0.0006038059,0.0001080877,0.000520804,0.0002035019,0.01654709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01074217,"threshold_uncertainty_score":0.03593618,"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","authors":[{"name":"M. Chateauneuf","is_ca":true},{"name":"Donald L. Kreher","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001755859,0.0004607148,0.0005958618,0.00119715,0.001248323,0.004165886,0.0009402757,0.001294431,0.00630576],"category_scores_gemma":[0.01289483,0.0007101538,0.0006267076,0.001532323,0.002162111,0.004456928,0.001819224,0.001611456,0.001051165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001237309,"about_ca_system_score_gemma":0.0005828342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004869472,"about_ca_topic_score_gemma":0.0003154336,"domain_scores_codex":[0.9977317,0.0006954221,0.0001709884,0.0003484995,0.000642554,0.0004107943],"domain_scores_gemma":[0.9820164,0.01282983,0.001333459,0.002003818,0.001297717,0.0005187321],"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.000433398,0.0001020654,0.002053345,0.0002659399,0.00005060955,0.0002821409,0.0005605803,0.04694649,0.01447011,0.8606915,0.005336037,0.06880771],"study_design_scores_gemma":[0.00006422491,0.0002517682,0.0008119731,0.0001169811,0.00006238186,0.000541223,0.0002956151,0.1974272,0.02849227,0.7493546,0.02248842,0.00009333473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5173348,0.003697738,0.394106,0.004064031,0.0004325155,0.0001129227,0.0009406265,0.001173033,0.0781384],"genre_scores_gemma":[0.9539322,0.001024043,0.03968774,0.0004381921,0.0002016057,0.0001042767,0.0004798604,0.00008526521,0.004046863],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00630576,"threshold_uncertainty_score":0.02109486,"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","authors":[{"name":"Vida Dujmović","is_ca":false},{"name":"David R. Wood","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357593,0.001387374,0.0008110509,0.002215589,0.001109361,0.003377582,0.001549389,0.001210536,0.02077848],"category_scores_gemma":[0.005165785,0.000946846,0.001082411,0.004715735,0.002583633,0.006089083,0.00203685,0.002424189,0.005510546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002911532,"about_ca_system_score_gemma":0.000637129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00229078,"about_ca_topic_score_gemma":0.002737717,"domain_scores_codex":[0.998357,0.0004656934,0.0001104138,0.0005016237,0.0003250611,0.0002402372],"domain_scores_gemma":[0.9970797,0.001623288,0.0003337724,0.0004958815,0.0003182188,0.0001491572],"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.00008888345,0.00003993973,0.0003301757,0.0004680509,0.00002349916,0.0001289033,0.0004266658,0.01936581,0.002077309,0.9092414,0.01261909,0.05519026],"study_design_scores_gemma":[0.00002813772,0.00004187106,0.0002932314,0.00006269228,0.00001178226,0.0001865388,0.0001035311,0.01735831,0.000604426,0.9527643,0.02851905,0.00002606071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0630895,0.01287018,0.7782108,0.003207325,0.0007768021,0.0002035637,0.003689715,0.003071351,0.1348807],"genre_scores_gemma":[0.5054618,0.0182924,0.364336,0.002336007,0.002132411,0.0005696168,0.007847391,0.001360362,0.09766404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02077848,"threshold_uncertainty_score":0.06951094,"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","authors":[{"name":"Raymond Yim","is_ca":true},{"name":"Lawrence R. Chen","is_ca":true},{"name":"Jan Bajcsy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007530951,0.0004790058,0.0002870721,0.0006800288,0.0003565977,0.0005168137,0.0004084886,0.0006073004,0.0006514831],"category_scores_gemma":[0.00327887,0.0002926599,0.0001990379,0.0005417613,0.0005146943,0.0004827662,0.0005059207,0.0003404996,0.0002595824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009588526,"about_ca_system_score_gemma":0.0008896022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001250908,"about_ca_topic_score_gemma":0.001821064,"domain_scores_codex":[0.9993259,0.0002608928,0.00002084203,0.0000595975,0.0002723483,0.00006050913],"domain_scores_gemma":[0.9981285,0.001009127,0.0002551602,0.0001688028,0.0003680718,0.00007049006],"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.0004065854,0.000128252,0.002676415,0.0001724917,0.00005654564,0.0001346156,0.0002383619,0.7760028,0.07011897,0.04192581,0.001199415,0.1069397],"study_design_scores_gemma":[0.00003479221,0.0002066174,0.0003364831,0.000009406149,0.000006684987,0.00008153905,0.00001508311,0.9712072,0.02028369,0.00638819,0.001413738,0.00001653036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2704188,0.0006315957,0.7234,0.0002502132,0.00006000514,0.0001511442,0.0001190091,0.0005317585,0.004437445],"genre_scores_gemma":[0.693452,0.0002304228,0.3043459,0.0001033934,0.0000181533,0.0001665835,0.0001050092,0.00005730154,0.00152125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001250908,"threshold_uncertainty_score":0.006957054,"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","authors":[{"name":"L. Tancevski","is_ca":true},{"name":"Leslie A. Rusch","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001573919,0.0006541263,0.0006752171,0.0006261443,0.0006661723,0.001125189,0.000266259,0.001125568,0.0006823484],"category_scores_gemma":[0.01446787,0.0003239691,0.0001638033,0.0006366228,0.0008213053,0.001068851,0.0006884768,0.0004374491,0.0002807367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006223486,"about_ca_system_score_gemma":0.0006072385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001247296,"about_ca_topic_score_gemma":0.0007157414,"domain_scores_codex":[0.9975285,0.0007606798,0.00008337253,0.0002361722,0.001011859,0.0003794394],"domain_scores_gemma":[0.9875021,0.01000408,0.0006859095,0.0005731576,0.0009790227,0.0002556448],"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.003255917,0.0002863986,0.02408281,0.0002252118,0.0001760922,0.001355579,0.0003634811,0.7029922,0.215236,0.008784037,0.0005271726,0.04271504],"study_design_scores_gemma":[0.0001381362,0.001769975,0.02083613,0.00005689334,0.0001146756,0.001190685,0.0001402139,0.8280777,0.1414735,0.005231007,0.0008196945,0.0001513099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9709292,0.0005267155,0.02465881,0.0001908358,0.00003904492,0.00001356993,0.00006965902,0.0002263073,0.003345925],"genre_scores_gemma":[0.9986721,0.00007781293,0.00102997,0.00002439744,0.0000155473,0.000002802758,0.00002144935,0.00001743773,0.0001383272],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001573919,"threshold_uncertainty_score":0.008323789,"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","authors":[{"name":"Elie Inaty","is_ca":true},{"name":"Hossam M. H. Shalaby","is_ca":true},{"name":"Paul Fortier","is_ca":true},{"name":"Leslie A. Rusch","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004374144,0.0005715501,0.0004446173,0.0003821992,0.0003927652,0.0005526809,0.0006452934,0.0005007646,0.0008735708],"category_scores_gemma":[0.001008452,0.000168747,0.0002620184,0.0003304793,0.0004875078,0.0009943817,0.0004618294,0.0003563019,0.0001945954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000313877,"about_ca_system_score_gemma":0.0002855057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006651391,"about_ca_topic_score_gemma":0.0007204858,"domain_scores_codex":[0.9996145,0.0001129775,0.00001731756,0.00006991928,0.0001438918,0.00004135306],"domain_scores_gemma":[0.9994428,0.0002937093,0.00007928153,0.00006569974,0.00008736709,0.00003130325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006638577,0.0003488263,0.002972878,0.0004990996,0.0001337903,0.0007896153,0.0004970196,0.369417,0.1652291,0.05700691,0.001324364,0.4011176],"study_design_scores_gemma":[0.00009121172,0.0002820674,0.0005057829,0.0000227024,0.00006199869,0.0002990931,0.00003026414,0.9670516,0.01992221,0.008186778,0.003518765,0.00002745959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1392009,0.0007394165,0.854121,0.0002015031,0.00009240965,0.00008120332,0.00001861142,0.0004820426,0.005062888],"genre_scores_gemma":[0.8735033,0.0004929777,0.1228971,0.00007973902,0.00008638256,0.00006530006,0.00002886858,0.00002698019,0.002819377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008735708,"threshold_uncertainty_score":0.002922356,"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","authors":[{"name":"Wensong Chu","is_ca":false},{"name":"Charles J. Colbourn","is_ca":false},{"name":"Peter J. Dukes","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221074,0.001522713,0.001337009,0.002340504,0.002904735,0.002847153,0.001547258,0.001823341,0.01384915],"category_scores_gemma":[0.009045403,0.0007292117,0.0009821203,0.002965925,0.004433561,0.006367271,0.005023587,0.005132613,0.002565607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002340958,"about_ca_system_score_gemma":0.001345544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002516794,"about_ca_topic_score_gemma":0.001729413,"domain_scores_codex":[0.9985092,0.0003827344,0.00004603497,0.000311865,0.0004714062,0.0002787048],"domain_scores_gemma":[0.9954804,0.002783756,0.0002481334,0.0005969408,0.0005565565,0.0003342064],"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.00005314194,0.000009908607,0.00007961801,0.00002500086,0.000004209443,0.00002716768,0.0001207081,0.001551133,0.0003792613,0.9887941,0.002092696,0.0068631],"study_design_scores_gemma":[0.00001024591,0.000008248567,0.0000559941,0.00001790345,0.000006402376,0.00004507963,0.0000426153,0.005926408,0.0006330367,0.9894173,0.003826926,0.000009936698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2217124,0.002847644,0.4120596,0.006556645,0.001499255,0.00016538,0.0007064631,0.001002666,0.35345],"genre_scores_gemma":[0.785089,0.002738986,0.07211719,0.002232344,0.001460498,0.0002808402,0.0009468176,0.0008921213,0.1342423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01384915,"threshold_uncertainty_score":0.04632998,"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","authors":[{"name":"Lata Narayanan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000570154,0.001314989,0.0009188333,0.001592516,0.001433851,0.002724365,0.001752861,0.0008632104,0.01479411],"category_scores_gemma":[0.004005641,0.0004588558,0.0005645268,0.003901416,0.001604403,0.003478198,0.002001459,0.002340784,0.002876701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003116821,"about_ca_system_score_gemma":0.00154485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006073226,"about_ca_topic_score_gemma":0.006942652,"domain_scores_codex":[0.9988638,0.0002413925,0.00003108313,0.0002918981,0.0003642438,0.0002075893],"domain_scores_gemma":[0.9975638,0.00116072,0.0002366471,0.0005188781,0.0003912367,0.0001286425],"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.0001133366,0.0001022621,0.0005017361,0.0003708097,0.00004048008,0.0001233542,0.0001490753,0.113745,0.002791339,0.6429767,0.04454106,0.1945448],"study_design_scores_gemma":[0.00003269661,0.00003824087,0.0004201815,0.00009801031,0.00003244368,0.0003173566,0.0001311185,0.2340073,0.003640245,0.6820998,0.07914942,0.00003332544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02851275,0.008578405,0.8130241,0.003273502,0.0007981717,0.0001992113,0.001061492,0.002131009,0.1424213],"genre_scores_gemma":[0.4375835,0.0130831,0.4464054,0.001213204,0.0007632376,0.0003521202,0.002313823,0.000953233,0.09733248],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01479411,"threshold_uncertainty_score":0.04949123,"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","authors":[{"name":"Majid H. Khoshafa","is_ca":true},{"name":"Omar Maraqa","is_ca":true},{"name":"Jules M. Moualeu","is_ca":false},{"name":"Sylvester Aboagye","is_ca":true},{"name":"Telex M. N. Ngatched","is_ca":true},{"name":"Mohamed H. Ahmed","is_ca":true},{"name":"Yasser Gadallah","is_ca":false},{"name":"Marco Di Renzo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007705821,0.001018687,0.0008566497,0.001834834,0.0004022238,0.001899154,0.0007085837,0.001124643,0.002738067],"category_scores_gemma":[0.0009997755,0.0005685702,0.0006660047,0.001711289,0.0005690486,0.002736486,0.0009043817,0.001268169,0.001032645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005035198,"about_ca_system_score_gemma":0.0006801984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004803883,"about_ca_topic_score_gemma":0.0004579244,"domain_scores_codex":[0.9995573,0.00009507907,0.0000502492,0.0000688768,0.0001849752,0.00004351866],"domain_scores_gemma":[0.9993213,0.0004316923,0.00006675955,0.00004294253,0.0001182246,0.00001920221],"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.00009993948,0.0001604879,0.001910885,0.00811667,0.000131116,0.0003847669,0.0003213355,0.02501111,0.01323546,0.1113495,0.01308117,0.8261975],"study_design_scores_gemma":[0.00002952708,0.001264807,0.004281878,0.004964323,0.0003679021,0.004065991,0.0007454606,0.1446095,0.02130263,0.09526007,0.7228189,0.0002890823],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0121269,0.8316681,0.1251991,0.0011242,0.0005471774,0.00009269189,0.0001325603,0.0001934103,0.0289159],"genre_scores_gemma":[0.09463497,0.8638569,0.03367389,0.0004845813,0.001223376,0.0001210746,0.0002593871,0.00006131879,0.005684485],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.002738067,"threshold_uncertainty_score":0.009159744,"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","authors":[{"name":"Lata Narayanan","is_ca":true},{"name":"S. Shende","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008426,0.0006314026,0.0009515565,0.001575202,0.001583788,0.002463252,0.00161107,0.001379862,0.004376681],"category_scores_gemma":[0.01003106,0.000684671,0.0004550898,0.002696231,0.001791845,0.003265976,0.001301351,0.001226078,0.0005425194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001673234,"about_ca_system_score_gemma":0.001550625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003866701,"about_ca_topic_score_gemma":0.004129993,"domain_scores_codex":[0.9990731,0.0003788202,0.00002583584,0.0001790782,0.000181662,0.0001614655],"domain_scores_gemma":[0.9956319,0.002954413,0.000457988,0.000337533,0.0003698358,0.0002483497],"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.0001993477,0.0001190734,0.001760015,0.0001668394,0.00005825974,0.0001093189,0.0002669984,0.4146982,0.001257295,0.4947181,0.008009222,0.07863725],"study_design_scores_gemma":[0.00003474109,0.00002833696,0.000404333,0.00001940907,0.00002768278,0.00006495419,0.0001215367,0.4314509,0.000303469,0.5647573,0.002771571,0.00001579092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1982476,0.001752838,0.7775924,0.002410459,0.0002849547,0.00008231862,0.0002622804,0.0002904839,0.01907679],"genre_scores_gemma":[0.9044595,0.001860808,0.07324146,0.0002589579,0.0003830359,0.000171502,0.0003298332,0.0001035982,0.01919125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004376681,"threshold_uncertainty_score":0.01464146,"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","authors":[{"name":"Wakaha Ogata","is_ca":false},{"name":"Kaoru Kurosawa","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Hajime Saido","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001787416,0.0008912134,0.0008193257,0.002272654,0.001241023,0.003212344,0.001346241,0.001860618,0.007089746],"category_scores_gemma":[0.009788048,0.0008910584,0.0009018105,0.003122555,0.003159225,0.002957284,0.001620037,0.002633634,0.001160076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211413,"about_ca_system_score_gemma":0.0008573311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003271527,"about_ca_topic_score_gemma":0.0008128486,"domain_scores_codex":[0.9986776,0.0006315827,0.00007428678,0.0001796959,0.0003532723,0.00008366087],"domain_scores_gemma":[0.9938433,0.003953041,0.0005711527,0.0007326651,0.0006536709,0.0002461475],"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.00004798116,0.00003610617,0.0001180892,0.00008217079,0.00001162905,0.00005059983,0.00006411661,0.01364032,0.001279699,0.9598591,0.001720884,0.02308922],"study_design_scores_gemma":[0.00004317479,0.00004533404,0.00008586446,0.00003524986,0.00001773482,0.0001467557,0.00003396078,0.08249789,0.0007575283,0.9095948,0.00671137,0.00003039589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03229604,0.002037098,0.927511,0.001606168,0.0005786796,0.000133532,0.0001809557,0.0002329624,0.0354235],"genre_scores_gemma":[0.4016494,0.004525748,0.5648475,0.0009510584,0.001312019,0.0006517385,0.0003085137,0.0001958732,0.02555818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007089746,"threshold_uncertainty_score":0.02371752,"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","authors":[{"name":"S. Ayotte","is_ca":true},{"name":"Martin Rochette","is_ca":false},{"name":"Julien Magné","is_ca":true},{"name":"Leslie A. Rusch","is_ca":true},{"name":"Sophie LaRochelle","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407422,0.0006136254,0.0003286359,0.0003692,0.0004499178,0.0003597579,0.000842558,0.0007154185,0.001633664],"category_scores_gemma":[0.007169706,0.0002425617,0.0002106935,0.000262501,0.0009731603,0.0007990539,0.0003878495,0.0005161593,0.0002536512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007092012,"about_ca_system_score_gemma":0.0004569403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002767993,"about_ca_topic_score_gemma":0.001406356,"domain_scores_codex":[0.9990968,0.0001889438,0.00003817543,0.00009616266,0.0004852878,0.00009463397],"domain_scores_gemma":[0.9949468,0.003203969,0.000294631,0.0006756822,0.0007989137,0.00008002111],"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.001015525,0.0004067821,0.004889602,0.0002382812,0.00009074728,0.0005828375,0.0003066716,0.2535279,0.702029,0.02332926,0.0006064268,0.01297698],"study_design_scores_gemma":[0.00004490481,0.0003720417,0.001319171,0.00001552209,0.00001433706,0.00009731024,0.00003148398,0.4984553,0.4975265,0.001532853,0.0005562226,0.00003442019],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9198627,0.0001352905,0.07554794,0.0002205745,0.00003738688,0.00008757615,0.0002497231,0.000581157,0.003277607],"genre_scores_gemma":[0.9904668,0.00003571584,0.009132477,0.000009284783,0.000003959993,0.00002502129,0.00005364519,0.00001206685,0.0002610883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002767993,"threshold_uncertainty_score":0.00744319,"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","authors":[{"name":"Shaun Fallat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007557023,0.001033595,0.0005397347,0.001668886,0.0009875237,0.002034733,0.0005218618,0.0005632701,0.01678267],"category_scores_gemma":[0.003450705,0.0004177709,0.0006179738,0.001228862,0.001181648,0.00240317,0.001438326,0.001440806,0.004673827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006301086,"about_ca_system_score_gemma":0.0005757334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001314541,"about_ca_topic_score_gemma":0.0021608,"domain_scores_codex":[0.9994362,0.0001228295,0.00003765074,0.00009700196,0.0001826226,0.000123658],"domain_scores_gemma":[0.9989027,0.0002403945,0.000161846,0.0001376474,0.0003470744,0.0002102821],"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.0001600958,0.00003927869,0.0004332195,0.0001492234,0.00002010355,0.0002019095,0.0004465851,0.004726091,0.004308958,0.9023824,0.03334996,0.05378217],"study_design_scores_gemma":[0.00002530418,0.0000580415,0.0004338781,0.0000587928,0.0000129077,0.0004142358,0.000177522,0.02681365,0.0011006,0.9388258,0.03203432,0.00004492853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06089541,0.004808818,0.8629103,0.001789036,0.001519762,0.0001486813,0.002446168,0.0005174454,0.06496444],"genre_scores_gemma":[0.6174567,0.005786716,0.3165287,0.001352061,0.00111997,0.0004287637,0.003720224,0.0004180395,0.05318876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01678267,"threshold_uncertainty_score":0.05614364,"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","authors":[{"name":"Hadi Kharaghani","is_ca":true},{"name":"B. Tayfeh‐Rezaie","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000686092,0.0006837917,0.0006914295,0.001741136,0.001118107,0.001849055,0.0004204307,0.0008919584,0.01030231],"category_scores_gemma":[0.002656357,0.0002360309,0.0004557908,0.00107153,0.001595238,0.001609969,0.0007056245,0.001052052,0.001129705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005642363,"about_ca_system_score_gemma":0.0005690671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005745813,"about_ca_topic_score_gemma":0.0004063222,"domain_scores_codex":[0.9981009,0.000336271,0.0001635823,0.0003379663,0.000681591,0.000379762],"domain_scores_gemma":[0.998384,0.0003914012,0.0003360105,0.0003055328,0.0004503574,0.000132713],"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.0004405491,0.00009186452,0.001813692,0.0001246076,0.00002069604,0.000710635,0.0003899155,0.00490714,0.01893141,0.9191825,0.003431875,0.0499551],"study_design_scores_gemma":[0.00006162361,0.0002878129,0.001725129,0.00007035698,0.0000143461,0.001138779,0.000200506,0.01389939,0.01098666,0.9466504,0.02488601,0.00007913361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7356071,0.002022314,0.1264121,0.001158777,0.0007712735,0.0002291322,0.001059105,0.0004045591,0.1323358],"genre_scores_gemma":[0.9617454,0.0002612737,0.02803862,0.0001584558,0.0001926188,0.00005713355,0.0004142791,0.00003020009,0.009102009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01030231,"threshold_uncertainty_score":0.03446466,"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","authors":[{"name":"Gennian Ge","is_ca":false},{"name":"Rolf S. Rees","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127032,0.0009239761,0.0008513956,0.00151816,0.001248622,0.001827924,0.001027038,0.001507478,0.0067565],"category_scores_gemma":[0.009132831,0.0006370734,0.0005866471,0.001467904,0.002097179,0.001919174,0.001707389,0.001293218,0.00091796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001377346,"about_ca_system_score_gemma":0.0008862996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007027793,"about_ca_topic_score_gemma":0.001017531,"domain_scores_codex":[0.9981397,0.000885214,0.00006506115,0.0001895735,0.0004387728,0.0002815026],"domain_scores_gemma":[0.9927623,0.004642449,0.0009534538,0.0007612693,0.0005885627,0.0002920348],"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.0003854244,0.0000371398,0.0004390872,0.00009411073,0.00002006008,0.0001504207,0.0002602158,0.0142056,0.003497509,0.9610962,0.00202871,0.01778554],"study_design_scores_gemma":[0.0001090779,0.0001540916,0.0002799407,0.00006945519,0.00002971762,0.0002727069,0.00009993234,0.07054199,0.00313646,0.9194855,0.005779408,0.0000415915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3480882,0.001426091,0.5581511,0.001436873,0.0004530934,0.0001685806,0.0002694232,0.0003510055,0.08965573],"genre_scores_gemma":[0.8870853,0.001023485,0.08439453,0.0006360305,0.0003898941,0.0002003306,0.0002020442,0.0001278703,0.02594036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0067565,"threshold_uncertainty_score":0.0226028,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002497765,0.0007855596,0.0008475565,0.0009040961,0.0008206731,0.001423441,0.000720565,0.0009979431,0.00306082],"category_scores_gemma":[0.006095788,0.0007042798,0.0006748619,0.0009802114,0.001882412,0.002386044,0.002410749,0.0009759895,0.0007928911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000595491,"about_ca_system_score_gemma":0.0005666842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002126303,"about_ca_topic_score_gemma":0.0002373973,"domain_scores_codex":[0.9971049,0.001436214,0.0001613911,0.0004973435,0.0005223703,0.000277617],"domain_scores_gemma":[0.9976572,0.0009820048,0.0004057563,0.0006042212,0.0002257218,0.0001250623],"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.0003928,0.00006815849,0.0009889698,0.0001553527,0.00005820904,0.0001736259,0.0002889236,0.04461687,0.01651758,0.8649533,0.00117579,0.07061035],"study_design_scores_gemma":[0.0001400805,0.0004980142,0.0007105282,0.00009715424,0.00005209484,0.000355589,0.0001694494,0.1786215,0.02939091,0.7783192,0.01153087,0.0001146448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1268472,0.0003564605,0.8640869,0.0002011677,0.00005839615,0.0001015182,0.0001982641,0.0002116978,0.007938382],"genre_scores_gemma":[0.6128196,0.0004126439,0.3803107,0.0002204151,0.00008568649,0.0005048987,0.0003570216,0.0001457704,0.005143284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00306082,"threshold_uncertainty_score":0.01320958,"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","authors":[{"name":"Maria Chudnovsky","is_ca":false},{"name":"Jim Geelen","is_ca":true},{"name":"Bert Gerards","is_ca":false},{"name":"Luis Goddyn","is_ca":true},{"name":"Michael Lohman","is_ca":false},{"name":"Paul Seymour","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000697694,0.0006937237,0.0008223163,0.002402034,0.003098741,0.003933441,0.001306405,0.00246702,0.007692185],"category_scores_gemma":[0.004922796,0.0009756641,0.0006505226,0.002805996,0.003116974,0.004368859,0.00255395,0.002022212,0.0009267573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00122761,"about_ca_system_score_gemma":0.0008303251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001360787,"about_ca_topic_score_gemma":0.002283832,"domain_scores_codex":[0.9989663,0.000336363,0.00006522441,0.0001851923,0.0001885217,0.0002582817],"domain_scores_gemma":[0.9932088,0.004034301,0.0009590647,0.0006967231,0.0002921071,0.0008089917],"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.0004157122,0.0002006044,0.001899968,0.0001813967,0.00003488467,0.0007204167,0.001223236,0.01405941,0.009572553,0.946584,0.002876952,0.02223083],"study_design_scores_gemma":[0.00004241749,0.00005343517,0.0005258863,0.00004329413,0.0000173907,0.0002485806,0.0004004698,0.02783982,0.002738886,0.9663191,0.001750948,0.00001983551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8255804,0.0003440205,0.1378294,0.0008439441,0.0001825624,0.0000829679,0.0003122831,0.0005418167,0.03428267],"genre_scores_gemma":[0.9490333,0.0002767176,0.04052024,0.0002011151,0.00006580334,0.00008419185,0.0003046019,0.0001358595,0.009378044],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007692185,"threshold_uncertainty_score":0.02573293,"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","authors":[{"name":"Douglas R. Stinson","is_ca":true},{"name":"Ruizhong Wei","is_ca":true},{"name":"K. Chen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376566,0.001085628,0.001642748,0.00203396,0.003660424,0.00353064,0.001686292,0.002049747,0.01622376],"category_scores_gemma":[0.008273549,0.001138367,0.001183102,0.002811829,0.004113085,0.009660034,0.006087188,0.004309326,0.001536011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002147168,"about_ca_system_score_gemma":0.0008077741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001259622,"about_ca_topic_score_gemma":0.00115221,"domain_scores_codex":[0.9986113,0.00041852,0.00005681402,0.0002761427,0.0003296088,0.0003076185],"domain_scores_gemma":[0.9939464,0.00333662,0.0004873761,0.001036652,0.0005023031,0.0006907214],"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.00008235095,0.00002170415,0.0002169777,0.00002555606,0.000007480901,0.00005638408,0.0002726479,0.001892547,0.0004403368,0.9899727,0.001590143,0.005421189],"study_design_scores_gemma":[0.0000169806,0.00001208566,0.0001197536,0.00001573669,0.000009998841,0.00007733173,0.0001061207,0.009783623,0.000317666,0.9874878,0.002039188,0.0000137251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5775653,0.001287207,0.2754969,0.00399569,0.0004826711,0.0001598898,0.0006472283,0.0005989652,0.1397662],"genre_scores_gemma":[0.9314954,0.0009631441,0.0247975,0.0007747939,0.0004475445,0.0001179546,0.000514889,0.0002960184,0.04059287],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01622376,"threshold_uncertainty_score":0.0542739,"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","authors":[{"name":"Habib Fathallah","is_ca":true},{"name":"Leslie A. Rusch","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004652754,0.0002691361,0.000231945,0.000493162,0.0003897404,0.0005302894,0.0007516723,0.0004548691,0.00136715],"category_scores_gemma":[0.002909558,0.0001167084,0.0000910588,0.0003573922,0.000588441,0.001285691,0.000425381,0.0004939622,0.0001413151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006476998,"about_ca_system_score_gemma":0.0003792817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001282582,"about_ca_topic_score_gemma":0.001307136,"domain_scores_codex":[0.9995947,0.0001011844,0.000008414712,0.00004201847,0.0001797144,0.0000739555],"domain_scores_gemma":[0.9977068,0.001138736,0.00020302,0.0002974434,0.0005649466,0.00008911015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008212113,0.0003810369,0.0117024,0.000325841,0.00006740566,0.0008194793,0.0004700097,0.1074249,0.2984205,0.1026836,0.007111674,0.469772],"study_design_scores_gemma":[0.0000299724,0.0002495123,0.003237206,0.00001614685,0.000020181,0.0007427766,0.00006411735,0.8465639,0.1230516,0.02091899,0.005076296,0.00002930952],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4291168,0.0006363364,0.5609029,0.0005365574,0.00005748825,0.00007434553,0.00008912569,0.001118963,0.007467358],"genre_scores_gemma":[0.9695967,0.0001370692,0.02902999,0.00005223622,0.00002651842,0.00001876342,0.00003924288,0.00002435482,0.00107518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00136715,"threshold_uncertainty_score":0.004699349,"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","authors":[{"name":"A. Stok","is_ca":true},{"name":"Edward H. Sargent","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006702678,0.0001926774,0.0002670259,0.0006478569,0.0003045108,0.0006374193,0.0002570206,0.0003745999,0.001346716],"category_scores_gemma":[0.002173636,0.00006887405,0.00007917164,0.000497054,0.0002124072,0.000417312,0.0002251609,0.0001365385,0.0002592116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006295369,"about_ca_system_score_gemma":0.0003906258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001942736,"about_ca_topic_score_gemma":0.001969273,"domain_scores_codex":[0.9994711,0.0001745891,0.0000166262,0.00006188457,0.0001853923,0.00009029364],"domain_scores_gemma":[0.9985546,0.0007179698,0.00007770655,0.00008451506,0.0005038582,0.00006119003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01018909,0.0006778639,0.03467025,0.0005704866,0.0002738502,0.0004931598,0.0006707957,0.1420204,0.2622657,0.01202317,0.004177344,0.5319679],"study_design_scores_gemma":[0.0003235332,0.003737107,0.02073127,0.0000451508,0.0002938847,0.000742057,0.0003006968,0.7922114,0.1710342,0.002429261,0.008067818,0.00008360886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9663672,0.0007994936,0.02402175,0.000168822,0.0000621181,0.00003331462,0.00007497419,0.0006571145,0.007815214],"genre_scores_gemma":[0.9932798,0.0001329763,0.00525762,0.00003237636,0.00002376285,0.00001227509,0.00006446287,0.00001501932,0.001181675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001942736,"threshold_uncertainty_score":0.004567683,"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","authors":[{"name":"I. P. Goulden","is_ca":true},{"name":"Alexander Yong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281021,0.0003370818,0.0005799226,0.001653771,0.001455929,0.002783493,0.0005155909,0.0008160835,0.009673486],"category_scores_gemma":[0.00463641,0.000503714,0.0005093215,0.001654285,0.00121668,0.003288327,0.000715214,0.001173329,0.0008048798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000659515,"about_ca_system_score_gemma":0.0004549562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001177873,"about_ca_topic_score_gemma":0.00181064,"domain_scores_codex":[0.9996525,0.00006023994,0.00002102752,0.00009195213,0.00009234099,0.00008191467],"domain_scores_gemma":[0.9967731,0.001701549,0.0004975504,0.00031278,0.0003847227,0.0003302916],"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.0001089904,0.00005176606,0.001118475,0.00008101919,0.00001266328,0.0002006878,0.0005455947,0.002875964,0.004736212,0.9737523,0.003237501,0.01327885],"study_design_scores_gemma":[0.00002236237,0.00002489928,0.0005968918,0.00002296894,0.00001336149,0.0002590055,0.0001727148,0.01186604,0.0009437001,0.9821708,0.003890711,0.00001651476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7173922,0.0009069123,0.1920814,0.001197691,0.0001648089,0.0001416498,0.001253229,0.0005558253,0.08630625],"genre_scores_gemma":[0.9634714,0.0005963068,0.0258499,0.0002208221,0.0001623674,0.0000790687,0.0008788088,0.0001565886,0.008584868],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009673486,"threshold_uncertainty_score":0.03236103,"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","authors":[{"name":"Samuel Pierre","is_ca":true},{"name":"Fabien Houéto","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585375,0.0007233942,0.0007870008,0.001520707,0.0008686032,0.001373626,0.001279464,0.001291619,0.002749483],"category_scores_gemma":[0.004778659,0.0004710096,0.0004344339,0.001910786,0.001167892,0.001477018,0.0008086498,0.0006196727,0.0004574585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001081947,"about_ca_system_score_gemma":0.00112861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006000188,"about_ca_topic_score_gemma":0.006174165,"domain_scores_codex":[0.9991747,0.0005383631,0.00002702358,0.00007174012,0.0001079051,0.00008020694],"domain_scores_gemma":[0.9984475,0.001123406,0.0001358376,0.0001105898,0.0001240603,0.00005878386],"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.0001360827,0.0000651494,0.0007517773,0.00005506951,0.00003306602,0.00003307092,0.0001070715,0.9269849,0.0008679384,0.008217271,0.0009059306,0.0618426],"study_design_scores_gemma":[0.00003998182,0.00006528112,0.0001134818,0.00001788657,0.0000136538,0.0000172596,0.00006027978,0.9883637,0.000721948,0.009626741,0.0009515307,0.000008297973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1257324,0.001169918,0.8644271,0.0003098845,0.000060295,0.0002358222,0.0001518263,0.0008176962,0.007095161],"genre_scores_gemma":[0.5825027,0.0005912425,0.4135311,0.0001830376,0.00002915922,0.0003848328,0.0002541143,0.0001353971,0.002388485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006000188,"threshold_uncertainty_score":0.01193053,"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","authors":[{"name":"D. de Caen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006955247,0.000635405,0.0004971635,0.00216117,0.002207386,0.002814051,0.001656121,0.001043448,0.01061259],"category_scores_gemma":[0.003859937,0.0007104689,0.0004768833,0.001647299,0.002637093,0.00344861,0.002937748,0.001701949,0.002056459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009917925,"about_ca_system_score_gemma":0.0002383846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002657406,"about_ca_topic_score_gemma":0.0004924064,"domain_scores_codex":[0.9987867,0.0004461568,0.00006410242,0.0002374357,0.0003066186,0.0001590052],"domain_scores_gemma":[0.9972351,0.001368312,0.0003523875,0.0004670295,0.0003048886,0.0002722912],"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.00006674552,0.00001991171,0.0003883222,0.00005750346,0.000006917885,0.0001162387,0.0002025404,0.002781053,0.002170247,0.981531,0.00201671,0.01064288],"study_design_scores_gemma":[0.0000597668,0.0001160907,0.00064546,0.0001078364,0.00002682631,0.0008735305,0.0005135447,0.03762873,0.01606952,0.9029074,0.04099184,0.00005938364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3508029,0.001062591,0.4979364,0.0009871629,0.0001986704,0.0001357032,0.0004960733,0.00130831,0.1470722],"genre_scores_gemma":[0.826129,0.0005431841,0.1464863,0.0003972788,0.0001248168,0.0003585918,0.0007209897,0.0002564115,0.0249835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01061259,"threshold_uncertainty_score":0.03550261,"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","authors":[{"name":"Bertrand Guenin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001479391,0.0009987772,0.001195976,0.004382578,0.00266239,0.004728055,0.002237635,0.001710334,0.008439316],"category_scores_gemma":[0.01140368,0.0009925914,0.0009500938,0.004193914,0.002844912,0.007421622,0.003282958,0.002937023,0.001075296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001528959,"about_ca_system_score_gemma":0.000669913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007731267,"about_ca_topic_score_gemma":0.000697908,"domain_scores_codex":[0.9984487,0.0004678197,0.0001118393,0.0004189176,0.0003339267,0.0002186116],"domain_scores_gemma":[0.9866665,0.008121063,0.001528105,0.0009428759,0.001363066,0.001378361],"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.000168016,0.0001146853,0.003134468,0.0001390043,0.00002185066,0.0001547219,0.0005767756,0.002946573,0.005510039,0.9689078,0.004116909,0.01420914],"study_design_scores_gemma":[0.00002076533,0.00005650802,0.001415617,0.00005771482,0.00002878937,0.0004178664,0.0003824593,0.03315846,0.001770432,0.9567526,0.005913648,0.00002510783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5770623,0.0006941644,0.3455781,0.003338882,0.0001529622,0.0002356928,0.002217733,0.0005271831,0.07019293],"genre_scores_gemma":[0.9300704,0.0008648576,0.04653779,0.000855656,0.0004936797,0.0003415481,0.003115188,0.0003602017,0.01736069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008439316,"threshold_uncertainty_score":0.02823228,"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","authors":[{"name":"Luisa Gargano","is_ca":false},{"name":"Mikael Hammar","is_ca":false},{"name":"Pavol Hell","is_ca":true},{"name":"Ladislav Stacho","is_ca":true},{"name":"Ugo Vaccaro","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002739914,0.000241799,0.0004184987,0.0008329493,0.0009280904,0.001415375,0.0004954037,0.0009141662,0.003569558],"category_scores_gemma":[0.001571428,0.0002697267,0.0002905498,0.0008704288,0.001135543,0.001713819,0.0009315109,0.0009371468,0.0003014423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004852109,"about_ca_system_score_gemma":0.0002904443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005516412,"about_ca_topic_score_gemma":0.0005971939,"domain_scores_codex":[0.9998488,0.00004136927,0.000006274039,0.00003151599,0.00003696587,0.00003495759],"domain_scores_gemma":[0.9993119,0.0003416022,0.00008958029,0.00007220956,0.00007035892,0.0001142674],"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.00007260645,0.00002921101,0.0002930687,0.0000321616,0.00001082343,0.00009803821,0.0001520568,0.009538389,0.003152222,0.970368,0.001430442,0.0148229],"study_design_scores_gemma":[0.00001578653,0.00001433497,0.0001935692,0.000006335001,0.000006113397,0.00008799956,0.00007515782,0.0333721,0.0005863144,0.9634007,0.002235703,0.000005913582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6320583,0.002319082,0.294158,0.001777364,0.0003038854,0.00007028198,0.0001653426,0.0003552367,0.06879259],"genre_scores_gemma":[0.9625317,0.0009960672,0.02264644,0.000242209,0.0001441359,0.00004588004,0.0000838905,0.00004258956,0.01326713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003569558,"threshold_uncertainty_score":0.01194131,"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","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002278429,0.0006324089,0.0007306294,0.0022896,0.001182546,0.002701106,0.0005554347,0.0009238163,0.01159442],"category_scores_gemma":[0.002267347,0.0005786424,0.0005494268,0.002340088,0.001033309,0.002668429,0.001610196,0.001578003,0.001756583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007692204,"about_ca_system_score_gemma":0.0002634909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005551504,"about_ca_topic_score_gemma":0.0005387135,"domain_scores_codex":[0.9995422,0.0001305875,0.00002056084,0.00009095016,0.0001331547,0.00008250285],"domain_scores_gemma":[0.9985332,0.0006915706,0.00017682,0.0002209247,0.0001934506,0.0001840823],"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.00002700417,0.00002072878,0.0002475976,0.00003905816,0.000009453735,0.00005829048,0.0001706093,0.002524757,0.001321767,0.9717106,0.006743165,0.01712696],"study_design_scores_gemma":[0.000007372906,0.00001502178,0.0003030305,0.00001776197,0.000009952222,0.0001668898,0.0000966356,0.0105859,0.0006990997,0.974861,0.01322718,0.00001009708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4025995,0.003626497,0.1970233,0.00498356,0.001624787,0.000110924,0.0009464927,0.001160923,0.3879241],"genre_scores_gemma":[0.898492,0.002321339,0.02776414,0.0009662249,0.001150158,0.0001245865,0.0008082579,0.0003142131,0.06805904],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01159442,"threshold_uncertainty_score":0.03878719,"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","authors":[{"name":"R. A. Bailey","is_ca":true},{"name":"José Cáceres","is_ca":false},{"name":"Delia Garijo","is_ca":false},{"name":"Antonio González","is_ca":false},{"name":"Alberto Márquez","is_ca":false},{"name":"Karen Meagher","is_ca":true},{"name":"María Luz Puertas","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00193385,0.001084212,0.001893704,0.004581317,0.008790053,0.01055028,0.002904507,0.003429743,0.02021216],"category_scores_gemma":[0.0105852,0.00172241,0.002148601,0.005463543,0.004524122,0.01276949,0.00574999,0.005635476,0.002658267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002256265,"about_ca_system_score_gemma":0.001656632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002927005,"about_ca_topic_score_gemma":0.003800074,"domain_scores_codex":[0.9966989,0.0008065806,0.0002590842,0.0006191831,0.0009665316,0.0006496125],"domain_scores_gemma":[0.9933078,0.004086374,0.0006184441,0.0008364732,0.0004916702,0.0006591546],"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.00002952,0.00004971963,0.0001445972,0.0000435284,0.00001246368,0.00007845034,0.0004854396,0.001059365,0.0003216504,0.9912157,0.001699267,0.004860234],"study_design_scores_gemma":[0.00001124621,0.000005876089,0.0000918735,0.00001600525,0.00001933914,0.00007932486,0.0002191669,0.002008328,0.0003323288,0.9931225,0.004077496,0.00001643727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3360404,0.003156447,0.3303786,0.006151035,0.0007191487,0.0003005847,0.001557814,0.001502919,0.3201931],"genre_scores_gemma":[0.8126265,0.002176106,0.1032122,0.001688532,0.0006897891,0.0003371447,0.002178461,0.0007224606,0.07636885],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02021216,"threshold_uncertainty_score":0.06761646,"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","authors":[{"name":"Peter Danziger","is_ca":true},{"name":"Gaetano Quattrocchi","is_ca":false},{"name":"Brett Stevens","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008696222,0.0004257855,0.0005823378,0.00077396,0.00117101,0.001593692,0.001219864,0.001384086,0.01007234],"category_scores_gemma":[0.004588642,0.0004670419,0.0008683702,0.0006920363,0.001129844,0.002076159,0.001039303,0.001330162,0.0006219486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000879439,"about_ca_system_score_gemma":0.001310744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005614826,"about_ca_topic_score_gemma":0.00737522,"domain_scores_codex":[0.9989297,0.0002988975,0.00005038698,0.0001970658,0.0002186107,0.0003053668],"domain_scores_gemma":[0.9968659,0.002111671,0.000300184,0.0003537963,0.0001748309,0.0001936472],"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.0006270531,0.0001773008,0.001905758,0.000289362,0.0001132353,0.0004973849,0.0006094099,0.0811877,0.009339434,0.7920896,0.0133627,0.09980112],"study_design_scores_gemma":[0.0002241449,0.0001050208,0.0006918974,0.00006679116,0.0000479183,0.0002894718,0.00040123,0.1337573,0.007307251,0.8429133,0.0141402,0.00005546225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5462817,0.00100323,0.3596862,0.002288569,0.00011202,0.0004074415,0.001000172,0.0003624048,0.08885828],"genre_scores_gemma":[0.8813098,0.0004752278,0.09726671,0.0003799602,0.00008981453,0.0002036183,0.0007000819,0.0001023401,0.01947251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01007234,"threshold_uncertainty_score":0.03369534,"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","authors":[{"name":"Nam Yul Yu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007846095,0.0006152821,0.0007428151,0.001273966,0.0009696254,0.001099341,0.00131058,0.0007524875,0.003294377],"category_scores_gemma":[0.007488817,0.0006691273,0.0005160194,0.001634692,0.00094945,0.001381707,0.001844132,0.001337251,0.001602721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008594725,"about_ca_system_score_gemma":0.001514011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001914013,"about_ca_topic_score_gemma":0.001557252,"domain_scores_codex":[0.99883,0.0002719607,0.0001051005,0.0002091918,0.0004580359,0.0001256699],"domain_scores_gemma":[0.997024,0.001010356,0.000262201,0.0005841951,0.0008715653,0.000247655],"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.0004083207,0.00008410251,0.001203818,0.0003268584,0.00003701313,0.0004812498,0.0006416939,0.06217589,0.05594214,0.6607355,0.009675765,0.2082876],"study_design_scores_gemma":[0.0001019041,0.0003374476,0.001026358,0.0001516957,0.00003130118,0.001060713,0.0001910439,0.642184,0.03305164,0.2826691,0.0390581,0.0001366178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01522589,0.0003363145,0.9768886,0.0001482929,0.0001237767,0.0001225709,0.0003809998,0.0003543656,0.006419144],"genre_scores_gemma":[0.2605169,0.0007295964,0.7257374,0.0001972533,0.0001268738,0.0005949391,0.00149483,0.0002163762,0.01038588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003294377,"threshold_uncertainty_score":0.01102078,"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","authors":[{"name":"Mahdad Khatirinejad","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006790183,0.0010541,0.001047614,0.003133794,0.003642026,0.003212752,0.001376108,0.001779375,0.008108793],"category_scores_gemma":[0.002000418,0.0004928892,0.0008065596,0.001630537,0.004184268,0.003914232,0.001987204,0.001892898,0.001141378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001951847,"about_ca_system_score_gemma":0.000832024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003614215,"about_ca_topic_score_gemma":0.002496765,"domain_scores_codex":[0.9994676,0.0001092048,0.00002565728,0.00008182355,0.0001483351,0.0001674388],"domain_scores_gemma":[0.9992625,0.000180246,0.0001660719,0.00009232327,0.0001043238,0.0001945509],"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.00006377848,0.00002436445,0.0001947074,0.00001644662,0.000006101711,0.0001242929,0.0003262002,0.00123394,0.0006978925,0.9940361,0.0005610794,0.002715059],"study_design_scores_gemma":[0.00002271544,0.00001629629,0.0001615473,0.00001116181,0.000003897853,0.00005696987,0.000162012,0.003160789,0.0003224572,0.9951,0.0009716428,0.00001069401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.836933,0.0005659378,0.04358602,0.001109532,0.0003593023,0.0001015738,0.0002841129,0.0003385766,0.1167219],"genre_scores_gemma":[0.9719965,0.000377834,0.006970329,0.0002445895,0.0002780773,0.00006900878,0.000222468,0.0001359486,0.01970515],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008108793,"threshold_uncertainty_score":0.02712661,"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","authors":[{"name":"Brian Alspach","is_ca":true},{"name":"Heather Gavlas","is_ca":false},{"name":"Mateja Šajna","is_ca":true},{"name":"H. Verrall","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006441038,0.0009526024,0.0008362827,0.002467937,0.001334418,0.003527471,0.001176109,0.001293618,0.007347037],"category_scores_gemma":[0.003621773,0.000844296,0.001080164,0.002780183,0.001677219,0.00376167,0.001333674,0.002437232,0.0007746299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001404265,"about_ca_system_score_gemma":0.0009152366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00214236,"about_ca_topic_score_gemma":0.002162181,"domain_scores_codex":[0.999395,0.0001291394,0.00003390148,0.0001895344,0.0001329037,0.0001193949],"domain_scores_gemma":[0.9978651,0.0009297018,0.0003388634,0.000246694,0.0003345447,0.0002850281],"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.00006957311,0.00003519995,0.0003661841,0.0001065144,0.00002390607,0.0001053968,0.0002828653,0.005527225,0.001553818,0.9706423,0.004555373,0.01673164],"study_design_scores_gemma":[0.00002122704,0.000009983397,0.0002013409,0.00003410477,0.00001762283,0.0001088889,0.0001175725,0.01351463,0.0004667804,0.9802378,0.005259303,0.00001074043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.270788,0.004660422,0.5782939,0.002253173,0.0004813408,0.0005236294,0.002203923,0.0004411231,0.1403545],"genre_scores_gemma":[0.8009982,0.004236653,0.1436571,0.001025869,0.0005350745,0.0005738826,0.002726092,0.0003076463,0.04593943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007347037,"threshold_uncertainty_score":0.02457833,"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","authors":[{"name":"Willem H. Haemers","is_ca":false},{"name":"Hadi Kharaghani","is_ca":true},{"name":"Maaike A. Meulenberg","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005065526,0.0006472293,0.0005372823,0.001068862,0.001296085,0.001975273,0.0007371767,0.0009573801,0.01825853],"category_scores_gemma":[0.002514719,0.0005279933,0.0003885934,0.000955118,0.001061666,0.001975536,0.001357733,0.001747643,0.002270348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008918262,"about_ca_system_score_gemma":0.0004791401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003006571,"about_ca_topic_score_gemma":0.0005726271,"domain_scores_codex":[0.9991978,0.0002506428,0.00002892715,0.000244184,0.0001850959,0.00009337442],"domain_scores_gemma":[0.9976724,0.0008496526,0.0002338319,0.0006745082,0.0003506492,0.0002190535],"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.00005255284,0.00003664248,0.0002381975,0.00004059265,0.00001156974,0.00005428478,0.00007653418,0.00240028,0.002495259,0.9633554,0.003579695,0.02765898],"study_design_scores_gemma":[0.00002695654,0.00004111566,0.0002027937,0.00002904431,0.00001620886,0.000197518,0.00004416728,0.00966379,0.001869671,0.9597744,0.02812202,0.00001236551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1979418,0.0007988627,0.5575082,0.002113912,0.0005240494,0.0002270624,0.0005978243,0.0006688311,0.2396194],"genre_scores_gemma":[0.7718272,0.0007443617,0.1254693,0.001138711,0.0003247626,0.0002302681,0.0005690235,0.0002030941,0.0994933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01825853,"threshold_uncertainty_score":0.06108081,"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","authors":[{"name":"Raymond Yim","is_ca":true},{"name":"Jan Bajcsy","is_ca":true},{"name":"Lawrence R. Chen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003667921,0.0004285015,0.0002236747,0.0005758459,0.0004089323,0.0005425476,0.000426308,0.0004162246,0.0009020439],"category_scores_gemma":[0.001500516,0.000168016,0.0003071955,0.0004789716,0.000552076,0.0005886711,0.0003709794,0.0006135888,0.0003673594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003931267,"about_ca_system_score_gemma":0.0005608922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003937163,"about_ca_topic_score_gemma":0.0005770337,"domain_scores_codex":[0.9996651,0.00007996077,0.00001613145,0.00005575468,0.0001496941,0.00003338535],"domain_scores_gemma":[0.9990135,0.0003676464,0.0001436163,0.0001576731,0.0002501919,0.00006725595],"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.0002211111,0.0001347718,0.002846921,0.0002497503,0.00006170709,0.0004693032,0.0003152556,0.1514325,0.1547119,0.4735026,0.004848316,0.2112059],"study_design_scores_gemma":[0.00006655449,0.0003380667,0.001044782,0.00006697696,0.0000332627,0.001572878,0.00004539791,0.768681,0.06425589,0.09295546,0.07084382,0.00009595975],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09931368,0.00113009,0.8905458,0.0002261611,0.0001476021,0.0001010737,0.0001309658,0.0004142534,0.007990276],"genre_scores_gemma":[0.510175,0.001086604,0.4792698,0.0002627247,0.0000944779,0.0003407499,0.00032938,0.0001226157,0.008318673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009020439,"threshold_uncertainty_score":0.003017664,"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","authors":[{"name":"Martin Rochette","is_ca":true},{"name":"S. Ayotte","is_ca":true},{"name":"Leslie A. Rusch","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005808095,0.0002871187,0.0002885503,0.0006081156,0.0001837003,0.0004138842,0.0003861313,0.0002935494,0.0008152424],"category_scores_gemma":[0.003474171,0.0001260742,0.0001911903,0.0004186979,0.0005170672,0.0005887336,0.0002308802,0.0002678363,0.0001839539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004922473,"about_ca_system_score_gemma":0.0002229465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005101728,"about_ca_topic_score_gemma":0.0003804927,"domain_scores_codex":[0.9995159,0.0001196436,0.00001295928,0.0000416011,0.0002511234,0.0000587418],"domain_scores_gemma":[0.9978758,0.001468886,0.0001435846,0.0001555138,0.0003280265,0.00002810206],"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.0005261693,0.000133791,0.00759522,0.0001444627,0.0001221485,0.0003719162,0.0002390327,0.5735293,0.2525368,0.1076909,0.0003356588,0.05677463],"study_design_scores_gemma":[0.00001341397,0.00009218428,0.003445007,0.00001302259,0.00002266868,0.0002262679,0.0000325981,0.9260372,0.05897503,0.01031191,0.0008066889,0.00002402006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8060277,0.0004625006,0.1872981,0.00007232533,0.000008613432,0.00001911973,0.00006039309,0.0001249276,0.00592636],"genre_scores_gemma":[0.9918794,0.0001135725,0.00742437,0.000006610198,0.000004137499,0.000008637256,0.00003805615,0.00001640233,0.0005088333],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0008152424,"threshold_uncertainty_score":0.00357151,"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","authors":[{"name":"R. A. Bailey","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292419,0.0002935723,0.000240494,0.001220559,0.0006895327,0.001328771,0.0005192628,0.0005057151,0.019237],"category_scores_gemma":[0.0009425652,0.0003125526,0.0003604617,0.0007422871,0.0007132412,0.001472885,0.0008069486,0.0007104161,0.001419092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008041917,"about_ca_system_score_gemma":0.0003602744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001149116,"about_ca_topic_score_gemma":0.002920735,"domain_scores_codex":[0.9997602,0.00005250478,0.00001218864,0.00005132413,0.00005424462,0.00006956318],"domain_scores_gemma":[0.9993879,0.0001667192,0.0001041038,0.00007684701,0.0001265773,0.0001378892],"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.00004438517,0.00002394759,0.0002189673,0.00006580405,0.000013851,0.0001216064,0.0002228563,0.00466503,0.002460017,0.9764885,0.005468703,0.01020635],"study_design_scores_gemma":[0.00003195793,0.00001739844,0.0007531452,0.00002889191,0.00001126284,0.0001042045,0.0002126975,0.01880695,0.001113164,0.97082,0.008087914,0.00001255079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4163423,0.00108701,0.4043043,0.001017155,0.0002415378,0.000189707,0.003094653,0.0003561415,0.173367],"genre_scores_gemma":[0.8508242,0.00070316,0.05508052,0.0003885241,0.0001524351,0.000186873,0.002737982,0.0002904463,0.08963601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.019237,"threshold_uncertainty_score":0.06435424,"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","authors":[{"name":"Gérard Cornuéjols","is_ca":false},{"name":"Bertrand Guenin","is_ca":true},{"name":"François Margot","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005313304,0.0008847719,0.001469185,0.001340144,0.001969419,0.003592549,0.001065266,0.001947422,0.02033858],"category_scores_gemma":[0.004860973,0.0007923997,0.001072273,0.001950823,0.002570989,0.007450823,0.002988845,0.005510235,0.004162386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006325051,"about_ca_system_score_gemma":0.0006217613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006596944,"about_ca_topic_score_gemma":0.0004274888,"domain_scores_codex":[0.9990785,0.0001627572,0.00003919531,0.0003239941,0.0002368363,0.000158661],"domain_scores_gemma":[0.9980556,0.0009204155,0.0001793552,0.0003994327,0.000272947,0.0001723098],"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.00001463722,0.00001372689,0.00009407119,0.0000386003,0.000008069122,0.0000434114,0.000064571,0.0005364994,0.0004847307,0.9816782,0.006248363,0.01077518],"study_design_scores_gemma":[0.000004990088,0.000008363586,0.0001304096,0.00001498401,0.00000556373,0.0001619874,0.00003161153,0.002906062,0.0004236356,0.9888205,0.007485407,0.000006502029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0806046,0.002525018,0.41502,0.008898988,0.001607435,0.0001252863,0.001353728,0.0005347276,0.4893304],"genre_scores_gemma":[0.7741303,0.004563248,0.07047098,0.006008275,0.00293406,0.0005151994,0.002008976,0.001004761,0.1383642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02033858,"threshold_uncertainty_score":0.0680393,"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","authors":[{"name":"G. Ge","is_ca":false},{"name":"Rolf S. Rees","is_ca":true},{"name":"Lin Zhu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002076223,0.0007695738,0.0008176386,0.001214496,0.001083043,0.001277178,0.000957139,0.001394754,0.005037648],"category_scores_gemma":[0.008491158,0.0005831982,0.0004058878,0.001091488,0.001091867,0.001647571,0.001353584,0.0009702053,0.001062813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007971654,"about_ca_system_score_gemma":0.0009440226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002423973,"about_ca_topic_score_gemma":0.0004997272,"domain_scores_codex":[0.9986156,0.0006049575,0.00007897167,0.0001678438,0.0002289859,0.0003036243],"domain_scores_gemma":[0.9940032,0.002249466,0.001124479,0.0017212,0.0004813104,0.0004202577],"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.00593674,0.0004240086,0.009371364,0.0005081729,0.0001515111,0.0009434575,0.0007551299,0.05191537,0.09610306,0.6975933,0.005509319,0.1307886],"study_design_scores_gemma":[0.001547369,0.003937341,0.003831116,0.0002301656,0.0002589298,0.002860026,0.0003802516,0.1843678,0.1234907,0.6526418,0.02628937,0.0001651509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6738259,0.000566176,0.2791271,0.001034466,0.0001256922,0.0003204678,0.0003447176,0.001037252,0.04361825],"genre_scores_gemma":[0.9070809,0.000180291,0.08649848,0.0001796604,0.00005261729,0.000232243,0.0001127604,0.00005184938,0.005611176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005037648,"threshold_uncertainty_score":0.01685256,"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","authors":[{"name":"Julien Penon","is_ca":true},{"name":"Ziad A. El-Sahn","is_ca":true},{"name":"Leslie A. Rusch","is_ca":true},{"name":"Sophie LaRochelle","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237927,0.0003834917,0.0002532641,0.0002627514,0.0002040179,0.0003220559,0.000492245,0.0004838069,0.001034608],"category_scores_gemma":[0.001365087,0.0002238311,0.0002350374,0.0002987743,0.0004941581,0.0004113151,0.0002346496,0.0004065777,0.0002261401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008615383,"about_ca_system_score_gemma":0.001098376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002550517,"about_ca_topic_score_gemma":0.004079583,"domain_scores_codex":[0.9998389,0.00003949831,0.000003401837,0.00001434437,0.00008441837,0.00001930427],"domain_scores_gemma":[0.9996154,0.0002132506,0.00004673433,0.00002813044,0.00008430402,0.00001214121],"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.00001663798,0.00002406756,0.0002038021,0.00004841737,0.00001398495,0.0000252487,0.00002422583,0.9513479,0.01141588,0.03129464,0.0003390354,0.00524605],"study_design_scores_gemma":[0.00000434276,0.000006767707,0.00003121118,0.000002205794,0.000001932298,0.000004442758,0.000002595769,0.9963882,0.001281583,0.002035097,0.0002391998,0.000002448188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07747021,0.0001278688,0.9121465,0.0002340845,0.0000288293,0.00006391962,0.00007661793,0.0001972915,0.009654687],"genre_scores_gemma":[0.4922421,0.0001582225,0.5042706,0.00007873338,0.00001561236,0.0001666569,0.00009495536,0.00009699676,0.002876131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002550517,"threshold_uncertainty_score":0.006250918,"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","authors":[{"name":"W. H. Holzmann","is_ca":true},{"name":"Hadi Kharaghani","is_ca":true},{"name":"B. Tayfeh‐Rezaie","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005217258,0.001078109,0.0006289006,0.001892719,0.001685182,0.002158117,0.0006296895,0.001244652,0.02136425],"category_scores_gemma":[0.003791385,0.0006095535,0.0005053231,0.001557133,0.00216835,0.002737429,0.001581538,0.002585584,0.007486801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001076061,"about_ca_system_score_gemma":0.001044898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0013024,"about_ca_topic_score_gemma":0.001541928,"domain_scores_codex":[0.999009,0.0001676849,0.00005131718,0.0001927003,0.0003452,0.0002340548],"domain_scores_gemma":[0.9984498,0.0005342407,0.0001797094,0.0003515562,0.0003530392,0.0001315992],"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.00003186825,0.00001256817,0.00005402877,0.00001867277,0.000003919949,0.00007566871,0.0001015465,0.000687523,0.001591492,0.9838832,0.002403956,0.01113556],"study_design_scores_gemma":[0.0000127477,0.00003203937,0.0001454889,0.00003204065,0.000007310726,0.0002213362,0.00004882631,0.003198317,0.004693266,0.9632824,0.02830114,0.00002514957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1552432,0.001800738,0.2741715,0.003502931,0.001528124,0.0001936995,0.0007340393,0.0007393677,0.5620864],"genre_scores_gemma":[0.6829434,0.001993663,0.06344537,0.001616817,0.0008523348,0.0001936812,0.0004327793,0.0004156641,0.2481063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02136425,"threshold_uncertainty_score":0.0714705,"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","authors":[{"name":"Matthew A. Graydon","is_ca":true},{"name":"D. M. Appleby","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001661097,0.0004677677,0.0005926818,0.001276679,0.001699636,0.002849747,0.0007158424,0.001157461,0.008627954],"category_scores_gemma":[0.003537377,0.0004527149,0.0009290663,0.001063592,0.003268832,0.002512567,0.002596671,0.001334317,0.001147672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001123371,"about_ca_system_score_gemma":0.0008351623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002949563,"about_ca_topic_score_gemma":0.000327051,"domain_scores_codex":[0.9976321,0.0006790882,0.0001957666,0.0004851748,0.0006197886,0.0003879799],"domain_scores_gemma":[0.9973922,0.0006246364,0.0003813205,0.0007312649,0.0005540292,0.0003164673],"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.00002976418,0.000007112982,0.0001126503,0.00002096266,0.000005030927,0.00003066483,0.00004407952,0.001153656,0.001073331,0.9921528,0.0003939773,0.004976105],"study_design_scores_gemma":[0.00004241264,0.000132286,0.0003079528,0.000029925,0.00001504753,0.0002279065,0.0001217153,0.01773432,0.004183456,0.9663294,0.01083788,0.00003782915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1796967,0.0005824448,0.7050626,0.0008154322,0.0002872325,0.0002612609,0.0008665133,0.0004916319,0.1119363],"genre_scores_gemma":[0.8430695,0.00041776,0.1382232,0.0005617662,0.0001385164,0.0004242958,0.0004458165,0.0001381814,0.0165811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008627954,"threshold_uncertainty_score":0.02886337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}