{"meta":{"query_hash":"13ca66a5513b","filters":{"venue":"Information and Inference A Journal of the IMA"},"cohort_total":17,"direct_labels_cover":0,"predictions_cover":17,"exported":17,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/13ca66a5513b","api":"https://metacan.xera.ac/api/v1/cohort?venue=Information+and+Inference+A+Journal+of+the+IMA"},"results":[{"id":"W2471497375","doi":"10.1093/imaiai/iax009","title":"One-bit compressive sensing of dictionary-sparse signals","year":2017,"lang":"en","type":"preprint","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Army Research Office; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Compressed sensing; Computer science; Orthonormal basis; Basis pursuit; Algorithm; Sparse approximation; Sparse matrix; Quantization (signal processing); Basis (linear algebra); Thresholding; Gaussian; Artificial intelligence; Mathematics","score_opus":0.034524037921345015,"score_gpt":0.26906485016661025,"score_spread":0.23454081224526524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471497375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013823056,0.00029184524,0.9822786,0.0004125234,0.000070896545,0.000027981105,0.00009266074,0.00012550574,0.002877035],"genre_scores_gemma":[0.7196495,0.0010688414,0.27261248,0.00057467807,0.00027455942,0.00010511567,0.00030749125,0.00012262669,0.005284752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874383,0.0004413771,0.000058176032,0.00026744694,0.00036112487,0.00012798954],"domain_scores_gemma":[0.99672973,0.0018615972,0.00032807255,0.0006435683,0.0003282478,0.000108770015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001625792,0.00079170876,0.0010999622,0.000577407,0.00036551716,0.0015998847,0.0012397913,0.0013785904,0.003212275],"category_scores_gemma":[0.007125321,0.00034351,0.00042700983,0.0009632619,0.0019655048,0.0026458672,0.0019291642,0.0021406831,0.00059936556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005018155,0.00010520441,0.00069274654,0.00038146492,0.00006497107,0.0002116886,0.0001506498,0.36579943,0.019338591,0.5151324,0.00467219,0.09294878],"study_design_scores_gemma":[0.000012599264,0.00003558688,0.00009294683,0.000026795964,0.000006947928,0.00008811828,0.000018820314,0.8921808,0.0038260361,0.102493145,0.0012041728,0.000013900474],"about_ca_topic_score_codex":0.00070321007,"about_ca_topic_score_gemma":0.00062075024,"teacher_disagreement_score":0.003212275,"about_ca_system_score_codex":0.0006509319,"about_ca_system_score_gemma":0.00076022424,"threshold_uncertainty_score":0.010746121},"labels":[],"label_agreement":null},{"id":"W2768739050","doi":"10.1093/imaiai/iay019","title":"Near-optimal sample complexity for convex tensor completion","year":2018,"lang":"en","type":"preprint","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Tensor (intrinsic definition); Minimax; Combinatorics; Matrix norm; Rank (graph theory); Norm (philosophy); Matrix completion; Regular polygon; Low-rank approximation; Mathematical optimization; Pure mathematics; Physics; Geometry","score_opus":0.049308365212291816,"score_gpt":0.28183863281078586,"score_spread":0.23253026759849404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768739050","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034329433,0.00052328536,0.9608089,0.0012491957,0.000061406194,0.000069285015,0.00029809817,0.00057312706,0.0020872678],"genre_scores_gemma":[0.54170394,0.0005177882,0.4509336,0.00048051082,0.00023184609,0.00025815878,0.0012171419,0.00049929944,0.0041576973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959204,0.0019173931,0.00020026106,0.0007349235,0.0009003664,0.00032650607],"domain_scores_gemma":[0.9739379,0.020347012,0.0012103126,0.002511021,0.0014059475,0.0005877244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051655523,0.001482724,0.0018688828,0.0007051139,0.0006689197,0.0019162428,0.0019649775,0.0017480346,0.003962801],"category_scores_gemma":[0.029826509,0.00075190404,0.00077996746,0.0011440193,0.002594152,0.0043124473,0.0024313233,0.0031055566,0.0007883447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001067238,0.00019183711,0.0016406265,0.00046450226,0.00012088139,0.00021934116,0.00019999524,0.8309928,0.007490658,0.09003337,0.0056376536,0.061941095],"study_design_scores_gemma":[0.000014824818,0.00004381584,0.00014825053,0.000009285784,0.00000515248,0.000027008162,0.000017945682,0.96842635,0.0011291931,0.0298378,0.00033182692,0.000008501568],"about_ca_topic_score_codex":0.004242481,"about_ca_topic_score_gemma":0.005022215,"teacher_disagreement_score":0.0051655523,"about_ca_system_score_codex":0.0021732026,"about_ca_system_score_gemma":0.0025977867,"threshold_uncertainty_score":0.027318358},"labels":[],"label_agreement":null},{"id":"W2806337688","doi":"10.1093/imaiai/iaaa007","title":"On oracle-type local recovery guarantees in compressed sensing","year":2020,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Minification; Sampling (signal processing); Nyquist–Shannon sampling theorem; Coherence (philosophical gambling strategy); Wavelet; Oracle; Dimension (graph theory); Haar wavelet; SIGNAL (programming language)","score_opus":0.015683203423382395,"score_gpt":0.2246411339346488,"score_spread":0.2089579305112664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806337688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010488396,0.00046418366,0.98491514,0.00046734515,0.00003884246,0.000039580584,0.00010981318,0.00020898349,0.0032677797],"genre_scores_gemma":[0.6836421,0.0014416869,0.30775994,0.00066014135,0.00039687846,0.00036262634,0.00053763733,0.0004401484,0.0047587077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523526,0.001931065,0.00016163722,0.00050826155,0.0017796083,0.0003841797],"domain_scores_gemma":[0.95468324,0.0379633,0.0016025065,0.0031656758,0.001962785,0.0006223921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071928753,0.0015663092,0.0016273096,0.0013977041,0.0005970906,0.001850013,0.0022762117,0.0015686211,0.0044969027],"category_scores_gemma":[0.04688422,0.0006178113,0.00087299116,0.0014236674,0.0032308365,0.00477155,0.00416226,0.0042674458,0.0007397894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006056078,0.00012478155,0.000829318,0.00037619346,0.00006866267,0.00021562775,0.0002501327,0.4898891,0.01129681,0.43426752,0.003794301,0.058282033],"study_design_scores_gemma":[0.00001891456,0.000066338085,0.00015577154,0.000021944894,0.000007937089,0.000035926303,0.000016557009,0.9363964,0.0020000013,0.060664997,0.0006016839,0.0000135001565],"about_ca_topic_score_codex":0.0018385777,"about_ca_topic_score_gemma":0.0018343009,"teacher_disagreement_score":0.0071928753,"about_ca_system_score_codex":0.0017714133,"about_ca_system_score_gemma":0.0014022874,"threshold_uncertainty_score":0.038040042},"labels":[],"label_agreement":null},{"id":"W2962684393","doi":"10.1093/imaiai/iav001","title":"Graph connection Laplacian and random matrices with random blocks","year":2015,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Connection (principal bundle); Random graph; Mathematics; Laplacian matrix; Graph; Combinatorics; Computer science; Geometry","score_opus":0.024046796891924953,"score_gpt":0.28013923201228547,"score_spread":0.2560924351203605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962684393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07612631,0.0016233604,0.90935665,0.0023088793,0.00013754556,0.00007309819,0.00051928137,0.00042337528,0.009431428],"genre_scores_gemma":[0.8871165,0.0019505358,0.097106375,0.0008164151,0.0005262496,0.0003373676,0.00081090344,0.00020658868,0.011129106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886996,0.00052151864,0.000028759878,0.00025102557,0.00022114784,0.00010750661],"domain_scores_gemma":[0.9934237,0.0041647907,0.0008741789,0.0006632074,0.0005467436,0.00032723954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015287604,0.00062686775,0.0006539493,0.0016503141,0.0005952754,0.0012521298,0.0010866004,0.0014872334,0.0034367072],"category_scores_gemma":[0.013830746,0.0003889231,0.0005666148,0.0014601662,0.0023683999,0.0027480558,0.0010662113,0.0012593786,0.0007504978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055799494,0.000041096006,0.0017211131,0.00012317668,0.000055107186,0.0002875084,0.0001584029,0.15795164,0.0024605256,0.8191568,0.0047008637,0.013288005],"study_design_scores_gemma":[0.000012641844,0.00003066113,0.0007814585,0.000020289053,0.000010794689,0.00015848903,0.000032770535,0.5233263,0.00040575417,0.472718,0.0024755779,0.00002731386],"about_ca_topic_score_codex":0.002474395,"about_ca_topic_score_gemma":0.0023101235,"teacher_disagreement_score":0.0034367072,"about_ca_system_score_codex":0.0011013913,"about_ca_system_score_gemma":0.0006777566,"threshold_uncertainty_score":0.011496961},"labels":[],"label_agreement":null},{"id":"W3078707548","doi":"10.1093/imaiai/iaaa014","title":"Sensitivity of ℓ1 minimization to parameter choice","year":2020,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Lasso (programming language); Minimax; Regularization (linguistics); Stability (learning theory); Minification; Computer science; Sensitivity (control systems); Value (mathematics); Mathematical optimization; Algorithm; Mathematics; Applied mathematics; Machine learning; Artificial intelligence","score_opus":0.020331169196309222,"score_gpt":0.24109894219256156,"score_spread":0.22076777299625233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3078707548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5391818,0.0043680095,0.4177056,0.009535948,0.00037944765,0.00033832784,0.0010666879,0.0014509561,0.025973303],"genre_scores_gemma":[0.9711307,0.0005409975,0.025186868,0.00057902007,0.000058647678,0.00016203494,0.0003835374,0.00023386831,0.0017242813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566406,0.0025442997,0.00020879417,0.0006125012,0.00060898584,0.000361329],"domain_scores_gemma":[0.9127157,0.075465284,0.0038686485,0.0043352805,0.002589102,0.0010260748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013079885,0.0012832963,0.0013991465,0.0012208523,0.0009381446,0.002060899,0.0014416216,0.0026451817,0.0025613704],"category_scores_gemma":[0.09558738,0.00084062293,0.00077058794,0.00073121034,0.0029573205,0.002312789,0.00217451,0.0032507605,0.0005255345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007784507,0.00013795828,0.007030178,0.00033780368,0.00023874569,0.00028192592,0.00021009461,0.91470903,0.004176591,0.04607752,0.00548885,0.020532893],"study_design_scores_gemma":[0.000058338628,0.0001325057,0.0016671127,0.00016498119,0.000038889862,0.00014593611,0.00016068305,0.9508716,0.003472257,0.041745868,0.0014789292,0.00006293801],"about_ca_topic_score_codex":0.0033086922,"about_ca_topic_score_gemma":0.0017463472,"teacher_disagreement_score":0.013079885,"about_ca_system_score_codex":0.0014029244,"about_ca_system_score_gemma":0.0013127633,"threshold_uncertainty_score":0.06917387},"labels":[],"label_agreement":null},{"id":"W3088799486","doi":"10.1093/imaiai/iaab027","title":"Strong replica symmetry for high-dimensional disordered log-concave Gibbs measures","year":2021,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Replica; Mathematics; Inference; Gibbs measure; Regular polygon; Decoupling (probability); Gibbs sampling; Applied mathematics; Statistical physics; Mathematical analysis; Statistics; Computer science; Bayesian probability; Physics; Geometry; Artificial intelligence","score_opus":0.05467278135402242,"score_gpt":0.3396268383534964,"score_spread":0.28495405699947396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088799486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3758707,0.00042320348,0.6057317,0.0015771443,0.00009274576,0.00009818108,0.00026210674,0.00027382554,0.015670346],"genre_scores_gemma":[0.98174506,0.00013918667,0.014993203,0.0002357317,0.00007474507,0.00009464084,0.00009759571,0.000066166736,0.0025535012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990226,0.0003560424,0.000041660183,0.00016911424,0.000256585,0.0001540524],"domain_scores_gemma":[0.9931779,0.0040758997,0.0007795537,0.0008355514,0.0005547777,0.0005763042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033273627,0.00056381826,0.0010356727,0.0010600691,0.00089615036,0.0019817792,0.0017861675,0.0014419999,0.0038012823],"category_scores_gemma":[0.013402039,0.0005176239,0.0008886483,0.0004005448,0.0042244145,0.0029297003,0.0016674792,0.0017566384,0.00033504848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038468934,0.000033160908,0.0008883383,0.000043091917,0.000019477991,0.00029517655,0.00012374044,0.03731636,0.0021887335,0.9570278,0.0006990175,0.0013266285],"study_design_scores_gemma":[0.000022047303,0.000022869926,0.00048195868,0.000013452616,0.000005472354,0.00014224896,0.00004697561,0.49097526,0.000761715,0.5070888,0.0004185637,0.000020720612],"about_ca_topic_score_codex":0.001536313,"about_ca_topic_score_gemma":0.000953494,"teacher_disagreement_score":0.0038012823,"about_ca_system_score_codex":0.0013421118,"about_ca_system_score_gemma":0.00073504593,"threshold_uncertainty_score":0.01759702},"labels":[],"label_agreement":null},{"id":"W3151137625","doi":"10.1093/imaiai/iaab002","title":"A model of double descent for high-dimensional binary linear classification","year":2021,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Kappa; Gradient descent; Mathematics; Support vector machine; Binary classification; Binary number; Linear classifier; Linear regression; Gaussian; Logistic regression; Applied mathematics; Artificial intelligence; Pattern recognition (psychology); Statistics; Computer science; Physics; Geometry; Artificial neural network","score_opus":0.051562028037794805,"score_gpt":0.268477240208541,"score_spread":0.21691521217074622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151137625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12126844,0.000524746,0.86710405,0.004138412,0.00010624404,0.00008333308,0.00027595478,0.00047747625,0.0060213427],"genre_scores_gemma":[0.9440615,0.00020061915,0.044712063,0.00052294444,0.00010426871,0.00020668785,0.00020555442,0.00009132912,0.009895009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997951,0.0009350509,0.000069669455,0.00036881826,0.00037693063,0.0002986209],"domain_scores_gemma":[0.9911343,0.0061635305,0.00075775315,0.00069969514,0.00086246047,0.00038221793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005570435,0.00066349114,0.0015859054,0.0007643175,0.00074482564,0.0018859663,0.0026097354,0.002750706,0.0038706174],"category_scores_gemma":[0.017866794,0.0007602061,0.0007208851,0.0007930864,0.003223745,0.002932688,0.0017835202,0.0025232201,0.0008620187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027695994,0.000104487655,0.0023221131,0.0001052664,0.00005167347,0.0002931624,0.00022065721,0.6798547,0.0018266228,0.29721978,0.0041436115,0.013581023],"study_design_scores_gemma":[0.000014729977,0.000015531006,0.00011195514,0.000006837675,0.0000021117423,0.0000189185,0.000005817133,0.9760266,0.00012434828,0.023487,0.00017995959,0.00000624675],"about_ca_topic_score_codex":0.0050975834,"about_ca_topic_score_gemma":0.003991141,"teacher_disagreement_score":0.005570435,"about_ca_system_score_codex":0.0021950891,"about_ca_system_score_gemma":0.0010931888,"threshold_uncertainty_score":0.029459655},"labels":[],"label_agreement":null},{"id":"W3160701863","doi":"10.1093/imaiai/iaab007","title":"Distributed information-theoretic clustering","year":2021,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Vienna Science and Technology Fund; Arizona State University","keywords":"Information bottleneck method; Mutual information; Constraint (computer-aided design); Cluster analysis; Encoder; Bottleneck; Computer science; Binary number; Combinatorics; Information theory; Characterization (materials science); Cardinality (data modeling); Independence (probability theory); Mathematics; Discrete mathematics; Algorithm; Data mining; Artificial intelligence; Statistics; Physics","score_opus":0.008085186106822037,"score_gpt":0.232273134839672,"score_spread":0.22418794873284995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160701863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033370066,0.0003945618,0.9608418,0.0008454148,0.000035361278,0.00008435166,0.0003892765,0.00019765002,0.0038414993],"genre_scores_gemma":[0.8559885,0.0005591553,0.13539515,0.0003499392,0.00019321698,0.0003365454,0.0011365592,0.0001312471,0.00590961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954325,0.0021259526,0.00016839664,0.0010168124,0.0008865543,0.00036987566],"domain_scores_gemma":[0.98030967,0.0140300905,0.0012718497,0.0025964917,0.0013217516,0.00047026254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004597408,0.0009865058,0.002503986,0.0017961176,0.00092763593,0.002123721,0.003690494,0.0022287627,0.002643118],"category_scores_gemma":[0.022727543,0.00092843396,0.0009227079,0.0023707647,0.002724928,0.0038898718,0.0032797875,0.0020653827,0.0007767303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016830774,0.000063295265,0.0006407036,0.0001274667,0.00008394078,0.00011977815,0.0001530225,0.75900465,0.0011823626,0.22108288,0.0022792697,0.015094342],"study_design_scores_gemma":[0.000016297943,0.00001393734,0.00011305272,0.000009526991,0.0000070765714,0.000023804185,0.000018732415,0.9025324,0.0004104626,0.09639133,0.00045043585,0.00001292536],"about_ca_topic_score_codex":0.0018288429,"about_ca_topic_score_gemma":0.0014720388,"teacher_disagreement_score":0.004597408,"about_ca_system_score_codex":0.0033042075,"about_ca_system_score_gemma":0.0015126235,"threshold_uncertainty_score":0.024313748},"labels":[],"label_agreement":null},{"id":"W3182878663","doi":"10.1093/imaiai/iaaf019","title":"Performance of Bayesian linear regression in a model with mismatch","year":2025,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Control Systems and Identification","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Bayesian linear regression; Bayesian multivariate linear regression; Bayesian probability; Linear regression; Proper linear model; Regression; Statistics; Linear model; Regression analysis; Econometrics; General linear model; Computer science; Mathematics; Bayesian inference","score_opus":0.005053991288399349,"score_gpt":0.21409594950855465,"score_spread":0.2090419582201553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182878663","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20220111,0.001943508,0.7903821,0.0020370218,0.00007571683,0.000051163195,0.00021992857,0.0008160082,0.0022735065],"genre_scores_gemma":[0.9398934,0.00044437952,0.05580812,0.00035413232,0.00010312672,0.000071393064,0.0005129263,0.00016956667,0.002643015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9893847,0.0072138617,0.00030526906,0.0015191468,0.0010649767,0.0005119725],"domain_scores_gemma":[0.95298105,0.03901691,0.002999587,0.0023553045,0.0019125659,0.00073458394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02525855,0.001377305,0.0031475602,0.0008953895,0.00072663714,0.0027458628,0.0024662614,0.0031682733,0.0016642959],"category_scores_gemma":[0.06735358,0.0010093432,0.0010488564,0.00092843175,0.0033118955,0.004477999,0.0038101205,0.0026530747,0.0007872997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082958693,0.000105973406,0.0040120296,0.00013945681,0.00022278544,0.000087169596,0.00013375294,0.9431595,0.001527838,0.029067872,0.00078166876,0.019932354],"study_design_scores_gemma":[0.00001372761,0.000053747764,0.00054282875,0.00001462741,0.000010356294,0.000017292316,0.000012590186,0.99044514,0.00042106656,0.008331622,0.00011635166,0.000020611691],"about_ca_topic_score_codex":0.01106477,"about_ca_topic_score_gemma":0.0034210407,"teacher_disagreement_score":0.02525855,"about_ca_system_score_codex":0.0019233851,"about_ca_system_score_gemma":0.0016675347,"threshold_uncertainty_score":0.13358158},"labels":[],"label_agreement":null},{"id":"W4213048988","doi":"10.1093/imaiai/iaac004","title":"An analysis of classical multidimensional scaling with applications to clustering","year":2022,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Institute of Dental and Craniofacial Research; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; National Science Foundation","keywords":"Cluster analysis; Scaling; Multidimensional scaling; Statistical physics; Scaling law; Econometrics; Computer science; Physics; Economics; Mathematics; Artificial intelligence; Machine learning; Geometry","score_opus":0.014548756245397169,"score_gpt":0.27289479637366815,"score_spread":0.258346040128271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213048988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006713323,0.0018464166,0.9868832,0.0007863572,0.00013718498,0.00006286263,0.00010244671,0.000121234356,0.0033469377],"genre_scores_gemma":[0.39700186,0.004809596,0.58852196,0.0011193795,0.0013933446,0.0005957406,0.0005858814,0.0003671307,0.005605083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99276966,0.0028849307,0.00031570406,0.0009931412,0.0027564429,0.00028007492],"domain_scores_gemma":[0.9714515,0.017988646,0.0018901032,0.0031468736,0.004883395,0.00063947676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012211969,0.0013914309,0.0014387792,0.005950406,0.0017276413,0.0030601942,0.0022333805,0.0016294911,0.0028036078],"category_scores_gemma":[0.054902043,0.0007011981,0.0019622021,0.0049784016,0.005150939,0.0042105247,0.0037883199,0.00309853,0.00062733603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005413674,0.0000388832,0.0015588208,0.0003566856,0.00014686535,0.00017624277,0.00038156545,0.11537624,0.0018411468,0.82313013,0.003238483,0.053700827],"study_design_scores_gemma":[0.0000075292373,0.000046019624,0.0011114876,0.00007879862,0.000027171602,0.0001272186,0.000074639116,0.53684723,0.0007893124,0.45644066,0.004400677,0.00004934182],"about_ca_topic_score_codex":0.001982499,"about_ca_topic_score_gemma":0.0010281742,"teacher_disagreement_score":0.012211969,"about_ca_system_score_codex":0.00255715,"about_ca_system_score_gemma":0.0015421449,"threshold_uncertainty_score":0.06458378},"labels":[],"label_agreement":null},{"id":"W4226000139","doi":"10.1093/imaiai/iaae002","title":"PACMAN: PAC-style bounds accounting for the Mismatch between Accuracy and Negative log-loss","year":2024,"lang":"en","type":"preprint","venue":"Information and Inference A Journal of the IMA","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"Universidad de Buenos Aires; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Generalization; Computer science; Algorithm; Function (biology); Metric (unit); Generalization error; Cross entropy; Mathematics; Artificial intelligence; Artificial neural network; Pattern recognition (psychology)","score_opus":0.026705443778082257,"score_gpt":0.3117600080436237,"score_spread":0.28505456426554143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226000139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009195805,0.003957774,0.9745256,0.0018515902,0.0003528356,0.000092743736,0.00020191615,0.00060746487,0.009214236],"genre_scores_gemma":[0.5282773,0.005416223,0.44166344,0.0039943405,0.002855089,0.0010790363,0.0011452383,0.0023044324,0.013264919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9832877,0.007312021,0.00062036223,0.00264647,0.004962434,0.0011711327],"domain_scores_gemma":[0.88382214,0.090707615,0.00547465,0.009789803,0.007827314,0.0023785047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024848418,0.004331615,0.0033428292,0.0038376697,0.0016995345,0.006832949,0.006726512,0.005011387,0.007431084],"category_scores_gemma":[0.14787611,0.0014246622,0.0021734063,0.003392784,0.0071981316,0.015373192,0.009457663,0.011654774,0.0022366205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061823346,0.0002454533,0.0029275964,0.0006724859,0.00022654145,0.00045030337,0.00042385538,0.2804542,0.0026637467,0.5941796,0.016465073,0.10067306],"study_design_scores_gemma":[0.00001523635,0.00014708651,0.0004273937,0.00016457346,0.000043812128,0.00021997845,0.000037242033,0.75053126,0.0020610564,0.24348514,0.0028236918,0.00004362988],"about_ca_topic_score_codex":0.0018239158,"about_ca_topic_score_gemma":0.0012355185,"teacher_disagreement_score":0.024848418,"about_ca_system_score_codex":0.0051936037,"about_ca_system_score_gemma":0.0037564235,"threshold_uncertainty_score":0.13141257},"labels":[],"label_agreement":null},{"id":"W4366682198","doi":"10.1093/imaiai/iaad007","title":"Third-order moment varieties of linear non-Gaussian graphical models","year":2023,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"European Research Council","keywords":"Algebraic number; Gaussian; Mathematics; Graph; Graphical model; Polytope; Moment (physics); Ideal (ethics); Order (exchange); Discrete mathematics; Mathematical analysis","score_opus":0.02198218244826054,"score_gpt":0.26393061856571126,"score_spread":0.24194843611745073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366682198","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31943077,0.0006850531,0.6581668,0.0012220355,0.00009716448,0.000071358816,0.00048735563,0.0003838496,0.01945559],"genre_scores_gemma":[0.9688154,0.00034642598,0.025590086,0.0001263101,0.00017711315,0.00005953683,0.00020414781,0.00008356441,0.0045974352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860865,0.00047125353,0.000049631402,0.00020214255,0.00037806062,0.00029025198],"domain_scores_gemma":[0.9951384,0.0026139158,0.0010557706,0.00032161098,0.00042652732,0.00044372113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020369182,0.0005955975,0.0010193227,0.002282043,0.0010173502,0.0024480345,0.0009858073,0.0006345045,0.003911957],"category_scores_gemma":[0.005672626,0.00044051892,0.0016492028,0.0010297063,0.0035016995,0.0024492305,0.001495288,0.0019107378,0.00043186528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019675368,0.000017210396,0.0003944512,0.000018586668,0.000010578373,0.000081320235,0.00013565004,0.01476168,0.00044294563,0.98206824,0.00035119237,0.0016984399],"study_design_scores_gemma":[0.000008870738,0.000021589769,0.00033007533,0.0000111444315,0.0000066647167,0.00007724828,0.00006273549,0.113557644,0.00031450897,0.88459927,0.0009875849,0.00002262446],"about_ca_topic_score_codex":0.0018755061,"about_ca_topic_score_gemma":0.0012368049,"teacher_disagreement_score":0.003911957,"about_ca_system_score_codex":0.0016399941,"about_ca_system_score_gemma":0.00093658705,"threshold_uncertainty_score":0.013086736},"labels":[],"label_agreement":null},{"id":"W4382811464","doi":"10.1093/imaiai/iaad024","title":"Multivariate super-resolution without separation","year":2023,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Measure (data warehouse); Point spread function; Point (geometry); Gaussian; Generalization; Function (biology); Point process; Mathematics; Image (mathematics); Resolution (logic); Algorithm; Regular polygon; Applied mathematics; Computer science; Mathematical optimization; Mathematical analysis; Artificial intelligence; Physics; Statistics; Geometry","score_opus":0.01995799000048502,"score_gpt":0.2832194905943124,"score_spread":0.26326150059382736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382811464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011566248,0.00029299973,0.9855795,0.00044472393,0.000024105484,0.000013020116,0.0000658468,0.00006699385,0.0019466635],"genre_scores_gemma":[0.6041136,0.0010241013,0.38442472,0.00057088333,0.00030668124,0.000076173616,0.00032625286,0.00010553,0.00905215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992773,0.00023781417,0.000024349032,0.00017755458,0.00022081414,0.000062206615],"domain_scores_gemma":[0.99834394,0.0009712734,0.00021597071,0.00021581136,0.0001768295,0.00007614609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013574337,0.0006590924,0.0009220488,0.00043715455,0.00023585906,0.0009073214,0.00085797184,0.0012772828,0.0017076635],"category_scores_gemma":[0.0032656407,0.0004243576,0.0005560457,0.00079263165,0.0013348267,0.0020075114,0.0016366318,0.0019373298,0.00038026806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002637725,0.00008348342,0.0008608327,0.0003015968,0.00015747442,0.00044005766,0.000116518255,0.6634353,0.023824463,0.24386862,0.004381947,0.06226602],"study_design_scores_gemma":[0.000008446246,0.00001721628,0.0001789685,0.0000065508425,0.0000062743475,0.00008088358,0.00001019566,0.9680075,0.001928097,0.028916985,0.0008317418,0.000007225408],"about_ca_topic_score_codex":0.0019245846,"about_ca_topic_score_gemma":0.0015869751,"teacher_disagreement_score":0.0019245846,"about_ca_system_score_codex":0.00063528056,"about_ca_system_score_gemma":0.0006131548,"threshold_uncertainty_score":0.0071789026},"labels":[],"label_agreement":null},{"id":"W4391592471","doi":"10.1093/imaiai/iaad056","title":"Statistical inference with regularized optimal transport","year":2024,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Estimator; Consistency (knowledge bases); Statistical inference; Inference; Flexibility (engineering); Limit (mathematics); Mathematical optimization; Computer science; Smoothing; Mathematics; Probability distribution; Algorithm; Applied mathematics; Artificial intelligence; Statistics","score_opus":0.03608366168691175,"score_gpt":0.35146102116916816,"score_spread":0.3153773594822564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391592471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010136361,0.00018477024,0.98837984,0.00023080382,0.000023402421,0.000023102193,0.000087649474,0.00014463183,0.00078942766],"genre_scores_gemma":[0.5379025,0.0006419866,0.45524153,0.00041762737,0.00022659865,0.00029187193,0.0006988135,0.000359984,0.004219259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564016,0.002455041,0.00026930365,0.0007808949,0.00066229684,0.00019232945],"domain_scores_gemma":[0.97366345,0.01848803,0.0020623314,0.003414882,0.0019281852,0.00044314502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010540698,0.0009526196,0.0015536286,0.002353589,0.0006641504,0.0022713696,0.00251504,0.0018067671,0.0025936696],"category_scores_gemma":[0.050297074,0.0007955487,0.0014202555,0.0017046154,0.0040601282,0.0049529634,0.0032272097,0.0028549563,0.0003467453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006589501,0.000032376698,0.0011527974,0.00010719885,0.000083639796,0.0001330041,0.00008882038,0.2567526,0.0006673938,0.72537357,0.00084756606,0.0146951815],"study_design_scores_gemma":[0.000008564908,0.000018276562,0.00021075783,0.000021291085,0.0000098978,0.000028853354,0.000014255304,0.68676454,0.000328301,0.31207427,0.00050776196,0.000013190869],"about_ca_topic_score_codex":0.0044939723,"about_ca_topic_score_gemma":0.0024878273,"teacher_disagreement_score":0.010540698,"about_ca_system_score_codex":0.002339291,"about_ca_system_score_gemma":0.0021982766,"threshold_uncertainty_score":0.055745184},"labels":[],"label_agreement":null},{"id":"W4403162617","doi":"10.1093/imaiai/iaae023","title":"Statistical inference for sketching algorithms","year":2024,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Sketch; Inference; Computer science; Algorithm; Set (abstract data type); Data set; Sampling (signal processing); Statistical inference; Mathematics; Statistics; Artificial intelligence","score_opus":0.019625975934582,"score_gpt":0.32757539395024937,"score_spread":0.3079494180156674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403162617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035796098,0.00017078535,0.9952859,0.000153457,0.000018952946,0.00005040237,0.00007387538,0.00010390811,0.00056313985],"genre_scores_gemma":[0.21908723,0.0009084708,0.7752341,0.00029927437,0.0002337528,0.00067362515,0.00084376184,0.00024635802,0.002473488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9872937,0.0073258607,0.0007205178,0.0023446453,0.0019118189,0.00040348334],"domain_scores_gemma":[0.83462405,0.13954316,0.0059599606,0.013444722,0.0051399735,0.0012880785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025452092,0.0014865764,0.0029001518,0.0039281542,0.001188219,0.0037376832,0.0036815004,0.002619954,0.008806612],"category_scores_gemma":[0.18551448,0.0018115237,0.0023705235,0.0027757105,0.0070472863,0.009012167,0.0051415744,0.0054846713,0.0012020253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013917078,0.00005764132,0.0024504687,0.0002613711,0.00012141527,0.00010543412,0.00022167496,0.18971266,0.00091745914,0.7437812,0.0020051738,0.06022625],"study_design_scores_gemma":[0.000042596104,0.00004096228,0.00035767726,0.00010104815,0.000018281627,0.000058138634,0.000025930953,0.5270714,0.00060521736,0.4701967,0.0014513391,0.000030800846],"about_ca_topic_score_codex":0.001775014,"about_ca_topic_score_gemma":0.0014313462,"teacher_disagreement_score":0.025452092,"about_ca_system_score_codex":0.0020440288,"about_ca_system_score_gemma":0.0018639838,"threshold_uncertainty_score":0.13460511},"labels":[],"label_agreement":null},{"id":"W4403585525","doi":"10.1093/imaiai/iaae028","title":"Hitting the High-dimensional notes: an ODE for SGD learning dynamics on GLMs and multi-index models","year":2024,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Israel Science Foundation; Canadian Institute for Advanced Research","keywords":"Ode; Index (typography); Dynamics (music); Econometrics; Artificial intelligence; Statistical physics; Computer science; Mathematics; Physics; Applied mathematics","score_opus":0.023443340076124308,"score_gpt":0.2753627054817372,"score_spread":0.2519193654056129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403585525","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09577498,0.00069736876,0.8898723,0.0026477352,0.00015581651,0.000054866945,0.0001988773,0.00024916793,0.010348794],"genre_scores_gemma":[0.9155753,0.0006830004,0.06716822,0.0006016569,0.00014064582,0.00017226403,0.00018632755,0.00016847506,0.015304111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995759,0.00016257814,0.000027815246,0.00008182064,0.00010913377,0.000042754316],"domain_scores_gemma":[0.99789774,0.0010941542,0.00030333883,0.00014857049,0.0003111106,0.00024508874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018672327,0.0005489073,0.0008927959,0.0008816666,0.000608231,0.0016436231,0.0010853042,0.001916252,0.0038353847],"category_scores_gemma":[0.009682279,0.0004096366,0.00087800977,0.00045960766,0.0027864194,0.0023585823,0.0022556505,0.0017894334,0.00040572247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040430255,0.00003486672,0.0015095513,0.00008613424,0.000039449384,0.00021716404,0.00018971846,0.46812966,0.0035874022,0.51692456,0.0022183487,0.0070227175],"study_design_scores_gemma":[0.0000038170633,0.0000073196843,0.00010242964,0.000006623886,0.0000023613418,0.000018215696,0.000008323965,0.962591,0.00009815144,0.036890276,0.00026541713,0.000006130558],"about_ca_topic_score_codex":0.0048890417,"about_ca_topic_score_gemma":0.0025864942,"teacher_disagreement_score":0.0048890417,"about_ca_system_score_codex":0.00156274,"about_ca_system_score_gemma":0.00085877086,"threshold_uncertainty_score":0.012830615},"labels":[],"label_agreement":null},{"id":"W4406502827","doi":"10.1093/imaiai/iaae034","title":"Differentially private low-dimensional synthetic data from high-dimensional datasets","year":2025,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Curse of dimensionality; Principal component analysis; Synthetic data; Intrinsic dimension; Covariance; Computer science; Clustering high-dimensional data; Key (lock); Dimension (graph theory); Algorithm; Covariance matrix; Data mining; Artificial intelligence; Mathematics; Statistics","score_opus":0.020406553467568554,"score_gpt":0.272225933458451,"score_spread":0.25181937999088244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406502827","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03337327,0.00014048484,0.9630647,0.0010922357,0.000059238373,0.00009248091,0.00042681396,0.00031254874,0.0014383302],"genre_scores_gemma":[0.8102618,0.00025411745,0.18533336,0.00046800234,0.00014594017,0.00024596247,0.0011827869,0.000085425425,0.0020226208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99390393,0.0031522445,0.00026160514,0.00073503866,0.0016420783,0.0003050504],"domain_scores_gemma":[0.9812918,0.009428673,0.0013259616,0.006464489,0.0010847297,0.00040433253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072162147,0.00067525473,0.0011192274,0.00082920596,0.0009810199,0.0021770606,0.0018005711,0.001596008,0.0019585274],"category_scores_gemma":[0.029625952,0.0005508077,0.00090117106,0.0013270463,0.0027793823,0.0039457143,0.0046437387,0.0029843566,0.0006160769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001109948,0.00020389198,0.0039454824,0.0002121743,0.00013123079,0.00041315757,0.0003711685,0.53891134,0.0155259175,0.35223845,0.0055040414,0.08143319],"study_design_scores_gemma":[0.00003649649,0.00007454228,0.00038652873,0.00002011288,0.000011247002,0.00019228016,0.000050184735,0.83535737,0.007642143,0.15429407,0.0019135892,0.000021422977],"about_ca_topic_score_codex":0.00040993228,"about_ca_topic_score_gemma":0.00033943087,"teacher_disagreement_score":0.0072162147,"about_ca_system_score_codex":0.0014253733,"about_ca_system_score_gemma":0.0013184651,"threshold_uncertainty_score":0.038163424},"labels":[],"label_agreement":null}]}