{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398973,0.0007899067,0.001286508,0.003430944,0.0005813543,0.003950006,0.0008238032,0.0006174793,0.00730189],"category_scores_gemma":[0.01136056,0.0004622223,0.0007939538,0.002312948,0.002742306,0.00524736,0.001958356,0.0009844173,0.001358018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000798567,"about_ca_system_score_gemma":0.0004353694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001003454,"about_ca_topic_score_gemma":0.001060168,"domain_scores_codex":[0.9977759,0.0005123526,0.0001321377,0.0003804222,0.0008371177,0.0003620876],"domain_scores_gemma":[0.9918984,0.00423174,0.001073491,0.001122736,0.001012295,0.0006612532],"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.001080615,0.0001115998,0.01022048,0.0006009766,0.00009202451,0.0005266669,0.0006707761,0.06903331,0.01368038,0.6751111,0.008369518,0.2205026],"study_design_scores_gemma":[0.00009814277,0.0006138915,0.006040136,0.0001218682,0.00007629136,0.0009023699,0.0005909057,0.1275831,0.009825871,0.8296394,0.02439478,0.0001132813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4916973,0.003919804,0.4439456,0.001179904,0.0004884916,0.0001920438,0.001451852,0.001019489,0.05610544],"genre_scores_gemma":[0.8738139,0.001470781,0.1117066,0.0001411283,0.0002675546,0.0001296979,0.000845284,0.0002692717,0.01135572],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00730189,"threshold_uncertainty_score":0.02442729,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001608849,0.0007246223,0.0006795482,0.0008162977,0.0007037555,0.001313632,0.001102579,0.0008979958,0.004323514],"category_scores_gemma":[0.01062887,0.000772465,0.0009217344,0.0008776644,0.001737649,0.00278329,0.0009749366,0.001791549,0.0004956253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001493272,"about_ca_system_score_gemma":0.001514635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001057822,"about_ca_topic_score_gemma":0.0009627403,"domain_scores_codex":[0.9987644,0.0002978281,0.00008676851,0.0002164975,0.0004480532,0.0001864984],"domain_scores_gemma":[0.9949021,0.003022228,0.0008963451,0.0004671667,0.000461408,0.0002506694],"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.0001013848,0.00008182452,0.0006726508,0.00014992,0.00002484738,0.00009965146,0.0002441297,0.218304,0.004286747,0.7551125,0.001400337,0.01952199],"study_design_scores_gemma":[0.00005262069,0.00008099695,0.000303082,0.00001875417,0.00001412481,0.00008739952,0.00005996493,0.3970044,0.001780755,0.5976866,0.00289584,0.00001548947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1215177,0.0004200797,0.8564543,0.0007743305,0.00005465073,0.00013137,0.0002340682,0.0002338921,0.02017957],"genre_scores_gemma":[0.8278252,0.0007293783,0.1657534,0.0001588193,0.0001302843,0.0002415146,0.0006618361,0.0001532356,0.004346236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004323514,"threshold_uncertainty_score":0.0144636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}