{"meta":{"query_hash":"be652539adef","filters":{"venue":"Bolyai Society mathematical studies"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/be652539adef","api":"https://metacan.xera.ac/api/v1/cohort?venue=Bolyai+Society+mathematical+studies"},"results":[{"id":"W1660895817","doi":"10.1007/978-3-642-13580-4_1","title":"High Degree Graphs Contain Large-Star Factors","year":2010,"lang":"en","type":"book-chapter","venue":"Bolyai Society mathematical studies","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lemma (botany); Session (web analytics); Star (game theory); Combinatorics; Degree (music); Graph; Simple (philosophy); Computer science; Graph theory; Theoretical computer science; Mathematics; Discrete mathematics; World Wide Web; Physics; Biology; Botany","score_opus":0.07678758911574396,"score_gpt":0.3183262065036169,"score_spread":0.24153861738787297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1660895817","genre_codex":"methods","genre_gemma":"other","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.004196936,0.02193882,0.7480968,0.0054325787,0.0030368008,0.005631496,0.0006543286,0.0037598908,0.20725235],"genre_scores_gemma":[0.013040829,0.0060745166,0.45491168,0.0014350538,0.0006365148,0.0003483654,0.00006826563,0.00051226176,0.5229725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560505,0.000060407463,0.00078912836,0.0011122398,0.0013564837,0.0010767094],"domain_scores_gemma":[0.99531645,0.0019381769,0.0003597893,0.0015768345,0.0004898337,0.00031894905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011103001,0.00091329764,0.0015289926,0.00011333146,0.00082480285,0.00016943674,0.0020022814,0.00071288267,0.00028629685],"category_scores_gemma":[0.00046008726,0.00069441367,0.0012018706,0.00017196556,0.0012152116,0.00032932637,0.0022004824,0.0018246571,0.00038404303],"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.0000047948565,0.00007266025,0.000007895212,0.000287756,0.0008107708,0.000022151822,0.0023963538,3.814635e-7,0.000062891115,0.9932882,0.002391666,0.00065444445],"study_design_scores_gemma":[0.00040792843,0.00011192613,0.000033800676,0.00022036418,0.00007783864,0.000008181669,0.0005355517,0.00012238922,0.00015841023,0.98017454,0.017412908,0.00073614594],"about_ca_topic_score_codex":0.000002696672,"about_ca_topic_score_gemma":0.000017296992,"teacher_disagreement_score":0.31572014,"about_ca_system_score_codex":0.00016727079,"about_ca_system_score_gemma":0.00009856498,"threshold_uncertainty_score":0.9995507},"labels":[],"label_agreement":null},{"id":"W2914225674","doi":"10.1007/978-3-662-59204-5_12","title":"Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization","year":2019,"lang":"en","type":"book-chapter","venue":"Bolyai Society mathematical studies","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Matroid; Time complexity; Combinatorics; Discrete mathematics","score_opus":0.05040942084495267,"score_gpt":0.3060948645624244,"score_spread":0.25568544371747176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914225674","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.000037989685,0.008454676,0.9571527,0.00089444814,0.00017279376,0.0011840904,0.000013652367,0.00022524613,0.03186439],"genre_scores_gemma":[0.001267197,0.0551133,0.74321663,0.00087192527,0.00030734844,0.00020997238,0.000060432732,0.00023333028,0.19871986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972653,0.00007637543,0.000511362,0.00085368974,0.000837753,0.00045552666],"domain_scores_gemma":[0.9976602,0.0007531203,0.00030617425,0.0008004429,0.00038229584,0.000097764816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007481554,0.00053353206,0.00097368826,0.000059132635,0.00044071992,0.00017365314,0.0005794169,0.00030266834,0.00006021412],"category_scores_gemma":[0.00019969416,0.00044753886,0.00040284227,0.0001503928,0.0005675401,0.0006034293,0.0008431044,0.0004187477,0.00007618918],"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.000019908051,0.00004479297,0.000006645015,0.0006908123,0.0007389162,0.0000038176404,0.0024725155,0.000885011,0.000011654648,0.9916258,0.0029258635,0.0005742555],"study_design_scores_gemma":[0.0014340178,0.00007455058,0.000004934189,0.00036002367,0.00012345966,0.000008698634,0.00021723544,0.017029684,0.0000427884,0.9764315,0.0036984629,0.000574674],"about_ca_topic_score_codex":9.059898e-7,"about_ca_topic_score_gemma":0.0000012824249,"teacher_disagreement_score":0.21393609,"about_ca_system_score_codex":0.00012381507,"about_ca_system_score_gemma":0.00005273092,"threshold_uncertainty_score":0.99979764},"labels":[],"label_agreement":null},{"id":"W4403255385","doi":"10.1007/978-3-031-56611-0_1","title":"Heegaard Floer Homology","year":2024,"lang":"en","type":"book-chapter","venue":"Bolyai Society mathematical studies","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Floer homology; Mathematics; Pure mathematics; Morse homology; Algebra over a field; Cellular homology","score_opus":0.11742172484407423,"score_gpt":0.35859233096459997,"score_spread":0.24117060612052574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403255385","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000202321,0.043260653,0.0015430114,0.0046286033,0.0012071648,0.000778112,0.000088993605,0.00082109857,0.94747007],"genre_scores_gemma":[0.0006527516,0.0029041811,0.012777376,0.00052373955,0.0008591236,0.00009749093,0.000010978232,0.00023355408,0.9819408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664664,0.000024896592,0.0010859057,0.0008628301,0.0006449098,0.00073480955],"domain_scores_gemma":[0.995946,0.0026098022,0.00030460494,0.00074733247,0.00022793988,0.00016434953],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006561542,0.00089903007,0.0021314574,0.00013972158,0.0002579685,0.00005422831,0.00044952342,0.0010207855,0.002734296],"category_scores_gemma":[0.0007455376,0.00067759573,0.0014594451,0.00014364257,0.0012177153,0.000048347767,0.00092674606,0.0011500232,0.0046228394],"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.0000029409662,0.000052707503,4.843325e-7,0.0018754973,0.002326968,0.000058995938,0.0013675443,4.5252698e-8,0.0000018304648,0.7704349,0.22320423,0.0006738687],"study_design_scores_gemma":[0.00020163489,0.00009552398,8.187251e-7,0.00046419806,0.0009221532,0.000113217335,0.00082369545,0.00001408567,0.0000071096115,0.8444407,0.15235354,0.00056331186],"about_ca_topic_score_codex":0.0000011424788,"about_ca_topic_score_gemma":0.0000024311244,"teacher_disagreement_score":0.07400582,"about_ca_system_score_codex":0.00023052622,"about_ca_system_score_gemma":0.00007651342,"threshold_uncertainty_score":0.9995675},"labels":[],"label_agreement":null},{"id":"W95359580","doi":"10.1007/978-3-540-32439-3_3","title":"Discrepancy in Graphs and Hypergraphs","year":2006,"lang":"en","type":"book-chapter","venue":"Bolyai Society mathematical studies","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics","score_opus":0.051721357207322405,"score_gpt":0.30997869308385506,"score_spread":0.25825733587653266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95359580","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018742958,0.03901424,0.00023863607,0.0006706216,0.00043194115,0.0016608034,0.00013119944,0.00051427,0.93859535],"genre_scores_gemma":[0.045891363,0.027902065,0.066194974,0.00085923885,0.0006336665,0.00035033145,0.000041361625,0.00077215664,0.8573548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723756,0.000035543784,0.0009809176,0.00067760225,0.0005528755,0.00051547604],"domain_scores_gemma":[0.99738705,0.0014881878,0.00032105035,0.00059476326,0.00010582823,0.000103096616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005748478,0.00078846066,0.0016124502,0.00011030703,0.00039887617,0.00004461129,0.00027985542,0.00058200496,0.00010584642],"category_scores_gemma":[0.00026119134,0.00057910534,0.0008094273,0.000084965795,0.0011930435,0.000077291625,0.00061132235,0.0007052938,0.0000108823015],"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.0000075878233,0.000057669404,0.00006512069,0.0014145544,0.0006219431,0.00001773573,0.002453257,1.16495606e-7,0.0000025815486,0.97343934,0.021429826,0.00049026386],"study_design_scores_gemma":[0.0004228281,0.00004622255,0.00010551209,0.00087676756,0.000319566,0.000023868737,0.0005781855,0.00001576792,0.0000036818183,0.9920115,0.0049530575,0.00064303394],"about_ca_topic_score_codex":0.0000040578248,"about_ca_topic_score_gemma":0.000018714198,"teacher_disagreement_score":0.08124049,"about_ca_system_score_codex":0.000079874146,"about_ca_system_score_gemma":0.000020180869,"threshold_uncertainty_score":0.99966604},"labels":[],"label_agreement":null}]}