{"meta":{"query_hash":"b4fdceb066d7","filters":{"venue":"Formalized Mathematics"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/b4fdceb066d7","api":"https://metacan.xera.ac/api/v1/cohort?venue=Formalized+Mathematics"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041112239143977686,"score_gpt":0.2685643895698792,"score_spread":0.22745215042590153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969404474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.986731,0.0015379112,0.0036753952,0.0021164243,0.00051980803,0.002541184,0.00002008264,0.00016274604,0.002695452],"genre_scores_gemma":[0.90186435,0.00046785222,0.08954676,0.0005055195,0.00035969878,0.00042737412,0.000003835339,0.00013785418,0.0066867475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811536,0.00009172502,0.00081286125,0.00017283358,0.00044744712,0.00035980064],"domain_scores_gemma":[0.9976567,0.0006421315,0.0005257957,0.000955525,0.00015347337,0.00006635981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060716685,0.00027820966,0.0005585798,0.0000470225,0.00023153974,0.000055433888,0.0006226917,0.000120889075,0.00012832024],"category_scores_gemma":[0.0014946453,0.00012906105,0.00015708606,0.00014778803,0.00060245366,0.00031447771,0.00041218082,0.0002835908,0.0000431165],"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.000030418967,0.00013066028,0.000021831185,0.0009771837,0.00009999212,4.293197e-7,0.005206127,0.00000463971,0.0021346062,0.9897639,0.0013744854,0.0002557353],"study_design_scores_gemma":[0.0016969751,0.000030044363,0.000018357907,0.00018907327,0.00010357866,0.000038394508,0.00085149106,0.0018943141,0.03760811,0.9567491,0.0006292627,0.00019134195],"about_ca_topic_score_codex":0.000018186207,"about_ca_topic_score_gemma":0.000008895442,"teacher_disagreement_score":0.08587137,"about_ca_system_score_codex":0.000024993506,"about_ca_system_score_gemma":0.000042356038,"threshold_uncertainty_score":0.5262957},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Simple (philosophy); Combinatorics; Terminology; Graph; Discrete mathematics","score_opus":0.025948639493073817,"score_gpt":0.281675470827225,"score_spread":0.2557268313341512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021186992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20079184,0.00035847368,0.7771683,0.0006793448,0.00025729177,0.00044739654,0.000070153845,0.00022327171,0.020003973],"genre_scores_gemma":[0.9642553,0.00003413582,0.03512737,0.00040574218,0.000040691233,0.000016569382,0.000014132346,0.000006753837,0.0000993385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985148,0.00004856254,0.00045267554,0.00013891784,0.0004086811,0.0004363986],"domain_scores_gemma":[0.9984031,0.0003526334,0.00026079605,0.0007806579,0.000073953954,0.00012885696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006661499,0.00015101684,0.0003304822,0.00020250678,0.00018529649,0.000063347215,0.0013005575,0.000061697516,0.00021160825],"category_scores_gemma":[0.00021761598,0.00008507215,0.00024309849,0.0017101035,0.00013569502,0.0004892411,0.0004340249,0.000107474334,0.00010252557],"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.0000031124018,0.00022073559,0.000552558,0.000029559498,0.000055202683,5.696819e-7,0.0012364775,0.0000071548734,0.0000848572,0.9944592,0.0018700478,0.0014804862],"study_design_scores_gemma":[0.00057439914,0.00016735394,0.0020710202,0.000012234846,0.0001105346,0.000041598836,0.0010041178,0.003503635,0.0019080342,0.9654679,0.024827894,0.000311323],"about_ca_topic_score_codex":0.0000612102,"about_ca_topic_score_gemma":0.000005557467,"teacher_disagreement_score":0.76346344,"about_ca_system_score_codex":0.000008529937,"about_ca_system_score_gemma":0.000016722113,"threshold_uncertainty_score":0.34691417},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.055672961289131684,"score_gpt":0.24448759274290835,"score_spread":0.18881463145377667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052268721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016694993,0.0024988656,0.86051804,0.0007146984,0.0009992264,0.0006151416,0.00013001924,0.00016325965,0.117665775],"genre_scores_gemma":[0.6703784,0.0026089444,0.31877574,0.00025115054,0.000085253094,0.000038585207,0.00001266075,0.00003036507,0.007818924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977714,0.00007546629,0.0008714092,0.00025223172,0.0005190068,0.0005104884],"domain_scores_gemma":[0.9973426,0.00043213624,0.000608637,0.0012869962,0.00018196502,0.00014768913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011534824,0.00022818761,0.0004749824,0.0002173725,0.00031705026,0.00011707603,0.0022216297,0.00012555775,0.00045351297],"category_scores_gemma":[0.00039872422,0.00012692639,0.00037932533,0.0020728947,0.0003739701,0.00035245786,0.00069176935,0.00018111072,0.00021509198],"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.000016882152,0.0004428377,0.00016731865,0.00012225335,0.00021302205,0.00000746147,0.0051476727,0.0000014702649,0.000009275574,0.981095,0.001865486,0.010911319],"study_design_scores_gemma":[0.0014916916,0.0009477445,0.0017034207,0.00016248846,0.0006184122,0.00006159348,0.0033278128,0.020519588,0.0032259626,0.9339966,0.033147205,0.0007974686],"about_ca_topic_score_codex":0.00007571825,"about_ca_topic_score_gemma":0.000015839158,"teacher_disagreement_score":0.65368336,"about_ca_system_score_codex":0.000012109787,"about_ca_system_score_gemma":0.000049879425,"threshold_uncertainty_score":0.5175908},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Property (philosophy); Combinatorics; Discrete mathematics","score_opus":0.07757136629430028,"score_gpt":0.2914045359527144,"score_spread":0.21383316965841415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150611932","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80223227,0.00022348267,0.15491287,0.00041725312,0.0005043005,0.002811523,0.00006619594,0.00092966703,0.037902452],"genre_scores_gemma":[0.16680005,0.00020579179,0.7881436,0.0003429549,0.0005049562,0.00051329896,0.000036167225,0.00023538717,0.04321784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981298,0.000021764901,0.000676,0.0002595226,0.00036838237,0.0005445299],"domain_scores_gemma":[0.9984399,0.00038495965,0.0002810839,0.00058718305,0.00017339304,0.00013348433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004600926,0.00031122766,0.0005604121,0.00010122671,0.0003505908,0.00004220797,0.000372673,0.00013614117,0.00015015372],"category_scores_gemma":[0.00061456097,0.00020079831,0.00027054903,0.0001401239,0.00012401257,0.0002906855,0.00008598798,0.00013150965,0.00012350714],"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.000198194,0.0019951658,0.000329807,0.0048008696,0.00032610603,0.000045723868,0.018368958,0.000009640232,0.002551921,0.8005038,0.16816135,0.0027085084],"study_design_scores_gemma":[0.0034511818,0.00033397152,0.000058349873,0.00025305126,0.00017139777,0.00042274984,0.0007514624,0.0054385765,0.022582753,0.88553065,0.08007653,0.0009293083],"about_ca_topic_score_codex":0.0000066319094,"about_ca_topic_score_gemma":0.000011440662,"teacher_disagreement_score":0.6354322,"about_ca_system_score_codex":0.00004468653,"about_ca_system_score_gemma":0.00007902615,"threshold_uncertainty_score":0.81883174},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.00848656058205855,"score_gpt":0.2081372526272673,"score_spread":0.19965069204520874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163325295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024572998,0.000056003075,0.95541203,0.00024334583,0.00013482475,0.00015511333,0.000002229596,0.00023530633,0.019188136],"genre_scores_gemma":[0.17111002,0.00005575932,0.828099,0.0001566947,0.00003366354,0.000013638407,0.000007960154,0.000012131902,0.0005111391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992612,0.000015248252,0.00025557808,0.00014570757,0.00014939268,0.00017288145],"domain_scores_gemma":[0.9995407,0.000056168345,0.00010697413,0.00020192847,0.000047833946,0.00004638685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019031145,0.000105038496,0.0001323682,0.00010439947,0.00012774197,0.00016132559,0.00014721145,0.000048288544,0.000047739257],"category_scores_gemma":[0.000026345115,0.000096353804,0.000041250798,0.00020568528,0.00003563216,0.00050411595,0.00007414908,0.00006696283,0.000024753252],"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.0000039748566,0.000089719426,0.0007655144,0.000118774624,0.000018788187,0.000006136402,0.0014578862,0.00018679551,0.00055759127,0.942269,0.0020230873,0.052502688],"study_design_scores_gemma":[0.0021027548,0.00008428129,0.0030647719,0.00010889638,0.0000371615,0.0003198173,0.0002960598,0.5925252,0.0030922606,0.38828802,0.009399836,0.00068093475],"about_ca_topic_score_codex":0.00001354441,"about_ca_topic_score_gemma":0.000016001339,"teacher_disagreement_score":0.5923384,"about_ca_system_score_codex":0.00001390607,"about_ca_system_score_gemma":0.000018814548,"threshold_uncertainty_score":0.39291942},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Decomposition; Algebra over a field; Decomposition theorem; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.029873501840964684,"score_gpt":0.36768645641930636,"score_spread":0.3378129545783417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166565522","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09342024,0.00009983103,0.872277,0.00062066753,0.00024696387,0.0011729338,0.000045780653,0.00046864347,0.031647913],"genre_scores_gemma":[0.39938003,0.000023198982,0.59806687,0.00065302604,0.00014463134,0.00007776913,0.000056823625,0.00004769299,0.0015499734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986673,0.000040800278,0.00050770945,0.0001959269,0.00016396822,0.0004242784],"domain_scores_gemma":[0.9983919,0.00074533426,0.00025047496,0.00042505175,0.00009722871,0.00008997965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005966423,0.0002414877,0.0004160353,0.00008832692,0.00027454668,0.000025864218,0.00024932835,0.00017039326,0.00013467336],"category_scores_gemma":[0.00038873174,0.0002013955,0.00019961508,0.00010160413,0.00008450208,0.00024208627,0.000028188517,0.00013958792,0.000038852922],"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.0001182227,0.00027993022,0.0000026272724,0.000116965064,0.000031640237,0.0000034686648,0.0010711486,0.0000057710868,0.0005557206,0.99311775,0.0018384056,0.002858321],"study_design_scores_gemma":[0.0011909164,0.00023165975,0.00001353123,0.000055123215,0.00008278516,0.00006915872,0.00022244886,0.001341742,0.0049929223,0.9893453,0.0022033195,0.00025109565],"about_ca_topic_score_codex":1.5576803e-7,"about_ca_topic_score_gemma":0.0000013255219,"teacher_disagreement_score":0.3059598,"about_ca_system_score_codex":0.000039012477,"about_ca_system_score_gemma":0.000021818065,"threshold_uncertainty_score":0.821267},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Chordal graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.015325347601894192,"score_gpt":0.2766044067953619,"score_spread":0.2612790591934677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237366326","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025794847,0.00007610284,0.93276405,0.00013616844,0.000112348214,0.00022004532,0.0000026969801,0.00036148194,0.04053227],"genre_scores_gemma":[0.16217245,0.000014549036,0.83555466,0.00010134751,0.000046361336,0.000052053798,0.0000055352257,0.000025162284,0.0020278883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986211,0.000032439082,0.0003082009,0.00020037993,0.00040462072,0.00043326285],"domain_scores_gemma":[0.9989231,0.00012798341,0.00009843351,0.00069813355,0.000078964746,0.00007338918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045120672,0.00014193113,0.00018259117,0.00017098185,0.00014203298,0.00012507026,0.00096112175,0.000050733313,0.000043206728],"category_scores_gemma":[0.00004399676,0.00011910006,0.00010332199,0.0005596123,0.00007503756,0.0006220645,0.00025522953,0.00013236923,0.00019728756],"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.0000026859332,0.000083694205,0.000037992024,0.000033474254,0.0000056591384,0.0000058621467,0.00017048224,0.00003686711,0.00063603075,0.9968081,0.0010179938,0.0011611239],"study_design_scores_gemma":[0.00042719868,0.00003749055,0.00008309738,0.000011774253,0.000003066966,0.000030129384,0.000022545675,0.015473095,0.0061789374,0.97203296,0.005535229,0.00016446973],"about_ca_topic_score_codex":0.0000059821255,"about_ca_topic_score_gemma":0.0000034321192,"teacher_disagreement_score":0.1363776,"about_ca_system_score_codex":0.000022371709,"about_ca_system_score_gemma":0.000026827496,"threshold_uncertainty_score":0.48567596},"labels":[],"label_agreement":null}]}