{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002191546,0.001147102,0.001119526,0.002768337,0.00183606,0.003683286,0.00118374,0.0009830203,0.01334878],"category_scores_gemma":[0.002795286,0.0008180891,0.002163179,0.001907304,0.00385785,0.008217073,0.00366839,0.003138822,0.002291581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002621759,"about_ca_system_score_gemma":0.0008104228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001531798,"about_ca_topic_score_gemma":0.001343954,"domain_scores_codex":[0.9981317,0.0002209802,0.0001525759,0.0005331535,0.0006090744,0.0003525472],"domain_scores_gemma":[0.9981641,0.000783212,0.0001304283,0.0002792948,0.0004411134,0.0002019245],"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.00001295081,0.00001128895,0.0001200092,0.00005462036,0.000008493975,0.00005953984,0.000217012,0.0002986982,0.0003412628,0.9852626,0.003616143,0.009997288],"study_design_scores_gemma":[0.00001652799,0.00001424101,0.0001948303,0.00002325713,0.00001151051,0.0001860962,0.00006638686,0.001958648,0.0004652895,0.972675,0.02437777,0.00001039184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02996731,0.003862935,0.7252603,0.002728755,0.0005305507,0.000222313,0.0015862,0.0008331329,0.2350085],"genre_scores_gemma":[0.6551612,0.004281752,0.2552081,0.003394211,0.001893437,0.0009411993,0.004008297,0.0006395599,0.07447226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01334878,"threshold_uncertainty_score":0.04465616,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006102479,0.0006794701,0.0006400888,0.001301199,0.0008340548,0.001780967,0.001231406,0.0008038584,0.00584332],"category_scores_gemma":[0.005245468,0.0003459266,0.0006063241,0.002314643,0.001371094,0.004924473,0.002021878,0.001334332,0.00116248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001453297,"about_ca_system_score_gemma":0.001403623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008532653,"about_ca_topic_score_gemma":0.01116588,"domain_scores_codex":[0.99905,0.0001579659,0.00008771312,0.0002310367,0.0003370948,0.0001363249],"domain_scores_gemma":[0.997624,0.0009149356,0.0002336536,0.0005793564,0.0005076242,0.0001404382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004930281,0.0001815685,0.003291084,0.0004102023,0.00004596644,0.0002723,0.0008155603,0.05398605,0.01917294,0.4266188,0.0164247,0.4782879],"study_design_scores_gemma":[0.00005566698,0.00008461498,0.001000417,0.0000658565,0.0000304206,0.0003386104,0.0004943127,0.2127464,0.01899305,0.7418328,0.02429921,0.00005876377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05035382,0.0002652491,0.9345851,0.0007009972,0.00006139026,0.0001658052,0.001465226,0.002060816,0.01034162],"genre_scores_gemma":[0.3017494,0.0002374171,0.6878146,0.0002167898,0.00006156603,0.0001463238,0.003418519,0.0002949593,0.006060479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008532653,"threshold_uncertainty_score":0.01954782,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000682674,0.0003040681,0.0003338884,0.001891235,0.001417453,0.001857518,0.0005806377,0.0004892108,0.004510925],"category_scores_gemma":[0.002646261,0.0002231241,0.0004110569,0.001230922,0.002763141,0.004205212,0.001765629,0.001625776,0.0006240208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110912,"about_ca_system_score_gemma":0.0005224344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007493093,"about_ca_topic_score_gemma":0.0008621924,"domain_scores_codex":[0.9992529,0.0001462921,0.00004057541,0.0002403872,0.0001847386,0.0001350873],"domain_scores_gemma":[0.9986058,0.0004740771,0.0001810348,0.0002040052,0.0003127171,0.0002223786],"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.00005048677,0.000013478,0.0004802035,0.00003414767,0.000004701697,0.00003468139,0.0002388144,0.0006426804,0.003003471,0.9868416,0.0009923312,0.007663422],"study_design_scores_gemma":[0.00001721321,0.00006224508,0.001575531,0.00003105102,0.0000123125,0.0003252892,0.0002872866,0.009937781,0.003524704,0.941318,0.04287392,0.00003457684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5601833,0.001613717,0.3216445,0.002704037,0.0004113526,0.0001670912,0.001725306,0.0003907986,0.1111598],"genre_scores_gemma":[0.9009426,0.0007313017,0.07777031,0.0003851525,0.0002686256,0.0001903354,0.0006865179,0.0001257423,0.01889955],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004510925,"threshold_uncertainty_score":0.01509058,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008433617,0.000874364,0.0004359249,0.001761609,0.001921071,0.003689704,0.001829776,0.001032982,0.01184826],"category_scores_gemma":[0.002372196,0.0003472582,0.0007119013,0.002122118,0.003370311,0.006318926,0.003213095,0.001947412,0.001827277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001944234,"about_ca_system_score_gemma":0.001029014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002621226,"about_ca_topic_score_gemma":0.00238142,"domain_scores_codex":[0.9983594,0.0003183955,0.0001210727,0.0004760171,0.0004115874,0.0003136479],"domain_scores_gemma":[0.9987757,0.0002778486,0.0001625083,0.0003040003,0.0003310262,0.0001489398],"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.00001209793,0.000007873344,0.0001463456,0.00005366669,0.000005385478,0.00005528999,0.0002366317,0.0004653365,0.0008201026,0.9888314,0.002102636,0.007263219],"study_design_scores_gemma":[0.0000159921,0.00002476309,0.0003472267,0.00006704323,0.00002129456,0.0003466267,0.0004250742,0.002988768,0.002091441,0.8344175,0.1592304,0.00002381739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06067684,0.004973001,0.6825428,0.003599201,0.001302887,0.0006119379,0.003677112,0.001455054,0.2411612],"genre_scores_gemma":[0.7182458,0.00441736,0.2132558,0.001716506,0.000761424,0.0004882841,0.00373752,0.000358267,0.05701905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01184826,"threshold_uncertainty_score":0.03963643,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006207944,0.0003558682,0.0003141305,0.001536428,0.001020987,0.00222122,0.0005810457,0.0006527179,0.004961767],"category_scores_gemma":[0.001639205,0.0002599714,0.0003415576,0.001086082,0.004223189,0.004793085,0.001849226,0.002010864,0.0007303287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001593032,"about_ca_system_score_gemma":0.0004099827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002073418,"about_ca_topic_score_gemma":0.001740497,"domain_scores_codex":[0.9997063,0.00006978807,0.00001586978,0.00008523868,0.00008868206,0.00003413993],"domain_scores_gemma":[0.9989957,0.0004039341,0.00008159055,0.0001313848,0.0002381006,0.0001493305],"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.000006488872,0.000003036398,0.00009501687,0.00001942453,0.000001874176,0.00002043278,0.0001432615,0.0004393213,0.0004325292,0.9959735,0.0009209517,0.001944113],"study_design_scores_gemma":[0.000002855724,0.00000465332,0.0001432571,0.00001484759,0.000003090721,0.00004392609,0.00009816301,0.001821863,0.0002828094,0.9827769,0.0148002,0.000007401756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3109865,0.01927332,0.4192437,0.02419861,0.001410128,0.00009127069,0.001279021,0.0006450848,0.2228724],"genre_scores_gemma":[0.9503269,0.002782516,0.03383932,0.0009037678,0.0003508736,0.0000369783,0.0002056499,0.0000906279,0.01146332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004961767,"threshold_uncertainty_score":0.01659876,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008044255,0.0003170822,0.0003551544,0.001572696,0.001191902,0.00209512,0.0005449641,0.0007286053,0.00800663],"category_scores_gemma":[0.001903807,0.0002439673,0.0006653506,0.001320502,0.003351683,0.004898126,0.001427514,0.001653541,0.0009182062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009136666,"about_ca_system_score_gemma":0.0002908347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001408141,"about_ca_topic_score_gemma":0.0007418985,"domain_scores_codex":[0.9991835,0.0001798492,0.00005585913,0.0001419078,0.0003014715,0.0001374228],"domain_scores_gemma":[0.9983911,0.000472471,0.0002773824,0.0002210456,0.0004527053,0.000185213],"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.00004526943,0.00001259846,0.0007038356,0.00002784148,0.000009421018,0.0001593303,0.0002605382,0.0007431908,0.001386104,0.9905877,0.001063505,0.00500062],"study_design_scores_gemma":[0.0000194674,0.00008020027,0.001955254,0.00002095822,0.000009284184,0.0004997483,0.0004669986,0.003791261,0.002275013,0.9718823,0.01897453,0.00002492567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.5980741,0.002718996,0.1829228,0.003040802,0.0002130169,0.00008434629,0.0007975483,0.0003492602,0.2117991],"genre_scores_gemma":[0.972748,0.0005958661,0.01446797,0.0002183314,0.0001910245,0.00004542381,0.0005453072,0.00006036306,0.01112766],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.00800663,"threshold_uncertainty_score":0.02678484,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727974,0.0004050497,0.0009841518,0.002256154,0.002682276,0.004230147,0.001052202,0.00134871,0.01308968],"category_scores_gemma":[0.006467365,0.0006487822,0.001160438,0.001850768,0.004172625,0.01495915,0.004410241,0.003129091,0.00212634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001364323,"about_ca_system_score_gemma":0.0008453497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006808645,"about_ca_topic_score_gemma":0.0006202399,"domain_scores_codex":[0.9980459,0.000286723,0.0001824754,0.0005010357,0.0005527416,0.000431038],"domain_scores_gemma":[0.9937757,0.003078152,0.0005794782,0.001167174,0.0007632021,0.0006363862],"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.00005889887,0.00001833512,0.0004992387,0.000065589,0.00001594042,0.0001784949,0.0005117237,0.0003114862,0.00121066,0.9877902,0.002367555,0.006971828],"study_design_scores_gemma":[0.00001914881,0.0000182913,0.0004332197,0.00001623022,0.00001846795,0.0003338804,0.0001558903,0.0009760271,0.001091665,0.990257,0.006664731,0.00001540453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4189292,0.002285955,0.3417594,0.006502611,0.0006963218,0.000190939,0.002780156,0.001363148,0.2254923],"genre_scores_gemma":[0.9342304,0.001086504,0.02544271,0.001025042,0.000617714,0.0001231927,0.001481661,0.0003534016,0.03563945],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01308968,"threshold_uncertainty_score":0.04378939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}