{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":7,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":7,"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":"b4fdceb066d7","filters":{"venue":"Formalized Mathematics"}},"results":[{"id":"W2166565522","doi":"10.2478/v10037-009-0028-4","title":"Dilworth's Decomposition Theorem for Posets","year":2009,"lang":"en","type":"article","venue":"Formalized Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Decomposition; Algebra over a field; Decomposition theorem; Discrete mathematics; Combinatorics; Pure mathematics","authors":[{"name":"Piotr Rudnicki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02987350184096468,"gpt":0.3676864564193064,"spread":0.3378129545783417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005966423,0.0002414877,0.0004160353,0.00008832692,0.0002745467,0.00002586422,0.0002493284,0.0001703933,0.0001346734],"category_scores_gemma":[0.0003887317,0.0002013955,0.0001996151,0.0001016041,0.00008450208,0.0002420863,0.00002818852,0.0001395879,0.00003885292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003901248,"about_ca_system_score_gemma":0.00002181806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.55768e-7,"about_ca_topic_score_gemma":0.000001325522,"domain_scores_codex":[0.9986673,0.00004080028,0.0005077095,0.0001959269,0.0001639682,0.0004242784],"domain_scores_gemma":[0.9983919,0.0007453343,0.000250475,0.0004250518,0.00009722871,0.00008997965],"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.0001182227,0.0002799302,0.000002627272,0.0001169651,0.00003164024,0.000003468665,0.001071149,0.000005771087,0.0005557206,0.9931177,0.001838406,0.002858321],"study_design_scores_gemma":[0.001190916,0.0002316598,0.00001353123,0.00005512322,0.00008278516,0.00006915872,0.0002224489,0.001341742,0.004992922,0.9893453,0.002203319,0.0002510957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09342024,0.00009983103,0.872277,0.0006206675,0.0002469639,0.001172934,0.00004578065,0.0004686435,0.03164791],"genre_scores_gemma":[0.39938,0.00002319898,0.5980669,0.000653026,0.0001446313,0.00007776913,0.00005682362,0.00004769299,0.001549973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3059598,"threshold_uncertainty_score":0.821267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163325295","doi":"10.2478/v10037-006-0022-z","title":"Recognizing Chordal Graphs: Lex BFS and MCS1","year":2006,"lang":"en","type":"article","venue":"Formalized Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Mathematics; Computer science; Combinatorics; Graph","authors":[{"name":"Broderick Arneson","is_ca":true},{"name":"Piotr Rudnicki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00848656058205855,"gpt":0.2081372526272673,"spread":0.1996506920452087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001903114,0.0001050385,0.0001323682,0.0001043995,0.000127742,0.0001613256,0.0001472115,0.00004828854,0.00004773926],"category_scores_gemma":[0.00002634511,0.0000963538,0.0000412508,0.0002056853,0.00003563216,0.0005041159,0.00007414908,0.00006696283,0.00002475325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001390607,"about_ca_system_score_gemma":0.00001881455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001354441,"about_ca_topic_score_gemma":0.00001600134,"domain_scores_codex":[0.9992612,0.00001524825,0.0002555781,0.0001457076,0.0001493927,0.0001728815],"domain_scores_gemma":[0.9995407,0.00005616834,0.0001069741,0.0002019285,0.00004783395,0.00004638685],"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.000003974857,0.00008971943,0.0007655144,0.0001187746,0.00001878819,0.000006136402,0.001457886,0.0001867955,0.0005575913,0.942269,0.002023087,0.05250269],"study_design_scores_gemma":[0.002102755,0.00008428129,0.003064772,0.0001088964,0.0000371615,0.0003198173,0.0002960598,0.5925252,0.003092261,0.388288,0.009399836,0.0006809348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.024573,0.00005600307,0.955412,0.0002433458,0.0001348247,0.0001551133,0.000002229596,0.0002353063,0.01918814],"genre_scores_gemma":[0.17111,0.00005575932,0.828099,0.0001566947,0.00003366354,0.00001363841,0.000007960154,0.0000121319,0.0005111391],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5923384,"threshold_uncertainty_score":0.3929194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052268721","doi":"10.2478/v10037-011-0005-6","title":"The Mycielskian of a Graph","year":2011,"lang":"pl","type":"article","venue":"Formalized Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Graph; Theoretical computer science; Discrete mathematics; Computer science","authors":[{"name":"Piotr Rudnicki","is_ca":true},{"name":"Lorna Stewart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05567296128913168,"gpt":0.2444875927429083,"spread":0.1888146314537767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153482,0.0002281876,0.0004749824,0.0002173725,0.0003170503,0.000117076,0.00222163,0.0001255578,0.000453513],"category_scores_gemma":[0.0003987242,0.0001269264,0.0003793253,0.002072895,0.0003739701,0.0003524579,0.0006917694,0.0001811107,0.000215092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001210979,"about_ca_system_score_gemma":0.00004987943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007571825,"about_ca_topic_score_gemma":0.00001583916,"domain_scores_codex":[0.9977714,0.00007546629,0.0008714092,0.0002522317,0.0005190068,0.0005104884],"domain_scores_gemma":[0.9973426,0.0004321362,0.000608637,0.001286996,0.000181965,0.0001476891],"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.00001688215,0.0004428377,0.0001673186,0.0001222533,0.0002130221,0.00000746147,0.005147673,0.000001470265,0.000009275574,0.981095,0.001865486,0.01091132],"study_design_scores_gemma":[0.001491692,0.0009477445,0.001703421,0.0001624885,0.0006184122,0.00006159348,0.003327813,0.02051959,0.003225963,0.9339966,0.0331472,0.0007974686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01669499,0.002498866,0.860518,0.0007146984,0.0009992264,0.0006151416,0.0001300192,0.0001632597,0.1176658],"genre_scores_gemma":[0.6703784,0.002608944,0.3187757,0.0002511505,0.00008525309,0.00003858521,0.00001266075,0.00003036507,0.007818924],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6536834,"threshold_uncertainty_score":0.5175908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237366326","doi":"10.2478/v10037-006-0010-3","title":"Chordal Graphs","year":2006,"lang":"en","type":"article","venue":"Formalized Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Alberta","funders":"","keywords":"Mathematics; Chordal graph; Combinatorics; Discrete mathematics; Graph","authors":[{"name":"Broderick Arneson","is_ca":true},{"name":"Piotr Rudnicki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01532534760189419,"gpt":0.2766044067953619,"spread":0.2612790591934677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004512067,0.0001419311,0.0001825912,0.0001709818,0.000142033,0.0001250703,0.0009611218,0.00005073331,0.00004320673],"category_scores_gemma":[0.00004399676,0.0001191001,0.000103322,0.0005596123,0.00007503756,0.0006220645,0.0002552295,0.0001323692,0.0001972876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002237171,"about_ca_system_score_gemma":0.0000268275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005982125,"about_ca_topic_score_gemma":0.000003432119,"domain_scores_codex":[0.9986211,0.00003243908,0.0003082009,0.0002003799,0.0004046207,0.0004332628],"domain_scores_gemma":[0.9989231,0.0001279834,0.00009843351,0.0006981335,0.00007896475,0.00007338918],"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.000002685933,0.00008369421,0.00003799202,0.00003347425,0.000005659138,0.000005862147,0.0001704822,0.00003686711,0.0006360307,0.9968081,0.001017994,0.001161124],"study_design_scores_gemma":[0.0004271987,0.00003749055,0.00008309738,0.00001177425,0.000003066966,0.00003012938,0.00002254568,0.01547309,0.006178937,0.972033,0.005535229,0.0001644697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02579485,0.00007610284,0.9327641,0.0001361684,0.0001123482,0.0002200453,0.00000269698,0.0003614819,0.04053227],"genre_scores_gemma":[0.1621725,0.00001454904,0.8355547,0.0001013475,0.00004636134,0.0000520538,0.000005535226,0.00002516228,0.002027888],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1363776,"threshold_uncertainty_score":0.485676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021186992","doi":"10.2478/v10037-012-0019-8","title":"Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph","year":2012,"lang":"en","type":"article","venue":"Formalized Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","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 Alberta","funders":"","keywords":"Mathematics; Simple (philosophy); Combinatorics; Terminology; Graph; Discrete mathematics","authors":[{"name":"Piotr Rudnicki","is_ca":true},{"name":"Lorna Stewart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02594863949307382,"gpt":0.281675470827225,"spread":0.2557268313341512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006661499,0.0001510168,0.0003304822,0.0002025068,0.0001852965,0.00006334722,0.001300558,0.00006169752,0.0002116082],"category_scores_gemma":[0.000217616,0.00008507215,0.0002430985,0.001710103,0.000135695,0.0004892411,0.0004340249,0.0001074743,0.0001025256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008529937,"about_ca_system_score_gemma":0.00001672211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000612102,"about_ca_topic_score_gemma":0.000005557467,"domain_scores_codex":[0.9985148,0.00004856254,0.0004526755,0.0001389178,0.0004086811,0.0004363986],"domain_scores_gemma":[0.9984031,0.0003526334,0.000260796,0.0007806579,0.00007395395,0.000128857],"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.000003112402,0.0002207356,0.000552558,0.0000295595,0.00005520268,5.696819e-7,0.001236478,0.000007154873,0.0000848572,0.9944592,0.001870048,0.001480486],"study_design_scores_gemma":[0.0005743991,0.0001673539,0.00207102,0.00001223485,0.0001105346,0.00004159884,0.001004118,0.003503635,0.001908034,0.9654679,0.02482789,0.000311323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2007918,0.0003584737,0.7771683,0.0006793448,0.0002572918,0.0004473965,0.00007015384,0.0002232717,0.02000397],"genre_scores_gemma":[0.9642553,0.00003413582,0.03512737,0.0004057422,0.00004069123,0.00001656938,0.00001413235,0.000006753837,0.0000993385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7634634,"threshold_uncertainty_score":0.3469142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969404474","doi":"10.2478/forma-2013-0009","title":"Some Properties of the Sorgenfrey Line and the Sorgenfrey Plane","year":2013,"lang":"en","type":"article","venue":"Formalized Mathematics","topic":"Advanced Topics in Algebra","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":"University of Alberta","funders":"","keywords":"Line (geometry); Plane (geometry); Mathematics; Product (mathematics); Topology (electrical circuits); Linear subspace; Product topology; Pure mathematics; Discrete mathematics; Combinatorics; Geometry","authors":[{"name":"Adam St. Arnaud","is_ca":true},{"name":"Piotr Rudnicki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04111223914397769,"gpt":0.2685643895698792,"spread":0.2274521504259015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006071668,0.0002782097,0.0005585798,0.0000470225,0.0002315397,0.00005543389,0.0006226917,0.0001208891,0.0001283202],"category_scores_gemma":[0.001494645,0.0001290611,0.0001570861,0.000147788,0.0006024537,0.0003144777,0.0004121808,0.0002835908,0.0000431165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002499351,"about_ca_system_score_gemma":0.00004235604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001818621,"about_ca_topic_score_gemma":0.000008895442,"domain_scores_codex":[0.9981154,0.00009172502,0.0008128613,0.0001728336,0.0004474471,0.0003598006],"domain_scores_gemma":[0.9976567,0.0006421315,0.0005257957,0.000955525,0.0001534734,0.00006635981],"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.00003041897,0.0001306603,0.00002183119,0.0009771837,0.00009999212,4.293197e-7,0.005206127,0.00000463971,0.002134606,0.9897639,0.001374485,0.0002557353],"study_design_scores_gemma":[0.001696975,0.00003004436,0.00001835791,0.0001890733,0.0001035787,0.00003839451,0.0008514911,0.001894314,0.03760811,0.9567491,0.0006292627,0.000191342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.986731,0.001537911,0.003675395,0.002116424,0.000519808,0.002541184,0.00002008264,0.000162746,0.002695452],"genre_scores_gemma":[0.9018643,0.0004678522,0.08954676,0.0005055195,0.0003596988,0.0004273741,0.000003835339,0.0001378542,0.006686748],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08587137,"threshold_uncertainty_score":0.5262957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150611932","doi":"10.2478/v10037-008-0013-3","title":"Helly Property for Subtrees","year":2008,"lang":"en","type":"article","venue":"Formalized Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Property (philosophy); Combinatorics; Discrete mathematics","authors":[{"name":"Jessica Enright","is_ca":true},{"name":"Piotr Rudnicki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07757136629430028,"gpt":0.2914045359527144,"spread":0.2138331696584141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004600926,0.0003112277,0.0005604121,0.0001012267,0.0003505908,0.00004220797,0.000372673,0.0001361412,0.0001501537],"category_scores_gemma":[0.000614561,0.0002007983,0.000270549,0.0001401239,0.0001240126,0.0002906855,0.00008598798,0.0001315096,0.0001235071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004468653,"about_ca_system_score_gemma":0.00007902615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006631909,"about_ca_topic_score_gemma":0.00001144066,"domain_scores_codex":[0.9981298,0.0000217649,0.000676,0.0002595226,0.0003683824,0.0005445299],"domain_scores_gemma":[0.9984399,0.0003849597,0.0002810839,0.0005871831,0.000173393,0.0001334843],"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.000198194,0.001995166,0.000329807,0.00480087,0.000326106,0.00004572387,0.01836896,0.000009640232,0.002551921,0.8005038,0.1681613,0.002708508],"study_design_scores_gemma":[0.003451182,0.0003339715,0.00005834987,0.0002530513,0.0001713978,0.0004227498,0.0007514624,0.005438576,0.02258275,0.8855307,0.08007653,0.0009293083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8022323,0.0002234827,0.1549129,0.0004172531,0.0005043005,0.002811523,0.00006619594,0.000929667,0.03790245],"genre_scores_gemma":[0.1668001,0.0002057918,0.7881436,0.0003429549,0.0005049562,0.000513299,0.00003616722,0.0002353872,0.04321784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6354322,"threshold_uncertainty_score":0.8188317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}