{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"ce5bd5d334df","filters":{"venue":"French digital mathematics library (Numdam)"}},"results":[{"id":"W2963579298","doi":"","title":"A modular supercongruence for &lt;span class=\"mathjax-formula\"&gt;$_6F_5$&lt;/span&gt;: An Apéry-like story","year":2018,"lang":"en","type":"article","venue":"French digital mathematics library (Numdam)","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Congruence relation; Mathematics; Fourier series; Modulo; Pure mathematics; Modular form; Congruence (geometry); Sequence (biology); Harmonic number; Harmonic; Arithmetic; Combinatorics; Mathematical analysis; Physics; Riemann hypothesis; Chemistry; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03364723376280146,"gpt":0.2746547408224047,"spread":0.2410075070596032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0006645531,0.001402675,0.001851294,0.000557931,0.0007062471,0.001579316,0.002310392,0.0006235888,0.0007227376],"category_scores_gemma":[0.002281554,0.001309898,0.0007163233,0.0007762893,0.001168541,0.01091298,0.0009310417,0.0006392342,0.0008767826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002039064,"about_ca_system_score_gemma":0.0003525222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004438582,"about_ca_topic_score_gemma":0.00002584654,"domain_scores_codex":[0.9930874,0.0001254443,0.002035079,0.001458596,0.001475262,0.001818249],"domain_scores_gemma":[0.9925488,0.002320152,0.0008239632,0.002878632,0.0004716958,0.0009567548],"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.00006052418,0.00360307,0.0000994484,0.004195371,0.0004446982,0.00007337907,0.006533717,0.0000313711,0.003634881,0.9010705,0.07913905,0.001114046],"study_design_scores_gemma":[0.001262514,0.0009975557,0.00004389105,0.0007973344,0.0002037386,0.0001216486,0.001280802,0.01545735,0.004749571,0.9417452,0.0316814,0.001659047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6099259,0.0008423724,0.2600487,0.001220668,0.002277606,0.006346195,0.002322733,0.004631732,0.1123841],"genre_scores_gemma":[0.5600352,0.00006106872,0.3720543,0.0007350164,0.001819232,0.0009684747,0.0004816209,0.001057495,0.0627875],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1120056,"threshold_uncertainty_score":0.9999012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2478833398","doi":"","title":"Un algorithme pour la bipartition d'un graphe en sous-graphes de cardinalité fixée","year":2001,"lang":"fr","type":"article","venue":"French digital mathematics library (Numdam)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Humanities; Philosophy; Combinatorics; Physics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01736117033426139,"gpt":0.2657328213584346,"spread":0.2483716510241732,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008070328,0.001084013,0.001206734,0.0006838112,0.0003995141,0.00167413,0.001260087,0.0008004216,0.003929071],"category_scores_gemma":[0.001382964,0.001132176,0.000766297,0.002185683,0.0006459311,0.005001939,0.000735448,0.001088673,0.001167401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001794441,"about_ca_system_score_gemma":0.0004478135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001374077,"about_ca_topic_score_gemma":0.000001574769,"domain_scores_codex":[0.9936205,0.0005775961,0.00166835,0.0009978605,0.001337565,0.001798128],"domain_scores_gemma":[0.9933667,0.003375913,0.0006463258,0.001429633,0.0002790461,0.0009024064],"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.0001268329,0.01516729,0.01063412,0.007380574,0.003562279,0.004504975,0.01769492,0.004663595,0.0002981116,0.5442964,0.1310403,0.2606305],"study_design_scores_gemma":[0.001636933,0.0002349988,0.0004109913,0.001082612,0.0002451793,0.001625978,0.001307616,0.07236616,0.002329632,0.8588247,0.05851951,0.001415749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02268266,0.007256025,0.8605096,0.00770134,0.0007050996,0.001790239,0.001717953,0.001335142,0.09630195],"genre_scores_gemma":[0.02102538,0.004944908,0.8727424,0.0003381889,0.001196249,0.0003112273,0.0005699025,0.0006436243,0.09822815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3145282,"threshold_uncertainty_score":0.9996103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1858344456","doi":"","title":"Editorial du numéro spécial sondages","year":2014,"lang":"fr","type":"article","venue":"French digital mathematics library (Numdam)","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Humanities; Political science; Art","retraction":null,"screen_n_in":null,"score":{"opus":0.04848057010185163,"gpt":0.3133713074898773,"spread":0.2648907373880257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002138498,0.001104438,0.001620728,0.0007546695,0.0005351831,0.0115907,0.003907379,0.0008965259,0.0160998],"category_scores_gemma":[0.01416241,0.0009677607,0.0008233492,0.001727807,0.000804075,0.01238611,0.002313806,0.0008582476,0.01591137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008682215,"about_ca_system_score_gemma":0.0005215879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001404191,"about_ca_topic_score_gemma":0.00000275031,"domain_scores_codex":[0.98886,0.0004328145,0.003046807,0.001643396,0.004507592,0.001509454],"domain_scores_gemma":[0.986119,0.008891766,0.001197844,0.00238276,0.0004308893,0.0009777575],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002673294,0.0007808985,0.00111406,0.0001548583,0.0000563375,0.00004396894,0.001383997,0.0000334037,0.00005386262,0.02993147,0.8988844,0.06753604],"study_design_scores_gemma":[0.0008253285,0.000185938,0.0001496363,0.0004115388,0.00002971756,0.0000568154,0.0003006878,0.01084557,0.0001707785,0.3590277,0.6272786,0.0007176616],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0190201,0.001477689,0.05885833,0.007272655,0.6254346,0.001035791,0.001534436,0.0007265566,0.2846398],"genre_scores_gemma":[0.1099508,0.0001453483,0.07724141,0.001136085,0.6667043,0.00006423957,0.0002024572,0.0004626788,0.1440927],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.3290963,"threshold_uncertainty_score":0.9992773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1923637923","doi":"","title":"Editorial to the special issue on Survey Sampling","year":2014,"lang":"fr","type":"article","venue":"French digital mathematics library (Numdam)","topic":"Survey Methodology and Nonresponse","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Sampling frame; Sampling (signal processing); Sample (material); Sampling design; Statistics; Population; Context (archaeology); Econometrics; Survey sampling; A priori and a posteriori; Sampling bias; Cluster sampling; Frame (networking); Computer science; Dimension (graph theory); Sample size determination; Mathematics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.1492054904741737,"gpt":0.3671819143596559,"spread":0.2179764238854822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.01450802,0.0004742084,0.0006392783,0.0001496272,0.0007126601,0.00100576,0.001393289,0.0005683016,0.003343761],"category_scores_gemma":[0.03324214,0.0003791341,0.0002489944,0.001162024,0.0006841883,0.001532229,0.0003841376,0.0006615731,0.007725056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005582748,"about_ca_system_score_gemma":0.0003107883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000170394,"about_ca_topic_score_gemma":0.0001604592,"domain_scores_codex":[0.9891222,0.00758889,0.0007537346,0.0006228668,0.000970008,0.000942348],"domain_scores_gemma":[0.9497513,0.04863299,0.0002719684,0.0007921848,0.0001010139,0.0004505317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003356867,0.0003770383,0.0009432634,0.00004347117,0.00005912525,0.000003104355,0.007409696,0.00004907191,0.0000020157,0.02142944,0.9510703,0.01827781],"study_design_scores_gemma":[0.0002534266,0.0003530578,0.00658009,0.0001571348,0.0000222527,0.000002949986,0.0004513268,0.00005684915,0.00005814262,0.04349224,0.9481224,0.0004501476],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0530365,0.0003939884,0.006189026,0.02905067,0.5026093,0.001255247,0.001534803,0.0003211157,0.4056094],"genre_scores_gemma":[0.009769248,0.0000834423,0.01009197,0.002842712,0.8286878,0.00004612185,0.0001789238,0.0001333935,0.1481664],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.3260785,"threshold_uncertainty_score":0.9998661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2488073955","doi":"","title":"EFFICIENT AND LOCAL EFFICIENT SOLUTIONS FOR ASSIGNMENT TYPE PROBLEMS","year":2001,"lang":"en","type":"article","venue":"French digital mathematics library (Numdam)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"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":"Mathematical optimization; Computer science; Type (biology); Linear programming; Assignment problem; Multiobjective programming; Mathematics; Multi-objective optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01857720890291876,"gpt":0.2014252444063325,"spread":0.1828480355034137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009006157,0.000231676,0.0002483651,0.00009478957,0.0001176052,0.0003308236,0.0001427639,0.00008803337,0.00008573695],"category_scores_gemma":[0.00005744974,0.0002045026,0.00007392632,0.0002829844,0.00009266396,0.0002149002,0.0001121368,0.00009873683,0.00007241092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004183592,"about_ca_system_score_gemma":0.00002102635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.785741e-7,"about_ca_topic_score_gemma":1.272719e-7,"domain_scores_codex":[0.99872,0.000005723715,0.0004016196,0.000208394,0.0002000182,0.0004641976],"domain_scores_gemma":[0.9993374,0.0001712403,0.00005037753,0.0002282578,0.00003084072,0.0001818555],"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.000005941879,0.0009759425,0.0000464608,0.001456434,0.0001062316,0.000007384858,0.001152834,0.8897408,0.0001113295,0.08622424,0.006607835,0.01356458],"study_design_scores_gemma":[0.0003396177,0.00008519192,0.00001064611,0.0001416432,0.00002163781,0.00002251673,0.0001615649,0.976642,0.00009886167,0.01068587,0.01151558,0.0002748863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02032965,0.0005247731,0.9525605,0.0001773806,0.0002313599,0.0009123756,0.00004842101,0.0007708985,0.02444466],"genre_scores_gemma":[0.9570971,0.00003264469,0.04129697,0.00004495464,0.00006378321,0.0001135573,0.00006984206,0.00008869111,0.001192525],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9367674,"threshold_uncertainty_score":0.8339373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}