{"meta":{"query_hash":"52a92b309710","filters":{"venue":"Journal of Combinatorial Theory Series B"},"cohort_total":230,"direct_labels_cover":0,"predictions_cover":230,"exported":230,"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/52a92b309710","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Combinatorial+Theory+Series+B"},"results":[{"id":"W1500536468","doi":"10.1016/j.jctb.2015.05.002","title":"Edge-colouring eight-regular planar graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Planar graph; Conjecture; Complement (music); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.01002942422884646,"score_gpt":0.1973660829021129,"score_spread":0.18733665867326646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500536468","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.850835,0.00021149295,0.06439378,0.0008511607,0.00011410428,0.0000888019,0.00059937546,0.00039019217,0.082516015],"genre_scores_gemma":[0.95001286,0.00025608987,0.029673802,0.00021864036,0.00003830251,0.00004950312,0.0006234163,0.000089153385,0.01903828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995689,0.00008864974,0.000021819546,0.00009606288,0.000087791916,0.00013677435],"domain_scores_gemma":[0.9987398,0.00045814217,0.0002091284,0.00018109067,0.00019371526,0.00021812896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002984429,0.00059981336,0.0005620613,0.00094324804,0.0011766651,0.0016754487,0.0013328722,0.0008823112,0.007834103],"category_scores_gemma":[0.0016709777,0.0004229965,0.00037738905,0.0009155374,0.0014382593,0.00111935,0.001257864,0.0012145246,0.0010319533],"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.0010268269,0.00023965679,0.0034554661,0.0003205927,0.00007965779,0.0011394379,0.0010703738,0.025222337,0.03679167,0.8650666,0.008615879,0.05697149],"study_design_scores_gemma":[0.00023345617,0.00018639074,0.003129098,0.00008038123,0.000109817105,0.0009821358,0.00095073954,0.04881817,0.013225505,0.91324127,0.018973723,0.00006927347],"about_ca_topic_score_codex":0.0017235785,"about_ca_topic_score_gemma":0.002540269,"teacher_disagreement_score":0.007834103,"about_ca_system_score_codex":0.0007779199,"about_ca_system_score_gemma":0.0005603747,"threshold_uncertainty_score":0.026207685},"labels":[],"label_agreement":null},{"id":"W1508755082","doi":"10.1006/jctb.2000.2009","title":"High-Girth Graphs Avoiding a Minor are Nearly Bipartite","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Triangle-free graph; Odd graph; Discrete mathematics; Bipartite graph; Homomorphism; 1-planar graph; Planar graph; Girth (graph theory); Foster graph; Graph homomorphism; Graph power; Graph minor; Graph; Line graph","score_opus":0.015223306658726087,"score_gpt":0.2601376903989754,"score_spread":0.2449143837402493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508755082","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.9186245,0.0002002125,0.051624503,0.0006855307,0.000097506,0.00010019702,0.0008347814,0.00061712705,0.027215585],"genre_scores_gemma":[0.9677865,0.00023116611,0.020548016,0.0004023945,0.00009651346,0.00010235557,0.00125104,0.0002302807,0.009351637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994611,0.00011988854,0.000031640764,0.00012961854,0.0001232752,0.00013441728],"domain_scores_gemma":[0.9943878,0.0025422839,0.0010300808,0.0008046329,0.0004644005,0.00077066023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050013105,0.00061336806,0.0008890599,0.001195524,0.0022248365,0.002550757,0.0009657191,0.001290922,0.0066453833],"category_scores_gemma":[0.0042073214,0.0011369414,0.0007667975,0.0014926688,0.0013913917,0.0024440098,0.0014650277,0.0014654895,0.0013305899],"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.0019026654,0.0004387398,0.016557407,0.00059695536,0.00022149565,0.002209402,0.0023586424,0.012787049,0.07625957,0.82699513,0.01478997,0.04488302],"study_design_scores_gemma":[0.00012316632,0.00019564848,0.0075785145,0.00003937556,0.00011653405,0.0028917287,0.0008640454,0.023739183,0.011645112,0.94569206,0.007062114,0.000052512438],"about_ca_topic_score_codex":0.0005464593,"about_ca_topic_score_gemma":0.0010487005,"teacher_disagreement_score":0.0066453833,"about_ca_system_score_codex":0.00045554838,"about_ca_system_score_gemma":0.00038795904,"threshold_uncertainty_score":0.022231042},"labels":[],"label_agreement":null},{"id":"W1512371449","doi":"10.1016/j.jctb.2015.11.002","title":"On Rota's Conjecture and nested separations in matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Conjecture; Combinatorics; Mathematics; Nested set model; Computer science; Programming language","score_opus":0.01714138966048585,"score_gpt":0.2926170667063513,"score_spread":0.27547567704586545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512371449","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.4639081,0.0029876938,0.19714053,0.03441551,0.0018670069,0.00016556893,0.0010963029,0.0009701176,0.2974492],"genre_scores_gemma":[0.92580765,0.0018714591,0.039153453,0.0031018846,0.0016760315,0.00015529618,0.0011619799,0.00026554937,0.026806692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972977,0.00093556405,0.00014032824,0.0006004009,0.000571823,0.00045425395],"domain_scores_gemma":[0.9871349,0.0083653685,0.0009214898,0.0018262542,0.0007909955,0.00096099864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027699012,0.00086286466,0.002295079,0.0016050822,0.0049104337,0.0058688065,0.0028176794,0.004623383,0.016963812],"category_scores_gemma":[0.016581494,0.0013118571,0.0019902247,0.002658411,0.008503713,0.01735581,0.0046748393,0.007360876,0.0022089856],"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.00008092463,0.000051419003,0.00041425167,0.00006953469,0.000010139052,0.000077499826,0.00034645325,0.0015864382,0.00031967534,0.988639,0.0042903735,0.0041142423],"study_design_scores_gemma":[0.000019988953,0.000009316734,0.000118400094,0.000014193783,0.000004430843,0.000052833457,0.00013201307,0.002333596,0.000070240705,0.9956008,0.0016357313,0.000008405729],"about_ca_topic_score_codex":0.0022446977,"about_ca_topic_score_gemma":0.0025975793,"teacher_disagreement_score":0.016963812,"about_ca_system_score_codex":0.0017371427,"about_ca_system_score_gemma":0.0011354446,"threshold_uncertainty_score":0.056749582},"labels":[],"label_agreement":null},{"id":"W1529872609","doi":"10.1016/j.jctb.2015.05.011","title":"The structure of 2-separations of infinite matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"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":"Matroid; Combinatorics; Mathematics; Invariant (physics); Graphic matroid; Duality (order theory); Tree (set theory); Discrete mathematics; Mathematical physics","score_opus":0.01746079313427293,"score_gpt":0.29334364779114674,"score_spread":0.2758828546568738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529872609","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.87583405,0.0007633191,0.057125967,0.001458016,0.00017494046,0.000040568637,0.0004845358,0.00029404697,0.06382443],"genre_scores_gemma":[0.9731164,0.00029643023,0.012512697,0.00025601717,0.00023014568,0.00004428656,0.00052231806,0.00009085296,0.012930857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951327,0.000121088924,0.000030109497,0.00009050954,0.00014081635,0.00010412299],"domain_scores_gemma":[0.99810934,0.0007231434,0.00043167005,0.0001519862,0.00019598952,0.0003878835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043873847,0.0005034882,0.000619206,0.0018700305,0.0017852512,0.0040249606,0.0013235606,0.0013132629,0.008867138],"category_scores_gemma":[0.0020992835,0.0006764792,0.0005183561,0.0014960385,0.0021828546,0.0036661162,0.0014038815,0.0019961863,0.0010930076],"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.00010242223,0.000056944722,0.000613504,0.000044209453,0.000009831263,0.00013445261,0.00047236576,0.0022087942,0.0022959374,0.98764336,0.0015300032,0.004888121],"study_design_scores_gemma":[0.0000253189,0.000032036598,0.00055882306,0.00001610909,0.0000070843807,0.00018843038,0.00019726703,0.007450523,0.0006093452,0.9882067,0.0026912624,0.00001706656],"about_ca_topic_score_codex":0.0005035148,"about_ca_topic_score_gemma":0.0007348988,"teacher_disagreement_score":0.008867138,"about_ca_system_score_codex":0.0009807579,"about_ca_system_score_gemma":0.00046026093,"threshold_uncertainty_score":0.029663563},"labels":[],"label_agreement":null},{"id":"W1547065387","doi":"10.1016/j.jctb.2016.06.006","title":"5-list-coloring planar graphs with distant precolored vertices","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Planar graph; Order (exchange); Graph; Planar; Induced subgraph; Graph homomorphism","score_opus":0.011021558989236077,"score_gpt":0.24589534272845842,"score_spread":0.23487378373922235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547065387","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.53001225,0.00052119925,0.30645698,0.0019274482,0.00051097653,0.0003718368,0.002791048,0.0033819417,0.15402637],"genre_scores_gemma":[0.7566964,0.00032347822,0.20234668,0.00065580785,0.0000787706,0.00016647278,0.0035418137,0.00049460016,0.03569594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.00012575228,0.000044977205,0.00018327779,0.00014262393,0.0002603894],"domain_scores_gemma":[0.99814653,0.00045937658,0.00021163045,0.00049198937,0.0003416404,0.00034881965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047757424,0.000815378,0.0007057983,0.0009591692,0.002488024,0.0027449646,0.0023840407,0.0013809202,0.024946596],"category_scores_gemma":[0.0019857292,0.00073785597,0.00088812393,0.0013336901,0.0010265973,0.0026220793,0.002514185,0.0016034906,0.004126899],"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.0018158437,0.00076947815,0.008321349,0.0012039447,0.00020310775,0.0015833873,0.0013665516,0.044878088,0.051545255,0.6859626,0.03809919,0.16425115],"study_design_scores_gemma":[0.0004871736,0.0005297403,0.0050170715,0.00023236894,0.00037159555,0.0022414066,0.002087043,0.12108142,0.06253014,0.7385281,0.0667452,0.00014880607],"about_ca_topic_score_codex":0.0027007072,"about_ca_topic_score_gemma":0.0069780718,"teacher_disagreement_score":0.024946596,"about_ca_system_score_codex":0.001583878,"about_ca_system_score_gemma":0.0013160049,"threshold_uncertainty_score":0.08345467},"labels":[],"label_agreement":null},{"id":"W1548559198","doi":"10.1016/j.jctb.2014.12.003","title":"Matroid 3-connectivity and branch width","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Matroid; Combinatorics; Minor (academic); Mathematics; Integer (computer science); Oriented matroid; Matroid partitioning; Set (abstract data type); Discrete mathematics; Graphic matroid; Computer science; Humanities","score_opus":0.018418209423534875,"score_gpt":0.27575564629247123,"score_spread":0.25733743686893634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548559198","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.8712724,0.0012387675,0.055186044,0.0024041242,0.00009175696,0.00004927911,0.0010810464,0.000321487,0.068355285],"genre_scores_gemma":[0.9812138,0.00064178236,0.010561427,0.00027874124,0.00016994351,0.00006603381,0.0005690623,0.00012410257,0.0063751163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995308,0.00009172689,0.000027350934,0.00013344426,0.00011324825,0.000103498736],"domain_scores_gemma":[0.99448895,0.003234414,0.0009873606,0.0003130075,0.00033971237,0.00063650525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064810325,0.0005098911,0.000943911,0.002319343,0.0014373049,0.0040881825,0.0017658604,0.001671024,0.017455548],"category_scores_gemma":[0.0055821748,0.0007909615,0.0006424834,0.0027205793,0.002225689,0.0067620957,0.0018665788,0.0028730035,0.00104488],"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.00024864572,0.0001151445,0.0048920945,0.00015840646,0.000036683745,0.00026761537,0.00075114414,0.0053242357,0.004589058,0.96184105,0.0046811337,0.01709481],"study_design_scores_gemma":[0.000037090438,0.000030269333,0.0026903339,0.00003538492,0.000044160726,0.00058605534,0.00030817062,0.014419498,0.0013074344,0.9775219,0.0029996592,0.000020034815],"about_ca_topic_score_codex":0.0009339409,"about_ca_topic_score_gemma":0.0011504069,"teacher_disagreement_score":0.017455548,"about_ca_system_score_codex":0.0008671742,"about_ca_system_score_gemma":0.00031738018,"threshold_uncertainty_score":0.05839461},"labels":[],"label_agreement":null},{"id":"W1550666632","doi":"10.1016/j.jctb.2016.11.004","title":"5-choosability of graphs with crossings far apart","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Planar graph; Graph; Plane (geometry); Outerplanar graph; Line graph; Crossing number (knot theory)","score_opus":0.006835304738614545,"score_gpt":0.22240173226694906,"score_spread":0.21556642752833452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550666632","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.9174395,0.00023573198,0.043357085,0.00069897453,0.00008097501,0.0000666515,0.0006375033,0.0003067013,0.03717687],"genre_scores_gemma":[0.9736363,0.00022996907,0.015756255,0.00021878502,0.00006213705,0.00005697081,0.0013240586,0.0002268613,0.008488648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989592,0.00016644468,0.000085994674,0.000299599,0.0002484997,0.00024026274],"domain_scores_gemma":[0.99453944,0.0028679823,0.00081059337,0.00063833577,0.0002665226,0.00087715103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008958615,0.0008498524,0.0012141458,0.0012447556,0.001662473,0.004230802,0.0021162552,0.001961516,0.018351834],"category_scores_gemma":[0.004307369,0.0011585393,0.0015212948,0.0015401044,0.0018181821,0.0033047807,0.0022813277,0.0024931747,0.0012957206],"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.0012888429,0.00039574996,0.010823022,0.00046289994,0.00014888654,0.002009215,0.001760123,0.03715849,0.026128644,0.87582004,0.0065398715,0.037464272],"study_design_scores_gemma":[0.0003184632,0.00018627523,0.0063249646,0.000108824286,0.00015152853,0.0012885527,0.001002444,0.06375861,0.013502951,0.9077241,0.005549337,0.00008394961],"about_ca_topic_score_codex":0.0013315603,"about_ca_topic_score_gemma":0.0015377655,"teacher_disagreement_score":0.018351834,"about_ca_system_score_codex":0.0011527537,"about_ca_system_score_gemma":0.00071723235,"threshold_uncertainty_score":0.061392963},"labels":[],"label_agreement":null},{"id":"W1567232491","doi":"10.1006/jctb.2001.2092","title":"On a Conjecture of Lovász Concerning Bricks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Mathematics and Applications","field":"Mathematics","cited_by":30,"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":"Conjecture; Mathematics; Combinatorics; Pure mathematics; Discrete mathematics; Mathematical economics","score_opus":0.03782515546227876,"score_gpt":0.2854606832712119,"score_spread":0.2476355278089331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567232491","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.3897444,0.0052790497,0.07549471,0.15708517,0.00725284,0.00014679032,0.0013883867,0.0007911788,0.3628175],"genre_scores_gemma":[0.93567395,0.0020173802,0.012852952,0.0075682653,0.0038860366,0.00014270873,0.0010746766,0.00029504808,0.03648889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997792,0.0005558001,0.00012723864,0.00061945233,0.00039989414,0.0005055758],"domain_scores_gemma":[0.9897355,0.0070700385,0.0007489583,0.0011397788,0.00075287296,0.0005528061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033154972,0.0008820141,0.0029541194,0.0024087662,0.00693228,0.005962705,0.0028142182,0.007912058,0.022476543],"category_scores_gemma":[0.021513775,0.0011185373,0.0019485978,0.003424277,0.01207892,0.023339158,0.006543318,0.008807138,0.0029771125],"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.00008684714,0.000023933399,0.00022736458,0.000054930635,0.000007608452,0.00006872422,0.0003717631,0.00031429558,0.0001528509,0.98868376,0.0076743565,0.002333537],"study_design_scores_gemma":[0.0000401016,0.000010627165,0.00013735605,0.000024064715,0.000010960744,0.000057314355,0.00016101841,0.0006469581,0.000097062875,0.99328953,0.005509703,0.000015266194],"about_ca_topic_score_codex":0.002735153,"about_ca_topic_score_gemma":0.0016265056,"teacher_disagreement_score":0.022476543,"about_ca_system_score_codex":0.0028945946,"about_ca_system_score_gemma":0.001175924,"threshold_uncertainty_score":0.07519156},"labels":[],"label_agreement":null},{"id":"W1613467653","doi":"10.1016/j.jctb.2015.12.005","title":"Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Lemma (botany); Conjecture; Isoperimetric inequality; Graph; Vertex (graph theory); Induced subgraph; Discrete mathematics; Botany","score_opus":0.033757637382348084,"score_gpt":0.3304632292392484,"score_spread":0.2967055918569003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1613467653","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.45066833,0.0055380305,0.21714738,0.011456903,0.0008534973,0.00028983763,0.0019398791,0.002699189,0.30940697],"genre_scores_gemma":[0.9101523,0.002144272,0.047977,0.001947777,0.0007087035,0.0002144858,0.0015237262,0.0009512215,0.034380484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987962,0.00017649285,0.000039830273,0.00027164127,0.00026293047,0.00045282464],"domain_scores_gemma":[0.99060726,0.005861557,0.00052857754,0.00091871526,0.0007683404,0.0013156073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095343776,0.001552881,0.0010649455,0.0030103235,0.0029144112,0.0056124176,0.0041263974,0.0018597735,0.027235365],"category_scores_gemma":[0.007300459,0.0008291857,0.0011900221,0.0027448,0.0029054487,0.0075027444,0.0034427962,0.0041675363,0.0040430957],"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.00069026113,0.00033186973,0.0044570114,0.0008565504,0.000077007535,0.00043563338,0.0010525315,0.027108386,0.011931137,0.8662379,0.04468648,0.042135194],"study_design_scores_gemma":[0.00008378054,0.000116412535,0.002572543,0.00016691013,0.00013952183,0.00046448302,0.00088571064,0.1113865,0.008098696,0.8596881,0.016319389,0.00007797254],"about_ca_topic_score_codex":0.0046405066,"about_ca_topic_score_gemma":0.008005175,"teacher_disagreement_score":0.027235365,"about_ca_system_score_codex":0.0040825815,"about_ca_system_score_gemma":0.0013670842,"threshold_uncertainty_score":0.09111136},"labels":[],"label_agreement":null},{"id":"W161675474","doi":"10.1016/j.jctb.2007.10.005","title":"Corrigendum to “Counting connected graphs inside-out” [J. Combin. Theory Ser. B 93 (2005) 127–172]","year":2008,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"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":"Combinatorics; Mathematics; Computer science","score_opus":0.021592723447045832,"score_gpt":0.27204120898922163,"score_spread":0.2504484855421758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161675474","genre_codex":"editorial","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.00026168814,0.0051630023,0.0022696713,0.045599405,0.93023396,0.00009133617,0.0012277997,0.00071225717,0.014440922],"genre_scores_gemma":[0.015847802,0.022246897,0.008803124,0.09011134,0.48092178,0.0005729793,0.006282615,0.0024074113,0.37280604],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943463,0.0010628735,0.0006701836,0.001058481,0.0023370949,0.0005250911],"domain_scores_gemma":[0.9830205,0.004259912,0.0007302923,0.0015010019,0.009452713,0.0010355742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038936704,0.004406547,0.0053551956,0.0080109555,0.004479849,0.004569648,0.007999784,0.005858694,0.12015045],"category_scores_gemma":[0.029803101,0.0021739677,0.0049215835,0.004917753,0.003926419,0.0064931773,0.0032877752,0.0069821766,0.066768825],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00005131197,0.000018358347,0.000050476432,0.00025931562,0.0000378262,0.00012301403,0.000019446225,0.000102261336,0.00009437103,0.0020684435,0.9921308,0.0050443425],"study_design_scores_gemma":[0.00012375272,0.00012338762,0.0029223962,0.00037370977,0.0001958595,0.0007963766,0.00008779735,0.0012631688,0.00086933345,0.024756754,0.9683183,0.00016912038],"about_ca_topic_score_codex":0.014653779,"about_ca_topic_score_gemma":0.016785348,"teacher_disagreement_score":0.12015045,"about_ca_system_score_codex":0.007099346,"about_ca_system_score_gemma":0.00272934,"threshold_uncertainty_score":0.40194327},"labels":[],"label_agreement":null},{"id":"W1650378662","doi":"10.1016/j.jctb.2015.08.003","title":"The critical number of dense triangle-free binary matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"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":"Office of Naval Research","keywords":"Matroid; Combinatorics; Conjecture; Mathematics; Binary number; Simple (philosophy); Statement (logic); Integer (computer science); Discrete mathematics; Computer science; Arithmetic; Law","score_opus":0.03175829879797034,"score_gpt":0.32562907512655026,"score_spread":0.29387077632857994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650378662","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.8869774,0.0014606987,0.023577487,0.0027463492,0.00022159453,0.000045672958,0.00035738962,0.00025401288,0.08435928],"genre_scores_gemma":[0.99156624,0.00047673122,0.002536312,0.00016484773,0.0002855856,0.00005093748,0.00022536461,0.00005438082,0.00463945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992514,0.00016323385,0.00003474183,0.00013322098,0.00024171242,0.00017560502],"domain_scores_gemma":[0.9925459,0.004059007,0.00090948964,0.00032368634,0.0004951194,0.0016667182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001232317,0.00071365526,0.0012221601,0.004490985,0.0025044254,0.0050379466,0.0019401865,0.0015761415,0.009843045],"category_scores_gemma":[0.0108656185,0.0010754875,0.00042296568,0.001859956,0.004620939,0.0058684587,0.002195065,0.001968568,0.00052210287],"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.00013965521,0.000037387803,0.0010491516,0.00008848516,0.000014471707,0.00011111074,0.00035281875,0.0025776927,0.0019660136,0.9875651,0.0023528766,0.0037451435],"study_design_scores_gemma":[0.0000515493,0.000024853363,0.00096937694,0.00003923512,0.000017281285,0.0002823765,0.00019437385,0.015997209,0.0012126778,0.9795634,0.0016267081,0.000020959209],"about_ca_topic_score_codex":0.0012088479,"about_ca_topic_score_gemma":0.0013024614,"teacher_disagreement_score":0.009843045,"about_ca_system_score_codex":0.002062142,"about_ca_system_score_gemma":0.0006808077,"threshold_uncertainty_score":0.032928288},"labels":[],"label_agreement":null},{"id":"W1658178599","doi":"10.1016/j.jctb.2015.07.001","title":"A transition of limiting distributions of large matchings in random graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Limiting; Mathematics; Asymptotic distribution; Combinatorics; Range (aeronautics); Distribution (mathematics); Statistical physics; Discrete mathematics; Statistics; Physics; Mathematical analysis; Materials science","score_opus":0.01959443799609526,"score_gpt":0.28452176409885827,"score_spread":0.264927326102763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658178599","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.80137557,0.0014097403,0.16714254,0.0054077297,0.0002265607,0.00013620834,0.0006297186,0.0016252602,0.022046618],"genre_scores_gemma":[0.98623484,0.00041921067,0.008497092,0.00034469587,0.00020791913,0.00009135683,0.00022900746,0.00021884892,0.0037569616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844885,0.0006140942,0.00005798738,0.0003535366,0.00024287478,0.00028257814],"domain_scores_gemma":[0.9688692,0.021794928,0.0022202444,0.0022472732,0.0015436035,0.0033247056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006052798,0.00065533427,0.001960676,0.004154614,0.002110952,0.0056333253,0.004518278,0.0031622988,0.008700817],"category_scores_gemma":[0.051168952,0.001721427,0.0016114333,0.0017573728,0.0065204357,0.009593908,0.0028262066,0.00405516,0.0007616654],"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.00018984225,0.0001739673,0.0027697643,0.00015559582,0.000041249987,0.00028016756,0.00078216445,0.014770414,0.0032313818,0.96986365,0.0032800813,0.004461602],"study_design_scores_gemma":[0.00007915342,0.000079089725,0.0031174337,0.00010031938,0.00004624425,0.0005415033,0.00044751738,0.24035054,0.0013817963,0.7525982,0.0011781773,0.00008001492],"about_ca_topic_score_codex":0.0027801262,"about_ca_topic_score_gemma":0.0017497187,"teacher_disagreement_score":0.008700817,"about_ca_system_score_codex":0.003202278,"about_ca_system_score_gemma":0.0011587819,"threshold_uncertainty_score":0.032010615},"labels":[],"label_agreement":null},{"id":"W1683401792","doi":"10.1016/j.jctb.2015.11.005","title":"Certifying non-representability of matroids over prime fields","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Prime (order theory); Mathematics; Computer science; Combinatorics","score_opus":0.030494904017273235,"score_gpt":0.3143289892299906,"score_spread":0.28383408521271736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683401792","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.75840825,0.00045643435,0.20622124,0.006828437,0.00046880342,0.00016819745,0.0011310355,0.0020598455,0.024257705],"genre_scores_gemma":[0.9805248,0.00023139165,0.014168187,0.0005228689,0.0004579952,0.00007379496,0.00086787477,0.00024063657,0.0029124902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939136,0.0014226857,0.0004411295,0.0016898356,0.0014014387,0.0011313843],"domain_scores_gemma":[0.94114923,0.03923758,0.005307663,0.008661164,0.00318066,0.002463653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045038112,0.001159248,0.0022925679,0.0014291635,0.002338235,0.0067803464,0.0034366176,0.0032100528,0.006381666],"category_scores_gemma":[0.037231322,0.001593334,0.001995382,0.0019832323,0.006146901,0.012780552,0.0052007013,0.008445835,0.00089310645],"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.0012449772,0.0004224109,0.0065613613,0.0005553882,0.00022627747,0.0010587667,0.001616638,0.032366775,0.007998376,0.90724593,0.0085390005,0.032164052],"study_design_scores_gemma":[0.000094876705,0.00007858515,0.00039635398,0.000030859057,0.000043021457,0.00028641624,0.00013698424,0.024289664,0.0021344747,0.9713102,0.0011717614,0.000026667476],"about_ca_topic_score_codex":0.0007776405,"about_ca_topic_score_gemma":0.0008206775,"teacher_disagreement_score":0.0067803464,"about_ca_system_score_codex":0.001892079,"about_ca_system_score_gemma":0.0016935412,"threshold_uncertainty_score":0.023818731},"labels":[],"label_agreement":null},{"id":"W1850205219","doi":"10.1016/j.jctb.2017.04.005","title":"The extremal function for disconnected minors","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Infimum and supremum; Mathematics; Robertson–Seymour theorem; Graph; Disjoint sets; Minor (academic); Null (SQL); Vertex (graph theory); Discrete mathematics; 1-planar graph; Computer science; Humanities; Line graph; Art","score_opus":0.037965161545544364,"score_gpt":0.31332659824379777,"score_spread":0.2753614366982534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850205219","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.75220275,0.003096262,0.13321479,0.0064178617,0.00065155316,0.000056684654,0.0004053435,0.00054156285,0.10341317],"genre_scores_gemma":[0.97128886,0.0010227832,0.010068443,0.00037851787,0.0009799005,0.00007325437,0.00026826301,0.00024327172,0.015676681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992054,0.00028712975,0.00003949015,0.00016091733,0.00017986225,0.00012714941],"domain_scores_gemma":[0.99657637,0.0016824828,0.0004233686,0.00023808352,0.0003034921,0.00077607395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016107493,0.0014001235,0.0013851441,0.0061703688,0.002367768,0.004963759,0.0024442703,0.0026548076,0.007672694],"category_scores_gemma":[0.010137343,0.00080464204,0.00090281473,0.0019048332,0.005285356,0.0073136506,0.003705094,0.0033131342,0.0008248578],"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.000038438593,0.000022860413,0.00036582502,0.00003871204,0.000007954729,0.00007722435,0.00017453668,0.0007602539,0.00047760975,0.99374264,0.00127615,0.0030177762],"study_design_scores_gemma":[0.000008892413,0.0000061238597,0.00020459028,0.000016017124,0.000007011452,0.00014265551,0.000055367196,0.0061854636,0.00016241323,0.9923201,0.0008814348,0.000009946369],"about_ca_topic_score_codex":0.0006697588,"about_ca_topic_score_gemma":0.0005517077,"teacher_disagreement_score":0.007672694,"about_ca_system_score_codex":0.0019332304,"about_ca_system_score_gemma":0.0005775135,"threshold_uncertainty_score":0.025667727},"labels":[],"label_agreement":null},{"id":"W1891427623","doi":"10.1016/j.jctb.2014.11.005","title":"Edge-colouring seven-regular planar graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Mitsubishi Foundation; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Multigraph; Combinatorics; Mathematics; Conjecture; Complement (music); Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Set (abstract data type); Discrete mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.010203735005251237,"score_gpt":0.20080065200930536,"score_spread":0.19059691700405412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891427623","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.80772775,0.00027683264,0.08716486,0.0010940734,0.000157688,0.00014037371,0.0008659452,0.00055204635,0.102020346],"genre_scores_gemma":[0.9429087,0.00036550983,0.035633896,0.00030438328,0.00005639403,0.00006778722,0.0011575602,0.00013535941,0.019370416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992599,0.0001523256,0.00004110546,0.00014950933,0.00017375537,0.00022339822],"domain_scores_gemma":[0.9977976,0.0008264012,0.0003172863,0.000297386,0.00038164147,0.0003796909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004462137,0.0007005376,0.00075351726,0.001333448,0.0016116027,0.0022934896,0.0017597777,0.0011285992,0.008817316],"category_scores_gemma":[0.002380197,0.00056252035,0.00059847196,0.001313565,0.0018961537,0.0013158972,0.0016617902,0.0015748972,0.001513519],"study_design_candidate":"not_applicable","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.00077596866,0.00021512002,0.002822466,0.00032985525,0.00009080108,0.0010085941,0.0010102267,0.017771052,0.029555334,0.89353466,0.008356823,0.04452902],"study_design_scores_gemma":[0.00020552044,0.00018215987,0.0029987423,0.000087799504,0.00014398796,0.0010068303,0.0010393836,0.0435368,0.015055267,0.9183226,0.017339142,0.00008183251],"about_ca_topic_score_codex":0.0022195776,"about_ca_topic_score_gemma":0.0030804747,"teacher_disagreement_score":0.008817316,"about_ca_system_score_codex":0.0010339238,"about_ca_system_score_gemma":0.00079211214,"threshold_uncertainty_score":0.029496849},"labels":[],"label_agreement":null},{"id":"W1899569194","doi":"10.1016/j.jctb.2016.02.002","title":"Packing Steiner trees","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Steiner tree problem; Conjecture; Mathematics; Disjoint sets; Graph; Spanning tree; Tree (set theory); Discrete mathematics","score_opus":0.014121268360480495,"score_gpt":0.269411629229777,"score_spread":0.2552903608692965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899569194","genre_codex":"other","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.4062875,0.001725331,0.17307499,0.0026895243,0.00088030694,0.00019857955,0.0028021731,0.0013347998,0.4110068],"genre_scores_gemma":[0.8064097,0.0019109572,0.098199114,0.00078176183,0.00041416867,0.00015691416,0.006094101,0.000862489,0.08517078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944335,0.000098767305,0.000035211797,0.00013091731,0.00018165118,0.000109977336],"domain_scores_gemma":[0.9991898,0.00024270365,0.00010583661,0.00022726326,0.00011062309,0.00012364105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024262439,0.0006616123,0.001031515,0.0013522685,0.0015920555,0.0025703828,0.0010248311,0.0015296253,0.03353051],"category_scores_gemma":[0.0023146658,0.00082913635,0.00074469077,0.0029807733,0.00078490266,0.002988005,0.0023533436,0.0024030178,0.0060653593],"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.00031351668,0.00024140066,0.0018286762,0.00032049333,0.00008710529,0.0008596266,0.0005373855,0.015948296,0.011654037,0.7856501,0.05264771,0.1299117],"study_design_scores_gemma":[0.000056781635,0.00010376717,0.0018906916,0.000085957945,0.00008117993,0.0015199372,0.00048683074,0.054349687,0.005801063,0.88972723,0.04586947,0.00002740493],"about_ca_topic_score_codex":0.0005061091,"about_ca_topic_score_gemma":0.00082895625,"teacher_disagreement_score":0.03353051,"about_ca_system_score_codex":0.0007778773,"about_ca_system_score_gemma":0.00041899452,"threshold_uncertainty_score":0.112170696},"labels":[],"label_agreement":null},{"id":"W1928499748","doi":"10.1016/j.jctb.2016.07.008","title":"Non-planar extensions of subdivisions of planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Security Agency; National Science Foundation","keywords":"Combinatorics; Mathematics; Planar graph; Subdivision; Graph; Backslash; Planar; Lemma (botany); Discrete mathematics; Computer science","score_opus":0.013822217486434706,"score_gpt":0.27120107243894753,"score_spread":0.25737885495251284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928499748","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.9062173,0.00036055644,0.03317407,0.00031240273,0.0001318699,0.00003965295,0.00016583184,0.00014578318,0.059452575],"genre_scores_gemma":[0.97124857,0.0004056563,0.009536271,0.00009275038,0.00011728012,0.000027028167,0.00034718146,0.00008845181,0.01813681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996358,0.00006284789,0.000023021566,0.00008169284,0.000114940776,0.000081692524],"domain_scores_gemma":[0.99862385,0.0004933277,0.00025835025,0.00017764453,0.00016245242,0.00028437833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028938756,0.00044384485,0.000501641,0.0011663385,0.0007927529,0.0020360383,0.0011430612,0.00061095326,0.007197276],"category_scores_gemma":[0.0021259086,0.0004375836,0.00074338546,0.0008866125,0.0014038052,0.0022067397,0.0024153406,0.0019469098,0.0006305907],"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.00016022105,0.00010567205,0.0016730617,0.000082955754,0.000018596063,0.0005826442,0.0007954966,0.0035199118,0.005817625,0.96474254,0.001382012,0.02111924],"study_design_scores_gemma":[0.00004184116,0.00006453711,0.002472119,0.00003980114,0.00003558074,0.00075708964,0.0006429205,0.011722441,0.0015577835,0.9722343,0.010412357,0.000019157098],"about_ca_topic_score_codex":0.00064724707,"about_ca_topic_score_gemma":0.0012756353,"teacher_disagreement_score":0.007197276,"about_ca_system_score_codex":0.0006050573,"about_ca_system_score_gemma":0.00030730007,"threshold_uncertainty_score":0.024077356},"labels":[],"label_agreement":null},{"id":"W1964757115","doi":"10.1016/j.jctb.2007.09.002","title":"Generating weakly 4-connected matroids","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"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":"Matroid; Mathematics; Combinatorics; Graphic matroid; Oriented matroid; Matroid partitioning; Element (criminal law); Minor (academic); Discrete mathematics","score_opus":0.011170585007555882,"score_gpt":0.27695689597859524,"score_spread":0.2657863109710394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964757115","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.83528984,0.0002469857,0.08211932,0.0012395526,0.00018732266,0.00013851364,0.00051351084,0.0003288501,0.07993604],"genre_scores_gemma":[0.9285415,0.00021360227,0.02544776,0.00030438614,0.00016799799,0.00016616225,0.0008863474,0.00022776128,0.044044532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953604,0.00013188401,0.00002801358,0.000071779556,0.00013326363,0.00009905134],"domain_scores_gemma":[0.99833125,0.0008150092,0.00019362383,0.00016403472,0.00021783709,0.00027832814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000457503,0.0008288058,0.0007464528,0.0017051948,0.0015247356,0.003065067,0.0013519607,0.001434607,0.014794969],"category_scores_gemma":[0.0022064648,0.0007135029,0.00090879924,0.0013180219,0.0011494915,0.0025490422,0.0028106892,0.0020414684,0.0015229572],"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.00013851513,0.00009589787,0.0009821599,0.00008517579,0.000019912946,0.0002376333,0.00058855425,0.0033707942,0.00616475,0.9762838,0.0024000732,0.009632749],"study_design_scores_gemma":[0.000044756325,0.000032047337,0.00045078178,0.000020641648,0.000023071518,0.00021264992,0.00024399762,0.01959157,0.0029593455,0.9730014,0.0034061547,0.000013640487],"about_ca_topic_score_codex":0.00029729842,"about_ca_topic_score_gemma":0.000713696,"teacher_disagreement_score":0.014794969,"about_ca_system_score_codex":0.0008720198,"about_ca_system_score_gemma":0.000332148,"threshold_uncertainty_score":0.049494147},"labels":[],"label_agreement":null},{"id":"W1964864950","doi":"10.1006/jctb.2001.2090","title":"Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"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":"Combinatorics; Mathematics; Matching (statistics); Cubic graph; Lattice (music); Graph; Discrete mathematics; Line graph; Voltage graph; Physics","score_opus":0.01904510044783211,"score_gpt":0.2777941096068416,"score_spread":0.2587490091590095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964864950","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.63363844,0.00066425215,0.30003443,0.00079756184,0.00015992134,0.00013795328,0.0008968016,0.0004692073,0.063201495],"genre_scores_gemma":[0.8974683,0.0005266877,0.08341492,0.00021316219,0.0001334561,0.0001379148,0.0012267585,0.00024625962,0.016632535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994153,0.00013011109,0.000029637073,0.00008895783,0.000148986,0.00018694303],"domain_scores_gemma":[0.9990478,0.00028012623,0.000117568925,0.00017392672,0.00013974977,0.00024084293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066595356,0.00059852924,0.0009460688,0.0013583843,0.0009307598,0.0030832877,0.0011118753,0.0009425809,0.00940363],"category_scores_gemma":[0.0021875384,0.0005659698,0.00075731816,0.0012263334,0.0011566778,0.0025908242,0.0017095137,0.001953574,0.0013425447],"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.00034406118,0.00016969115,0.00053007144,0.000102646845,0.000022460761,0.00008546362,0.00032963682,0.01333089,0.008110925,0.93507665,0.0048285243,0.03706901],"study_design_scores_gemma":[0.00006116335,0.00005595904,0.0002461334,0.000022955053,0.00001745193,0.000070344024,0.00025572794,0.04322767,0.0020613663,0.95085305,0.0031133383,0.0000148536965],"about_ca_topic_score_codex":0.0006286872,"about_ca_topic_score_gemma":0.0012156727,"teacher_disagreement_score":0.00940363,"about_ca_system_score_codex":0.00090312056,"about_ca_system_score_gemma":0.0005454578,"threshold_uncertainty_score":0.03145826},"labels":[],"label_agreement":null},{"id":"W1966311297","doi":"10.1006/jctb.2001.2094","title":"Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Digraph; Combinatorics; Eulerian path; Disjoint sets; Vertex (graph theory); Mathematics; Partition (number theory); Bipartite graph; Upper and lower bounds; Graph; Discrete mathematics; Lagrangian","score_opus":0.012725503802215814,"score_gpt":0.2055984673701304,"score_spread":0.19287296356791458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966311297","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.8708398,0.0037622103,0.08865102,0.0030895756,0.00016297486,0.000065529995,0.0013842126,0.0002589795,0.031785622],"genre_scores_gemma":[0.9727077,0.002191843,0.019539095,0.00028362378,0.0003051557,0.00011366507,0.00077621406,0.00013038404,0.0039522466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882597,0.00037064086,0.000092344744,0.000317623,0.000179533,0.00021379198],"domain_scores_gemma":[0.97425634,0.019403009,0.0029149423,0.0010213637,0.0006385892,0.0017659116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017636031,0.00082969,0.0016719063,0.0032315305,0.0024627482,0.005211926,0.002092676,0.0018725708,0.0044142],"category_scores_gemma":[0.014416761,0.0016819432,0.0009144847,0.0034852785,0.0036887184,0.009162391,0.0025638663,0.0023083033,0.00042819008],"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.0005104792,0.00011447301,0.0083230715,0.00026523034,0.000052498457,0.0002002209,0.0016562968,0.02175423,0.0033583634,0.9416834,0.005166508,0.016915152],"study_design_scores_gemma":[0.00006429932,0.00003902511,0.002463434,0.000063062274,0.00006202475,0.00034918071,0.00057375425,0.03618379,0.0014123705,0.95380723,0.004948456,0.00003340026],"about_ca_topic_score_codex":0.0012578586,"about_ca_topic_score_gemma":0.0016015886,"teacher_disagreement_score":0.005211926,"about_ca_system_score_codex":0.0024855803,"about_ca_system_score_gemma":0.0006685013,"threshold_uncertainty_score":0.01803416},"labels":[],"label_agreement":null},{"id":"W1968677127","doi":"10.1016/j.jctb.2004.09.006","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>Δ</mml:mi><mml:mo>-</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-critical graphs","year":2004,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Microsoft (Canada); University of Toronto","funders":"","keywords":"Clique; Algorithm; Graph; Combinatorics; Mathematics; Discrete mathematics; Computer science","score_opus":0.016637711207507806,"score_gpt":0.2627129415723882,"score_spread":0.2460752303648804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968677127","genre_codex":"other","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.0017273782,0.00035178207,0.11164185,0.0061108447,0.0017065878,0.00029343675,0.08900287,0.10077862,0.6883866],"genre_scores_gemma":[0.024949435,0.0012927442,0.080290824,0.0021129379,0.00086318376,0.0005056437,0.10883717,0.09023342,0.6909147],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961203,0.000057070505,0.000036332418,0.000066024324,0.00018135084,0.000047144527],"domain_scores_gemma":[0.99814534,0.00048175492,0.0001250339,0.00041133244,0.000663096,0.00017335181],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058621564,0.0012672214,0.0009093544,0.0022363353,0.0010990012,0.005176947,0.0026382755,0.0014340476,0.667536],"category_scores_gemma":[0.0041460744,0.0009496798,0.00079950213,0.0032109027,0.0006604292,0.0055859294,0.001906819,0.0027649044,0.5590368],"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.000042896267,0.000023176513,0.000108364926,0.0001341962,0.000004250013,0.000037991198,0.000073465744,0.00022579354,0.0008160557,0.03103198,0.93440396,0.03309777],"study_design_scores_gemma":[0.000030528725,0.000007943437,0.00036671507,0.00005305611,0.000004412385,0.00011936383,0.00005621012,0.0015551724,0.0028655424,0.021758236,0.97315717,0.000025574518],"about_ca_topic_score_codex":0.00685629,"about_ca_topic_score_gemma":0.0076473216,"teacher_disagreement_score":0.667536,"about_ca_system_score_codex":0.0023084064,"about_ca_system_score_gemma":0.0010446094,"threshold_uncertainty_score":0.4742195},"labels":[],"label_agreement":null},{"id":"W1969055353","doi":"10.1016/j.jctb.2010.12.002","title":"Unexpected behaviour of crossing sequences","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.013971670668904795,"score_gpt":0.21000680651573364,"score_spread":0.19603513584682886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969055353","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.91040856,0.00097431097,0.05834718,0.001007368,0.00031088386,0.000028181035,0.00029348963,0.0009205055,0.027709493],"genre_scores_gemma":[0.9927489,0.00015419003,0.0051715183,0.000075976786,0.000062900945,0.000015010636,0.00014963435,0.00011378045,0.001508022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995889,0.00010882101,0.000017245593,0.00010392294,0.00011670294,0.00006440874],"domain_scores_gemma":[0.9936661,0.003597068,0.00064354076,0.00075135456,0.0006133,0.00072852365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503339,0.00034004418,0.00051872333,0.0022362692,0.0009603433,0.0020469928,0.0008170277,0.0013240057,0.005070685],"category_scores_gemma":[0.013894067,0.0005478489,0.00027276168,0.0011435335,0.0012700913,0.0020658288,0.0007979692,0.0015143155,0.0005172473],"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.00032501054,0.00016481763,0.007668208,0.00025200302,0.000064143795,0.0008945435,0.000718264,0.044642586,0.03881432,0.86441374,0.009046571,0.032995813],"study_design_scores_gemma":[0.00005029123,0.000091593465,0.0060344907,0.00006658606,0.00003992065,0.0013849228,0.00034967874,0.23962724,0.010295843,0.73611337,0.0058745127,0.000071576476],"about_ca_topic_score_codex":0.00042625683,"about_ca_topic_score_gemma":0.0004645541,"teacher_disagreement_score":0.005070685,"about_ca_system_score_codex":0.0006701512,"about_ca_system_score_gemma":0.0003523469,"threshold_uncertainty_score":0.016963124},"labels":[],"label_agreement":null},{"id":"W1970138544","doi":"10.1016/j.jctb.2011.03.005","title":"Finitely forcible graphons","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":54,"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 Toronto","funders":"","keywords":"Iterated function; Mathematics; Algebraic structure; Combinatorics; Graph; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.05386988719056061,"score_gpt":0.27678391431481614,"score_spread":0.22291402712425554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970138544","genre_codex":"other","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.43936548,0.0021498469,0.0925133,0.00790122,0.001744962,0.0001095663,0.0005526758,0.0008386032,0.4548244],"genre_scores_gemma":[0.8710683,0.0007995334,0.018108634,0.0012611318,0.0010559337,0.00013500749,0.0004676673,0.00027506196,0.106828816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896634,0.00028014238,0.000050318045,0.00024361881,0.00026773213,0.00019182976],"domain_scores_gemma":[0.9971245,0.0013041049,0.00027479493,0.00031040327,0.0004587139,0.0005274279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009134871,0.0008758524,0.0010719999,0.0033292058,0.004057784,0.0055015516,0.0015124197,0.0024476128,0.012585719],"category_scores_gemma":[0.0040925937,0.00073609524,0.0008570942,0.0015998358,0.004517746,0.0075421818,0.0029746804,0.00444843,0.0013451594],"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.000008938594,0.000011092055,0.000056732613,0.0000070669175,0.0000021040041,0.00002606085,0.00010658639,0.000070896094,0.00019241274,0.99799395,0.000621123,0.0009031135],"study_design_scores_gemma":[0.000007758979,0.000006146504,0.0000898814,0.000008835953,0.0000047032904,0.00008085805,0.00007296757,0.00066129025,0.00024484735,0.99612516,0.0026905327,0.0000069454068],"about_ca_topic_score_codex":0.0009258373,"about_ca_topic_score_gemma":0.0015896343,"teacher_disagreement_score":0.012585719,"about_ca_system_score_codex":0.0020786163,"about_ca_system_score_gemma":0.00078195747,"threshold_uncertainty_score":0.04210347},"labels":[],"label_agreement":null},{"id":"W1971585316","doi":"10.1016/s0095-8956(02)00014-x","title":"The independence fractal of a graph","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University; Dalhousie University","funders":"","keywords":"Lexicographical order; Mathematics; Discrete mathematics; Independence (probability theory); Combinatorics; Fractal; Hausdorff space; Graph; Mathematical analysis","score_opus":0.014834270858992858,"score_gpt":0.2755049509229615,"score_spread":0.26067068006396865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971585316","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.86289155,0.0017418623,0.06668066,0.0029115533,0.00022579475,0.00003872996,0.00066444685,0.00029368582,0.06455166],"genre_scores_gemma":[0.98556006,0.0006569976,0.0086104665,0.00019509172,0.00036709703,0.0000329994,0.00035271898,0.000059542363,0.004165044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996145,0.000091242655,0.000020144322,0.000079920115,0.00013910297,0.000055147484],"domain_scores_gemma":[0.9959847,0.0022549997,0.000514086,0.00048407592,0.00029376193,0.00046847403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059314055,0.0003423775,0.00064425304,0.00356022,0.0011836314,0.0026542319,0.0006250869,0.0011187578,0.0024956746],"category_scores_gemma":[0.0045232503,0.000617198,0.00058925344,0.0015276094,0.0029370554,0.0026393775,0.0010953326,0.001793191,0.0002819214],"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.000055193817,0.000016183109,0.0011945401,0.000036975736,0.000015005374,0.00012612333,0.00026240552,0.0042193257,0.0019405725,0.98585063,0.0018264292,0.004456641],"study_design_scores_gemma":[0.000021690328,0.000020275806,0.0026103242,0.00001553684,0.00001856373,0.000397155,0.000084923086,0.026464285,0.00054008287,0.9659036,0.0038999142,0.00002375091],"about_ca_topic_score_codex":0.0010569849,"about_ca_topic_score_gemma":0.0007204023,"teacher_disagreement_score":0.00356022,"about_ca_system_score_codex":0.00082971214,"about_ca_system_score_gemma":0.0004575152,"threshold_uncertainty_score":0.008348882},"labels":[],"label_agreement":null},{"id":"W1971752656","doi":"10.1016/j.jctb.2009.05.002","title":"The projective plane is a stabilizer","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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":"Projective plane; Matroid; Real projective plane; Stabilizer (aeronautics); Projective test; Blocking set; Minor (academic); Plane (geometry); Mathematics; Projective space; Combinatorics; Fano plane; Pure mathematics; Complex projective space; Geometry; Art; Engineering; Structural engineering","score_opus":0.011682825517400432,"score_gpt":0.2817224498482041,"score_spread":0.2700396243308037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971752656","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.7232486,0.0007202415,0.058459204,0.0034828458,0.0006974273,0.00011171145,0.00058739574,0.0008662473,0.21182637],"genre_scores_gemma":[0.9691682,0.00036267334,0.0039689452,0.00022136627,0.0005164572,0.000039409082,0.00031588256,0.00008919492,0.02531801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992799,0.0001121249,0.00003553221,0.00022172653,0.00020885772,0.00014198173],"domain_scores_gemma":[0.9993451,0.00017544503,0.000117869466,0.000065489534,0.00012429092,0.00017185253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036320672,0.0008148646,0.0008375787,0.0017556705,0.0023941738,0.0038878564,0.00055188313,0.00092184846,0.011898327],"category_scores_gemma":[0.0007214246,0.00055381045,0.0005552338,0.0010585765,0.002619184,0.0029611094,0.002128117,0.0017875554,0.00213957],"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.00023919041,0.000057091715,0.0011471936,0.0000670962,0.000054442702,0.0007451402,0.0006234207,0.0011201219,0.011244385,0.9704112,0.004192535,0.010098187],"study_design_scores_gemma":[0.0002284194,0.00033554574,0.0041521355,0.000028900027,0.00011432516,0.0015914394,0.0008518048,0.007340301,0.00893488,0.94887614,0.027484106,0.00006209399],"about_ca_topic_score_codex":0.00080368447,"about_ca_topic_score_gemma":0.00060365844,"teacher_disagreement_score":0.011898327,"about_ca_system_score_codex":0.0007738586,"about_ca_system_score_gemma":0.0003059139,"threshold_uncertainty_score":0.039803922},"labels":[],"label_agreement":null},{"id":"W1972423218","doi":"10.1016/j.jctb.2012.09.003","title":"Limits of permutation sequences","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":115,"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":"Mathematics; Combinatorics; Sequence (biology); Permutation (music); Limit (mathematics); Random permutation; Limit of a sequence; Discrete mathematics; Function (biology); Limit of a function; Class (philosophy); Mathematical analysis","score_opus":0.031892451417784934,"score_gpt":0.30929187706200817,"score_spread":0.27739942564422326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972423218","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.4790657,0.0036733337,0.17940363,0.0047938093,0.001098859,0.00006856907,0.000417399,0.00050809514,0.33097064],"genre_scores_gemma":[0.9164649,0.0019007844,0.02209108,0.00070162624,0.0011932555,0.00013098388,0.00040331835,0.00024017024,0.056873832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987429,0.0003246473,0.000083724524,0.00024936715,0.0004387801,0.00016064188],"domain_scores_gemma":[0.9962882,0.001807518,0.00037624463,0.00037344825,0.0005725968,0.0005820731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170787,0.00064809213,0.0009522108,0.003668153,0.0026931048,0.0042647542,0.0013166593,0.0013251808,0.010413054],"category_scores_gemma":[0.007774413,0.0007013722,0.0009546921,0.0023268024,0.0040803463,0.008200489,0.003055884,0.0031395778,0.0011930491],"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.000011433577,0.000014142827,0.00013211052,0.000011847286,0.0000032865767,0.00003900527,0.00014420359,0.00025679532,0.00022735274,0.99548197,0.0005063333,0.0031714658],"study_design_scores_gemma":[0.0000037293535,0.0000049368978,0.00007815912,0.000006656412,0.0000029534974,0.00007734319,0.000039810053,0.0011567932,0.00014340159,0.99685174,0.0016294952,0.000004981159],"about_ca_topic_score_codex":0.00097622804,"about_ca_topic_score_gemma":0.0008693898,"teacher_disagreement_score":0.010413054,"about_ca_system_score_codex":0.0015129715,"about_ca_system_score_gemma":0.00082168693,"threshold_uncertainty_score":0.0348351},"labels":[],"label_agreement":null},{"id":"W1975172784","doi":"10.1016/j.jctb.2006.01.001","title":"Representation characterizations of chordal bipartite graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"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 Victoria","funders":"","keywords":"Combinatorics; Chordal graph; Interval graph; Bipartite graph; Mathematics; Complete bipartite graph; Split graph; Discrete mathematics; Cograph; Distance-hereditary graph; Indifference graph; Graph; Line graph; 1-planar graph; Graph power","score_opus":0.012271149793242522,"score_gpt":0.2757147604491695,"score_spread":0.263443610655927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975172784","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.59338385,0.00063960673,0.29073304,0.0018115537,0.00021667557,0.00024830407,0.001840014,0.00071845297,0.11040848],"genre_scores_gemma":[0.9490883,0.00040310033,0.030110555,0.00030348406,0.00021883668,0.00015613383,0.0024739162,0.00022457085,0.01702118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897707,0.00020259082,0.000066560424,0.00025024478,0.0002876824,0.00021581481],"domain_scores_gemma":[0.9959882,0.0018370756,0.00056651677,0.0005410561,0.0006093421,0.00045784476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066598697,0.0005954862,0.00066926057,0.0024662474,0.001249888,0.004358128,0.002129443,0.0012768673,0.014366083],"category_scores_gemma":[0.005794923,0.00041934318,0.00070074387,0.003198435,0.00155575,0.004548445,0.002333217,0.0025851622,0.0012931845],"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.00010828846,0.00007166125,0.00078511937,0.00007950126,0.000010242797,0.00010450253,0.0006563579,0.0021715437,0.0025045387,0.9704964,0.002816102,0.020195842],"study_design_scores_gemma":[0.000025249597,0.00004003715,0.00058081,0.000033884175,0.000016651127,0.00023453936,0.00047226023,0.01799412,0.000981389,0.9734167,0.006185199,0.000019212783],"about_ca_topic_score_codex":0.00081779796,"about_ca_topic_score_gemma":0.0007404827,"teacher_disagreement_score":0.014366083,"about_ca_system_score_codex":0.0014087704,"about_ca_system_score_gemma":0.0004902418,"threshold_uncertainty_score":0.048059344},"labels":[],"label_agreement":null},{"id":"W1976828798","doi":"10.1016/j.jctb.2008.03.003","title":"Projective geometries in dense matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"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":"Matroid; Combinatorics; Prime power; Minor (academic); Mathematics; Integer (computer science); Projective plane; Prime (order theory); Simple (philosophy); Discrete mathematics; Computer science; Geometry","score_opus":0.017698982939964993,"score_gpt":0.2748469373574108,"score_spread":0.2571479544174458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976828798","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.7159987,0.0032790718,0.122810066,0.005186249,0.00037372712,0.00009621224,0.0011972865,0.0004522163,0.15060645],"genre_scores_gemma":[0.9697356,0.0011132342,0.012835764,0.00030877584,0.00063246145,0.00006523062,0.0007392874,0.000088026536,0.014481483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998845,0.00038121047,0.000058190803,0.00024413597,0.00028626132,0.00018519153],"domain_scores_gemma":[0.9972773,0.0013357635,0.00038576624,0.00023429589,0.00025316616,0.0005136199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008482408,0.00084188586,0.0011587263,0.002432331,0.0025349064,0.004957094,0.001348341,0.0012292542,0.009406638],"category_scores_gemma":[0.003053279,0.0013745171,0.0006634226,0.0029303017,0.0043047965,0.0074581583,0.003063421,0.003719432,0.00092726084],"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.000023681117,0.000017995297,0.00031760894,0.000028717375,0.0000052576775,0.000057291832,0.00026709514,0.00056657,0.00026661262,0.9955389,0.0009225655,0.0019876047],"study_design_scores_gemma":[0.000016372247,0.000010560621,0.0003498585,0.000007950877,0.000007851895,0.00010402086,0.00013466294,0.0017401943,0.00011959,0.9958026,0.0016995984,0.000006788713],"about_ca_topic_score_codex":0.0013761072,"about_ca_topic_score_gemma":0.0020665496,"teacher_disagreement_score":0.009406638,"about_ca_system_score_codex":0.0014732035,"about_ca_system_score_gemma":0.00046049966,"threshold_uncertainty_score":0.031468272},"labels":[],"label_agreement":null},{"id":"W1976984302","doi":"10.1016/j.jctb.2004.09.002","title":"W.T. Tutte","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Educational and Social Studies","field":"Social Sciences","cited_by":2,"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":"Humanities; Art","score_opus":0.01453352068465055,"score_gpt":0.3038081908217325,"score_spread":0.28927467013708197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976984302","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008624208,0.044914626,0.125529,0.0799181,0.014650225,0.00008913142,0.0026285837,0.0023386646,0.72130746],"genre_scores_gemma":[0.16384077,0.04084546,0.032192048,0.0070282924,0.006261361,0.00022178116,0.0019869579,0.0017479375,0.74587536],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993249,0.00010265158,0.000036028254,0.00026288905,0.00020251473,0.00007102403],"domain_scores_gemma":[0.99835974,0.0006172565,0.00009605728,0.0003135499,0.0004567335,0.00015657255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000750961,0.0007095382,0.0008314549,0.0016726755,0.0016563052,0.0031641992,0.00072136376,0.0012965007,0.13003217],"category_scores_gemma":[0.0057108817,0.0004323835,0.0006251697,0.0020766754,0.0017529924,0.004281318,0.0017766175,0.0027143012,0.064977914],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000068413574,0.00004522862,0.00053762353,0.00022617934,0.0000399615,0.00012357655,0.00021291843,0.0010740168,0.0008577822,0.38038373,0.4039633,0.2124673],"study_design_scores_gemma":[0.00002267078,0.000020814336,0.00041244685,0.00015064573,0.000024348516,0.0003257062,0.00009511351,0.0018090217,0.00087863306,0.28224617,0.7139808,0.000033615786],"about_ca_topic_score_codex":0.0016613906,"about_ca_topic_score_gemma":0.002130202,"teacher_disagreement_score":0.13003217,"about_ca_system_score_codex":0.0011945883,"about_ca_system_score_gemma":0.001445375,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1977168065","doi":"10.1016/j.jctb.2004.07.001","title":"Dimers, tilings and trees","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":47,"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":"Combinatorics; Mathematics; Bipartite graph; Bijection; Markov chain; Planar graph; Regular polygon; Planar; Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.017806304064959234,"score_gpt":0.2841692701646123,"score_spread":0.26636296609965304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977168065","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.52923024,0.033508245,0.16796303,0.013746342,0.0046487497,0.00010180894,0.00073684775,0.0004994118,0.24956547],"genre_scores_gemma":[0.9309012,0.0074067893,0.017602619,0.0012152903,0.0027784405,0.00010840296,0.00037360608,0.000106728134,0.039506864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996768,0.00008861933,0.000022909562,0.00007374514,0.00008241895,0.000055518736],"domain_scores_gemma":[0.9991818,0.00034531683,0.00014334198,0.00012870014,0.00007117115,0.0001295911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005352734,0.00038151734,0.0010987316,0.0015920746,0.0018229975,0.0036747414,0.00080162095,0.0020357873,0.008931651],"category_scores_gemma":[0.002361208,0.0005461903,0.00047669827,0.0016422879,0.0034210018,0.004068068,0.0012053417,0.0020216194,0.0009270462],"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.000013151594,0.000013834638,0.00010878413,0.000031039806,0.000003448785,0.000023293413,0.0001139649,0.0012331996,0.0002807559,0.9917699,0.0022011087,0.0042074807],"study_design_scores_gemma":[0.0000038963717,0.0000028811917,0.000052289823,0.0000045651705,0.0000013211503,0.000020138461,0.000033325032,0.0012283878,0.000037400227,0.9967424,0.0018703637,0.0000030832066],"about_ca_topic_score_codex":0.00075924717,"about_ca_topic_score_gemma":0.0011277555,"teacher_disagreement_score":0.008931651,"about_ca_system_score_codex":0.0006663313,"about_ca_system_score_gemma":0.00044163017,"threshold_uncertainty_score":0.029879272},"labels":[],"label_agreement":null},{"id":"W1979091665","doi":"10.1016/j.jctb.2010.06.001","title":"The number of points in a matroid with no n-point line as a minor","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Minor (academic); Combinatorics; Rank (graph theory); Mathematics; Prime power; Line (geometry); Integer (computer science); Point (geometry); Prime (order theory); Projective plane; Oriented matroid; Discrete mathematics; Graphic matroid; Geometry; Computer science; Humanities","score_opus":0.005835806336886248,"score_gpt":0.27290845197337554,"score_spread":0.2670726456364893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979091665","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.9591739,0.00018247176,0.024420077,0.000650724,0.0000681539,0.000046382876,0.0011688316,0.0001425987,0.014146734],"genre_scores_gemma":[0.9656604,0.000198348,0.02387796,0.00009355841,0.00012305976,0.00012109482,0.0013203435,0.00009454675,0.008510718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849474,0.00030578885,0.00015967923,0.0003861699,0.000419829,0.00023373288],"domain_scores_gemma":[0.990448,0.004421533,0.001890456,0.00073484704,0.00084943406,0.0016558408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097154186,0.0007192731,0.0011052244,0.0025537894,0.002343304,0.0038388057,0.0029491198,0.0021690878,0.007851041],"category_scores_gemma":[0.0058574695,0.0008801784,0.0009523523,0.0021129658,0.0029068636,0.0050353613,0.002122141,0.0014406315,0.001058017],"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.007140575,0.00067384564,0.07571884,0.0009890848,0.0006683467,0.0023009393,0.0025152052,0.051316537,0.11961857,0.6573927,0.014931724,0.066733666],"study_design_scores_gemma":[0.0005667828,0.0011505603,0.042887434,0.00015634464,0.0006698687,0.008166623,0.003267341,0.17492983,0.06471264,0.67913383,0.024068134,0.00029066027],"about_ca_topic_score_codex":0.0008420231,"about_ca_topic_score_gemma":0.00089382415,"teacher_disagreement_score":0.007851041,"about_ca_system_score_codex":0.0011633697,"about_ca_system_score_gemma":0.00056581554,"threshold_uncertainty_score":0.02626431},"labels":[],"label_agreement":null},{"id":"W1980134397","doi":"10.1016/j.jctb.2010.07.006","title":"Spectral radius of finite and infinite planar graphs and of graphs of bounded genus","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Spectral radius; Combinatorics; Mathematics; Planar graph; Bounded function; Upper and lower bounds; Degree (music); Order (exchange); Discrete mathematics; Graph; Mathematical analysis; Physics; Eigenvalues and eigenvectors","score_opus":0.013347340318574308,"score_gpt":0.2566479518093279,"score_spread":0.2433006114907536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980134397","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.9354604,0.0022164737,0.033683468,0.0011937679,0.00006604597,0.000024524184,0.0003915414,0.0003075252,0.026656324],"genre_scores_gemma":[0.993566,0.0006158686,0.0030150164,0.00006930501,0.00012823542,0.00003261922,0.00025239438,0.000111795714,0.0022087244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989581,0.00034620802,0.00004829189,0.00021031447,0.00024213556,0.00019485869],"domain_scores_gemma":[0.98669064,0.0083095115,0.002024347,0.00053787715,0.00059592136,0.0018416997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014699943,0.0009758064,0.001505983,0.006176676,0.0016937563,0.0039443444,0.002670376,0.0019133423,0.0050541013],"category_scores_gemma":[0.016478319,0.0008676928,0.0006838448,0.0019803613,0.0048207804,0.00530185,0.0027902857,0.0013553919,0.0007474754],"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.00031547382,0.000060563812,0.0029146955,0.00014635958,0.00002674991,0.00018208007,0.00086977077,0.016881961,0.003941829,0.9665776,0.0018632502,0.0062196036],"study_design_scores_gemma":[0.000044392924,0.00004457624,0.0046762014,0.00007667309,0.000037856516,0.00054152054,0.00085898326,0.0831829,0.0020637207,0.906639,0.0017830234,0.000051215862],"about_ca_topic_score_codex":0.0011895603,"about_ca_topic_score_gemma":0.0010728462,"teacher_disagreement_score":0.006176676,"about_ca_system_score_codex":0.0013459258,"about_ca_system_score_gemma":0.0005245966,"threshold_uncertainty_score":0.016907632},"labels":[],"label_agreement":null},{"id":"W1981926792","doi":"10.1016/j.jctb.2009.07.002","title":"Asymptotically optimal frugal colouring","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Neighbourhood (mathematics); Mathematics; Vertex (graph theory); Graph; Combinatorics; Constant (computer programming); Asymptotically optimal algorithm; Term (time); Discrete mathematics; Computer science; Mathematical optimization; Physics; Mathematical analysis","score_opus":0.013233764270504525,"score_gpt":0.2763653776591601,"score_spread":0.26313161338865554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981926792","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.55546457,0.0011325203,0.20139153,0.0034260622,0.00046632002,0.00011807931,0.00064121635,0.0027329982,0.23462677],"genre_scores_gemma":[0.9380002,0.0003962437,0.04307703,0.00044364473,0.00013021288,0.00007189968,0.00030005866,0.0004322044,0.017148504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987607,0.00043175698,0.000039862298,0.00019196776,0.00028790662,0.00028783138],"domain_scores_gemma":[0.9941538,0.0031996954,0.00026529728,0.0013503348,0.0005849385,0.00044587816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010254019,0.00060797716,0.001247811,0.0012930459,0.0019317991,0.0031557276,0.0019277675,0.0018707286,0.012896905],"category_scores_gemma":[0.008537595,0.0005245166,0.0006178731,0.0012355568,0.002273003,0.0039870827,0.0022493235,0.0019811597,0.001253772],"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.00014215917,0.00006121127,0.00037450736,0.00007802676,0.000013275287,0.000059195747,0.00020930349,0.009066356,0.003022666,0.96169823,0.0064667654,0.01880833],"study_design_scores_gemma":[0.0000356771,0.000017440658,0.00020920737,0.000018322611,0.000015191846,0.00009068158,0.0000663738,0.034423728,0.0010516157,0.9609798,0.0030744544,0.00001750598],"about_ca_topic_score_codex":0.0024833055,"about_ca_topic_score_gemma":0.004987468,"teacher_disagreement_score":0.012896905,"about_ca_system_score_codex":0.0020654465,"about_ca_system_score_gemma":0.0011047064,"threshold_uncertainty_score":0.043144405},"labels":[],"label_agreement":null},{"id":"W1984128946","doi":"10.1016/j.jctb.2015.02.002","title":"Linear embeddings of graphs and graph limits","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Complement graph; Line graph; Discrete mathematics; Voltage graph; Null graph; Regular graph; Graph power; Random graph; Distance-regular graph; Butterfly graph; Symmetric graph; Graph","score_opus":0.033213788291548946,"score_gpt":0.2978219061608675,"score_spread":0.2646081178693186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984128946","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.5904721,0.008054852,0.20372301,0.012331141,0.00088196684,0.000067559544,0.0005106412,0.000506461,0.18345228],"genre_scores_gemma":[0.95898825,0.0028897398,0.016596263,0.00076022005,0.0009547707,0.00010443386,0.00028397894,0.00013656094,0.019285765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991405,0.0003314255,0.000050393868,0.00015845562,0.00020900431,0.000110152236],"domain_scores_gemma":[0.9946122,0.0033431773,0.0006055028,0.00035967675,0.0004908784,0.0005885308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001078679,0.00078041694,0.00088304543,0.0028851633,0.0019714828,0.0045462456,0.0015470234,0.0015320524,0.00685231],"category_scores_gemma":[0.0076071075,0.0007440127,0.00078736164,0.002241092,0.00546936,0.009906923,0.0035069794,0.003748473,0.00064109766],"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.000008953473,0.000013632056,0.00012655639,0.000020201243,0.0000031313625,0.000024972436,0.00021316641,0.00044750833,0.00012363556,0.9963565,0.000585274,0.0020766086],"study_design_scores_gemma":[0.0000038045673,0.0000033793274,0.000060684404,0.0000068274967,0.000002132114,0.000030455221,0.00007310993,0.0012344044,0.000050918043,0.9977622,0.0007684169,0.0000037343227],"about_ca_topic_score_codex":0.0011397961,"about_ca_topic_score_gemma":0.0011485158,"teacher_disagreement_score":0.00685231,"about_ca_system_score_codex":0.0016112691,"about_ca_system_score_gemma":0.00055223855,"threshold_uncertainty_score":0.022923231},"labels":[],"label_agreement":null},{"id":"W1984987350","doi":"10.1016/j.jctb.2006.04.002","title":"Symmetric squares of graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Quantum graph; Mathematics; Combinatorics; Spectral line; Graph; Connection (principal bundle); Square (algebra); Discrete mathematics; Physics; Quantum mechanics; Geometry","score_opus":0.017469052390127648,"score_gpt":0.30374540738009237,"score_spread":0.28627635498996473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984987350","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.45105338,0.0010851151,0.11884473,0.004507506,0.001680038,0.000112708,0.00075643614,0.0006983109,0.42126176],"genre_scores_gemma":[0.8845121,0.00054738653,0.022172159,0.00094357476,0.00087205466,0.00007030275,0.00051448843,0.0004123765,0.089955546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994916,0.00014824474,0.000020638932,0.00013807286,0.00013772988,0.00006379254],"domain_scores_gemma":[0.9989874,0.00032894206,0.0001346116,0.00014418775,0.00020264256,0.00020221458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042088347,0.0006670255,0.0007588215,0.001438338,0.0013460303,0.002466217,0.00092597667,0.0009164739,0.016537178],"category_scores_gemma":[0.0021898502,0.00061573734,0.00057447975,0.0009403111,0.0020541628,0.002637292,0.0014253367,0.001953985,0.002136524],"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.000020465455,0.000011394544,0.00014275321,0.000018368873,0.000006168312,0.000037573733,0.00011809257,0.00027168661,0.00076977315,0.9908732,0.0027868384,0.00494363],"study_design_scores_gemma":[0.000009671777,0.000008086715,0.00023396552,0.0000042647775,0.0000051407733,0.00008621824,0.00006320158,0.0013045964,0.00039126308,0.9939668,0.0039203027,0.0000064104133],"about_ca_topic_score_codex":0.0010155037,"about_ca_topic_score_gemma":0.0015014489,"teacher_disagreement_score":0.016537178,"about_ca_system_score_codex":0.00075784087,"about_ca_system_score_gemma":0.0004999904,"threshold_uncertainty_score":0.05532241},"labels":[],"label_agreement":null},{"id":"W1985878353","doi":"10.1016/j.jctb.2013.09.002","title":"Generic global rigidity of body–bar frameworks","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Hungarian Scientific Research Fund","keywords":"Rigidity (electromagnetism); Structural rigidity; Rigid body; Euclidean geometry; Mathematics; Combinatorics; Configuration space; Euclidean space; Pure mathematics; Geometry; Topology (electrical circuits); Physics; Classical mechanics","score_opus":0.0038179754242855333,"score_gpt":0.19472444323751162,"score_spread":0.1909064678132261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985878353","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.3752714,0.0013278824,0.3491455,0.001986086,0.00035602017,0.00007965076,0.000578328,0.0005519744,0.2707031],"genre_scores_gemma":[0.94823366,0.0005197368,0.026365576,0.000401155,0.00027278214,0.00007337016,0.00045740805,0.00024293696,0.023433417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909973,0.00020888419,0.00003238674,0.00019777814,0.00025830237,0.00020295935],"domain_scores_gemma":[0.99891603,0.00030767807,0.00019392006,0.00019647407,0.00012690523,0.00025901457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010122018,0.0009386623,0.0011391736,0.002002666,0.0022011946,0.003233806,0.0015867309,0.0018777204,0.0122360345],"category_scores_gemma":[0.002514808,0.0006633644,0.0011213607,0.0010879169,0.0036190243,0.0034917102,0.003403984,0.0025845768,0.001192318],"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.000010588811,0.0000056130766,0.000046317426,0.000009828173,0.0000044077296,0.000017845943,0.000032147032,0.0025828036,0.0002723117,0.9952474,0.00042089206,0.0013498764],"study_design_scores_gemma":[0.0000073927013,0.0000094873485,0.00014082319,0.000009608561,0.0000042564725,0.000029877805,0.00004142023,0.0082199555,0.00011122696,0.9899198,0.0014965968,0.000009657159],"about_ca_topic_score_codex":0.0011875209,"about_ca_topic_score_gemma":0.0018773495,"teacher_disagreement_score":0.0122360345,"about_ca_system_score_codex":0.0010011566,"about_ca_system_score_gemma":0.0005973644,"threshold_uncertainty_score":0.04093361},"labels":[],"label_agreement":null},{"id":"W1986224428","doi":"10.1016/j.jctb.2008.06.008","title":"Matchings in regular graphs from eigenvalues","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"American Institute of Mathematics","keywords":"Eigenvalues and eigenvectors; Combinatorics; Matching (statistics); Mathematics; Upper and lower bounds; Order (exchange); Graph; Discrete mathematics; Statistics; Mathematical analysis; Physics; Business","score_opus":0.025894199122439208,"score_gpt":0.27082854822885416,"score_spread":0.24493434910641496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986224428","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.64342934,0.0011632723,0.24027659,0.0033701272,0.0009925042,0.00023519216,0.0008776558,0.0013569619,0.10829839],"genre_scores_gemma":[0.93962073,0.00058138114,0.034032043,0.00054387265,0.00067665713,0.00011920324,0.00047119046,0.0003996502,0.023555202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916744,0.00017743163,0.000055981855,0.00019606225,0.000273649,0.00012945768],"domain_scores_gemma":[0.9967693,0.0014930861,0.00052986876,0.00040329402,0.00038504385,0.000419552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083473907,0.00066160096,0.0012191533,0.0042548617,0.0018550334,0.003903618,0.0016017769,0.0022407402,0.010389824],"category_scores_gemma":[0.007033708,0.00079398404,0.0010467258,0.0020871488,0.0023383275,0.0057235234,0.0023878645,0.00249248,0.0015068272],"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.000056834113,0.000046704572,0.0003376839,0.00006006842,0.00000902548,0.00013866338,0.00038948082,0.0014587415,0.001478634,0.9859206,0.0021275885,0.007975969],"study_design_scores_gemma":[0.000011270482,0.000006893201,0.0001534537,0.000012531209,0.0000061143105,0.00010244296,0.00008854832,0.0056913896,0.00030465832,0.9926709,0.0009426622,0.000009242861],"about_ca_topic_score_codex":0.00070465775,"about_ca_topic_score_gemma":0.0008851135,"teacher_disagreement_score":0.010389824,"about_ca_system_score_codex":0.001000147,"about_ca_system_score_gemma":0.0005041341,"threshold_uncertainty_score":0.034757435},"labels":[],"label_agreement":null},{"id":"W1986323939","doi":"10.1016/j.jctb.2007.10.007","title":"Eigenvalue bounds for independent sets","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":78,"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":"Eigenvalues and eigenvectors; Mathematics; Independence (probability theory); Combinatorics; Maximal independent set; Independence number; Independent set; Set (abstract data type); Polarity (international relations); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science; Statistics; Physics","score_opus":0.03658537179050098,"score_gpt":0.30046302215396115,"score_spread":0.26387765036346017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986323939","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.22035207,0.005532362,0.42154157,0.011637087,0.0012949896,0.00014376428,0.00087747554,0.0010684597,0.33755225],"genre_scores_gemma":[0.9056262,0.0029438746,0.038921762,0.0018494177,0.0028828713,0.000484709,0.0008112519,0.0006839405,0.04579605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970094,0.0008071074,0.00012103315,0.0004882411,0.0011510403,0.00042308666],"domain_scores_gemma":[0.9750606,0.01862181,0.0011509488,0.0016629932,0.0016648705,0.0018387865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036088321,0.0020122766,0.0024157418,0.0064399047,0.003321697,0.005911862,0.0034846081,0.0024177467,0.016958404],"category_scores_gemma":[0.022643369,0.0012633187,0.0015786558,0.004233798,0.005080671,0.010731031,0.00548534,0.008184236,0.0029178925],"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.000049031307,0.00005564958,0.00027380063,0.00005920241,0.000018572244,0.000039847237,0.000218152,0.0028782433,0.00061857526,0.98708785,0.004324193,0.0043768077],"study_design_scores_gemma":[0.000008706191,0.0000062641575,0.00015483085,0.000017111466,0.0000108986715,0.00003283148,0.000036743713,0.012852109,0.00019277942,0.98565084,0.0010240118,0.000013006662],"about_ca_topic_score_codex":0.0009995527,"about_ca_topic_score_gemma":0.0011551859,"teacher_disagreement_score":0.016958404,"about_ca_system_score_codex":0.002809472,"about_ca_system_score_gemma":0.0009942988,"threshold_uncertainty_score":0.056731522},"labels":[],"label_agreement":null},{"id":"W1986537785","doi":"10.1006/jctb.2000.1970","title":"Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations)","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":121,"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 Regina","funders":"","keywords":"Duality (order theory); Homomorphism; Mathematics; Pure mathematics; Order (exchange); Property (philosophy); Algebra over a field","score_opus":0.009783662731557273,"score_gpt":0.24553688113065542,"score_spread":0.23575321839909813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986537785","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.20354994,0.006685051,0.573725,0.007507952,0.0011701883,0.00015026239,0.0008722913,0.00054657203,0.20579271],"genre_scores_gemma":[0.90475374,0.0024350602,0.072122104,0.0013801076,0.0010844237,0.00022234756,0.0006111305,0.0001950899,0.017196063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977871,0.00071499735,0.00014056163,0.00051594817,0.00040898452,0.00043238385],"domain_scores_gemma":[0.9948453,0.00328804,0.00046681447,0.00046956487,0.00047044206,0.00045992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042578164,0.0010792619,0.0018030582,0.0051344596,0.0034310648,0.0063829804,0.0018912283,0.0026703468,0.006339919],"category_scores_gemma":[0.0073197116,0.0013084318,0.002979497,0.004365896,0.008390442,0.018754384,0.0059139277,0.008943553,0.0009887828],"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.000015125886,0.00001089775,0.000090422975,0.00002416082,0.0000041205194,0.0000263649,0.00016838017,0.00019030488,0.00013169368,0.99691784,0.0005700948,0.0018504746],"study_design_scores_gemma":[0.0000054626507,0.000005789066,0.000056022694,0.000010073719,0.000004959789,0.000042959375,0.0000549001,0.0006425812,0.00011594253,0.9979025,0.0011538633,0.000004976011],"about_ca_topic_score_codex":0.0010271354,"about_ca_topic_score_gemma":0.0006868928,"teacher_disagreement_score":0.0063829804,"about_ca_system_score_codex":0.0024477816,"about_ca_system_score_gemma":0.00077830587,"threshold_uncertainty_score":0.02251774},"labels":[],"label_agreement":null},{"id":"W1986861105","doi":"10.1016/s0095-8956(03)00031-5","title":"Bounded size components—partitions and transversals","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"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":"Combinatorics; Mathematics; Partition (number theory); Bounded function; Degree (music); Vertex (graph theory); Graph; Constant (computer programming); Component (thermodynamics); Frequency partition of a graph; Induced subgraph; Vertex connectivity; Discrete mathematics; Graph power; Line graph; Computer science; Physics","score_opus":0.016114984336661697,"score_gpt":0.265491512526323,"score_spread":0.24937652818966133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986861105","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.6955185,0.0019166052,0.21059407,0.002514148,0.00037436228,0.000119872384,0.0006356631,0.0005326292,0.08779422],"genre_scores_gemma":[0.9324872,0.0012968389,0.034281068,0.0004652734,0.00034243305,0.00014011096,0.0007611278,0.00041184868,0.029814063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914885,0.00017274066,0.00005383047,0.00023798413,0.00017400917,0.000212532],"domain_scores_gemma":[0.99320155,0.0033816444,0.00068749924,0.0011039071,0.0005875442,0.0010379136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087724795,0.00067202066,0.0009768608,0.0022269886,0.002614894,0.005419135,0.0015456849,0.0018331872,0.012112019],"category_scores_gemma":[0.007719834,0.0014165646,0.0010019514,0.0022682801,0.0040617594,0.008276911,0.0032293024,0.0033083227,0.0013750696],"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.0001302953,0.000032048938,0.0009152377,0.000054406093,0.000009384294,0.00011218989,0.0004572476,0.0010986004,0.0025944808,0.984277,0.002290379,0.008028749],"study_design_scores_gemma":[0.000022268141,0.0000234372,0.0005798713,0.00002649529,0.000021621629,0.0003092258,0.00047789232,0.0037504851,0.0011873307,0.9895732,0.004013843,0.0000143310135],"about_ca_topic_score_codex":0.00081458595,"about_ca_topic_score_gemma":0.0011743422,"teacher_disagreement_score":0.012112019,"about_ca_system_score_codex":0.0011200337,"about_ca_system_score_gemma":0.0005398407,"threshold_uncertainty_score":0.04051876},"labels":[],"label_agreement":null},{"id":"W1988333015","doi":"10.1016/j.jctb.2010.07.003","title":"The lattice of integer flows of a regular matroid","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"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":"Combinatorics; Mathematics; Matroid; Abelian group; Integer (computer science); Integer lattice; Lattice (music); Discrete mathematics; Half-integer; Physics; Computer science; Condensed matter physics","score_opus":0.009229537207443047,"score_gpt":0.26315463478057205,"score_spread":0.253925097573129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988333015","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.8629354,0.00076947134,0.073849864,0.0014035404,0.00019474217,0.000047711335,0.0005310084,0.00024027987,0.060027972],"genre_scores_gemma":[0.9687773,0.00028609086,0.018534208,0.00016603476,0.00024207456,0.000057553374,0.00030667026,0.00006875295,0.011561299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914086,0.00024515614,0.00005822558,0.00016113145,0.00026527426,0.00012934108],"domain_scores_gemma":[0.99838495,0.0005293968,0.00028210558,0.00012217181,0.00017912936,0.00050230074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010472698,0.00052593084,0.00086396706,0.0021268274,0.0017797684,0.0050689196,0.0012307229,0.0009045325,0.00416223],"category_scores_gemma":[0.0024951524,0.0006297373,0.0005442586,0.0013192382,0.0034133287,0.005239597,0.0014807922,0.0017370031,0.0004014016],"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.00007647066,0.000031986492,0.00040172736,0.000025174793,0.00000665,0.000091393435,0.00023038776,0.0014420701,0.0012735677,0.9932168,0.0004583685,0.0027452805],"study_design_scores_gemma":[0.000024818502,0.000022611583,0.0003330584,0.000011740416,0.000007771176,0.00017190154,0.00015351421,0.009273207,0.0006261373,0.9873284,0.002029402,0.000017369239],"about_ca_topic_score_codex":0.0011469043,"about_ca_topic_score_gemma":0.00094981055,"teacher_disagreement_score":0.0050689196,"about_ca_system_score_codex":0.0014592641,"about_ca_system_score_gemma":0.0005920076,"threshold_uncertainty_score":0.013924003},"labels":[],"label_agreement":null},{"id":"W1989224319","doi":"10.1016/j.jctb.2008.07.003","title":"Excluding a group-labelled graph","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Mathematics; Graph; Abelian group; Robertson–Seymour theorem; Discrete mathematics; Line graph; 1-planar graph","score_opus":0.025041027880452885,"score_gpt":0.2730869488318363,"score_spread":0.24804592095138345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989224319","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.4605845,0.00027710028,0.18874045,0.0035840534,0.0009753627,0.00024630534,0.0009895888,0.0012296732,0.34337306],"genre_scores_gemma":[0.8483331,0.00026588046,0.06207944,0.0014556597,0.00036944804,0.0002592769,0.0020199064,0.00066953036,0.08454773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888855,0.000344907,0.000048267255,0.00027023384,0.00020388575,0.00024428382],"domain_scores_gemma":[0.99636406,0.0013561414,0.00035894677,0.0007437749,0.0005144628,0.0006626491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007472973,0.0007046977,0.0011233445,0.0017181197,0.0057740267,0.0033133642,0.0018252564,0.002909701,0.016990613],"category_scores_gemma":[0.0037301714,0.00064263836,0.0015540516,0.0012322107,0.002688489,0.0040127393,0.002650284,0.0029933339,0.0040406752],"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.00017723763,0.00008126611,0.0008199145,0.000105557636,0.00002092695,0.00046316447,0.0003882523,0.001274288,0.0044938433,0.9794605,0.00583971,0.0068753334],"study_design_scores_gemma":[0.000043974276,0.000043892494,0.0005344412,0.000044681172,0.000040813822,0.00034657755,0.0002253226,0.0072577014,0.0026354566,0.979044,0.009765792,0.000017282271],"about_ca_topic_score_codex":0.0014412524,"about_ca_topic_score_gemma":0.0024669617,"teacher_disagreement_score":0.016990613,"about_ca_system_score_codex":0.0008964182,"about_ca_system_score_gemma":0.0011238337,"threshold_uncertainty_score":0.056839228},"labels":[],"label_agreement":null},{"id":"W1990357453","doi":"10.1006/jctb.2001.2068","title":"Totally Free Expansions of Matroids","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"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":"Marsden Fund; National Security Agency","keywords":"Matroid; Combinatorics; Mathematics; Duality (order theory); Extension (predicate logic); Graphic matroid; Element (criminal law); Discrete mathematics; Rank (graph theory); Computer science","score_opus":0.015787991316954807,"score_gpt":0.2546160460856362,"score_spread":0.2388280547686814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990357453","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.7221098,0.000931954,0.069557056,0.0016558096,0.00040767284,0.000054449454,0.00043560247,0.00037074636,0.2044769],"genre_scores_gemma":[0.9363749,0.0005626978,0.018015591,0.0003646257,0.00050064304,0.00005363458,0.00043777184,0.00017249212,0.043517716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999616,0.00010071023,0.000018654891,0.000049762937,0.00013179422,0.00008293415],"domain_scores_gemma":[0.9990088,0.00048874645,0.00011106623,0.000088881796,0.00013463889,0.00016778163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003667792,0.0005131982,0.0006632108,0.0015742787,0.001051941,0.0019968771,0.00081184966,0.0007228154,0.008622662],"category_scores_gemma":[0.0015143775,0.00046529467,0.00065250735,0.001289364,0.0011898652,0.0026652173,0.0012386392,0.0022015623,0.00075720204],"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.0000435491,0.00003230177,0.00013514905,0.000029589686,0.0000059654726,0.00012423992,0.00019901348,0.0010103013,0.0018603272,0.9887595,0.0018363248,0.005963747],"study_design_scores_gemma":[0.000020800306,0.000020152618,0.0002929236,0.000012924616,0.000009731554,0.00023478203,0.000110878325,0.0054548043,0.0005447134,0.9891243,0.004163538,0.0000104654655],"about_ca_topic_score_codex":0.00044016298,"about_ca_topic_score_gemma":0.0012024953,"teacher_disagreement_score":0.008622662,"about_ca_system_score_codex":0.00073730806,"about_ca_system_score_gemma":0.00025379658,"threshold_uncertainty_score":0.028845727},"labels":[],"label_agreement":null},{"id":"W1991381366","doi":"10.1016/j.jctb.2003.11.004","title":"Colorings of the d-regular infinite tree","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"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 Toronto","funders":"","keywords":"Tree (set theory); Mathematics; Combinatorics; Computer science","score_opus":0.014375893882085673,"score_gpt":0.2519831543722079,"score_spread":0.23760726049012224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991381366","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.8178463,0.000706886,0.065954916,0.0011526678,0.00023240858,0.000037796468,0.00039893034,0.00031121037,0.11335889],"genre_scores_gemma":[0.96110135,0.00034440882,0.020115877,0.00024522597,0.00007964511,0.00003550991,0.00029874995,0.00013353956,0.01764577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974376,0.00006916982,0.000015342825,0.000050412225,0.00005794587,0.00006340663],"domain_scores_gemma":[0.99827397,0.00075195014,0.00014869214,0.00021899644,0.00025716604,0.00034923435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037940135,0.00025870078,0.00045196374,0.00143465,0.0014930776,0.0025684102,0.00086133514,0.00082388957,0.0044065323],"category_scores_gemma":[0.0022277697,0.00048251252,0.00043085866,0.0009388886,0.0014130527,0.0016897154,0.0008917293,0.0010978314,0.00059591094],"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.00006595038,0.000032579253,0.00066631055,0.000032637156,0.0000063410275,0.00020940584,0.00025796544,0.0020823649,0.0031136118,0.9868276,0.0019203529,0.0047849366],"study_design_scores_gemma":[0.000022584136,0.000012160058,0.0004947129,0.000021175445,0.000009239016,0.00023486148,0.00016805598,0.016769642,0.0010351023,0.9776014,0.0036180478,0.0000131363],"about_ca_topic_score_codex":0.0019203941,"about_ca_topic_score_gemma":0.0027846207,"teacher_disagreement_score":0.0044065323,"about_ca_system_score_codex":0.0011523531,"about_ca_system_score_gemma":0.00043990856,"threshold_uncertainty_score":0.014741361},"labels":[],"label_agreement":null},{"id":"W1991963660","doi":"10.1016/s0095-8956(03)00039-x","title":"The linear delta-matroid parity problem","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"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":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Matroid; Matroid partitioning; Oriented matroid; Weighted matroid; Minimax; Combinatorics; Mathematics; Parity (physics); Discrete mathematics; Generalization; Graphic matroid; Mathematical optimization; Mathematical analysis; Physics","score_opus":0.01284547565339551,"score_gpt":0.27372730726499367,"score_spread":0.26088183161159817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991963660","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.61335266,0.0015394606,0.21096745,0.018161593,0.00074300537,0.00019801037,0.0020001333,0.00070854137,0.15232913],"genre_scores_gemma":[0.94742274,0.00067922985,0.02942526,0.0009927639,0.00040591924,0.00011153448,0.0011115789,0.00013792964,0.019713083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990331,0.0003361948,0.00004326904,0.0002129862,0.00018992097,0.00018453631],"domain_scores_gemma":[0.99511045,0.0032345636,0.0003021943,0.00059943675,0.00036802917,0.00038537616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011139585,0.0004778181,0.0009786166,0.0006622583,0.0015517371,0.0034567136,0.0023011293,0.0023545967,0.011892157],"category_scores_gemma":[0.007027909,0.00049802795,0.00053808227,0.0013329858,0.0021354589,0.00530353,0.002151805,0.0031486077,0.0011526259],"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.00044792276,0.00021246757,0.0011929774,0.00028109236,0.000037742466,0.00031874696,0.000252453,0.0125184795,0.0021653904,0.90593123,0.018496115,0.0581454],"study_design_scores_gemma":[0.000082975326,0.000031686115,0.00020786359,0.000024185407,0.000015308558,0.00022675551,0.0001504307,0.03171446,0.0010774297,0.96345466,0.0030004736,0.000013788816],"about_ca_topic_score_codex":0.0008676172,"about_ca_topic_score_gemma":0.00067748985,"teacher_disagreement_score":0.011892157,"about_ca_system_score_codex":0.0011330972,"about_ca_system_score_gemma":0.0011855306,"threshold_uncertainty_score":0.0397833},"labels":[],"label_agreement":null},{"id":"W1992428436","doi":"10.1016/j.jctb.2013.07.001","title":"Characterizing graphic matroids by a system of linear equations","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"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":"Matroid; Graphic matroid; Rank (graph theory); Construct (python library); System of linear equations; Binary number; Linear equation; Mathematics; Oriented matroid; Combinatorics; Matroid partitioning; Discrete mathematics; Computer science; Mathematical analysis; Arithmetic; Programming language","score_opus":0.011407239103333898,"score_gpt":0.25369649348407347,"score_spread":0.24228925438073956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992428436","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.31457233,0.0003367938,0.6452059,0.0021047287,0.00020753937,0.0003386028,0.0014199334,0.0006174006,0.035196796],"genre_scores_gemma":[0.85386324,0.00042062532,0.120095156,0.0007910635,0.0004691755,0.0003784004,0.0017501746,0.00026776738,0.021964421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986072,0.0004383604,0.00008807164,0.00034737654,0.00032511068,0.00019390116],"domain_scores_gemma":[0.9958954,0.0025410745,0.0005786681,0.00030012804,0.00048272012,0.00020210941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011113151,0.000851398,0.001191419,0.0022302181,0.0010763023,0.0039797667,0.0016209362,0.0020049193,0.008696166],"category_scores_gemma":[0.00850239,0.0009905664,0.0015353946,0.0016193797,0.001654191,0.0031768342,0.0019517757,0.0029058023,0.0011382283],"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.00008318233,0.00021547334,0.0042331833,0.00018035538,0.00007095325,0.0003178467,0.0007959368,0.0471367,0.0051463945,0.9042767,0.009338498,0.028204758],"study_design_scores_gemma":[0.00005792065,0.000057832996,0.00089349295,0.000030214816,0.00003207061,0.00019043557,0.00019447827,0.26540148,0.0010315453,0.7290517,0.0030109482,0.0000479323],"about_ca_topic_score_codex":0.0022218153,"about_ca_topic_score_gemma":0.002946076,"teacher_disagreement_score":0.008696166,"about_ca_system_score_codex":0.0014657262,"about_ca_system_score_gemma":0.0008999573,"threshold_uncertainty_score":0.029091597},"labels":[],"label_agreement":null},{"id":"W1992684615","doi":"10.1016/j.jctb.2007.09.004","title":"Oriented star packings","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Digraph; Combinatorics; Disjoint sets; Mathematics; Star (game theory); Vertex (graph theory); Packing problems; Hypergraph; Stars; Discrete mathematics; Graph; Physics; Astrophysics","score_opus":0.010867677503855932,"score_gpt":0.27922039294997053,"score_spread":0.2683527154461146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992684615","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.62831783,0.00084846845,0.05245026,0.0011094307,0.00080148183,0.00011675406,0.00070188055,0.00047024974,0.31518358],"genre_scores_gemma":[0.91066474,0.00082388206,0.02584611,0.0005278316,0.0003216778,0.00011913663,0.001304883,0.00033890674,0.060052842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996203,0.00006191731,0.000022299626,0.00007789074,0.00012243923,0.00009523281],"domain_scores_gemma":[0.9993691,0.00015522017,0.00010742829,0.00008323945,0.00010980139,0.00017513479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021592782,0.00062991015,0.00078218326,0.0019830444,0.0021312414,0.0030024627,0.0006184319,0.0011003133,0.016104165],"category_scores_gemma":[0.0010867118,0.0006587555,0.0006088843,0.0020142568,0.0010911818,0.0018434549,0.001821015,0.001458916,0.0023879532],"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.00015369333,0.00009162057,0.0008145953,0.00008160225,0.00002550822,0.00026745073,0.00024385407,0.0026114748,0.003908358,0.9669959,0.008164978,0.01664089],"study_design_scores_gemma":[0.000056427434,0.0000715133,0.0014387096,0.000043971515,0.000044624496,0.00080717687,0.0005398674,0.018758545,0.0035392926,0.95023155,0.024439521,0.00002879817],"about_ca_topic_score_codex":0.0006262142,"about_ca_topic_score_gemma":0.00091626047,"teacher_disagreement_score":0.016104165,"about_ca_system_score_codex":0.00068308495,"about_ca_system_score_gemma":0.00039453723,"threshold_uncertainty_score":0.053873777},"labels":[],"label_agreement":null},{"id":"W1992739211","doi":"10.1016/j.jctb.2003.05.001","title":"Arrangements, circular arrangements and the crossing number of C7×C","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"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; University of Prince Edward Island","funders":"","keywords":"Conjecture; Crossing number (knot theory); Cartesian product; Combinatorics; Mathematics; Generalization; Level crossing; Planar; Product (mathematics); Geometry; Mathematical analysis; Computer science; Intersection (aeronautics); Engineering","score_opus":0.008694649643631898,"score_gpt":0.24731996633464864,"score_spread":0.23862531669101675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992739211","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.88537997,0.0007220593,0.03426417,0.0006475366,0.00022845212,0.00005535653,0.00038767233,0.0002093839,0.078105405],"genre_scores_gemma":[0.97461355,0.00034203826,0.013719134,0.00014029615,0.00007573478,0.000044051932,0.00039144338,0.0000880305,0.010585823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954516,0.000071546885,0.000031590418,0.00010799333,0.00012505935,0.00011861912],"domain_scores_gemma":[0.99799085,0.0008595689,0.0005052429,0.00013970127,0.00020269002,0.00030193554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043491626,0.00041606254,0.00041111672,0.0022939467,0.0016410274,0.0029054377,0.0007860474,0.0010311415,0.012656896],"category_scores_gemma":[0.0027295647,0.00033395368,0.0003436954,0.0020644502,0.0020052132,0.0017405412,0.0010588972,0.0012888531,0.0009898536],"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.0002242635,0.00007274544,0.0035415618,0.00009512691,0.000019356527,0.0003037855,0.00050002453,0.01202005,0.004565369,0.9349685,0.005422743,0.038266517],"study_design_scores_gemma":[0.00004548682,0.0000886824,0.004367062,0.00005467171,0.000036008165,0.00064574974,0.00058717484,0.03277529,0.004575636,0.9395161,0.017247636,0.000060356982],"about_ca_topic_score_codex":0.0023865574,"about_ca_topic_score_gemma":0.0026934864,"teacher_disagreement_score":0.012656896,"about_ca_system_score_codex":0.0010136527,"about_ca_system_score_gemma":0.00057788513,"threshold_uncertainty_score":0.04234153},"labels":[],"label_agreement":null},{"id":"W1993582455","doi":"10.1016/j.jctb.2005.06.008","title":"A counterexample to a conjecture of Björner and Lovász on the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>χ</mml:mi></mml:math>-coloring complex","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":13,"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":"Counterexample; Conjecture; Combinatorics; Vertex (graph theory); Graph; Mathematics; Discrete mathematics; Computer science","score_opus":0.019918449676751014,"score_gpt":0.24133005701670038,"score_spread":0.22141160733994936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993582455","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.4926771,0.0033513696,0.0949629,0.11405478,0.005524587,0.00016319538,0.0031846603,0.0022868407,0.28379458],"genre_scores_gemma":[0.9489705,0.0011260583,0.016515302,0.006500838,0.0019402549,0.00016279565,0.0021386978,0.00041959473,0.022225862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969465,0.00074888655,0.00020885385,0.0010391892,0.00051685126,0.00053972076],"domain_scores_gemma":[0.9781608,0.015435299,0.0010614371,0.0028324255,0.001322657,0.0011873861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025055204,0.0009912768,0.0019550482,0.0020214731,0.006383322,0.005555826,0.0025770268,0.00486211,0.019698491],"category_scores_gemma":[0.020600356,0.0010599066,0.0018081528,0.0030206093,0.007943091,0.010835761,0.0056572924,0.0066998196,0.0022868945],"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.00036596096,0.00011551336,0.0015929696,0.00017015268,0.000053658892,0.00074115227,0.0010081728,0.0017875838,0.0007766509,0.93251824,0.052882593,0.007987414],"study_design_scores_gemma":[0.00014977892,0.00003757677,0.000930211,0.00005726321,0.000048579932,0.0007655462,0.0004723242,0.0056106844,0.00065899146,0.9727842,0.018433716,0.000051114785],"about_ca_topic_score_codex":0.0032057196,"about_ca_topic_score_gemma":0.002840421,"teacher_disagreement_score":0.019698491,"about_ca_system_score_codex":0.0024289917,"about_ca_system_score_gemma":0.0012985473,"threshold_uncertainty_score":0.06589806},"labels":[],"label_agreement":null},{"id":"W1995705554","doi":"10.1006/jctb.2001.2065","title":"On Essential and Inessential Polygons in Embedded Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Rollins College","keywords":"Contractible space; Combinatorics; Embedding; Pairwise comparison; Mathematics; Disjoint sets; Polygon (computer graphics); Bounded function; Simple (philosophy); Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0069220900155023725,"score_gpt":0.22165195834114562,"score_spread":0.21472986832564325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995705554","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.7074735,0.0017395074,0.20387587,0.0012830104,0.00036076273,0.00007772172,0.00040660365,0.00022336804,0.08455964],"genre_scores_gemma":[0.9442154,0.0014066935,0.033436295,0.00017928243,0.00021248673,0.00003189528,0.00053398754,0.00022391441,0.019760037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995515,0.00010690577,0.00002621903,0.00008253226,0.00012847902,0.000104413266],"domain_scores_gemma":[0.9971572,0.0016266223,0.00033772658,0.0002948933,0.00022500058,0.0003585617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062305,0.0008204014,0.0008595097,0.0017685445,0.0011554137,0.0021421309,0.0015959267,0.001359261,0.0057409387],"category_scores_gemma":[0.0051529068,0.0006919061,0.00074515824,0.0012797358,0.0026925413,0.004388995,0.0026808747,0.0022528847,0.0004141179],"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.00010837078,0.00005083171,0.0010720588,0.000087760745,0.000008110434,0.000315139,0.0005129204,0.011879709,0.0014431328,0.9680005,0.0019711312,0.014550308],"study_design_scores_gemma":[0.000013582597,0.000027429622,0.0006765335,0.000041778298,0.000012395599,0.00020374644,0.0003371048,0.026929496,0.0006775588,0.96781373,0.0032560483,0.000010475718],"about_ca_topic_score_codex":0.0010995829,"about_ca_topic_score_gemma":0.00169679,"teacher_disagreement_score":0.0057409387,"about_ca_system_score_codex":0.0007890249,"about_ca_system_score_gemma":0.00028959732,"threshold_uncertainty_score":0.019205332},"labels":[],"label_agreement":null},{"id":"W1996619442","doi":"10.1016/j.jctb.2006.02.003","title":"Tree amalgamation of graphs and tessellations of the Cantor sphere","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Geometric and Algebraic Topology","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.009300546492239237,"score_gpt":0.2349204830309812,"score_spread":0.22561993653874196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996619442","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.88295597,0.0008310117,0.072837576,0.0006788509,0.0001954083,0.00005608631,0.0004171653,0.00048185294,0.04154612],"genre_scores_gemma":[0.96589524,0.00048535172,0.018390406,0.00013121347,0.00011658409,0.000047991565,0.00051307294,0.00014834342,0.014271676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966514,0.000058032503,0.000021238717,0.00006966404,0.00007800597,0.0001078733],"domain_scores_gemma":[0.998635,0.00042853068,0.00022950022,0.00019423784,0.00019873108,0.0003140449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025243594,0.0003577029,0.0007701229,0.0018635863,0.002146997,0.003638581,0.0011572195,0.0009939171,0.0062926863],"category_scores_gemma":[0.0016176769,0.00043353063,0.00080737623,0.001737954,0.0019851585,0.0021661425,0.0014909755,0.0011789909,0.00073532615],"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.00014755235,0.000029997207,0.0010151225,0.000061103216,0.000016944496,0.00022534562,0.000767172,0.0075099487,0.0046015047,0.9694955,0.0032030165,0.012926679],"study_design_scores_gemma":[0.000031133797,0.000037092195,0.0014798386,0.000025189676,0.000026727239,0.00036374788,0.0006098752,0.044199154,0.002859143,0.94041413,0.009918642,0.00003523648],"about_ca_topic_score_codex":0.0047895745,"about_ca_topic_score_gemma":0.0042478633,"teacher_disagreement_score":0.0062926863,"about_ca_system_score_codex":0.0012914076,"about_ca_system_score_gemma":0.00043740112,"threshold_uncertainty_score":0.021051168},"labels":[],"label_agreement":null},{"id":"W1998475227","doi":"10.1016/j.jctb.2005.06.002","title":"Multiplicative graphs and semi-lattice endomorphisms in the category of graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Multiplicative function; Endomorphism; Mathematics; Combinatorics; Lattice (music); Pathwidth; Discrete mathematics; Graph; Physics; Line graph","score_opus":0.011375846142226588,"score_gpt":0.23998390167450545,"score_spread":0.22860805553227886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998475227","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.75360096,0.0019558917,0.19675726,0.0039112354,0.000355288,0.000054290962,0.00040633482,0.0003225606,0.04263617],"genre_scores_gemma":[0.97226644,0.00065142126,0.017888155,0.00030803317,0.00032874144,0.000045456265,0.00022410639,0.00006236512,0.008225247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986185,0.00047055536,0.000086539,0.00027381105,0.00039502032,0.000155618],"domain_scores_gemma":[0.9957145,0.0019256726,0.0005183426,0.00050658133,0.00067944406,0.00065549277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014073966,0.0005084254,0.0006805219,0.0027761948,0.0016256968,0.004578541,0.0011011316,0.0010772722,0.0029147826],"category_scores_gemma":[0.0037068918,0.0005911911,0.00077646424,0.0018808686,0.0038623014,0.006797673,0.0028653038,0.0018713634,0.00031590852],"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.00002350332,0.000017756709,0.00066780415,0.00001569812,0.000006577512,0.00007509552,0.0003275308,0.0003582908,0.0007232611,0.9943041,0.00033042597,0.0031497881],"study_design_scores_gemma":[0.000010265445,0.000019522515,0.0006269646,0.00000794549,0.000009195849,0.0002418159,0.00021578555,0.0025206327,0.00030806704,0.9932268,0.0027998604,0.000013155348],"about_ca_topic_score_codex":0.0009412182,"about_ca_topic_score_gemma":0.0007905693,"teacher_disagreement_score":0.004578541,"about_ca_system_score_codex":0.0010955088,"about_ca_system_score_gemma":0.00070890656,"threshold_uncertainty_score":0.009750903},"labels":[],"label_agreement":null},{"id":"W2002026379","doi":"10.1006/jctb.2002.2112","title":"The Quadrangulation Conjecture for Orientable Surfaces","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"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":"Bijection, injection and surjection; Bijection; Combinatorics; Mathematics; Conjecture; Bipartite graph; Planar; Integer (computer science); Genus; Graph","score_opus":0.016320060838556773,"score_gpt":0.26806094596182506,"score_spread":0.2517408851232683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002026379","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.7235877,0.0025281643,0.035693314,0.012112138,0.0009361235,0.00005461165,0.0007322947,0.00047187344,0.22388367],"genre_scores_gemma":[0.9732676,0.001128921,0.005685341,0.001112873,0.00044415623,0.000028873545,0.0008755548,0.00011235771,0.017344387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993734,0.00012710397,0.000027765911,0.00014831884,0.00015808,0.00016541808],"domain_scores_gemma":[0.99822253,0.00095359155,0.00017328886,0.00032945062,0.00012885548,0.00019223374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005860505,0.0007437188,0.0010787746,0.0009967923,0.0018561417,0.004465227,0.0012813788,0.0021873603,0.014280276],"category_scores_gemma":[0.0034225918,0.00062035315,0.000676039,0.0012518694,0.003108893,0.0065645142,0.0026105908,0.0040824977,0.0020826487],"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.00020631714,0.00009090459,0.0016338979,0.000143138,0.000021970567,0.00033234258,0.00034817797,0.0034678716,0.0013845172,0.9613609,0.011697455,0.019312559],"study_design_scores_gemma":[0.000024766925,0.000012503217,0.00040671986,0.000017094515,0.000008104511,0.00013221006,0.00017321731,0.003585997,0.0003176452,0.9906026,0.0047101406,0.000008899315],"about_ca_topic_score_codex":0.0016484328,"about_ca_topic_score_gemma":0.0016517785,"teacher_disagreement_score":0.014280276,"about_ca_system_score_codex":0.0009419427,"about_ca_system_score_gemma":0.00037808513,"threshold_uncertainty_score":0.047772348},"labels":[],"label_agreement":null},{"id":"W2002473456","doi":"10.1016/j.jctb.2015.04.006","title":"Sparse halves in dense triangle-free graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Degree (music); Trapezoid graph; Graph; Chordal graph; Split graph; Discrete mathematics; Indifference graph; 1-planar graph","score_opus":0.043663304583729926,"score_gpt":0.28988127677971504,"score_spread":0.24621797219598512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002473456","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.84938955,0.0005879106,0.07974759,0.001541084,0.0001089089,0.000057275964,0.00036595366,0.00029355078,0.06790804],"genre_scores_gemma":[0.9729637,0.00042143025,0.01185735,0.00031150455,0.000107020474,0.000084361156,0.00034545694,0.0001116664,0.013797472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.00016834549,0.000030938667,0.000113404036,0.00021892015,0.00013451686],"domain_scores_gemma":[0.99494416,0.0033651332,0.00040289044,0.00030007222,0.00034718015,0.00064059923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006356618,0.0005706049,0.0010767098,0.0023024247,0.0020700386,0.0035792666,0.0018667262,0.0014381215,0.009802899],"category_scores_gemma":[0.0065672137,0.0010659142,0.0006441142,0.0016716293,0.0035718933,0.005025378,0.0033089535,0.0027431364,0.0009451534],"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.000105141065,0.00004835361,0.00077649654,0.00006273364,0.0000123703385,0.0002288259,0.00081701024,0.0025286963,0.0011299181,0.9864101,0.0017046349,0.006175739],"study_design_scores_gemma":[0.000019578738,0.00001007854,0.00020570979,0.000013179174,0.000006225567,0.00013485785,0.00024324005,0.00633881,0.00040243097,0.99193513,0.00068426377,0.00000650132],"about_ca_topic_score_codex":0.0016008227,"about_ca_topic_score_gemma":0.0023387456,"teacher_disagreement_score":0.009802899,"about_ca_system_score_codex":0.000786397,"about_ca_system_score_gemma":0.0004103692,"threshold_uncertainty_score":0.032794},"labels":[],"label_agreement":null},{"id":"W2002893084","doi":"10.1016/j.jctb.2003.08.004","title":"Bounded degree acyclic decompositions of digraphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"","keywords":"Digraph; Partition (number theory); Combinatorics; Directed acyclic graph; Mathematics; Degree (music); Bounded function; Integer (computer science); Vertex (graph theory); Decomposition; Directed graph; Discrete mathematics; Graph; Chemistry; Computer science; Physics","score_opus":0.009481242828341514,"score_gpt":0.20708025769932967,"score_spread":0.19759901487098816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002893084","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.46040425,0.0014250444,0.46358147,0.0010986197,0.00012812973,0.00018569693,0.003240506,0.0006806427,0.0692556],"genre_scores_gemma":[0.8836208,0.0012211119,0.086975865,0.00038489728,0.00010724274,0.00016070035,0.0037524018,0.00020208076,0.023574905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949765,0.00012693407,0.00003643526,0.000121446355,0.0001024392,0.00011497038],"domain_scores_gemma":[0.99600005,0.002129188,0.0003990372,0.00040992143,0.000475397,0.0005863921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005145145,0.00056405476,0.0005319714,0.0022367267,0.0009103787,0.0025905764,0.00085975876,0.0006286093,0.00808238],"category_scores_gemma":[0.0035559002,0.00065522565,0.0005380479,0.0016909007,0.0007819083,0.002179042,0.00090143684,0.0012960705,0.000848455],"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.0001596654,0.000108884524,0.0017114143,0.00017043625,0.000040550163,0.00027489226,0.00054795056,0.015806245,0.0051970906,0.9390061,0.006071742,0.030904923],"study_design_scores_gemma":[0.000027121856,0.000019014777,0.00089473627,0.00005601426,0.000036013433,0.00019454907,0.0001828294,0.046632815,0.0010703129,0.9439397,0.0069324602,0.000014401356],"about_ca_topic_score_codex":0.0016988015,"about_ca_topic_score_gemma":0.0039666328,"teacher_disagreement_score":0.00808238,"about_ca_system_score_codex":0.00092622556,"about_ca_system_score_gemma":0.00046777749,"threshold_uncertainty_score":0.027038276},"labels":[],"label_agreement":null},{"id":"W2003376141","doi":"10.1016/j.jctb.2008.01.007","title":"A new characterization of graphic matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Matroid; Characterization (materials science); Graphic matroid; Computer science; Binary number; Combinatorics; Mathematics; Arithmetic; Physics","score_opus":0.009260047484923319,"score_gpt":0.22148776045745042,"score_spread":0.2122277129725271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003376141","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.38430697,0.0022841035,0.41077343,0.005256337,0.00071988604,0.00018712766,0.0019135592,0.0010539873,0.19350454],"genre_scores_gemma":[0.8837679,0.0017087763,0.06814287,0.0012703344,0.0017896483,0.00021268283,0.0017686096,0.0004974006,0.040841844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989214,0.00021521887,0.00008281363,0.0003015339,0.00033078797,0.00014829208],"domain_scores_gemma":[0.9965521,0.0014193045,0.00058989855,0.00047134943,0.0004657283,0.0005015405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611453,0.001160177,0.0009533278,0.0050037517,0.0014958938,0.006082989,0.0016031455,0.001542473,0.012468909],"category_scores_gemma":[0.0038202696,0.0007436129,0.00091752934,0.004174413,0.0024908325,0.006706328,0.0025103157,0.0035133692,0.0018799073],"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.000058386,0.00005277372,0.0009511702,0.000085070955,0.000015043292,0.0001910409,0.00037894124,0.001791492,0.003150109,0.9634694,0.0057133986,0.024143312],"study_design_scores_gemma":[0.000023656792,0.00006949942,0.0013260468,0.000051208095,0.000029356037,0.0010063485,0.0002464295,0.019752292,0.0015397315,0.9541476,0.02177177,0.00003603345],"about_ca_topic_score_codex":0.00045669754,"about_ca_topic_score_gemma":0.00047863612,"teacher_disagreement_score":0.012468909,"about_ca_system_score_codex":0.0013274363,"about_ca_system_score_gemma":0.0003501938,"threshold_uncertainty_score":0.04171264},"labels":[],"label_agreement":null},{"id":"W2005661925","doi":"10.1016/j.jctb.2015.02.004","title":"Projective geometries in exponentially dense matroids. II","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","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 Waterloo","funders":"","keywords":"Matroid; Rank (graph theory); Combinatorics; Graphic matroid; Mathematics; Integer (computer science); Constant (computer programming); Prime (order theory); Prime power; Projective plane; Matroid partitioning; Discrete mathematics; Computer science; Geometry","score_opus":0.023206630527263093,"score_gpt":0.28658820357473674,"score_spread":0.26338157304747367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005661925","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.5700492,0.009037418,0.09869093,0.008611471,0.0008414386,0.00010518418,0.001805449,0.00042168616,0.31043726],"genre_scores_gemma":[0.9586747,0.0022287758,0.010946017,0.00040343506,0.00096666854,0.00005917047,0.0008142628,0.000099974946,0.025806911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936134,0.00018400057,0.000026468011,0.00013799932,0.0001410932,0.00014913233],"domain_scores_gemma":[0.9977926,0.0011920262,0.00025435045,0.00022193896,0.0001924743,0.00034669897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004787917,0.0004943353,0.00060306786,0.0011886009,0.0012787118,0.0032502473,0.0007582252,0.00074881606,0.0111473985],"category_scores_gemma":[0.0031993035,0.00065305736,0.0005342392,0.0011612716,0.0027623563,0.0059039113,0.002377921,0.003211475,0.0014051502],"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.000041764604,0.000025676522,0.0009009715,0.00007694385,0.000007952016,0.00008852636,0.00026346272,0.0012849487,0.0006530018,0.9845955,0.0055400315,0.006521188],"study_design_scores_gemma":[0.000013607948,0.00002325823,0.0012916897,0.000031270996,0.000008488506,0.00031843528,0.00020872625,0.003168643,0.00037533784,0.9883067,0.00624447,0.000009332924],"about_ca_topic_score_codex":0.00085808337,"about_ca_topic_score_gemma":0.0009396367,"teacher_disagreement_score":0.0111473985,"about_ca_system_score_codex":0.0011254187,"about_ca_system_score_gemma":0.0003830025,"threshold_uncertainty_score":0.037291825},"labels":[],"label_agreement":null},{"id":"W2006587062","doi":"10.1006/jctb.2001.2082","title":"Branch-Width and Well-Quasi-Ordering in Matroids and Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":103,"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":"Matroid; Bounded function; Combinatorics; Mathematics; Class (philosophy); Graphic matroid; Discrete mathematics; Tree (set theory); Computer science; Mathematical analysis","score_opus":0.010457935432773438,"score_gpt":0.24424879096954472,"score_spread":0.23379085553677129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006587062","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.79460114,0.004547735,0.16012399,0.0053791706,0.0002354747,0.00006848399,0.0009044652,0.00030571935,0.03383383],"genre_scores_gemma":[0.95273936,0.0024091431,0.034360033,0.0003991278,0.000643298,0.000094441566,0.00064377853,0.00013292219,0.008577941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988065,0.00042045058,0.00010310347,0.00025356282,0.00022556195,0.00019093855],"domain_scores_gemma":[0.98123986,0.012665428,0.0023674867,0.0010327406,0.0008835479,0.001810873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028094358,0.0010192591,0.0016122544,0.0032427993,0.0025417819,0.008045029,0.0023164635,0.0022587348,0.006433443],"category_scores_gemma":[0.011419539,0.0015960109,0.0010284455,0.0052124774,0.0054263845,0.019595087,0.0019373408,0.004855806,0.00059174304],"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.0001529174,0.000098306875,0.0022380624,0.000099582045,0.000018854644,0.00009318272,0.0006619357,0.0029229128,0.0012036227,0.98159814,0.0013472518,0.009565394],"study_design_scores_gemma":[0.000018510204,0.000015743704,0.00049682305,0.000014289341,0.000012194403,0.000077136225,0.00017779773,0.0057385894,0.00022291686,0.992585,0.0006315815,0.000009483037],"about_ca_topic_score_codex":0.0012781944,"about_ca_topic_score_gemma":0.002283999,"teacher_disagreement_score":0.008045029,"about_ca_system_score_codex":0.0017587686,"about_ca_system_score_gemma":0.00093202974,"threshold_uncertainty_score":0.021522045},"labels":[],"label_agreement":null},{"id":"W2006973630","doi":"10.1016/j.jctb.2009.11.002","title":"Corrigendum to “Asymptotically optimal frugal colouring” [J. Combin. Theory Ser. B 100 (2) (2010) 226–246]","year":2009,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Theory Series B","topic":"African history and culture studies","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Asymptotically optimal algorithm; Mathematics; Combinatorics; Computer science; Algorithm","score_opus":0.016226271762665674,"score_gpt":0.2670991222806906,"score_spread":0.25087285051802494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006973630","genre_codex":"editorial","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.00032740753,0.003835183,0.0026412224,0.05315751,0.9162053,0.000078859506,0.0015346966,0.0006613659,0.021558508],"genre_scores_gemma":[0.02522851,0.018636389,0.011733975,0.07904143,0.35220936,0.000560972,0.006792629,0.0024482794,0.5033485],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99575174,0.00079545,0.0004686357,0.00087928504,0.0016430662,0.0004618084],"domain_scores_gemma":[0.9881285,0.0032005329,0.0004715625,0.0013463232,0.0062921825,0.0005609335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028157684,0.0032570765,0.004000324,0.0046953205,0.004668986,0.003895213,0.0059135407,0.0059243846,0.16024841],"category_scores_gemma":[0.026864568,0.0017815018,0.004074932,0.0039678086,0.003036234,0.0054645794,0.0026825455,0.006386293,0.059506707],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000033488246,0.000010527097,0.000036896454,0.00012214274,0.000020343168,0.00008431495,0.000013999707,0.00012398245,0.00007076162,0.002364084,0.9923235,0.0047959546],"study_design_scores_gemma":[0.00008734233,0.00007644603,0.0018717486,0.00026040908,0.00012449984,0.00047023947,0.00007911488,0.001404716,0.0007388626,0.02443327,0.97031456,0.00013876385],"about_ca_topic_score_codex":0.020149881,"about_ca_topic_score_gemma":0.030584324,"teacher_disagreement_score":0.16024841,"about_ca_system_score_codex":0.007316542,"about_ca_system_score_gemma":0.0026082564,"threshold_uncertainty_score":0.53608435},"labels":[],"label_agreement":null},{"id":"W2008376525","doi":"10.1016/j.jctb.2005.06.012","title":"Spectral estimates for Abelian Cayley graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of British Columbia","funders":"","keywords":"Cayley graph; Abelian group; Mathematics; Combinatorics; Graph","score_opus":0.0184068595003851,"score_gpt":0.3013967546848512,"score_spread":0.2829898951844661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008376525","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.39647904,0.00514672,0.46234095,0.0072329277,0.0010999083,0.00009214708,0.00055571005,0.0009925128,0.12606001],"genre_scores_gemma":[0.93954486,0.003007898,0.029566847,0.0010716709,0.0020648018,0.0001544881,0.0005347703,0.00038648242,0.023668181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989976,0.00034327098,0.000044535504,0.00015275735,0.00032232382,0.00013940586],"domain_scores_gemma":[0.9904503,0.005535803,0.0010235533,0.0007149538,0.0013835917,0.0008917929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023133394,0.0014650088,0.0011773715,0.0064201006,0.0016209548,0.003105986,0.0019477005,0.0015945466,0.010173613],"category_scores_gemma":[0.013037549,0.00074187625,0.0008011311,0.002440187,0.0031626865,0.006380232,0.0028554734,0.003624009,0.0016839379],"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.000018724351,0.000024330127,0.00028166396,0.00004167985,0.000009699356,0.00003379334,0.0001603655,0.001839259,0.0007610463,0.9915571,0.002097635,0.0031746272],"study_design_scores_gemma":[0.000008877495,0.000010014321,0.00029895717,0.000030252657,0.000011486163,0.00006979468,0.00009041721,0.022339694,0.0004175956,0.97488004,0.0018229192,0.000019858595],"about_ca_topic_score_codex":0.0017204144,"about_ca_topic_score_gemma":0.0019016376,"teacher_disagreement_score":0.010173613,"about_ca_system_score_codex":0.0014917686,"about_ca_system_score_gemma":0.00057510287,"threshold_uncertainty_score":0.034034133},"labels":[],"label_agreement":null},{"id":"W2008773627","doi":"10.1016/j.jctb.2005.11.001","title":"Obstructions to branch-decomposition of matroids","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"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":"Matroid; Combinatorics; Mathematics; Net (polyhedron); Characterization (materials science); Class (philosophy); Minor (academic); Set (abstract data type); Pairwise comparison; Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.009228262069560421,"score_gpt":0.29100298755742676,"score_spread":0.28177472548786636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008773627","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.7858309,0.000618477,0.062888354,0.0037305162,0.00038142328,0.00010476179,0.00045589157,0.0005222323,0.14546742],"genre_scores_gemma":[0.95182186,0.0005905347,0.014619194,0.00036920884,0.0004305651,0.00008473205,0.00066202885,0.0002526601,0.031169055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894446,0.000254005,0.000053778313,0.00012506515,0.00032653977,0.0002960793],"domain_scores_gemma":[0.9967686,0.0011971755,0.00043397603,0.0002980416,0.00023765188,0.0010646599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095661654,0.0007750002,0.001372253,0.003163942,0.0033606885,0.0057105212,0.0014892479,0.002296958,0.0137454625],"category_scores_gemma":[0.0043071928,0.001073386,0.0013248533,0.0022007748,0.003311343,0.0049215974,0.0046655126,0.0058427523,0.0016193282],"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.000053409094,0.00005772631,0.00037658747,0.000025648676,0.000007545862,0.00011546457,0.0002795574,0.0009148052,0.00070887466,0.99327046,0.0018106358,0.0023791485],"study_design_scores_gemma":[0.000025859572,0.000010562283,0.0002689964,0.000011106779,0.0000071445284,0.00009314912,0.00012512955,0.0044528265,0.00023406479,0.99286383,0.001899618,0.000007731601],"about_ca_topic_score_codex":0.0012562446,"about_ca_topic_score_gemma":0.0018207817,"teacher_disagreement_score":0.0137454625,"about_ca_system_score_codex":0.0016772848,"about_ca_system_score_gemma":0.0006991915,"threshold_uncertainty_score":0.045983136},"labels":[],"label_agreement":null},{"id":"W2008912653","doi":"10.1016/j.jctb.2014.11.008","title":"A density Hales–Jewett theorem for matroids","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"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":"Office of Naval Research","keywords":"Matroid; Mathematics; Mathematical economics; Combinatorics","score_opus":0.01541190292802947,"score_gpt":0.2713370931026248,"score_spread":0.25592519017459536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008912653","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.26997492,0.004383735,0.46509388,0.014506193,0.00082146405,0.00012994933,0.0010711617,0.00076068996,0.24325807],"genre_scores_gemma":[0.88139063,0.0027911614,0.05854635,0.0023153932,0.0018317002,0.00028335792,0.000646267,0.000311071,0.051884085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988686,0.00026656338,0.00006242383,0.0002481014,0.00040604136,0.00014832568],"domain_scores_gemma":[0.99360317,0.003801142,0.0003294837,0.00063446414,0.0009855722,0.000646065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018683118,0.0007347384,0.0016894041,0.0040082005,0.0032771481,0.0039330493,0.0026551497,0.0018928626,0.01188773],"category_scores_gemma":[0.011023273,0.00112777,0.0014810405,0.0029456473,0.0054229223,0.011260253,0.004496356,0.0050318623,0.0012675517],"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.000009191966,0.00001028987,0.00013977531,0.0000214562,0.000005063207,0.000019815374,0.0001011707,0.00029776755,0.00016367309,0.99516666,0.0017173343,0.0023477823],"study_design_scores_gemma":[0.0000067559113,0.0000038637463,0.00011074158,0.000007836038,0.0000048798465,0.00005999473,0.000035662335,0.0028759376,0.00013704502,0.994753,0.0019974543,0.000006759868],"about_ca_topic_score_codex":0.0020586632,"about_ca_topic_score_gemma":0.001551825,"teacher_disagreement_score":0.01188773,"about_ca_system_score_codex":0.00220503,"about_ca_system_score_gemma":0.00084836077,"threshold_uncertainty_score":0.039768398},"labels":[],"label_agreement":null},{"id":"W2010114044","doi":"10.1016/j.jctb.2010.04.002","title":"Confinement of matroid representations to subsets of partial fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":40,"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":"Matroid; Mathematics; Lift (data mining); Combinatorics; Finite field; Representation theorem; Algebraic number; Corollary; Field (mathematics); Characterization (materials science); Discrete mathematics; Matrix (chemical analysis); Homomorphism; Pure mathematics; Mathematical analysis","score_opus":0.02097539794582488,"score_gpt":0.3308868804174328,"score_spread":0.30991148247160794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010114044","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.9139781,0.0003253729,0.051336817,0.0011541373,0.00016086188,0.000047405156,0.00027062764,0.00026507175,0.032461666],"genre_scores_gemma":[0.98496085,0.00020143387,0.0071244724,0.00017680663,0.00020688106,0.000054349268,0.00029856715,0.00008908023,0.0068875863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989827,0.00022936195,0.00006578459,0.00018139923,0.00024753012,0.00029314528],"domain_scores_gemma":[0.99750865,0.0007612158,0.00036168128,0.00042617362,0.00025593897,0.00068625977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009843755,0.00038727355,0.0011209693,0.0021912395,0.0030095035,0.0051214346,0.0010636714,0.0011898697,0.005263398],"category_scores_gemma":[0.003313092,0.0005938018,0.0009282182,0.0019247376,0.0028913745,0.0059965453,0.0034894662,0.0019909267,0.00037819633],"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.00005247628,0.00003261591,0.0003889774,0.000018808894,0.0000075737516,0.0001254233,0.00072110485,0.00033743112,0.0013519021,0.9942365,0.0005314384,0.002195747],"study_design_scores_gemma":[0.000027852542,0.000031996504,0.0007248005,0.00001507593,0.000012001596,0.00023290688,0.0006095512,0.003591929,0.0008046959,0.99139905,0.002533064,0.000016993312],"about_ca_topic_score_codex":0.0010734837,"about_ca_topic_score_gemma":0.0010002742,"teacher_disagreement_score":0.005263398,"about_ca_system_score_codex":0.0014417239,"about_ca_system_score_gemma":0.00049099146,"threshold_uncertainty_score":0.017607808},"labels":[],"label_agreement":null},{"id":"W2013664277","doi":"10.1006/jctb.2002.2128","title":"Packing Odd Circuits in Eulerian Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Eulerian path; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Integer (computer science); Discrete mathematics; Computer science; Mathematical analysis; Telecommunications","score_opus":0.02289851368456595,"score_gpt":0.26171793746704963,"score_spread":0.2388194237824837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013664277","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.9479059,0.00054393505,0.024321556,0.0004977477,0.00013926257,0.0000400336,0.00025033628,0.00016750488,0.026133768],"genre_scores_gemma":[0.97375715,0.0006489903,0.012829712,0.00020369918,0.00009536905,0.00004114336,0.0005006654,0.00013790074,0.011785382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956447,0.00008169713,0.000029046287,0.000081407576,0.00008307275,0.00016028658],"domain_scores_gemma":[0.99817514,0.0009705227,0.00028345117,0.00023154762,0.00008246146,0.00025687244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034529946,0.00064747414,0.0010017615,0.0015487515,0.001702553,0.0035288385,0.0010830691,0.0012728203,0.0072131543],"category_scores_gemma":[0.0026435382,0.0008145893,0.00044540243,0.0022452062,0.0015294054,0.0037153384,0.0019502772,0.0013568862,0.0005025328],"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.0009163974,0.00036858424,0.0093867285,0.0003600439,0.00007446269,0.0014171096,0.0013913579,0.032324832,0.015918285,0.86710376,0.009306399,0.061431948],"study_design_scores_gemma":[0.000085097075,0.000102803424,0.0030501331,0.00006901882,0.00007266158,0.00046750312,0.0007212976,0.042699985,0.004897802,0.9414343,0.0063759424,0.0000234023],"about_ca_topic_score_codex":0.0013219953,"about_ca_topic_score_gemma":0.0026675265,"teacher_disagreement_score":0.0072131543,"about_ca_system_score_codex":0.0008672126,"about_ca_system_score_gemma":0.00038489208,"threshold_uncertainty_score":0.024130404},"labels":[],"label_agreement":null},{"id":"W2014824669","doi":"10.1016/j.jctb.2012.10.002","title":"Cops and robbers in a random graph","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Hungarian Scientific Research Fund; Nemzeti Kutatási és Technológiai Hivatal; Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Random graph; Random regular graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.010801777342243853,"score_gpt":0.2653487859544998,"score_spread":0.25454700861225593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014824669","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.6336055,0.0018219594,0.29321337,0.0090360865,0.00037359892,0.0003007069,0.001262003,0.0009758963,0.059411004],"genre_scores_gemma":[0.91135734,0.0010686356,0.04363501,0.0009168173,0.00050059176,0.00030910553,0.0007224867,0.0005743926,0.04091556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974124,0.0011115499,0.000093131785,0.0005129141,0.0004836761,0.00038640358],"domain_scores_gemma":[0.97870857,0.01494321,0.0017184855,0.0018475063,0.000799266,0.0019829224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021679972,0.0011016347,0.0030806898,0.0038343954,0.0033790716,0.004467277,0.0028403006,0.0037742925,0.0140975],"category_scores_gemma":[0.019529622,0.0017406,0.001479895,0.0031694314,0.004133927,0.0077403123,0.0031250448,0.003434815,0.001704815],"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.00018033257,0.00009922913,0.0008545773,0.00015067206,0.000056177818,0.00037832235,0.00047573668,0.02518841,0.001202033,0.9555551,0.008449584,0.007409831],"study_design_scores_gemma":[0.00006965754,0.00003817173,0.00063280936,0.000047689056,0.00004940632,0.00034297386,0.0002105798,0.11443888,0.00062657124,0.87990934,0.0035925913,0.000041270847],"about_ca_topic_score_codex":0.002403682,"about_ca_topic_score_gemma":0.0028953338,"teacher_disagreement_score":0.0140975,"about_ca_system_score_codex":0.0014589438,"about_ca_system_score_gemma":0.0009412738,"threshold_uncertainty_score":0.047160864},"labels":[],"label_agreement":null},{"id":"W2014924232","doi":"10.1016/j.jctb.2014.06.004","title":"Colouring graphs when the number of colours is almost the maximum degree","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Degree (music); Chromatic scale; Constant (computer programming); Discrete mathematics","score_opus":0.018647920120497957,"score_gpt":0.27657573051166157,"score_spread":0.25792781039116364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014924232","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.84378827,0.0006149602,0.10312096,0.0030974708,0.00023626242,0.00008979731,0.000610539,0.00087219116,0.047569588],"genre_scores_gemma":[0.97630036,0.00024290157,0.016344417,0.00034816883,0.00014312427,0.000058046786,0.00026338143,0.00017152439,0.0061280373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862635,0.0003849586,0.00007304663,0.00030205262,0.0002082936,0.0004052107],"domain_scores_gemma":[0.97998786,0.013731999,0.001524555,0.0021103062,0.0009113402,0.0017339712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014135567,0.0006897903,0.0010521951,0.0014348221,0.0016707304,0.0038296846,0.0019117884,0.0028742196,0.0076286537],"category_scores_gemma":[0.013028931,0.0010174147,0.000841559,0.0012462034,0.002578736,0.0051854067,0.0019448346,0.002199729,0.0006877748],"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.001034924,0.00019276112,0.0063826772,0.00029722755,0.00009263751,0.00115225,0.00077882863,0.0382226,0.02590752,0.8912535,0.010663788,0.024021331],"study_design_scores_gemma":[0.00010605911,0.000058567442,0.0020254792,0.00004464295,0.000057172,0.0010510694,0.00031256783,0.07899788,0.005601724,0.9085528,0.0031461462,0.000045921995],"about_ca_topic_score_codex":0.001091789,"about_ca_topic_score_gemma":0.0017764498,"teacher_disagreement_score":0.0076286537,"about_ca_system_score_codex":0.0013516576,"about_ca_system_score_gemma":0.00070851826,"threshold_uncertainty_score":0.025520384},"labels":[],"label_agreement":null},{"id":"W2016808872","doi":"10.1016/j.jctb.2006.07.006","title":"Extreme eigenvalues of nonregular graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Eigenvalues and eigenvectors; Mathematics; Adjacency matrix; Upper and lower bounds; Graph; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.02581874398230166,"score_gpt":0.2677072303653798,"score_spread":0.24188848638307814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016808872","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.9012108,0.00034888388,0.062888816,0.00092687213,0.00024723794,0.000033978085,0.00009284553,0.0003086551,0.033941943],"genre_scores_gemma":[0.98853415,0.00015895271,0.0056651803,0.00011542153,0.00017062426,0.000036982237,0.0000656412,0.00006926847,0.0051837945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999498,0.00014040855,0.000022089502,0.00007597139,0.00016618556,0.000097335265],"domain_scores_gemma":[0.9979353,0.0008639139,0.00031857876,0.00017917783,0.00023147586,0.00047149885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063954975,0.0006402654,0.0007342565,0.0026411405,0.0013861477,0.0024893237,0.0008602857,0.0012869653,0.004884525],"category_scores_gemma":[0.0037791047,0.0004964879,0.0003733627,0.00089356693,0.002076559,0.0018706528,0.001308149,0.0014208711,0.00057261996],"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.00013049302,0.0000882263,0.0011894195,0.000048576392,0.000019692181,0.00033504242,0.00048238953,0.0051755016,0.007658267,0.97585016,0.002327307,0.006695039],"study_design_scores_gemma":[0.000025502259,0.000019158724,0.0007756457,0.0000098199835,0.000005713248,0.0001957803,0.0001798712,0.018804668,0.0006792186,0.97862405,0.0006651403,0.000015418182],"about_ca_topic_score_codex":0.0003279762,"about_ca_topic_score_gemma":0.0005727584,"teacher_disagreement_score":0.004884525,"about_ca_system_score_codex":0.000600569,"about_ca_system_score_gemma":0.00026646798,"threshold_uncertainty_score":0.016340315},"labels":[],"label_agreement":null},{"id":"W2016843307","doi":"10.1016/j.jctb.2008.07.007","title":"Weighted enumeration of spanning subgraphs with degree constraints","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":21,"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":"Enumeration; Degree (music); Combinatorics; Computer science; Mathematics; Physics","score_opus":0.0532364939173922,"score_gpt":0.2951162094085187,"score_spread":0.24187971549112647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016843307","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.16642047,0.0003281515,0.8212839,0.0005256651,0.00004543564,0.00011884849,0.0007151917,0.0003073091,0.010255044],"genre_scores_gemma":[0.5870494,0.00064635684,0.39674482,0.0003424403,0.000120684555,0.0005149632,0.0023805324,0.00050474383,0.011696061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983381,0.00082205073,0.00007927415,0.00028843325,0.00030365595,0.00016851861],"domain_scores_gemma":[0.98587036,0.011092717,0.0007517413,0.0011169715,0.00073392916,0.00043429242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00209965,0.00082845875,0.0013279477,0.0019066209,0.0010099934,0.0019936117,0.0026548216,0.001908591,0.0061850273],"category_scores_gemma":[0.017979784,0.001361162,0.0010775925,0.0030460723,0.0011386388,0.004266968,0.0020200277,0.0016517336,0.0005545132],"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.00023031002,0.00018824912,0.0025130818,0.00029498705,0.000110822366,0.00021652055,0.00028941312,0.38557428,0.0029565557,0.54243785,0.0050237984,0.06016422],"study_design_scores_gemma":[0.000018655535,0.000011517041,0.00022734799,0.000023325312,0.000024878611,0.000057405683,0.000029293378,0.59771836,0.00059068925,0.40047497,0.00081550656,0.000008093033],"about_ca_topic_score_codex":0.0016416695,"about_ca_topic_score_gemma":0.0033620177,"teacher_disagreement_score":0.0061850273,"about_ca_system_score_codex":0.00095871184,"about_ca_system_score_gemma":0.0008633573,"threshold_uncertainty_score":0.020690978},"labels":[],"label_agreement":null},{"id":"W2022616211","doi":"10.1016/j.jctb.2005.03.002","title":"Deeply asymmetric planar graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Planar graph; Outerplanar graph; Combinatorics; Mathematics; Graph; Book embedding; Planar; Planar straight-line graph; Automorphism; Simple (philosophy); Graph automorphism; Discrete mathematics; 1-planar graph; Line graph; Computer science; Pathwidth; Voltage graph; Computer graphics (images)","score_opus":0.011642004230155597,"score_gpt":0.26561462763841154,"score_spread":0.25397262340825594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022616211","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.55773324,0.0007164509,0.055581182,0.0037720914,0.00055868283,0.000100136465,0.0007643389,0.00043958542,0.3803343],"genre_scores_gemma":[0.94728625,0.0005319759,0.008119585,0.00068179134,0.00032388268,0.000050866867,0.00059779437,0.00018247265,0.0422254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995964,0.00007312616,0.000015439724,0.000079348785,0.00014146003,0.000094201074],"domain_scores_gemma":[0.99906844,0.00021041234,0.0001640236,0.00019712569,0.00015002224,0.00020996692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027405616,0.00060922746,0.0006316024,0.00136451,0.0014013702,0.002299292,0.0008106646,0.0012130557,0.015648643],"category_scores_gemma":[0.0020158035,0.00048827514,0.00038251316,0.0010849977,0.0013387314,0.0031317244,0.0023012212,0.0029592572,0.0020424256],"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.00003598139,0.000018665512,0.00023483139,0.000021581536,0.000005877824,0.00006297923,0.00008270193,0.0007291696,0.0013192045,0.98935217,0.0029155076,0.0052214153],"study_design_scores_gemma":[0.000011822987,0.00001086935,0.00030181484,0.000010962415,0.000010960691,0.00023800838,0.00009679766,0.0033752439,0.00064287457,0.9891907,0.0061021936,0.000007736907],"about_ca_topic_score_codex":0.00039020806,"about_ca_topic_score_gemma":0.00059815403,"teacher_disagreement_score":0.015648643,"about_ca_system_score_codex":0.00064455793,"about_ca_system_score_gemma":0.00034830646,"threshold_uncertainty_score":0.052349865},"labels":[],"label_agreement":null},{"id":"W2022783208","doi":"10.1016/j.jctb.2007.12.006","title":"Bisimplicial vertices in even-hole-free graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Induced subgraph; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics; Graph power; Line graph","score_opus":0.0179379954215226,"score_gpt":0.2737250461514349,"score_spread":0.2557870507299123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022783208","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.92065895,0.00031560226,0.037654694,0.0006074462,0.00014171106,0.00005493495,0.0003425309,0.00033323406,0.039890904],"genre_scores_gemma":[0.9829113,0.00022044936,0.008194036,0.00017118732,0.000049913746,0.0000416456,0.00029017095,0.00012055805,0.008000749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957114,0.00007300042,0.000024862977,0.00009560239,0.00009880575,0.00013661511],"domain_scores_gemma":[0.9983347,0.00071521406,0.00026289318,0.00022035626,0.00013172161,0.00033511897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005277731,0.00067942287,0.00078828464,0.0017335155,0.002741535,0.003583948,0.0013981162,0.001213596,0.005537273],"category_scores_gemma":[0.0022119978,0.0008044741,0.0005228898,0.0015086232,0.0024436645,0.0042614588,0.0018065425,0.0018588745,0.000766589],"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.00036442824,0.000105006795,0.0028260795,0.000110621,0.000017907394,0.00054923893,0.0012887369,0.0020251034,0.006342941,0.9725046,0.0017049187,0.012160387],"study_design_scores_gemma":[0.000041506515,0.000020860878,0.00075632037,0.000022511653,0.000029605972,0.00016056525,0.00044357489,0.003370616,0.0019632704,0.99112624,0.0020495227,0.000015298385],"about_ca_topic_score_codex":0.0010979563,"about_ca_topic_score_gemma":0.002226622,"teacher_disagreement_score":0.005537273,"about_ca_system_score_codex":0.0007624149,"about_ca_system_score_gemma":0.0005094592,"threshold_uncertainty_score":0.018523991},"labels":[],"label_agreement":null},{"id":"W2024021998","doi":"10.1016/j.jctb.2005.03.005","title":"Covering arrays on graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"University of Alberta","keywords":"Combinatorics; Clique number; Mathematics; Clique; Homomorphism; Graph; Discrete mathematics; Row; Extension (predicate logic); Computer science","score_opus":0.005227173648065162,"score_gpt":0.1918191603417305,"score_spread":0.18659198669366533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024021998","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.40259945,0.0036264972,0.19702329,0.00498356,0.0016247866,0.00011092403,0.00094649266,0.0011609229,0.3879241],"genre_scores_gemma":[0.898492,0.0023213394,0.027764143,0.00096622494,0.0011501584,0.00012458654,0.0008082579,0.00031421307,0.06805904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954224,0.00013058746,0.000020560843,0.00009095016,0.00013315468,0.00008250285],"domain_scores_gemma":[0.99853325,0.00069157063,0.00017682002,0.00022092472,0.00019345056,0.00018408232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022784292,0.00063240895,0.00073062937,0.0022896,0.0011825457,0.0027011055,0.0005554347,0.0009238163,0.011594422],"category_scores_gemma":[0.002267347,0.0005786424,0.0005494268,0.002340088,0.0010333089,0.0026684287,0.0016101956,0.0015780027,0.0017565825],"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.000027004173,0.000020728781,0.00024759764,0.000039058163,0.000009453735,0.000058290476,0.00017060929,0.0025247566,0.0013217675,0.9717106,0.0067431647,0.017126955],"study_design_scores_gemma":[0.000007372906,0.000015021777,0.00030303048,0.000017761968,0.000009952222,0.00016688983,0.0000966356,0.0105859,0.0006990997,0.974861,0.013227179,0.000010097077],"about_ca_topic_score_codex":0.00055515044,"about_ca_topic_score_gemma":0.0005387135,"teacher_disagreement_score":0.011594422,"about_ca_system_score_codex":0.00076922035,"about_ca_system_score_gemma":0.00026349092,"threshold_uncertainty_score":0.038787186},"labels":[],"label_agreement":null},{"id":"W2024330321","doi":"10.1016/j.jctb.2004.06.001","title":"A lower bound on the spectral radius of the universal cover of a graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Upper and lower bounds; Spectral radius; Graph; Degree (music); Discrete mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.01405184898505722,"score_gpt":0.24715537593247017,"score_spread":0.23310352694741296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024330321","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.39484793,0.024003495,0.41029993,0.010880277,0.0013475248,0.0001991203,0.0026206665,0.003449497,0.15235156],"genre_scores_gemma":[0.90876675,0.0074878465,0.06369838,0.0013749101,0.0023154195,0.0003213394,0.0016890672,0.0013233608,0.013022869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546635,0.0012002353,0.00019397991,0.0011291022,0.0011868762,0.0008233495],"domain_scores_gemma":[0.9558459,0.035033125,0.0013572609,0.0035519549,0.0015743158,0.002637475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030773953,0.002765128,0.004286811,0.00521004,0.0027767469,0.005682581,0.0049773925,0.004255264,0.012411956],"category_scores_gemma":[0.031054683,0.0018345253,0.0020330623,0.0032864737,0.004514335,0.010778232,0.0065502436,0.0059090466,0.0032241005],"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.0016781661,0.0003656805,0.0050440067,0.00158375,0.00046540677,0.0008650742,0.0013235452,0.09056888,0.03990334,0.74971086,0.02958752,0.07890372],"study_design_scores_gemma":[0.00008356717,0.00028809207,0.0038366239,0.00037019476,0.00035251104,0.0016036872,0.0004264969,0.3453203,0.013987606,0.61467624,0.018864756,0.00018982097],"about_ca_topic_score_codex":0.0012070748,"about_ca_topic_score_gemma":0.0011622322,"teacher_disagreement_score":0.012411956,"about_ca_system_score_codex":0.0024875742,"about_ca_system_score_gemma":0.00078053924,"threshold_uncertainty_score":0.041522145},"labels":[],"label_agreement":null},{"id":"W2024728183","doi":"10.1016/j.jctb.2006.07.001","title":"Homomorphisms and edge-colourings of planar graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Conjecture; Homomorphism; Mathematics; Planar graph; Graph; Discrete mathematics; Odd graph; 1-planar graph; Chordal graph","score_opus":0.007651886994791469,"score_gpt":0.23357519337335866,"score_spread":0.2259233063785672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024728183","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.8996384,0.00059054093,0.065586135,0.00081072253,0.00022177104,0.00008016167,0.00026526197,0.0003351908,0.032471843],"genre_scores_gemma":[0.96900743,0.00059766736,0.01784677,0.00021153218,0.00021903218,0.00006199718,0.00035790956,0.00010740303,0.011590278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991573,0.00019706709,0.000055604043,0.00025354038,0.00014605465,0.00019049262],"domain_scores_gemma":[0.99559695,0.002408807,0.00063184777,0.00041647148,0.00027774004,0.0006682349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086773257,0.0004960967,0.0005576066,0.0020359328,0.0017204195,0.0033457805,0.0014587583,0.0011555953,0.0056178835],"category_scores_gemma":[0.004658752,0.000905745,0.00082657696,0.0017851773,0.003046143,0.0049793534,0.0022257948,0.0024682893,0.00048694533],"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.00017501789,0.0001383517,0.0016417657,0.00008254245,0.000022785038,0.00027264413,0.0015207275,0.0018534153,0.004924404,0.9698186,0.0011664304,0.01838331],"study_design_scores_gemma":[0.000038651586,0.00004736929,0.0013174177,0.000014816687,0.000027887047,0.00026517423,0.00044279537,0.003477328,0.0016944121,0.98989886,0.0027515367,0.00002376278],"about_ca_topic_score_codex":0.0011501093,"about_ca_topic_score_gemma":0.0010561554,"teacher_disagreement_score":0.0056178835,"about_ca_system_score_codex":0.0010218751,"about_ca_system_score_gemma":0.00046649642,"threshold_uncertainty_score":0.018793702},"labels":[],"label_agreement":null},{"id":"W2029141310","doi":"10.1006/jctb.2001.2074","title":"Colouring Eulerian Triangulations","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Eulerian path; Triangulation; Representativeness heuristic; Mathematics; Combinatorics; Computer science; Geometry; Mathematical analysis; Lagrangian; Statistics","score_opus":0.015674503192297753,"score_gpt":0.22511098912072197,"score_spread":0.20943648592842423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029141310","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.32814556,0.0004950992,0.6126883,0.00062234997,0.00049382175,0.00014884667,0.0003509674,0.0011732153,0.055881824],"genre_scores_gemma":[0.66545236,0.0006593511,0.30431113,0.00019831772,0.000082683815,0.00007928212,0.00051469385,0.0010100318,0.02769214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994438,0.00012214508,0.000035845747,0.00011331079,0.00016677906,0.000118037475],"domain_scores_gemma":[0.997315,0.0012608166,0.00018100711,0.0007028207,0.00033596068,0.00020443987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006016989,0.00066534395,0.0007880211,0.001675286,0.0009772712,0.0017960148,0.0011417663,0.0010571021,0.011038118],"category_scores_gemma":[0.003880327,0.00083255686,0.0006850065,0.0013986636,0.0019979521,0.002562461,0.0034774374,0.0019568559,0.001389438],"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.00045118402,0.00011076592,0.0021098265,0.00030794553,0.00003900639,0.0004651992,0.0012528509,0.060067594,0.03956748,0.72049075,0.0073158895,0.16782153],"study_design_scores_gemma":[0.000069796195,0.00011673046,0.0011751015,0.00012696469,0.000048996324,0.00051001087,0.0006033245,0.14293508,0.023871437,0.8009795,0.02951036,0.0000526032],"about_ca_topic_score_codex":0.00161474,"about_ca_topic_score_gemma":0.002909622,"teacher_disagreement_score":0.011038118,"about_ca_system_score_codex":0.0008824866,"about_ca_system_score_gemma":0.0003746222,"threshold_uncertainty_score":0.03692621},"labels":[],"label_agreement":null},{"id":"W2029943728","doi":"10.1016/j.jctb.2012.07.004","title":"A generalization of Littleʼs Theorem on Pfaffian orientations","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"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":"Combinatorics; Mathematics; Bipartite graph; Pfaffian; Disjoint sets; Matching (statistics); Discrete mathematics; Cograph; Graph; Chordal graph; 1-planar graph","score_opus":0.01697318881866508,"score_gpt":0.2949306128611698,"score_spread":0.2779574240425047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029943728","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.10715693,0.0024911428,0.45829144,0.011455441,0.0034415494,0.00013320698,0.0009610148,0.00092354295,0.41514578],"genre_scores_gemma":[0.79446256,0.003507006,0.09558795,0.006053631,0.0052581523,0.00027876275,0.00081922,0.0007945219,0.09323823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905676,0.00015994153,0.000057612124,0.00034878348,0.0002277309,0.00014922413],"domain_scores_gemma":[0.9980116,0.0008454288,0.00013595508,0.000384448,0.00037348643,0.00024904442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017072302,0.00081676024,0.0013596474,0.003914052,0.003317855,0.0025992747,0.0018912859,0.0017321826,0.014880178],"category_scores_gemma":[0.005404147,0.00076414703,0.0019876864,0.0024818457,0.0055664186,0.012437681,0.004477508,0.0049449066,0.0020472421],"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.000011116467,0.000009841284,0.00014067248,0.000024032095,0.0000050793888,0.000043168056,0.00014829944,0.000216843,0.000274058,0.99046004,0.0022306035,0.0064362683],"study_design_scores_gemma":[0.0000042392485,0.000006003128,0.00012736427,0.0000072439316,0.0000049911127,0.000081112674,0.000032186606,0.00069309253,0.000121170866,0.99337476,0.0055396054,0.000008224247],"about_ca_topic_score_codex":0.0023338655,"about_ca_topic_score_gemma":0.0015972963,"teacher_disagreement_score":0.014880178,"about_ca_system_score_codex":0.0020400446,"about_ca_system_score_gemma":0.0007635262,"threshold_uncertainty_score":0.049779177},"labels":[],"label_agreement":null},{"id":"W2031490867","doi":"10.1006/jctb.2000.1967","title":"On the Excluded Minors for Quaternary Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"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":"Marsden Fund; National Security Agency","keywords":"Matroid; Disjoint sets; Combinatorics; Minor (academic); Rank (graph theory); Hyperplane; Mathematics; Characterization (materials science); Graphic matroid; Discrete mathematics; Physics; Law; Political science","score_opus":0.01675583223072613,"score_gpt":0.27798542796126846,"score_spread":0.26122959573054233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031490867","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.64188313,0.0019066735,0.16789569,0.004505302,0.0009256678,0.00016217702,0.0008575736,0.00036031604,0.1815035],"genre_scores_gemma":[0.93975097,0.0011900229,0.021904727,0.00072065595,0.0012404858,0.00011139858,0.00072109356,0.0002320267,0.034128703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912673,0.00027683013,0.000063425905,0.00013324691,0.00024082704,0.00015894166],"domain_scores_gemma":[0.9961915,0.002042453,0.0004594987,0.0002832118,0.00045865393,0.0005646893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012694116,0.001076514,0.0011587214,0.0023066348,0.0027572266,0.0042424775,0.0013640864,0.001473045,0.009572731],"category_scores_gemma":[0.0058680135,0.00077400275,0.0011417505,0.001738515,0.0034182,0.0049658013,0.0024738547,0.0030611372,0.0015032114],"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.000090806716,0.000045735444,0.00032985592,0.000047519436,0.000008658472,0.0001361349,0.00032088367,0.0011677991,0.0011429043,0.9889783,0.002855252,0.0048760893],"study_design_scores_gemma":[0.000016895296,0.000019827832,0.00016222817,0.000012958028,0.000005538283,0.0001256398,0.00007062463,0.0034249541,0.0002326275,0.9935726,0.0023468165,0.000009395777],"about_ca_topic_score_codex":0.0010530294,"about_ca_topic_score_gemma":0.0014802184,"teacher_disagreement_score":0.009572731,"about_ca_system_score_codex":0.0013904752,"about_ca_system_score_gemma":0.00067210104,"threshold_uncertainty_score":0.032024026},"labels":[],"label_agreement":null},{"id":"W2033177498","doi":"10.1016/j.jctb.2004.11.001","title":"Planar graphs without cycles of length from 4 to 7 are 3-colorable","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":144,"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 Alberta","funders":"","keywords":"Planar graph; Combinatorics; Mathematics; Conjecture; Graph coloring; Graph; Plane (geometry); Discrete mathematics; Geometry","score_opus":0.014152304707623579,"score_gpt":0.2708427278237021,"score_spread":0.25669042311607854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033177498","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.90921307,0.00064462674,0.02354571,0.0011561908,0.00018909511,0.00018709681,0.0020785402,0.0013752128,0.06161039],"genre_scores_gemma":[0.9531533,0.00068598887,0.020485075,0.0005459235,0.0000801855,0.00021893428,0.0026674452,0.000523128,0.021639962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905115,0.00011708762,0.000048499107,0.00025253498,0.00021397728,0.00031673803],"domain_scores_gemma":[0.9925841,0.0034182705,0.0016848175,0.00090642984,0.000614716,0.00079166907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009266,0.001487324,0.001335011,0.0015381471,0.0033037977,0.0055494197,0.002260242,0.002163276,0.016875938],"category_scores_gemma":[0.00336873,0.0020551505,0.0017502668,0.0026079526,0.00319445,0.0039068917,0.0017501245,0.0032817351,0.0024116498],"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.0055486825,0.0017529862,0.020986501,0.0016072742,0.00065726205,0.0026055914,0.003357837,0.034047388,0.12651476,0.62390196,0.03648137,0.14253843],"study_design_scores_gemma":[0.00071588863,0.0005079602,0.022946773,0.00020785572,0.000635317,0.002218532,0.0019261249,0.026530728,0.05720811,0.85906076,0.027735846,0.0003061438],"about_ca_topic_score_codex":0.0043875407,"about_ca_topic_score_gemma":0.008460042,"teacher_disagreement_score":0.016875938,"about_ca_system_score_codex":0.0024190764,"about_ca_system_score_gemma":0.0018790495,"threshold_uncertainty_score":0.05645567},"labels":[],"label_agreement":null},{"id":"W2034442645","doi":"10.1016/j.jctb.2007.02.009","title":"Triangular embeddings of complete graphs from graceful labellings of paths","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":32,"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; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Graph; Path (computing); Discrete mathematics; Order (exchange); Computer science","score_opus":0.010585111727271383,"score_gpt":0.23038380038414827,"score_spread":0.21979868865687688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034442645","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.5278034,0.00045686917,0.39589813,0.0010511393,0.00025373607,0.00017192171,0.0014954882,0.0012050911,0.0716642],"genre_scores_gemma":[0.88847107,0.00055361184,0.086766325,0.00047268035,0.0002099877,0.0002136125,0.0023967058,0.0008541437,0.020061776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921966,0.0001654111,0.00005503299,0.00022150668,0.00017719097,0.00016110744],"domain_scores_gemma":[0.996653,0.001493114,0.00048162797,0.00079129357,0.00022384734,0.00035714457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058769615,0.0008154421,0.0008143682,0.0013207751,0.0014053294,0.003925196,0.0015972476,0.0015715087,0.010946234],"category_scores_gemma":[0.004095304,0.0009383328,0.0012397328,0.0013763746,0.0024400172,0.0053102328,0.0031524953,0.003099548,0.0013575695],"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.00012403037,0.000052115378,0.00042993098,0.00008058512,0.000010465556,0.00013091289,0.00069508614,0.0053607672,0.0024247023,0.9747362,0.0025874875,0.013367709],"study_design_scores_gemma":[0.000017653949,0.000014510585,0.00020724341,0.000015991047,0.000010256235,0.0000680783,0.0001422084,0.010603185,0.00066714454,0.98553026,0.0027108528,0.000012586928],"about_ca_topic_score_codex":0.0013852728,"about_ca_topic_score_gemma":0.002199549,"teacher_disagreement_score":0.010946234,"about_ca_system_score_codex":0.0011597803,"about_ca_system_score_gemma":0.00048137686,"threshold_uncertainty_score":0.03661883},"labels":[],"label_agreement":null},{"id":"W2035278325","doi":"10.1016/j.jctb.2004.12.005","title":"A bound on the chromatic number of the square of a planar graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":195,"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 Toronto; University of Alberta; University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Bounded function; Square (algebra); Chromatic scale; Planar; Graph; Upper and lower bounds; Quadratic equation; Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.012947762145866733,"score_gpt":0.27311524414740057,"score_spread":0.26016748200153383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035278325","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.37349552,0.012027208,0.28129578,0.019762214,0.0024618995,0.00026657424,0.005239333,0.004382169,0.30106923],"genre_scores_gemma":[0.8824086,0.004376871,0.069725536,0.0023290084,0.0022568274,0.00035907948,0.0030125128,0.0014229866,0.034108542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976051,0.00038337556,0.0000757665,0.00074176147,0.00061844214,0.00057564164],"domain_scores_gemma":[0.9745525,0.019019544,0.00068264856,0.0023546503,0.0013632342,0.0020274334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020909728,0.0024213812,0.0018447004,0.004098985,0.0027021437,0.005390184,0.0044415933,0.0027589197,0.022834055],"category_scores_gemma":[0.017322743,0.0013720145,0.0014263625,0.0033100103,0.004141273,0.008908731,0.004757629,0.0058484906,0.0038141806],"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.0038360783,0.0004925319,0.010052989,0.0016193809,0.00041111963,0.00074546743,0.0011419223,0.11802254,0.06760109,0.5813319,0.09475394,0.11999105],"study_design_scores_gemma":[0.00029882748,0.00049923535,0.008850593,0.00033971595,0.0004664924,0.00092514977,0.0004895223,0.3293917,0.017570676,0.5976596,0.043221354,0.00028721624],"about_ca_topic_score_codex":0.0056608636,"about_ca_topic_score_gemma":0.010153476,"teacher_disagreement_score":0.022834055,"about_ca_system_score_codex":0.004412813,"about_ca_system_score_gemma":0.002094559,"threshold_uncertainty_score":0.076387525},"labels":[],"label_agreement":null},{"id":"W2035697452","doi":"10.1016/j.jctb.2015.03.005","title":"Matroids denser than a clique","year":2015,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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":"Office of Naval Research","keywords":"Matroid; Combinatorics; Mathematics; Function (biology); Clique; Rank (graph theory); Exponential function; Integer (computer science); Simple (philosophy); Quadratic equation; Discrete mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.023236955092811526,"score_gpt":0.3042449549892352,"score_spread":0.28100799989642367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035697452","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.6932576,0.0022877343,0.13207933,0.009994005,0.00072315795,0.00022048154,0.0028926926,0.001002055,0.15754297],"genre_scores_gemma":[0.900337,0.0010474407,0.06130747,0.0018436337,0.0010815624,0.00016567278,0.0022396808,0.00041940066,0.031558145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818414,0.0004319899,0.00009623805,0.00064386934,0.00037186695,0.0002718808],"domain_scores_gemma":[0.9886087,0.006344103,0.0011821808,0.0018974532,0.0008472181,0.0011203102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011425775,0.0009026105,0.0019985228,0.0019013119,0.002567637,0.0055470592,0.0018980579,0.002117485,0.018916626],"category_scores_gemma":[0.007441949,0.0014429443,0.0010605383,0.0020946148,0.0024673843,0.008393365,0.002586413,0.004504151,0.0016574551],"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.00037279073,0.00020433599,0.0015012855,0.00028951076,0.000076215605,0.00034873892,0.00056023314,0.0041304496,0.007204545,0.9590226,0.012105013,0.014184366],"study_design_scores_gemma":[0.00011319062,0.00006569915,0.0011863447,0.00005440608,0.00005612851,0.0009808044,0.0005118207,0.017767072,0.002036424,0.9655356,0.011668226,0.000024273268],"about_ca_topic_score_codex":0.0013977668,"about_ca_topic_score_gemma":0.0020606008,"teacher_disagreement_score":0.018916626,"about_ca_system_score_codex":0.0012574226,"about_ca_system_score_gemma":0.00054468785,"threshold_uncertainty_score":0.06328243},"labels":[],"label_agreement":null},{"id":"W2036312115","doi":"10.1016/j.jctb.2004.09.005","title":"Counting connected graphs inside-out","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":108,"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":"Combinatorics; Mathematics; Enumeration; Vertex (graph theory); Connected component; Partition (number theory); Path graph; Degree (music); Discrete mathematics; Graph; Graph power; Line graph; Physics","score_opus":0.011520357196130747,"score_gpt":0.24963690029188826,"score_spread":0.2381165430957575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036312115","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.07128292,0.00086607103,0.91299945,0.001339832,0.00021591132,0.00010339226,0.0007554308,0.00097396295,0.01146306],"genre_scores_gemma":[0.5256783,0.0017708078,0.43999317,0.0009841715,0.001237071,0.00052814174,0.0040819896,0.0025324486,0.023193976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99432087,0.0021091513,0.00025306546,0.0015654449,0.0013155969,0.00043592017],"domain_scores_gemma":[0.9438272,0.038731195,0.0038633777,0.007661772,0.0037494095,0.0021671224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00459702,0.0021735497,0.0038089587,0.0070099826,0.0027899994,0.005814433,0.007653204,0.00473498,0.011872847],"category_scores_gemma":[0.055454616,0.0027192754,0.0023756588,0.0049534827,0.0032989634,0.016225813,0.004540388,0.004964016,0.0018729024],"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.0003110057,0.00017386043,0.0046919994,0.000555419,0.0001745902,0.00025967264,0.00058918295,0.054604392,0.003279263,0.8573401,0.011173058,0.06684747],"study_design_scores_gemma":[0.000019605264,0.000023030958,0.000799963,0.00007935605,0.00007151304,0.00020051279,0.00007024122,0.20130152,0.0019706301,0.7920878,0.0033439745,0.000031805583],"about_ca_topic_score_codex":0.0022301737,"about_ca_topic_score_gemma":0.0027646534,"teacher_disagreement_score":0.011872847,"about_ca_system_score_codex":0.0019803434,"about_ca_system_score_gemma":0.0009788726,"threshold_uncertainty_score":0.039718688},"labels":[],"label_agreement":null},{"id":"W2036368491","doi":"10.1016/j.jctb.2004.10.001","title":"Average independence polynomials","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Independence (probability theory); Mathematics; Combinatorics; Polynomial; Discrete mathematics; Graph; Statistics; Mathematical analysis","score_opus":0.021014775629316314,"score_gpt":0.29464488348779133,"score_spread":0.273630107858475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036368491","genre_codex":"other","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.26642916,0.0018081631,0.25039813,0.006471654,0.0010739634,0.00010043358,0.0018460612,0.0011560027,0.4707165],"genre_scores_gemma":[0.91344,0.0010370741,0.014646398,0.000763966,0.0014633599,0.000095779906,0.001046577,0.0004454619,0.06706148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852777,0.00028376663,0.000041717616,0.00039770536,0.0004485156,0.00030057575],"domain_scores_gemma":[0.993763,0.0029369106,0.00061690813,0.001024903,0.0008447016,0.00081362785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013154454,0.0008483176,0.0013829187,0.0028280267,0.0023926299,0.003395447,0.0018874856,0.001136609,0.028131966],"category_scores_gemma":[0.011719357,0.0008138391,0.00095824344,0.002401251,0.002982422,0.007219566,0.0024684293,0.0052828426,0.0033371146],"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.000039710565,0.000026334234,0.00032704437,0.000025684,0.000009922937,0.00002782792,0.000056797115,0.0012207262,0.00042664897,0.98646146,0.005385963,0.0059918123],"study_design_scores_gemma":[0.000009860506,0.000009695882,0.0006881593,0.000010262186,0.000013907505,0.00014069786,0.00002503759,0.010977277,0.0005273848,0.9834011,0.004180414,0.000016176497],"about_ca_topic_score_codex":0.0012119752,"about_ca_topic_score_gemma":0.0015350605,"teacher_disagreement_score":0.028131966,"about_ca_system_score_codex":0.0018985586,"about_ca_system_score_gemma":0.0011149882,"threshold_uncertainty_score":0.09411079},"labels":[],"label_agreement":null},{"id":"W2037789845","doi":"10.1016/j.jctb.2003.09.001","title":"Excluding any graph as a minor allows a low tree-width 2-coloring","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Graph minor; Graph; Edge coloring; Graph coloring; Conjecture; Fractional coloring; Discrete mathematics; List coloring; Graph power; Graph factorization; Line graph","score_opus":0.015315810349520103,"score_gpt":0.2745306702123444,"score_spread":0.2592148598628243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037789845","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.4770519,0.00046353717,0.46683624,0.0020787267,0.00052498555,0.00026272907,0.0013447572,0.0069513246,0.044485763],"genre_scores_gemma":[0.7450749,0.00044329022,0.23209092,0.00088939664,0.0002654312,0.0003006557,0.0014753278,0.0030018282,0.016458234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901044,0.00020667052,0.000053432126,0.00028994345,0.0001417908,0.00029763192],"domain_scores_gemma":[0.99266654,0.003070028,0.0003890358,0.0027584129,0.00027823827,0.0008377832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010651316,0.00167732,0.0018441519,0.0006302581,0.002153913,0.0031918485,0.0021603454,0.0016264608,0.010172073],"category_scores_gemma":[0.0045805294,0.0012029938,0.0022003204,0.0011227453,0.0013018933,0.0038375806,0.0025004526,0.0031862962,0.002913677],"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.0046706055,0.0015653276,0.0062330593,0.0013638781,0.00029972658,0.0012567857,0.0012322317,0.06785268,0.24131697,0.50955397,0.03559519,0.12905961],"study_design_scores_gemma":[0.0005332749,0.00036513255,0.0017392543,0.00009852812,0.0003765367,0.0013018327,0.00033338377,0.13462035,0.045648977,0.79641217,0.01847865,0.00009196592],"about_ca_topic_score_codex":0.0007183956,"about_ca_topic_score_gemma":0.0023118078,"teacher_disagreement_score":0.010172073,"about_ca_system_score_codex":0.0006774247,"about_ca_system_score_gemma":0.0013229306,"threshold_uncertainty_score":0.034028947},"labels":[],"label_agreement":null},{"id":"W2038617524","doi":"10.1016/j.jctb.2014.12.001","title":"Median eigenvalues and the HOMO–LUMO index of graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Degree (music); Value (mathematics); Graph; Upper and lower bounds; Index (typography); HOMO/LUMO; Discrete mathematics; Statistics; Computer science; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.010615521027517765,"score_gpt":0.2549073723640302,"score_spread":0.24429185133651246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038617524","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.8691614,0.0009299239,0.08357291,0.0011217002,0.00015998233,0.00002160569,0.00046692978,0.0002998026,0.04426577],"genre_scores_gemma":[0.9903122,0.00025331782,0.005971865,0.00007897406,0.000182049,0.000024035544,0.00013782519,0.000051320785,0.002988422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996724,0.00007957261,0.00001392085,0.00006947937,0.000098040124,0.00006655671],"domain_scores_gemma":[0.9973138,0.0013071183,0.00051682844,0.00018832262,0.00022194398,0.0004519247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062649325,0.00038292055,0.00064134615,0.003539845,0.0010549749,0.003018865,0.00071126013,0.0008234505,0.006039645],"category_scores_gemma":[0.0042312094,0.00033055965,0.00025345004,0.0012955712,0.00206434,0.0027788496,0.0009701239,0.0009341114,0.00064009946],"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.00024542896,0.000098328106,0.00456482,0.00008814402,0.000031928306,0.00018667565,0.0004806432,0.0119825695,0.008483772,0.9437457,0.004014041,0.026078029],"study_design_scores_gemma":[0.000018222594,0.000023719693,0.0032491859,0.000022968788,0.000008497981,0.00016859488,0.00024803425,0.037463732,0.0012478563,0.9561755,0.0013482677,0.0000254219],"about_ca_topic_score_codex":0.0004129339,"about_ca_topic_score_gemma":0.0005336079,"teacher_disagreement_score":0.006039645,"about_ca_system_score_codex":0.0007874802,"about_ca_system_score_gemma":0.0003127136,"threshold_uncertainty_score":0.020204663},"labels":[],"label_agreement":null},{"id":"W2040255444","doi":"10.1016/j.jctb.2011.09.001","title":"Decomposing locally semicomplete digraphs into strong spanning subdigraphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"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 Victoria","funders":"","keywords":"Mathematics; Digraph; Combinatorics; Partition (number theory); Disjoint sets; Arc (geometry); Discrete mathematics","score_opus":0.02491616962830137,"score_gpt":0.27327887964117825,"score_spread":0.24836271001287688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040255444","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.5586319,0.00028275274,0.40228486,0.00035672277,0.00007938918,0.00017538603,0.0007258901,0.0005709347,0.03689217],"genre_scores_gemma":[0.866774,0.00035621977,0.11407646,0.0002496479,0.000079489284,0.00012858176,0.0013592518,0.00021285343,0.01676341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997296,0.00004451792,0.000021922302,0.000082870916,0.00006178922,0.00005931165],"domain_scores_gemma":[0.99853516,0.00061563496,0.0001594483,0.00026839998,0.00017829132,0.00024300512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032680167,0.0004223925,0.00057201914,0.0011061371,0.0008191433,0.0013663026,0.00065397605,0.0005616931,0.0068833176],"category_scores_gemma":[0.0016095549,0.00050308375,0.0005746857,0.0012590374,0.0008604853,0.0024518054,0.001543697,0.0015136112,0.0008355579],"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.00012465456,0.000117513926,0.0017989303,0.00021288847,0.000039333456,0.0005644419,0.0010219616,0.014610404,0.010708917,0.924351,0.0027210186,0.04372896],"study_design_scores_gemma":[0.00001994094,0.00004981858,0.0009509217,0.000032141925,0.00003508496,0.00028389684,0.0003651163,0.03892407,0.002031664,0.95253843,0.0047573075,0.000011594788],"about_ca_topic_score_codex":0.00064606906,"about_ca_topic_score_gemma":0.001775253,"teacher_disagreement_score":0.0068833176,"about_ca_system_score_codex":0.00039734907,"about_ca_system_score_gemma":0.0004307244,"threshold_uncertainty_score":0.023027003},"labels":[],"label_agreement":null},{"id":"W2040720394","doi":"10.1016/j.jctb.2012.05.002","title":"Spectrally degenerate graphs: Hereditary case","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Degenerate energy levels; Combinatorics; Upper and lower bounds; Converse; Mathematics; Spectral radius; Vertex (graph theory); Graph; Degree (music); Discrete mathematics; Physics; Quantum mechanics; Mathematical analysis; Geometry","score_opus":0.016353382331158694,"score_gpt":0.27266766040740703,"score_spread":0.25631427807624835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040720394","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.7804892,0.00051986624,0.06524559,0.002324192,0.0001842903,0.00005246676,0.00046270192,0.0003225367,0.15039915],"genre_scores_gemma":[0.98789513,0.00020211817,0.005032214,0.00021021154,0.00013757011,0.000020789044,0.00015115966,0.00003736087,0.0063134627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990085,0.00019912551,0.00006187516,0.00022126395,0.00027162905,0.00023753465],"domain_scores_gemma":[0.99682355,0.0012321229,0.0005316511,0.00052030873,0.00034261378,0.0005497571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010345028,0.00042062855,0.0007142139,0.0018742123,0.00257083,0.0025811004,0.0014709983,0.0015659506,0.00929267],"category_scores_gemma":[0.0059917583,0.00062544504,0.00051120186,0.0016418737,0.0036350128,0.0037612075,0.0018620349,0.0011703076,0.0006418157],"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.000041283918,0.00005414825,0.0011748704,0.00005300601,0.000011686896,0.0006126039,0.00025550334,0.0010325768,0.000578268,0.99127215,0.0016116254,0.0033022128],"study_design_scores_gemma":[0.000028528397,0.000014299033,0.0006004991,0.0000155891,0.000017249768,0.0012793824,0.0003023702,0.009201671,0.0004674868,0.9866137,0.0014482212,0.00001093491],"about_ca_topic_score_codex":0.0010152821,"about_ca_topic_score_gemma":0.0013005349,"teacher_disagreement_score":0.00929267,"about_ca_system_score_codex":0.00068902224,"about_ca_system_score_gemma":0.00062206003,"threshold_uncertainty_score":0.03108704},"labels":[],"label_agreement":null},{"id":"W2043779144","doi":"10.1006/jctb.2001.2077","title":"The Numbers of Dependent k-Sets in a Graph Are Log Concave","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Graph; Mathematics; Complement graph; Discrete mathematics; Graph power; Line graph","score_opus":0.01685087307057495,"score_gpt":0.2667885007855626,"score_spread":0.24993762771498765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043779144","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.68407005,0.00076670485,0.24828741,0.006290983,0.00024886776,0.00020254738,0.0022731104,0.0007945524,0.057065826],"genre_scores_gemma":[0.9234638,0.0009208487,0.04739185,0.0006158799,0.00038733456,0.00058176694,0.0012620019,0.00051305426,0.024863513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976502,0.0007234448,0.00016872933,0.0004986626,0.00060680637,0.0003521407],"domain_scores_gemma":[0.9442139,0.043478787,0.0033086594,0.0036825463,0.0024904434,0.0028255712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024483837,0.0011621973,0.0018341264,0.0023809548,0.002914216,0.0069128806,0.0049047424,0.0023981268,0.0110607315],"category_scores_gemma":[0.035435494,0.002169702,0.0013686202,0.0022347355,0.005684131,0.012867151,0.0024674595,0.004247252,0.0019117576],"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.0006198315,0.00014819982,0.0062371283,0.00033382155,0.000063072315,0.0003078856,0.0005296022,0.025475284,0.005886496,0.9323593,0.0075963265,0.020443097],"study_design_scores_gemma":[0.00008724918,0.00006855186,0.0044189175,0.00007323598,0.00006025935,0.00095515593,0.00024166505,0.12937523,0.0032846704,0.8571576,0.004200444,0.00007692762],"about_ca_topic_score_codex":0.0009710889,"about_ca_topic_score_gemma":0.0015320961,"teacher_disagreement_score":0.0110607315,"about_ca_system_score_codex":0.0032587969,"about_ca_system_score_gemma":0.0012967483,"threshold_uncertainty_score":0.03700185},"labels":[],"label_agreement":null},{"id":"W2045237424","doi":"10.1016/j.jctb.2008.01.003","title":"Locally planar graphs are 5-choosable","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Graph; Computer science; Mathematics; Combinatorics; Telecommunications; Computer graphics (images)","score_opus":0.01650812458121698,"score_gpt":0.25320838278942615,"score_spread":0.23670025820820917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045237424","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.80297726,0.0007390592,0.036213152,0.0013374685,0.00014477813,0.00017768012,0.0027107056,0.0016058775,0.15409401],"genre_scores_gemma":[0.9431272,0.0005377575,0.012562148,0.0003489329,0.00008899524,0.00016281032,0.0030450337,0.00037889532,0.039748173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942446,0.000056117016,0.000043356387,0.00017664059,0.00015479917,0.00014468249],"domain_scores_gemma":[0.9979759,0.0010280615,0.00037804377,0.00020932227,0.00012998986,0.0002786117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031946847,0.0008646873,0.0014552445,0.0011051617,0.0016218207,0.0041682073,0.0019086257,0.0014071522,0.033528943],"category_scores_gemma":[0.0016375374,0.0015226962,0.0010499432,0.0020011885,0.0014909372,0.003365664,0.0017511626,0.00282109,0.0040096403],"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.0017473778,0.00050165626,0.008823639,0.0012298453,0.00023435529,0.0028361036,0.002101134,0.012210384,0.04289496,0.8450538,0.016442878,0.06592384],"study_design_scores_gemma":[0.0006595769,0.00030266048,0.016588803,0.0001668246,0.000530776,0.0035443245,0.0019157247,0.023926051,0.026603382,0.8965342,0.029032156,0.00019549673],"about_ca_topic_score_codex":0.0014842128,"about_ca_topic_score_gemma":0.003258473,"teacher_disagreement_score":0.033528943,"about_ca_system_score_codex":0.0014377136,"about_ca_system_score_gemma":0.00070696283,"threshold_uncertainty_score":0.11216551},"labels":[],"label_agreement":null},{"id":"W2047779705","doi":"10.1016/j.jctb.2003.11.001","title":"A short proof of non-GF(5)-representability of matroids","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; National Security Agency","keywords":"Matroid; Proof of concept; GF(2); Mathematics; Combinatorics; Computer science; Finite field","score_opus":0.012493688221346536,"score_gpt":0.29328536457964816,"score_spread":0.2807916763583016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047779705","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.09869986,0.011382138,0.42205632,0.042958282,0.01379336,0.00059459725,0.004243717,0.0037459764,0.4025258],"genre_scores_gemma":[0.75383437,0.009319998,0.14661881,0.012701528,0.010524234,0.00086667296,0.0041060294,0.0013360291,0.060692325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978131,0.0003698715,0.0001496003,0.00044789616,0.0008677408,0.00035173245],"domain_scores_gemma":[0.9921171,0.005245686,0.00036234764,0.000896901,0.0009673575,0.00041060697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016257826,0.002543637,0.0013248577,0.0018916604,0.0025787852,0.0035139269,0.0022568088,0.0027058034,0.028619349],"category_scores_gemma":[0.008285633,0.0013924051,0.0036344463,0.0023806624,0.003891511,0.008420579,0.0051307464,0.009461322,0.004111062],"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.00043049167,0.00034029013,0.00084781565,0.0013963735,0.00018177283,0.001734147,0.0005920881,0.004764761,0.015774012,0.85354626,0.05176997,0.06862211],"study_design_scores_gemma":[0.00006447582,0.00009948113,0.00089050864,0.00013308263,0.000083674575,0.00068394124,0.00009556328,0.0042761457,0.005369184,0.9510916,0.037152294,0.0000601155],"about_ca_topic_score_codex":0.0010755039,"about_ca_topic_score_gemma":0.0012064914,"teacher_disagreement_score":0.028619349,"about_ca_system_score_codex":0.0020541188,"about_ca_system_score_gemma":0.0009609551,"threshold_uncertainty_score":0.09574127},"labels":[],"label_agreement":null},{"id":"W2052233329","doi":"10.1006/jctb.2002.2076","title":"Sewing Ribbons on Graphs in Space","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"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":"Univerzita Komenského v Bratislave","keywords":"Ribbon; Graph; Combinatorics; Mathematics; Euclidean geometry; Discrete mathematics; Geometry","score_opus":0.015435517117606481,"score_gpt":0.22451968122943006,"score_spread":0.20908416411182357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052233329","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.74966675,0.0007559972,0.17126034,0.00073759834,0.00032565245,0.000093622744,0.0003692569,0.001433293,0.07535752],"genre_scores_gemma":[0.92283297,0.0005491016,0.047422726,0.00021479168,0.00010283404,0.000050501905,0.0003665404,0.00078669237,0.027673906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995028,0.00014043238,0.000027922282,0.00011580078,0.000100602556,0.00011258724],"domain_scores_gemma":[0.9975829,0.0007780063,0.00043791952,0.00054374646,0.0002658511,0.00039151032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043950742,0.00083504815,0.0011648823,0.0025850171,0.0022502225,0.0030293798,0.0010186271,0.0023649728,0.0109842485],"category_scores_gemma":[0.0038135264,0.00088794075,0.00084595976,0.0019098723,0.0021939394,0.0033872616,0.0025495868,0.0018559421,0.0026318005],"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.00020548303,0.00006483829,0.0011350211,0.00007602125,0.000020488884,0.00067835307,0.0008515305,0.008668534,0.005888833,0.95853496,0.0028786885,0.020997291],"study_design_scores_gemma":[0.000023447015,0.00006490731,0.0007252126,0.000052690524,0.000018160088,0.00041643868,0.00049321866,0.030416401,0.0018904479,0.9604343,0.0054463777,0.000018362365],"about_ca_topic_score_codex":0.001114278,"about_ca_topic_score_gemma":0.0015996294,"teacher_disagreement_score":0.0109842485,"about_ca_system_score_codex":0.0006048659,"about_ca_system_score_gemma":0.0002555677,"threshold_uncertainty_score":0.036745965},"labels":[],"label_agreement":null},{"id":"W2052262845","doi":"10.1016/j.jctb.2008.03.007","title":"Removable cycles in non-bipartite graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Combinatorics; Connected component; Mathematics; Disjoint sets; Connectivity; Graph; Complete bipartite graph; Path (computing); Discrete mathematics; Computer science","score_opus":0.006866264398241998,"score_gpt":0.19441159737768268,"score_spread":0.18754533297944068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052262845","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.76804584,0.0017590207,0.16719604,0.0015345832,0.00029407558,0.00022469905,0.00067809864,0.00054217735,0.0597254],"genre_scores_gemma":[0.9469958,0.001052649,0.02677357,0.0003995199,0.00020580883,0.00020886712,0.00078794477,0.00021465264,0.023361294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899787,0.00027682193,0.000063228224,0.00020234652,0.00027106152,0.00018873365],"domain_scores_gemma":[0.99252594,0.0044014887,0.00095494563,0.0007442144,0.00053866097,0.0008346462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058879,0.0008697937,0.0010980233,0.0030533646,0.002870786,0.0036202043,0.0023175792,0.0020409322,0.007644583],"category_scores_gemma":[0.008244799,0.001393489,0.00095541915,0.002738236,0.002379168,0.0040001413,0.0019558484,0.0024812734,0.00081007427],"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.00028918774,0.00018035278,0.0022790304,0.00027744606,0.000057496847,0.00083064404,0.001035093,0.015061653,0.0044866996,0.9476674,0.0048214695,0.023013579],"study_design_scores_gemma":[0.00005884654,0.00003919554,0.0007286221,0.00007181105,0.00004793415,0.00037748754,0.0003126063,0.040320616,0.0015985887,0.9526885,0.0037282116,0.000027552087],"about_ca_topic_score_codex":0.0020702493,"about_ca_topic_score_gemma":0.0038691175,"teacher_disagreement_score":0.007644583,"about_ca_system_score_codex":0.0011836844,"about_ca_system_score_gemma":0.0009449566,"threshold_uncertainty_score":0.02557373},"labels":[],"label_agreement":null},{"id":"W2053364672","doi":"10.1016/s0095-8956(02)00041-2","title":"Inertia and biclique decompositions of joins of graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; Queen's University","funders":"","keywords":"Joins; Bipartite graph; Combinatorics; Inertia; Mathematics; Eigenvalues and eigenvectors; Partition (number theory); Hermitian matrix; Join (topology); Complete bipartite graph; Discrete mathematics; Graph; Computer science; Pure mathematics; Physics","score_opus":0.01612957538382822,"score_gpt":0.279951896022733,"score_spread":0.2638223206389048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053364672","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.86209387,0.000490212,0.080740824,0.00053547835,0.00018533261,0.00008061878,0.00039215086,0.00022330874,0.05525821],"genre_scores_gemma":[0.96172494,0.0003316288,0.019752543,0.0001591479,0.00031556873,0.00006542694,0.0006072135,0.000150667,0.016892878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993044,0.00009106451,0.00004699331,0.00016522,0.0001885679,0.00020375114],"domain_scores_gemma":[0.9976271,0.0006982022,0.00047482905,0.00018743683,0.00027162518,0.0007408316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086019427,0.00055068533,0.00088981877,0.004551354,0.0020396642,0.004808055,0.0010458904,0.00080788694,0.007422328],"category_scores_gemma":[0.0022136318,0.0007742654,0.00077135314,0.0017223998,0.0028974793,0.0036472634,0.0020786824,0.0018109486,0.0008124893],"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.000118897085,0.000040428553,0.0008591067,0.000034629018,0.000008167209,0.00011216443,0.0011668897,0.00056656613,0.0026234593,0.98676014,0.0010695821,0.00663985],"study_design_scores_gemma":[0.000038012666,0.000050770224,0.0018343602,0.00002951893,0.000024431012,0.00022821198,0.0008962964,0.0065932474,0.0013427904,0.98326194,0.0056728963,0.00002750774],"about_ca_topic_score_codex":0.0015629587,"about_ca_topic_score_gemma":0.0025971762,"teacher_disagreement_score":0.007422328,"about_ca_system_score_codex":0.0009873097,"about_ca_system_score_gemma":0.00043844245,"threshold_uncertainty_score":0.024830163},"labels":[],"label_agreement":null},{"id":"W2053790252","doi":"10.1016/j.jctb.2007.06.003","title":"Fourier analysis and large independent sets in powers of complete graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"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 Toronto; University of Waterloo","funders":"","keywords":"Statement (logic); Mathematics; Graph; Combinatorics; Independent set; Fourier transform; Set (abstract data type); Constant (computer programming); Fourier analysis; Maximal independent set; Discrete mathematics; Computer science; 1-planar graph; Mathematical analysis; Chordal graph","score_opus":0.014069872128002835,"score_gpt":0.28627842000547965,"score_spread":0.27220854787747684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053790252","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.7351159,0.0018529693,0.19056414,0.0025870437,0.0002936688,0.00004938422,0.00022625155,0.00019154185,0.069119215],"genre_scores_gemma":[0.97775877,0.0006263685,0.011930791,0.00016329043,0.0004968167,0.0000553813,0.000117384974,0.00007383199,0.008777512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915695,0.00026287523,0.00003485124,0.00013493832,0.00028621254,0.00012415783],"domain_scores_gemma":[0.9923786,0.0051715667,0.0007199437,0.00060898415,0.00050648936,0.0006143827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020006723,0.00076223357,0.0014633191,0.0035882213,0.0017783104,0.0031632907,0.0018547535,0.0012328727,0.0050926907],"category_scores_gemma":[0.011075962,0.00080605946,0.0010425071,0.0016031463,0.005533716,0.00600462,0.0019887423,0.0030492956,0.000380954],"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.000020031917,0.00001825359,0.00021984492,0.000018049637,0.000007812069,0.000059098104,0.00014454886,0.0015342989,0.00035971054,0.995417,0.00044580543,0.0017555412],"study_design_scores_gemma":[0.0000070190154,0.0000041561825,0.00018355898,0.000008101529,0.0000046503555,0.00006534364,0.000049511204,0.0074497107,0.00013045012,0.99172556,0.00036527668,0.0000066801067],"about_ca_topic_score_codex":0.0007051448,"about_ca_topic_score_gemma":0.000859814,"teacher_disagreement_score":0.0050926907,"about_ca_system_score_codex":0.0011180403,"about_ca_system_score_gemma":0.00050142035,"threshold_uncertainty_score":0.017036736},"labels":[],"label_agreement":null},{"id":"W2055120783","doi":"10.1016/j.jctb.2005.04.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">Δ</mml:mi><mml:mo>+</mml:mo><mml:mn>300</mml:mn></mml:math> is a bound on the adjacent vertex distinguishing edge chromatic number","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":126,"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 Toronto","funders":"","keywords":"Vertex (graph theory); Graph; Edge coloring; Mathematics; Scroll; Combinatorics; Algorithm; Line graph","score_opus":0.013034258144863281,"score_gpt":0.22761261120423784,"score_spread":0.21457835305937456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055120783","genre_codex":"other","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.0047509926,0.00046316106,0.10668458,0.008437116,0.0012520313,0.00016874316,0.043989036,0.029806815,0.8044475],"genre_scores_gemma":[0.085355304,0.0023075566,0.1088164,0.0024470636,0.0011684807,0.00045369525,0.0771561,0.035756484,0.68653893],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996927,0.000045691497,0.000019498942,0.0000683833,0.00013288294,0.00004085511],"domain_scores_gemma":[0.9984078,0.00060722535,0.00010096477,0.00040143784,0.00033056017,0.00015211504],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052082544,0.0008955137,0.0008133352,0.0015711227,0.0008678226,0.004126047,0.0020389927,0.0010857577,0.51149],"category_scores_gemma":[0.0032790583,0.0006711957,0.00053924,0.0028748289,0.00066586287,0.00501944,0.0014898401,0.0023704523,0.3049635],"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.0000790296,0.000047603917,0.0002523014,0.00015644162,0.0000071290174,0.000045557725,0.000084942265,0.00057806453,0.0017107611,0.070621684,0.8688717,0.05754473],"study_design_scores_gemma":[0.00006834718,0.000031915362,0.0016372908,0.00008575591,0.000011474518,0.00025256223,0.00014482999,0.0075181182,0.0073378566,0.14871448,0.83414257,0.000054855893],"about_ca_topic_score_codex":0.004846771,"about_ca_topic_score_gemma":0.006669705,"teacher_disagreement_score":0.51149,"about_ca_system_score_codex":0.0016512194,"about_ca_system_score_gemma":0.00071231293,"threshold_uncertainty_score":0.69680023},"labels":[],"label_agreement":null},{"id":"W2055499237","doi":"10.1006/jctb.2001.2091","title":"On a Conjecture of Lovász Concerning Bricks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"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":"Conjecture; Combinatorics; Mathematics; Brick; Petersen graph; Cubic graph; Matching (statistics); Graph; Discrete mathematics; Line graph; Voltage graph; Engineering","score_opus":0.01866125685222832,"score_gpt":0.2619885753374605,"score_spread":0.24332731848523217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055499237","genre_codex":"other","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.36709207,0.0042937747,0.09565188,0.150806,0.0063265595,0.00016432202,0.0015669717,0.0009442243,0.37315428],"genre_scores_gemma":[0.9215782,0.0019291644,0.016742155,0.009422974,0.0037517261,0.00018191194,0.0012209055,0.00039871616,0.0447742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796045,0.00052510406,0.00010150292,0.00059787516,0.0003637359,0.00045136956],"domain_scores_gemma":[0.98907274,0.007614699,0.00071720884,0.0012482657,0.00075787725,0.00058918144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029137114,0.0008601029,0.00270635,0.002315503,0.0067956904,0.0055340677,0.0028709783,0.0068612043,0.023505408],"category_scores_gemma":[0.021109756,0.0011505098,0.0019318388,0.003336328,0.010911149,0.021840248,0.0061253207,0.00903349,0.003226762],"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.00009374405,0.000027140579,0.00021147197,0.000058470832,0.00000796017,0.00005714338,0.0003363036,0.00037043833,0.00017568664,0.98663956,0.009376123,0.002645903],"study_design_scores_gemma":[0.000037374357,0.000009329156,0.00010971533,0.000019879679,0.000009603014,0.00004078952,0.00012079763,0.0006754474,0.00008927307,0.99422693,0.0046481965,0.000012639512],"about_ca_topic_score_codex":0.0026324815,"about_ca_topic_score_gemma":0.0017491867,"teacher_disagreement_score":0.023505408,"about_ca_system_score_codex":0.0027178817,"about_ca_system_score_gemma":0.0012328447,"threshold_uncertainty_score":0.07863349},"labels":[],"label_agreement":null},{"id":"W2056219688","doi":"10.1016/j.jctb.2008.07.001","title":"On the sum of k largest eigenvalues of graphs and symmetric matrices","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Eigenvalues and eigenvectors; Generalization; Integer (computer science); Order (exchange); Graph; Discrete mathematics; Physics; Computer science; Mathematical analysis; Quantum mechanics","score_opus":0.025861457558032416,"score_gpt":0.26741940264988384,"score_spread":0.2415579450918514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056219688","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.6581503,0.0029903925,0.26495227,0.0030832866,0.0010774286,0.000055204997,0.00040755354,0.0004085363,0.06887509],"genre_scores_gemma":[0.9650743,0.0012521049,0.018643988,0.00027089982,0.0007898241,0.000066023684,0.0002583793,0.0002947831,0.013349858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988423,0.00039831788,0.00005360794,0.00022591771,0.00034247834,0.00013748954],"domain_scores_gemma":[0.99055415,0.0070624,0.00068432034,0.00036958125,0.000703809,0.00062577776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013686162,0.0011842872,0.001052171,0.0027857106,0.0012718993,0.0027785683,0.0016885607,0.0014862069,0.008269029],"category_scores_gemma":[0.012047909,0.0006557673,0.0006145601,0.0014942032,0.0033749714,0.005286374,0.0021088629,0.0017491925,0.0010921854],"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.0003827999,0.00009944174,0.0019883532,0.0002929883,0.00007203869,0.00059901684,0.00074493804,0.026341252,0.008070953,0.9253447,0.007781285,0.02828234],"study_design_scores_gemma":[0.000015201269,0.000022685666,0.0011228886,0.000049007864,0.000018949613,0.00026941014,0.00022101535,0.064852685,0.0010224904,0.9310718,0.0012917938,0.000042128366],"about_ca_topic_score_codex":0.00061603385,"about_ca_topic_score_gemma":0.0008606977,"teacher_disagreement_score":0.008269029,"about_ca_system_score_codex":0.00069048157,"about_ca_system_score_gemma":0.00043669622,"threshold_uncertainty_score":0.027662694},"labels":[],"label_agreement":null},{"id":"W2056775628","doi":"10.1016/j.jctb.2012.11.001","title":"Zarankiewiczʼs Conjecture is finite for each fixed m","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":19,"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":"Conjecture; Counterexample; Combinatorics; Bipartite graph; Mathematics; Integer (computer science); Graph; Discrete mathematics","score_opus":0.014450968568792546,"score_gpt":0.2576611888266693,"score_spread":0.24321022025787672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056775628","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.5894124,0.0023136826,0.08643328,0.02317078,0.0011941724,0.00009501031,0.002184512,0.0013122963,0.2938838],"genre_scores_gemma":[0.9669594,0.0006756553,0.013419222,0.0011481134,0.0005916721,0.000115338604,0.0012267848,0.00016582644,0.015697844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985239,0.00021699285,0.00009252165,0.0004352478,0.0002650144,0.00046640154],"domain_scores_gemma":[0.9913316,0.005505396,0.00065962103,0.0014146607,0.00051158614,0.00057708984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018999152,0.0010554136,0.0020924688,0.002181402,0.003985246,0.0059138574,0.0029183354,0.0035293633,0.020628577],"category_scores_gemma":[0.010155805,0.0009497455,0.0017264155,0.0015351423,0.0075386385,0.012009816,0.004547037,0.0044942307,0.0020535863],"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.00019594155,0.000041456722,0.0012715226,0.0001609237,0.000023731674,0.00011907236,0.0003298113,0.0023036005,0.001004608,0.9834257,0.0054744985,0.0056491205],"study_design_scores_gemma":[0.000040239283,0.000020686382,0.0006137388,0.00003420112,0.000019766965,0.00012262583,0.0001983923,0.0053626318,0.00087909197,0.9881109,0.00457712,0.000020561076],"about_ca_topic_score_codex":0.0011356799,"about_ca_topic_score_gemma":0.0013409083,"teacher_disagreement_score":0.020628577,"about_ca_system_score_codex":0.0018906515,"about_ca_system_score_gemma":0.0011278222,"threshold_uncertainty_score":0.06900942},"labels":[],"label_agreement":null},{"id":"W2057654888","doi":"10.1016/j.jctb.2008.08.006","title":"Growth rates of minor-closed classes of matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"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":"Matroid; Mathematics; Combinatorics; Rank (graph theory); Minor (academic); Graphic matroid; Simple (philosophy); Class (philosophy); Matroid partitioning; Discrete mathematics","score_opus":0.020051602701198497,"score_gpt":0.281127115789744,"score_spread":0.2610755130885455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057654888","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.9290145,0.00090855843,0.04208681,0.002536584,0.00013487719,0.000083448576,0.0012671899,0.0004983387,0.023469716],"genre_scores_gemma":[0.978434,0.00081246515,0.009661959,0.00016213483,0.00029977356,0.00012726217,0.0011591824,0.0002710668,0.0090721045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985668,0.00034817687,0.00006477299,0.00024670252,0.00038168408,0.0003919529],"domain_scores_gemma":[0.9686177,0.019456772,0.0027078397,0.0017743786,0.0027387426,0.0047045015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026119608,0.0008773232,0.001385573,0.004297727,0.00281726,0.006644527,0.0026912354,0.0018060156,0.010303373],"category_scores_gemma":[0.032166865,0.0010094311,0.0010656193,0.0019698096,0.0027205583,0.005954421,0.0025458762,0.0028361792,0.0008537682],"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.0004917885,0.00014666391,0.010666577,0.00019130915,0.00004914884,0.00024069754,0.0013004842,0.017725965,0.008106807,0.9306289,0.010752738,0.019698925],"study_design_scores_gemma":[0.00007978146,0.00007576918,0.005766363,0.00006703949,0.00004626331,0.00088129856,0.00050145894,0.16726358,0.0036533026,0.816331,0.0052788607,0.000055220327],"about_ca_topic_score_codex":0.0019414048,"about_ca_topic_score_gemma":0.0018693,"teacher_disagreement_score":0.010303373,"about_ca_system_score_codex":0.0029729202,"about_ca_system_score_gemma":0.00085600954,"threshold_uncertainty_score":0.034468234},"labels":[],"label_agreement":null},{"id":"W2058418398","doi":"10.1016/j.jctb.2008.06.002","title":"Brick assignments and homogeneously almost self-complementary graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":4,"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":"Combinatorics; Mathematics; Cograph; Vertex (graph theory); Transitive relation; Graph; Discrete mathematics; Indifference graph; Chordal graph; 1-planar graph","score_opus":0.04029675948081831,"score_gpt":0.29593739312915834,"score_spread":0.25564063364834005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058418398","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.79246986,0.00041525866,0.082078196,0.0013133057,0.00036455638,0.0000716587,0.00021278475,0.00030497625,0.12276944],"genre_scores_gemma":[0.96351373,0.0002897345,0.01121682,0.00037989533,0.00029318422,0.00007232326,0.00023974614,0.00009813353,0.02389633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994435,0.0001600341,0.000023170001,0.00012948047,0.00011508404,0.00012874795],"domain_scores_gemma":[0.9980046,0.0010007326,0.00025469167,0.00019428656,0.00019652463,0.00034916124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065625214,0.0005272032,0.00066621735,0.0023339242,0.002840363,0.002638598,0.0012311976,0.001157273,0.01042851],"category_scores_gemma":[0.0030601476,0.00071010203,0.0005186435,0.0014678381,0.0028888131,0.0036542069,0.0020341973,0.0021519759,0.000925403],"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.000036322857,0.000029999257,0.00019321276,0.000017049673,0.0000048236234,0.00006595806,0.0002948504,0.00037415573,0.00084567704,0.99464923,0.0008651123,0.0026236384],"study_design_scores_gemma":[0.000022373779,0.000009712412,0.00027689562,0.0000070922056,0.000010558662,0.00008124778,0.00016930955,0.001726158,0.00052984344,0.9955058,0.0016509321,0.0000098861565],"about_ca_topic_score_codex":0.0006466022,"about_ca_topic_score_gemma":0.00096889585,"teacher_disagreement_score":0.01042851,"about_ca_system_score_codex":0.0007130114,"about_ca_system_score_gemma":0.00040079118,"threshold_uncertainty_score":0.034886897},"labels":[],"label_agreement":null},{"id":"W2060031821","doi":"10.1016/j.jctb.2014.01.005","title":"Removable paths and cycles with parity constraints","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","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":"McGill University","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Parity (physics); Bipartite graph; Vertex (graph theory); Graph; Integer (computer science); Connectivity; Discrete mathematics; Physics; Computer science","score_opus":0.011393454643920681,"score_gpt":0.24868694295070454,"score_spread":0.23729348830678385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060031821","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.593955,0.0019377462,0.18887003,0.0041884826,0.0006811664,0.00011717776,0.00055003085,0.00047644327,0.20922394],"genre_scores_gemma":[0.9289153,0.0010307664,0.030609826,0.00060437154,0.00048827557,0.00017356074,0.00042220976,0.00024886263,0.037506822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990115,0.00027515905,0.000059655853,0.00020125348,0.00027952818,0.00017287677],"domain_scores_gemma":[0.9956181,0.002677124,0.00050573173,0.0004613857,0.00031168672,0.0004259724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010632621,0.00089051394,0.0011408547,0.0028659047,0.0031866627,0.0040349164,0.0025458666,0.002593101,0.011577308],"category_scores_gemma":[0.0097139105,0.0011719653,0.0011664813,0.0027573183,0.004693331,0.008806084,0.0037209361,0.004310261,0.0009157852],"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.00001676259,0.000016991688,0.00013077454,0.000020174184,0.0000038804124,0.00010450067,0.000154036,0.0005916869,0.00019204398,0.9955942,0.0006976728,0.002477378],"study_design_scores_gemma":[0.0000055114933,0.0000025931297,0.000029782577,0.0000069175976,0.0000037400796,0.00006516562,0.000038017733,0.0012094611,0.00007866962,0.9978319,0.0007245703,0.0000036776416],"about_ca_topic_score_codex":0.0011753131,"about_ca_topic_score_gemma":0.001358702,"teacher_disagreement_score":0.011577308,"about_ca_system_score_codex":0.0012201116,"about_ca_system_score_gemma":0.0009192549,"threshold_uncertainty_score":0.038729966},"labels":[],"label_agreement":null},{"id":"W2060877605","doi":"10.1006/jctb.2001.2032","title":"Matroid 4-Connectivity: A Deletion–Contraction Theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Mathematics; Element (criminal law); Contraction (grammar); Discrete mathematics","score_opus":0.01198728508842466,"score_gpt":0.269787487247202,"score_spread":0.2578002021587773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060877605","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5363524,0.0015055469,0.30255064,0.007656615,0.00039454692,0.00017189876,0.0008689516,0.0005639771,0.14993545],"genre_scores_gemma":[0.8899928,0.0016301592,0.07468415,0.0018668589,0.0006960605,0.00035702824,0.0015868141,0.00040046324,0.028785748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936014,0.00012603142,0.000034479068,0.00019931133,0.00017843777,0.00010161233],"domain_scores_gemma":[0.99596196,0.002530174,0.00037102777,0.00040761396,0.0003694297,0.00035972786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074935326,0.00083402905,0.0013412788,0.001568716,0.0018950305,0.0024894397,0.0027966218,0.0017958604,0.011305415],"category_scores_gemma":[0.004098339,0.0011353694,0.0012028734,0.001859032,0.0027522042,0.0074414555,0.003586476,0.004929576,0.0011356685],"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.00014819563,0.00008316399,0.0009544861,0.00014700844,0.00002482715,0.00035480445,0.0006408808,0.002450692,0.004743226,0.96860605,0.005251432,0.01659524],"study_design_scores_gemma":[0.00005592992,0.00004581545,0.00082755135,0.000023493798,0.00005132007,0.0008933984,0.0002499289,0.013911574,0.0019534514,0.97320807,0.0087581575,0.000021199025],"about_ca_topic_score_codex":0.0007505854,"about_ca_topic_score_gemma":0.00070520525,"teacher_disagreement_score":0.011305415,"about_ca_system_score_codex":0.00075538974,"about_ca_system_score_gemma":0.00049485883,"threshold_uncertainty_score":0.0378204},"labels":[],"label_agreement":null},{"id":"W2061275745","doi":"10.1016/j.jctb.2011.06.004","title":"On the maximum size of a minimal k-edge connected augmentation","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Waterloo","funders":"","keywords":"Combinatorics; Simple (philosophy); Mathematics; Undirected graph; Graph; Generalization; Enhanced Data Rates for GSM Evolution; Connectivity; Vertex connectivity; Simple graph; Degree (music); Discrete mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.025940067529460615,"score_gpt":0.2665166091183068,"score_spread":0.2405765415888462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061275745","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.85303664,0.00071998435,0.06851745,0.0033397856,0.00016544698,0.00015561617,0.003031885,0.00071731623,0.07031591],"genre_scores_gemma":[0.94933814,0.0005036007,0.040426705,0.0003748933,0.00019749349,0.00023890265,0.0015546648,0.0003034936,0.007062094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900323,0.00027878204,0.00006655227,0.00024470757,0.00019890696,0.00020784428],"domain_scores_gemma":[0.98615867,0.010476565,0.000836438,0.00089857954,0.0005463879,0.0010833073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012778906,0.000826095,0.0013903473,0.0013218977,0.0017998487,0.004481089,0.0024734915,0.0018146702,0.014385696],"category_scores_gemma":[0.009718269,0.0010537193,0.0010666634,0.0015069362,0.0023796163,0.006083418,0.0024255314,0.0018640246,0.0012051585],"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.0029902903,0.00035995076,0.008468644,0.0012014366,0.00019385156,0.000685689,0.0014200254,0.05773506,0.051238604,0.80250275,0.0191564,0.05404716],"study_design_scores_gemma":[0.00019670864,0.00022449091,0.0038858382,0.0001666567,0.00019103239,0.00094186055,0.0005911539,0.099694304,0.009185796,0.8774692,0.0073896535,0.00006339271],"about_ca_topic_score_codex":0.00059547287,"about_ca_topic_score_gemma":0.0008998124,"teacher_disagreement_score":0.014385696,"about_ca_system_score_codex":0.0011262767,"about_ca_system_score_gemma":0.0008588495,"threshold_uncertainty_score":0.04812497},"labels":[],"label_agreement":null},{"id":"W2063442271","doi":"10.1016/j.jctb.2006.07.007","title":"A rooted map invariant, non-orientability and Jack symmetric functions","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"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":"Mathematics; Combinatorics; Invariant (physics); Symmetric function; Series (stratigraphy); Discrete mathematics; Pure mathematics; Mathematical physics","score_opus":0.012786354277761267,"score_gpt":0.2603290523515335,"score_spread":0.24754269807377222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063442271","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.73521566,0.00052494224,0.08019826,0.0011135194,0.00072266825,0.00006744594,0.00019039256,0.00040662094,0.1815606],"genre_scores_gemma":[0.96189594,0.0003078762,0.007101979,0.0003029747,0.00031997304,0.000026255368,0.00018234417,0.00019511642,0.029667523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957687,0.000052004245,0.000019047766,0.00009881414,0.00011180696,0.00014142746],"domain_scores_gemma":[0.99933285,0.00011796731,0.00011364774,0.00011524021,0.000098029726,0.00022222816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055057195,0.00077752455,0.0009283977,0.0021726773,0.002019773,0.002735689,0.0011621353,0.0014402041,0.009154519],"category_scores_gemma":[0.0014815017,0.0005182392,0.0008573727,0.0008924497,0.0028950598,0.004301593,0.0015518987,0.0026520907,0.0012951382],"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.00004345303,0.000043085613,0.00023871241,0.000020988879,0.0000054445914,0.00014476693,0.0001428874,0.00037096045,0.0019936222,0.9919143,0.0008057386,0.004276088],"study_design_scores_gemma":[0.000022415039,0.000040198433,0.0007416338,0.0000119384395,0.0000138244195,0.00026738746,0.00015239419,0.0043624816,0.00089425483,0.990873,0.002599005,0.000021506434],"about_ca_topic_score_codex":0.0014128011,"about_ca_topic_score_gemma":0.0013640169,"teacher_disagreement_score":0.009154519,"about_ca_system_score_codex":0.00087456347,"about_ca_system_score_gemma":0.00052809494,"threshold_uncertainty_score":0.030624926},"labels":[],"label_agreement":null},{"id":"W2063812540","doi":"10.1016/j.jctb.2005.01.001","title":"Vertex colouring edge partitions","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Multiset; Vertex (graph theory); Mathematics; Partition (number theory); Graph; Frequency partition of a graph; Neighbourhood (mathematics); Multiplicity (mathematics); Discrete mathematics; Graph power; Line graph; Geometry","score_opus":0.009189915335832617,"score_gpt":0.22500586900062178,"score_spread":0.21581595366478917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063812540","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.6059786,0.00073177926,0.24836572,0.0027187287,0.00046061235,0.00022469721,0.0021618742,0.0011262087,0.13823181],"genre_scores_gemma":[0.85200816,0.00043710906,0.116650425,0.0006581475,0.00017756202,0.00015254415,0.002059799,0.00053665385,0.027319672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987155,0.00038930424,0.000057228026,0.00036667823,0.00020055647,0.00027059627],"domain_scores_gemma":[0.9930878,0.00361928,0.00038217133,0.0017060135,0.0005776782,0.00062704465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000982966,0.00070059363,0.0010713842,0.0014418433,0.002591831,0.004795802,0.0020107287,0.001995699,0.015770314],"category_scores_gemma":[0.0065750796,0.0009323281,0.0009201904,0.0019789387,0.001960022,0.0051012845,0.0024563838,0.002663603,0.0014604415],"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.0005479681,0.00024212406,0.0025259268,0.00017958895,0.00003430138,0.00012976142,0.00048136304,0.018597212,0.007597958,0.8971931,0.016752118,0.055718657],"study_design_scores_gemma":[0.000068958856,0.000050797247,0.00124373,0.000057085217,0.000051824234,0.00020540832,0.0003124936,0.05289263,0.0039253444,0.93170637,0.009456125,0.000029297225],"about_ca_topic_score_codex":0.0017375197,"about_ca_topic_score_gemma":0.0028799674,"teacher_disagreement_score":0.015770314,"about_ca_system_score_codex":0.0016284931,"about_ca_system_score_gemma":0.00095372845,"threshold_uncertainty_score":0.052756965},"labels":[],"label_agreement":null},{"id":"W2064861714","doi":"10.1006/jctb.2002.2127","title":"A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"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":"Matroid; Property (philosophy); Mathematics; Characterization (materials science); Minor (academic); Combinatorics; Flow (mathematics); Binary number; Graphic matroid; Set (abstract data type); Discrete mathematics; Computer science; Arithmetic; Law; Physics; Philosophy; Geometry","score_opus":0.01270040050646915,"score_gpt":0.22484422133202656,"score_spread":0.2121438208255574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064861714","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.023132375,0.032104935,0.6487492,0.050110567,0.02041369,0.0006284909,0.0036232937,0.0017924815,0.21944508],"genre_scores_gemma":[0.48361602,0.0338539,0.32386217,0.028758299,0.03568946,0.0019457121,0.0036084491,0.0016285819,0.08703745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882215,0.00022664429,0.000084613435,0.00031231958,0.0004026051,0.00015166341],"domain_scores_gemma":[0.9952702,0.0030469191,0.00029321545,0.00034621323,0.0007047745,0.0003387977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023756733,0.003099844,0.0017425158,0.002894933,0.0026721887,0.0036445374,0.002008576,0.002764091,0.018825356],"category_scores_gemma":[0.008997071,0.0012888495,0.0032556497,0.0045595495,0.004187659,0.008129329,0.0053269523,0.009428938,0.0037553937],"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.00019532687,0.00019602498,0.00059933093,0.0011698848,0.00014637974,0.00083427527,0.00040778663,0.0040232707,0.006060693,0.8596462,0.06363837,0.063082464],"study_design_scores_gemma":[0.00003467276,0.000090823545,0.0011689143,0.0001450938,0.000079571226,0.00043770394,0.00007847629,0.0036535596,0.0014458122,0.92349243,0.069309734,0.00006331042],"about_ca_topic_score_codex":0.00223486,"about_ca_topic_score_gemma":0.0020719345,"teacher_disagreement_score":0.018825356,"about_ca_system_score_codex":0.0024664092,"about_ca_system_score_gemma":0.0013172796,"threshold_uncertainty_score":0.062977076},"labels":[],"label_agreement":null},{"id":"W2065002346","doi":"10.1016/s0095-8956(02)00009-6","title":"Cliques in dense GF(q)-representable matroids","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"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":"Matroid; Integer (computer science); Combinatorics; Finite field; Mathematics; Simple (philosophy); Minor (academic); GF(2); Discrete mathematics; Graphic matroid; Computer science; Humanities","score_opus":0.012786337624303767,"score_gpt":0.28651307951657945,"score_spread":0.2737267418922757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065002346","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.8566668,0.0005057147,0.099765256,0.0027714302,0.000097911216,0.00023526329,0.002055598,0.00073321623,0.037168782],"genre_scores_gemma":[0.95580137,0.0002739462,0.03327971,0.00028295885,0.00012727248,0.00016964445,0.0012756041,0.00010945259,0.008680099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999131,0.00021986006,0.000041980118,0.00019039027,0.000191769,0.00022509963],"domain_scores_gemma":[0.9953896,0.0027713592,0.0006721625,0.00047098324,0.00029731408,0.00039850257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066433277,0.0004936859,0.00084497884,0.0011864626,0.0019325424,0.003259638,0.0012118691,0.0012062599,0.0074609006],"category_scores_gemma":[0.0042362874,0.00086827425,0.0006189216,0.0023121256,0.0013473756,0.0034717906,0.0013461623,0.0019519848,0.0006660342],"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.0009555352,0.00053727545,0.0031517756,0.0003994823,0.00009034088,0.00080641406,0.0014728882,0.028086366,0.014980744,0.8892375,0.015035648,0.04524611],"study_design_scores_gemma":[0.00021727763,0.00007541007,0.0014517924,0.00004887761,0.000051357954,0.000426861,0.0003895254,0.07113823,0.0029900288,0.91732806,0.005853425,0.000029205588],"about_ca_topic_score_codex":0.0023929703,"about_ca_topic_score_gemma":0.004977686,"teacher_disagreement_score":0.0074609006,"about_ca_system_score_codex":0.0012866233,"about_ca_system_score_gemma":0.00083480583,"threshold_uncertainty_score":0.024959147},"labels":[],"label_agreement":null},{"id":"W2065456078","doi":"10.1016/s0095-8956(03)00071-6","title":"The matrix of chromatic joins and the Temperley–Lieb algebra","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Molecular spectroscopy and chirality","field":"Chemistry","cited_by":16,"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":"Joins; Recursion (computer science); Algebra over a field; Generalization; Mathematics; Context (archaeology); Matrix (chemical analysis); Inverse; Pure mathematics; Chromatic scale; Combinatorics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.0034403974751530406,"score_gpt":0.22733583966180956,"score_spread":0.22389544218665652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065456078","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.6584519,0.0010696762,0.17307477,0.003932099,0.00070150907,0.00010958514,0.0004558925,0.00039610366,0.16180848],"genre_scores_gemma":[0.9536997,0.00041872132,0.015903225,0.00042284356,0.0005448133,0.00005741167,0.00020758725,0.0001249804,0.028620798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946564,0.00011118136,0.000019205498,0.000109888366,0.0001901205,0.00010390497],"domain_scores_gemma":[0.9985636,0.00039056467,0.00023869959,0.00013580563,0.00022793518,0.00044345798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009955686,0.0004163486,0.0006700174,0.0019621255,0.0022513566,0.0035144894,0.0012750985,0.0010787535,0.011690023],"category_scores_gemma":[0.0028569794,0.00040040378,0.00039749796,0.0013371361,0.0035988737,0.0047759884,0.0014025143,0.0017580405,0.0013742239],"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.000015501022,0.000008366028,0.00005912518,0.0000045671077,0.000001790835,0.000019344172,0.000054106982,0.00036668938,0.00038284867,0.9973738,0.0003703728,0.0013434401],"study_design_scores_gemma":[0.0000056585022,0.000009017383,0.000096937314,0.0000030827448,0.0000014237044,0.000049574614,0.00004328472,0.0031500184,0.00028176667,0.99479276,0.001555242,0.000011172764],"about_ca_topic_score_codex":0.0018576848,"about_ca_topic_score_gemma":0.002014551,"teacher_disagreement_score":0.011690023,"about_ca_system_score_codex":0.0013878437,"about_ca_system_score_gemma":0.001221624,"threshold_uncertainty_score":0.039107025},"labels":[],"label_agreement":null},{"id":"W2065484772","doi":"10.1016/j.jctb.2004.11.004","title":"Random cubic graphs are not homomorphic to the cycle of size 7","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":21,"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 Toronto","funders":"","keywords":"Homomorphism; Homomorphic encryption; Cubic graph; Mathematics; Combinatorics; Discrete mathematics; Foster graph; Random graph; Odd graph; Pancyclic graph; Graph; Computer science; Pathwidth; Line graph; Graph power; Voltage graph","score_opus":0.01449569199127126,"score_gpt":0.2782821518972708,"score_spread":0.2637864599059995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065484772","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.89071405,0.00034114136,0.032000862,0.001686281,0.00017802634,0.00014003651,0.0007548653,0.00081892236,0.07336587],"genre_scores_gemma":[0.98480886,0.0001789664,0.00378175,0.0003615488,0.00011799606,0.00009266202,0.0005089808,0.00019083022,0.009958478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866605,0.00023178503,0.000049471404,0.000318965,0.00043448753,0.00029919416],"domain_scores_gemma":[0.9863891,0.005943639,0.0024926455,0.0027832035,0.00096984,0.0014215512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007687184,0.0004372104,0.0015395604,0.001731412,0.002391019,0.0037159421,0.0014564832,0.0019580752,0.012020736],"category_scores_gemma":[0.01158401,0.0011967261,0.00080527936,0.0016797235,0.0031516862,0.0051457197,0.0020207893,0.002513947,0.0008500913],"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.00039813743,0.00008135302,0.002064101,0.00012914799,0.000041031737,0.00023051217,0.0003557163,0.0030023127,0.002068444,0.9756035,0.0056796866,0.010345935],"study_design_scores_gemma":[0.00015559983,0.00006914632,0.0021121698,0.000032345575,0.00004367063,0.00061728735,0.00027113865,0.016845258,0.001623238,0.9740414,0.004131036,0.000057871734],"about_ca_topic_score_codex":0.002078015,"about_ca_topic_score_gemma":0.0027925265,"teacher_disagreement_score":0.012020736,"about_ca_system_score_codex":0.0014722687,"about_ca_system_score_gemma":0.001781997,"threshold_uncertainty_score":0.040213346},"labels":[],"label_agreement":null},{"id":"W2065615449","doi":"10.1016/j.jctb.2010.10.004","title":"Twins of rayless graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Cograph; Induced subgraph isomorphism problem; Graph; Discrete mathematics; Chordal graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.010228694232689501,"score_gpt":0.2727172146198766,"score_spread":0.26248852038718706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065615449","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.8385702,0.0005256214,0.07185699,0.0008709862,0.00051156513,0.00008680784,0.00034013914,0.00027395197,0.08696383],"genre_scores_gemma":[0.94271904,0.00030378852,0.020413218,0.00030440016,0.00022862639,0.00006798216,0.00042628188,0.00023635644,0.03530039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995065,0.00012762524,0.000024739138,0.0001228851,0.00012333806,0.00009485643],"domain_scores_gemma":[0.9985475,0.00048062735,0.00022499241,0.00015773335,0.0002015819,0.00038762586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048151086,0.0005014275,0.0009862079,0.0020719543,0.0020848042,0.0029843014,0.001186758,0.0012479727,0.007226186],"category_scores_gemma":[0.0029609362,0.0007381229,0.000834473,0.00093719177,0.001864801,0.0028632542,0.0020887721,0.0022231943,0.0009284273],"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.000111916284,0.000027257454,0.0004904216,0.000024004796,0.00001094117,0.00016528847,0.00026473473,0.0004607963,0.0016763972,0.99279517,0.0010967996,0.002876232],"study_design_scores_gemma":[0.000036093403,0.00003297276,0.00048330147,0.000017746228,0.00002772687,0.00023624973,0.0003195319,0.003981889,0.0011265676,0.990522,0.0032011736,0.000014710835],"about_ca_topic_score_codex":0.00079304073,"about_ca_topic_score_gemma":0.0010138087,"teacher_disagreement_score":0.007226186,"about_ca_system_score_codex":0.000665103,"about_ca_system_score_gemma":0.00043850933,"threshold_uncertainty_score":0.024174035},"labels":[],"label_agreement":null},{"id":"W2066522339","doi":"10.1006/jctb.2000.2003","title":"Chromatic Number and the 2-Rank of a Graph","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"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":"Chromatic scale; Combinatorics; Graph; Rank (graph theory); Friendship graph; Adjacency matrix; Mathematics; Windmill graph; Discrete mathematics; Line graph; Graph power","score_opus":0.006015949863867088,"score_gpt":0.2158930395992454,"score_spread":0.20987708973537833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066522339","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.89869225,0.0012568327,0.04123744,0.0057674176,0.0002489976,0.000058767262,0.0020267612,0.00036257293,0.05034905],"genre_scores_gemma":[0.9810626,0.0005238751,0.009576154,0.00026960118,0.0003872942,0.000057624755,0.000645317,0.00008917652,0.00738831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883014,0.00033588952,0.000055897348,0.0002592765,0.00024572678,0.0002731242],"domain_scores_gemma":[0.98858005,0.006609566,0.0021120447,0.0007539775,0.0005937959,0.0013504999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014037531,0.0007877268,0.0010601974,0.004149482,0.0022694904,0.0057389387,0.0020446125,0.0019689614,0.012149681],"category_scores_gemma":[0.007590409,0.00078413455,0.000585242,0.002877612,0.0044063255,0.0072861244,0.0017994582,0.002446271,0.00097117026],"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.0005743185,0.00016370109,0.0061566434,0.0002023813,0.00005229567,0.00016957213,0.0007905863,0.016184445,0.0057099513,0.9423093,0.009587476,0.018099325],"study_design_scores_gemma":[0.00010403197,0.00008275726,0.0033396455,0.00004663548,0.000047520596,0.00036976323,0.00035013922,0.041035417,0.0018248841,0.9481837,0.0045295353,0.00008605173],"about_ca_topic_score_codex":0.002321799,"about_ca_topic_score_gemma":0.0031051151,"teacher_disagreement_score":0.012149681,"about_ca_system_score_codex":0.0019874424,"about_ca_system_score_gemma":0.0009969396,"threshold_uncertainty_score":0.040644765},"labels":[],"label_agreement":null},{"id":"W2067309928","doi":"10.1016/j.jctb.2003.12.005","title":"Inequivalent representations of matroids having no U3,6-minor","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"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":"Matroid; Mathematics; Minor (academic); Combinatorics; Prime (order theory); Prime power; Graphic matroid; Discrete mathematics; Humanities","score_opus":0.015323233040096635,"score_gpt":0.29648798703544577,"score_spread":0.2811647539953491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067309928","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.88431877,0.00027892887,0.027347995,0.0014538573,0.00043577986,0.0000778377,0.00044916428,0.0003133962,0.08532423],"genre_scores_gemma":[0.9624426,0.00022519329,0.013215108,0.0005224952,0.0003025995,0.000085585394,0.0008503806,0.00023588554,0.022120284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888915,0.00022583395,0.000085952575,0.00020679644,0.00024693474,0.0003453265],"domain_scores_gemma":[0.9984169,0.0005233949,0.00026647002,0.00020225393,0.00018504562,0.00040591255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008190703,0.0010775097,0.00090241834,0.0017813329,0.002578665,0.005965164,0.0017686137,0.0025857834,0.015970232],"category_scores_gemma":[0.0023192689,0.0007663158,0.0011982973,0.0014686448,0.0022116664,0.004364715,0.0022693023,0.003297789,0.0016865723],"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.00031032332,0.00016524729,0.0005387268,0.000050919283,0.000014404857,0.00040360645,0.00078933575,0.0009315202,0.0058119465,0.97789985,0.003188092,0.009895934],"study_design_scores_gemma":[0.0001083906,0.000090285714,0.0008285451,0.000028747698,0.000029510455,0.0005500276,0.00064387673,0.007914139,0.0019309561,0.98364455,0.004192252,0.000038767164],"about_ca_topic_score_codex":0.00049692043,"about_ca_topic_score_gemma":0.00085795793,"teacher_disagreement_score":0.015970232,"about_ca_system_score_codex":0.0014256279,"about_ca_system_score_gemma":0.0005232542,"threshold_uncertainty_score":0.05342573},"labels":[],"label_agreement":null},{"id":"W2068457180","doi":"10.1006/jctb.2000.1996","title":"Cycle Decompositions of K and K−I","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":261,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Graph; Mathematics; Combinatorics; Order (exchange); Complete graph; Economics","score_opus":0.004295824774612166,"score_gpt":0.20109742396501387,"score_spread":0.19680159919040172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068457180","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.6762258,0.00118231,0.079945296,0.00160598,0.00038391657,0.0003529534,0.0026194386,0.00047572135,0.23720852],"genre_scores_gemma":[0.88784355,0.00068768195,0.031985182,0.00040658435,0.00011766613,0.00025261397,0.0025528553,0.0003541457,0.07579964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996942,0.00003179487,0.000016670721,0.000069085836,0.00006495437,0.0001233236],"domain_scores_gemma":[0.9993285,0.00014446705,0.00012077352,0.000079688594,0.00016900366,0.0001575089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021984267,0.00050540816,0.00034247967,0.0022667462,0.001663146,0.0028772878,0.00076622784,0.0007537564,0.016833033],"category_scores_gemma":[0.0009742396,0.0004817537,0.0005427894,0.0014516582,0.0011084377,0.0016137618,0.00086392596,0.0011735567,0.0022854742],"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.00013390082,0.000059331152,0.00069028424,0.00008734241,0.000010895754,0.00015602158,0.0006639924,0.0014412823,0.005663114,0.96908915,0.0056993035,0.016305367],"study_design_scores_gemma":[0.000037928497,0.000036748872,0.0020575242,0.000076392214,0.000026004112,0.00027236342,0.00062446034,0.011141955,0.0042669256,0.96147776,0.019951655,0.000030304886],"about_ca_topic_score_codex":0.0024824538,"about_ca_topic_score_gemma":0.0027738146,"teacher_disagreement_score":0.016833033,"about_ca_system_score_codex":0.0010740868,"about_ca_system_score_gemma":0.0006347709,"threshold_uncertainty_score":0.056312144},"labels":[],"label_agreement":null},{"id":"W2074859673","doi":"10.1006/jctb.2002.2130","title":"Branch-Width and Rota's Conjecture","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"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":"Matroid; Conjecture; Finite field; Integer (computer science); Combinatorics; Mathematics; Field (mathematics); Finite set; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.011884428037992422,"score_gpt":0.24380569174866168,"score_spread":0.23192126371066926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074859673","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.4386936,0.0047358642,0.08031688,0.04021264,0.0014761989,0.00013117281,0.0016468975,0.0015664739,0.4312203],"genre_scores_gemma":[0.95089084,0.002095029,0.017619913,0.0028690144,0.0015357462,0.00016628804,0.0011183973,0.00040685188,0.023297992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985524,0.00038512138,0.00006367682,0.00041681284,0.0002518729,0.00033011028],"domain_scores_gemma":[0.98960894,0.00722336,0.00061474106,0.0013622773,0.0004509419,0.0007397626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002399238,0.00095808407,0.0025008675,0.002043107,0.004235578,0.005846498,0.0030787808,0.00446793,0.028365934],"category_scores_gemma":[0.014846845,0.001217172,0.0015928146,0.0034501757,0.0059754592,0.018312065,0.0046197814,0.0078084343,0.0033351916],"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.00021647569,0.000082008184,0.0008794482,0.00012862534,0.00001784137,0.00009028336,0.0002988311,0.001742826,0.0005324855,0.9735372,0.011878475,0.010595522],"study_design_scores_gemma":[0.000034366843,0.0000074378677,0.00016839482,0.000016900207,0.000010118481,0.000048118047,0.00007652168,0.0022056883,0.00012218965,0.99520254,0.002100646,0.000007002186],"about_ca_topic_score_codex":0.0012716522,"about_ca_topic_score_gemma":0.0012162477,"teacher_disagreement_score":0.028365934,"about_ca_system_score_codex":0.0016389575,"about_ca_system_score_gemma":0.0009079657,"threshold_uncertainty_score":0.094893515},"labels":[],"label_agreement":null},{"id":"W2076011470","doi":"10.1006/jctb.1999.1938","title":"The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Science Foundation; Hungarian Scientific Research Fund; National Security Agency; National Science Foundation","keywords":"Fano plane; Projective plane; Conjecture; Plane (geometry); Mathematics; Combinatorics; Constant (computer programming); Set (abstract data type); Order (exchange); Discrete mathematics; Geometry; Computer science","score_opus":0.012225524026858696,"score_gpt":0.25182557406397077,"score_spread":0.23960005003711207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076011470","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.9625665,0.00078694086,0.0157095,0.0014101224,0.000052042316,0.00004699475,0.0020216645,0.00021700084,0.017189166],"genre_scores_gemma":[0.98427665,0.00052681833,0.00988875,0.0002524481,0.00012391595,0.00011350191,0.0013995814,0.00018061778,0.0032377087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988667,0.0003544766,0.00008440178,0.00026112076,0.00021925336,0.00021412616],"domain_scores_gemma":[0.9697706,0.023065303,0.0027341268,0.0012278218,0.0010887446,0.0021134145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018325923,0.00086213247,0.0015259302,0.002405345,0.0018915848,0.0048087663,0.0026899634,0.0023068178,0.0075300243],"category_scores_gemma":[0.015946988,0.0013442911,0.00091192964,0.0022712196,0.0022069025,0.007633539,0.00164208,0.0013504403,0.00049820996],"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.0047992663,0.00037548246,0.027518904,0.0014753845,0.00049175,0.0015016127,0.002172358,0.08631935,0.05973198,0.7630286,0.016145105,0.036440175],"study_design_scores_gemma":[0.00030429568,0.00021905832,0.011490853,0.00019676264,0.0002993921,0.0016630858,0.0010170884,0.1377573,0.017825872,0.82408494,0.005038382,0.000102938415],"about_ca_topic_score_codex":0.0010959567,"about_ca_topic_score_gemma":0.001352613,"teacher_disagreement_score":0.0075300243,"about_ca_system_score_codex":0.0017050202,"about_ca_system_score_gemma":0.00076012424,"threshold_uncertainty_score":0.025190473},"labels":[],"label_agreement":null},{"id":"W2079618965","doi":"10.1016/s0095-8956(02)00046-1","title":"On the excluded minors for the matroids of branch-width k","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"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":"Matroid; Combinatorics; Class (philosophy); Mathematics; Computer science; Artificial intelligence","score_opus":0.018968047861716613,"score_gpt":0.27656494701472645,"score_spread":0.2575968991530098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079618965","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.80242306,0.0012690872,0.12729114,0.0028906171,0.0003012043,0.00016489696,0.0011544519,0.00035742167,0.06414804],"genre_scores_gemma":[0.94200146,0.00094071473,0.032234598,0.00048312865,0.00065549,0.00017196208,0.0013791888,0.00026817876,0.021865258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991404,0.0002722786,0.0000604814,0.00016208678,0.00020660752,0.00015810932],"domain_scores_gemma":[0.9930506,0.003992796,0.00096673873,0.000420318,0.0005461012,0.0010235629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013409206,0.0011825423,0.0010963468,0.0021246993,0.0023821127,0.005287708,0.0019772868,0.0019328429,0.010745357],"category_scores_gemma":[0.008572548,0.0011506485,0.0012798955,0.0016245216,0.003183936,0.0052861357,0.0020554038,0.003249583,0.0014646993],"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.00036169382,0.00012120206,0.0018425137,0.000120038276,0.000031994077,0.00026647712,0.00096853933,0.003443518,0.0033397563,0.9722853,0.005335834,0.011883117],"study_design_scores_gemma":[0.000049119106,0.000044726014,0.0007915946,0.000029122873,0.000016930358,0.0002905498,0.0002536411,0.013290445,0.0005941488,0.981437,0.003180462,0.000022382646],"about_ca_topic_score_codex":0.0015255683,"about_ca_topic_score_gemma":0.002081115,"teacher_disagreement_score":0.010745357,"about_ca_system_score_codex":0.0013343387,"about_ca_system_score_gemma":0.00069884915,"threshold_uncertainty_score":0.035946786},"labels":[],"label_agreement":null},{"id":"W2081749768","doi":"10.1016/j.jctb.2014.07.005","title":"Graph layouts via layered separators","year":2014,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Queue; Book embedding; Discrete mathematics; Graph; Outerplanar graph; Partition (number theory); Line graph; Computer science; Voltage graph; Pathwidth","score_opus":0.00949178050449383,"score_gpt":0.24723880492290773,"score_spread":0.2377470244184139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081749768","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.0835404,0.00025311275,0.8908547,0.0005049293,0.00015531757,0.000088204906,0.00046442501,0.0020920993,0.022046711],"genre_scores_gemma":[0.55227625,0.00042318343,0.4172434,0.00024997268,0.00009319025,0.0001616957,0.0008581106,0.0012296673,0.02746458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994098,0.00014766584,0.000032219014,0.00014955702,0.00018220565,0.00007867441],"domain_scores_gemma":[0.9970335,0.0011639788,0.00037213994,0.00076601404,0.00033883273,0.00032555655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046139755,0.0007365303,0.00073759933,0.0018690911,0.0009111848,0.002324501,0.0015439941,0.0014929587,0.015637835],"category_scores_gemma":[0.0050112973,0.0011617866,0.00075744017,0.0014550096,0.0011693743,0.0032573023,0.003249321,0.0021518245,0.003131826],"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.00025305455,0.00012422394,0.0012344202,0.0002834098,0.00005995979,0.00038903535,0.00048704512,0.11412847,0.019089673,0.7335199,0.013966965,0.11646377],"study_design_scores_gemma":[0.000065508386,0.00005423171,0.00040031012,0.000070425966,0.00003113365,0.00029953837,0.00018312594,0.39452603,0.007453789,0.5840223,0.01285348,0.00004010222],"about_ca_topic_score_codex":0.000643936,"about_ca_topic_score_gemma":0.0012226833,"teacher_disagreement_score":0.015637835,"about_ca_system_score_codex":0.00072023727,"about_ca_system_score_gemma":0.00045674393,"threshold_uncertainty_score":0.052313805},"labels":[],"label_agreement":null},{"id":"W2082255109","doi":"10.1016/j.jctb.2005.02.001","title":"Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":49,"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 Regina","funders":"","keywords":"Invertible matrix; Mathematics; Combinatorics; Order (exchange); Matrix (chemical analysis); Generating function; Hankel matrix; Fraction (chemistry); Function (biology); Unit (ring theory); Sign (mathematics); Pure mathematics; Mathematical analysis","score_opus":0.015493770675863766,"score_gpt":0.29329581254535725,"score_spread":0.2778020418694935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082255109","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.7928504,0.001377312,0.049107827,0.0025243063,0.00047627892,0.00005346653,0.0003273358,0.00021622331,0.15306684],"genre_scores_gemma":[0.97846735,0.0004087029,0.005535972,0.00028870426,0.00023573491,0.000034996086,0.000120558216,0.00004188715,0.01486612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996202,0.000096759984,0.000018717108,0.00007308606,0.00010377535,0.00008740653],"domain_scores_gemma":[0.99822706,0.00087734376,0.0002681716,0.00015505432,0.0002017466,0.00027057301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000682551,0.00035916557,0.0005786193,0.0018217579,0.0017128142,0.0028563943,0.00084385637,0.0010691171,0.0074269557],"category_scores_gemma":[0.003953052,0.00041947895,0.0004480469,0.0010889481,0.002482292,0.0030649388,0.0011429323,0.0015797655,0.00044917027],"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.000014515748,0.000011061075,0.00019193094,0.0000089592995,0.00000172704,0.000024656563,0.000093078015,0.00045413052,0.00030055724,0.9966198,0.00057845784,0.0017011245],"study_design_scores_gemma":[0.000011206652,0.0000072334747,0.00036004838,0.0000067394726,0.0000026168993,0.000056869212,0.00007620028,0.0028638688,0.00017682122,0.9954661,0.00096148456,0.000010784611],"about_ca_topic_score_codex":0.0019921057,"about_ca_topic_score_gemma":0.003425804,"teacher_disagreement_score":0.0074269557,"about_ca_system_score_codex":0.0010694707,"about_ca_system_score_gemma":0.00073472166,"threshold_uncertainty_score":0.0248456},"labels":[],"label_agreement":null},{"id":"W2082989065","doi":"10.1016/j.jctb.2004.08.002","title":"Professor W.T. Tutte","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"History and advancements in chemistry","field":"Chemistry","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 Waterloo","funders":"","keywords":"Humanities; Art","score_opus":0.008149775772663405,"score_gpt":0.24784670914398135,"score_spread":0.23969693337131795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082989065","genre_codex":"commentary","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.010550389,0.15992352,0.0130956005,0.44762188,0.20427515,0.00014931928,0.0018117458,0.0010136074,0.16155879],"genre_scores_gemma":[0.057179835,0.098239906,0.0050295703,0.02188824,0.051286392,0.00009430759,0.0010340011,0.00040630432,0.7648415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995472,0.00004381732,0.000024424971,0.00019216859,0.00014414411,0.000048239606],"domain_scores_gemma":[0.9979305,0.0002228129,0.00010066717,0.00005404861,0.00090153987,0.00079041434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001053202,0.0005149318,0.0008659629,0.001590053,0.0005604976,0.0010511902,0.00058320037,0.0009275316,0.049045205],"category_scores_gemma":[0.002845402,0.0002389617,0.00030799228,0.0006983249,0.0006470572,0.0012984638,0.00075429026,0.0027211744,0.034033142],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0001043553,0.000027639779,0.0011116656,0.00018146975,0.000016859623,0.00014713495,0.00008919243,0.00016960829,0.0011358189,0.0064734016,0.8525124,0.13803032],"study_design_scores_gemma":[0.000011883271,0.000054352142,0.0012817746,0.00007634823,0.000011694309,0.00095452956,0.00006207174,0.00021051274,0.0011475906,0.002733304,0.9934422,0.000013862698],"about_ca_topic_score_codex":0.0010806945,"about_ca_topic_score_gemma":0.0018975097,"teacher_disagreement_score":0.049045205,"about_ca_system_score_codex":0.0008841167,"about_ca_system_score_gemma":0.0011161302,"threshold_uncertainty_score":0.16407257},"labels":[],"label_agreement":null},{"id":"W2083735231","doi":"10.1016/j.jctb.2009.11.003","title":"Crossing-critical graphs with large maximum degree","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Bounded function; Degree (music); Mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.01717054544245858,"score_gpt":0.29570413759398356,"score_spread":0.27853359215152496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083735231","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.89537823,0.00095647905,0.06973153,0.0015772268,0.00014394612,0.00011252363,0.000679141,0.00064592087,0.030774992],"genre_scores_gemma":[0.97965664,0.00055663195,0.014454869,0.00025538506,0.00010057752,0.000059533515,0.00046111306,0.00014247421,0.0043127625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995995,0.000081030725,0.000016823546,0.00010366322,0.00008662988,0.000112415095],"domain_scores_gemma":[0.9923734,0.0041102297,0.0008440241,0.00063224736,0.00060383976,0.0014362608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067955884,0.0007139042,0.0009129707,0.0032169796,0.0019205393,0.002513312,0.0011437355,0.001387978,0.006752623],"category_scores_gemma":[0.007865848,0.0010867241,0.000427292,0.0020200412,0.0016353958,0.0036805926,0.0015756928,0.0017906493,0.00057906006],"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.0004519034,0.0001839084,0.0053145285,0.00034983087,0.00007419,0.001284998,0.00083064113,0.027044399,0.02137814,0.90960044,0.011172697,0.022314355],"study_design_scores_gemma":[0.00009351982,0.000053220167,0.0023108476,0.000048182916,0.000053551663,0.0009422018,0.00044545895,0.04641644,0.0048420792,0.94046634,0.004299396,0.000028731767],"about_ca_topic_score_codex":0.0008994195,"about_ca_topic_score_gemma":0.0016986609,"teacher_disagreement_score":0.006752623,"about_ca_system_score_codex":0.0012241895,"about_ca_system_score_gemma":0.0006666568,"threshold_uncertainty_score":0.022589743},"labels":[],"label_agreement":null},{"id":"W2088312182","doi":"10.1016/j.jctb.2008.08.004","title":"The Erdös–Pósa property for matroid circuits","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"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":"Matroid; Disjoint sets; Combinatorics; Rank (graph theory); Graphic matroid; Mathematics; Matroid partitioning; Constant (computer programming); Bounded function; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.03265438713067384,"score_gpt":0.2751685194414888,"score_spread":0.24251413231081495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088312182","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.58440083,0.0024624977,0.24908273,0.0064145103,0.0003102601,0.00010948582,0.0013450782,0.0006704233,0.15520419],"genre_scores_gemma":[0.9616214,0.0013627365,0.022528527,0.0006909893,0.0004032585,0.00016867838,0.0004952275,0.00014255181,0.012586731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983847,0.00030937197,0.00014570309,0.0004850918,0.00046106358,0.00021411941],"domain_scores_gemma":[0.9941649,0.0032393073,0.0007068543,0.00079867267,0.00057747203,0.00051280006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016262595,0.00058281416,0.0017999464,0.0020647577,0.0023815641,0.0057420027,0.0017482876,0.0020520955,0.007012951],"category_scores_gemma":[0.009413453,0.00081906805,0.001084573,0.0027202778,0.0037409575,0.013794457,0.0033823764,0.0037835196,0.00089424243],"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.000048680966,0.000016342354,0.00029785978,0.00003751338,0.000009399314,0.00005893229,0.00014950344,0.00065058673,0.0007295369,0.9917706,0.000962806,0.0052683987],"study_design_scores_gemma":[0.000016531338,0.000010255148,0.00015722311,0.000011465545,0.000010356231,0.00015345456,0.00005351533,0.0028410207,0.0005419422,0.99395144,0.0022427028,0.00001002098],"about_ca_topic_score_codex":0.0006546252,"about_ca_topic_score_gemma":0.0005189419,"teacher_disagreement_score":0.007012951,"about_ca_system_score_codex":0.0014621357,"about_ca_system_score_gemma":0.00082089804,"threshold_uncertainty_score":0.023460686},"labels":[],"label_agreement":null},{"id":"W2091166220","doi":"10.1016/j.jctb.2007.02.006","title":"Large independent sets in regular graphs of large girth","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":45,"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":"Mathematics; Girth (graph theory); Combinatorics; Discrete mathematics; Independence (probability theory); Differential equation; Independent set; Strongly regular graph; Graph; Statistics; Pathwidth; Mathematical analysis; Line graph","score_opus":0.011854564236731115,"score_gpt":0.2906598480540324,"score_spread":0.2788052838173013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091166220","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.9043093,0.0010887441,0.06606505,0.0016358244,0.0001276788,0.000051746247,0.00027180408,0.00036529917,0.026084602],"genre_scores_gemma":[0.98347086,0.00045037328,0.011231449,0.00019614275,0.00019431536,0.000105948806,0.00021147136,0.00010579292,0.0040337276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989839,0.00029353143,0.000051376806,0.00021656635,0.0002985337,0.00015613677],"domain_scores_gemma":[0.97801524,0.016538614,0.0018849873,0.0012466981,0.0007491525,0.001565274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001542736,0.000656027,0.0019418353,0.003964047,0.0026728548,0.0047416273,0.0027272967,0.0021057834,0.0041538193],"category_scores_gemma":[0.015683718,0.0020035144,0.0011695342,0.0025335962,0.0050950516,0.0063431878,0.003115038,0.0032843626,0.00045726885],"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.00012766897,0.000096417854,0.0022283325,0.000116493626,0.000044428816,0.00030024067,0.0007347946,0.009115201,0.0022322622,0.97760993,0.0019672178,0.0054270984],"study_design_scores_gemma":[0.00003320858,0.000016762702,0.00089678733,0.000022442508,0.000031142175,0.0003442179,0.00018658329,0.018987004,0.0007366764,0.97813076,0.00059670507,0.000017723305],"about_ca_topic_score_codex":0.0005187275,"about_ca_topic_score_gemma":0.00074034435,"teacher_disagreement_score":0.0047416273,"about_ca_system_score_codex":0.0012064156,"about_ca_system_score_gemma":0.00061439315,"threshold_uncertainty_score":0.013895929},"labels":[],"label_agreement":null},{"id":"W2093635261","doi":"10.1016/j.jctb.2014.06.005","title":"The inducibility of blow-up graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","score_opus":0.016463360356692252,"score_gpt":0.2747567065996173,"score_spread":0.25829334624292505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093635261","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.56113374,0.0034336136,0.1271844,0.0056277383,0.00065223477,0.000069575355,0.0004521021,0.0009392082,0.3005074],"genre_scores_gemma":[0.96180135,0.0010860324,0.013211676,0.00073784654,0.00046507848,0.00005214417,0.00033881693,0.00024690654,0.022060152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877673,0.00028597,0.000064124164,0.0002814194,0.00036737768,0.00022429074],"domain_scores_gemma":[0.99506325,0.003066248,0.0002635188,0.00052944885,0.00041627957,0.00066128245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014855603,0.0008935026,0.0012258331,0.0029504169,0.0029155891,0.003364981,0.0018321327,0.0013788063,0.00936081],"category_scores_gemma":[0.005988488,0.00090401125,0.0014220305,0.0013945445,0.005366543,0.010684349,0.0048705153,0.0052791378,0.0007478181],"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.000021760428,0.000023210647,0.0001873752,0.000024087425,0.0000045838788,0.000097443524,0.00030568405,0.00021215691,0.00040382496,0.9956797,0.0005578139,0.0024823751],"study_design_scores_gemma":[0.000010274975,0.000008119869,0.00015603953,0.000011887577,0.0000070858428,0.00010640382,0.00007765791,0.00089576823,0.00038101603,0.9965581,0.0017813374,0.0000062528466],"about_ca_topic_score_codex":0.00085937616,"about_ca_topic_score_gemma":0.00084763,"teacher_disagreement_score":0.00936081,"about_ca_system_score_codex":0.0015386319,"about_ca_system_score_gemma":0.00056494493,"threshold_uncertainty_score":0.03131509},"labels":[],"label_agreement":null},{"id":"W2094202793","doi":"10.1016/j.jctb.2004.08.003","title":"The perfect matching polytope and solid bricks","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"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":"Polytope; Combinatorics; Mathematics; Matching (statistics); Perfect graph theorem; Birkhoff polytope; Convex hull; Convex polytope; Degree (music); Regular polygon; Discrete mathematics; Graph; Convex set; Line graph; Convex optimization; Geometry; Physics","score_opus":0.008220812949512369,"score_gpt":0.2701819619439301,"score_spread":0.26196114899441775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094202793","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.5661296,0.0015482028,0.15660983,0.00280205,0.00043709003,0.00014146457,0.0011066644,0.0003392245,0.27088583],"genre_scores_gemma":[0.9145523,0.001260038,0.034904856,0.0003594853,0.00021453937,0.000115232666,0.0007545455,0.00013220817,0.04770689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999511,0.00008945153,0.000020205976,0.000111166264,0.00015375379,0.00011443798],"domain_scores_gemma":[0.99911875,0.00033526702,0.00019463463,0.00014162537,0.00006237769,0.00014733437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028797484,0.00044554405,0.0009909695,0.0014652146,0.0018574197,0.003540873,0.0012899418,0.0018774353,0.018644635],"category_scores_gemma":[0.0022783482,0.0009321416,0.0006506785,0.0015469946,0.0022162464,0.0037327188,0.0023078949,0.0024658404,0.0020228983],"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.000058965965,0.00002597747,0.0001952842,0.000052587704,0.0000099109575,0.00009395599,0.000054136122,0.006120872,0.0007245889,0.9841905,0.0025419737,0.0059313052],"study_design_scores_gemma":[0.000039371003,0.00002492693,0.0003814328,0.000035403053,0.000011756259,0.00019509338,0.00013504435,0.014574571,0.0005953185,0.97639084,0.0076011512,0.000015102162],"about_ca_topic_score_codex":0.001434751,"about_ca_topic_score_gemma":0.001462277,"teacher_disagreement_score":0.018644635,"about_ca_system_score_codex":0.000757717,"about_ca_system_score_gemma":0.0005026921,"threshold_uncertainty_score":0.062372506},"labels":[],"label_agreement":null},{"id":"W2094667324","doi":"10.1006/jctb.2001.2051","title":"A Characterization of Weakly Bipartite Graphs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":53,"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":"Bipartite graph; Combinatorics; Mathematics; Discrete mathematics; Conjecture; Minor (academic); Strong perfect graph theorem; Robertson–Seymour theorem; Edge-transitive graph; Graph; Voltage graph; Line graph; 1-planar graph; Law","score_opus":0.005445700705337558,"score_gpt":0.18846807641930555,"score_spread":0.18302237571396798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094667324","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.5770623,0.00069416437,0.3455781,0.0033388818,0.00015296221,0.00023569285,0.0022177328,0.0005271831,0.070192926],"genre_scores_gemma":[0.9300704,0.0008648576,0.046537794,0.000855656,0.00049367966,0.00034154815,0.0031151876,0.00036020167,0.017360695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984487,0.00046781974,0.00011183927,0.0004189176,0.0003339267,0.00021861156],"domain_scores_gemma":[0.9866665,0.008121063,0.0015281051,0.00094287586,0.0013630656,0.0013783613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014793912,0.0009987772,0.0011959763,0.0043825777,0.00266239,0.004728055,0.0022376347,0.0017103342,0.008439316],"category_scores_gemma":[0.011403675,0.0009925914,0.00095009385,0.0041939137,0.0028449125,0.0074216216,0.0032829582,0.002937023,0.0010752964],"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.000168016,0.0001146853,0.0031344683,0.00013900433,0.000021850656,0.0001547219,0.00057677564,0.002946573,0.0055100387,0.9689078,0.004116909,0.014209141],"study_design_scores_gemma":[0.000020765332,0.00005650802,0.0014156171,0.000057714824,0.000028789365,0.0004178664,0.00038245926,0.033158455,0.0017704319,0.9567526,0.0059136483,0.000025107825],"about_ca_topic_score_codex":0.00077312667,"about_ca_topic_score_gemma":0.00069790805,"teacher_disagreement_score":0.008439316,"about_ca_system_score_codex":0.0015289591,"about_ca_system_score_gemma":0.000669913,"threshold_uncertainty_score":0.028232276},"labels":[],"label_agreement":null},{"id":"W2096188165","doi":"10.1016/j.jctb.2008.08.005","title":"Cayley sum graphs and eigenvalues of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-fullerenes","year":2008,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Scroll; Eigenvalues and eigenvectors; Discrete mathematics; Combinatorics; Physics; Theology","score_opus":0.01973134371674429,"score_gpt":0.24777375698998824,"score_spread":0.22804241327324395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096188165","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.5846018,0.0012215216,0.08420171,0.002241688,0.0005809126,0.00008006019,0.0010988952,0.0006599193,0.32531342],"genre_scores_gemma":[0.9364802,0.0007328653,0.0135507705,0.0004196742,0.00017595594,0.00008468311,0.00051980425,0.00019064569,0.047845427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998067,0.000029996168,0.0000066019143,0.00004035825,0.00006924023,0.000047123678],"domain_scores_gemma":[0.9994543,0.00017675642,0.00009211144,0.00004903632,0.00011887797,0.00010887768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001913366,0.0004517296,0.00029932542,0.0021019662,0.0012258347,0.0018071076,0.00050013466,0.00075215776,0.024715073],"category_scores_gemma":[0.0013312788,0.00026726536,0.00028427094,0.00082030095,0.00094503455,0.0016324478,0.00068328873,0.000967226,0.00230995],"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.000030315123,0.000023304849,0.00023162212,0.000038673108,0.0000066530833,0.0001336412,0.00011534168,0.001730911,0.002308175,0.9810213,0.006089283,0.008270767],"study_design_scores_gemma":[0.000014487269,0.0000127891535,0.0006074567,0.000022291983,0.0000048997576,0.00016987085,0.00018624592,0.010371651,0.0016744934,0.98148847,0.0054261247,0.000021289505],"about_ca_topic_score_codex":0.0012988274,"about_ca_topic_score_gemma":0.0020609049,"teacher_disagreement_score":0.024715073,"about_ca_system_score_codex":0.00058230973,"about_ca_system_score_gemma":0.00036136346,"threshold_uncertainty_score":0.082680106},"labels":[],"label_agreement":null},{"id":"W2096249258","doi":"10.1016/j.jctb.2013.11.003","title":"Packing of rigid spanning subgraphs and spanning trees","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":19,"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":"Spanning tree; Combinatorics; Minimum degree spanning tree; Minimum spanning tree; Connected dominating set; Mathematics; Connected component; Graph factorization; Graph; Connectivity; Vertex connectivity; Trémaux tree; Disjoint sets; Distance-hereditary graph; Discrete mathematics; Line graph; Graph power; Pathwidth","score_opus":0.003737840103404133,"score_gpt":0.18034843346995832,"score_spread":0.17661059336655419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096249258","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.6636256,0.0011228496,0.28098658,0.0005501027,0.0001290326,0.00009951278,0.00072684913,0.0003703079,0.052389134],"genre_scores_gemma":[0.92566156,0.0010395701,0.05978293,0.00017176439,0.00015672321,0.00012158959,0.00159774,0.00022311322,0.011245034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993062,0.00018662799,0.000045503708,0.00013723224,0.00019143494,0.00013295248],"domain_scores_gemma":[0.9980306,0.0008138714,0.00043420072,0.00036788374,0.00010646962,0.000246944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044305561,0.0007936837,0.0011551947,0.0016246677,0.0012842298,0.0023008368,0.0013382304,0.0014371879,0.006867234],"category_scores_gemma":[0.0045489003,0.0009842104,0.00086632924,0.002866702,0.0015387103,0.0029326754,0.0022418748,0.0013204437,0.0008190981],"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.00028112833,0.00020242309,0.002390473,0.00025448695,0.000080474514,0.00085945847,0.0006776634,0.11882241,0.006278492,0.8109201,0.007207201,0.052025527],"study_design_scores_gemma":[0.000022075063,0.000044294633,0.0011565849,0.000025679714,0.000027281063,0.00028702253,0.00020290173,0.1502772,0.0011460582,0.8440235,0.0027705939,0.000016778422],"about_ca_topic_score_codex":0.0014050953,"about_ca_topic_score_gemma":0.0014177873,"teacher_disagreement_score":0.006867234,"about_ca_system_score_codex":0.0005739256,"about_ca_system_score_gemma":0.00034097777,"threshold_uncertainty_score":0.02297318},"labels":[],"label_agreement":null},{"id":"W2100494081","doi":"10.1006/jctb.2000.1987","title":"On the Dissection of Rectangles into Right-Angled Isosceles Triangles","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"","keywords":"Isosceles triangle; Rectangle; Digraph; Generalization; Combinatorics; Mathematics; Square (algebra); Geometry; Mathematical analysis","score_opus":0.006297096261391931,"score_gpt":0.21416959232477364,"score_spread":0.2078724960633817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100494081","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.2078202,0.0009930814,0.55056036,0.0008952089,0.00070356,0.00022411492,0.0003210402,0.00047150222,0.23801099],"genre_scores_gemma":[0.5625293,0.0021868227,0.33072308,0.00061441865,0.0002779031,0.00014005498,0.0010661046,0.0006285428,0.10183377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949086,0.00012688503,0.000030373749,0.0001053678,0.00013816325,0.00010823635],"domain_scores_gemma":[0.9990416,0.0004968684,0.000076341435,0.00015692714,0.00013464036,0.00009349347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504634,0.0006234581,0.0006324481,0.0008750103,0.001110295,0.0019852994,0.0012049611,0.0008593881,0.017913578],"category_scores_gemma":[0.002587781,0.0006917488,0.00069687987,0.0007986127,0.0016179942,0.0034214535,0.0024147262,0.0023825262,0.0034484745],"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.00027336917,0.000055836997,0.0005463263,0.00013991976,0.000015357384,0.00043170864,0.00086462527,0.011547423,0.009658521,0.887864,0.0073178005,0.08128508],"study_design_scores_gemma":[0.00006460436,0.000107008804,0.00050534005,0.00009307306,0.00002198965,0.00048280307,0.0006299822,0.035223793,0.0042732633,0.9144731,0.04409065,0.000034332264],"about_ca_topic_score_codex":0.001309219,"about_ca_topic_score_gemma":0.0017151707,"teacher_disagreement_score":0.017913578,"about_ca_system_score_codex":0.00059744413,"about_ca_system_score_gemma":0.0002877152,"threshold_uncertainty_score":0.059926867},"labels":[],"label_agreement":null},{"id":"W2102110641","doi":"10.1016/j.jctb.2006.02.008","title":"Mutually embeddable graphs and the tree alternative conjecture","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Wilfrid Laurier University","funders":"Division of Mathematical Sciences","keywords":"Mathematics; Combinatorics; Conjecture; Tree (set theory); Vertex (graph theory); Discrete mathematics; Embedding; Graph; Computer science","score_opus":0.006309784519698531,"score_gpt":0.2422969169776194,"score_spread":0.23598713245792088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102110641","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.6504841,0.0017157897,0.12068984,0.016237909,0.0005845817,0.000055398777,0.0008434892,0.00045626305,0.20893268],"genre_scores_gemma":[0.9713362,0.0007139892,0.015734421,0.0008269109,0.00027258007,0.00004649006,0.00054431305,0.00008532624,0.010439735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988738,0.0003599635,0.000041986637,0.0002752715,0.00023825218,0.00021063391],"domain_scores_gemma":[0.99340254,0.0041573686,0.00057573605,0.0010934791,0.00035896548,0.0004119396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012590518,0.00045803317,0.0007984088,0.00096843956,0.0021449714,0.0037236346,0.0013849773,0.0028221835,0.012015816],"category_scores_gemma":[0.007378918,0.0006511258,0.00075053534,0.0015026812,0.0034274778,0.008657591,0.0032219419,0.0037596477,0.0011630224],"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.00009145852,0.0000311915,0.0005760308,0.00004570922,0.000009631946,0.00017898018,0.00034609728,0.0011720938,0.0005289244,0.9891261,0.002551488,0.005342278],"study_design_scores_gemma":[0.000016729413,0.0000072046655,0.0001600581,0.0000107375,0.000009234287,0.00014172614,0.00017866946,0.0024600239,0.00019766121,0.9944806,0.002330979,0.0000063123953],"about_ca_topic_score_codex":0.00082342344,"about_ca_topic_score_gemma":0.0014988384,"teacher_disagreement_score":0.012015816,"about_ca_system_score_codex":0.0007676471,"about_ca_system_score_gemma":0.0004012442,"threshold_uncertainty_score":0.040196896},"labels":[],"label_agreement":null},{"id":"W2115589427","doi":"10.1016/j.jctb.2011.07.004","title":"The disjoint paths problem in quadratic time","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Minor (academic); Combinatorics; Time complexity; Mathematics; Mathematical proof; Discrete mathematics; Computer science; Algorithm","score_opus":0.014700443154393136,"score_gpt":0.24615038814903964,"score_spread":0.2314499449946465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115589427","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.52377665,0.0059330496,0.27760884,0.035578426,0.0015052746,0.0005125385,0.0057970835,0.0022940454,0.1469941],"genre_scores_gemma":[0.79755676,0.0029012514,0.12610479,0.002233285,0.0016070965,0.00043046355,0.0055949464,0.0015084265,0.062063087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540114,0.0012899302,0.0002005296,0.0011300016,0.00087284285,0.0011055392],"domain_scores_gemma":[0.97611,0.01907307,0.0010815659,0.0015049832,0.0008385185,0.0013919522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033235948,0.0016786125,0.0037156788,0.00157924,0.0040731155,0.0073701185,0.004779017,0.0034241779,0.030617582],"category_scores_gemma":[0.022700895,0.0015027291,0.0020306034,0.004203006,0.004101832,0.018826373,0.0037235674,0.0076684393,0.002524596],"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.0028278448,0.0011487082,0.0033822835,0.0015981051,0.00036887376,0.000617218,0.0013434831,0.111761816,0.0037672934,0.68884647,0.0776092,0.106728695],"study_design_scores_gemma":[0.0003970301,0.000082962266,0.00055919006,0.000048440128,0.00008046801,0.00016743677,0.00027415212,0.09090938,0.00070760166,0.9014407,0.005304686,0.00002799014],"about_ca_topic_score_codex":0.0072124717,"about_ca_topic_score_gemma":0.011117436,"teacher_disagreement_score":0.030617582,"about_ca_system_score_codex":0.004781063,"about_ca_system_score_gemma":0.0049293004,"threshold_uncertainty_score":0.10242605},"labels":[],"label_agreement":null},{"id":"W2116039510","doi":"10.1016/j.jctb.2018.12.007","title":"Treewidth of graphs with balanced separations","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Grantová Agentura České Republiky","keywords":"Treewidth; Combinatorics; Partial k-tree; Mathematics; Graph; Clique-sum; Discrete mathematics; Chordal graph; 1-planar graph; Pathwidth; Line graph","score_opus":0.015484421120492703,"score_gpt":0.29012519452983754,"score_spread":0.27464077340934484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116039510","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.8446325,0.0016578668,0.11165598,0.0029466415,0.00016410628,0.000062015184,0.0022632102,0.0004307662,0.036186848],"genre_scores_gemma":[0.9530484,0.001394772,0.034298517,0.0005411309,0.00025637922,0.000101972044,0.0017329456,0.00026109326,0.008364778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923396,0.00017388313,0.000048625807,0.00019849029,0.00018168517,0.00016342694],"domain_scores_gemma":[0.996314,0.0020077669,0.000559872,0.00027386236,0.00037536927,0.00046924074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075591693,0.00074516033,0.0008893522,0.0017251471,0.001200089,0.004215676,0.0015907593,0.0015554901,0.009710778],"category_scores_gemma":[0.005797184,0.0008426736,0.0005159427,0.0022223853,0.0010503863,0.0060406956,0.0015280152,0.0016625884,0.0012171523],"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.0009586707,0.00019028597,0.004226825,0.0004378337,0.000086958236,0.00040854784,0.0011123178,0.015937649,0.016138475,0.9057193,0.01098925,0.043793935],"study_design_scores_gemma":[0.00007611555,0.00004260812,0.0009199304,0.00005599759,0.00004886153,0.00039283198,0.00034060658,0.027797574,0.0020157057,0.9639709,0.0043231742,0.00001566144],"about_ca_topic_score_codex":0.0007715318,"about_ca_topic_score_gemma":0.001024244,"teacher_disagreement_score":0.009710778,"about_ca_system_score_codex":0.0008857002,"about_ca_system_score_gemma":0.0006944918,"threshold_uncertainty_score":0.032485843},"labels":[],"label_agreement":null},{"id":"W2120958076","doi":"10.1016/j.jctb.2007.10.008","title":"Tangles, tree-decompositions and grids in matroids","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"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":"Tangle; Matroid; Graphic matroid; Combinatorics; Matroid partitioning; Mathematics; Tree decomposition; Grid; Graph; Tree (set theory); Order (exchange); Finite field; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.007818567983791677,"score_gpt":0.2651665826904393,"score_spread":0.25734801470664764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120958076","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.7337366,0.0034266412,0.20054357,0.0023016417,0.00034134265,0.00007715245,0.0005825575,0.00042617164,0.058564465],"genre_scores_gemma":[0.9352533,0.0017965853,0.04094493,0.00024438906,0.00031775644,0.0000742472,0.00048510625,0.0001091539,0.02077458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997322,0.000078449586,0.000020476062,0.000061740844,0.00006146853,0.00004564548],"domain_scores_gemma":[0.9978928,0.0010259049,0.000404165,0.00018850151,0.0001442346,0.00034439986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041293274,0.00041897854,0.00074501126,0.001555422,0.0013474057,0.0029564027,0.0007477426,0.00096485636,0.006244957],"category_scores_gemma":[0.0026839375,0.0006280862,0.0005679779,0.0018152108,0.0019158379,0.0036765696,0.0012436557,0.0017865637,0.0006337125],"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.00008403602,0.000039415372,0.0010929503,0.00008121524,0.000013796714,0.00015095399,0.0004343018,0.0058469344,0.0011274078,0.9757447,0.0029401942,0.012444059],"study_design_scores_gemma":[0.000016964315,0.0000145536,0.000362297,0.0000146457305,0.000008924556,0.00014352864,0.00014912282,0.00981289,0.00019068534,0.98680633,0.002472751,0.0000072766993],"about_ca_topic_score_codex":0.0011763951,"about_ca_topic_score_gemma":0.0019390788,"teacher_disagreement_score":0.006244957,"about_ca_system_score_codex":0.0006892364,"about_ca_system_score_gemma":0.00032824487,"threshold_uncertainty_score":0.020891488},"labels":[],"label_agreement":null},{"id":"W2127521998","doi":"10.1016/j.jctb.2014.02.004","title":"A base exchange property for regular matroids","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Element (criminal law); Property (philosophy); Base (topology); Combinatorics; Mathematics; Discrete mathematics; Mathematical analysis; Philosophy; Political science","score_opus":0.010447833759310764,"score_gpt":0.22570754075854352,"score_spread":0.21525970699923275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127521998","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.6409456,0.000910312,0.20439035,0.002255514,0.00042573563,0.00009991906,0.0009715061,0.0008371029,0.14916389],"genre_scores_gemma":[0.9627008,0.00048835657,0.014332287,0.00042513668,0.00040293857,0.00006520447,0.00064947444,0.0003074663,0.020628419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916255,0.0001231761,0.00006442021,0.00024379032,0.00021110289,0.00019503968],"domain_scores_gemma":[0.9966286,0.0014149027,0.0003535424,0.00071439805,0.0003059593,0.000582575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011553114,0.00066032284,0.0014245794,0.0014401369,0.0023767937,0.004726005,0.0015732214,0.0014415907,0.011040189],"category_scores_gemma":[0.0039987927,0.00074692204,0.0011532288,0.0019150176,0.0027717156,0.010022678,0.0022735125,0.003814813,0.0010871006],"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.00014620188,0.000054970413,0.00045778832,0.000050765393,0.000016718726,0.00018558321,0.0003512806,0.0007488524,0.0023593695,0.9863144,0.0015992889,0.0077148303],"study_design_scores_gemma":[0.000029385024,0.000033211458,0.0003614494,0.000017534187,0.00002455721,0.00029249772,0.00015113808,0.0028242436,0.00192083,0.99031675,0.0040132864,0.000015027277],"about_ca_topic_score_codex":0.00065047987,"about_ca_topic_score_gemma":0.0004811484,"teacher_disagreement_score":0.011040189,"about_ca_system_score_codex":0.0009431981,"about_ca_system_score_gemma":0.00046682937,"threshold_uncertainty_score":0.036933064},"labels":[],"label_agreement":null},{"id":"W2128954556","doi":"10.1016/j.jctb.2005.09.007","title":"Augmenting chains in graphs without a skew star","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Skew; Star (game theory); Computer science; Mathematics; Combinatorics; Telecommunications","score_opus":0.012703002840513162,"score_gpt":0.2792198242773306,"score_spread":0.26651682143681743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128954556","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.68723583,0.00038293112,0.2168419,0.0004778826,0.0002669605,0.0002540507,0.00054436206,0.00069304695,0.09330298],"genre_scores_gemma":[0.7910152,0.00062002125,0.16384172,0.00026465117,0.000171004,0.0002742055,0.000771693,0.0004284343,0.042613078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931455,0.00018787083,0.00005428801,0.00016805177,0.00014237472,0.00013282229],"domain_scores_gemma":[0.99579936,0.0016140734,0.00046285806,0.00094033027,0.0005109455,0.0006724376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075441034,0.00071402465,0.00089526275,0.0014145607,0.0024610911,0.00216663,0.0010277168,0.0012209284,0.014623693],"category_scores_gemma":[0.0031878718,0.00091308594,0.0009655328,0.0017005728,0.0014972342,0.003919486,0.0024631266,0.0017632733,0.0022954163],"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.00038716255,0.0002310359,0.0020844436,0.00020140858,0.00003390705,0.00062853715,0.0008191629,0.010786852,0.012912745,0.9241371,0.0030129142,0.04476474],"study_design_scores_gemma":[0.00004158074,0.00012087935,0.00061638915,0.00006781435,0.000051446186,0.00033057155,0.00034364135,0.025230693,0.0058982843,0.954752,0.012526277,0.00002036927],"about_ca_topic_score_codex":0.0006405407,"about_ca_topic_score_gemma":0.0016322379,"teacher_disagreement_score":0.014623693,"about_ca_system_score_codex":0.00044350224,"about_ca_system_score_gemma":0.0005326107,"threshold_uncertainty_score":0.048921168},"labels":[],"label_agreement":null},{"id":"W2130764977","doi":"10.1016/j.jctb.2007.11.003","title":"A weaker version of Lovász' path removal conjecture","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"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; McGill University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Graph; Existential quantification; Path (computing); Discrete mathematics; Computer science","score_opus":0.011137663498495029,"score_gpt":0.24954757915373396,"score_spread":0.23840991565523895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130764977","genre_codex":"other","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.23524025,0.0025743078,0.2122273,0.092519745,0.004536206,0.0003107268,0.0044618,0.0019821108,0.44614753],"genre_scores_gemma":[0.8685065,0.0020127401,0.035117354,0.02054475,0.004024649,0.0003148757,0.005329082,0.00064051646,0.06350951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938227,0.001121058,0.00029728038,0.0022272482,0.0015277121,0.001003996],"domain_scores_gemma":[0.97747463,0.013397251,0.0010228665,0.005391719,0.0018380578,0.0008754766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041396,0.0012699631,0.002981006,0.0019469747,0.0049039256,0.005736583,0.0053751958,0.0072371583,0.04278935],"category_scores_gemma":[0.022958986,0.0013608335,0.0032745358,0.0030188176,0.007045771,0.025709199,0.007836486,0.012245207,0.0069433386],"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.0003184953,0.00016358156,0.0011579758,0.00038506687,0.000072645176,0.00029379324,0.0005836773,0.0016793329,0.0017678943,0.949298,0.031646002,0.012633518],"study_design_scores_gemma":[0.000078417674,0.000027348815,0.00038538137,0.000028175386,0.000031405307,0.00025848742,0.00015036241,0.0029949385,0.00045185105,0.98549646,0.010074255,0.00002291954],"about_ca_topic_score_codex":0.0019812672,"about_ca_topic_score_gemma":0.0015641289,"teacher_disagreement_score":0.04278935,"about_ca_system_score_codex":0.0020420845,"about_ca_system_score_gemma":0.0016115913,"threshold_uncertainty_score":0.14314461},"labels":[],"label_agreement":null},{"id":"W2132677029","doi":"10.1016/j.jctb.2008.03.006","title":"On the odd-minor variant of Hadwiger's conjecture","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Conjecture; Graph; Discrete mathematics","score_opus":0.016178644568518676,"score_gpt":0.25031874771390306,"score_spread":0.2341401031453844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132677029","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.5869464,0.0013894357,0.08940339,0.027429067,0.0032811596,0.00011347399,0.00090490887,0.0006789293,0.28985322],"genre_scores_gemma":[0.9690634,0.0003834602,0.00851631,0.0018421595,0.0010167863,0.0000556895,0.00046823153,0.000110327266,0.018543562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986444,0.00037677263,0.00005288546,0.0003038224,0.0002483096,0.00037385587],"domain_scores_gemma":[0.9961061,0.0018975693,0.00029610092,0.0008776887,0.00040150151,0.00042094896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020765106,0.00080113637,0.0016477447,0.0011438413,0.0032843626,0.0035015813,0.0021854131,0.0024572485,0.010069675],"category_scores_gemma":[0.0077714305,0.0004897096,0.0011914695,0.0013912393,0.005944092,0.007000951,0.003550371,0.0049551534,0.0014057403],"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.00013442682,0.000030403198,0.0004986015,0.00003073941,0.000008438848,0.00015233165,0.00020098459,0.0008934843,0.00038585675,0.9894174,0.00501352,0.0032337336],"study_design_scores_gemma":[0.000024349703,0.000007695785,0.00012612509,0.0000057179036,0.0000039249217,0.000049620838,0.000046729074,0.0018686417,0.000108865956,0.9963444,0.0014063991,0.0000074411632],"about_ca_topic_score_codex":0.0028938488,"about_ca_topic_score_gemma":0.0023115065,"teacher_disagreement_score":0.010069675,"about_ca_system_score_codex":0.001684472,"about_ca_system_score_gemma":0.001116898,"threshold_uncertainty_score":0.0336864},"labels":[],"label_agreement":null},{"id":"W2134453562","doi":"10.1016/j.jctb.2019.07.001","title":"On Frank's conjecture on k-connected orientations","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Conjecture; Combinatorics; Vertex (graph theory); Orientation (vector space); Graph; Mathematics; Strongly connected component; Discrete mathematics; Geometry","score_opus":0.013716950753505304,"score_gpt":0.2898674251964509,"score_spread":0.2761504744429456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134453562","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.525112,0.0022368254,0.06271986,0.03285051,0.0023246321,0.00014259925,0.002715819,0.0010244362,0.37087336],"genre_scores_gemma":[0.9473996,0.0013554075,0.01504486,0.0027684153,0.0010925147,0.00010976848,0.001616646,0.0001982938,0.03041441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870884,0.00020531568,0.000064256434,0.00041630128,0.00023882018,0.00036646568],"domain_scores_gemma":[0.9962997,0.0022086625,0.00026616754,0.00047321376,0.00039280704,0.0003595869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014022026,0.0010228242,0.0018702673,0.0025111244,0.0039855926,0.005006342,0.0021340826,0.003873243,0.019839413],"category_scores_gemma":[0.0071620224,0.0010493717,0.0013662298,0.0030266622,0.0058763647,0.013185865,0.0039270422,0.0053589405,0.0026228738],"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.00017171369,0.000054405642,0.0008017948,0.000098986675,0.000011633625,0.00015995145,0.0004478155,0.0012739114,0.00043958827,0.97913367,0.0099578025,0.0074487734],"study_design_scores_gemma":[0.00003487736,0.000014113086,0.00041358906,0.000033936183,0.000015105536,0.00015382012,0.00033409067,0.002267175,0.0003021453,0.98999804,0.0064134495,0.000019624018],"about_ca_topic_score_codex":0.0038093587,"about_ca_topic_score_gemma":0.0032240301,"teacher_disagreement_score":0.019839413,"about_ca_system_score_codex":0.0021595305,"about_ca_system_score_gemma":0.00087372016,"threshold_uncertainty_score":0.066369414},"labels":[],"label_agreement":null},{"id":"W2135081210","doi":"10.1016/s0095-8956(02)00023-0","title":"Bounds for mean colour numbers of graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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":"Combinatorics; Mathematics; Conjecture; Counterexample; Graph; Discrete mathematics; Split graph; Vertex (graph theory); Chordal graph; 1-planar graph","score_opus":0.014415090368387347,"score_gpt":0.2835429309123682,"score_spread":0.26912784054398087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135081210","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.2880812,0.0131384,0.55539787,0.015164257,0.0016007588,0.00021812762,0.0019794602,0.0027617526,0.121658124],"genre_scores_gemma":[0.8501913,0.006436295,0.11422934,0.0023408937,0.002895808,0.0007433338,0.001267195,0.0018168961,0.020078983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995613,0.001132348,0.00017266978,0.0011777397,0.0010701361,0.0008339734],"domain_scores_gemma":[0.91274595,0.06917462,0.0032118312,0.006553191,0.0036284956,0.0046859146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071479953,0.0026027088,0.0031699375,0.008015322,0.0036691574,0.009546645,0.0076243626,0.0038527711,0.013041636],"category_scores_gemma":[0.060056657,0.002395485,0.002519433,0.004893837,0.007900838,0.0155537855,0.0066145877,0.011213209,0.0020221956],"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.0007357644,0.00018352599,0.0032437248,0.0006214931,0.00013964636,0.000113436676,0.0009924415,0.028208463,0.007730606,0.91295624,0.014162402,0.03091232],"study_design_scores_gemma":[0.00003559291,0.000044653814,0.0015139955,0.00011686906,0.00008195223,0.00014144974,0.00010580798,0.046043478,0.0017214464,0.9465664,0.003561722,0.00006654618],"about_ca_topic_score_codex":0.001722331,"about_ca_topic_score_gemma":0.0034763059,"teacher_disagreement_score":0.013041636,"about_ca_system_score_codex":0.0077096643,"about_ca_system_score_gemma":0.0017225024,"threshold_uncertainty_score":0.055937827},"labels":[],"label_agreement":null},{"id":"W2138481685","doi":"10.1016/s0095-8956(02)00010-2","title":"Disjoint cocircuits in matroids with large rank","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"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":"Matroid; Combinatorics; Disjoint sets; Rank (graph theory); Mathematics; Integer (computer science); Discrete mathematics; Graphic matroid; Class (philosophy); Minor (academic); Computer science; Artificial intelligence","score_opus":0.008969961233094159,"score_gpt":0.2537563941132656,"score_spread":0.24478643288017146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138481685","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.8566274,0.0011329863,0.09980573,0.0019682567,0.00018789637,0.000119117976,0.00067447935,0.00072479586,0.038759362],"genre_scores_gemma":[0.95350415,0.00051278836,0.029586246,0.00036239022,0.00023133727,0.00011971647,0.0005450913,0.0002154919,0.014922795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989121,0.0003165146,0.00006684265,0.00019701253,0.0002961827,0.00021140714],"domain_scores_gemma":[0.9901661,0.0057640644,0.0015708382,0.0005977279,0.0006288043,0.0012724991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086701394,0.00077736744,0.0013232442,0.0024477653,0.0021754547,0.004538093,0.0018226148,0.0021191007,0.009307696],"category_scores_gemma":[0.007363434,0.0012635605,0.0006958353,0.002297796,0.0023556554,0.00486298,0.002226499,0.0022574316,0.0010554342],"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.00037494386,0.0001291605,0.0015592148,0.00019031262,0.00003807774,0.00048344367,0.00050705136,0.00846838,0.0045029754,0.96247756,0.0060122325,0.015256566],"study_design_scores_gemma":[0.00012553547,0.00009058655,0.0007108851,0.000041763764,0.000048897804,0.0006647352,0.0003898577,0.045948066,0.00246522,0.9455884,0.0038931225,0.00003292883],"about_ca_topic_score_codex":0.0013808307,"about_ca_topic_score_gemma":0.0025700966,"teacher_disagreement_score":0.009307696,"about_ca_system_score_codex":0.0011972185,"about_ca_system_score_gemma":0.0005476627,"threshold_uncertainty_score":0.031137288},"labels":[],"label_agreement":null},{"id":"W2139284584","doi":"10.1016/j.jctb.2005.09.002","title":"On the extreme eigenvalues of regular graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Integer (computer science); Strongly regular graph; Graph; Discrete mathematics; Constant (computer programming); Pure mathematics; Pathwidth; Physics; Quantum mechanics; Line graph; Computer science","score_opus":0.03740442633194699,"score_gpt":0.2765691128428439,"score_spread":0.23916468651089692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139284584","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.74393535,0.0020899614,0.1346864,0.004253764,0.00087242544,0.000054515254,0.00020115158,0.00040430302,0.11350218],"genre_scores_gemma":[0.97483677,0.0009843839,0.010033488,0.0003509825,0.0006980613,0.000039357594,0.00012087597,0.0001375427,0.012798469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949896,0.00016704186,0.000017627417,0.00007296202,0.00015015762,0.000093243165],"domain_scores_gemma":[0.99770373,0.0012021943,0.00028124632,0.00017563559,0.00027349684,0.00036358164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007543011,0.0007262525,0.00093525613,0.0025860427,0.0014786286,0.0022179952,0.0010901231,0.001393878,0.0068103755],"category_scores_gemma":[0.0051052454,0.00048109936,0.00048105896,0.001104996,0.0029942465,0.0030871462,0.0015793022,0.0019599183,0.00077105954],"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.000079273006,0.000044141267,0.0003985529,0.000054010332,0.000012648711,0.0001865187,0.00035973184,0.005431227,0.001983096,0.9805562,0.0032956572,0.0075988374],"study_design_scores_gemma":[0.000011737281,0.000009677926,0.00027124496,0.000016017797,0.0000035912844,0.000099821715,0.00012624473,0.011556906,0.0002115813,0.9868663,0.00081553735,0.000011321625],"about_ca_topic_score_codex":0.00058085105,"about_ca_topic_score_gemma":0.0006925519,"teacher_disagreement_score":0.0068103755,"about_ca_system_score_codex":0.0006636891,"about_ca_system_score_gemma":0.00027283555,"threshold_uncertainty_score":0.022782922},"labels":[],"label_agreement":null},{"id":"W2140619995","doi":"10.1016/s0095-8956(03)00037-6","title":"Crossing-number critical graphs have bounded path-width","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Combinatorics; Crossing number (knot theory); Bounded function; Mathematics; 1-planar graph; Subdivision; Pathwidth; Embedding; Book embedding; Discrete mathematics; Planar graph; Graph; Assertion; Chordal graph; Line graph; Computer science","score_opus":0.010836903398999743,"score_gpt":0.2721763294949098,"score_spread":0.26133942609591004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140619995","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.8178373,0.0008171448,0.14591393,0.0008292044,0.000102379796,0.00010734591,0.00066585315,0.0012837758,0.032442972],"genre_scores_gemma":[0.9661538,0.0004285672,0.02630284,0.00020098996,0.00006217377,0.00011162308,0.00053340604,0.0003723144,0.0058342284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940753,0.000081456215,0.00002866246,0.00016200925,0.00015812174,0.00016220496],"domain_scores_gemma":[0.9875995,0.007450314,0.0013851847,0.001223773,0.0008174862,0.0015236654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009201768,0.0012143325,0.0011937477,0.0033952906,0.0019225074,0.0036081946,0.001996633,0.0016485952,0.009172131],"category_scores_gemma":[0.010120987,0.0013992025,0.00068585697,0.002044135,0.0023853579,0.0054952,0.0020628143,0.0025550192,0.0008059695],"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.000734359,0.00016900698,0.0041579027,0.00030262023,0.00007103164,0.00048593257,0.0007719774,0.033665992,0.022040384,0.9060816,0.0052281255,0.02629098],"study_design_scores_gemma":[0.000093873925,0.00007485495,0.0015913104,0.000057515525,0.00006946542,0.00058428926,0.0003011923,0.06321635,0.01008903,0.92071515,0.00316712,0.00003987964],"about_ca_topic_score_codex":0.00066813314,"about_ca_topic_score_gemma":0.0010439557,"teacher_disagreement_score":0.009172131,"about_ca_system_score_codex":0.0012532251,"about_ca_system_score_gemma":0.0005997113,"threshold_uncertainty_score":0.030683875},"labels":[],"label_agreement":null},{"id":"W2143815444","doi":"10.1016/j.jctb.2006.10.001","title":"Paths with two blocks in n-chromatic digraphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Computer science; Mathematics; Combinatorics","score_opus":0.006015535670932735,"score_gpt":0.24470165430450055,"score_spread":0.2386861186335678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143815444","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.75321996,0.0004426522,0.09335651,0.0012584932,0.00023105106,0.00045064892,0.0026476334,0.0006517241,0.14774123],"genre_scores_gemma":[0.8309686,0.000586813,0.07835879,0.00043057505,0.00005170388,0.00043783514,0.0024523954,0.00025096905,0.08646235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994235,0.00011806863,0.000033273293,0.0001354402,0.00011323568,0.00017657978],"domain_scores_gemma":[0.997692,0.00097341504,0.00025089696,0.0002281101,0.0002207386,0.0006348228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039051674,0.00065436383,0.00067779724,0.0014847661,0.0031487648,0.003075203,0.0014630021,0.0015915092,0.020587739],"category_scores_gemma":[0.0019204088,0.0011261775,0.00058234384,0.0020120705,0.001315473,0.0030704674,0.0018710884,0.0018379163,0.0028679466],"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.0007800443,0.00037540577,0.0030952909,0.00037225385,0.000089009074,0.0011550917,0.0013780252,0.012849276,0.014125262,0.9286232,0.011971743,0.025185416],"study_design_scores_gemma":[0.0004121808,0.00020022521,0.0041543655,0.00018054235,0.0001782852,0.00081058353,0.0015054174,0.05222367,0.007160849,0.8872546,0.045827445,0.00009176276],"about_ca_topic_score_codex":0.0072202533,"about_ca_topic_score_gemma":0.016873613,"teacher_disagreement_score":0.020587739,"about_ca_system_score_codex":0.0019266694,"about_ca_system_score_gemma":0.0013494766,"threshold_uncertainty_score":0.06887287},"labels":[],"label_agreement":null},{"id":"W2152427009","doi":"10.1006/jctb.2002.2110","title":"Asymptotically the List Colouring Constants Are 1","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","score_opus":0.02972296561971398,"score_gpt":0.26133577630400334,"score_spread":0.23161281068428935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152427009","genre_codex":"other","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.2537272,0.0049142824,0.18168125,0.025525007,0.0026586559,0.00020764799,0.002337658,0.009310057,0.5196382],"genre_scores_gemma":[0.8601348,0.001832274,0.02558041,0.004379681,0.0018751061,0.00041575546,0.0012955457,0.001633919,0.10285257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691784,0.000738647,0.00010195228,0.00086368277,0.0008171976,0.00056066754],"domain_scores_gemma":[0.9798023,0.011766572,0.0013344747,0.0038779415,0.0021111465,0.0011074964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021347185,0.0014087335,0.0022434955,0.0035662348,0.0043898704,0.009320661,0.004729738,0.0063838703,0.047116995],"category_scores_gemma":[0.030848462,0.0016840134,0.0010192727,0.0024721657,0.0045604627,0.023451565,0.0031327798,0.007969169,0.008019505],"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.00008088207,0.0000659633,0.0007809828,0.00021085601,0.00001883243,0.00004397574,0.00022989161,0.0013261117,0.0015419252,0.96976715,0.010040516,0.01589298],"study_design_scores_gemma":[0.000024628884,0.000014983915,0.00076915516,0.000063613865,0.00002499136,0.00023235724,0.00013865148,0.006037301,0.0010398539,0.98349494,0.008127223,0.00003220122],"about_ca_topic_score_codex":0.0017459356,"about_ca_topic_score_gemma":0.00257971,"teacher_disagreement_score":0.047116995,"about_ca_system_score_codex":0.0036000009,"about_ca_system_score_gemma":0.0019455623,"threshold_uncertainty_score":0.15762204},"labels":[],"label_agreement":null},{"id":"W2160639448","doi":"10.1016/j.jctb.2005.02.006","title":"A polynomial recognition algorithm for balanced matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"Modulo; Combinatorics; Matrix (chemical analysis); Polynomial; Square (algebra); Mathematics; Matrix polynomial; Polynomial matrix; Column (typography); Algorithm; Discrete mathematics","score_opus":0.0069574814401236005,"score_gpt":0.2074521148175733,"score_spread":0.20049463337744972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160639448","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.049010303,0.00029738797,0.9330346,0.0006501534,0.00014623778,0.00019634918,0.00063104095,0.0048303003,0.011203655],"genre_scores_gemma":[0.2747395,0.00032373736,0.70532244,0.00039405806,0.00015916176,0.00032756786,0.0033851354,0.00071704027,0.014631332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998898,0.0001283222,0.00007497613,0.0003770308,0.00026811397,0.00025338976],"domain_scores_gemma":[0.99815875,0.0006574447,0.00012884996,0.00054017757,0.00038147246,0.00013327495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057771,0.0010201023,0.0011416537,0.0011051365,0.0011810333,0.0023640953,0.0019261478,0.0015083101,0.012034805],"category_scores_gemma":[0.0034686052,0.0006992422,0.0009418269,0.0017656476,0.000634585,0.004576331,0.0024818222,0.0019521818,0.006014114],"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.0009933097,0.00049792416,0.0010134586,0.0002374101,0.000051745734,0.00014938353,0.00025139123,0.032217797,0.04601656,0.06972508,0.0327174,0.8161286],"study_design_scores_gemma":[0.00050137384,0.00042480737,0.0009809755,0.000079005265,0.000089234374,0.0005503511,0.00025318709,0.6794631,0.04429999,0.24697763,0.026278192,0.00010218563],"about_ca_topic_score_codex":0.0033930552,"about_ca_topic_score_gemma":0.003990312,"teacher_disagreement_score":0.012034805,"about_ca_system_score_codex":0.0012536771,"about_ca_system_score_gemma":0.0018447206,"threshold_uncertainty_score":0.040260434},"labels":[],"label_agreement":null},{"id":"W2161005000","doi":"10.1016/j.jctb.2007.02.005","title":"Excluding a planar graph from<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">GF</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-representable matroids","year":2007,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"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":"Matroid; Scroll; Graphic matroid; Combinatorics; Antichain; Matroid partitioning; Mathematics; Oriented matroid; Binary number; Graph; Planar graph; Discrete mathematics; Partially ordered set; Arithmetic","score_opus":0.01835145302768177,"score_gpt":0.259835901032013,"score_spread":0.24148444800433122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161005000","genre_codex":"other","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.085531995,0.00046494533,0.289151,0.0058822962,0.0014294554,0.00038470366,0.012065197,0.007599636,0.5974907],"genre_scores_gemma":[0.42819288,0.001225529,0.18661264,0.0017383088,0.00048996217,0.0002992949,0.032240957,0.0045753634,0.34462506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971455,0.000040026287,0.000017947803,0.00007251703,0.000087900815,0.000066945875],"domain_scores_gemma":[0.9990785,0.00028554918,0.00010018146,0.0002402431,0.00021671229,0.00007871534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018167325,0.00079403317,0.00047491357,0.0007505986,0.0012518776,0.0021979786,0.00096135575,0.00090239244,0.073117636],"category_scores_gemma":[0.001825931,0.00037337912,0.0006888634,0.0012598293,0.00076162367,0.002702668,0.0014690744,0.001772303,0.0266673],"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.0005558661,0.0001676357,0.001058341,0.00063250214,0.00005093396,0.0013748133,0.0005913443,0.0045380695,0.02469347,0.5099541,0.25605395,0.200329],"study_design_scores_gemma":[0.00009368846,0.00010347142,0.0017187477,0.00014201563,0.00006018691,0.0014952339,0.0003232238,0.012314855,0.035423473,0.37351444,0.57475144,0.000059123184],"about_ca_topic_score_codex":0.0029301278,"about_ca_topic_score_gemma":0.0040316638,"teacher_disagreement_score":0.073117636,"about_ca_system_score_codex":0.0007771494,"about_ca_system_score_gemma":0.0008752158,"threshold_uncertainty_score":0.24460286},"labels":[],"label_agreement":null},{"id":"W2161040448","doi":"10.1016/j.jctb.2010.09.001","title":"The edge-density for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math> minors","year":2010,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Combinatorics; Bipartite graph; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.015482498417395539,"score_gpt":0.2446875353190324,"score_spread":0.22920503690163685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161040448","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.08757368,0.0028364577,0.5347022,0.004629516,0.0011569082,0.00026840597,0.015949698,0.0034512742,0.34943193],"genre_scores_gemma":[0.6612852,0.0038562894,0.17424117,0.001162667,0.0013871234,0.00066592306,0.014825697,0.004215797,0.13836014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992405,0.0001593953,0.000038177644,0.00019389889,0.00026133712,0.00010657857],"domain_scores_gemma":[0.99591225,0.002125199,0.00027517584,0.000529299,0.0008544527,0.00030359457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000983505,0.00072351494,0.00065554766,0.0029678985,0.00138426,0.0030322298,0.0019660795,0.0011281854,0.06797997],"category_scores_gemma":[0.011289154,0.00048093035,0.0006792552,0.0021740154,0.0013802107,0.0049229776,0.0015008543,0.0021308174,0.014267496],"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.0001005938,0.00006581919,0.0016186982,0.00026230665,0.000022257866,0.00010708666,0.00030642387,0.003867791,0.001581754,0.8362569,0.10698389,0.048826516],"study_design_scores_gemma":[0.00002270606,0.000031379786,0.0032710154,0.00014600229,0.000029314997,0.0006832201,0.00021729562,0.030872483,0.0030461429,0.8782838,0.08335227,0.00004433906],"about_ca_topic_score_codex":0.0021026945,"about_ca_topic_score_gemma":0.0024355345,"teacher_disagreement_score":0.06797997,"about_ca_system_score_codex":0.0015254521,"about_ca_system_score_gemma":0.0007818137,"threshold_uncertainty_score":0.22741562},"labels":[],"label_agreement":null},{"id":"W2162051090","doi":"10.1016/j.jctb.2005.09.005","title":"On Rota's conjecture and excluded minors containing large projective geometries","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Matroid; Conjecture; Projective test; Projective plane; Combinatorics; Projective geometry; Mathematics; Class (philosophy); Finite geometry; Projective space; Pure mathematics; Algebraic geometry; Geometry; Computer science; Art; Artificial intelligence; Humanities","score_opus":0.010669057554638726,"score_gpt":0.2770127638668002,"score_spread":0.2663437063121615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162051090","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.65853137,0.00266041,0.073801905,0.021596419,0.0013416259,0.00018566358,0.0016904587,0.0010698327,0.23912232],"genre_scores_gemma":[0.96241206,0.0010991796,0.014039884,0.001787706,0.0013734611,0.00016106594,0.0019244567,0.00023988869,0.016962292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730116,0.0008404995,0.00015752055,0.0007019355,0.00049902825,0.00049996714],"domain_scores_gemma":[0.98724943,0.008468056,0.0012211119,0.001552725,0.00057866256,0.00093003217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458481,0.0014172494,0.0033320845,0.0024709112,0.00662519,0.0072999476,0.0033056727,0.0048663616,0.015085368],"category_scores_gemma":[0.012997586,0.0016772544,0.0022685132,0.0031622115,0.009108083,0.016986879,0.006592726,0.00641046,0.002187174],"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.00017613322,0.000058473564,0.0010268089,0.00010771275,0.00001721955,0.00023139847,0.00060544215,0.0011916759,0.0004969324,0.9869915,0.005742514,0.0033540986],"study_design_scores_gemma":[0.0000465355,0.000017381552,0.000331196,0.000017675487,0.000010603255,0.00017283755,0.00018576001,0.002078033,0.00015898005,0.9942754,0.002690505,0.000015182436],"about_ca_topic_score_codex":0.0019370873,"about_ca_topic_score_gemma":0.0020896213,"teacher_disagreement_score":0.015085368,"about_ca_system_score_codex":0.0016862346,"about_ca_system_score_gemma":0.0009188639,"threshold_uncertainty_score":0.050465584},"labels":[],"label_agreement":null},{"id":"W2162598482","doi":"10.1006/jctb.2000.1963","title":"The Excluded Minors for GF(4)-Representable Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":105,"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":"Matroid; Combinatorics; GF(2); Mathematics; Computer science; Finite field","score_opus":0.012505341486421347,"score_gpt":0.28252195724150875,"score_spread":0.2700166157550874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162598482","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.8585911,0.00038796783,0.07593228,0.0016875729,0.00023652258,0.00016623613,0.00082313846,0.0004146151,0.06176061],"genre_scores_gemma":[0.9546766,0.0002922558,0.023076186,0.00029554407,0.00028561807,0.0001524661,0.0009476266,0.00015874102,0.0201149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991648,0.00022759182,0.00005973344,0.00013087995,0.00023373097,0.00018340297],"domain_scores_gemma":[0.9971468,0.0013066757,0.00052500877,0.0003558925,0.0003055957,0.0003599702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006375524,0.0007116375,0.0006453807,0.0010286572,0.0020028166,0.0034938282,0.0009849342,0.00096729695,0.008137376],"category_scores_gemma":[0.0034577518,0.00057679723,0.0008254475,0.00098887,0.0014626154,0.0025348486,0.0012065191,0.0019085204,0.0014842588],"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.0010287847,0.0003665131,0.0017617241,0.00022362891,0.00005446188,0.0010104523,0.0014164547,0.0063179573,0.01975863,0.9165276,0.011514209,0.040019576],"study_design_scores_gemma":[0.00012118682,0.00014224972,0.00088365504,0.000033118944,0.000030422416,0.00074614416,0.00028028412,0.018965367,0.0050340747,0.9630213,0.010708192,0.00003405103],"about_ca_topic_score_codex":0.00073306303,"about_ca_topic_score_gemma":0.0012877482,"teacher_disagreement_score":0.008137376,"about_ca_system_score_codex":0.0008212896,"about_ca_system_score_gemma":0.0007318946,"threshold_uncertainty_score":0.027222216},"labels":[],"label_agreement":null},{"id":"W2167749725","doi":"10.1016/j.jctb.2015.05.004","title":"Trees, ladders and graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"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 Toronto","funders":"","keywords":"Uncountable set; Mathematics; Combinatorics; Chromatic scale; Construct (python library); Discrete mathematics; Computer science; Countable set","score_opus":0.03221105724628146,"score_gpt":0.29962886522785925,"score_spread":0.26741780798157777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167749725","genre_codex":"other","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.19587982,0.18734099,0.16216488,0.035817403,0.003480491,0.00006864829,0.00084400043,0.0004637228,0.41394007],"genre_scores_gemma":[0.87013495,0.03791741,0.02559128,0.0024703809,0.004116526,0.000101075435,0.0003821928,0.00009669589,0.059189554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999574,0.00017381333,0.00002870619,0.00006803733,0.000109095374,0.00004624749],"domain_scores_gemma":[0.9985191,0.00089455035,0.00018539013,0.00013416105,0.00013675548,0.00013010803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079966936,0.00048676622,0.00081526814,0.0030000727,0.0018833714,0.0060194465,0.00086973776,0.002058731,0.009380043],"category_scores_gemma":[0.0032182396,0.0006001147,0.0004091439,0.004276324,0.006562002,0.008005644,0.0013216716,0.0026974846,0.0008799755],"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.000005164874,0.000006138829,0.00013154493,0.000026784908,0.0000028714824,0.000013807019,0.00016556538,0.00028789326,0.000067898014,0.99402976,0.001984107,0.0032784215],"study_design_scores_gemma":[0.0000032162652,0.0000019481197,0.00009032467,0.000009576899,0.0000023155023,0.000025110665,0.00007383286,0.0003405266,0.000012023275,0.9932116,0.006226696,0.0000027941717],"about_ca_topic_score_codex":0.003080898,"about_ca_topic_score_gemma":0.0042913896,"teacher_disagreement_score":0.009380043,"about_ca_system_score_codex":0.0016642079,"about_ca_system_score_gemma":0.000708889,"threshold_uncertainty_score":0.031379342},"labels":[],"label_agreement":null},{"id":"W2171207326","doi":"10.1016/j.jctb.2014.12.006","title":"Representability of matroids with a large projective geometry minor","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","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 Waterloo","funders":"Office of Naval Research","keywords":"Matroid; Prime power; Rank (graph theory); Oriented matroid; Integer (computer science); Projective geometry; Prime (order theory); Order (exchange)","score_opus":0.021755493012433003,"score_gpt":0.31108328658130413,"score_spread":0.2893277935688711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171207326","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.8818595,0.00019054666,0.06998125,0.0017697336,0.00010448645,0.00006093084,0.00062745047,0.00039991157,0.045006115],"genre_scores_gemma":[0.9832698,0.000100645666,0.007652528,0.00013897633,0.00022595507,0.000041526393,0.0004975505,0.000088875415,0.007984059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873096,0.0003150245,0.000070802445,0.0003285554,0.00031343714,0.00024113145],"domain_scores_gemma":[0.99582386,0.0018088919,0.00075459934,0.0006091649,0.00033807298,0.0006653161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095887994,0.00085821346,0.0013373449,0.0013318121,0.0018829796,0.0058244946,0.0021786657,0.0016989707,0.0105042765],"category_scores_gemma":[0.0039813584,0.0008442855,0.001253212,0.0013071701,0.0031099294,0.0056272657,0.0026634359,0.002954507,0.0009388805],"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.00012385416,0.00007090545,0.0006109885,0.00003270891,0.000018871846,0.00018481865,0.00039766484,0.0019529129,0.002038592,0.9907417,0.0011965415,0.0026304366],"study_design_scores_gemma":[0.0000480383,0.00004991845,0.0005849504,0.0000074889854,0.000018608654,0.0002820943,0.000134513,0.013911179,0.00095491257,0.98260653,0.0013824994,0.000019275365],"about_ca_topic_score_codex":0.0007252255,"about_ca_topic_score_gemma":0.00071140757,"teacher_disagreement_score":0.0105042765,"about_ca_system_score_codex":0.0013608459,"about_ca_system_score_gemma":0.0005068062,"threshold_uncertainty_score":0.035140276},"labels":[],"label_agreement":null},{"id":"W2188204494","doi":"10.1016/j.jctb.2015.06.002","title":"On the crossing number of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math>","year":2015,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Parity (physics); Simple (philosophy); Mathematics; Discrete mathematics; Computer science; Combinatorics; Physics; Theology; Particle physics; Philosophy","score_opus":0.01957744043638374,"score_gpt":0.2515529048650365,"score_spread":0.23197546442865277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188204494","genre_codex":"other","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.2784386,0.0030184388,0.34554622,0.0033853047,0.0016773415,0.00012272352,0.002580445,0.0014404664,0.36379045],"genre_scores_gemma":[0.87897724,0.0021431907,0.06780069,0.0006073531,0.0007009484,0.00014608593,0.002405685,0.0016200107,0.0455987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991097,0.0002121373,0.000042442516,0.00025020784,0.0002410203,0.00014443045],"domain_scores_gemma":[0.9929783,0.004245884,0.0006219429,0.00060350756,0.0008624499,0.0006879887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017059223,0.00083414745,0.0007496146,0.004343314,0.0012473678,0.003465786,0.0018883033,0.0012627905,0.030764053],"category_scores_gemma":[0.013924334,0.00038877074,0.0007100723,0.0019406473,0.0024803092,0.004009265,0.0019171897,0.0031432873,0.0042427354],"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.00023322462,0.00006158022,0.002926602,0.00019227376,0.000030607585,0.00017778735,0.00035467403,0.014541232,0.0029267713,0.9104789,0.022644116,0.045432348],"study_design_scores_gemma":[0.000027404512,0.000058772264,0.0041606743,0.00020591743,0.0000482081,0.00053855754,0.0002682081,0.09013047,0.0042554685,0.87857693,0.02166764,0.00006177552],"about_ca_topic_score_codex":0.0018779945,"about_ca_topic_score_gemma":0.002248888,"teacher_disagreement_score":0.030764053,"about_ca_system_score_codex":0.0018852556,"about_ca_system_score_gemma":0.00069705525,"threshold_uncertainty_score":0.102916},"labels":[],"label_agreement":null},{"id":"W2204554537","doi":"10.1016/j.jctb.2016.11.001","title":"Small cores in 3-uniform hypergraphs","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Conjecture; Mathematics; Set (abstract data type); Core (optical fiber); Discrete mathematics; Computer science","score_opus":0.03283367440446975,"score_gpt":0.27851336671257326,"score_spread":0.24567969230810352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204554537","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.82730865,0.0012969873,0.09138803,0.0014306994,0.00017311858,0.00007016537,0.00038691942,0.00035165338,0.0775937],"genre_scores_gemma":[0.96739566,0.0005085291,0.015492629,0.0003514475,0.00019412459,0.000104267936,0.0002866951,0.00018918478,0.015477495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999316,0.00024461592,0.000039154,0.00014814352,0.00014472903,0.00010730555],"domain_scores_gemma":[0.9965043,0.0019271295,0.00052307226,0.00023462097,0.00029299583,0.0005179414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008050277,0.00064071047,0.0010821259,0.0022089814,0.0018993564,0.004036308,0.001432568,0.0014560963,0.008382439],"category_scores_gemma":[0.0052788295,0.0008288327,0.0006484619,0.001512736,0.0027864936,0.005415975,0.0024121327,0.0020219984,0.00076938496],"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.00006308158,0.00002779932,0.00050119375,0.000051672156,0.000008166667,0.00011402451,0.00028376083,0.0015091193,0.00080948847,0.9920237,0.0011608349,0.0034472719],"study_design_scores_gemma":[0.000015442694,0.000007806194,0.00024332461,0.000018521108,0.0000076220554,0.00009786003,0.000114076036,0.0073167235,0.00029420806,0.9909512,0.0009277718,0.0000054645166],"about_ca_topic_score_codex":0.0009616566,"about_ca_topic_score_gemma":0.0015186585,"teacher_disagreement_score":0.008382439,"about_ca_system_score_codex":0.0011546644,"about_ca_system_score_gemma":0.00038057344,"threshold_uncertainty_score":0.028042078},"labels":[],"label_agreement":null},{"id":"W2226875859","doi":"10.1016/j.jctb.2017.04.001","title":"Tournaments, 4-uniform hypergraphs, and an exact extremal result","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","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 Manitoba","funders":"","keywords":"Connection (principal bundle); Combinatorics; Mathematics; Quadratic equation; Set (abstract data type); Subject (documents); Discrete mathematics; Computer science; Geometry","score_opus":0.0358942755046791,"score_gpt":0.32392821689909135,"score_spread":0.28803394139441224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226875859","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.73361117,0.003218067,0.08801276,0.0057619642,0.00039984265,0.00003783927,0.00044866174,0.0002813018,0.1682284],"genre_scores_gemma":[0.9766812,0.00080455595,0.008242444,0.00065374543,0.00038192174,0.00003858303,0.00025523687,0.000063559906,0.01287882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992551,0.00021266389,0.00004155987,0.0001487052,0.0001796319,0.00016232523],"domain_scores_gemma":[0.99791056,0.0010487494,0.00028295285,0.00022264701,0.00018101574,0.00035399516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151885,0.00069413445,0.0010708169,0.0021965182,0.0028125807,0.0045769005,0.00195929,0.0021154708,0.009897765],"category_scores_gemma":[0.004448734,0.0006363492,0.0009196694,0.0021359427,0.0030500004,0.0058338316,0.0029442878,0.0031401077,0.00066206645],"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.00004183389,0.000029940362,0.0004338856,0.000037732407,0.000012964035,0.0000867413,0.00013106891,0.0011456017,0.0003762301,0.99347407,0.0014304679,0.0027995105],"study_design_scores_gemma":[0.000011843934,0.0000061432047,0.00020345906,0.000008753448,0.000009013346,0.00006993718,0.000062056366,0.0039071813,0.00012420726,0.9948578,0.00073371315,0.0000057815614],"about_ca_topic_score_codex":0.00095254194,"about_ca_topic_score_gemma":0.0012161812,"teacher_disagreement_score":0.009897765,"about_ca_system_score_codex":0.001467231,"about_ca_system_score_gemma":0.00043791698,"threshold_uncertainty_score":0.033111334},"labels":[],"label_agreement":null},{"id":"W223802390","doi":"10.1016/j.jctb.2015.12.006","title":"Three-edge-colouring doublecross cubic graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Cubic graph; Planar graph; Mathematics; Graph minor; Petersen graph; Vertex (graph theory); Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.016231280750028027,"score_gpt":0.27468993591215546,"score_spread":0.2584586551621274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W223802390","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.79767317,0.00036207552,0.07738523,0.0010103433,0.0003407414,0.00012734736,0.0009794891,0.00067248906,0.12144908],"genre_scores_gemma":[0.9324551,0.00031282083,0.033400096,0.00043722044,0.0000643155,0.000077490266,0.0008954957,0.00020602951,0.032151356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995832,0.00006868605,0.00002097887,0.000082730396,0.00011751846,0.00012689615],"domain_scores_gemma":[0.9986457,0.0003466511,0.0001639381,0.00025180276,0.00027606482,0.0003157887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043944,0.00056998554,0.00064478896,0.0011035096,0.0022390042,0.0021675404,0.0013767069,0.0012193943,0.0107192835],"category_scores_gemma":[0.0014835981,0.00047016022,0.0005339139,0.0012024518,0.0012779782,0.001422573,0.0019111753,0.0019601972,0.0014298537],"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.0007739888,0.0003232104,0.003737037,0.0004399528,0.00007006159,0.0019062479,0.0011977796,0.02153139,0.04455556,0.8319927,0.014439268,0.079032786],"study_design_scores_gemma":[0.0002507983,0.00016800508,0.0050118035,0.00013894188,0.00012293577,0.0014365318,0.0011726671,0.0636764,0.02135325,0.8647692,0.041762207,0.00013726606],"about_ca_topic_score_codex":0.0057583298,"about_ca_topic_score_gemma":0.009827151,"teacher_disagreement_score":0.0107192835,"about_ca_system_score_codex":0.0010794685,"about_ca_system_score_gemma":0.001119004,"threshold_uncertainty_score":0.035859525},"labels":[],"label_agreement":null},{"id":"W2254274951","doi":"10.1016/j.jctb.2016.05.010","title":"A new proof of Seymour's 6-flow theorem","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Conjecture; Mathematics; Flow (mathematics); Graph; Robertson–Seymour theorem; Combinatorics; Discrete mathematics; Perspective (graphical); Line graph; Pathwidth; Geometry","score_opus":0.015234688365248295,"score_gpt":0.28032227102838037,"score_spread":0.2650875826631321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254274951","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.055261023,0.003393806,0.6080897,0.018356355,0.0062575364,0.00024502294,0.0013290602,0.0014549083,0.30561268],"genre_scores_gemma":[0.588173,0.005713435,0.27131343,0.008934065,0.005307596,0.00068291574,0.0014953284,0.0015843477,0.11679584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989446,0.00021927003,0.000054077125,0.0002914874,0.00032338616,0.00016720893],"domain_scores_gemma":[0.9977331,0.0011116676,0.00012289225,0.00034036612,0.00043524668,0.00025671144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018042936,0.0018346257,0.0014247525,0.0034484693,0.0025811277,0.0025727113,0.0026836286,0.002352831,0.026060456],"category_scores_gemma":[0.0056922296,0.00088606915,0.0026751894,0.0022790756,0.0040746885,0.010200737,0.0063218935,0.008069137,0.004234582],"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.00004809753,0.00005499866,0.00017250048,0.00013866238,0.000022890084,0.00015119449,0.00023140687,0.00058941654,0.0013097721,0.97469306,0.009677689,0.012910373],"study_design_scores_gemma":[0.000025102976,0.000021695952,0.00023512101,0.00003399203,0.00002121832,0.000116956144,0.000047431993,0.002916934,0.0007245774,0.97319883,0.022638578,0.000019601708],"about_ca_topic_score_codex":0.0013618785,"about_ca_topic_score_gemma":0.0010307948,"teacher_disagreement_score":0.026060456,"about_ca_system_score_codex":0.001524049,"about_ca_system_score_gemma":0.0009938745,"threshold_uncertainty_score":0.08718091},"labels":[],"label_agreement":null},{"id":"W2275781839","doi":"10.1016/j.jctb.2017.05.008","title":"The structure of matroids with a spanning clique or projective geometry","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Oriented matroid; Mathematics; Graphic matroid; Weighted matroid; Matroid partitioning; Projective geometry; Projective plane; Minor (academic); Discrete mathematics; Geometry; Algebraic geometry","score_opus":0.016436985967622077,"score_gpt":0.3087211658203098,"score_spread":0.29228417985268773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275781839","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.82434773,0.0012500578,0.098405614,0.0051581557,0.00017649592,0.00008954756,0.0014225537,0.0003111352,0.068838656],"genre_scores_gemma":[0.97233105,0.00047688448,0.01722226,0.00035467496,0.0004476409,0.000054450826,0.0006676355,0.000075089054,0.008370266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926907,0.00023009973,0.000027004497,0.00021809641,0.0001433075,0.000112415124],"domain_scores_gemma":[0.9975242,0.0008757311,0.0006389017,0.00029903252,0.00018358037,0.00047846048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006187983,0.0005544458,0.0007100946,0.0013364543,0.0017133134,0.0039555086,0.0016187832,0.0016981709,0.009805233],"category_scores_gemma":[0.00339694,0.000686437,0.0006656747,0.001658306,0.0028233605,0.0051873056,0.0017770013,0.0016880705,0.0008114796],"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.000061638195,0.000034860437,0.00074587035,0.000057104175,0.00001435787,0.000119725,0.00023352145,0.002453927,0.0009807025,0.98897994,0.0024090665,0.003909169],"study_design_scores_gemma":[0.000020647492,0.000022025217,0.0007318119,0.00001415914,0.000012503909,0.00020041372,0.0001268095,0.011402233,0.0002685374,0.98472136,0.0024671322,0.000012427551],"about_ca_topic_score_codex":0.0007714538,"about_ca_topic_score_gemma":0.0008649143,"teacher_disagreement_score":0.009805233,"about_ca_system_score_codex":0.0007514016,"about_ca_system_score_gemma":0.00047659423,"threshold_uncertainty_score":0.032801747},"labels":[],"label_agreement":null},{"id":"W2289102318","doi":"10.1016/j.jctb.2016.12.006","title":"A proof of the Barát–Thomassen conjecture","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Centre International de Mathématiques et Informatique de Toulouse; Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche","keywords":"Mathematics; Conjecture; Combinatorics; Bar (unit); Discrete mathematics","score_opus":0.019120371912559903,"score_gpt":0.2882693660115007,"score_spread":0.26914899409894083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289102318","genre_codex":"other","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.2026125,0.0060849655,0.1764004,0.05246515,0.0070296726,0.00010662558,0.0012560964,0.0014893905,0.55255526],"genre_scores_gemma":[0.89848953,0.0026870973,0.040893257,0.0046509155,0.0029708897,0.00013755444,0.00071810395,0.0004437636,0.049008876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907434,0.0002086527,0.000044729706,0.00021385841,0.00031673754,0.00014168811],"domain_scores_gemma":[0.9954287,0.002746348,0.00026257956,0.00057719235,0.00055008684,0.00043504534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015628173,0.0009419709,0.0014170827,0.002247782,0.0024652763,0.0028744761,0.0021634263,0.0028966705,0.019520832],"category_scores_gemma":[0.00842837,0.0007862786,0.0015444763,0.0020812934,0.005190853,0.0074766064,0.0055877147,0.006343067,0.0034558629],"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.000032060845,0.000033514734,0.00015335307,0.00007643491,0.000011591213,0.00014165997,0.00022234189,0.0005266068,0.00056426233,0.98785466,0.0062967315,0.0040866663],"study_design_scores_gemma":[0.000021498481,0.000009652291,0.0001555095,0.000025455975,0.000010553799,0.00009069292,0.000049835056,0.00206337,0.00022801611,0.9910584,0.00627487,0.000011975696],"about_ca_topic_score_codex":0.0013234636,"about_ca_topic_score_gemma":0.0012226857,"teacher_disagreement_score":0.019520832,"about_ca_system_score_codex":0.0016841401,"about_ca_system_score_gemma":0.0008637934,"threshold_uncertainty_score":0.06530362},"labels":[],"label_agreement":null},{"id":"W2293176046","doi":"10.1016/j.jctb.2016.05.007","title":"On the Corrádi–Hajnal theorem and a question of Dirac","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"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":"National Security Agency; Russian Foundation for Basic Research; National Science Foundation","keywords":"Combinatorics; Disjoint sets; Mathematics; Graph; Vertex (graph theory); Independence number; Discrete mathematics","score_opus":0.013864062301766466,"score_gpt":0.2627733450029747,"score_spread":0.24890928270120827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293176046","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20406823,0.01227728,0.1444946,0.13483222,0.0054239454,0.000050412793,0.00045860812,0.00030620606,0.49808848],"genre_scores_gemma":[0.9220577,0.003532668,0.020422302,0.01051862,0.0040520052,0.000074565025,0.00016432782,0.00020907694,0.0389687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894756,0.00040588377,0.00006882834,0.00026686603,0.00021127558,0.000099675286],"domain_scores_gemma":[0.9960814,0.0023251388,0.00020492537,0.0005792323,0.0005254822,0.00028382614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003231044,0.00046563343,0.0013631689,0.002274694,0.004090781,0.0033918975,0.001644704,0.003804359,0.009216644],"category_scores_gemma":[0.0102311745,0.00046379305,0.0009803603,0.0018982693,0.012912721,0.013272682,0.003847835,0.0048204577,0.0008385933],"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.0000042221955,0.0000031587547,0.0000370328,0.0000053897797,0.0000010076288,0.000014971783,0.00006828643,0.000048983817,0.000030117506,0.99809664,0.00089325255,0.00079677283],"study_design_scores_gemma":[0.000003380764,0.0000013582685,0.000024700335,0.00000379183,7.858214e-7,0.000022689574,0.000032045402,0.00018644358,0.0000148320005,0.99799216,0.0017148474,0.0000029618857],"about_ca_topic_score_codex":0.0021411271,"about_ca_topic_score_gemma":0.0011292605,"teacher_disagreement_score":0.009216644,"about_ca_system_score_codex":0.00253292,"about_ca_system_score_gemma":0.0010633179,"threshold_uncertainty_score":0.030832708},"labels":[],"label_agreement":null},{"id":"W2293828016","doi":"10.1016/j.jctb.2017.09.010","title":"Characterizing 4-critical graphs with Ore-degree at most seven","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Graph; Degree (music); Discrete mathematics; Generalization; Physics","score_opus":0.03701311694568272,"score_gpt":0.3034976166614376,"score_spread":0.2664844997157549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293828016","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.9268596,0.00026140592,0.04370642,0.00085607375,0.000056660378,0.0000706434,0.00032718177,0.00017070818,0.027691286],"genre_scores_gemma":[0.9809461,0.00016079146,0.012617856,0.00022261495,0.00007592107,0.000056614703,0.0006589925,0.000105927465,0.0051550316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994411,0.00011767546,0.00002613341,0.0001621767,0.00011860518,0.00013442458],"domain_scores_gemma":[0.99583095,0.0021917128,0.00067692925,0.00025450147,0.00042546698,0.0006204732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007375628,0.0008720326,0.0009392,0.0028175265,0.0018988748,0.0029891348,0.0015238458,0.0016844864,0.0055790497],"category_scores_gemma":[0.006069439,0.00077903084,0.000648575,0.0012108352,0.002459048,0.0041083666,0.0020990246,0.0019358487,0.0005540688],"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.0003356612,0.00018219404,0.009675967,0.00020030949,0.000039135582,0.0009244444,0.0013644304,0.008275625,0.009185048,0.9537328,0.0041682585,0.011916202],"study_design_scores_gemma":[0.000028763978,0.000034922712,0.0010253033,0.000048054782,0.000022185148,0.00043311346,0.00076459604,0.016536418,0.0019470201,0.97678274,0.0023595325,0.000017349303],"about_ca_topic_score_codex":0.0008239187,"about_ca_topic_score_gemma":0.0011633786,"teacher_disagreement_score":0.0055790497,"about_ca_system_score_codex":0.0010891935,"about_ca_system_score_gemma":0.0006021506,"threshold_uncertainty_score":0.018663824},"labels":[],"label_agreement":null},{"id":"W2305610210","doi":"10.1016/j.jctb.2016.01.006","title":"Stabilizer theorems for even cycle matroids","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"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":"Seventh Framework Programme; European Research Council","keywords":"Matroid; Combinatorics; Mathematics; Matroid partitioning; Graphic matroid; Minor (academic); Discrete mathematics; Graph","score_opus":0.011781528074291387,"score_gpt":0.27753434757196466,"score_spread":0.26575281949767326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2305610210","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.6162546,0.0019341516,0.120422214,0.0042310166,0.00052309,0.00011106585,0.00070976233,0.0008692807,0.2549448],"genre_scores_gemma":[0.95623153,0.0013400955,0.010201688,0.0007857441,0.0008006794,0.00013375361,0.00059339113,0.00025569415,0.029657364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993975,0.00010754165,0.00003161185,0.0001485169,0.00018646714,0.00012835025],"domain_scores_gemma":[0.99762696,0.0013250464,0.00024241648,0.0002535928,0.00024132959,0.00031070694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007825989,0.001027043,0.000950662,0.00280496,0.0020914227,0.0034230312,0.00119869,0.0011212474,0.013507092],"category_scores_gemma":[0.0028633634,0.0006241588,0.00109015,0.0014984609,0.0022345781,0.005395219,0.0030444884,0.0030418164,0.0015699345],"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.000056009285,0.000027468262,0.00034411316,0.000049661623,0.000013142216,0.00010672585,0.0003606731,0.000723098,0.0014385575,0.9895572,0.0022965637,0.005026739],"study_design_scores_gemma":[0.000024177905,0.000016069931,0.00020659594,0.000009620168,0.000014748554,0.00006965053,0.00007891566,0.0026027297,0.00053179497,0.99440753,0.0020287998,0.000009211761],"about_ca_topic_score_codex":0.0010281511,"about_ca_topic_score_gemma":0.0011435301,"teacher_disagreement_score":0.013507092,"about_ca_system_score_codex":0.0013372902,"about_ca_system_score_gemma":0.00043795,"threshold_uncertainty_score":0.045185745},"labels":[],"label_agreement":null},{"id":"W2515761800","doi":"10.1016/j.jctb.2017.06.004","title":"Five-list-coloring graphs on surfaces III. One list of size one and one list of size two","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Lemma (botany); Bounded function; Vertex (graph theory); Graph; Planar graph; List coloring; Discrete mathematics; Mathematical analysis","score_opus":0.028470303022839833,"score_gpt":0.30270284349428384,"score_spread":0.274232540471444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515761800","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.8055724,0.00035484091,0.0836091,0.0019040046,0.00039575493,0.00016196707,0.0010340759,0.0014314804,0.105536364],"genre_scores_gemma":[0.9254531,0.00021585147,0.046200514,0.00051316206,0.00009462391,0.00011658125,0.0014276486,0.00034403804,0.025634445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908876,0.0001467522,0.000044702676,0.00015620884,0.00018457879,0.0003790404],"domain_scores_gemma":[0.9974043,0.00066979945,0.00027764175,0.000613641,0.0004142725,0.0006203826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048550253,0.0007679672,0.00076280185,0.001014703,0.003179035,0.0038433052,0.0019628578,0.0020632157,0.014396423],"category_scores_gemma":[0.0023608194,0.00073001796,0.0011029694,0.0012234534,0.0021131127,0.0028972852,0.0017897605,0.001805726,0.0020531914],"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.0008126188,0.00032097107,0.0050037955,0.0003452138,0.00006578306,0.0010050898,0.00092122273,0.014354682,0.02345062,0.9075034,0.017741917,0.028474623],"study_design_scores_gemma":[0.00019453462,0.00015551448,0.0053726076,0.00010156047,0.00011204311,0.00091548456,0.0017776598,0.06372223,0.015069122,0.89190936,0.020560408,0.00010953609],"about_ca_topic_score_codex":0.005055756,"about_ca_topic_score_gemma":0.006701108,"teacher_disagreement_score":0.014396423,"about_ca_system_score_codex":0.0020349943,"about_ca_system_score_gemma":0.0013649071,"threshold_uncertainty_score":0.04816085},"labels":[],"label_agreement":null},{"id":"W2516346504","doi":"10.1016/j.jctb.2016.07.009","title":"Properties of regular graphs with large girth via local algorithms","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação de Amparo à Pesquisa do Estado do Rio Grande do Sul; Australian Research Council; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Girth (graph theory); Discrete mathematics; Upper and lower bounds","score_opus":0.009874030088849246,"score_gpt":0.23027590097219577,"score_spread":0.22040187088334653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516346504","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.869799,0.0005389505,0.102919765,0.0010255056,0.00004747369,0.00011607182,0.0005015338,0.00092787127,0.024123752],"genre_scores_gemma":[0.9814936,0.00029118042,0.013515499,0.00013955595,0.00011628997,0.00011782212,0.00046572986,0.0003654412,0.0034949032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998539,0.0004802526,0.00006823406,0.00039436875,0.00029838108,0.0002197809],"domain_scores_gemma":[0.9776309,0.014655318,0.0029330614,0.0023711792,0.0008843456,0.0015252655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014416366,0.0007883643,0.0017714916,0.0026421917,0.0020392004,0.0044954936,0.0029711428,0.0017579275,0.008613532],"category_scores_gemma":[0.01412645,0.0011718599,0.0014002796,0.0026090231,0.003834348,0.007280667,0.0027388195,0.0027648127,0.0010524417],"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.0010412952,0.0004418365,0.00784249,0.0004999659,0.00015502865,0.0007686319,0.0017498045,0.056611773,0.01627893,0.8758102,0.006559577,0.032240555],"study_design_scores_gemma":[0.00015342506,0.0001647699,0.0019580817,0.000055870718,0.0001158397,0.00068655965,0.0005762759,0.09039716,0.0044625513,0.8991176,0.0022500586,0.000061924926],"about_ca_topic_score_codex":0.0005125678,"about_ca_topic_score_gemma":0.0006545952,"teacher_disagreement_score":0.008613532,"about_ca_system_score_codex":0.0013993677,"about_ca_system_score_gemma":0.0008161254,"threshold_uncertainty_score":0.02881509},"labels":[],"label_agreement":null},{"id":"W2519651985","doi":"10.1016/j.jctb.2017.05.006","title":"Layered separators in minor-closed graph classes with applications","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Mathematics; Combinatorics; Graph; Minor (academic); Discrete mathematics; Humanities","score_opus":0.015371805154149988,"score_gpt":0.29770729704332677,"score_spread":0.2823354918891768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519651985","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.5094778,0.0010367145,0.42185512,0.0021786029,0.00027174008,0.00012141587,0.0005529247,0.00089988555,0.06360589],"genre_scores_gemma":[0.90173256,0.00071153365,0.067550205,0.00036553197,0.0004251777,0.0001653754,0.00061158714,0.00040117546,0.028036961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990915,0.00023203818,0.000053997,0.00026445565,0.00019174366,0.00016631866],"domain_scores_gemma":[0.99414176,0.0030256954,0.00063317345,0.0005122918,0.0005378683,0.0011491403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000826571,0.0008126856,0.001140116,0.0029406168,0.0020653296,0.004075993,0.002172391,0.0017895901,0.009426818],"category_scores_gemma":[0.008403301,0.0008320184,0.0013075785,0.0025135798,0.0027106083,0.0056237844,0.0049064183,0.0039951764,0.0011831598],"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.00007531887,0.000053065967,0.00074044004,0.000058870573,0.000013514198,0.000073657306,0.00043086754,0.0024995669,0.0012201216,0.9818602,0.0022302852,0.010744124],"study_design_scores_gemma":[0.00002045492,0.000017854136,0.00037304327,0.000021428967,0.00001761954,0.00011523545,0.00016636847,0.02172653,0.0006235513,0.9736727,0.003232407,0.000012760566],"about_ca_topic_score_codex":0.0011266137,"about_ca_topic_score_gemma":0.001292602,"teacher_disagreement_score":0.009426818,"about_ca_system_score_codex":0.0014211134,"about_ca_system_score_gemma":0.00061090925,"threshold_uncertainty_score":0.031535923},"labels":[],"label_agreement":null},{"id":"W2526183036","doi":"10.1016/j.jctb.2016.09.007","title":"Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Mathematics; Signature (topology); Combinatorics; Computer science; Geometry","score_opus":0.008151347987678085,"score_gpt":0.21954110571909125,"score_spread":0.21138975773141316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526183036","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.6845153,0.0046824208,0.17506716,0.0056200647,0.00031419648,0.00012507966,0.0012614588,0.00049213745,0.12792234],"genre_scores_gemma":[0.971291,0.001245181,0.017757388,0.00037592102,0.00024708724,0.00007708026,0.00048175632,0.00014508424,0.008379577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986192,0.00031071564,0.0000644669,0.0003489173,0.00034357942,0.0003131296],"domain_scores_gemma":[0.9848534,0.009402337,0.0013947331,0.001925923,0.00087908393,0.0015444774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022282552,0.0010418141,0.001181341,0.0049838913,0.0023235558,0.0054748277,0.0029824588,0.0018647023,0.010129876],"category_scores_gemma":[0.012714241,0.00096795516,0.0009778161,0.0042411643,0.006804228,0.011496839,0.0049719242,0.005462685,0.00089015934],"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.00009609973,0.00002682356,0.0014224749,0.00007054898,0.000012010444,0.000042549706,0.00026054544,0.0035428263,0.00088040525,0.9875507,0.0014221033,0.004672895],"study_design_scores_gemma":[0.00001590098,0.000014193361,0.0009407131,0.00003281029,0.000023719951,0.000061251405,0.0001122518,0.012167981,0.00049065985,0.9841686,0.0019506348,0.000021298672],"about_ca_topic_score_codex":0.0018164141,"about_ca_topic_score_gemma":0.0031719727,"teacher_disagreement_score":0.010129876,"about_ca_system_score_codex":0.0037834116,"about_ca_system_score_gemma":0.0012140585,"threshold_uncertainty_score":0.033887804},"labels":[],"label_agreement":null},{"id":"W2568140225","doi":"10.1016/j.jctb.2012.11.002","title":"Flow-cut gaps for integer and fractional multiflows","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Integer (computer science); Flow (mathematics); Maximum flow problem; Integer programming; Graph; Discrete mathematics; Planar graph; Mathematical optimization; Computer science; Geometry","score_opus":0.01700801821673222,"score_gpt":0.29596328350016127,"score_spread":0.27895526528342907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568140225","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.85594475,0.00078852,0.08972486,0.0016040186,0.00024149647,0.000047586273,0.00051124755,0.00045982515,0.050677616],"genre_scores_gemma":[0.9744567,0.00023028911,0.018316466,0.00019206943,0.000113036556,0.000042826574,0.00034403364,0.000112418194,0.0061921333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935704,0.000077696575,0.000031417203,0.0001377082,0.00016010698,0.00023602687],"domain_scores_gemma":[0.99683255,0.0016589253,0.00038715318,0.0002203485,0.0002469015,0.00065407384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010736116,0.00063814415,0.0010722026,0.0028596297,0.0024086998,0.0033123267,0.0015019487,0.0019319823,0.011362631],"category_scores_gemma":[0.0068748905,0.0005065932,0.0007070609,0.0011872376,0.001966708,0.0057006157,0.0023418653,0.0027224866,0.0005430171],"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.00016327247,0.000093422466,0.00064725644,0.00007338473,0.0000076029646,0.00013110068,0.00027977512,0.005223673,0.001351209,0.9819271,0.0017202705,0.008382015],"study_design_scores_gemma":[0.000023656652,0.000024179208,0.0004270225,0.000030274174,0.000008452683,0.00011967778,0.00022750566,0.02718948,0.00082,0.9694744,0.0016402778,0.000015096643],"about_ca_topic_score_codex":0.0011886253,"about_ca_topic_score_gemma":0.0011465822,"teacher_disagreement_score":0.011362631,"about_ca_system_score_codex":0.0019303123,"about_ca_system_score_gemma":0.0005774865,"threshold_uncertainty_score":0.03801185},"labels":[],"label_agreement":null},{"id":"W2585703313","doi":"10.1016/j.jctb.2018.06.007","title":"The list chromatic number of graphs with small clique number","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Clique number; Chromatic scale; Mathematics; Clique; Graph; Discrete mathematics","score_opus":0.01616007451721822,"score_gpt":0.2906845463848654,"score_spread":0.27452447186764717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585703313","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.88769233,0.0010478485,0.05574281,0.0049096053,0.00032734385,0.00008297416,0.0025369425,0.0011224451,0.046537835],"genre_scores_gemma":[0.9817669,0.00037544017,0.008429992,0.0003571695,0.00026404206,0.00012015488,0.0010741431,0.00031252296,0.007299594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906284,0.00024040778,0.000029621144,0.00029297284,0.00018320227,0.00019101652],"domain_scores_gemma":[0.98314697,0.011452845,0.0015463126,0.0012410734,0.0010070178,0.0016058495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011621647,0.00073085644,0.00088341575,0.003459867,0.0028017876,0.005014446,0.0027717787,0.0022811324,0.014338553],"category_scores_gemma":[0.014473002,0.0009819616,0.00051374856,0.0023990544,0.0029755149,0.0063929684,0.0015848413,0.002068359,0.0010730635],"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.001484692,0.00022309409,0.012182965,0.0006557294,0.000116564144,0.00031105717,0.00082846754,0.037753507,0.019020248,0.8710311,0.03121344,0.02517901],"study_design_scores_gemma":[0.00020186297,0.00011047495,0.0073394296,0.000116651085,0.00015276702,0.00047795937,0.0004416883,0.15481842,0.006638825,0.8231409,0.006455221,0.0001056983],"about_ca_topic_score_codex":0.0026838188,"about_ca_topic_score_gemma":0.004156526,"teacher_disagreement_score":0.014338553,"about_ca_system_score_codex":0.0027447334,"about_ca_system_score_gemma":0.0015584307,"threshold_uncertainty_score":0.047967255},"labels":[],"label_agreement":null},{"id":"W2605561794","doi":"10.1016/j.jctb.2017.04.002","title":"Rainbow triangles in three-colored graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Rainbow; Combinatorics; Flag (linear algebra); Colored; Conjecture; Mathematics; Limit (mathematics); Discrete mathematics; Physics; Algebra over a field; Pure mathematics; Quantum mechanics","score_opus":0.03102249671856014,"score_gpt":0.30305261986703763,"score_spread":0.2720301231484775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605561794","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.7163265,0.00082397286,0.1532282,0.0019231843,0.0005087422,0.00008097912,0.00022915404,0.00052398036,0.12635538],"genre_scores_gemma":[0.942395,0.00051629794,0.032038912,0.00039866666,0.00016361325,0.000087835986,0.0001904674,0.00021947997,0.023989832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992212,0.00022277878,0.00004448239,0.00013781899,0.00020621398,0.00016753314],"domain_scores_gemma":[0.99687636,0.0014993397,0.00039501925,0.00026395035,0.00036435938,0.00060098636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009951271,0.00050145667,0.00083734083,0.0021153642,0.0024640511,0.0037068108,0.0021833458,0.0017380278,0.007896667],"category_scores_gemma":[0.0043715998,0.000728747,0.000862201,0.0015663302,0.0038263116,0.0047420594,0.0029986938,0.0024528005,0.0010279607],"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.000029779098,0.00002139345,0.00025238423,0.000021244707,0.000004305677,0.00008922477,0.00027725886,0.00085942086,0.00076513196,0.99444276,0.00061164686,0.0026254887],"study_design_scores_gemma":[0.000015393136,0.00000747006,0.00013329281,0.000012040731,0.0000062828185,0.00008310427,0.00013481168,0.0045880773,0.00036280233,0.99360985,0.0010393951,0.0000073449464],"about_ca_topic_score_codex":0.0026429421,"about_ca_topic_score_gemma":0.0033349523,"teacher_disagreement_score":0.007896667,"about_ca_system_score_codex":0.0013547364,"about_ca_system_score_gemma":0.0007552764,"threshold_uncertainty_score":0.026416957},"labels":[],"label_agreement":null},{"id":"W2606086083","doi":"10.1016/j.jctb.2018.04.003","title":"Infinitely many excluded minors for frame matroids and for lifted-graphic matroids","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Class (philosophy); Combinatorics; Graphic matroid; Frame (networking); Mathematics; Computer science; Artificial intelligence","score_opus":0.021781755135505218,"score_gpt":0.3062087531804304,"score_spread":0.28442699804492516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606086083","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.7932476,0.000558536,0.14651747,0.0019244393,0.0003419536,0.00013171388,0.0007378583,0.00052285625,0.05601759],"genre_scores_gemma":[0.9403731,0.00049212,0.030363008,0.00047328978,0.000542446,0.00027802368,0.0017047297,0.0003065327,0.025466733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988489,0.00019980298,0.00007962225,0.00026931905,0.00028149344,0.00032085532],"domain_scores_gemma":[0.99702007,0.0011796884,0.00041284907,0.00025465427,0.00030681712,0.00082587416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092924817,0.0013388348,0.0015625042,0.0024865307,0.00412813,0.006658733,0.0019052224,0.0022094199,0.012277276],"category_scores_gemma":[0.00497333,0.0011368694,0.0019600808,0.0020591444,0.003308263,0.006342154,0.0033072678,0.004350531,0.0015418386],"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.00023793925,0.00012769658,0.0010279509,0.00009563121,0.000028441676,0.0004830034,0.0009410442,0.0012338612,0.0029807363,0.9804715,0.003323072,0.009049071],"study_design_scores_gemma":[0.00006151233,0.000039748196,0.0005261986,0.000023437731,0.00003730648,0.00033165555,0.0002798419,0.0067493105,0.0010416298,0.987498,0.0033807675,0.000030562267],"about_ca_topic_score_codex":0.0012433336,"about_ca_topic_score_gemma":0.0020741483,"teacher_disagreement_score":0.012277276,"about_ca_system_score_codex":0.0015827601,"about_ca_system_score_gemma":0.0008137189,"threshold_uncertainty_score":0.041071594},"labels":[],"label_agreement":null},{"id":"W2617552753","doi":"10.1016/j.jctb.2017.05.003","title":"Every finite non-solvable group admits an oriented regular representation","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":26,"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 Lethbridge","funders":"","keywords":"Mathematics; Solvable group; Finite group; Combinatorics; Group (periodic table); Graph; Representation (politics); Discrete mathematics","score_opus":0.053800333418807814,"score_gpt":0.35773772432619766,"score_spread":0.30393739090738986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617552753","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.77060705,0.000260257,0.09028615,0.0020920816,0.00076427794,0.00013566879,0.00029620074,0.00087744143,0.13468084],"genre_scores_gemma":[0.9623061,0.00022714319,0.013262021,0.00036361473,0.00040889124,0.00009990493,0.0004162914,0.00016456653,0.022751546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990134,0.0001233192,0.000059469367,0.0002970348,0.00019783122,0.000309017],"domain_scores_gemma":[0.9991013,0.00021523198,0.00017009096,0.00016586996,0.00011121569,0.00023626708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068699394,0.0013386403,0.0013737032,0.0018477592,0.0033083465,0.004457992,0.0015007935,0.0014979016,0.008244632],"category_scores_gemma":[0.0010540948,0.00063983013,0.0015649683,0.0012962612,0.006167808,0.004305416,0.0027138973,0.0021389022,0.0016191293],"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.000110719535,0.000062790845,0.00031670308,0.000036554877,0.000023026678,0.00022706759,0.00050254783,0.0002628226,0.0033342717,0.9891406,0.0007963167,0.0051864535],"study_design_scores_gemma":[0.00007174215,0.00007590862,0.00042485818,0.000014569478,0.000034969067,0.00038564176,0.0004765929,0.0015585251,0.0019764903,0.99099874,0.0039542136,0.00002772929],"about_ca_topic_score_codex":0.0006314387,"about_ca_topic_score_gemma":0.00054471666,"teacher_disagreement_score":0.008244632,"about_ca_system_score_codex":0.0009904635,"about_ca_system_score_gemma":0.0006250511,"threshold_uncertainty_score":0.027581036},"labels":[],"label_agreement":null},{"id":"W2621129476","doi":"10.1016/j.jctb.2018.11.006","title":"Balanced independent sets in graphs omitting large cliques","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Combinatorics; Bipartite graph; Mathematics; Countable set; Conjecture; Discrete mathematics; Partition (number theory); Graph; Homogeneous; Independent set","score_opus":0.020525847306395707,"score_gpt":0.3118381453852428,"score_spread":0.29131229807884707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621129476","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.73401767,0.0018960236,0.20306906,0.00305624,0.00029953555,0.00010267951,0.0008806535,0.00035747254,0.056320634],"genre_scores_gemma":[0.95483226,0.0006926484,0.028367117,0.00042440096,0.0003695765,0.0001911055,0.00067609816,0.00017350874,0.014273339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985916,0.00038060997,0.00007524476,0.0004014761,0.00034435635,0.00020672755],"domain_scores_gemma":[0.9881688,0.007747723,0.0012739132,0.00085201184,0.0007807904,0.0011768611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019552053,0.00091142184,0.0014522272,0.0031867356,0.0028822387,0.0052064676,0.0026087663,0.0021453714,0.006022762],"category_scores_gemma":[0.01516718,0.0014483857,0.0008887381,0.0027990167,0.0032254844,0.007718595,0.0027767322,0.002870222,0.0006535025],"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.000085239,0.00004526793,0.000791369,0.000086797845,0.000018956738,0.000098892175,0.00028756727,0.0031142074,0.0010539916,0.98762506,0.0017718422,0.005020871],"study_design_scores_gemma":[0.00002532431,0.000008747676,0.00030840296,0.00002042066,0.000019714016,0.000104472005,0.000084599,0.013709909,0.00036981856,0.9841644,0.0011760843,0.000008176981],"about_ca_topic_score_codex":0.0009812532,"about_ca_topic_score_gemma":0.0013595024,"teacher_disagreement_score":0.006022762,"about_ca_system_score_codex":0.0014698334,"about_ca_system_score_gemma":0.00078112894,"threshold_uncertainty_score":0.020148098},"labels":[],"label_agreement":null},{"id":"W2739763930","doi":"10.1016/j.jctb.2019.10.005","title":"The inverse eigenvalue problem of a graph: Multiplicities and minors","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"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 Regina","funders":"American Institute of Mathematics","keywords":"Eigenvalues and eigenvectors; Mathematics; Monotonic function; Inverse; Multiplicity (mathematics); Combinatorics; Diagonal; Discrete mathematics; Mathematical analysis","score_opus":0.02327575785812396,"score_gpt":0.2748947017448028,"score_spread":0.2516189438866788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739763930","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.71545875,0.001121631,0.22543739,0.0049286555,0.00063690246,0.00007471923,0.0004515227,0.00035511336,0.051535197],"genre_scores_gemma":[0.94931835,0.0005983579,0.029955367,0.0002944635,0.00090559607,0.00009041221,0.0002970556,0.00019749689,0.018343005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897385,0.00032447348,0.00004570857,0.00028871876,0.00023048016,0.00013680053],"domain_scores_gemma":[0.9954555,0.0027529318,0.0004919177,0.0003329053,0.00037863263,0.0005881249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010059319,0.0011175893,0.0011440483,0.0028363613,0.0015321655,0.0035343159,0.001718028,0.0024700945,0.007956739],"category_scores_gemma":[0.006582833,0.0007318489,0.00084058574,0.0011957518,0.0026619164,0.0049330066,0.0021120422,0.0024899892,0.00091337145],"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.00018209808,0.00014089442,0.001185886,0.00017236605,0.00003146023,0.0004659639,0.00065962935,0.0062035155,0.0067337016,0.9613006,0.0066099684,0.016313983],"study_design_scores_gemma":[0.000019391025,0.000023617056,0.00035686736,0.000015220857,0.000011290123,0.00043690915,0.00019550411,0.024593804,0.00085532217,0.9719011,0.0015708095,0.00002012797],"about_ca_topic_score_codex":0.00036862248,"about_ca_topic_score_gemma":0.00033430662,"teacher_disagreement_score":0.007956739,"about_ca_system_score_codex":0.00065442803,"about_ca_system_score_gemma":0.00044507225,"threshold_uncertainty_score":0.026617944},"labels":[],"label_agreement":null},{"id":"W2766396921","doi":"10.1016/j.jctb.2017.10.001","title":"Domination in tournaments","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; McGill University; Agence Nationale de la Recherche; National Science Foundation","keywords":"Tournament; Conjecture; Combinatorics; Mathematics; Vertex (graph theory); Dimension (graph theory); Transitive relation; Set (abstract data type); Bounded function; Class (philosophy); Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.016693407880547576,"score_gpt":0.30968788798114705,"score_spread":0.2929944801005995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766396921","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.86113286,0.00089598045,0.058915265,0.0019689824,0.00015344222,0.00006150653,0.00028384675,0.00019144075,0.076396614],"genre_scores_gemma":[0.9862388,0.00022245545,0.0034204626,0.00013743169,0.00012555494,0.000041281794,0.00017282617,0.000050292838,0.009590913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980393,0.0007435682,0.000087415894,0.0003358743,0.0003315199,0.00046239703],"domain_scores_gemma":[0.98841405,0.0074246577,0.0011450442,0.0006669653,0.00076108583,0.0015882029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016861164,0.00047884698,0.001353976,0.0020858075,0.0032765267,0.0073855286,0.0016001946,0.0016635061,0.00876022],"category_scores_gemma":[0.012781497,0.0008195997,0.0009400133,0.002651615,0.0033410457,0.0039700083,0.0022460064,0.002312571,0.00051037536],"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.00026118907,0.00009996568,0.0043392642,0.00008252286,0.00006860771,0.0002760009,0.0009957743,0.00819452,0.0015088718,0.967979,0.0036294726,0.012564845],"study_design_scores_gemma":[0.00008721999,0.00003261685,0.0014466651,0.000020002824,0.00004389111,0.00029524945,0.00026005475,0.033474937,0.0003698602,0.96107394,0.0028719795,0.000023532995],"about_ca_topic_score_codex":0.003465824,"about_ca_topic_score_gemma":0.003579338,"teacher_disagreement_score":0.00876022,"about_ca_system_score_codex":0.002254836,"about_ca_system_score_gemma":0.00089436804,"threshold_uncertainty_score":0.029305816},"labels":[],"label_agreement":null},{"id":"W2797572581","doi":"10.1016/j.jctb.2019.10.001","title":"k-regular subgraphs near the k-core threshold of a random graph","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Graph; Core (optical fiber); Degree (music); Window (computing); Factor-critical graph; Induced subgraph; Discrete mathematics; Physics; Computer science; Line graph; Graph power","score_opus":0.024710718242157738,"score_gpt":0.2782392494595172,"score_spread":0.25352853121735947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797572581","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.9516187,0.00044040722,0.030612167,0.0012340511,0.000046312325,0.000041057847,0.00038673097,0.00038946242,0.015231096],"genre_scores_gemma":[0.9915957,0.0001412816,0.0051465556,0.00017422205,0.000059692113,0.000045802204,0.0002561409,0.000074561016,0.0025061301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995235,0.0001386858,0.000017893586,0.000116352254,0.00010124982,0.00010229609],"domain_scores_gemma":[0.99459946,0.0028751825,0.00066276715,0.0003949376,0.00040234276,0.0010653517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084315194,0.00039331248,0.0010857452,0.0021217896,0.0011712752,0.002464821,0.001606157,0.0013996643,0.0042687813],"category_scores_gemma":[0.007936875,0.00065891346,0.00051653903,0.00063548976,0.0020570632,0.0028522671,0.0018188216,0.0014043294,0.00047305683],"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.0006685885,0.0001923281,0.007276567,0.00030039262,0.000073122974,0.0007256221,0.00078208453,0.03074343,0.01835651,0.9268338,0.006564677,0.0074828],"study_design_scores_gemma":[0.00010845996,0.00008667195,0.006803346,0.00006441693,0.00005017876,0.0007717851,0.00041219988,0.2158288,0.003254508,0.7711926,0.0013854333,0.000041603427],"about_ca_topic_score_codex":0.0015947903,"about_ca_topic_score_gemma":0.0015818599,"teacher_disagreement_score":0.0042687813,"about_ca_system_score_codex":0.0011971644,"about_ca_system_score_gemma":0.0005024507,"threshold_uncertainty_score":0.014280558},"labels":[],"label_agreement":null},{"id":"W2802999861","doi":"10.1016/j.jctb.2019.08.007","title":"Matroid fragility and relaxations of circuit hyperplanes","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Conjecture; Hyperplane; Combinatorics; Bounded function; Mathematics; Function (biology); Discrete mathematics; Mathematical analysis","score_opus":0.01814264768711815,"score_gpt":0.27175819323546824,"score_spread":0.2536155455483501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802999861","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.7778537,0.0010537163,0.15094928,0.0029458771,0.0001479626,0.00012737146,0.0019862629,0.0004079441,0.06452781],"genre_scores_gemma":[0.95649886,0.0006161387,0.025926335,0.00028890398,0.00025208844,0.00010296838,0.0015445353,0.00017075289,0.014599336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988871,0.00026990016,0.000046111938,0.00024080694,0.0002503542,0.00030581685],"domain_scores_gemma":[0.9952715,0.0026869865,0.0006330119,0.00055052835,0.0002800154,0.0005779524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096043525,0.0006363219,0.00092577294,0.0016410023,0.0014070182,0.0032612402,0.0020256117,0.0014987163,0.02159599],"category_scores_gemma":[0.0086351605,0.0009423448,0.0011510327,0.0019017038,0.0017936741,0.0053785266,0.002031426,0.004460174,0.00093280437],"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.0005652427,0.00031390725,0.002376606,0.00027685525,0.000069639216,0.00027196168,0.000795279,0.048036616,0.0051480783,0.8978769,0.009700977,0.03456792],"study_design_scores_gemma":[0.00007495063,0.00007261742,0.0013254844,0.000040272163,0.00002842245,0.00019447092,0.0003984054,0.09846773,0.0012848462,0.8947503,0.0033325164,0.00002993347],"about_ca_topic_score_codex":0.0020741117,"about_ca_topic_score_gemma":0.0019106661,"teacher_disagreement_score":0.02159599,"about_ca_system_score_codex":0.0015700564,"about_ca_system_score_gemma":0.00052650145,"threshold_uncertainty_score":0.07224578},"labels":[],"label_agreement":null},{"id":"W2825514135","doi":"10.1016/j.jctb.2018.07.001","title":"Peripheral circuits in infinite binary matroids","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Matroid; Electronic circuit; Mathematics; Computer science; Combinatorics; Discrete mathematics; Physics; Arithmetic; Quantum mechanics","score_opus":0.015186765259390072,"score_gpt":0.28264592315740134,"score_spread":0.2674591578980113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2825514135","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.81326294,0.000704385,0.09358697,0.00094163546,0.000113242175,0.000041186373,0.00030860954,0.0004605703,0.0905804],"genre_scores_gemma":[0.9775978,0.0002078897,0.008172439,0.0001500789,0.0000878485,0.000038159484,0.00019191903,0.00008673144,0.013467208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962926,0.0000949126,0.000020926303,0.000078674355,0.00009785394,0.000078306366],"domain_scores_gemma":[0.9984212,0.0008443477,0.00017298861,0.00012036159,0.0001615043,0.00027971194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032601872,0.0004125916,0.0006157931,0.0013415382,0.0013224253,0.0037032748,0.001042989,0.0009468135,0.010451614],"category_scores_gemma":[0.0026131968,0.00045859348,0.00036167848,0.0012286912,0.0013683679,0.0036369562,0.0014509527,0.0016413539,0.00087630475],"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.000095754796,0.000047052108,0.000416852,0.0000654968,0.000005485978,0.00011822752,0.00020108896,0.0017320386,0.0016573244,0.98594296,0.0011192346,0.008598583],"study_design_scores_gemma":[0.000026244832,0.00001996194,0.00032223455,0.00001845581,0.000012813553,0.00017945781,0.000075498065,0.012212264,0.00089767645,0.98461664,0.0016102227,0.000008526506],"about_ca_topic_score_codex":0.0003291866,"about_ca_topic_score_gemma":0.00072843593,"teacher_disagreement_score":0.010451614,"about_ca_system_score_codex":0.0008093605,"about_ca_system_score_gemma":0.0002754847,"threshold_uncertainty_score":0.034964144},"labels":[],"label_agreement":null},{"id":"W2889694999","doi":"10.1016/j.jctb.2018.09.004","title":"Connectivity in bridge-addable graph classes: The McDiarmid–Steger–Welsh conjecture","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; McGill University","keywords":"Mathematics; Combinatorics; Conjecture; Graph; Partition (number theory); Class (philosophy); Discrete mathematics","score_opus":0.02475842331205823,"score_gpt":0.2984947733449122,"score_spread":0.27373635003285396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889694999","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.8214442,0.0017983966,0.08920886,0.009574276,0.00034119128,0.00006133983,0.0006887305,0.00034787355,0.0765352],"genre_scores_gemma":[0.98126775,0.00082436635,0.01073742,0.00077439984,0.0004060447,0.00007738074,0.0006608936,0.000077453384,0.0051743058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933606,0.0001483389,0.000026246224,0.00022204181,0.00013693527,0.00013048784],"domain_scores_gemma":[0.9949904,0.0029710971,0.0004536387,0.0005990532,0.00038508608,0.00060066563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000996951,0.00049668865,0.0011626036,0.0019119541,0.0023108213,0.0037213126,0.0018331008,0.0028182585,0.008544678],"category_scores_gemma":[0.0101638995,0.0007075324,0.00079656823,0.0016238155,0.0036287936,0.0069278236,0.0029809065,0.0033761116,0.00075545063],"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.00010393185,0.000043391647,0.0018749948,0.0000919596,0.000017883835,0.00012124715,0.0005477866,0.0027593644,0.00083814544,0.97925526,0.005219985,0.00912592],"study_design_scores_gemma":[0.000036919824,0.000013511841,0.00072582305,0.000019155654,0.000013145251,0.00010016209,0.00017885222,0.008120109,0.00022471552,0.9884067,0.0021527484,0.000008118908],"about_ca_topic_score_codex":0.0014224227,"about_ca_topic_score_gemma":0.001595464,"teacher_disagreement_score":0.008544678,"about_ca_system_score_codex":0.0008050109,"about_ca_system_score_gemma":0.00043198015,"threshold_uncertainty_score":0.028584838},"labels":[],"label_agreement":null},{"id":"W2897904393","doi":"10.1016/j.jctb.2022.01.009","title":"Colouring graphs with sparse neighbourhoods: Bounds and applications","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Neighbourhood (mathematics); Conjecture; Clique number; Chromatic scale; Vertex (graph theory); Brooks' theorem; Graph; Edge coloring; Discrete mathematics; Chordal graph; Graph power; 1-planar graph; Line graph","score_opus":0.009261596198324534,"score_gpt":0.24523861306012232,"score_spread":0.23597701686179778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897904393","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.27315944,0.009315908,0.6100021,0.0067252247,0.00053738133,0.00023929257,0.0014481372,0.0012956957,0.097276755],"genre_scores_gemma":[0.8009513,0.008878523,0.16534741,0.0009949098,0.0018414516,0.0004012654,0.0016113691,0.0008673889,0.019106433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746966,0.0007051366,0.00010693714,0.000675641,0.00070924463,0.0003333922],"domain_scores_gemma":[0.92731416,0.058790628,0.004074736,0.0039629405,0.0022682326,0.003589288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002753716,0.002439203,0.002823566,0.005014075,0.0023051624,0.00603291,0.0057375813,0.0040609553,0.012354717],"category_scores_gemma":[0.03934291,0.0025260998,0.0019917549,0.008595123,0.0073730214,0.01269989,0.0083162505,0.008526108,0.0018153777],"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.00051821576,0.00040912227,0.0036466757,0.0007255241,0.00010752523,0.00028914577,0.0010147556,0.09314457,0.004805205,0.8284593,0.013819357,0.05306054],"study_design_scores_gemma":[0.00005152334,0.0000603306,0.0007370696,0.00009581654,0.000077131044,0.00021772715,0.00016353562,0.1370357,0.001020044,0.85765487,0.0028425686,0.000043681237],"about_ca_topic_score_codex":0.0027960727,"about_ca_topic_score_gemma":0.0036171852,"teacher_disagreement_score":0.012354717,"about_ca_system_score_codex":0.002802427,"about_ca_system_score_gemma":0.000998312,"threshold_uncertainty_score":0.041330576},"labels":[],"label_agreement":null},{"id":"W2901962989","doi":"10.1016/j.jctb.2018.10.006","title":"Deltas, extended odd holes and their blockers","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Combinatorics; Set (abstract data type); Clutter; Physics; Delta; Element (criminal law); Mathematics; Geometry; Telecommunications; Computer science; Law; Political science; Radar","score_opus":0.0047313300477104005,"score_gpt":0.19036915651607395,"score_spread":0.18563782646836355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901962989","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.6926574,0.0024649736,0.16078979,0.0020355387,0.001109325,0.00009917354,0.00025831556,0.00040434854,0.14018106],"genre_scores_gemma":[0.9588645,0.0007060866,0.01068114,0.00041407318,0.00027779018,0.00006630075,0.00008507755,0.00009696916,0.028808044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997217,0.000076491815,0.000013766066,0.000043528562,0.00004970762,0.00009478669],"domain_scores_gemma":[0.99890435,0.0005512839,0.00011806774,0.00010324346,0.00009974153,0.00022320291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063349213,0.000481253,0.0005652412,0.0013149049,0.0011494599,0.0020460365,0.0006179249,0.0008451939,0.005037055],"category_scores_gemma":[0.002678474,0.0003252054,0.0003416709,0.0005113347,0.0022133188,0.0025307885,0.0015701589,0.0012638813,0.00047861013],"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.000060201797,0.000014517089,0.00020737882,0.000016515834,0.0000027258548,0.00008204366,0.000108238055,0.00045658925,0.0010561205,0.99425584,0.00079555355,0.002944371],"study_design_scores_gemma":[0.000025012696,0.000030287772,0.00016817468,0.000022067588,0.000007743844,0.00018033272,0.00015142486,0.0059709996,0.0007620291,0.98837006,0.004300013,0.000011760639],"about_ca_topic_score_codex":0.00043531132,"about_ca_topic_score_gemma":0.0004913276,"teacher_disagreement_score":0.005037055,"about_ca_system_score_codex":0.00047234178,"about_ca_system_score_gemma":0.0004993513,"threshold_uncertainty_score":0.01685065},"labels":[],"label_agreement":null},{"id":"W2902113597","doi":"10.1016/j.jctb.2022.02.007","title":"Matrix representations of frame and lifted-graphic matroids correspond to gain functions","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Combinatorial Mathematics","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":"Douglas College","funders":"Simons Foundation","keywords":"Mathematics; Combinatorics; Matroid; Graph; Matrix (chemical analysis); Canonical form; Discrete mathematics; Pure mathematics","score_opus":0.016331647362705017,"score_gpt":0.3126353802706066,"score_spread":0.2963037329079016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902113597","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.65795153,0.00044131777,0.2135972,0.002100045,0.0005735687,0.00012043757,0.00071243756,0.00092254806,0.12358085],"genre_scores_gemma":[0.94076693,0.00039728836,0.0242816,0.00044370114,0.00060240977,0.000108634194,0.0006084421,0.00037315115,0.032417804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995376,0.000074653995,0.000016441492,0.000097667275,0.000121215504,0.00015255171],"domain_scores_gemma":[0.9991596,0.00020573672,0.00015546285,0.00009900186,0.00015145601,0.00022876593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000390087,0.0009362417,0.00087574136,0.0025985343,0.0012097948,0.0042117024,0.0012720725,0.0018438436,0.0139953],"category_scores_gemma":[0.0017739555,0.00049659703,0.0009764517,0.0013565768,0.0015826215,0.0034829194,0.0012310975,0.002676718,0.0023446265],"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.000037011694,0.000027416996,0.00009062112,0.000017670136,0.00000382025,0.000058942594,0.00013600793,0.0006447319,0.0016832789,0.9910013,0.001259098,0.005040015],"study_design_scores_gemma":[0.000018680947,0.000026225487,0.00025753572,0.000011811457,0.0000069241496,0.00012344825,0.000088896006,0.008568963,0.00084380247,0.98799324,0.0020442156,0.00001616103],"about_ca_topic_score_codex":0.0008704935,"about_ca_topic_score_gemma":0.0009722581,"teacher_disagreement_score":0.0139953,"about_ca_system_score_codex":0.001141253,"about_ca_system_score_gemma":0.00052000646,"threshold_uncertainty_score":0.046818912},"labels":[],"label_agreement":null},{"id":"W2911309437","doi":"10.1016/j.jctb.2005.04.007","title":"Cayley maps","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":77,"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":"Cayley graph; Cayley's theorem; Cayley transform; Combinatorics; Mathematics; Vertex-transitive graph; Vertex (graph theory); Transitive relation; Discrete mathematics; Graph; Voltage graph; Line graph","score_opus":0.03559547643093926,"score_gpt":0.3204301378384334,"score_spread":0.28483466140749414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911309437","genre_codex":"other","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.08398502,0.0019224344,0.037736215,0.004019676,0.0028819388,0.000066186774,0.00054567546,0.0006077102,0.8682352],"genre_scores_gemma":[0.56018585,0.002443744,0.017061254,0.0014884688,0.0024244494,0.000104714476,0.0009343412,0.00054076966,0.41481644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964976,0.00006057644,0.000017088261,0.00009868356,0.00012018261,0.00005364662],"domain_scores_gemma":[0.9993405,0.00012557232,0.00006577671,0.00011176869,0.0002003099,0.00015617134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030124583,0.00074927835,0.0006320902,0.002475592,0.0020760086,0.0034988536,0.0007773145,0.0009159344,0.029135868],"category_scores_gemma":[0.0014014429,0.00042931855,0.00055623543,0.0016041885,0.0015138873,0.0038916161,0.0016742903,0.0033891005,0.0055332594],"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.0000056716094,0.000007945292,0.000048290818,0.000009711001,0.0000036525819,0.000023235463,0.00006740501,0.00007001135,0.0002691807,0.99097776,0.0040135747,0.004503458],"study_design_scores_gemma":[0.000007453784,0.000007433092,0.00018093258,0.000007781727,0.000007631222,0.0001266366,0.00007417608,0.00059387035,0.0004301353,0.9696537,0.028903399,0.000006867468],"about_ca_topic_score_codex":0.0011695871,"about_ca_topic_score_gemma":0.0012352719,"teacher_disagreement_score":0.029135868,"about_ca_system_score_codex":0.0012617373,"about_ca_system_score_gemma":0.00066102145,"threshold_uncertainty_score":0.09746915},"labels":[],"label_agreement":null},{"id":"W2913508203","doi":"10.1016/j.jctb.2016.04.002","title":"Disjoint dijoins","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Digraph; Disjoint sets; Combinatorics; Conjecture; Pairwise comparison; Partition (number theory); Mathematics; Directed graph; Discrete mathematics","score_opus":0.012839882021510558,"score_gpt":0.26601016317363857,"score_spread":0.25317028115212803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913508203","genre_codex":"other","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.2049429,0.00040670065,0.070244074,0.00097219227,0.0013550743,0.00025265384,0.0021209456,0.0007630585,0.7189424],"genre_scores_gemma":[0.56256145,0.0006074733,0.044260792,0.00080825674,0.0003024502,0.0002326877,0.004689009,0.0011116987,0.38542616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989103,0.00009933204,0.000064968146,0.00034320727,0.00029325826,0.00028890366],"domain_scores_gemma":[0.9983658,0.00031779867,0.00017259624,0.00031473758,0.00044916838,0.00037994262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036462277,0.0009568316,0.0008860585,0.0029021408,0.004080112,0.003575157,0.0015026947,0.001120934,0.0625987],"category_scores_gemma":[0.0026016652,0.0006158659,0.00090959924,0.0019092516,0.0017061423,0.0032446247,0.004190408,0.00319863,0.011411926],"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.00023647775,0.00015832485,0.001375789,0.00013703248,0.000043337757,0.000588953,0.00049600186,0.00052114885,0.005901424,0.93953466,0.014690943,0.036315862],"study_design_scores_gemma":[0.000056393063,0.00006224594,0.00202276,0.00007085237,0.0000769228,0.001302182,0.0011335476,0.0033289664,0.0064582955,0.8412854,0.14415368,0.00004871061],"about_ca_topic_score_codex":0.0013833467,"about_ca_topic_score_gemma":0.0027757052,"teacher_disagreement_score":0.0625987,"about_ca_system_score_codex":0.0009233113,"about_ca_system_score_gemma":0.0006397445,"threshold_uncertainty_score":0.20941353},"labels":[],"label_agreement":null},{"id":"W2914098655","doi":"10.1016/j.jctb.2008.06.009","title":"Lehman matrices","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"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":"Circulant matrix; Mathematics; Combinatorics; Matrix (chemical analysis); Integer (computer science); Integer matrix; Class (philosophy); Complex matrix; Pure mathematics; Discrete mathematics; Nonnegative matrix; Symmetric matrix; Physics; Eigenvalues and eigenvectors; Computer science; Materials science","score_opus":0.006861563315849809,"score_gpt":0.18614867137685437,"score_spread":0.17928710806100456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914098655","genre_codex":"other","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.07952845,0.0022241382,0.22339267,0.004384783,0.0017200212,0.00015991552,0.0012683258,0.0008787963,0.6864429],"genre_scores_gemma":[0.5777266,0.001917886,0.041556746,0.0024222026,0.0014781146,0.00026677983,0.0014702656,0.00044134518,0.37272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960643,0.00008668643,0.00001774731,0.000089503,0.000118994525,0.00008063114],"domain_scores_gemma":[0.99928904,0.00016246873,0.000089397305,0.00011161914,0.0002362173,0.000111237016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032720694,0.000762659,0.0005447517,0.0022756096,0.0016307615,0.0025703583,0.00070773746,0.0010362417,0.03376908],"category_scores_gemma":[0.0018050314,0.00032806216,0.00042478135,0.0012228894,0.0010922019,0.0024111324,0.0011306222,0.002166431,0.009261662],"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.0000099940935,0.000010638292,0.000054422857,0.00001249866,0.0000029228086,0.000027741178,0.00005412121,0.00028270565,0.0005362141,0.9863659,0.004805103,0.007837736],"study_design_scores_gemma":[0.0000059334143,0.000010081091,0.00012572286,0.000012365991,0.0000041804788,0.00012775692,0.00005642969,0.0027668742,0.0007591776,0.9720839,0.02403441,0.000013177621],"about_ca_topic_score_codex":0.00065206096,"about_ca_topic_score_gemma":0.0009236359,"teacher_disagreement_score":0.03376908,"about_ca_system_score_codex":0.0008062392,"about_ca_system_score_gemma":0.0006868388,"threshold_uncertainty_score":0.1129688},"labels":[],"label_agreement":null},{"id":"W2927674350","doi":"10.1016/j.jctb.2019.03.003","title":"Tools for counting odd cycles in graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Graph; Chordal graph; Discrete mathematics","score_opus":0.023085181156103293,"score_gpt":0.28879435769302014,"score_spread":0.26570917653691684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2927674350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1893476,0.0063549997,0.7126157,0.0034868154,0.0011202547,0.00017059778,0.00066261203,0.0010889332,0.08515255],"genre_scores_gemma":[0.8255623,0.0025464133,0.15274975,0.0007723505,0.0012341761,0.00035553286,0.00050560985,0.0004741349,0.0157996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983303,0.0005639603,0.00015723171,0.0003103758,0.00045135838,0.00018673419],"domain_scores_gemma":[0.99033165,0.0061239055,0.0006861307,0.0010331306,0.00089021615,0.00093488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003017209,0.0017042811,0.002060193,0.01393465,0.0027830177,0.0076134386,0.0038841092,0.0022169456,0.006490108],"category_scores_gemma":[0.016851265,0.0011775857,0.001584793,0.0078001553,0.007239659,0.016347103,0.006232062,0.004337348,0.000893426],"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.000016640277,0.000021338317,0.00033488683,0.00003832529,0.00000746617,0.000058493726,0.00029079075,0.00079120696,0.000240602,0.9910289,0.0009837911,0.0061875535],"study_design_scores_gemma":[0.000003344649,0.0000029834464,0.000054293076,0.000015526342,0.000005597698,0.000030176228,0.00005024882,0.0035293722,0.00009443647,0.99479115,0.0014166277,0.0000063503708],"about_ca_topic_score_codex":0.00148643,"about_ca_topic_score_gemma":0.0017378216,"teacher_disagreement_score":0.01393465,"about_ca_system_score_codex":0.002172305,"about_ca_system_score_gemma":0.0009965863,"threshold_uncertainty_score":0.021711588},"labels":[],"label_agreement":null},{"id":"W2944171269","doi":"10.1016/j.jctb.2020.07.001","title":"The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Graph; Tree (set theory); Degree (music); Component (thermodynamics); Connected component; Physics","score_opus":0.026241279213906985,"score_gpt":0.29976136910398044,"score_spread":0.2735200898900734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944171269","genre_codex":"other","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.3629976,0.0016815139,0.090834126,0.029071242,0.0035249419,0.00007083908,0.0016368804,0.00077256415,0.50941026],"genre_scores_gemma":[0.9587947,0.0006423296,0.012559155,0.0028675178,0.0010992786,0.000051722393,0.0010303599,0.00013958495,0.022815362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992131,0.00011821286,0.000028858294,0.0002420173,0.00019417355,0.00020365753],"domain_scores_gemma":[0.9972005,0.0013745414,0.00024083932,0.0005310609,0.00036535133,0.000287777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008488351,0.00051324733,0.0009569119,0.0010140452,0.0026589911,0.0035245137,0.0012137111,0.0026676154,0.023339342],"category_scores_gemma":[0.0036095197,0.00047446584,0.00088848156,0.0011455467,0.0038693948,0.00831301,0.0021690188,0.004486131,0.00275147],"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.000099331235,0.000038203023,0.0005408102,0.00010047615,0.000011152874,0.00021209587,0.0001512953,0.000398819,0.0010266566,0.98495954,0.0066100815,0.005851658],"study_design_scores_gemma":[0.000018073519,0.000007025608,0.00028758016,0.000014014753,0.000004533552,0.00016121939,0.00008724,0.0008989211,0.00034331816,0.99403256,0.004138532,0.0000069821185],"about_ca_topic_score_codex":0.0008294098,"about_ca_topic_score_gemma":0.0011336462,"teacher_disagreement_score":0.023339342,"about_ca_system_score_codex":0.00070505036,"about_ca_system_score_gemma":0.00053372566,"threshold_uncertainty_score":0.07807785},"labels":[],"label_agreement":null},{"id":"W2963299469","doi":"10.1016/j.jctb.2013.09.007","title":"The number of rank- k flats in a matroid with no<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-minor","year":2014,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":3,"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":"Office of Naval Research","keywords":"Matroid; Rank (graph theory); Minor (academic); Combinatorics; Mathematics; Prime power; Prime (order theory); Art","score_opus":0.016078731397069643,"score_gpt":0.2519183165433745,"score_spread":0.23583958514630485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963299469","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.921595,0.0004841813,0.027443148,0.0013844022,0.00012551846,0.00006677529,0.0045151324,0.0006132968,0.043772474],"genre_scores_gemma":[0.96845055,0.00024922306,0.009305308,0.00013010304,0.00012517221,0.000070951246,0.0031957235,0.00011962951,0.018353438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978849,0.0003654942,0.00022961649,0.00050967524,0.0004600946,0.00055022753],"domain_scores_gemma":[0.9897697,0.003807924,0.0014295902,0.0010334321,0.0012414847,0.0027178808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012818585,0.00084618945,0.0008402702,0.0028537225,0.0033248984,0.005996424,0.0020317216,0.001545473,0.01836454],"category_scores_gemma":[0.005648619,0.0007751775,0.00086977053,0.0020266348,0.0035199227,0.004866828,0.0021042759,0.0012129194,0.0026814933],"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.0036766918,0.00030513026,0.04452381,0.00090850465,0.00034289024,0.0017927988,0.003082406,0.010956316,0.03185973,0.82912457,0.024629606,0.048797537],"study_design_scores_gemma":[0.00029334275,0.00070912624,0.04262902,0.00024586645,0.00045798082,0.006606418,0.0043131816,0.04407964,0.03195785,0.8340508,0.034231238,0.00042560237],"about_ca_topic_score_codex":0.003205398,"about_ca_topic_score_gemma":0.0038173834,"teacher_disagreement_score":0.01836454,"about_ca_system_score_codex":0.002160117,"about_ca_system_score_gemma":0.0010489393,"threshold_uncertainty_score":0.06143552},"labels":[],"label_agreement":null},{"id":"W2963559342","doi":"10.1016/j.jctb.2018.03.004","title":"Explicit bounds for graph minors","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Homeomorphism (graph theory); Graph; Discrete mathematics","score_opus":0.017899772074264998,"score_gpt":0.2954854718971994,"score_spread":0.2775856998229344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963559342","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.21402825,0.005579881,0.5649517,0.010301037,0.0014676912,0.00037720325,0.0027518438,0.0030596808,0.19748265],"genre_scores_gemma":[0.83617103,0.0036154562,0.09757966,0.0020325156,0.0029495554,0.00057767035,0.0035693366,0.0027815048,0.05072332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961234,0.00090258115,0.0002035699,0.00086429337,0.001100098,0.00080614106],"domain_scores_gemma":[0.96686846,0.02415818,0.0014842303,0.0033311702,0.0017971284,0.002360862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034347593,0.0040902407,0.0028779309,0.005400114,0.0030825825,0.008771095,0.0068400516,0.0034530098,0.031526595],"category_scores_gemma":[0.032254916,0.0022955812,0.0023294785,0.004807617,0.0046766857,0.023454214,0.009599169,0.010646362,0.00607114],"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.0004739078,0.0004372683,0.0017415233,0.0005826,0.00006618583,0.00029394595,0.0011332751,0.011349083,0.0047615254,0.92108583,0.020433929,0.03764098],"study_design_scores_gemma":[0.000037309335,0.00004326894,0.0005213514,0.00007878631,0.00006794351,0.00020301659,0.00011454423,0.029901667,0.001243599,0.96173394,0.0060143885,0.000040275085],"about_ca_topic_score_codex":0.0010093326,"about_ca_topic_score_gemma":0.0023490286,"teacher_disagreement_score":0.031526595,"about_ca_system_score_codex":0.0030970913,"about_ca_system_score_gemma":0.0012381284,"threshold_uncertainty_score":0.10546696},"labels":[],"label_agreement":null},{"id":"W2963637355","doi":"10.1016/j.jctb.2019.02.005","title":"Goldberg's conjecture is true for random multigraphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Multigraph; Combinatorics; Conjecture; Mathematics; Edge coloring; Space (punctuation); Degree (music); Discrete mathematics; Physics; Graph; Computer science","score_opus":0.012289576074293191,"score_gpt":0.27411417064528815,"score_spread":0.26182459457099494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963637355","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.62265015,0.003763805,0.16353548,0.07279175,0.0012649554,0.00015027383,0.0016106622,0.0014579596,0.13277495],"genre_scores_gemma":[0.9669251,0.0013110338,0.014070043,0.0048160036,0.001048691,0.00023749594,0.0004924972,0.000251189,0.010847925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996563,0.0010937187,0.0001756303,0.0010476673,0.0006885339,0.00043141996],"domain_scores_gemma":[0.9571296,0.031393975,0.0021490115,0.006318329,0.0016286941,0.0013804453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044245785,0.0009819326,0.0036725092,0.0029793002,0.003616453,0.0057000965,0.0029805212,0.0063714692,0.008111282],"category_scores_gemma":[0.03693131,0.0014427066,0.0018293696,0.0026917104,0.009299533,0.01741437,0.004882963,0.005911629,0.0011289121],"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.00009832424,0.00003633836,0.0012260082,0.00011549078,0.000039835166,0.000118790595,0.00030023785,0.0027676476,0.00048225152,0.9834517,0.007411651,0.0039517567],"study_design_scores_gemma":[0.000032209384,0.0000074065824,0.0002231976,0.00002002856,0.000011846583,0.000101367994,0.000060033013,0.0042251153,0.00019182317,0.9939203,0.001195028,0.000011498165],"about_ca_topic_score_codex":0.00094730576,"about_ca_topic_score_gemma":0.0008671861,"teacher_disagreement_score":0.008111282,"about_ca_system_score_codex":0.0021415225,"about_ca_system_score_gemma":0.0010694584,"threshold_uncertainty_score":0.027134895},"labels":[],"label_agreement":null},{"id":"W2969413889","doi":"10.1016/j.jctb.2019.08.002","title":"The genus of complete 3-uniform hypergraphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Hypergraph; Conjecture; Genus; Vertex (graph theory); Graph; Discrete mathematics; Botany","score_opus":0.005066796062146385,"score_gpt":0.18156300372263182,"score_spread":0.17649620766048543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969413889","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.8765581,0.0008158323,0.018760743,0.0014860138,0.00014541487,0.000031678806,0.00037249448,0.00023001997,0.10159956],"genre_scores_gemma":[0.988231,0.0005590433,0.0034452141,0.00017704564,0.00013738072,0.00003345054,0.00018607243,0.00008663824,0.007144125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949324,0.00014003253,0.000019905396,0.00009027514,0.00013259175,0.0001239471],"domain_scores_gemma":[0.99784124,0.0010767283,0.00040715307,0.00017785879,0.00014751396,0.00034946122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063519186,0.0005758069,0.00066588796,0.0034887083,0.0019045669,0.0035901722,0.000995085,0.0011914383,0.007523459],"category_scores_gemma":[0.003404152,0.0005682018,0.0004657166,0.0018005043,0.0027972853,0.0033440972,0.002144803,0.0013592144,0.000619425],"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.00015160599,0.00003065133,0.0028987527,0.000064873515,0.000019859257,0.0002662098,0.0007282912,0.0071785776,0.0032909426,0.96989083,0.0026656953,0.012813825],"study_design_scores_gemma":[0.00002528616,0.00002646744,0.003757422,0.00007978652,0.000034761113,0.00034903403,0.0004469255,0.021909093,0.0011943649,0.966225,0.005922998,0.000028834358],"about_ca_topic_score_codex":0.0010815627,"about_ca_topic_score_gemma":0.0011241131,"teacher_disagreement_score":0.007523459,"about_ca_system_score_codex":0.0015960193,"about_ca_system_score_gemma":0.00036714826,"threshold_uncertainty_score":0.025168419},"labels":[],"label_agreement":null},{"id":"W2970565780","doi":"10.1016/j.jctb.2019.08.001","title":"A local epsilon version of Reed's Conjecture","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Conjecture; Clique number; Degree (music); Perfect graph; Graph; Vertex (graph theory); Upper and lower bounds; Chromatic scale","score_opus":0.006527394455921615,"score_gpt":0.24898183700530913,"score_spread":0.2424544425493875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970565780","genre_codex":"other","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.4301507,0.0012364635,0.076654054,0.01854169,0.0022156404,0.00008281854,0.0009937821,0.0009305724,0.46919432],"genre_scores_gemma":[0.94514406,0.00054545206,0.007896311,0.0025322458,0.0012535668,0.00009044465,0.00058695814,0.00019549705,0.041755497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986524,0.00027984908,0.0000587591,0.000418155,0.0002923859,0.00029845056],"domain_scores_gemma":[0.99652964,0.0018551149,0.0002674502,0.000633591,0.0003911473,0.0003230964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145436,0.0012239354,0.0019078056,0.0014140058,0.0022582693,0.003386893,0.0021134636,0.0024444598,0.023727864],"category_scores_gemma":[0.0056441934,0.00057687535,0.0013908248,0.0012999381,0.004076498,0.0078096604,0.0038069598,0.0050127283,0.0033268977],"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.00021016524,0.000053091593,0.00046217244,0.000122007,0.000022270679,0.00024401599,0.0002309669,0.001808326,0.0010314325,0.9817837,0.007280302,0.0067514908],"study_design_scores_gemma":[0.000038249364,0.00001901229,0.00018178794,0.000015336083,0.0000110178125,0.00010831414,0.000055949225,0.0023558035,0.00031148084,0.9943733,0.00251568,0.000014087482],"about_ca_topic_score_codex":0.00092561595,"about_ca_topic_score_gemma":0.00073501153,"teacher_disagreement_score":0.023727864,"about_ca_system_score_codex":0.0015797587,"about_ca_system_score_gemma":0.0006994415,"threshold_uncertainty_score":0.07937759},"labels":[],"label_agreement":null},{"id":"W2992786313","doi":"10.1016/j.jctb.2019.11.004","title":"Stability and exact Turán numbers for matroids","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Mathematics; Term (time); Combinatorics; Matroid; Upper and lower bounds; Type (biology); Class (philosophy); Stability (learning theory); Set (abstract data type); Discrete mathematics; Mathematical analysis; Physics; Computer science; Quantum mechanics","score_opus":0.016346597040299046,"score_gpt":0.274427257906122,"score_spread":0.25808066086582293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992786313","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.83655626,0.0016344979,0.06354183,0.003155644,0.0002568986,0.000039684506,0.0003829907,0.0002065934,0.09422561],"genre_scores_gemma":[0.98533416,0.00044009028,0.004675587,0.00016078241,0.00033728467,0.00005045684,0.00016359963,0.000043738026,0.008794432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931026,0.0001975406,0.000040109546,0.00013403565,0.0002038845,0.00011414111],"domain_scores_gemma":[0.9959785,0.0023345826,0.000547482,0.00022927727,0.0003818554,0.0005283412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032627,0.0006785771,0.00085882004,0.0042132726,0.002478058,0.004714119,0.0014712722,0.0012873496,0.007052136],"category_scores_gemma":[0.007479738,0.0006191735,0.00060104684,0.0019458446,0.004046932,0.0070389723,0.0020853123,0.0022554016,0.00060935953],"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.000030312876,0.00001705132,0.00032599014,0.000021538386,0.000005365891,0.000029742027,0.0002179746,0.0015522545,0.0002876332,0.9948932,0.0006222774,0.0019966292],"study_design_scores_gemma":[0.000006128839,0.000006441027,0.00024988546,0.0000075852668,0.0000037873183,0.000037985697,0.00006613524,0.0055576274,0.00015236098,0.9933656,0.0005390887,0.0000073808924],"about_ca_topic_score_codex":0.0010284499,"about_ca_topic_score_gemma":0.0011986609,"teacher_disagreement_score":0.007052136,"about_ca_system_score_codex":0.0018021187,"about_ca_system_score_gemma":0.0005018012,"threshold_uncertainty_score":0.023591697},"labels":[],"label_agreement":null},{"id":"W3002997249","doi":"10.1016/j.jctb.2020.01.002","title":"Maximum number of colourings: 4-chromatic graphs","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Conjecture; Chromatic scale; Mathematics; Graph; Discrete mathematics","score_opus":0.020092332676251042,"score_gpt":0.2785898590540383,"score_spread":0.2584975263777873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002997249","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.82233506,0.00087868684,0.09279991,0.003841804,0.00023262909,0.00016168223,0.001795212,0.00075906125,0.077196],"genre_scores_gemma":[0.92028445,0.00069477304,0.05326925,0.00063800387,0.00023513396,0.00022920742,0.0013183614,0.00046703898,0.022863787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807227,0.00047685154,0.00013352344,0.00054690335,0.0003162114,0.00045424709],"domain_scores_gemma":[0.98425585,0.010535808,0.0013590036,0.0016326989,0.00084540364,0.0013712209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017487794,0.0013351261,0.0014638096,0.002558733,0.0030317598,0.0072254743,0.004058711,0.0036999898,0.016293932],"category_scores_gemma":[0.008098674,0.0019728427,0.0013875498,0.0030124078,0.0038442435,0.008931131,0.003292488,0.0033425635,0.0016057404],"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.0011462583,0.00024654376,0.004707215,0.0005058489,0.00011396984,0.00045317586,0.0012769918,0.01478503,0.025288425,0.9193606,0.008827451,0.023288408],"study_design_scores_gemma":[0.0001145567,0.00005565526,0.0014337763,0.000051677856,0.00008538354,0.00040670973,0.00030485302,0.024696838,0.0058946167,0.9623837,0.004520238,0.000052094645],"about_ca_topic_score_codex":0.0013314176,"about_ca_topic_score_gemma":0.0028818017,"teacher_disagreement_score":0.016293932,"about_ca_system_score_codex":0.0028096053,"about_ca_system_score_gemma":0.0011237668,"threshold_uncertainty_score":0.054508686},"labels":[],"label_agreement":null},{"id":"W3003586411","doi":"10.1016/j.jctb.2023.12.006","title":"Excluded minors for the Klein bottle II. Cascades","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Klein bottle; Genus; Embedding; Combinatorics; Euler's formula; Euler characteristic; Mathematics; Surface (topology); Discrete mathematics; Computer science; Biology; Geometry; Zoology; Mathematical analysis; Artificial intelligence","score_opus":0.019614385251058644,"score_gpt":0.3024421195788242,"score_spread":0.2828277343277656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003586411","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.616617,0.0013874655,0.0678082,0.0035504112,0.00077671674,0.00025623295,0.00077428063,0.0005306274,0.30829895],"genre_scores_gemma":[0.91441655,0.00055411935,0.013427957,0.0006016434,0.00047451965,0.00018849825,0.00055599556,0.00020839577,0.06957229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994814,0.00009338943,0.000033589076,0.00009738592,0.00017377237,0.00012056458],"domain_scores_gemma":[0.9988795,0.0003529995,0.00016329014,0.000119031654,0.00016796772,0.00031722285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004701781,0.0007058854,0.0007479934,0.001488736,0.0030654357,0.004107506,0.001054801,0.0016419753,0.011794443],"category_scores_gemma":[0.0026797047,0.0005850468,0.0011326433,0.0005342,0.0017298607,0.003468882,0.0024581861,0.002206957,0.0020349885],"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.00006568047,0.000025897716,0.00022039482,0.000034869165,0.0000066875214,0.00019023281,0.00024277996,0.00040124616,0.0020751096,0.9911642,0.0029934514,0.0025794501],"study_design_scores_gemma":[0.00003997475,0.000023795012,0.00036748024,0.000016915807,0.00001413479,0.00039811103,0.00014639333,0.0049170167,0.001071153,0.98649895,0.0064858515,0.000020319456],"about_ca_topic_score_codex":0.0016259575,"about_ca_topic_score_gemma":0.0016081946,"teacher_disagreement_score":0.011794443,"about_ca_system_score_codex":0.0013377685,"about_ca_system_score_gemma":0.0006987955,"threshold_uncertainty_score":0.039456367},"labels":[],"label_agreement":null},{"id":"W3003878869","doi":"10.1016/j.jctb.2023.10.002","title":"Excluded minors for the Klein bottle I. Low connectivity case","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Klein bottle; Combinatorics; Embedding; Mathematics; Robertson–Seymour theorem; Vertex (graph theory); Genus; Euler characteristic; Euler's formula; Discrete mathematics; Graph; 1-planar graph; Computer science; Chordal graph; Artificial intelligence; Geometry; Torus; Biology; Mathematical analysis","score_opus":0.025210782009681694,"score_gpt":0.30544620852283433,"score_spread":0.28023542651315264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003878869","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.77541745,0.0018999719,0.06663311,0.0039246464,0.0005567928,0.000105923915,0.00048314274,0.00035936903,0.15061964],"genre_scores_gemma":[0.97311413,0.0004222691,0.008002331,0.0003860194,0.00037692557,0.00008706664,0.0002762595,0.00007871413,0.017256228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994584,0.00013046373,0.00003695443,0.00009739186,0.0001590319,0.000117749114],"domain_scores_gemma":[0.9980274,0.0008227175,0.00031182208,0.00015049237,0.00019699767,0.00049050135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055633776,0.000672654,0.00071041373,0.002114202,0.0024891922,0.00408741,0.0012317173,0.0017707986,0.007254799],"category_scores_gemma":[0.003392144,0.0005861947,0.0010137863,0.0007945593,0.0025800439,0.0032833638,0.0025166604,0.0022605783,0.001055581],"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.000066467044,0.000030149906,0.0004655491,0.000051834635,0.000009604633,0.00030817167,0.00027291695,0.00067160773,0.0020259833,0.99102235,0.0023228833,0.0027524352],"study_design_scores_gemma":[0.00002606592,0.000021823926,0.00040584253,0.000013309868,0.00001092016,0.00037040535,0.00013822193,0.0053963815,0.0006175157,0.9905996,0.0023813108,0.000018647917],"about_ca_topic_score_codex":0.001529559,"about_ca_topic_score_gemma":0.0014413086,"teacher_disagreement_score":0.007254799,"about_ca_system_score_codex":0.0010958727,"about_ca_system_score_gemma":0.0005857604,"threshold_uncertainty_score":0.02426976},"labels":[],"label_agreement":null},{"id":"W3006616331","doi":"10.1016/j.jctb.2020.02.001","title":"Corrigendum to “Bisimplicial vertices in even-hole-free graphs”","year":2020,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Army Research Office; Air Force Office of Scientific Research; National Science Foundation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.015395560638991857,"score_gpt":0.238693414439034,"score_spread":0.22329785380004213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006616331","genre_codex":"editorial","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.00020503122,0.002470756,0.0011383983,0.069218054,0.9116099,0.00003403293,0.0005061333,0.00023307005,0.014584657],"genre_scores_gemma":[0.011736788,0.012635133,0.0050974893,0.14883669,0.39371505,0.00027053294,0.00292763,0.0011254376,0.4236552],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972493,0.0004936607,0.00026738772,0.00055449404,0.0011843648,0.00025079545],"domain_scores_gemma":[0.9915125,0.00233997,0.00028289875,0.00069357053,0.004688497,0.00048259238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024536618,0.0018484937,0.0020202575,0.003914143,0.0039881244,0.0036465675,0.0044415006,0.005179789,0.05095116],"category_scores_gemma":[0.018020587,0.00096175924,0.00227917,0.0026409833,0.0021657043,0.0035943417,0.0018061959,0.007598462,0.028218959],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00001537326,0.0000068419104,0.00002065808,0.00005902228,0.0000071118693,0.00004512492,0.000009908529,0.000047908143,0.000041384956,0.0018094351,0.9950656,0.00287161],"study_design_scores_gemma":[0.000034200675,0.00002549181,0.0009998477,0.00017133931,0.00006465529,0.00017745385,0.00005663291,0.00066856545,0.00044188843,0.014893078,0.9824227,0.000044153523],"about_ca_topic_score_codex":0.020404613,"about_ca_topic_score_gemma":0.030457027,"teacher_disagreement_score":0.05095116,"about_ca_system_score_codex":0.0050593433,"about_ca_system_score_gemma":0.0028222746,"threshold_uncertainty_score":0.1704486},"labels":[],"label_agreement":null},{"id":"W3014452398","doi":"10.1016/j.jctb.2023.03.004","title":"Graph product structure for non-minor-closed classes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Treewidth; 1-planar graph; Mathematics; Planar graph; Pathwidth; Discrete mathematics; Indifference graph; Partial k-tree; Graph product; Adjacency list; Clique-sum; Chordal graph; Graph; Line graph","score_opus":0.015486756748058885,"score_gpt":0.2911500817685745,"score_spread":0.2756633250205156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014452398","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.7565875,0.00041214202,0.14743012,0.0015820608,0.00021209831,0.00014628345,0.0011212892,0.00051073666,0.09199772],"genre_scores_gemma":[0.9583568,0.0002648981,0.020078683,0.00025252823,0.00022173034,0.00011175724,0.0012807491,0.00026301818,0.019169707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990422,0.00014790872,0.000046319303,0.00036275812,0.00022258173,0.00017821454],"domain_scores_gemma":[0.996318,0.0015036283,0.00043559764,0.00038807737,0.00051067764,0.00084394985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088399334,0.00066177157,0.0011070848,0.0025555587,0.003103393,0.0054018586,0.0020956644,0.0013371031,0.017402487],"category_scores_gemma":[0.0030675188,0.00073534297,0.0010464919,0.0020846229,0.0029818509,0.007212065,0.002347802,0.0025950207,0.0015866167],"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.00006322048,0.00006672449,0.00082683883,0.000033862147,0.000008246123,0.00007663743,0.000489621,0.00036725707,0.0008694662,0.99135935,0.0016019061,0.004236973],"study_design_scores_gemma":[0.000025992498,0.000024904512,0.00079989457,0.000013986695,0.00001913387,0.00016858093,0.00019552557,0.004476016,0.00055028615,0.99044484,0.0032686763,0.000012180451],"about_ca_topic_score_codex":0.0011579738,"about_ca_topic_score_gemma":0.0012498469,"teacher_disagreement_score":0.017402487,"about_ca_system_score_codex":0.0014470987,"about_ca_system_score_gemma":0.0005907349,"threshold_uncertainty_score":0.058217168},"labels":[],"label_agreement":null},{"id":"W3046024813","doi":"10.1016/j.jctb.2023.10.010","title":"Edge-colouring graphs with local list sizes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Generalization; Hypergraph; Edge coloring; Chromatic scale; Degree (music); Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.012261408479186386,"score_gpt":0.26337507367268187,"score_spread":0.2511136651934955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046024813","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.59337026,0.00055395067,0.33289298,0.0025574754,0.00017954608,0.0002006507,0.0015450831,0.0034179145,0.06528216],"genre_scores_gemma":[0.9093125,0.00035591258,0.0644377,0.0005743442,0.00021234326,0.00029865684,0.0008531769,0.00084381993,0.023111535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767286,0.0006596343,0.00014181047,0.00059413415,0.00044777873,0.00048385456],"domain_scores_gemma":[0.96705705,0.02122974,0.0025217517,0.0049592205,0.0018493119,0.0023827902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020125436,0.0011577912,0.001675392,0.002296089,0.0026689896,0.005422398,0.004258136,0.0024793586,0.017634854],"category_scores_gemma":[0.016168347,0.0014728913,0.0012388363,0.0035705378,0.0036925634,0.009353473,0.004113905,0.003531378,0.0022006365],"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.00063911814,0.0002760914,0.0030792113,0.0003351453,0.000075593,0.0005010452,0.0008230516,0.033441376,0.010684153,0.91525495,0.008520823,0.026369577],"study_design_scores_gemma":[0.00009982594,0.00006396828,0.000786001,0.00004475384,0.00008456296,0.0003611154,0.00021896572,0.04794186,0.0040400987,0.94377947,0.0025292914,0.000050073333],"about_ca_topic_score_codex":0.001366505,"about_ca_topic_score_gemma":0.0027469362,"teacher_disagreement_score":0.017634854,"about_ca_system_score_codex":0.0021361082,"about_ca_system_score_gemma":0.0013619277,"threshold_uncertainty_score":0.058994412},"labels":[],"label_agreement":null},{"id":"W3087827845","doi":"10.1016/j.jctb.2022.12.007","title":"Packing A-paths of length zero modulo a prime","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Sleep Foundation; National Science Foundation","keywords":"Mathematics; Modulo; Combinatorics; Prime (order theory); Mod; Abelian group; Property (philosophy); Zero (linguistics); Discrete mathematics","score_opus":0.0252346203530725,"score_gpt":0.29120211964587833,"score_spread":0.26596749929280583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087827845","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.84789556,0.00064405485,0.04314545,0.0012814822,0.0003041479,0.00009534325,0.00048541315,0.0005909008,0.1055576],"genre_scores_gemma":[0.9580654,0.0004903808,0.022670375,0.00026154192,0.00014957126,0.00007739375,0.00043509604,0.00015801823,0.017692223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993735,0.00012685973,0.000050579452,0.00013782187,0.00013549699,0.00017573552],"domain_scores_gemma":[0.99745697,0.0012621566,0.00035352563,0.00039423513,0.00016380526,0.0003693194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005065903,0.00085825555,0.00092802534,0.0020959575,0.0028901554,0.0040456634,0.0010582111,0.0015995556,0.008895349],"category_scores_gemma":[0.0031577311,0.00075451884,0.00061065226,0.0023904922,0.002017364,0.004264807,0.0029329013,0.0021441886,0.0013603605],"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.00042222426,0.00021636876,0.0016495818,0.00013453863,0.00003652327,0.00073205546,0.0009592136,0.0025622207,0.01060815,0.9581002,0.0044687027,0.020110225],"study_design_scores_gemma":[0.000049442013,0.00012142654,0.00074563816,0.000044211632,0.000029307728,0.00062616187,0.00047207493,0.007089209,0.004461777,0.9816118,0.0047291648,0.000019681684],"about_ca_topic_score_codex":0.0005299124,"about_ca_topic_score_gemma":0.0005208617,"teacher_disagreement_score":0.008895349,"about_ca_system_score_codex":0.0007449903,"about_ca_system_score_gemma":0.0005665589,"threshold_uncertainty_score":0.029757857},"labels":[],"label_agreement":null},{"id":"W3088215122","doi":"10.1016/j.jctb.2023.02.011","title":"Packing cycles in undirected group-labelled graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Abelian group; Element (criminal law); Group (periodic table); Undirected graph; Integer (computer science); Order (exchange); Cyclic group; Graph; Discrete mathematics; Property (philosophy)","score_opus":0.02458348691211084,"score_gpt":0.29347984964724433,"score_spread":0.2688963627351335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088215122","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.8496251,0.0009415713,0.08545287,0.0009693573,0.00018785972,0.00008624615,0.00036887586,0.00038868756,0.061979443],"genre_scores_gemma":[0.9640342,0.00067526527,0.020117754,0.00026455586,0.00015941034,0.00013240446,0.0004450571,0.00017538015,0.013995987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991972,0.0002546842,0.00005418931,0.00015512954,0.00018692824,0.00015197304],"domain_scores_gemma":[0.9950499,0.0028998223,0.0008177335,0.00034934044,0.00030411573,0.00057906774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006837738,0.0006283125,0.0009436561,0.0035586855,0.0026149873,0.004866161,0.0017477126,0.0020239402,0.0070287813],"category_scores_gemma":[0.0054473598,0.0011853323,0.0007654736,0.003499861,0.0031276406,0.00497881,0.002154111,0.0015467788,0.00080591196],"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.00007549073,0.00007398996,0.00078411185,0.00007968804,0.000015774298,0.00023926882,0.0007715233,0.004231879,0.0014454658,0.98239774,0.0017862353,0.008098754],"study_design_scores_gemma":[0.000012491953,0.00001272839,0.0002566302,0.000024120309,0.000009766206,0.00011268177,0.00015045864,0.010436149,0.00043227233,0.98746455,0.0010792662,0.000008936558],"about_ca_topic_score_codex":0.0016377447,"about_ca_topic_score_gemma":0.0021199004,"teacher_disagreement_score":0.0070287813,"about_ca_system_score_codex":0.0012503488,"about_ca_system_score_gemma":0.0005956778,"threshold_uncertainty_score":0.023513615},"labels":[],"label_agreement":null},{"id":"W3102338202","doi":"10.1016/j.jctb.2015.12.009","title":"Quantum homomorphisms","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"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":"Homomorphism; Graph homomorphism; Mathematics; Discrete mathematics; Combinatorics; Quantum; Graph; Line graph; Graph power; Quantum mechanics","score_opus":0.006803118382228696,"score_gpt":0.2154634902829134,"score_spread":0.2086603719006847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102338202","genre_codex":"other","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.16413878,0.0015633107,0.13987808,0.008883689,0.0029927671,0.00015505584,0.00046184938,0.0006600147,0.68126637],"genre_scores_gemma":[0.831929,0.001061245,0.023040446,0.0017766283,0.0017362011,0.00015344343,0.0003539083,0.0003686777,0.13958037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992353,0.00016807867,0.000034685454,0.00017292654,0.0002413006,0.00014777105],"domain_scores_gemma":[0.99917644,0.00021747952,0.00006378959,0.0001905635,0.00018048282,0.00017121439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006939989,0.00048431882,0.00067787577,0.0017503236,0.002891783,0.0030718953,0.00089525944,0.0013659839,0.021762699],"category_scores_gemma":[0.0021682687,0.00046533372,0.0007683251,0.0010990796,0.003366758,0.0061464086,0.0027724484,0.0030600082,0.0029083537],"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.000004052555,0.000007848977,0.00001880607,0.0000049172195,0.0000014901667,0.0000075142284,0.00004486294,0.000038003618,0.00012579652,0.997449,0.0007527609,0.0015449253],"study_design_scores_gemma":[0.0000056501317,0.000004857224,0.000062228515,0.0000041896415,0.000002685803,0.00004819919,0.00003726851,0.000547416,0.00025406058,0.9930085,0.0060193227,0.0000056874337],"about_ca_topic_score_codex":0.0005605339,"about_ca_topic_score_gemma":0.00037437066,"teacher_disagreement_score":0.021762699,"about_ca_system_score_codex":0.001383626,"about_ca_system_score_gemma":0.0007378433,"threshold_uncertainty_score":0.0728035},"labels":[],"label_agreement":null},{"id":"W3132307481","doi":"10.1016/j.jctb.2021.02.001","title":"Connectivity and choosability of graphs with no K minor","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Minor (academic); Mathematics; Graph; Conjecture; Graph minor; Upper and lower bounds; Discrete mathematics; Graph power; Line graph","score_opus":0.00907079580733079,"score_gpt":0.2509396275268328,"score_spread":0.24186883171950202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132307481","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.9609342,0.00021274916,0.017522814,0.00062006956,0.000036397952,0.000046276906,0.00056923006,0.00015567333,0.019902568],"genre_scores_gemma":[0.99051195,0.00020786117,0.0045512835,0.00013136824,0.000067693676,0.00005294672,0.00078954856,0.000090331734,0.0035971443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994106,0.00011428296,0.000045100085,0.00021082874,0.00009719894,0.00012189258],"domain_scores_gemma":[0.9910357,0.0059969663,0.0012989506,0.0006024498,0.00030602294,0.0007599181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045232233,0.00059703365,0.0008758975,0.0011023028,0.001477412,0.0033077833,0.0015171625,0.0012328129,0.009266127],"category_scores_gemma":[0.0059892284,0.0010430635,0.0009353863,0.0011534387,0.0021524152,0.0033040612,0.0015250585,0.0014927818,0.0006658308],"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.003038263,0.0006157158,0.035815146,0.00071489334,0.00020098791,0.0029201836,0.0044069206,0.02503809,0.05503292,0.8300722,0.009379779,0.03276483],"study_design_scores_gemma":[0.00055575615,0.0003379398,0.027070537,0.00010485368,0.00025798616,0.0031900727,0.001772441,0.056121085,0.011646078,0.8941225,0.0046980176,0.00012266719],"about_ca_topic_score_codex":0.0017666547,"about_ca_topic_score_gemma":0.0019795094,"teacher_disagreement_score":0.009266127,"about_ca_system_score_codex":0.00066156726,"about_ca_system_score_gemma":0.00052957033,"threshold_uncertainty_score":0.03099835},"labels":[],"label_agreement":null},{"id":"W3143193920","doi":"10.1016/j.jctb.2023.09.002","title":"Intersecting families of sets are typically trivial","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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 Waterloo","funders":"","keywords":"Lemma (botany); Combinatorics; Mathematics; Graph; Container (type theory); Discrete mathematics; Biology","score_opus":0.02700673949303215,"score_gpt":0.2992173281957878,"score_spread":0.2722105887027556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143193920","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.6041214,0.0019811387,0.15670861,0.0015506754,0.00058939174,0.00013047065,0.0017287595,0.0016950362,0.2314945],"genre_scores_gemma":[0.94747853,0.00064307655,0.025498258,0.00021952731,0.00016878905,0.0001447025,0.001312528,0.00031419515,0.024220489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740916,0.00050470914,0.0002255028,0.00078946707,0.00064578094,0.00042537914],"domain_scores_gemma":[0.990991,0.004409384,0.00093025435,0.0017817524,0.0011997974,0.0006878741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010371493,0.0006254611,0.0012284478,0.0038754754,0.0052598515,0.006078263,0.0017473442,0.0017444514,0.018394642],"category_scores_gemma":[0.011366273,0.0009569492,0.00093390705,0.0046973242,0.0046870094,0.011650826,0.0046768454,0.002373282,0.0023009782],"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.000044805976,0.00003643683,0.0021680458,0.00008559264,0.000020300584,0.00060369214,0.00084834924,0.0003581628,0.00072728074,0.9827351,0.0021891694,0.010183176],"study_design_scores_gemma":[0.0000061226247,0.000012579834,0.00080279127,0.000044770444,0.000017552935,0.0011420572,0.00072869123,0.0010810008,0.0009406159,0.9823744,0.012829932,0.000019532195],"about_ca_topic_score_codex":0.00045100183,"about_ca_topic_score_gemma":0.0006222537,"teacher_disagreement_score":0.018394642,"about_ca_system_score_codex":0.0010976352,"about_ca_system_score_gemma":0.0005610393,"threshold_uncertainty_score":0.061536252},"labels":[],"label_agreement":null},{"id":"W3157297330","doi":"10.1016/j.jctb.2024.03.001","title":"Typical structure of hereditary properties of binary matroids","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Matroid; Mathematics; Binary number; Graph; Combinatorics; Graphic matroid; Discrete mathematics; Arithmetic","score_opus":0.012493392506069081,"score_gpt":0.258757780643422,"score_spread":0.2462643881373529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157297330","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.93846846,0.000491109,0.033805944,0.00076144614,0.00003689267,0.000042560994,0.0010901715,0.00025996045,0.025043448],"genre_scores_gemma":[0.9924942,0.00019306058,0.0050954847,0.000056126046,0.00010197501,0.00003600023,0.0006345749,0.00003561466,0.00135291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991918,0.00017267678,0.00006008105,0.00023711356,0.00022087718,0.00011755516],"domain_scores_gemma":[0.99304456,0.0039303615,0.0011454014,0.0006162593,0.0006385347,0.00062482007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006789102,0.00036014995,0.00066462817,0.0024174626,0.0014693771,0.0028146182,0.0010259906,0.0007793349,0.005513053],"category_scores_gemma":[0.0047479253,0.0005682549,0.00048358995,0.0028774356,0.0019546044,0.0041903425,0.00086242,0.0010224062,0.00031610433],"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.00020818206,0.00015725949,0.0074629583,0.00022010122,0.000053589418,0.00039886037,0.0007739388,0.0034237423,0.007280293,0.95931906,0.0032570993,0.017444847],"study_design_scores_gemma":[0.000046111192,0.000056864996,0.006882017,0.00003534881,0.00004389977,0.0011072335,0.00034506273,0.015368251,0.002921473,0.9706497,0.002511589,0.000032565626],"about_ca_topic_score_codex":0.0003311542,"about_ca_topic_score_gemma":0.00046614927,"teacher_disagreement_score":0.005513053,"about_ca_system_score_codex":0.0010190643,"about_ca_system_score_gemma":0.00034907667,"threshold_uncertainty_score":0.018442988},"labels":[],"label_agreement":null},{"id":"W3181044363","doi":"10.1016/j.jctb.2022.04.004","title":"Structure in sparse k-critical graphs","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"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":"Combinatorics; Disjoint sets; Conjecture; Mathematics; Corollary; Graph; Upper and lower bounds; Discrete mathematics","score_opus":0.017049024680044603,"score_gpt":0.2849124472556697,"score_spread":0.2678634225756251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181044363","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.90119064,0.00073841074,0.030054316,0.0022614512,0.000127745,0.000050469254,0.0002637846,0.00020334533,0.06510983],"genre_scores_gemma":[0.98829925,0.00030527136,0.004143825,0.00019449565,0.00014668092,0.00003666701,0.0001950317,0.000052048912,0.006626684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968684,0.00008509869,0.000015601143,0.000058735204,0.000085593885,0.00006814222],"domain_scores_gemma":[0.9965359,0.0017864772,0.0005157812,0.00017824395,0.00042283896,0.0005607891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004614334,0.00046309156,0.00072336086,0.003727144,0.0021446275,0.0034658748,0.0010759302,0.001176567,0.006490225],"category_scores_gemma":[0.005025349,0.0005714145,0.0003640255,0.0014917388,0.0030679272,0.0040589576,0.0016832647,0.0015510641,0.00047222315],"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.000028250337,0.000020202971,0.00049655343,0.000037904643,0.0000039417355,0.00007971136,0.0003182652,0.0010038812,0.00053753756,0.9947497,0.00093997363,0.0017841163],"study_design_scores_gemma":[0.000009973958,0.0000073966294,0.00029911147,0.000015554495,0.0000041923404,0.00010288019,0.00016028708,0.004434602,0.00019391038,0.99408805,0.0006780519,0.0000060483344],"about_ca_topic_score_codex":0.0015092993,"about_ca_topic_score_gemma":0.0022797827,"teacher_disagreement_score":0.006490225,"about_ca_system_score_codex":0.0012397191,"about_ca_system_score_gemma":0.00053341413,"threshold_uncertainty_score":0.021712005},"labels":[],"label_agreement":null},{"id":"W3196344216","doi":"10.1016/j.jctb.2023.10.005","title":"Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"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":"Combinatorics; Mathematics; Treewidth; Bounded function; Disjoint sets; Discrete mathematics; Degree (music); Conjecture; Vertex (graph theory); Clique-sum; 1-planar graph; Induced subgraph; Graph; Pathwidth; Chordal graph; Line graph","score_opus":0.035810595052561615,"score_gpt":0.2923976960918472,"score_spread":0.25658710103928556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196344216","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.81796896,0.0010541661,0.15165803,0.0007261437,0.000058850153,0.000096122516,0.0007560763,0.00030784457,0.027373714],"genre_scores_gemma":[0.9360144,0.0008917259,0.047679875,0.0002372543,0.000080008416,0.00014975977,0.0013679279,0.00018173389,0.013397311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999765,0.000059788817,0.000012004759,0.000053593274,0.000042606905,0.00006707457],"domain_scores_gemma":[0.99843246,0.00076829945,0.00032471822,0.00009857486,0.00013011745,0.0002458647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027795145,0.00037780104,0.00045528205,0.0014181054,0.00090617104,0.0024854194,0.0006449635,0.00089185603,0.0059349476],"category_scores_gemma":[0.0018799012,0.00067185896,0.00062309246,0.0014090623,0.0011345277,0.0022485584,0.0009512745,0.0014566116,0.0008423],"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.00012197462,0.000081061444,0.0031731122,0.00011089109,0.000017745637,0.00028386034,0.000995328,0.0071916943,0.007434376,0.9598602,0.003080721,0.01764908],"study_design_scores_gemma":[0.000029420898,0.00004420966,0.0027224955,0.000057259913,0.000023807941,0.00030494688,0.0007760121,0.040382944,0.0021711278,0.94956994,0.0038984315,0.000019371673],"about_ca_topic_score_codex":0.0009981827,"about_ca_topic_score_gemma":0.0014569889,"teacher_disagreement_score":0.0059349476,"about_ca_system_score_codex":0.00046098567,"about_ca_system_score_gemma":0.00030282987,"threshold_uncertainty_score":0.019854426},"labels":[],"label_agreement":null},{"id":"W4205300480","doi":"10.1016/j.jctb.2015.02.003","title":"Projective geometries in exponentially dense matroids. I","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"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":"Matroid; Combinatorics; Mathematics; Rank (graph theory); Graphic matroid; Integer (computer science); Prime (order theory); Prime power; Matroid partitioning; Discrete mathematics; Computer science","score_opus":0.02429588280191961,"score_gpt":0.28916004476698653,"score_spread":0.2648641619650669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205300480","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.58291703,0.008238926,0.120439656,0.008980186,0.00084967003,0.00009519728,0.0021696142,0.0005491237,0.27576065],"genre_scores_gemma":[0.9630136,0.002005072,0.011201673,0.00042887114,0.00095973385,0.00005248421,0.0010621838,0.00009241402,0.021184012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929917,0.0002112377,0.000033458535,0.0001601348,0.00014742592,0.00014846236],"domain_scores_gemma":[0.9972881,0.0015254619,0.00033179994,0.00023662976,0.00023428704,0.0003837197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050957577,0.000634451,0.0006708436,0.001347683,0.0014597491,0.0032718533,0.000928545,0.00089346303,0.013439227],"category_scores_gemma":[0.0038597572,0.000752943,0.0006425119,0.0014177455,0.002879835,0.0068470873,0.0027173168,0.0035290061,0.0016255699],"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.000050315055,0.000027116574,0.0009407947,0.00009971221,0.000011280607,0.00011233323,0.00026605141,0.0013186092,0.0006709423,0.98400855,0.006241968,0.0062524006],"study_design_scores_gemma":[0.000014146437,0.000025481926,0.0009763476,0.000029723851,0.000010623035,0.00032779863,0.0001808221,0.0032191388,0.00036146093,0.9899329,0.0049114097,0.000010042744],"about_ca_topic_score_codex":0.000858908,"about_ca_topic_score_gemma":0.0009996502,"teacher_disagreement_score":0.013439227,"about_ca_system_score_codex":0.0013249846,"about_ca_system_score_gemma":0.0003756072,"threshold_uncertainty_score":0.04495871},"labels":[],"label_agreement":null},{"id":"W4205800876","doi":"10.1016/j.jctb.2010.08.001","title":"On inequivalent representations of matroids over non-prime fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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":"Matroid; Prime (order theory); Combinatorics; Finite field; Mathematics; Order (exchange); Mace; Graphic matroid; Field (mathematics); Discrete mathematics; Pure mathematics","score_opus":0.009937836447893521,"score_gpt":0.3008611600237114,"score_spread":0.29092332357581785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205800876","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.8128921,0.0008585592,0.057790726,0.0032835852,0.000638581,0.00009850881,0.00038119213,0.00023603669,0.12382069],"genre_scores_gemma":[0.96810067,0.0005525735,0.012622041,0.00048424467,0.00043838946,0.00005998199,0.00045308727,0.00014672504,0.017142268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985876,0.00040821414,0.000104852465,0.0002033599,0.0003510425,0.00034489352],"domain_scores_gemma":[0.9973302,0.0011964942,0.00039050545,0.00036594516,0.00029035375,0.0004265133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015096075,0.00091650273,0.0009975268,0.0023754688,0.0024307854,0.0053080367,0.0015765992,0.002344728,0.013301971],"category_scores_gemma":[0.004298992,0.0006555423,0.0010088639,0.0021185835,0.003239221,0.008360157,0.0029099318,0.0038263714,0.001057623],"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.000060761944,0.000057752095,0.00024805928,0.000023804347,0.0000047636395,0.00011860577,0.0003649145,0.0005370102,0.00063723145,0.9924649,0.00078848074,0.004693847],"study_design_scores_gemma":[0.000019135421,0.000017716131,0.00015379519,0.000013908694,0.0000055269115,0.00010714776,0.00020602261,0.002602278,0.00025668408,0.9955481,0.0010613533,0.000008277057],"about_ca_topic_score_codex":0.000563166,"about_ca_topic_score_gemma":0.0009434094,"teacher_disagreement_score":0.013301971,"about_ca_system_score_codex":0.0017096903,"about_ca_system_score_gemma":0.00048051475,"threshold_uncertainty_score":0.044499516},"labels":[],"label_agreement":null},{"id":"W4221138707","doi":"10.1016/j.jctb.2022.09.001","title":"A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"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":"Combinatorics; Counterexample; Mathematics; Conjecture; Digraph; Clique number; Omega; Bounded function; Induced subgraph; Chromatic scale; Graph; Discrete mathematics; Clique; Vertex (graph theory); Physics","score_opus":0.016087984959408344,"score_gpt":0.27068684073979277,"score_spread":0.25459885578038444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221138707","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.79127157,0.00097360637,0.06248151,0.039919496,0.001047003,0.000105112835,0.0015580849,0.0014931933,0.101150356],"genre_scores_gemma":[0.9792181,0.000441402,0.01042231,0.0019125124,0.0006317891,0.0000927839,0.0012224767,0.0002045306,0.005854163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979619,0.0004719676,0.0001118034,0.0007073528,0.0004223426,0.0003246113],"domain_scores_gemma":[0.9739754,0.020529808,0.0013323962,0.002107213,0.0008733393,0.001181721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018908413,0.0008048008,0.00136987,0.0019274994,0.0038464991,0.0044743,0.0033657504,0.004776877,0.015036937],"category_scores_gemma":[0.015949173,0.0012819293,0.0014044264,0.0030296375,0.005792843,0.009616943,0.004158439,0.0049481853,0.0010497841],"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.0006141439,0.00018885014,0.003978979,0.0003360536,0.000054556425,0.001197296,0.0017908071,0.0057161315,0.004257438,0.9508526,0.021691574,0.00932155],"study_design_scores_gemma":[0.00018233634,0.000049684477,0.0014260116,0.00004709481,0.00004962746,0.0011774489,0.00057465216,0.021207755,0.0018053373,0.9674664,0.005976187,0.00003748043],"about_ca_topic_score_codex":0.0020481553,"about_ca_topic_score_gemma":0.0017628832,"teacher_disagreement_score":0.015036937,"about_ca_system_score_codex":0.0016471392,"about_ca_system_score_gemma":0.0006488403,"threshold_uncertainty_score":0.05030358},"labels":[],"label_agreement":null},{"id":"W4289222390","doi":"10.1016/j.jctb.2022.06.002","title":"Bounding χ by a fraction of Δ for graphs without large cliques","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Degree (music); Upper and lower bounds; Conjecture; Discrete mathematics; Vertex (graph theory); Brooks' theorem; Bounding overwatch; Fractional coloring; Graph; Clique; Chromatic scale; Graph coloring; Greedy coloring; Clique number; Chordal graph; Graph power; Line graph; 1-planar graph; Computer science","score_opus":0.012658909168851392,"score_gpt":0.30400812249916687,"score_spread":0.2913492133303155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289222390","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.31509253,0.005369253,0.6092999,0.012445437,0.00091897347,0.00021943118,0.0018422859,0.0056216563,0.04919043],"genre_scores_gemma":[0.87912387,0.0014151628,0.10660449,0.0016924113,0.0007004832,0.0002135964,0.0008637197,0.0014971357,0.007889092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944916,0.0015961165,0.00018209899,0.0015439986,0.00094397465,0.0012423219],"domain_scores_gemma":[0.92309326,0.062154245,0.0024654358,0.008212443,0.0013559011,0.002718677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058714612,0.0030619246,0.0024122864,0.002603387,0.0022321153,0.0041484614,0.0061849216,0.0030619886,0.00744134],"category_scores_gemma":[0.05201118,0.0014930954,0.0018681474,0.0019997424,0.004159642,0.014695781,0.004688318,0.005525902,0.0018063963],"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.0031393452,0.0008162836,0.013580656,0.001546215,0.00041637605,0.00055340386,0.0007478348,0.42080382,0.031224893,0.4066506,0.026263267,0.09425728],"study_design_scores_gemma":[0.00006383265,0.00010599325,0.0012914586,0.000117178366,0.00011145264,0.00026607796,0.00011263303,0.66824645,0.008587579,0.3175993,0.0034481997,0.000049907874],"about_ca_topic_score_codex":0.0026422008,"about_ca_topic_score_gemma":0.003045335,"teacher_disagreement_score":0.00744134,"about_ca_system_score_codex":0.0036969816,"about_ca_system_score_gemma":0.0020752659,"threshold_uncertainty_score":0.031051636},"labels":[],"label_agreement":null},{"id":"W4321763399","doi":"10.1016/j.jctb.2023.02.003","title":"Proper orientations and proper chromatic number","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Windmill graph; Chromatic scale; Friendship graph; Graph; Vertex (graph theory); Critical graph; Orientation (vector space); Mathematical proof; Discrete mathematics; Graph power; Line graph; Geometry","score_opus":0.010523207752898929,"score_gpt":0.24193141275374938,"score_spread":0.23140820500085046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321763399","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.66573894,0.0027582229,0.13347207,0.012504264,0.000617309,0.00014077745,0.0013949289,0.00046652686,0.1829071],"genre_scores_gemma":[0.94889796,0.0015139148,0.02716389,0.0008225857,0.00053412345,0.00011857353,0.00089420355,0.00022609158,0.019828748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998816,0.00030415846,0.000052933003,0.000402537,0.00018357916,0.0002407627],"domain_scores_gemma":[0.9891044,0.007051599,0.0011971889,0.00096555095,0.0005400689,0.0011413649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013659066,0.0008813584,0.0012362495,0.0022235487,0.0035046292,0.0059721945,0.00230791,0.0019269777,0.014687153],"category_scores_gemma":[0.0076131257,0.001493775,0.0009458492,0.0035633468,0.006576681,0.012010094,0.0028432722,0.004989421,0.0010601135],"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.0001492192,0.0000843082,0.0022508188,0.0000821475,0.000013677964,0.000048158192,0.00039407716,0.0027655698,0.0010947377,0.98026156,0.005368071,0.007487723],"study_design_scores_gemma":[0.000036774123,0.000013426621,0.0010454899,0.000020173458,0.000019923318,0.00009139441,0.00019124188,0.006141492,0.00051563146,0.9889231,0.0029816513,0.000019683544],"about_ca_topic_score_codex":0.0033645525,"about_ca_topic_score_gemma":0.004521734,"teacher_disagreement_score":0.014687153,"about_ca_system_score_codex":0.003014925,"about_ca_system_score_gemma":0.0011380141,"threshold_uncertainty_score":0.04913342},"labels":[],"label_agreement":null},{"id":"W4362704061","doi":"10.1016/j.jctb.2023.03.002","title":"Disjoint isomorphic balanced clique subdivisions","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"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 Victoria","funders":"Institute for Basic Science; Leverhulme Trust; UK Research and Innovation","keywords":"Combinatorics; Mathematics; Subdivision; Conjecture; Disjoint sets; Vertex (graph theory); Graph; Clique; Clique graph; Upper and lower bounds; Discrete mathematics; Line graph; Graph power","score_opus":0.026838286675701328,"score_gpt":0.30097029089983707,"score_spread":0.27413200422413575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362704061","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.8383828,0.00057317154,0.09263264,0.0008631235,0.0000847341,0.00011583912,0.000663012,0.00034549597,0.06633927],"genre_scores_gemma":[0.967888,0.0002532059,0.017645823,0.00021050604,0.00006646,0.00009625837,0.001165167,0.00007154789,0.012603146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900216,0.00013699582,0.00003454013,0.0003316844,0.0002657798,0.00022880449],"domain_scores_gemma":[0.998228,0.00055279606,0.00018202404,0.0004742414,0.0002130936,0.00034973735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003539906,0.00034961852,0.00052024145,0.0007841797,0.001257483,0.0015306481,0.0010505059,0.00066221476,0.0074227178],"category_scores_gemma":[0.0035889803,0.00042464532,0.0006057904,0.0008721835,0.0013583545,0.0025300533,0.0024089783,0.0011653645,0.000544645],"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.00029600633,0.0001222057,0.004139691,0.00012589461,0.000051629315,0.0003655551,0.0010589623,0.012591786,0.019955764,0.9238959,0.0046378644,0.032758728],"study_design_scores_gemma":[0.00011804571,0.000081308,0.004229576,0.000033671397,0.00006820569,0.00072224444,0.0004690128,0.054602508,0.009888773,0.9080345,0.021725867,0.000026252139],"about_ca_topic_score_codex":0.0019189387,"about_ca_topic_score_gemma":0.0028243728,"teacher_disagreement_score":0.0074227178,"about_ca_system_score_codex":0.0011006251,"about_ca_system_score_gemma":0.0004655826,"threshold_uncertainty_score":0.024831474},"labels":[],"label_agreement":null},{"id":"W4381433330","doi":"10.1016/j.jctb.2023.05.004","title":"Local Hadwiger's Conjecture","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Conjecture; Minor (academic); Complement (music); Mathematics; Graph; Vertex (graph theory); Discrete mathematics; Biology; Humanities","score_opus":0.012895943215520312,"score_gpt":0.27703519847462554,"score_spread":0.26413925525910525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381433330","genre_codex":"other","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.2805788,0.0018068659,0.05507215,0.037551638,0.0025991711,0.00012044146,0.0013085156,0.0012907726,0.6196717],"genre_scores_gemma":[0.913439,0.0006872995,0.007412832,0.0043651517,0.0015418625,0.00017758257,0.000834195,0.00024600315,0.071296155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879116,0.00025386672,0.000048456528,0.00034900347,0.0002257272,0.00033183926],"domain_scores_gemma":[0.9975661,0.0010952158,0.00014589397,0.0006047736,0.0002530485,0.00033493474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551522,0.0010985736,0.002414408,0.0020039254,0.004476866,0.004840044,0.0030136898,0.0033871476,0.030760465],"category_scores_gemma":[0.0050994605,0.00077706267,0.0016562903,0.0023839988,0.0056331917,0.012670036,0.005751795,0.0064354464,0.004723045],"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.000053224056,0.00003241582,0.00022120061,0.000047091165,0.000009065626,0.00006731931,0.00016065744,0.00052193494,0.00013565482,0.9898179,0.0063891965,0.0025441963],"study_design_scores_gemma":[0.000029370683,0.000005453244,0.00010375372,0.000009413289,0.000006981433,0.00004116205,0.000054113254,0.00071372703,0.000110968605,0.9962373,0.0026799412,0.000007694077],"about_ca_topic_score_codex":0.0018434233,"about_ca_topic_score_gemma":0.0016614167,"teacher_disagreement_score":0.030760465,"about_ca_system_score_codex":0.0024383224,"about_ca_system_score_gemma":0.0010732138,"threshold_uncertainty_score":0.10290402},"labels":[],"label_agreement":null},{"id":"W4381615661","doi":"10.1016/j.jctb.2023.06.003","title":"On 2-cycles of graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"McGill University","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Skew; Graph; Cycle basis; Vertex (graph theory); Discrete mathematics; Physics; Line graph; Graph power","score_opus":0.007034065921966524,"score_gpt":0.2091723375639919,"score_spread":0.20213827164202536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381615661","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.6290975,0.0049144677,0.13415495,0.0039105997,0.0010297095,0.00026294263,0.0010859467,0.00031578794,0.22522797],"genre_scores_gemma":[0.90261143,0.0030478677,0.03140633,0.0013256258,0.0008783801,0.00030452732,0.0009690298,0.00028702084,0.059169803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907494,0.00029837986,0.00005143095,0.00018687686,0.0001978536,0.00019055213],"domain_scores_gemma":[0.997145,0.0015901743,0.00038058162,0.00018776838,0.00031140563,0.00038498815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062628905,0.0014303984,0.0010945183,0.0049001947,0.0022924696,0.004207311,0.0014760758,0.002011568,0.01167018],"category_scores_gemma":[0.0037957896,0.0010770895,0.0012494737,0.0034550582,0.0026910473,0.0046144403,0.0024694907,0.0021134496,0.0011105563],"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.00005641696,0.000034354936,0.0003791749,0.00006248941,0.000012811402,0.0001565053,0.0005189165,0.0024841733,0.0008108674,0.9855278,0.002424956,0.007531597],"study_design_scores_gemma":[0.000011143788,0.000009789555,0.0002011133,0.000028386186,0.0000057522498,0.00006635341,0.00008836096,0.005899833,0.00018650242,0.99043536,0.0030579236,0.000009435079],"about_ca_topic_score_codex":0.0032674414,"about_ca_topic_score_gemma":0.0039840103,"teacher_disagreement_score":0.01167018,"about_ca_system_score_codex":0.001935742,"about_ca_system_score_gemma":0.0007438308,"threshold_uncertainty_score":0.039040625},"labels":[],"label_agreement":null},{"id":"W4382864813","doi":"10.1016/j.jctb.2023.06.004","title":"Every graph is eventually Turán-good","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Toronto Metropolitan University; Simon Fraser University; University of Victoria","funders":"","keywords":"Combinatorics; Conjecture; Graph; Mathematics; Discrete mathematics","score_opus":0.021264963002842956,"score_gpt":0.2863046884261066,"score_spread":0.26503972542326365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382864813","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.5859237,0.0016723116,0.09832472,0.007277632,0.00062167697,0.00011504069,0.0010167484,0.0014300437,0.30361816],"genre_scores_gemma":[0.94637644,0.00080089096,0.012901212,0.0012269418,0.00025611857,0.00013218098,0.0005944223,0.00024496712,0.03746682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904627,0.00020243721,0.000040812847,0.00026376414,0.00018107025,0.0002656324],"domain_scores_gemma":[0.9953615,0.0024271887,0.00036047382,0.0005651648,0.000634162,0.0006514197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010324105,0.00095958554,0.0018282293,0.002458826,0.0052659526,0.0055404846,0.0012563283,0.0015454441,0.009170823],"category_scores_gemma":[0.003204598,0.0011053897,0.0016432467,0.0026351796,0.0057469266,0.0077457894,0.0033378475,0.0033269562,0.0010441865],"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.000053762065,0.000019451061,0.00037489404,0.00006575749,0.000025362435,0.00011422499,0.00045649667,0.0006205664,0.0005248663,0.9926588,0.0023594468,0.002726394],"study_design_scores_gemma":[0.000012799718,0.000015606141,0.00030600672,0.000016339272,0.000021494963,0.00014014138,0.00017117408,0.00095975795,0.00028790292,0.9944681,0.0035893968,0.0000111533645],"about_ca_topic_score_codex":0.0018072581,"about_ca_topic_score_gemma":0.0029694496,"teacher_disagreement_score":0.009170823,"about_ca_system_score_codex":0.00184672,"about_ca_system_score_gemma":0.00078196643,"threshold_uncertainty_score":0.030679464},"labels":[],"label_agreement":null},{"id":"W4386266281","doi":"10.1016/j.jctb.2023.08.001","title":"A proof of the tree alternative conjecture under the topological minor relation","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"York University","funders":"","keywords":"Mathematics; Conjecture; Minor (academic); Equivalence relation; Relation (database); Combinatorics; Tree (set theory); Isomorphism (crystallography); Congruence relation; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.023536585466061296,"score_gpt":0.2928676424930599,"score_spread":0.2693310570269986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386266281","genre_codex":"other","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.314388,0.0036520434,0.25731596,0.05049,0.006521191,0.00017777483,0.0014252651,0.0015706118,0.36445913],"genre_scores_gemma":[0.9291161,0.0017520249,0.03783745,0.0042519025,0.003344015,0.0001286922,0.00096152123,0.00037751623,0.022230772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989002,0.00024142429,0.000057254278,0.0002809693,0.00033622058,0.00018386902],"domain_scores_gemma":[0.9924819,0.0047912337,0.0005059651,0.0010337036,0.0006539282,0.0005333019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016341085,0.00077721523,0.0012302551,0.0012750257,0.0020434714,0.003012027,0.0021307992,0.0024404747,0.018139487],"category_scores_gemma":[0.008440525,0.00068515365,0.0015954716,0.0015269432,0.0048642033,0.00921071,0.0054902793,0.0058137467,0.002267265],"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.00008711155,0.00004699966,0.0002941507,0.00010833022,0.000015210841,0.00028499353,0.00020340568,0.0005319482,0.0011828701,0.9862142,0.00622791,0.0048027947],"study_design_scores_gemma":[0.00003849976,0.000022633467,0.00023160517,0.00002238444,0.000014194965,0.0002229363,0.00007709037,0.002236292,0.000363402,0.9905363,0.006222322,0.000012339859],"about_ca_topic_score_codex":0.0009519042,"about_ca_topic_score_gemma":0.0010074937,"teacher_disagreement_score":0.018139487,"about_ca_system_score_codex":0.0011927242,"about_ca_system_score_gemma":0.0006862754,"threshold_uncertainty_score":0.060682595},"labels":[],"label_agreement":null},{"id":"W4388471823","doi":"10.1016/j.jctb.2023.10.008","title":"Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Induced subgraph; Subdivision; Bipartite graph; Discrete mathematics; Treewidth; Chordal graph; Cograph; Graph; Pathwidth; 1-planar graph; Line graph; Vertex (graph theory)","score_opus":0.017087698286873558,"score_gpt":0.27820646013842604,"score_spread":0.26111876185155247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388471823","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.78390855,0.0046178936,0.07948496,0.0028554667,0.0003328773,0.00014220708,0.00096246955,0.00042528292,0.12727028],"genre_scores_gemma":[0.96771485,0.0016969764,0.009782351,0.0002973548,0.0003307957,0.00006571607,0.0006761783,0.00007966507,0.019356247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996716,0.00004997153,0.000019565923,0.000057807676,0.00009643653,0.000104664694],"domain_scores_gemma":[0.99930835,0.00030455572,0.0001089219,0.0000659108,0.000052527474,0.00015973118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035876757,0.000490425,0.00063703186,0.0018878038,0.0014518297,0.0026740397,0.0006407941,0.00092852017,0.006554803],"category_scores_gemma":[0.0011668836,0.00050563004,0.0010549985,0.0014881847,0.002136941,0.002677497,0.0023019502,0.0018578139,0.0007258097],"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.00004616612,0.000056376175,0.00092317536,0.00009027834,0.00001137669,0.00021224772,0.00062073465,0.0012552969,0.002475884,0.9834029,0.001994806,0.008910667],"study_design_scores_gemma":[0.000015006432,0.00001908832,0.0015121967,0.000021150134,0.000014151779,0.00021601918,0.00026614606,0.0031536848,0.00059590617,0.989408,0.0047660903,0.000012585172],"about_ca_topic_score_codex":0.0013971898,"about_ca_topic_score_gemma":0.0015923983,"teacher_disagreement_score":0.006554803,"about_ca_system_score_codex":0.0007660829,"about_ca_system_score_gemma":0.00040720552,"threshold_uncertainty_score":0.021928012},"labels":[],"label_agreement":null},{"id":"W4389129622","doi":"10.1016/j.jctb.2023.11.005","title":"Hitting all maximum stable sets in P5-free graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Mathematics; Bounded function; Induced subgraph; Conjecture; Discrete mathematics; Graph; Vertex (graph theory); Induced path; Cardinality (data modeling); Longest path problem; Chordal graph; Computer science","score_opus":0.021601945378098928,"score_gpt":0.29157513236965915,"score_spread":0.2699731869915602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389129622","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.8924408,0.0004367441,0.057728246,0.0014035931,0.00013278509,0.00015431347,0.0012466554,0.0006959909,0.045760922],"genre_scores_gemma":[0.9658939,0.00024115274,0.016407428,0.0003387886,0.00007864712,0.00017339012,0.0017901043,0.0002592687,0.014817343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858737,0.00024217778,0.00007744602,0.0003533829,0.00035904683,0.0003805833],"domain_scores_gemma":[0.992366,0.0046907575,0.0006639202,0.00062051055,0.0005869091,0.001071981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009831534,0.0013088937,0.0019717126,0.0034177012,0.006185142,0.005625894,0.0034385875,0.003081894,0.01598416],"category_scores_gemma":[0.007940405,0.0018540077,0.0019666557,0.0032843812,0.0030770674,0.0061532515,0.004246605,0.0031106095,0.0021982316],"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.0013253415,0.00042834337,0.008059186,0.0006568849,0.0003233532,0.0016003298,0.0029206858,0.019933319,0.012227254,0.90226173,0.016249983,0.03401369],"study_design_scores_gemma":[0.00015210113,0.000109757726,0.0016043026,0.00006869368,0.000109974826,0.000503567,0.0008516889,0.033668716,0.0057778005,0.95424503,0.0028643676,0.000043946675],"about_ca_topic_score_codex":0.0020622252,"about_ca_topic_score_gemma":0.0038995894,"teacher_disagreement_score":0.01598416,"about_ca_system_score_codex":0.001801245,"about_ca_system_score_gemma":0.0011594456,"threshold_uncertainty_score":0.05347228},"labels":[],"label_agreement":null},{"id":"W4395681799","doi":"10.1016/j.jctb.2024.04.002","title":"Mutual embeddability in groups, trees, and spheres","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Topology and Set Theory","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":"Royal Military College of Canada","funders":"","keywords":"Mathematics; SPHERES; Combinatorics; Physics; Astronomy","score_opus":0.015621251694879374,"score_gpt":0.3052243481088574,"score_spread":0.289603096413978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395681799","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.83978987,0.0008197913,0.08222491,0.001699245,0.00008437924,0.000029068337,0.00016406822,0.00017409727,0.07501455],"genre_scores_gemma":[0.99007225,0.00020728956,0.0045009437,0.000043916756,0.00007187447,0.000019089917,0.00008459768,0.0000279018,0.0049721035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992834,0.00023400338,0.000038839218,0.00014996582,0.00017401799,0.00011985201],"domain_scores_gemma":[0.9974208,0.0014261137,0.00038462406,0.00034893703,0.0001512559,0.00026822806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006961988,0.00027055113,0.0005788256,0.001518863,0.0016006808,0.0028148459,0.00057900656,0.00087446644,0.005127101],"category_scores_gemma":[0.0036931532,0.00038045607,0.0004895012,0.0011280365,0.0037395747,0.0059460592,0.002576375,0.0012948082,0.00035310385],"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.000034274635,0.000011539289,0.00045389865,0.000015584572,0.000004181287,0.0000560671,0.00064969726,0.0006777236,0.00049059733,0.9944518,0.00032135754,0.0028332546],"study_design_scores_gemma":[0.000011612407,0.00001573003,0.00041617273,0.000007726949,0.000009463997,0.000106585896,0.00039216148,0.002611793,0.00055049156,0.99370414,0.0021675397,0.0000064341893],"about_ca_topic_score_codex":0.00076804584,"about_ca_topic_score_gemma":0.0008327612,"teacher_disagreement_score":0.005127101,"about_ca_system_score_codex":0.0007098679,"about_ca_system_score_gemma":0.00030646476,"threshold_uncertainty_score":0.017151892},"labels":[],"label_agreement":null},{"id":"W4396683686","doi":"10.1016/j.jctb.2024.04.001","title":"The inducibility of oriented stars","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Stars; Astrophysics; Astronomy; Physics","score_opus":0.009695795141661441,"score_gpt":0.25018538364967846,"score_spread":0.24048958850801702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396683686","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.44616303,0.0024704554,0.21796168,0.004371747,0.0009275642,0.00009178552,0.0005634477,0.00067354046,0.32677677],"genre_scores_gemma":[0.9395432,0.00097643683,0.031086313,0.00088402285,0.0004980488,0.000060029903,0.000481182,0.0002549193,0.026215784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890995,0.00024004547,0.000078084304,0.00027051396,0.00033060153,0.00017075687],"domain_scores_gemma":[0.9942334,0.0037112227,0.00031902237,0.0005192072,0.0005524266,0.0006646467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014200845,0.0004946433,0.0010094729,0.0014763928,0.0023666485,0.0038033035,0.0012063507,0.00080928346,0.0075958343],"category_scores_gemma":[0.004961727,0.00088218425,0.0012589811,0.0014191996,0.0041109133,0.007438241,0.003347807,0.0037624347,0.0009776838],"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.000054285152,0.000027520058,0.00033796526,0.000027749607,0.0000065045806,0.00005065954,0.0001682018,0.00024099357,0.00048933044,0.9940362,0.0007619783,0.0037985942],"study_design_scores_gemma":[0.000022703925,0.000016082598,0.00019176299,0.00001089097,0.000011425476,0.00009801368,0.00006315554,0.0011246882,0.0007554498,0.9937867,0.0039124927,0.0000066924194],"about_ca_topic_score_codex":0.0006333563,"about_ca_topic_score_gemma":0.00071621704,"teacher_disagreement_score":0.0075958343,"about_ca_system_score_codex":0.0010799334,"about_ca_system_score_gemma":0.00073990034,"threshold_uncertainty_score":0.025410593},"labels":[],"label_agreement":null},{"id":"W4399120955","doi":"10.1016/j.jctb.2024.05.003","title":"The burning number conjecture holds asymptotically","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics","score_opus":0.01176928435438561,"score_gpt":0.2922803584006069,"score_spread":0.2805110740462213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399120955","genre_codex":"other","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.40910375,0.0034649232,0.0913248,0.040619977,0.0029938521,0.000056511635,0.0005391882,0.001404039,0.45049298],"genre_scores_gemma":[0.9571347,0.00094686315,0.008553344,0.0034638583,0.0021564434,0.00011855722,0.0005164866,0.0003524239,0.026757184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979919,0.00051051413,0.000066851615,0.0005474591,0.00046779015,0.00041550287],"domain_scores_gemma":[0.9875936,0.007876568,0.0007797988,0.0018968702,0.0009714809,0.00088164303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026161391,0.0010223254,0.0026316703,0.002185355,0.0041756025,0.0054832436,0.0030684683,0.0043594297,0.01738468],"category_scores_gemma":[0.020307735,0.00090640463,0.0012354532,0.0013288473,0.007114537,0.017783038,0.0039478755,0.008064059,0.0020240385],"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.00008437682,0.00004249066,0.0004741116,0.000059440208,0.000014002328,0.000065663495,0.00012988198,0.0007425734,0.00053073105,0.9907115,0.0040888754,0.0030562568],"study_design_scores_gemma":[0.000018936384,0.000006606148,0.00014073498,0.000014295118,0.000005737201,0.000051036353,0.000042313088,0.0029519908,0.00016752748,0.99566406,0.00093004014,0.000006709975],"about_ca_topic_score_codex":0.0010566798,"about_ca_topic_score_gemma":0.0011331172,"teacher_disagreement_score":0.01738468,"about_ca_system_score_codex":0.0019588338,"about_ca_system_score_gemma":0.0012199705,"threshold_uncertainty_score":0.058157563},"labels":[],"label_agreement":null},{"id":"W4399149997","doi":"10.1016/j.jctb.2024.05.002","title":"Directed cycles with zero weight in Zpk","year":2024,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Zero (linguistics); Mathematics; Algorithm; Philosophy","score_opus":0.00466580706083357,"score_gpt":0.20019280797731395,"score_spread":0.19552700091648037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399149997","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.77266264,0.0037181685,0.13208313,0.0025753954,0.00020310948,0.00022375712,0.0016141717,0.0008104359,0.08610919],"genre_scores_gemma":[0.9477528,0.0013123321,0.033462714,0.00036831107,0.00019622332,0.00028304002,0.0009886429,0.00015897774,0.015476926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991153,0.00012242558,0.00005563385,0.00024398531,0.0002139104,0.00024876927],"domain_scores_gemma":[0.99740297,0.0013291857,0.00039133104,0.00026356167,0.00028131576,0.00033158506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049265946,0.00076317013,0.00083748816,0.0033541163,0.0021065741,0.0039983676,0.0014210065,0.0009627715,0.0063354624],"category_scores_gemma":[0.005292287,0.0007624014,0.0006186341,0.002541175,0.0025109749,0.0039237905,0.0026809464,0.0018012963,0.0012259498],"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.0002326183,0.00005645314,0.00128826,0.00025117252,0.000029847408,0.00023656739,0.00044558878,0.007827539,0.0038904606,0.95722,0.0039063636,0.02461511],"study_design_scores_gemma":[0.000058836038,0.000039300674,0.0006429471,0.00005165444,0.000027014717,0.00024997533,0.000115775685,0.019088976,0.0027519953,0.9687113,0.008232639,0.00002957362],"about_ca_topic_score_codex":0.0022827152,"about_ca_topic_score_gemma":0.0020034867,"teacher_disagreement_score":0.0063354624,"about_ca_system_score_codex":0.0021755085,"about_ca_system_score_gemma":0.0009354126,"threshold_uncertainty_score":0.02119422},"labels":[],"label_agreement":null},{"id":"W4399771641","doi":"10.1016/j.jctb.2024.05.006","title":"On the use of senders for asymmetric tuples of cliques in Ramsey theory","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"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 Waterloo","funders":"Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft; Australian Government","keywords":"Tuple; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.06546077576914389,"score_gpt":0.31444724990977746,"score_spread":0.24898647414063357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399771641","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.35534742,0.0021942223,0.56908864,0.0031954532,0.00028973998,0.00015108948,0.00018554625,0.000684663,0.06886334],"genre_scores_gemma":[0.91059977,0.0009319988,0.08194072,0.00061373546,0.00019728973,0.00018653969,0.000087325316,0.00013179544,0.005310944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967976,0.0016012639,0.00015639408,0.0005881136,0.00050098205,0.00035572393],"domain_scores_gemma":[0.9912969,0.00566113,0.0006302144,0.0013573625,0.00044891363,0.00060553744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004814397,0.00056398916,0.00092621887,0.0017078746,0.0027177576,0.0029874486,0.0013830635,0.0018685991,0.0028022951],"category_scores_gemma":[0.0104863895,0.00086264435,0.0011248469,0.0009955069,0.00802037,0.009737414,0.0054792613,0.0033693754,0.00052203273],"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.000016892041,0.000011715939,0.00020803235,0.000022515796,0.0000032259757,0.00004323699,0.00030433747,0.00058678247,0.00038079912,0.9957734,0.00025317766,0.0023958746],"study_design_scores_gemma":[0.000011248299,0.000028768718,0.00014085937,0.000026124912,0.000012977865,0.0001582782,0.0001460776,0.0060191453,0.0006333116,0.9905036,0.0023017016,0.000017821929],"about_ca_topic_score_codex":0.00063528115,"about_ca_topic_score_gemma":0.00057993585,"teacher_disagreement_score":0.004814397,"about_ca_system_score_codex":0.0012563542,"about_ca_system_score_gemma":0.00071248575,"threshold_uncertainty_score":0.025461316},"labels":[],"label_agreement":null},{"id":"W4400619204","doi":"10.1016/j.jctb.2024.06.007","title":"Spectral arbitrariness for trees fails spectacularly","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Arbitrariness; Mathematics; Philosophy; Epistemology","score_opus":0.0339013001840233,"score_gpt":0.3340395112551943,"score_spread":0.300138211071171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400619204","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.28676572,0.0015669734,0.63080424,0.015690222,0.0011959348,0.00006403267,0.00022222099,0.0017905001,0.061900165],"genre_scores_gemma":[0.9587264,0.00052856415,0.027319424,0.0013604388,0.0006892672,0.00008426249,0.00011521689,0.0007073287,0.010468941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99514234,0.0019311518,0.00025152796,0.0008998384,0.0012770056,0.0004981213],"domain_scores_gemma":[0.9626912,0.025625348,0.0019480927,0.005861048,0.001832888,0.0020415206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008460202,0.0011508026,0.0031156451,0.0023701342,0.0038260715,0.0049227956,0.003661175,0.005078042,0.009389365],"category_scores_gemma":[0.046703395,0.0011770608,0.0017774667,0.0015707195,0.009951417,0.013675559,0.005872753,0.008147477,0.0010781366],"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.00003291834,0.000017421118,0.00030950838,0.000035478257,0.000009898687,0.00007385593,0.00012090967,0.0018823593,0.00035021646,0.9939977,0.0010531237,0.0021166666],"study_design_scores_gemma":[0.0000056892977,0.0000060158504,0.00006543937,0.0000072845264,0.0000028057584,0.00004431111,0.000021444215,0.016624536,0.0001614523,0.9827101,0.0003425959,0.000008369197],"about_ca_topic_score_codex":0.0010593821,"about_ca_topic_score_gemma":0.0011033313,"teacher_disagreement_score":0.009389365,"about_ca_system_score_codex":0.0012998582,"about_ca_system_score_gemma":0.0013405981,"threshold_uncertainty_score":0.044742405},"labels":[],"label_agreement":null},{"id":"W4400887743","doi":"10.1016/j.jctb.2024.07.001","title":"The Erdős-Gyárfás function <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:mi>f</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo stretchy=\"false\">)</mml:mo><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">=</mml:mo><mml:mfrac><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:mfrac><mml:mi>n</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">+</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math> — So Gyárfás was right","year":2024,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Combinatorics","score_opus":0.01501190542327529,"score_gpt":0.25325647123607425,"score_spread":0.23824456581279896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400887743","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.0034158817,0.0013900344,0.39342326,0.0032305587,0.0016312319,0.0004285932,0.10940562,0.25153175,0.23554309],"genre_scores_gemma":[0.06446309,0.0034639812,0.31133273,0.002267892,0.00084041466,0.0017776239,0.18920891,0.15093267,0.27571276],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834144,0.00033742058,0.000121956604,0.00025516326,0.0007836388,0.00016024],"domain_scores_gemma":[0.99786973,0.0005525162,0.00012950167,0.0006000731,0.000664655,0.00018345895],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025681292,0.0022159785,0.0014766719,0.0028609708,0.0009878677,0.0038620702,0.003368634,0.0018182842,0.32087758],"category_scores_gemma":[0.00966117,0.0012645936,0.0021155535,0.003147551,0.00064241054,0.003944719,0.0029729302,0.002518853,0.29018933],"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.00029548426,0.000051985346,0.0008575239,0.00048132375,0.00005367596,0.00014774826,0.000107427855,0.0067681707,0.0012069459,0.033563785,0.86798114,0.08848479],"study_design_scores_gemma":[0.00013325014,0.00003473191,0.0005205419,0.00010980444,0.000027250187,0.00026693766,0.00005456728,0.013469273,0.0060289525,0.027738366,0.9515625,0.000053760657],"about_ca_topic_score_codex":0.0048181615,"about_ca_topic_score_gemma":0.005302481,"teacher_disagreement_score":0.32087758,"about_ca_system_score_codex":0.0024040476,"about_ca_system_score_gemma":0.0022215038,"threshold_uncertainty_score":0.9686857},"labels":[],"label_agreement":null},{"id":"W4400888188","doi":"10.1016/j.jctb.2024.07.002","title":"Fractional coloring with local demands and applications to degree-sequence bounds on the independence number","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canada Excellence Research Chairs, Government of Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Government of Ontario; National Science Foundation","keywords":"Mathematics; Degree (music); Combinatorics; Independence (probability theory); Sequence (biology); Independence number; Discrete mathematics; Statistics; Graph","score_opus":0.014636745229695129,"score_gpt":0.23990438999761646,"score_spread":0.22526764476792133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400888188","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.07600306,0.002491151,0.84360725,0.0031205846,0.00048097342,0.00011120204,0.00066892867,0.00057929166,0.07293746],"genre_scores_gemma":[0.82123876,0.0043497416,0.1462797,0.0012371995,0.0023347426,0.00043229476,0.0009142935,0.00091920386,0.022294242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698097,0.0010746843,0.000095394214,0.00063344155,0.0007719055,0.00044354796],"domain_scores_gemma":[0.9586687,0.03376668,0.0013928505,0.002822461,0.0017827186,0.001566641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006431328,0.0024089243,0.0026883078,0.0048036715,0.0025179486,0.005038668,0.005967158,0.0022780297,0.013204562],"category_scores_gemma":[0.033734176,0.0013782044,0.0020979214,0.006750691,0.0057725483,0.011582559,0.0056057763,0.008419118,0.0013812765],"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.00021497134,0.00018961243,0.0012092792,0.00020513844,0.00004899192,0.00012599319,0.00035015383,0.11921921,0.0031065638,0.84824854,0.0055211005,0.021560408],"study_design_scores_gemma":[0.000018409102,0.000035886904,0.0004781098,0.000057467994,0.000039440747,0.00008281549,0.00007166823,0.39805576,0.0012249665,0.59730834,0.0025853445,0.00004181013],"about_ca_topic_score_codex":0.0027844897,"about_ca_topic_score_gemma":0.004808575,"teacher_disagreement_score":0.013204562,"about_ca_system_score_codex":0.005184123,"about_ca_system_score_gemma":0.0017216,"threshold_uncertainty_score":0.044173717},"labels":[],"label_agreement":null},{"id":"W4409508401","doi":"10.1016/j.jctb.2025.04.001","title":"Haar graphical representations of finite groups and an application to poset representations","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","field":"Mathematics","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 Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Mathematics; Partially ordered set; Combinatorics; Haar; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.024431382018134055,"score_gpt":0.36805849261172136,"score_spread":0.3436271105935873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409508401","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.23720221,0.0031295333,0.6739683,0.0027058579,0.00052948215,0.00015251058,0.0005140195,0.00082468765,0.080973394],"genre_scores_gemma":[0.8769852,0.0020169443,0.106532656,0.00054061593,0.00078832475,0.00013030252,0.00063007843,0.00018764174,0.012188169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987413,0.00040879397,0.0000826414,0.0003152225,0.00026876794,0.00018332244],"domain_scores_gemma":[0.99709797,0.0014695501,0.00040329195,0.0004278609,0.00031005093,0.000291337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000990097,0.00071676663,0.00072592654,0.0034417242,0.0014992608,0.0035011256,0.00082418957,0.0011761212,0.0057415375],"category_scores_gemma":[0.0053132535,0.00040442307,0.0015785686,0.003362548,0.004190215,0.004229683,0.0024807022,0.0024637966,0.0010100709],"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.0000111154495,0.000018501903,0.00029948427,0.000030011199,0.0000073776164,0.0000757152,0.00052055746,0.0024711706,0.00051873195,0.9819858,0.0007015446,0.013359959],"study_design_scores_gemma":[0.000004413225,0.000031524396,0.00020960091,0.000021705097,0.000008414619,0.00013060856,0.00017529353,0.013086747,0.00035531542,0.97986484,0.0060956464,0.000016024098],"about_ca_topic_score_codex":0.0012381945,"about_ca_topic_score_gemma":0.0008434416,"teacher_disagreement_score":0.0057415375,"about_ca_system_score_codex":0.0010475548,"about_ca_system_score_gemma":0.00044582953,"threshold_uncertainty_score":0.019207358},"labels":[],"label_agreement":null},{"id":"W4411491172","doi":"10.1016/j.jctb.2025.06.002","title":"Hyperbolicity theorems for correspondence colouring","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.0074636932120930605,"score_gpt":0.24771919893624686,"score_spread":0.2402555057241538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411491172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34335038,0.0017197243,0.37082696,0.009266874,0.0007212444,0.0002723434,0.0014181099,0.00068434165,0.27173993],"genre_scores_gemma":[0.90017575,0.001560876,0.05065723,0.0022587266,0.00090262725,0.00037741946,0.0013032967,0.0004932596,0.042270828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998271,0.00050903746,0.00010273087,0.0004593342,0.0003365216,0.00032138795],"domain_scores_gemma":[0.986842,0.009161821,0.0007920012,0.0014882567,0.00078950915,0.00092645985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023114076,0.0010847962,0.0015421243,0.0029876118,0.0031352828,0.0053946744,0.0032750724,0.002365164,0.015985975],"category_scores_gemma":[0.009244644,0.0015072756,0.002025904,0.003006716,0.005896676,0.012769475,0.0055244057,0.007959872,0.0015169053],"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.000025844252,0.000021415137,0.00028325422,0.00003311658,0.0000069570865,0.000026117594,0.00018419737,0.00073105784,0.00026024593,0.99461573,0.0015610111,0.0022509848],"study_design_scores_gemma":[0.00001917821,0.0000064835535,0.00017597985,0.000009445505,0.000009937577,0.000033525892,0.00006166737,0.0036955234,0.00022509175,0.99399626,0.0017575495,0.000009331661],"about_ca_topic_score_codex":0.0021087704,"about_ca_topic_score_gemma":0.0018924627,"teacher_disagreement_score":0.015985975,"about_ca_system_score_codex":0.0031079636,"about_ca_system_score_gemma":0.00096775824,"threshold_uncertainty_score":0.05347836},"labels":[],"label_agreement":null},{"id":"W4414056851","doi":"10.1016/j.jctb.2025.08.003","title":"Tree independence number II. Three-path-configurations","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","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 Waterloo","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Division of Computing and Communication Foundations; Ministry of Colleges and Universities; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; U.S. Air Force; Alfred P. Sloan Foundation","keywords":"Tree (set theory); Independence number; Independence (probability theory); Class (philosophy); Graph","score_opus":0.01070042686151122,"score_gpt":0.2865333438356005,"score_spread":0.27583291697408924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414056851","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.66321623,0.0016572545,0.21514812,0.005581805,0.00013924061,0.00028413674,0.007415848,0.0019591902,0.10459813],"genre_scores_gemma":[0.96298194,0.0005780189,0.027400833,0.00040192757,0.00007592203,0.00017030926,0.0024063778,0.00017831191,0.0058063935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892056,0.000119091164,0.000046046818,0.000317386,0.00034220674,0.00025467147],"domain_scores_gemma":[0.9926843,0.005146897,0.0006807371,0.0005850492,0.00040077418,0.000502175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005752452,0.0004893589,0.0004798472,0.0008074051,0.0014605124,0.0024186599,0.0012937444,0.00092367287,0.011437172],"category_scores_gemma":[0.0066588023,0.0005232979,0.00061478594,0.0021766194,0.0017210599,0.003418067,0.0011816877,0.0027963147,0.0013807807],"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.0018103917,0.00057221734,0.028019287,0.0012849892,0.00015887045,0.0010897083,0.0008528132,0.1959147,0.07331741,0.5075743,0.056459498,0.13294585],"study_design_scores_gemma":[0.0001386344,0.00017653622,0.011727062,0.0000937786,0.000110501045,0.0018907565,0.00024428722,0.24050945,0.03972807,0.6850177,0.020285847,0.000077389304],"about_ca_topic_score_codex":0.0027024471,"about_ca_topic_score_gemma":0.0027058765,"teacher_disagreement_score":0.011437172,"about_ca_system_score_codex":0.00208305,"about_ca_system_score_gemma":0.0012312845,"threshold_uncertainty_score":0.038261175},"labels":[],"label_agreement":null},{"id":"W4414273302","doi":"10.1016/j.jctb.2025.08.005","title":"Dense minors of graphs with independence number two","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Independence number; Chromatic scale; Graph; Simple (philosophy); Independent set; Simple graph","score_opus":0.0051207234804243025,"score_gpt":0.2359603110307333,"score_spread":0.230839587550309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414273302","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.9127874,0.00019629058,0.060948282,0.00064618,0.0000819079,0.00010857618,0.0011128958,0.0003304388,0.023788089],"genre_scores_gemma":[0.96567065,0.00013770675,0.021087024,0.00020718771,0.00012908697,0.00012388697,0.0018121429,0.000164848,0.010667556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940217,0.00013718444,0.000036111604,0.00016695831,0.00012945413,0.00012813145],"domain_scores_gemma":[0.9953797,0.002499101,0.0006509093,0.00039334752,0.00029772962,0.000779194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494277,0.0007268618,0.00080233894,0.0013894546,0.001574463,0.0024180918,0.0011563903,0.0007667026,0.00623314],"category_scores_gemma":[0.002718277,0.0012390215,0.0007074407,0.0010715383,0.0015079108,0.0022710066,0.0016592371,0.001546092,0.000652411],"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.00096011785,0.00047690218,0.0072802966,0.00024556046,0.000071378796,0.00086229877,0.0025424282,0.00525283,0.034429207,0.9122387,0.01146622,0.02417406],"study_design_scores_gemma":[0.00017760256,0.00014227742,0.006637789,0.000032533342,0.00004691225,0.0008234005,0.0007517871,0.02481414,0.006274082,0.9537256,0.006536164,0.000037757185],"about_ca_topic_score_codex":0.0010993037,"about_ca_topic_score_gemma":0.0017334092,"teacher_disagreement_score":0.00623314,"about_ca_system_score_codex":0.0006881409,"about_ca_system_score_gemma":0.0004149703,"threshold_uncertainty_score":0.02085191},"labels":[],"label_agreement":null},{"id":"W4414436080","doi":"10.1016/j.jctb.2025.08.001","title":"The degree-restricted random process is far from uniform","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Random graph; Random regular graph; Degree (music); Vertex (graph theory); Graph; Sequence (biology); Enumeration; Stochastic process; Random sequence","score_opus":0.02638414600453434,"score_gpt":0.3028405919474399,"score_spread":0.2764564459429056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414436080","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.64182734,0.0017216998,0.29437664,0.010562861,0.0005743571,0.00008243496,0.0005543156,0.00090118224,0.04939912],"genre_scores_gemma":[0.9848127,0.0006644268,0.0075200405,0.0008831937,0.0004882967,0.000059212256,0.00024828597,0.00018435146,0.005139625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970432,0.000988578,0.00012163945,0.00082481303,0.0005927462,0.00042910408],"domain_scores_gemma":[0.97613657,0.015294912,0.0015685352,0.004108604,0.001060464,0.0018309935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041258037,0.0007867478,0.0029782152,0.0018922186,0.0019400083,0.005100205,0.0021547363,0.0025180804,0.0041843615],"category_scores_gemma":[0.024499515,0.0010655259,0.0016114624,0.0009691368,0.0077738874,0.009778879,0.003553941,0.006054029,0.00081968016],"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.000095149895,0.000026151629,0.00058642717,0.000050514842,0.000029306206,0.0001023086,0.0001107233,0.0055626403,0.001279877,0.9892573,0.0011386751,0.0017608575],"study_design_scores_gemma":[0.00004058995,0.00002067702,0.00073444186,0.000014722242,0.000013724746,0.00019269876,0.000039518993,0.027219685,0.0005443665,0.97031903,0.0008305337,0.000029913372],"about_ca_topic_score_codex":0.0012011611,"about_ca_topic_score_gemma":0.00077994226,"teacher_disagreement_score":0.005100205,"about_ca_system_score_codex":0.001174533,"about_ca_system_score_gemma":0.0009439205,"threshold_uncertainty_score":0.021819592},"labels":[],"label_agreement":null},{"id":"W4414962663","doi":"10.1016/j.jctb.2025.09.005","title":"Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Bipartite graph; Robertson–Seymour theorem; Minor (academic); Graph; Set (abstract data type); Complete bipartite graph","score_opus":0.02026782751886669,"score_gpt":0.29336489469822086,"score_spread":0.27309706717935417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414962663","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.55761915,0.0007041034,0.39321822,0.0009258182,0.000059167436,0.00014260107,0.0011930257,0.00045610368,0.04568176],"genre_scores_gemma":[0.9078026,0.0004247598,0.07963009,0.00020505146,0.00008479405,0.00012186795,0.0018703659,0.00011144149,0.009748981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969363,0.00006960779,0.000013301245,0.0000920003,0.00007247134,0.000059033177],"domain_scores_gemma":[0.998872,0.00043280257,0.00026157527,0.00017752945,0.00010799359,0.00014810383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030243807,0.0003007018,0.00030071323,0.0006370734,0.0005436733,0.00090246723,0.0004715698,0.00035978106,0.0038583938],"category_scores_gemma":[0.0013603431,0.00033612762,0.000683015,0.0008137073,0.00082769775,0.0015299639,0.0009827146,0.00094662776,0.00048431373],"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.00009371348,0.00008353288,0.0021249729,0.00013435197,0.000028853854,0.00044710847,0.00053297664,0.011422373,0.014364516,0.9478951,0.003621957,0.01925053],"study_design_scores_gemma":[0.000031641972,0.000048354417,0.0019929707,0.000028090502,0.000025250718,0.00062538404,0.0001954768,0.050177068,0.0042826924,0.93078494,0.011795242,0.000012841467],"about_ca_topic_score_codex":0.00073693506,"about_ca_topic_score_gemma":0.0011481658,"teacher_disagreement_score":0.0038583938,"about_ca_system_score_codex":0.0006897029,"about_ca_system_score_gemma":0.0002450431,"threshold_uncertainty_score":0.012907565},"labels":[],"label_agreement":null},{"id":"W4417044359","doi":"10.1016/j.jctb.2025.11.010","title":"Reduced bandwidth: A qualitative strengthening of twin-width in minor-closed classes (and beyond)","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"School Choice and Performance","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; National Research Foundation of Korea; Agence Nationale de la Recherche","keywords":"Class (philosophy); Algebra over a field; Field (mathematics); Qualitative analysis","score_opus":0.01785419864163944,"score_gpt":0.34433023251591693,"score_spread":0.3264760338742775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417044359","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.5765588,0.00065509166,0.32259145,0.002850824,0.00017554298,0.00007901695,0.0004848906,0.00057181774,0.09603255],"genre_scores_gemma":[0.9861209,0.00007829402,0.010340895,0.00014462502,0.00006443829,0.00003453873,0.00006012556,0.00009087706,0.0030654094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984622,0.00039970563,0.00006647906,0.00041122193,0.0003285566,0.0003318673],"domain_scores_gemma":[0.9928276,0.0036718822,0.0005995675,0.001319387,0.00067648763,0.00090507517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018085496,0.00029975406,0.0007995768,0.0014097441,0.0016358559,0.0032933957,0.0017858241,0.0014594828,0.014316324],"category_scores_gemma":[0.013285097,0.0005729467,0.0009823064,0.0008710469,0.004597456,0.0076287617,0.0033345972,0.0021724033,0.00057205756],"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.000031318767,0.000010389991,0.00038412938,0.000028808865,0.000005370276,0.000030144363,0.0003070719,0.000563722,0.001142879,0.9948454,0.00042154235,0.0022291658],"study_design_scores_gemma":[0.000019750567,0.0000152105595,0.00070741575,0.0000104672135,0.000009261841,0.00010539972,0.00022421696,0.005418656,0.0004390319,0.99146175,0.0015779388,0.000010818073],"about_ca_topic_score_codex":0.0014737381,"about_ca_topic_score_gemma":0.0009552243,"teacher_disagreement_score":0.014316324,"about_ca_system_score_codex":0.00091215165,"about_ca_system_score_gemma":0.00054644624,"threshold_uncertainty_score":0.04789287},"labels":[],"label_agreement":null}]}