{"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5980741,0.0027189963,0.18292283,0.003040802,0.0002130169,0.00008434629,0.0007975483,0.00034926023,0.21179906],"genre_scores_gemma":[0.972748,0.00059586606,0.014467972,0.00021833144,0.00019102449,0.00004542381,0.00054530724,0.00006036306,0.011127664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991835,0.00017984922,0.000055859127,0.00014190779,0.0003014715,0.00013742283],"domain_scores_gemma":[0.9983911,0.00047247103,0.00027738238,0.00022104562,0.00045270528,0.00018521298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080442545,0.00031708225,0.00035515442,0.0015726965,0.001191902,0.00209512,0.0005449641,0.0007286053,0.0080066295],"category_scores_gemma":[0.0019038073,0.00024396725,0.00066535064,0.0013205021,0.0033516833,0.004898126,0.0014275141,0.0016535406,0.00091820623],"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.000045269433,0.00001259846,0.00070383557,0.000027841481,0.000009421018,0.00015933032,0.00026053816,0.0007431908,0.0013861036,0.9905877,0.0010635046,0.00500062],"study_design_scores_gemma":[0.000019467398,0.00008020027,0.0019552542,0.000020958218,0.000009284184,0.0004997483,0.00046699864,0.0037912608,0.0022750127,0.97188234,0.018974528,0.000024925674],"about_ca_topic_score_codex":0.0014081415,"about_ca_topic_score_gemma":0.00074189855,"teacher_disagreement_score":0.0080066295,"about_ca_system_score_codex":0.00091366656,"about_ca_system_score_gemma":0.0002908347,"threshold_uncertainty_score":0.026784837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31098652,0.019273318,0.41924366,0.024198612,0.0014101279,0.00009127069,0.0012790208,0.0006450848,0.2228724],"genre_scores_gemma":[0.9503269,0.0027825162,0.033839323,0.0009037678,0.0003508736,0.000036978297,0.00020564992,0.0000906279,0.011463321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997063,0.00006978807,0.000015869777,0.00008523868,0.000088682056,0.00003413993],"domain_scores_gemma":[0.9989957,0.00040393413,0.00008159055,0.00013138476,0.00023810065,0.00014933049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062079437,0.0003558682,0.00031413054,0.0015364285,0.0010209866,0.0022212204,0.0005810457,0.0006527179,0.0049617672],"category_scores_gemma":[0.001639205,0.00025997145,0.00034155758,0.0010860824,0.004223189,0.004793085,0.0018492258,0.0020108635,0.00073032867],"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.000006488872,0.0000030363983,0.00009501687,0.000019424528,0.0000018741762,0.00002043278,0.00014326145,0.00043932127,0.00043252917,0.9959735,0.00092095166,0.0019441126],"study_design_scores_gemma":[0.0000028557245,0.00000465332,0.00014325714,0.000014847588,0.0000030907206,0.00004392609,0.000098163015,0.0018218627,0.0002828094,0.9827769,0.014800196,0.0000074017557],"about_ca_topic_score_codex":0.002073418,"about_ca_topic_score_gemma":0.0017404974,"teacher_disagreement_score":0.0049617672,"about_ca_system_score_codex":0.0015930322,"about_ca_system_score_gemma":0.00040998272,"threshold_uncertainty_score":0.016598761},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5601833,0.0016137168,0.32164454,0.0027040371,0.0004113526,0.00016709122,0.0017253062,0.00039079855,0.11115982],"genre_scores_gemma":[0.90094256,0.00073130167,0.07777031,0.00038515247,0.00026862565,0.00019033538,0.00068651786,0.00012574234,0.018899554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925286,0.00014629208,0.00004057541,0.00024038723,0.00018473856,0.00013508726],"domain_scores_gemma":[0.9986058,0.00047407713,0.00018103479,0.0002040052,0.00031271714,0.00022237864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000682674,0.0003040681,0.00033388843,0.0018912347,0.0014174526,0.0018575179,0.00058063766,0.0004892108,0.004510925],"category_scores_gemma":[0.0026462614,0.0002231241,0.00041105694,0.0012309221,0.0027631407,0.004205212,0.0017656292,0.0016257757,0.00062402076],"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.000050486775,0.000013477997,0.00048020354,0.000034147673,0.0000047016974,0.000034681387,0.00023881438,0.00064268045,0.0030034713,0.98684156,0.0009923312,0.007663422],"study_design_scores_gemma":[0.000017213211,0.00006224508,0.0015755307,0.00003105102,0.000012312502,0.00032528918,0.0002872866,0.009937781,0.0035247041,0.941318,0.042873923,0.00003457684],"about_ca_topic_score_codex":0.0007493093,"about_ca_topic_score_gemma":0.00086219236,"teacher_disagreement_score":0.004510925,"about_ca_system_score_codex":0.0011109117,"about_ca_system_score_gemma":0.0005224344,"threshold_uncertainty_score":0.015090585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41892925,0.0022859552,0.34175938,0.0065026106,0.0006963218,0.00019093898,0.0027801562,0.001363148,0.2254923],"genre_scores_gemma":[0.9342304,0.0010865035,0.025442712,0.0010250424,0.000617714,0.00012319275,0.0014816615,0.00035340156,0.035639446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980459,0.000286723,0.00018247537,0.0005010357,0.0005527416,0.00043103797],"domain_scores_gemma":[0.9937757,0.003078152,0.00057947816,0.0011671736,0.0007632021,0.00063638616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017279744,0.00040504968,0.0009841518,0.0022561538,0.0026822763,0.004230147,0.0010522016,0.0013487103,0.013089684],"category_scores_gemma":[0.0064673647,0.0006487822,0.0011604378,0.0018507685,0.0041726255,0.014959145,0.0044102413,0.0031290906,0.0021263396],"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.000058898866,0.000018335119,0.00049923867,0.000065588996,0.000015940419,0.00017849487,0.00051172375,0.0003114862,0.0012106599,0.9877902,0.0023675554,0.006971828],"study_design_scores_gemma":[0.000019148805,0.000018291305,0.0004332197,0.000016230222,0.000018467954,0.00033388037,0.00015589033,0.0009760271,0.0010916651,0.990257,0.006664731,0.000015404528],"about_ca_topic_score_codex":0.0006808645,"about_ca_topic_score_gemma":0.00062023994,"teacher_disagreement_score":0.013089684,"about_ca_system_score_codex":0.001364323,"about_ca_system_score_gemma":0.0008453497,"threshold_uncertainty_score":0.043789387},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050353818,0.00026524905,0.9345851,0.0007009972,0.00006139026,0.00016580524,0.0014652258,0.002060816,0.010341618],"genre_scores_gemma":[0.3017494,0.00023741707,0.6878146,0.00021678976,0.00006156603,0.00014632376,0.0034185194,0.00029495935,0.006060479],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904996,0.00015796586,0.00008771312,0.00023103667,0.00033709477,0.0001363249],"domain_scores_gemma":[0.997624,0.0009149356,0.00023365358,0.0005793564,0.0005076242,0.00014043818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006102479,0.00067947013,0.0006400888,0.0013011991,0.00083405484,0.0017809668,0.0012314063,0.0008038584,0.00584332],"category_scores_gemma":[0.005245468,0.00034592664,0.0006063241,0.0023146428,0.0013710944,0.004924473,0.002021878,0.0013343316,0.0011624796],"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.0004930281,0.00018156848,0.0032910837,0.0004102023,0.000045966444,0.00027229998,0.00081556034,0.053986046,0.019172939,0.42661875,0.016424704,0.47828788],"study_design_scores_gemma":[0.00005566698,0.00008461498,0.0010004174,0.0000658565,0.000030420604,0.00033861038,0.0004943127,0.21274635,0.018993048,0.7418328,0.024299208,0.00005876377],"about_ca_topic_score_codex":0.008532653,"about_ca_topic_score_gemma":0.011165883,"teacher_disagreement_score":0.008532653,"about_ca_system_score_codex":0.0014532966,"about_ca_system_score_gemma":0.0014036234,"threshold_uncertainty_score":0.01954782},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029967308,0.0038629354,0.7252603,0.0027287554,0.0005305507,0.00022231301,0.0015861995,0.00083313294,0.23500851],"genre_scores_gemma":[0.6551612,0.004281752,0.25520808,0.0033942114,0.001893437,0.00094119925,0.0040082973,0.00063955993,0.07447226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981317,0.00022098018,0.00015257589,0.0005331535,0.00060907437,0.00035254724],"domain_scores_gemma":[0.9981641,0.00078321196,0.00013042832,0.0002792948,0.00044111337,0.00020192446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021915461,0.0011471015,0.0011195265,0.0027683368,0.0018360601,0.0036832865,0.0011837397,0.0009830203,0.01334878],"category_scores_gemma":[0.0027952858,0.0008180891,0.0021631792,0.0019073044,0.0038578496,0.008217073,0.0036683904,0.0031388216,0.0022915811],"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.0000129508135,0.000011288955,0.000120009216,0.000054620363,0.000008493975,0.000059539838,0.00021701204,0.00029869823,0.00034126284,0.98526263,0.0036161433,0.009997288],"study_design_scores_gemma":[0.00001652799,0.000014241008,0.00019483025,0.000023257131,0.000011510514,0.00018609618,0.000066386856,0.0019586477,0.0004652895,0.972675,0.02437777,0.000010391844],"about_ca_topic_score_codex":0.0015317977,"about_ca_topic_score_gemma":0.0013439538,"teacher_disagreement_score":0.01334878,"about_ca_system_score_codex":0.0026217587,"about_ca_system_score_gemma":0.0008104228,"threshold_uncertainty_score":0.044656157},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06067684,0.0049730013,0.6825428,0.0035992006,0.0013028866,0.0006119379,0.0036771116,0.001455054,0.2411612],"genre_scores_gemma":[0.7182458,0.00441736,0.21325582,0.001716506,0.000761424,0.0004882841,0.0037375197,0.00035826696,0.057019047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983594,0.00031839547,0.000121072735,0.00047601713,0.00041158742,0.00031364788],"domain_scores_gemma":[0.99877566,0.00027784857,0.00016250825,0.00030400034,0.0003310262,0.00014893977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084336166,0.000874364,0.00043592489,0.0017616091,0.0019210705,0.0036897038,0.0018297763,0.0010329821,0.011848258],"category_scores_gemma":[0.0023721964,0.00034725823,0.00071190135,0.0021221177,0.0033703106,0.006318926,0.0032130952,0.0019474123,0.0018272775],"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.000012097926,0.000007873344,0.00014634563,0.000053666692,0.000005385478,0.000055289995,0.00023663166,0.00046533655,0.0008201026,0.9888314,0.0021026365,0.0072632194],"study_design_scores_gemma":[0.000015992098,0.000024763094,0.00034722674,0.00006704323,0.000021294562,0.0003466267,0.00042507422,0.0029887676,0.0020914408,0.8344175,0.1592304,0.000023817387],"about_ca_topic_score_codex":0.0026212265,"about_ca_topic_score_gemma":0.0023814202,"teacher_disagreement_score":0.011848258,"about_ca_system_score_codex":0.001944234,"about_ca_system_score_gemma":0.0010290145,"threshold_uncertainty_score":0.039636433},"labels":[],"label_agreement":null}]}