{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"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":"5386d000faf7","filters":{"venue":"Journal of Applied and Industrial Mathematics"}},"results":[{"id":"W2088889931","doi":"10.1134/s1990478909010037","title":"Ranking small regular polygons by area and by perimeter","year":2009,"lang":"en","type":"article","venue":"Journal of Applied and Industrial Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Perimeter; Polygon (computer graphics); Mathematics; Combinatorics; Regular polygon; Star-shaped polygon; Unit (ring theory); Geometry; Convex set; Computer science","authors":[{"name":"Ch. Audet","is_ca":true},{"name":"Pierre Hansen","is_ca":true},{"name":"Frédéric Messine","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07440694069941829,"gpt":0.2702243066435149,"spread":0.1958173659440966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008996151,0.0002113784,0.0005900774,0.0001664655,0.0001172273,0.0001444268,0.0001499729,0.0002109799,0.00003227147],"category_scores_gemma":[0.0004346265,0.0001576432,0.0000735444,0.0002057876,0.00006205444,0.0001209844,0.00003598182,0.0003763034,6.797403e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002255367,"about_ca_system_score_gemma":0.00003196967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001404434,"about_ca_topic_score_gemma":1.50453e-7,"domain_scores_codex":[0.9985216,0.00001865795,0.0007827982,0.0001278865,0.0003040277,0.0002450724],"domain_scores_gemma":[0.99852,0.0004726507,0.0006489801,0.0001346975,0.00007881352,0.0001448532],"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.001001751,0.002331631,0.00007456489,0.001143546,0.0008678279,0.00004571312,0.01549462,0.000004128719,0.06907509,0.4547541,0.2785961,0.1766109],"study_design_scores_gemma":[0.005550697,0.001086142,0.000007476375,0.0005306113,0.0004671533,0.0003547721,0.005662987,0.0001765027,0.02786077,0.9370632,0.02056411,0.000675576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9834471,0.001209276,0.008219263,0.0008921421,0.0001205222,0.0002797818,0.00002835455,0.00002726408,0.005776301],"genre_scores_gemma":[0.9756972,0.0004200258,0.02230592,0.0003083635,0.0005240988,0.000003117114,0.000003678744,0.00003408809,0.0007035476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4823091,"threshold_uncertainty_score":0.6428504,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973201762","doi":"10.1134/s1990478910040010","title":"Structural properties of optimal schedules with preemption","year":2010,"lang":"en","type":"article","venue":"Journal of Applied and Industrial Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Russian Foundation for Basic Research","keywords":"Preemption; Mathematical optimization; Dynamic priority scheduling; Rate-monotonic scheduling; Fair-share scheduling; Computer science; Scheduling (production processes); Two-level scheduling; Schedule; Job shop scheduling; Nurse scheduling problem; Mathematics","authors":[{"name":"Ph. Baptiste","is_ca":false},{"name":"Jacques Carlier","is_ca":false},{"name":"Alexander Kononov","is_ca":false},{"name":"Maurice Queyranne","is_ca":true},{"name":"Sergey Sevastyanov","is_ca":false},{"name":"M.N. Sviridenko","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02527500324543937,"gpt":0.2040464063896255,"spread":0.1787714031441861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000168502,0.00008474129,0.0001966955,0.00006712866,0.00002455847,0.00002985944,0.00006800979,0.0001018766,0.00001446376],"category_scores_gemma":[0.00002761497,0.00005454392,0.00002209019,0.00006855666,0.00005603833,0.00008432192,0.000008217399,0.0003122741,4.51399e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005316016,"about_ca_system_score_gemma":0.00002239742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.860788e-7,"about_ca_topic_score_gemma":2.965828e-7,"domain_scores_codex":[0.9994256,0.000003013471,0.0003088,0.00003641782,0.0001531296,0.00007303839],"domain_scores_gemma":[0.999638,0.0000184494,0.00016354,0.00006269402,0.00006768614,0.00004965283],"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.000835464,0.0002333028,0.000754097,0.0009477236,0.0007104811,0.000007823754,0.008817753,0.5936651,0.315409,0.04057417,0.0001356049,0.03790946],"study_design_scores_gemma":[0.006067852,0.00057376,0.0002077105,0.0006849983,0.0002930614,0.0003015741,0.005248573,0.5664604,0.4172363,0.002199688,0.0001393172,0.0005868325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9957286,0.00003312635,0.003652367,0.00001509738,0.0001869611,0.0000757462,0.00000125154,0.00001679338,0.0002900491],"genre_scores_gemma":[0.827683,0.00001101626,0.1720544,0.000001787016,0.0002332185,9.41396e-7,3.476936e-7,0.00001129882,0.000004058577],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.168402,"threshold_uncertainty_score":0.2224236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}