{"meta":{"query_hash":"a15dcbaaeb2a","filters":{"venue":"Contributions to Discrete Mathematics"},"cohort_total":412,"direct_labels_cover":0,"predictions_cover":412,"exported":412,"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/a15dcbaaeb2a","api":"https://metacan.xera.ac/api/v1/cohort?venue=Contributions+to+Discrete+Mathematics"},"results":[{"id":"W1489838207","doi":"10.55016/ojs/cdm.v8i2.62171","title":"Elements of finite order in automorphism groups of homogeneous structures","year":2014,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Homogeneous; Automorphism; Order (exchange); Mathematics; Pure mathematics; Automorphism group; Combinatorics; Business","score_opus":0.021424856153386008,"score_gpt":0.3408321053292531,"score_spread":0.3194072491758671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489838207","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.97920734,0.00013299167,0.013196587,0.00012500647,0.000011317473,0.000016594458,0.000037682268,0.00003284838,0.0072396514],"genre_scores_gemma":[0.99544,0.00008637263,0.002240434,0.00001641584,0.000032844535,0.000019342808,0.00007995479,0.000011972357,0.00207263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931574,0.00014554134,0.000047599147,0.00015609273,0.00016131572,0.00017368126],"domain_scores_gemma":[0.99824417,0.0007753947,0.0003748318,0.00022868693,0.00011074113,0.0002660649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065537734,0.00041186812,0.00055896054,0.0017671731,0.0018189594,0.0024239812,0.00045318357,0.0005919721,0.0028510143],"category_scores_gemma":[0.002949505,0.0003320606,0.00077882217,0.00085899926,0.0031829919,0.0035235037,0.0018158661,0.00086583616,0.00026581003],"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.00011160271,0.0000453425,0.0057866736,0.000042755284,0.000017558617,0.0002449818,0.0015970907,0.0040998165,0.0056730076,0.9760592,0.00020660883,0.0061153746],"study_design_scores_gemma":[0.000027274338,0.00010682247,0.0042486726,0.000018778945,0.000020559339,0.00035824627,0.0006232346,0.016645344,0.008220572,0.96649295,0.0032087201,0.000028950408],"about_ca_topic_score_codex":0.0009442628,"about_ca_topic_score_gemma":0.0007243959,"teacher_disagreement_score":0.0028510143,"about_ca_system_score_codex":0.001467764,"about_ca_system_score_gemma":0.00031202627,"threshold_uncertainty_score":0.010649443},"labels":[],"label_agreement":null},{"id":"W1572300247","doi":"10.55016/ojs/cdm.v5i2.62000","title":"Connected domination dot-critical graphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.012747377189052157,"score_gpt":0.3389732156815263,"score_spread":0.3262258384924741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572300247","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.75809634,0.0012312821,0.14421773,0.00080419576,0.00008176885,0.00033239738,0.0011916829,0.00039172597,0.09365293],"genre_scores_gemma":[0.96672744,0.0005577538,0.019896388,0.00019871628,0.000058183276,0.00012458897,0.0009342623,0.000049170903,0.011453498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997559,0.000023455708,0.00001054372,0.00007264601,0.000074783406,0.00006275026],"domain_scores_gemma":[0.9986765,0.00040132782,0.00024808536,0.0001064055,0.0002707346,0.00029697313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019617591,0.00038806963,0.0003330234,0.0016473109,0.0009353305,0.0010230064,0.00045859476,0.0003895567,0.0046648504],"category_scores_gemma":[0.0015426279,0.0002546539,0.00019860225,0.0010706348,0.0010888444,0.0010409579,0.00088745565,0.00056563166,0.00040990923],"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.00029022712,0.00006779082,0.005444871,0.000270261,0.000045173503,0.00090920937,0.0010716808,0.019352883,0.024477828,0.898703,0.008077118,0.04128985],"study_design_scores_gemma":[0.00010475631,0.00014339726,0.005909477,0.00008568106,0.000060617374,0.0022646599,0.0008077347,0.099776104,0.013966941,0.8051373,0.071694076,0.000049245264],"about_ca_topic_score_codex":0.0016485096,"about_ca_topic_score_gemma":0.0020478414,"teacher_disagreement_score":0.0046648504,"about_ca_system_score_codex":0.0010732103,"about_ca_system_score_gemma":0.00055245706,"threshold_uncertainty_score":0.01560545},"labels":[],"label_agreement":null},{"id":"W1586346388","doi":"10.55016/ojs/cdm.v5i1.61965","title":"On the number of components of a graph","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Mathematics; Computer science; Combinatorics","score_opus":0.02451514538843506,"score_gpt":0.33137306333273153,"score_spread":0.30685791794429645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586346388","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.63923615,0.0030710145,0.26118726,0.0037496767,0.00039584903,0.00012254575,0.0019601125,0.00067280786,0.08960453],"genre_scores_gemma":[0.90572983,0.0014196709,0.07624009,0.00028665495,0.0005033989,0.0003124983,0.0011630525,0.0002944943,0.014050307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851435,0.00034269618,0.000089965615,0.00042470716,0.0004173017,0.0002109392],"domain_scores_gemma":[0.9912567,0.005514418,0.00085976324,0.00068367546,0.000746961,0.0009384598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014092334,0.0006571186,0.0007009489,0.0031403166,0.0016361666,0.0034377251,0.0014501978,0.00090817246,0.005611244],"category_scores_gemma":[0.009854596,0.00039297028,0.00046274866,0.002455218,0.0033886316,0.007875008,0.0014561248,0.001574442,0.00075578433],"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.00022123852,0.000033824643,0.0045822933,0.00012207411,0.000028891853,0.000097290605,0.0004794926,0.005194271,0.0027463885,0.9614423,0.0028113683,0.022240583],"study_design_scores_gemma":[0.000027129412,0.000067765824,0.0035151623,0.00009462397,0.00004016122,0.0003687607,0.00028690256,0.040283453,0.003971639,0.9349055,0.016393088,0.000045705],"about_ca_topic_score_codex":0.00107748,"about_ca_topic_score_gemma":0.0009236068,"teacher_disagreement_score":0.005611244,"about_ca_system_score_codex":0.0027772854,"about_ca_system_score_gemma":0.00080865825,"threshold_uncertainty_score":0.020150661},"labels":[],"label_agreement":null},{"id":"W1594941289","doi":"10.55016/ojs/cdm.v6i1.62040","title":"2L-convex polyominoes: Geometrical aspects","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyomino; Regular polygon; Mathematics; Combinatorics; Geometry","score_opus":0.029822366137084208,"score_gpt":0.2946020199361581,"score_spread":0.26477965379907387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594941289","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.7140991,0.0014752499,0.19802368,0.0008075801,0.00008841405,0.0000969961,0.0008370024,0.0001304272,0.08444157],"genre_scores_gemma":[0.9253832,0.00079497433,0.06153053,0.00012258912,0.00012835363,0.00011517225,0.0007923744,0.000071688526,0.011060956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994838,0.0000927002,0.000027678638,0.00011824038,0.00019289063,0.00008467256],"domain_scores_gemma":[0.9993901,0.00020477267,0.00014649969,0.000067426794,0.000094651376,0.00009650045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022731435,0.00035292917,0.00031199443,0.0011222594,0.00080996996,0.0018027982,0.00037565466,0.00044176306,0.0045002187],"category_scores_gemma":[0.0010551106,0.00030698703,0.0002833904,0.00078446965,0.002297211,0.0019857963,0.0012993043,0.0009838518,0.00047254463],"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.00009633573,0.000023745371,0.0028725904,0.00009600995,0.00001110258,0.00036600907,0.00044818886,0.011956212,0.009563998,0.944049,0.0014404377,0.029076422],"study_design_scores_gemma":[0.000032767246,0.0001606476,0.01155228,0.00007811461,0.000016595943,0.002934121,0.0011163299,0.11922912,0.010044905,0.81120926,0.0435349,0.0000910539],"about_ca_topic_score_codex":0.0007063898,"about_ca_topic_score_gemma":0.0007170889,"teacher_disagreement_score":0.0045002187,"about_ca_system_score_codex":0.0007616894,"about_ca_system_score_gemma":0.00033939737,"threshold_uncertainty_score":0.015054703},"labels":[],"label_agreement":null},{"id":"W1687767907","doi":"10.55016/ojs/cdm.v8i1.62180","title":"Colouring isonemal fabrics with more than two colours by thick striping","year":2013,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Textile materials and evaluations","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba; Queen's University; McKnight Foundation","keywords":"Data striping; Computer science; Operating system","score_opus":0.019956162451677733,"score_gpt":0.3164408958202696,"score_spread":0.2964847333685918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1687767907","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.6204016,0.00088811433,0.33534402,0.00022474414,0.0002117228,0.00004044266,0.00012500846,0.0006192864,0.042144984],"genre_scores_gemma":[0.93733746,0.00030161077,0.05582236,0.00006670873,0.000055279383,0.000021245052,0.00011362091,0.00018721563,0.0060945326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993051,0.00018925211,0.00004766333,0.00014120441,0.00018826437,0.0001285036],"domain_scores_gemma":[0.99842596,0.00039268774,0.00031139288,0.00044845493,0.00020559762,0.00021598372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007453471,0.00069162395,0.000527721,0.000878977,0.00051047804,0.0016283147,0.00045805934,0.00038126323,0.0030134863],"category_scores_gemma":[0.0022800616,0.00033651158,0.00055821997,0.0004280503,0.0028468312,0.0017629341,0.0019304289,0.0010202709,0.00051276275],"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.001224263,0.0001549596,0.00451945,0.0006090738,0.00008496642,0.00085756026,0.000531024,0.05344863,0.1814557,0.6412888,0.0029245063,0.11290109],"study_design_scores_gemma":[0.00009261586,0.0009330204,0.0060905935,0.00020670923,0.00008185225,0.0018047623,0.00064557104,0.15239388,0.13646871,0.67228717,0.028847646,0.00014750248],"about_ca_topic_score_codex":0.0002314162,"about_ca_topic_score_gemma":0.000270308,"teacher_disagreement_score":0.0030134863,"about_ca_system_score_codex":0.00036857612,"about_ca_system_score_gemma":0.00018987231,"threshold_uncertainty_score":0.010081112},"labels":[],"label_agreement":null},{"id":"W1752350786","doi":"10.55016/ojs/cdm.v13i1.62788","title":"Density dichotomy in random words","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Combinatorics; Word (group theory); Mathematics; Alphabet; Sigma; Rank (graph theory); Limit (mathematics); Physics; Linguistics; Computer science; Philosophy; Geometry","score_opus":0.008632125033444954,"score_gpt":0.27738556260323755,"score_spread":0.2687534375697926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752350786","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.61849415,0.0031120337,0.29340154,0.011753179,0.00033095042,0.00013996614,0.0010422595,0.0008679352,0.070857935],"genre_scores_gemma":[0.97287095,0.00069614296,0.014314035,0.0009623093,0.00043808398,0.00033285885,0.00042007078,0.00015790739,0.00980764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964257,0.0013733353,0.00016042117,0.00085604563,0.00081112835,0.0003732733],"domain_scores_gemma":[0.97486657,0.019783301,0.001142207,0.0015262367,0.0013567472,0.0013248341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037327842,0.00042867282,0.0012425765,0.0022112108,0.0023005556,0.0039653555,0.0014561996,0.0017623914,0.0077655315],"category_scores_gemma":[0.025255157,0.0005520391,0.001158078,0.0010631679,0.0058489484,0.0074996166,0.003590215,0.0029882041,0.0009014635],"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.00003660403,0.000016425538,0.00080199505,0.000043427757,0.000009294344,0.000075995915,0.0004729793,0.0017113528,0.00044739072,0.99244785,0.0012291548,0.0027074707],"study_design_scores_gemma":[0.000021840757,0.000026463915,0.00070245384,0.00003509117,0.000008138538,0.00013041619,0.00014936627,0.043785904,0.00042104366,0.9527134,0.0019831029,0.000022746495],"about_ca_topic_score_codex":0.00171445,"about_ca_topic_score_gemma":0.000830553,"teacher_disagreement_score":0.0077655315,"about_ca_system_score_codex":0.0036717972,"about_ca_system_score_gemma":0.0009232707,"threshold_uncertainty_score":0.026640892},"labels":[],"label_agreement":null},{"id":"W1819051592","doi":"10.55016/ojs/cdm.v8i1.62144","title":"2L convex polyominoes: discrete tomographical aspects","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyomino; Regular polygon; Mathematics; Computer science; Geometry","score_opus":0.009520367845906751,"score_gpt":0.28103065848989117,"score_spread":0.2715102906439844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819051592","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.050415624,0.00043674777,0.9160418,0.0003305861,0.0001149822,0.0000461399,0.0002491337,0.0001510375,0.032214023],"genre_scores_gemma":[0.51574916,0.0010162968,0.4630302,0.00018270667,0.00022028503,0.00007630059,0.0006037033,0.00032266424,0.018798651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967396,0.000059988975,0.000016995093,0.00008105122,0.00013247656,0.000035487155],"domain_scores_gemma":[0.99918514,0.0003241833,0.00011368178,0.00020643124,0.00011238382,0.000058176985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027085643,0.0002963326,0.00036253582,0.0009220866,0.00072917005,0.001382902,0.0005885069,0.00039026517,0.007835],"category_scores_gemma":[0.0022891827,0.00032683686,0.0003206585,0.00067554566,0.0014851538,0.0015823118,0.000989123,0.0012605272,0.0010336195],"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.0000995448,0.000036503294,0.0012001344,0.00017624632,0.00001183075,0.00046929097,0.0004017082,0.045153297,0.012265754,0.8343792,0.0029603783,0.102846205],"study_design_scores_gemma":[0.000033525626,0.00009319339,0.00252649,0.00008676519,0.000014643345,0.0019597502,0.00037934794,0.37568757,0.0148832705,0.5456101,0.05864105,0.00008429146],"about_ca_topic_score_codex":0.00087420526,"about_ca_topic_score_gemma":0.0013292193,"teacher_disagreement_score":0.007835,"about_ca_system_score_codex":0.00046153084,"about_ca_system_score_gemma":0.0002810476,"threshold_uncertainty_score":0.026210666},"labels":[],"label_agreement":null},{"id":"W1847349865","doi":"10.55016/ojs/cdm.v11i1.62389","title":"Diagonal recurrence relations for the Stirling numbers of the first kind","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Diagonal; Stirling engine; Stirling numbers of the first kind; Stirling number; Recurrence relation; Stirling numbers of the second kind; Mathematics; Bell polynomials; Algebra over a field; Combinatorics; Pure mathematics; Physics; Geometry; Thermodynamics","score_opus":0.029239544590278495,"score_gpt":0.3350296788509379,"score_spread":0.3057901342606594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847349865","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.104089156,0.008948215,0.63093746,0.0019323233,0.002778499,0.00014710402,0.00044973407,0.0009646145,0.24975292],"genre_scores_gemma":[0.8124317,0.0043358947,0.13459635,0.0010693892,0.001453073,0.00015001875,0.00041260466,0.0006477658,0.0449033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908113,0.00015440959,0.0000898299,0.0001476905,0.00034490603,0.0001820509],"domain_scores_gemma":[0.99835384,0.0006096953,0.0002677398,0.00018289287,0.00047698605,0.00010885024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012067851,0.00085487164,0.00062655174,0.0030162209,0.0013098932,0.0026985838,0.0010383036,0.00097434415,0.009359952],"category_scores_gemma":[0.005336678,0.00037602085,0.0010270542,0.0017170103,0.0018018984,0.0034162058,0.0012690496,0.0024357836,0.0031608844],"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.000015809608,0.000011117499,0.00012454565,0.00007626163,0.0000050180074,0.00010602551,0.00022982463,0.00051200157,0.0019198685,0.9832381,0.0019031403,0.011858214],"study_design_scores_gemma":[0.000006272177,0.000024431896,0.00020604047,0.000049776227,0.00001634066,0.00040347266,0.00010389098,0.010127147,0.0040951394,0.9745612,0.01035528,0.000051023355],"about_ca_topic_score_codex":0.0011119128,"about_ca_topic_score_gemma":0.0020214028,"teacher_disagreement_score":0.009359952,"about_ca_system_score_codex":0.0013804586,"about_ca_system_score_gemma":0.0005616292,"threshold_uncertainty_score":0.031312168},"labels":[],"label_agreement":null},{"id":"W1918750269","doi":"10.55016/ojs/cdm.v10i1.62186","title":"Graphs embedded into finite projective planes","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"California State University, Fresno; National Science Foundation","keywords":"Projective test; Projective plane; Mathematics; Pure mathematics; Computer science; Algebra over a field; Geometry","score_opus":0.03742679694509653,"score_gpt":0.34990496707552243,"score_spread":0.3124781701304259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918750269","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.83193547,0.0012506414,0.11192672,0.00069346227,0.000108197506,0.000046482208,0.00043138594,0.00029272214,0.053315],"genre_scores_gemma":[0.97238106,0.00077541784,0.018825278,0.000103946644,0.000056400717,0.00003592841,0.0003744287,0.000060902174,0.007386617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996153,0.000093669914,0.000021840255,0.00011745423,0.000084463514,0.000067255205],"domain_scores_gemma":[0.99897885,0.000378078,0.00026730384,0.00014483358,0.00011115584,0.00011985503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023656397,0.0006084064,0.0003579891,0.0010566697,0.0009041805,0.0015007943,0.0006733718,0.00071172736,0.004363728],"category_scores_gemma":[0.0018123387,0.00038472936,0.0003237271,0.0011940661,0.001513883,0.00480291,0.0015202687,0.0012889949,0.000588302],"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.00006381399,0.0000311606,0.0008966896,0.000089115805,0.000020090421,0.0004645605,0.0005635132,0.009395166,0.003675589,0.97288215,0.0008564354,0.011061667],"study_design_scores_gemma":[0.000018813198,0.000048941925,0.00091135124,0.000042808577,0.000017643135,0.00049959123,0.0007469805,0.022024972,0.0027412935,0.96452975,0.008397687,0.000020095476],"about_ca_topic_score_codex":0.0012060944,"about_ca_topic_score_gemma":0.0010438622,"teacher_disagreement_score":0.004363728,"about_ca_system_score_codex":0.0006890242,"about_ca_system_score_gemma":0.00016459425,"threshold_uncertainty_score":0.014598072},"labels":[],"label_agreement":null},{"id":"W2150373920","doi":"10.55016/ojs/cdm.v12i2.62601","title":"Group Irregular Labelings of Disconnected Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Group (periodic table); Totally disconnected space; Mathematics; Geography; Physics; Locally compact space","score_opus":0.013796895176866024,"score_gpt":0.28265791971028714,"score_spread":0.26886102453342114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150373920","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.9554836,0.0002135819,0.03204749,0.0006004299,0.000029748688,0.000015196492,0.000101073456,0.00011156871,0.011397478],"genre_scores_gemma":[0.99295145,0.00010895249,0.005115247,0.00005353935,0.00003630958,0.000014202895,0.00011221007,0.00003523507,0.001572882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995332,0.00014217653,0.000026223277,0.000098127864,0.00010269295,0.00009762317],"domain_scores_gemma":[0.995659,0.0018985437,0.0009326124,0.000520812,0.00027864563,0.0007104021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079654466,0.00040517305,0.00048085355,0.001696252,0.0010516384,0.0014824513,0.00060020795,0.00067288295,0.0020787506],"category_scores_gemma":[0.0041091447,0.00029615214,0.00044557612,0.00081551983,0.0026831604,0.0019275344,0.0017796287,0.0011205897,0.0002215938],"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.0002924359,0.000054017208,0.0064156847,0.00009877788,0.000025360368,0.00031262182,0.0008393901,0.022936508,0.011081308,0.9421516,0.0013384587,0.014453902],"study_design_scores_gemma":[0.000036440135,0.00007050697,0.0023947807,0.000027545675,0.000026731099,0.00031242688,0.00037365546,0.080306314,0.005338784,0.9080003,0.0030830768,0.000029488257],"about_ca_topic_score_codex":0.00043931205,"about_ca_topic_score_gemma":0.00053241727,"teacher_disagreement_score":0.0020787506,"about_ca_system_score_codex":0.0010775406,"about_ca_system_score_gemma":0.00024840506,"threshold_uncertainty_score":0.007818162},"labels":[],"label_agreement":null},{"id":"W2178834151","doi":"10.55016/ojs/cdm.v6i2.62073","title":"Signed star k-domatic number of a graph","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Mathematics; Graph; Combinatorics","score_opus":0.027351266769131025,"score_gpt":0.3223965417862386,"score_spread":0.2950452750171076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178834151","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.739925,0.0007776493,0.22572005,0.00081812136,0.00023193691,0.00013183746,0.002219275,0.00031694066,0.029859204],"genre_scores_gemma":[0.9275781,0.0004647726,0.06286463,0.00014236628,0.000107167936,0.0001244338,0.0011547252,0.000040048253,0.007523857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994598,0.00013200732,0.00005203993,0.0001389217,0.00014832403,0.00006885615],"domain_scores_gemma":[0.99797684,0.000638203,0.00035305505,0.000177358,0.00041426608,0.00044024098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053431024,0.00041108695,0.00046192456,0.0015337194,0.00072618097,0.001302537,0.0004526454,0.0005104576,0.0027683566],"category_scores_gemma":[0.0028895726,0.00019614151,0.00027842462,0.0010508368,0.0010468503,0.0021087965,0.0006997652,0.00046236397,0.000515601],"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.001042292,0.00014354216,0.012300853,0.0006088637,0.00009961249,0.00061025337,0.00073502725,0.038204722,0.051028118,0.77497476,0.008331361,0.11192053],"study_design_scores_gemma":[0.000084789026,0.00052031246,0.008204261,0.00008430236,0.000063913736,0.0024754354,0.00042805535,0.14151849,0.01616926,0.7917663,0.0385837,0.000101102065],"about_ca_topic_score_codex":0.0001934185,"about_ca_topic_score_gemma":0.00032739044,"teacher_disagreement_score":0.0027683566,"about_ca_system_score_codex":0.0006696296,"about_ca_system_score_gemma":0.0005571967,"threshold_uncertainty_score":0.009261131},"labels":[],"label_agreement":null},{"id":"W2269982198","doi":"10.55016/ojs/cdm.v12i2.62777","title":"Shellability, vertex decomposability, and lexicographical products of graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University; Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Vertex (graph theory); Combinatorics; Mathematics; Graph; Computer science","score_opus":0.024110148435130374,"score_gpt":0.34976466714273247,"score_spread":0.3256545187076021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269982198","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.79045445,0.00048672452,0.14822276,0.0003957714,0.000057516478,0.000039900387,0.00021262183,0.00019754774,0.059932698],"genre_scores_gemma":[0.9819842,0.0002464546,0.011830849,0.00006765181,0.00004558817,0.000028145905,0.00029987702,0.0000718687,0.0054253377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00009591337,0.00004634066,0.00016470872,0.0001905616,0.00011680222],"domain_scores_gemma":[0.9973158,0.0013005389,0.00039026103,0.00036684275,0.00020136879,0.00042506563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046418674,0.00044758222,0.00040462764,0.00096353627,0.0012618654,0.0017800234,0.0006803258,0.00043423605,0.0057829493],"category_scores_gemma":[0.002486791,0.00041727637,0.0004987666,0.00079835247,0.0029790679,0.004223831,0.0019110705,0.0015530436,0.00046710114],"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.00010813326,0.00004562923,0.0020772885,0.00004939402,0.000014650331,0.0007225895,0.00073112705,0.003047925,0.0069705644,0.9745393,0.0007996762,0.0108937],"study_design_scores_gemma":[0.000013450111,0.000038718234,0.0013458182,0.00001749145,0.00001948714,0.0008571527,0.0003211072,0.012289937,0.008694651,0.9706642,0.0057102353,0.000027673052],"about_ca_topic_score_codex":0.00072023104,"about_ca_topic_score_gemma":0.000843758,"teacher_disagreement_score":0.0057829493,"about_ca_system_score_codex":0.0004871494,"about_ca_system_score_gemma":0.00028532583,"threshold_uncertainty_score":0.01934594},"labels":[],"label_agreement":null},{"id":"W2346145792","doi":"10.55016/ojs/cdm.v14i1.62582","title":"Hamiltonian-connectedness of triangulations with few separating triangles","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universiteit Gent; Vlaamse regering; Vlaams Supercomputer Centrum","keywords":"Social connectedness; Combinatorics; Mathematics; Corollary; Hamiltonian (control theory)","score_opus":0.014064088123411764,"score_gpt":0.3166775454202772,"score_spread":0.30261345729686545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346145792","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.8692406,0.00035229983,0.110950924,0.00039405748,0.00003430862,0.00005120777,0.00041798092,0.00012236973,0.018436236],"genre_scores_gemma":[0.95823294,0.0003526636,0.037745588,0.00008346416,0.000025867928,0.000051543426,0.00059111987,0.0000622061,0.0028546036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995821,0.00007864409,0.00002647689,0.000101289355,0.00011774326,0.00009378059],"domain_scores_gemma":[0.9967637,0.0016391098,0.0006623322,0.00041097912,0.0002632697,0.00026051438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003040423,0.00036057716,0.00046003988,0.00088891253,0.0010289322,0.0011639578,0.00090912794,0.00062704465,0.009598785],"category_scores_gemma":[0.0039007955,0.00052608276,0.0005318768,0.0011944501,0.001679143,0.0018140718,0.0019667859,0.0010027016,0.0004822118],"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.0010096122,0.00017351394,0.019759614,0.00088132446,0.00020997012,0.0019323127,0.0022750488,0.12849489,0.060778994,0.69545496,0.004979576,0.084050275],"study_design_scores_gemma":[0.00022845174,0.00018723075,0.010334112,0.00018142734,0.00019088078,0.0015258385,0.0017316006,0.20796825,0.02425684,0.7400402,0.013277238,0.00007797886],"about_ca_topic_score_codex":0.0016600294,"about_ca_topic_score_gemma":0.0026126949,"teacher_disagreement_score":0.009598785,"about_ca_system_score_codex":0.0004550564,"about_ca_system_score_gemma":0.00030013183,"threshold_uncertainty_score":0.032111168},"labels":[],"label_agreement":null},{"id":"W2398485268","doi":"","title":"Explicit upper bounds for f(n)=Π p ω(n) p/p-1.","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.038412197028717364,"score_gpt":0.3822763062692632,"score_spread":0.34386410924054583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398485268","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.046802536,0.023386294,0.6250531,0.008420872,0.0022067754,0.00009750697,0.0010728658,0.0010474868,0.29191256],"genre_scores_gemma":[0.76327956,0.010872644,0.15741353,0.0023546799,0.0024077499,0.00043402324,0.0013911942,0.00091680704,0.060929853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805754,0.00043481062,0.00009681681,0.0003623192,0.0006250608,0.0004233332],"domain_scores_gemma":[0.9897655,0.006953268,0.0005777284,0.0011292393,0.0009542611,0.0006200652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034589318,0.0022015362,0.0013310956,0.0031369494,0.0020070262,0.0037649793,0.0034939891,0.0024219814,0.01834861],"category_scores_gemma":[0.026619138,0.0008099828,0.00096445705,0.0020814955,0.0028674572,0.01024336,0.005424802,0.0072460747,0.005818153],"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.00012052261,0.00009284895,0.00052687566,0.00022008651,0.000026236099,0.00009596638,0.00021774949,0.006119292,0.0017139121,0.9493813,0.013527609,0.027957704],"study_design_scores_gemma":[0.000015807247,0.00002041521,0.00068579754,0.00016138589,0.000033410335,0.000245873,0.00005578007,0.04041398,0.0018774848,0.9417132,0.01473661,0.00004019332],"about_ca_topic_score_codex":0.0010311003,"about_ca_topic_score_gemma":0.0025729928,"teacher_disagreement_score":0.01834861,"about_ca_system_score_codex":0.00238683,"about_ca_system_score_gemma":0.0010016909,"threshold_uncertainty_score":0.061382174},"labels":[],"label_agreement":null},{"id":"W2398997308","doi":"10.55016/ojs/cdm.v8i2.62172","title":"The Erdős-Ko-Rado basis for a Leonard system","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Basis (linear algebra); Generalization; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Mathematical proof; Vector space; Discrete mathematics; Space (punctuation); Pure mathematics; Computer science","score_opus":0.009733530655127777,"score_gpt":0.2591611842764233,"score_spread":0.24942765362129554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398997308","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.2876396,0.0009250947,0.54468256,0.0017178517,0.00037495268,0.00013731723,0.00053623976,0.00022992055,0.16375647],"genre_scores_gemma":[0.86437154,0.000861964,0.095989905,0.0006059199,0.00023345329,0.0002792626,0.00041894606,0.00013279701,0.037106093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995797,0.00011254266,0.000016295868,0.0000709119,0.00011529056,0.00010509024],"domain_scores_gemma":[0.9996784,0.00008125637,0.000042322376,0.000046752513,0.00007893382,0.000072431394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063016085,0.0003808048,0.00051242684,0.0011927749,0.0010028912,0.0010525119,0.00077810825,0.0006792209,0.0054503577],"category_scores_gemma":[0.0013228233,0.00024240195,0.00051132514,0.0005929603,0.0014913866,0.0014335043,0.0015806727,0.0016549573,0.0011126609],"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.000005544695,0.000004594031,0.00006137948,0.0000074755967,0.0000017984069,0.000012230485,0.000035784273,0.0013061722,0.00033618763,0.99563015,0.00052473415,0.0020739026],"study_design_scores_gemma":[0.000014930805,0.000023587641,0.00021769915,0.000019366467,0.0000041259236,0.000055134748,0.00006783637,0.0391311,0.0006706028,0.95158356,0.00819349,0.000018483948],"about_ca_topic_score_codex":0.0015282079,"about_ca_topic_score_gemma":0.0013717081,"teacher_disagreement_score":0.0054503577,"about_ca_system_score_codex":0.00074581435,"about_ca_system_score_gemma":0.00077387405,"threshold_uncertainty_score":0.0182333},"labels":[],"label_agreement":null},{"id":"W2401383348","doi":"10.55016/ojs/cdm.v20i2.62715","title":"Reversed Dickson polynomials of the (k+1)-th kind over finite fields, II","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Finite field; Combinatorics; Permutation (music); Mathematics; Prime (order theory); Generalization; Polynomial; Algebraic number; Discrete mathematics; Physics","score_opus":0.007535830103252515,"score_gpt":0.26938227219524385,"score_spread":0.2618464420919913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401383348","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.928141,0.0005505866,0.031813078,0.00055990205,0.00016942862,0.000024339703,0.00016619024,0.00009815282,0.038477324],"genre_scores_gemma":[0.9889538,0.0002606209,0.0048083803,0.0000628435,0.000060300015,0.000009971774,0.00010649977,0.000017869994,0.005719723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997634,0.0000368439,0.000009566058,0.000039445185,0.00004718108,0.00010352676],"domain_scores_gemma":[0.9996276,0.000115679686,0.000087784436,0.000058646372,0.000045742276,0.00006449913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002773757,0.00022166246,0.00016738009,0.0005948251,0.0005782204,0.00083171716,0.00027331512,0.00028439102,0.00275487],"category_scores_gemma":[0.0011868388,0.00013831804,0.00030433954,0.0004407825,0.000918296,0.00097479863,0.00044216745,0.0006460888,0.0003313197],"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.00024794077,0.000052669053,0.003254761,0.00008080046,0.000012017869,0.00041129888,0.0002321783,0.006931878,0.02241876,0.9460977,0.001933011,0.018326975],"study_design_scores_gemma":[0.00009019113,0.0005012762,0.010923666,0.0000771634,0.00005762783,0.0029809154,0.0006372152,0.11895357,0.057397366,0.77557015,0.03266273,0.00014808233],"about_ca_topic_score_codex":0.0010393471,"about_ca_topic_score_gemma":0.0009311599,"teacher_disagreement_score":0.00275487,"about_ca_system_score_codex":0.0007450496,"about_ca_system_score_gemma":0.00056570093,"threshold_uncertainty_score":0.009215951},"labels":[],"label_agreement":null},{"id":"W2438977958","doi":"10.55016/ojs/cdm.v12i1.62598","title":"First-Fit coloring of Cartesian product graphs and its defining sets","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Product (mathematics); Mathematics; Combinatorics; Geometry","score_opus":0.03617069705655002,"score_gpt":0.3428559451413638,"score_spread":0.3066852480848138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2438977958","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.5221699,0.0005358746,0.4562315,0.00046140404,0.000049000242,0.00008561636,0.00059273647,0.00037848405,0.019495428],"genre_scores_gemma":[0.7176788,0.00035701809,0.27462965,0.00022445677,0.00006602951,0.00017222554,0.0011588756,0.00016216336,0.0055507463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811554,0.00063506817,0.00010240823,0.00050516514,0.00036697133,0.00027485646],"domain_scores_gemma":[0.9941518,0.0029328144,0.00070609106,0.0010367817,0.0007172569,0.00045534485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015082267,0.0006890236,0.00064690295,0.001071051,0.0012575147,0.0017092029,0.0010277521,0.0005604976,0.0022905665],"category_scores_gemma":[0.0050332616,0.0007323009,0.00075016316,0.0013950273,0.0027582021,0.0020706633,0.0012309543,0.0014761371,0.00042763754],"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.00022278968,0.00012006743,0.0038460973,0.00017271517,0.000028437096,0.00020110427,0.0009627956,0.02282557,0.010345152,0.9300774,0.0027577311,0.028440101],"study_design_scores_gemma":[0.0000559765,0.00025865308,0.003700871,0.00005797367,0.000040919316,0.00107687,0.00033956062,0.09155349,0.00917164,0.8823491,0.0113388365,0.00005612414],"about_ca_topic_score_codex":0.0014077707,"about_ca_topic_score_gemma":0.001597796,"teacher_disagreement_score":0.0022905665,"about_ca_system_score_codex":0.0011422613,"about_ca_system_score_gemma":0.0008341244,"threshold_uncertainty_score":0.008287728},"labels":[],"label_agreement":null},{"id":"W2471328753","doi":"10.55016/ojs/cdm.v16i1.62653","title":"Schröder partitions, Schröder tableaux and weak poset patterns","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per il Calcolo Scientifico; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Partially ordered set; Young tableau; Mathematics; Combinatorics; Order (exchange); Discrete mathematics","score_opus":0.02329135072473103,"score_gpt":0.3404212909613175,"score_spread":0.31712994023658647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471328753","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.17408873,0.00047187624,0.74746066,0.00079187047,0.00023053176,0.00014422579,0.0003666382,0.00046634604,0.075979196],"genre_scores_gemma":[0.7327013,0.00059608044,0.23374622,0.0005675616,0.00020093222,0.00019512889,0.00065820146,0.00027054248,0.031063963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989831,0.00022651763,0.00009875779,0.0002683532,0.00029138857,0.00013191556],"domain_scores_gemma":[0.99857986,0.00054622546,0.00018499447,0.00033500057,0.0002050268,0.00014899625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081581285,0.00054450356,0.0005138573,0.000967643,0.0011873081,0.00298788,0.000862988,0.0008705553,0.007219047],"category_scores_gemma":[0.0031867144,0.0003756713,0.0008805181,0.0013028787,0.002825328,0.006727678,0.0017911812,0.0015662832,0.0013365402],"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.000018118913,0.00000916953,0.00021627372,0.000021324311,0.000002958994,0.000044643803,0.00016305545,0.0009222858,0.0012430499,0.98769593,0.0004068035,0.009256484],"study_design_scores_gemma":[0.000008120622,0.00005060324,0.00032233322,0.000018013896,0.000009255663,0.00019915782,0.00020911147,0.008164478,0.004162094,0.9757121,0.011120888,0.000023789571],"about_ca_topic_score_codex":0.00081453315,"about_ca_topic_score_gemma":0.0014979295,"teacher_disagreement_score":0.007219047,"about_ca_system_score_codex":0.00095730537,"about_ca_system_score_gemma":0.00068638986,"threshold_uncertainty_score":0.024150133},"labels":[],"label_agreement":null},{"id":"W2557475083","doi":"10.55016/ojs/cdm.v14i1.62485","title":"Eulerian polynomials and polynomial congruences","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Congruence relation; Eulerian path; Mathematics; Polynomial; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01779657745515862,"score_gpt":0.3358188767292266,"score_spread":0.318022299274068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557475083","genre_codex":"methods","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.24057363,0.0013220012,0.42893898,0.0033189575,0.0008884998,0.00012934416,0.00042523432,0.00022024667,0.32418308],"genre_scores_gemma":[0.9533273,0.0010758428,0.026553048,0.0002924459,0.00074217835,0.000050943996,0.0002936051,0.000101124846,0.017563429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976465,0.00042257248,0.0001292372,0.00045364728,0.000827326,0.0005207643],"domain_scores_gemma":[0.99658006,0.0013692961,0.00047022782,0.00046628402,0.000766832,0.0003472774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019516235,0.00067856157,0.00072794536,0.0012040804,0.0020477362,0.002775799,0.0006142653,0.00065274804,0.007831998],"category_scores_gemma":[0.008106683,0.00031059005,0.0009195704,0.0014964475,0.004939635,0.0054244497,0.0034170337,0.0034114674,0.0016107399],"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.000009592808,0.000013344548,0.00018644187,0.000011495418,0.0000018290708,0.00005768005,0.00012599057,0.00026573616,0.0005308994,0.99617636,0.00035998068,0.0022606666],"study_design_scores_gemma":[0.000009926395,0.00001368709,0.000278761,0.000010877503,0.0000044282547,0.000115487535,0.00010948497,0.002248417,0.0011136753,0.99030006,0.005786899,0.000008228518],"about_ca_topic_score_codex":0.0016031319,"about_ca_topic_score_gemma":0.0013458758,"teacher_disagreement_score":0.007831998,"about_ca_system_score_codex":0.0013121639,"about_ca_system_score_gemma":0.0012459732,"threshold_uncertainty_score":0.026200593},"labels":[],"label_agreement":null},{"id":"W2620630814","doi":"10.55016/ojs/cdm.v14i1.62425","title":"Generating Special Arithmetic Functions by Lambert Series Factorizations","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Euler's formula; Series (stratigraphy); Partition (number theory); Lambert W function; Inverse; Arithmetic function; Generating function; Divergent series; Algebra over a field; Arithmetic; Pure mathematics; Combinatorics; Discrete mathematics; Algorithm; Mathematical analysis","score_opus":0.015079649829586414,"score_gpt":0.3020657537032398,"score_spread":0.28698610387365336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620630814","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.32710502,0.0024770857,0.45038506,0.0025405383,0.0008977974,0.000092437855,0.0002286901,0.00075874425,0.2155148],"genre_scores_gemma":[0.91914195,0.0015998045,0.04960477,0.00051734,0.00090239133,0.00008911644,0.00013953583,0.00021847704,0.027786488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993793,0.0001205579,0.000027286871,0.00010137577,0.00026227656,0.000109155284],"domain_scores_gemma":[0.9991974,0.00032403026,0.00011066794,0.00013354183,0.00015438824,0.00007997611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012135122,0.00066746236,0.0006560667,0.002444868,0.0011143867,0.0023384776,0.0008749853,0.00085219025,0.007278844],"category_scores_gemma":[0.0036244672,0.00032798803,0.00091345015,0.00093247026,0.00295853,0.004804159,0.0013560887,0.0017641094,0.0014679933],"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.000006790387,0.000006720769,0.00005097815,0.000014757102,0.0000015337225,0.000044130917,0.00012271771,0.00054266304,0.000542993,0.995037,0.00042205479,0.003207664],"study_design_scores_gemma":[0.000005909245,0.000013927383,0.0000786119,0.00001549938,0.0000035971298,0.000108076834,0.00005253534,0.0072932323,0.0009879494,0.98823416,0.003194858,0.000011632027],"about_ca_topic_score_codex":0.0005121661,"about_ca_topic_score_gemma":0.00053463987,"teacher_disagreement_score":0.007278844,"about_ca_system_score_codex":0.0011322465,"about_ca_system_score_gemma":0.00047988052,"threshold_uncertainty_score":0.024350107},"labels":[],"label_agreement":null},{"id":"W2626654879","doi":"10.55016/ojs/cdm.v15i1.62606","title":"Pell Coding and Pell Decoding Methods with Some Applications","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Coding (social sciences); Mathematics; Coding theory; Combinatorics; Algorithm; Arithmetic; Discrete mathematics; Statistics","score_opus":0.016173886170146118,"score_gpt":0.3439716188136487,"score_spread":0.32779773264350254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626654879","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.005920532,0.00080738496,0.9751544,0.00043225702,0.00018994501,0.000037155136,0.000079851765,0.00030915448,0.017069241],"genre_scores_gemma":[0.15608202,0.0034476118,0.80983245,0.0006386698,0.00058808294,0.00025298295,0.00028827158,0.0006885715,0.028181328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991892,0.00029463315,0.000051176674,0.00011712927,0.00025808736,0.00008964894],"domain_scores_gemma":[0.99876773,0.00055434776,0.00010001553,0.00018326173,0.00033123547,0.00006349788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427062,0.0013387959,0.00062653265,0.001406126,0.00079855946,0.0013154072,0.00091247115,0.0011906736,0.005624384],"category_scores_gemma":[0.0044667786,0.00039955214,0.00097150856,0.001542717,0.002543613,0.0026259532,0.0016372022,0.0022103114,0.0027151932],"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.000023317352,0.000009948224,0.00014332324,0.00006146387,0.000007317202,0.000054295862,0.00010790949,0.012704767,0.0023735098,0.9384,0.0023464055,0.043767817],"study_design_scores_gemma":[0.000016868178,0.000045547473,0.00009251911,0.000040858133,0.000015195435,0.0002325826,0.00004232898,0.13170223,0.0080487905,0.8325654,0.027135449,0.000062142186],"about_ca_topic_score_codex":0.0016810155,"about_ca_topic_score_gemma":0.0009935214,"teacher_disagreement_score":0.005624384,"about_ca_system_score_codex":0.0010347663,"about_ca_system_score_gemma":0.0010658903,"threshold_uncertainty_score":0.018815458},"labels":[],"label_agreement":null},{"id":"W2730815467","doi":"","title":"A note on monochromatic linear recurrence sequences.","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Physics; Optics","score_opus":0.025640256055861232,"score_gpt":0.3353129503080017,"score_spread":0.30967269425214045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730815467","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.035782795,0.05894669,0.5595219,0.010173817,0.026788147,0.000103914295,0.0009831735,0.0007263556,0.30697325],"genre_scores_gemma":[0.49966642,0.036232673,0.30689117,0.007855276,0.011130446,0.00024430052,0.00066936656,0.00051327253,0.13679697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996153,0.000072255454,0.000029772424,0.0001045741,0.00013398506,0.00004404151],"domain_scores_gemma":[0.99919385,0.00044064215,0.00006537803,0.00011789715,0.00013128166,0.000051014642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042326192,0.00037080506,0.00036492702,0.00068043015,0.0006640169,0.001036105,0.0008153812,0.00057528575,0.012057618],"category_scores_gemma":[0.0030119482,0.00020816653,0.00038837275,0.0009632178,0.0007728022,0.0016518122,0.0009550869,0.0014088282,0.0024603102],"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.00007119144,0.000019618597,0.0001683024,0.00023442315,0.000011284701,0.00027591945,0.00019522042,0.0030231846,0.0062903124,0.8584496,0.035736296,0.0955247],"study_design_scores_gemma":[0.000011718846,0.000082614555,0.0003604555,0.000087980916,0.00002069033,0.0007274405,0.000079076075,0.011247812,0.0053612436,0.71813214,0.2638536,0.000035256307],"about_ca_topic_score_codex":0.0009998488,"about_ca_topic_score_gemma":0.0017952729,"teacher_disagreement_score":0.012057618,"about_ca_system_score_codex":0.0005770997,"about_ca_system_score_gemma":0.00041300437,"threshold_uncertainty_score":0.040336788},"labels":[],"label_agreement":null},{"id":"W2751951661","doi":"10.55016/ojs/cdm.v14i1.62638","title":"On the classification of automorphisms of trees","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automorphism; Mathematics; Countable set; Conjugacy class; Combinatorics; Branching (polymer chemistry); Conjugacy problem; Tree (set theory); Discrete mathematics","score_opus":0.036291431646673734,"score_gpt":0.3321746786927396,"score_spread":0.29588324704606583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751951661","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.88744223,0.00069677184,0.095037326,0.0016753828,0.00009184276,0.00009337835,0.0006237141,0.00020281249,0.01413663],"genre_scores_gemma":[0.97110254,0.00057333166,0.021878673,0.00012305973,0.00034628378,0.000095426316,0.0015153439,0.000092951406,0.0042724144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761164,0.0007287188,0.00016947476,0.0005661904,0.00053021434,0.00039381074],"domain_scores_gemma":[0.972325,0.021052718,0.00229151,0.0020757255,0.0009032213,0.0013518101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002471143,0.0007115405,0.0016894669,0.003002173,0.0017858673,0.0062656016,0.0016098898,0.0021803612,0.0057408297],"category_scores_gemma":[0.01935114,0.00056927645,0.0017816578,0.0021075597,0.0041740225,0.008667513,0.0029328456,0.0029983488,0.00066344626],"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.00043058867,0.0002900432,0.013118582,0.00030327204,0.000115789066,0.00037712848,0.0010173816,0.061780117,0.0031531395,0.8890567,0.0043221563,0.026035134],"study_design_scores_gemma":[0.000030120658,0.00003496197,0.0016077991,0.000025333795,0.000020159434,0.00014013011,0.000110866,0.10768633,0.0007232985,0.88878757,0.0008108419,0.00002265255],"about_ca_topic_score_codex":0.0012592011,"about_ca_topic_score_gemma":0.00075865886,"teacher_disagreement_score":0.0062656016,"about_ca_system_score_codex":0.0023580615,"about_ca_system_score_gemma":0.00090128876,"threshold_uncertainty_score":0.019204974},"labels":[],"label_agreement":null},{"id":"W2797717882","doi":"10.55016/ojs/cdm.v17i1.69514","title":"Some relational structures with polynomial growth and their associated algebras II. Finite generation.","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Bounded function; Invariant (physics); Combinatorics; Conjecture; Polynomial; Discrete mathematics; Pure mathematics","score_opus":0.02508052111001085,"score_gpt":0.2819581800075086,"score_spread":0.25687765889749775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797717882","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.6409276,0.004582783,0.2556644,0.0026715132,0.00019698418,0.00015692087,0.0011327768,0.00034792066,0.09431911],"genre_scores_gemma":[0.9635296,0.0007377452,0.0215851,0.0002350416,0.00022438522,0.00006455383,0.00032863964,0.00003419533,0.013260634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993236,0.00011801753,0.000033461263,0.00013840519,0.00022457175,0.0001619839],"domain_scores_gemma":[0.99880826,0.0004219649,0.0002618893,0.00012081545,0.00016806566,0.00021891357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010426338,0.00039140004,0.0003506881,0.0015412663,0.0012067035,0.0022039707,0.0007123435,0.0006110467,0.0044748904],"category_scores_gemma":[0.002443646,0.0003163033,0.00072651106,0.001325112,0.002485858,0.004032524,0.0014485533,0.0015357739,0.000780075],"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.000009252268,0.00000951422,0.0002454309,0.00001524714,0.000002035569,0.000058082245,0.00021507953,0.000573941,0.00052923185,0.9955432,0.0002620636,0.002537036],"study_design_scores_gemma":[0.000008650869,0.000025735655,0.00044830778,0.000010089151,0.000005884154,0.00015688254,0.000099720426,0.0069995807,0.00079524226,0.9875051,0.0039289747,0.00001568777],"about_ca_topic_score_codex":0.0026936478,"about_ca_topic_score_gemma":0.0014302554,"teacher_disagreement_score":0.0044748904,"about_ca_system_score_codex":0.0022842893,"about_ca_system_score_gemma":0.00071588537,"threshold_uncertainty_score":0.016573727},"labels":[],"label_agreement":null},{"id":"W2799119604","doi":"10.55016/ojs/cdm.v15i2.62327","title":"A method to determine algebraically integral Cayley digraphs on finite abelian group","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Cayley transform; Abelian group; Cayley's theorem; Combinatorics; Eigenvalues and eigenvectors; Commutative property; Algebraic number; Finite field; Group (periodic table); Discrete mathematics; Graph; Mathematical analysis","score_opus":0.041047431846359034,"score_gpt":0.34807745104441473,"score_spread":0.3070300191980557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799119604","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.06524788,0.00033003744,0.91824704,0.00023006198,0.0001510812,0.00020876223,0.00036510453,0.00094182655,0.0142782945],"genre_scores_gemma":[0.2523817,0.00031086188,0.7398378,0.0001318746,0.00008531753,0.00019406507,0.00056701014,0.00017197673,0.006319447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996766,0.00007609447,0.000027898735,0.00009076092,0.00009076118,0.000037897364],"domain_scores_gemma":[0.99904746,0.00031035865,0.000083803585,0.00020515018,0.0002494016,0.00010381456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042960697,0.0005653773,0.00049571384,0.0031846913,0.0010443347,0.0010944006,0.00075468037,0.000507275,0.003998016],"category_scores_gemma":[0.0023514524,0.00036337887,0.0006243855,0.0015445153,0.0010299339,0.0016547589,0.0009917349,0.001115546,0.001111187],"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.00015900841,0.00021395985,0.004286651,0.00036737614,0.00009181531,0.00047802555,0.00093790825,0.014118909,0.04869867,0.6527754,0.008101131,0.26977098],"study_design_scores_gemma":[0.00010698897,0.00026541288,0.0028436717,0.00010200502,0.00008055645,0.0009698461,0.0005866028,0.20609921,0.02463902,0.72235763,0.041774835,0.00017415365],"about_ca_topic_score_codex":0.0012643286,"about_ca_topic_score_gemma":0.0024658684,"teacher_disagreement_score":0.003998016,"about_ca_system_score_codex":0.0005893012,"about_ca_system_score_gemma":0.0008724158,"threshold_uncertainty_score":0.013374686},"labels":[],"label_agreement":null},{"id":"W2895411163","doi":"10.55016/ojs/cdm.v10i1.62303","title":"Visibility-monotonic polygon deflation","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Visibility; Visibility polygon; Rectilinear polygon; Star-shaped polygon; Point in polygon; Simple polygon; Monotonic function; Polygon covering; Computer science; Monotone polygon; Computer vision; Regular polygon; Combinatorics; Computer graphics (images); Mathematics; Artificial intelligence; Polygon mesh; Geometry; Mathematical analysis; Physics; Optics; Convex set","score_opus":0.024631269072147997,"score_gpt":0.31846043104266714,"score_spread":0.2938291619705191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895411163","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.42778328,0.000297179,0.5271037,0.00035804507,0.00017781266,0.00011792118,0.0004351833,0.00068841944,0.04303841],"genre_scores_gemma":[0.86392695,0.00018148836,0.12643725,0.00012489819,0.000037441383,0.00008319403,0.00055417325,0.0002796841,0.008374855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950516,0.000059678558,0.000034830882,0.0001507697,0.00016202833,0.00008751924],"domain_scores_gemma":[0.99876106,0.00029790887,0.00021974133,0.00043932322,0.00016881284,0.00011311983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028462836,0.00033440196,0.00037013617,0.00042683768,0.0005654002,0.0010915046,0.00086666405,0.00056954083,0.0043375874],"category_scores_gemma":[0.0024152857,0.00033244956,0.00054837967,0.0003362925,0.0016221745,0.0019202058,0.00181352,0.0012717176,0.0005601851],"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.00052066235,0.00010330436,0.0044199526,0.00039250508,0.000042532825,0.0017145519,0.0012322672,0.052583683,0.13474467,0.6687558,0.0045627058,0.13092728],"study_design_scores_gemma":[0.00013008248,0.00051314215,0.0051154094,0.00018530796,0.000054357963,0.0033039902,0.0010728143,0.31588385,0.1415722,0.44591817,0.08611801,0.00013266774],"about_ca_topic_score_codex":0.0005853826,"about_ca_topic_score_gemma":0.00063341664,"teacher_disagreement_score":0.0043375874,"about_ca_system_score_codex":0.00031493476,"about_ca_system_score_gemma":0.00032989317,"threshold_uncertainty_score":0.014510632},"labels":[],"label_agreement":null},{"id":"W2907170940","doi":"10.55016/ojs/cdm.v13i2.62730","title":"Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; Deutscher Akademischer Austauschdienst","keywords":"Hypergraph; Mathematics; Combinatorics; Hamiltonian (control theory); Hamiltonian path; Degree (music); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics; Graph","score_opus":0.0222772638909818,"score_gpt":0.32917001272122837,"score_spread":0.3068927488302466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907170940","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.7585171,0.0012423316,0.1920194,0.0013628581,0.00015864217,0.00008938281,0.00095286436,0.0004905559,0.0451669],"genre_scores_gemma":[0.97524697,0.0003272403,0.0179452,0.0003835318,0.000074609794,0.000092347895,0.00045162177,0.00012722357,0.0053513064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991308,0.00015905878,0.000044883935,0.0002523791,0.00014699607,0.00026591035],"domain_scores_gemma":[0.9946461,0.0026069654,0.0005705382,0.0008920945,0.00045140734,0.0008329696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010661936,0.0006848119,0.00077258126,0.001111485,0.0014215931,0.0021705416,0.0018739089,0.001126098,0.008729117],"category_scores_gemma":[0.009697374,0.00079460884,0.00086300937,0.0009137574,0.001995359,0.0046451166,0.003351199,0.0024099252,0.00078799174],"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.0005000833,0.000081420214,0.0050053806,0.00041385597,0.00007493259,0.0006295084,0.0006786775,0.03797913,0.01181493,0.924541,0.0048022857,0.013478726],"study_design_scores_gemma":[0.00006385844,0.00008315448,0.0018231435,0.00006738218,0.00004454935,0.00043728246,0.00035936444,0.11238773,0.006803166,0.873756,0.004132423,0.00004197607],"about_ca_topic_score_codex":0.0012777738,"about_ca_topic_score_gemma":0.0020484116,"teacher_disagreement_score":0.008729117,"about_ca_system_score_codex":0.00096274994,"about_ca_system_score_gemma":0.00049551565,"threshold_uncertainty_score":0.029201865},"labels":[],"label_agreement":null},{"id":"W2945144629","doi":"10.55016/ojs/cdm.v16i3.71284","title":"Homotopy Type of Independence Complexes of Certain Families of Graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Technology Bombay; Infosys Foundation","keywords":"Mathematics; Homotopy; Combinatorics; Homotopy sphere; Regular homotopy; Categorical variable; Discrete mathematics; Independence (probability theory); Graph; n-connected; Wedge (geometry); Pure mathematics; Geometry","score_opus":0.024733293724966722,"score_gpt":0.306981659783901,"score_spread":0.2822483660589343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945144629","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.9128103,0.00026652915,0.05481841,0.00034818274,0.0000472926,0.00005405849,0.00027394455,0.00017442541,0.031206781],"genre_scores_gemma":[0.98781735,0.00017675615,0.0061804643,0.000053696032,0.000032275388,0.00005429734,0.00037314583,0.000051772106,0.0052602026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988952,0.00014172864,0.00006710921,0.00028182182,0.00041865592,0.00019546637],"domain_scores_gemma":[0.9964952,0.0012673303,0.0004999916,0.00041703688,0.0005643139,0.0007562041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078507955,0.00043327056,0.0004247038,0.0043807435,0.0021462976,0.0027889328,0.0011325943,0.0009320004,0.008143409],"category_scores_gemma":[0.004176507,0.00071288715,0.00063837867,0.0014570742,0.0024390668,0.004810492,0.0025416878,0.0016355071,0.00048052784],"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.00010781795,0.00007030073,0.009244304,0.00006373422,0.0000365556,0.000841675,0.0017678003,0.0027418926,0.006770909,0.96497834,0.0014842758,0.011892356],"study_design_scores_gemma":[0.000049573307,0.00007774055,0.017072914,0.000048735397,0.00006854537,0.002630303,0.0016989192,0.03264786,0.01301141,0.91851395,0.014088922,0.00009109018],"about_ca_topic_score_codex":0.0014588728,"about_ca_topic_score_gemma":0.0011716383,"teacher_disagreement_score":0.008143409,"about_ca_system_score_codex":0.0014761342,"about_ca_system_score_gemma":0.00032373326,"threshold_uncertainty_score":0.027242362},"labels":[],"label_agreement":null},{"id":"W2950772534","doi":"10.55016/ojs/cdm.v8i1.62123","title":"Convex sublattices of a lattice and a fixed point property","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Fixed-point property; Property (philosophy); Lattice (music); Regular polygon; Fixed point; Mathematics; Pure mathematics; Fixed-point theorem; Mathematical analysis; Geometry; Physics; Philosophy; Epistemology","score_opus":0.02203956187181659,"score_gpt":0.31975800643464714,"score_spread":0.29771844456283053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950772534","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.58175075,0.0023994504,0.3312167,0.0014064731,0.00014377186,0.00014915956,0.001156254,0.0003580712,0.08141939],"genre_scores_gemma":[0.90351206,0.0005970687,0.08465858,0.0002071426,0.00018009172,0.00014511352,0.0010412879,0.00008076044,0.009577885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983138,0.0003791002,0.0001305167,0.00032058955,0.0006245283,0.00023139037],"domain_scores_gemma":[0.99757546,0.0009137445,0.0003019953,0.00027327187,0.00048219878,0.0004533806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131496,0.0004759684,0.00061846635,0.0017015549,0.0015589196,0.0027246585,0.00070923165,0.0004631485,0.003558373],"category_scores_gemma":[0.0022064983,0.00043768997,0.00092303724,0.0010759394,0.004226774,0.0037276486,0.0016439267,0.0013637299,0.00041157944],"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.000081614024,0.000036737554,0.0012555955,0.000059559272,0.000026683107,0.00031119987,0.0007160095,0.002138255,0.006645686,0.9795889,0.0009080081,0.008231686],"study_design_scores_gemma":[0.000054880187,0.000104292885,0.0018502689,0.000030058214,0.000025889394,0.00072383945,0.00081097416,0.018112667,0.007291428,0.95630926,0.014642983,0.000043559616],"about_ca_topic_score_codex":0.0029918486,"about_ca_topic_score_gemma":0.0025081853,"teacher_disagreement_score":0.003558373,"about_ca_system_score_codex":0.0015761775,"about_ca_system_score_gemma":0.00073601736,"threshold_uncertainty_score":0.011903942},"labels":[],"label_agreement":null},{"id":"W2951867195","doi":"10.55016/ojs/cdm.v9i1.62101","title":"Determination of the prime bound of a graph","year":2014,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Omega; Graph; Mathematics; Prime (order theory); Integer (computer science); Discrete mathematics; Physics; Computer science","score_opus":0.01369475596781104,"score_gpt":0.27628647856044986,"score_spread":0.2625917225926388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951867195","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.55592185,0.0026312028,0.37447718,0.003321771,0.0002760134,0.0002569784,0.0027762577,0.002233454,0.058105223],"genre_scores_gemma":[0.9202289,0.0009457794,0.07106776,0.00033906198,0.00029728955,0.00014769203,0.0012266077,0.0003552956,0.00539168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990087,0.00018335787,0.000027993354,0.00040741957,0.00015984508,0.00021274471],"domain_scores_gemma":[0.987817,0.008261056,0.0007232107,0.0013017048,0.0006648115,0.0012321895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001520982,0.00085659866,0.0011622653,0.0022606226,0.0013983073,0.0028281612,0.0015868336,0.0009945163,0.0067133545],"category_scores_gemma":[0.014090701,0.0007538685,0.00068535714,0.0014272002,0.0024671203,0.0055576493,0.0017798158,0.0023241937,0.0018930446],"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.0022130061,0.00049792096,0.026422476,0.0011233649,0.00025919054,0.0016016308,0.0018695315,0.08056346,0.04917305,0.6516663,0.0399045,0.14470561],"study_design_scores_gemma":[0.00012895046,0.00039725675,0.009236941,0.00016650438,0.00017081402,0.00256068,0.00064285455,0.19850011,0.027346268,0.7301945,0.030543337,0.00011170679],"about_ca_topic_score_codex":0.00072131975,"about_ca_topic_score_gemma":0.00068679167,"teacher_disagreement_score":0.0067133545,"about_ca_system_score_codex":0.001582201,"about_ca_system_score_gemma":0.0010169031,"threshold_uncertainty_score":0.022458434},"labels":[],"label_agreement":null},{"id":"W2952171248","doi":"10.55016/ojs/cdm.v9i1.62183","title":"The rigidity of periodic frameworks as graphs on a fixed torus","year":2014,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Torus; Infinitesimal; Rigidity (electromagnetism); Mathematics; Pure mathematics; Geometry; Mathematical analysis; Structural engineering; Engineering","score_opus":0.00675325704669728,"score_gpt":0.25773424508849585,"score_spread":0.2509809880417986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952171248","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.61520994,0.0011493484,0.29566953,0.0012010387,0.000264112,0.00010565271,0.00076114904,0.0005607501,0.085078545],"genre_scores_gemma":[0.97108793,0.0004209906,0.022777498,0.0001423262,0.000095295385,0.00007577827,0.00027866487,0.000107754415,0.0050138114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924433,0.00015885476,0.000032018546,0.00018427335,0.0001890481,0.00019147695],"domain_scores_gemma":[0.99891603,0.00030146184,0.00022677434,0.00022715551,0.00011208161,0.0002166161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005590144,0.0005962234,0.00060571625,0.0014623405,0.001565487,0.0016167015,0.0010996577,0.0011555204,0.0049235434],"category_scores_gemma":[0.00229949,0.00039550598,0.0009261448,0.0008704363,0.0030394979,0.0029533273,0.001970694,0.0013550874,0.00043525762],"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.000018250052,0.0000069134157,0.00017122974,0.000027556782,0.0000067240844,0.00012408945,0.00010956152,0.009627788,0.0013684388,0.9859115,0.00058575504,0.0020421438],"study_design_scores_gemma":[0.000013155329,0.000035727135,0.0006574144,0.000024259594,0.00001240971,0.00028401494,0.00022185419,0.036212984,0.0007434517,0.9578465,0.0039200117,0.00002824371],"about_ca_topic_score_codex":0.0016739037,"about_ca_topic_score_gemma":0.0017743575,"teacher_disagreement_score":0.0049235434,"about_ca_system_score_codex":0.0009139642,"about_ca_system_score_gemma":0.0005075347,"threshold_uncertainty_score":0.01647091},"labels":[],"label_agreement":null},{"id":"W2952374475","doi":"10.55016/ojs/cdm.v13i2.62737","title":"Face Module for Realizable Z-matroids","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Royal Swedish Academy of Sciences; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Matroid; Mathematics; Combinatorics; Face (sociological concept); Tutte polynomial; Hilbert–Poincaré series; Graphic matroid; Discrete mathematics; Sociology; Graph","score_opus":0.03275326053272644,"score_gpt":0.3737193537021035,"score_spread":0.3409660931693771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952374475","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.7863755,0.0007385971,0.15259522,0.000636146,0.00014856356,0.00007250469,0.0004926773,0.00035866527,0.058582142],"genre_scores_gemma":[0.9698118,0.0003379018,0.014389691,0.00011959801,0.00018936883,0.00004811715,0.00030950707,0.00005171401,0.014742346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966824,0.000043639706,0.000012710492,0.00008464321,0.00010268215,0.000088008295],"domain_scores_gemma":[0.99967074,0.00007058417,0.00006013932,0.000036288355,0.000046137116,0.00011608962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000417708,0.0003416859,0.00038515398,0.00081763824,0.0006748259,0.0017921466,0.0006059284,0.00037532498,0.006618019],"category_scores_gemma":[0.0005988485,0.00018462236,0.0005480609,0.0004105322,0.0010453729,0.0029715525,0.0012822859,0.0012794123,0.00077142037],"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.00005108239,0.0000354074,0.0005014625,0.00004749103,0.000008478065,0.000118655196,0.00022804891,0.0015927155,0.0032922346,0.9845695,0.00062569213,0.008929209],"study_design_scores_gemma":[0.00004480705,0.00021000071,0.0020873952,0.000025557181,0.00003088776,0.00050971296,0.0002443767,0.018950466,0.006711869,0.9605334,0.010602871,0.000048631147],"about_ca_topic_score_codex":0.0004558759,"about_ca_topic_score_gemma":0.0004482293,"teacher_disagreement_score":0.006618019,"about_ca_system_score_codex":0.0008340191,"about_ca_system_score_gemma":0.00033714174,"threshold_uncertainty_score":0.02213949},"labels":[],"label_agreement":null},{"id":"W2952565476","doi":"10.55016/ojs/cdm.v5i2.62032","title":"The Cops and Robber game on graphs with forbidden (induced) subgraphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fédération Wallonie-Bruxelles; Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematical economics; Computer science; Mathematics","score_opus":0.012035481921575131,"score_gpt":0.2990309502276869,"score_spread":0.2869954683061118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952565476","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.6664141,0.00027443646,0.31594157,0.00081495737,0.000040644358,0.00018761528,0.0006410497,0.00029142373,0.015394187],"genre_scores_gemma":[0.93870926,0.0003317796,0.055198997,0.00014613464,0.000039094066,0.000196402,0.0005484292,0.00012915698,0.0047008316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990376,0.00032435838,0.00004893293,0.00021532275,0.00013438288,0.00023943593],"domain_scores_gemma":[0.99358565,0.004249484,0.00084666855,0.00041297975,0.00020090396,0.00070439465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092273863,0.0008242559,0.0012151992,0.0007158885,0.00089552096,0.0014927697,0.0016460889,0.0012301274,0.0033424876],"category_scores_gemma":[0.0070432397,0.0004490356,0.0006965605,0.0007394813,0.0020206277,0.004327794,0.0012970084,0.0014691834,0.00027422712],"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.0009881048,0.00033167386,0.0026801184,0.00039645258,0.00011605212,0.00078300637,0.00083948264,0.26052102,0.014009292,0.68932873,0.005162092,0.024844011],"study_design_scores_gemma":[0.00012796573,0.00017780247,0.0012127741,0.000030320814,0.000044815617,0.0002653535,0.0002298585,0.519146,0.0032178266,0.47284743,0.002661997,0.000037740654],"about_ca_topic_score_codex":0.0024068926,"about_ca_topic_score_gemma":0.0024150284,"teacher_disagreement_score":0.0033424876,"about_ca_system_score_codex":0.0013104966,"about_ca_system_score_gemma":0.0008449245,"threshold_uncertainty_score":0.011181712},"labels":[],"label_agreement":null},{"id":"W2963698001","doi":"10.55016/ojs/cdm.v7i2.62148","title":"Antichains and counterpoint dichotomies","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Counterpoint; Dichotomy; Mathematics; Combinatorics; Mathematical economics; Genealogy; Sociology; History; Statistics","score_opus":0.019638630347670088,"score_gpt":0.3332550051339457,"score_spread":0.3136163747862756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963698001","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.83906895,0.0012519903,0.120661,0.001101152,0.0000929437,0.000047869693,0.00043591112,0.00030802906,0.037032116],"genre_scores_gemma":[0.9836347,0.0002541482,0.01366655,0.00012242697,0.0000987603,0.00006142972,0.0002715586,0.000020598563,0.0018698397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978225,0.0003622249,0.00012320123,0.0007095808,0.00061729277,0.00036513884],"domain_scores_gemma":[0.99159765,0.004947891,0.0010560584,0.0010997962,0.00060306804,0.0006954144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016076487,0.0004991219,0.00064150564,0.0024676202,0.0019574156,0.001985355,0.0011160111,0.0010428518,0.004459808],"category_scores_gemma":[0.006127257,0.00037330226,0.0005783463,0.0016193743,0.0032184264,0.006229175,0.002980242,0.001969402,0.00028003685],"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.00009907303,0.000049645172,0.0029709768,0.00008043358,0.00001982897,0.00015973444,0.0002999108,0.0027487592,0.0045475173,0.97793764,0.0008980724,0.010188355],"study_design_scores_gemma":[0.000020268511,0.000042497613,0.0012947376,0.00002502295,0.00001942273,0.0002909743,0.000116975425,0.01693907,0.0043242006,0.9737492,0.0031632967,0.0000143428],"about_ca_topic_score_codex":0.00050113414,"about_ca_topic_score_gemma":0.0006332105,"teacher_disagreement_score":0.004459808,"about_ca_system_score_codex":0.0011726024,"about_ca_system_score_gemma":0.0004372992,"threshold_uncertainty_score":0.014919519},"labels":[],"label_agreement":null},{"id":"W2963986177","doi":"10.55016/ojs/cdm.v6i1.62075","title":"Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Claw; Homogeneous; Combinatorics; Mathematics; Graph; Computer science; Biology","score_opus":0.01797061144220087,"score_gpt":0.2587732794256537,"score_spread":0.24080266798345284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963986177","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.7274151,0.0007403418,0.25281543,0.0013535634,0.000036729085,0.000077806,0.0005025006,0.00024105646,0.016817488],"genre_scores_gemma":[0.92137015,0.00034628384,0.069484085,0.00021242042,0.000058353537,0.00006898544,0.001010256,0.00007594379,0.0073735616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994357,0.00014196419,0.000036873997,0.00017795722,0.00011662119,0.00009090526],"domain_scores_gemma":[0.9985655,0.0007621956,0.00018068477,0.00023958791,0.00010307447,0.00014892947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214929,0.00041865397,0.0004195983,0.0010349271,0.000897365,0.0012845632,0.0010131892,0.0011584907,0.0031243064],"category_scores_gemma":[0.0021153027,0.0003452797,0.0006062184,0.0011381307,0.0019416701,0.0035722007,0.001408187,0.0013450377,0.00030044044],"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.00020873269,0.00010600719,0.00224552,0.00013402662,0.000028887927,0.0006293156,0.00093493355,0.020925164,0.012317214,0.92035514,0.0025078277,0.039607335],"study_design_scores_gemma":[0.00003164801,0.00010446739,0.0015136932,0.000037037382,0.000035119032,0.0010739529,0.00070575974,0.08221317,0.011485537,0.8936356,0.009128412,0.000035685756],"about_ca_topic_score_codex":0.0013021029,"about_ca_topic_score_gemma":0.0009801302,"teacher_disagreement_score":0.0031243064,"about_ca_system_score_codex":0.0007105847,"about_ca_system_score_gemma":0.00037766094,"threshold_uncertainty_score":0.010451794},"labels":[],"label_agreement":null},{"id":"W2977736301","doi":"10.55016/ojs/cdm.v19i3.69171","title":"Lifting Properties for A-Homotopy Theory","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Homotopy; Mathematics; Homotopy analysis method; Computer science; Pure mathematics","score_opus":0.03620231459925545,"score_gpt":0.34655100236155506,"score_spread":0.3103486877622996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977736301","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.3690849,0.00079077657,0.5212873,0.0013633923,0.00048099062,0.0001685564,0.00035800991,0.0005166451,0.10594949],"genre_scores_gemma":[0.88788146,0.0007117673,0.097863026,0.00037751097,0.0005824703,0.00013277106,0.00047564876,0.00018005756,0.011795295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934465,0.00009958909,0.000037711463,0.0001326511,0.000286197,0.000099195335],"domain_scores_gemma":[0.999033,0.0003428437,0.00010162975,0.00014950577,0.00020289974,0.00017014699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082868815,0.000526891,0.00033519193,0.002564642,0.0012905495,0.001371814,0.00063240563,0.0007953198,0.007990436],"category_scores_gemma":[0.0018603428,0.00021096894,0.0009867112,0.0008975001,0.0024601265,0.0041538463,0.003016334,0.002408386,0.0013557663],"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.00000751996,0.000023760893,0.0004141465,0.000024538394,0.0000041890576,0.00008046352,0.00022714952,0.0006237472,0.0017694769,0.9856192,0.0005991823,0.010606705],"study_design_scores_gemma":[0.0000054864813,0.000029250701,0.0004182813,0.00001325462,0.0000044156436,0.000103070735,0.000101411046,0.0059921234,0.0014248654,0.98790365,0.003993267,0.00001097212],"about_ca_topic_score_codex":0.000892662,"about_ca_topic_score_gemma":0.0003376778,"teacher_disagreement_score":0.007990436,"about_ca_system_score_codex":0.0007712635,"about_ca_system_score_gemma":0.0005146445,"threshold_uncertainty_score":0.026730716},"labels":[],"label_agreement":null},{"id":"W2980419801","doi":"10.55016/ojs/cdm.v15i2.69344","title":"Further generalizations of the parallelogram law","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Diagonal; Parallelogram; Combinatorics; Quadratic equation; Dimension (graph theory); Mathematical analysis; Geometry; Physics","score_opus":0.01288978099078789,"score_gpt":0.2897470439051441,"score_spread":0.2768572629143562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980419801","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.16391127,0.006026065,0.5225226,0.008273553,0.0027797397,0.00012500735,0.0007036374,0.00086494006,0.2947931],"genre_scores_gemma":[0.85175586,0.004095303,0.08500024,0.004543295,0.004808759,0.00022976291,0.0005199074,0.0005797586,0.048467044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855334,0.0002350021,0.00005332574,0.0004367228,0.0005594737,0.00016208812],"domain_scores_gemma":[0.9976319,0.00081814104,0.00030318834,0.0005305595,0.00049191905,0.00022429209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016029341,0.0006817137,0.00071824976,0.0020321442,0.001295114,0.0018217025,0.0011869667,0.0011063667,0.007877799],"category_scores_gemma":[0.007356899,0.00034690832,0.0011756954,0.0011863852,0.0030536707,0.0059219194,0.0026782472,0.0038157445,0.0011022488],"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.000013978436,0.000011891265,0.00027007208,0.000019639629,0.0000054953384,0.000085601925,0.000064122854,0.00079756987,0.00057363836,0.9885477,0.0023349966,0.007275397],"study_design_scores_gemma":[0.000010666856,0.00002592626,0.00061387033,0.00001562378,0.000005502076,0.00026691108,0.000050104543,0.0117216995,0.00042752593,0.97415847,0.012683622,0.000020135127],"about_ca_topic_score_codex":0.0015269178,"about_ca_topic_score_gemma":0.0010081318,"teacher_disagreement_score":0.007877799,"about_ca_system_score_codex":0.0010043312,"about_ca_system_score_gemma":0.0005827778,"threshold_uncertainty_score":0.026353836},"labels":[],"label_agreement":null},{"id":"W2990801125","doi":"10.55016/ojs/cdm.v16i3.70415","title":"The Tutte Polynomial of Complex Reflection Groups","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Tutte polynomial; Mathematics; Hyperplane; Graph","score_opus":0.03231126392902599,"score_gpt":0.3491339595641797,"score_spread":0.3168226956351537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990801125","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.53871506,0.0047963816,0.2529391,0.003361109,0.001164925,0.000045325603,0.00070870674,0.0005559137,0.19771338],"genre_scores_gemma":[0.9599213,0.001932378,0.016184157,0.00026451444,0.00058805716,0.000027498032,0.00032499334,0.00018183053,0.020575192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957436,0.00007873285,0.000011335114,0.00006457109,0.0001467842,0.00012417581],"domain_scores_gemma":[0.9993492,0.00023723594,0.00007488362,0.00010951005,0.00015572757,0.00007338875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004165304,0.00047146075,0.00037258316,0.0015518987,0.0009960723,0.0024652916,0.00044738752,0.0005108066,0.00613973],"category_scores_gemma":[0.0032629936,0.00022876651,0.00054509187,0.0013440537,0.0022393824,0.0037863264,0.0011549362,0.001849563,0.0013453965],"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.000021804131,0.000005842118,0.00033228847,0.00002403524,0.0000036940912,0.00003327283,0.00016545912,0.002594221,0.00056393957,0.9856527,0.0020436628,0.008559092],"study_design_scores_gemma":[0.000008953551,0.000030611784,0.0007489507,0.000041357394,0.000008924958,0.00014480912,0.00015860032,0.02022953,0.001809743,0.9539943,0.022791186,0.000033132867],"about_ca_topic_score_codex":0.0026699593,"about_ca_topic_score_gemma":0.0017962799,"teacher_disagreement_score":0.00613973,"about_ca_system_score_codex":0.0012200292,"about_ca_system_score_gemma":0.0005810072,"threshold_uncertainty_score":0.020539403},"labels":[],"label_agreement":null},{"id":"W2991942175","doi":"10.55016/ojs/cdm.v15i2.68115","title":"On irreversible spread of influence in edge-weighted graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Undirected graph; Weighted network; Combinatorics; Graph; Process (computing); Graph theory; Topology (electrical circuits); Computer science; Discrete mathematics; Complex network; Artificial intelligence","score_opus":0.01114365547724431,"score_gpt":0.28134584542862057,"score_spread":0.27020218995137624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991942175","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.20417443,0.0014861353,0.74641156,0.0013009561,0.00007269233,0.000072692055,0.00017832457,0.00020438872,0.046098914],"genre_scores_gemma":[0.9580886,0.0018084198,0.03158492,0.00022465737,0.00020550568,0.00012998165,0.00013725867,0.00008945965,0.0077311606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906343,0.0002982069,0.000043957545,0.00018368085,0.00025311697,0.00015761136],"domain_scores_gemma":[0.993743,0.0045101815,0.0006031526,0.00036537068,0.00040231543,0.00037607359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014912098,0.0008006213,0.00080635067,0.0026853315,0.0011052185,0.0019094815,0.0018060369,0.0013626446,0.0042870496],"category_scores_gemma":[0.008987692,0.0004295369,0.0009436601,0.001633295,0.0035428384,0.0050250604,0.0016932293,0.0021708782,0.00036465176],"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.000027292925,0.000019087614,0.00029797605,0.00006700508,0.00002270583,0.00012650415,0.0001435707,0.052738246,0.0012649847,0.93972087,0.0004841301,0.0050877086],"study_design_scores_gemma":[0.000011281946,0.000020002792,0.00034710433,0.00001980723,0.000015374131,0.00008645258,0.000049507475,0.22180206,0.0005284745,0.7759929,0.0011103421,0.000016723097],"about_ca_topic_score_codex":0.0013754383,"about_ca_topic_score_gemma":0.0011059858,"teacher_disagreement_score":0.0042870496,"about_ca_system_score_codex":0.0016278636,"about_ca_system_score_gemma":0.00043046637,"threshold_uncertainty_score":0.014341652},"labels":[],"label_agreement":null},{"id":"W3016867789","doi":"10.55016/ojs/cdm.v17i2.70232","title":"Designs for graphs with six vertices and ten edges - II","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Artificial intelligence","score_opus":0.01315523726742908,"score_gpt":0.23704203511170552,"score_spread":0.22388679784427643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016867789","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.33309662,0.000635258,0.6356332,0.00053225824,0.000119457145,0.00015538943,0.00028777382,0.0004928521,0.029047243],"genre_scores_gemma":[0.838229,0.00018699444,0.15780815,0.00011850721,0.000016649445,0.00009802131,0.00018596565,0.000048557213,0.0033081137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989202,0.00039347608,0.00007040154,0.0002451911,0.00022474972,0.00014610677],"domain_scores_gemma":[0.9980921,0.0010530794,0.00023212885,0.00035977617,0.00019223704,0.00007066336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011720659,0.0005785592,0.0003795559,0.00067233137,0.00063906255,0.0009546002,0.0005613931,0.0009408896,0.0039271447],"category_scores_gemma":[0.0033187352,0.0003035065,0.0006192803,0.00041489673,0.0007022912,0.0010754752,0.0006123591,0.0006392871,0.00056959834],"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.00090564974,0.000247292,0.0053439583,0.000702435,0.00013203385,0.0005550992,0.00044719264,0.26835987,0.07417136,0.408623,0.004435264,0.23607674],"study_design_scores_gemma":[0.00031319063,0.00087386306,0.0022579615,0.00020968713,0.00011147131,0.00079955143,0.0004846149,0.41357437,0.06866713,0.4880306,0.02458373,0.00009385125],"about_ca_topic_score_codex":0.0007740094,"about_ca_topic_score_gemma":0.0013475298,"teacher_disagreement_score":0.0039271447,"about_ca_system_score_codex":0.00079438515,"about_ca_system_score_gemma":0.00075670355,"threshold_uncertainty_score":0.013137579},"labels":[],"label_agreement":null},{"id":"W3023069363","doi":"10.55016/ojs/cdm.v19i3.75096","title":"note on total co-independent domination in trees","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Junta de Andalucía","keywords":"Mathematics; Combinatorics","score_opus":0.015496870354148162,"score_gpt":0.3529796377747737,"score_spread":0.33748276742062555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023069363","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.2903432,0.01581081,0.5399784,0.0070781154,0.00071010937,0.0001593164,0.0012043983,0.00047608334,0.1442396],"genre_scores_gemma":[0.93747216,0.0063966997,0.04340462,0.0012511171,0.0010772988,0.00017535391,0.0005805708,0.00016963125,0.009472539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813324,0.00040471603,0.00007138248,0.00040333124,0.0005816035,0.00040576723],"domain_scores_gemma":[0.9831513,0.013057371,0.0008576027,0.0009348366,0.0011779808,0.00082092057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019730558,0.00068135775,0.001008987,0.0022194542,0.0020966837,0.0021369867,0.0012339401,0.0008373971,0.002994823],"category_scores_gemma":[0.01036419,0.00042381018,0.00087633566,0.0036441132,0.0025184338,0.0035441704,0.0024527572,0.0026341432,0.00042083068],"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.00025010193,0.000081118815,0.005266866,0.0003616129,0.000114037495,0.0005094023,0.000827327,0.05803076,0.0073263743,0.87900954,0.013164748,0.035058137],"study_design_scores_gemma":[0.000046820944,0.00014397595,0.003694838,0.00012775675,0.00011310139,0.0016032627,0.00028002117,0.1592033,0.0038015184,0.7951822,0.035743635,0.00005956212],"about_ca_topic_score_codex":0.0029290942,"about_ca_topic_score_gemma":0.0029281098,"teacher_disagreement_score":0.002994823,"about_ca_system_score_codex":0.002094579,"about_ca_system_score_gemma":0.00076454005,"threshold_uncertainty_score":0.015197337},"labels":[],"label_agreement":null},{"id":"W3028574858","doi":"10.55016/ojs/cdm.v5i2.61924","title":"Strictly chained (p,q)-ary partitions","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.02391838388147406,"score_gpt":0.3561073157416324,"score_spread":0.33218893186015835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028574858","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.83063734,0.00042280662,0.116541296,0.00042661998,0.0001483206,0.000086519176,0.00035803963,0.0001437596,0.051235214],"genre_scores_gemma":[0.9727192,0.00024706122,0.013942403,0.000104458275,0.000084383406,0.000071562965,0.0002917499,0.000042516513,0.012496614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931943,0.00011221513,0.0000518305,0.00013384565,0.00016608917,0.00021666905],"domain_scores_gemma":[0.9979335,0.00091596955,0.000292317,0.00039265637,0.00021147211,0.00025402562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090620003,0.0004698882,0.00056877616,0.0009523397,0.001268138,0.0024889319,0.00090478075,0.0010623842,0.008215139],"category_scores_gemma":[0.004676288,0.00033116178,0.0004547386,0.0009874292,0.0026323285,0.003301062,0.0019905914,0.00147973,0.00083612977],"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.00016437093,0.00002443701,0.000785978,0.0000548011,0.0000075069806,0.00031938707,0.00030148256,0.005405235,0.0057073296,0.9820338,0.0005506356,0.004645078],"study_design_scores_gemma":[0.000056750043,0.000093278926,0.000995839,0.00005602858,0.000018714838,0.00039073877,0.00028275454,0.032633066,0.007987431,0.9536076,0.0038405817,0.00003709233],"about_ca_topic_score_codex":0.00054320734,"about_ca_topic_score_gemma":0.0006958367,"teacher_disagreement_score":0.008215139,"about_ca_system_score_codex":0.0009563541,"about_ca_system_score_gemma":0.00047535473,"threshold_uncertainty_score":0.02748233},"labels":[],"label_agreement":null},{"id":"W3035268094","doi":"10.55016/ojs/cdm.v18i1.71282","title":"Confining the robber on cographs","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Sociology; Computer science","score_opus":0.027986143969503535,"score_gpt":0.34651970039259955,"score_spread":0.318533556423096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035268094","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.68297595,0.00029094703,0.2917491,0.0009994736,0.000055178723,0.0002512034,0.00031977662,0.0006797259,0.02267854],"genre_scores_gemma":[0.91920847,0.00018789046,0.07040036,0.00029916197,0.00003151196,0.00031430807,0.0003670054,0.00016106166,0.009030228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727696,0.0007011845,0.00016133643,0.00064628007,0.00039906614,0.00081520004],"domain_scores_gemma":[0.9902006,0.004786073,0.0014028647,0.001611859,0.0005254094,0.0014732085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001502948,0.0011366501,0.0013974899,0.0009558903,0.0023994048,0.0020994563,0.0020055596,0.0013571137,0.008785393],"category_scores_gemma":[0.0098488005,0.00076080183,0.0010873284,0.00092625595,0.0046092463,0.007217161,0.0035642802,0.00169187,0.00064960535],"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.0007436057,0.0003075577,0.0037194437,0.00058594276,0.000095218114,0.00074763934,0.002952188,0.06367261,0.018638335,0.8566621,0.0045757093,0.047299746],"study_design_scores_gemma":[0.00012539336,0.0005736972,0.0039052651,0.0001500968,0.00009493139,0.0009147219,0.0021646244,0.21502075,0.016941348,0.7398062,0.020158175,0.00014491055],"about_ca_topic_score_codex":0.003855834,"about_ca_topic_score_gemma":0.0049949917,"teacher_disagreement_score":0.008785393,"about_ca_system_score_codex":0.0020027328,"about_ca_system_score_gemma":0.0011843956,"threshold_uncertainty_score":0.029390097},"labels":[],"label_agreement":null},{"id":"W3048753990","doi":"10.55016/ojs/cdm.v18i1.71209","title":"The localization number and metric dimension of graphs of diameter 2","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Vancouver Island University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Dimension (graph theory); Metric (unit); Combinatorics; Upper and lower bounds; Chordal graph; Discrete mathematics; Metric space; Graph; 1-planar graph; Mathematical analysis","score_opus":0.011312506953026867,"score_gpt":0.2742144988106574,"score_spread":0.2629019918576305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048753990","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.8642395,0.002183477,0.094940625,0.0014137203,0.00010958651,0.000029379482,0.00052967767,0.00025372498,0.03630021],"genre_scores_gemma":[0.9864938,0.0007076386,0.009834333,0.0001328274,0.000089395864,0.000041014642,0.0002638116,0.00005734434,0.0023798577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994759,0.00011408973,0.000020833633,0.00016067579,0.00009484936,0.0001336889],"domain_scores_gemma":[0.9958664,0.0025471027,0.00059765996,0.00029451973,0.0002643827,0.00042992894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005297036,0.0006636717,0.0006211776,0.002567581,0.001030482,0.0016608412,0.0008400777,0.0007799181,0.003033983],"category_scores_gemma":[0.003827457,0.00042156182,0.00049057975,0.0012929185,0.0022872265,0.0035926534,0.0017000125,0.0011183791,0.00039283882],"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.00024660412,0.00006804164,0.0074751303,0.000259373,0.00006179649,0.0002935333,0.0007624407,0.02916735,0.016293066,0.91876876,0.0056993808,0.020904567],"study_design_scores_gemma":[0.00003186783,0.00012342686,0.007438464,0.0000721169,0.00004946157,0.00079742965,0.00047674344,0.1025276,0.012070699,0.8660065,0.010310025,0.00009566811],"about_ca_topic_score_codex":0.0006292237,"about_ca_topic_score_gemma":0.0006388093,"teacher_disagreement_score":0.003033983,"about_ca_system_score_codex":0.0010899438,"about_ca_system_score_gemma":0.00031734112,"threshold_uncertainty_score":0.010149717},"labels":[],"label_agreement":null},{"id":"W3088613651","doi":"10.55016/ojs/cdm.v16i1.71194","title":"A survey of graph burning","year":2021,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Conjecture; Combinatorics; Computer science; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.04110074314837459,"score_gpt":0.35548392388664524,"score_spread":0.31438318073827065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088613651","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016614996,0.6366781,0.15624285,0.020150263,0.004391997,0.00016182993,0.0016043105,0.0008494498,0.16330627],"genre_scores_gemma":[0.15771888,0.69762075,0.08544426,0.0087595405,0.0112121,0.0002775495,0.0036239955,0.0010154421,0.03432748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979513,0.00045614256,0.00010476107,0.00070643926,0.0006077764,0.0001735583],"domain_scores_gemma":[0.9940017,0.004308127,0.00021330285,0.0006460046,0.0005958279,0.00023510844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019587958,0.0013779149,0.0019118049,0.003936097,0.0020863584,0.0045888247,0.002787998,0.0027175003,0.012614017],"category_scores_gemma":[0.008666345,0.0012399364,0.0015761354,0.008021759,0.0033771726,0.012392775,0.0026693833,0.004744254,0.003962788],"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.00009099103,0.0001196188,0.0013947746,0.0032933122,0.00006455764,0.000121134486,0.00029853766,0.011894502,0.000707123,0.7137271,0.051969886,0.21631841],"study_design_scores_gemma":[0.00002096648,0.00006157057,0.0010075718,0.001195465,0.000041201885,0.0006188709,0.00018677866,0.0148530565,0.00062273926,0.6331493,0.34818828,0.00005418515],"about_ca_topic_score_codex":0.003719982,"about_ca_topic_score_gemma":0.0025658244,"teacher_disagreement_score":0.012614017,"about_ca_system_score_codex":0.0040331655,"about_ca_system_score_gemma":0.002214914,"threshold_uncertainty_score":0.042198062},"labels":[],"label_agreement":null},{"id":"W3089570406","doi":"10.55016/ojs/cdm.v20i2.74490","title":"Orthogonal colourings of tensor graphs","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.004453893162943379,"score_gpt":0.24175436573638104,"score_spread":0.23730047257343767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089570406","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.6594652,0.00042842366,0.2909748,0.0004828158,0.00018603593,0.00009304179,0.0005929765,0.00047274772,0.047304098],"genre_scores_gemma":[0.9446968,0.00031644444,0.045771725,0.0001332096,0.00007399312,0.000048493584,0.00050424534,0.000150152,0.008304879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984884,0.00035448294,0.000092471884,0.00037733722,0.00027377356,0.00041346657],"domain_scores_gemma":[0.995522,0.0014959725,0.0008178984,0.00095976127,0.0007074899,0.0004967712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092027243,0.0005726609,0.0005304837,0.0012458338,0.00132687,0.0019422726,0.00067425054,0.00064435677,0.0065776524],"category_scores_gemma":[0.0035599335,0.00046494664,0.0007304512,0.0011750573,0.0025699819,0.0039370353,0.0017466705,0.0009315774,0.00068339653],"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.00028678542,0.000042219435,0.0021288255,0.0001199564,0.000022608912,0.0002451628,0.00039149544,0.018768804,0.012362155,0.93967485,0.0024150833,0.023541987],"study_design_scores_gemma":[0.00002161605,0.0000986382,0.0012594031,0.000034319262,0.000028680643,0.00037151825,0.00036716735,0.06755187,0.008660867,0.91237706,0.009178978,0.000049909904],"about_ca_topic_score_codex":0.0021502317,"about_ca_topic_score_gemma":0.0026349102,"teacher_disagreement_score":0.0065776524,"about_ca_system_score_codex":0.001116746,"about_ca_system_score_gemma":0.00064926554,"threshold_uncertainty_score":0.022004426},"labels":[],"label_agreement":null},{"id":"W3099079581","doi":"10.55016/ojs/cdm.v16i3.71526","title":"Polytopal balls arising in optimization","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Dual polyhedron; Polytope; Mathematics; Combinatorics; Unit sphere; Ball (mathematics); Hypercube; Unit cube; Norm (philosophy); Geometry","score_opus":0.008618149046474167,"score_gpt":0.25580223212039116,"score_spread":0.24718408307391698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099079581","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.07078162,0.010713431,0.8313642,0.0022291527,0.0005511857,0.0000891216,0.0005940514,0.00021977305,0.083457425],"genre_scores_gemma":[0.7544392,0.011266169,0.19445752,0.00070623244,0.0014063163,0.0004549676,0.001278901,0.0004047476,0.035585895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988801,0.00041734226,0.000036314777,0.00017703789,0.00037677388,0.00011241338],"domain_scores_gemma":[0.99838674,0.00095943327,0.00015372885,0.00010254993,0.00023393215,0.00016358859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009904904,0.0012894075,0.0009773537,0.0016831252,0.0010669642,0.0025539438,0.00096071395,0.0012220256,0.005592889],"category_scores_gemma":[0.005460489,0.00055291015,0.0006909431,0.0016758611,0.0026668035,0.002887573,0.0019207451,0.0026958506,0.0008969897],"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.000033181506,0.000025003541,0.0002638216,0.00013034024,0.000016420994,0.000064280124,0.00010240878,0.026525917,0.000652748,0.9561112,0.0035824259,0.012492345],"study_design_scores_gemma":[0.000016166588,0.000046336412,0.00044216562,0.000072849594,0.000012065037,0.00017533218,0.00014463147,0.16860825,0.000553584,0.8124365,0.01747437,0.000017755761],"about_ca_topic_score_codex":0.0017451637,"about_ca_topic_score_gemma":0.001023275,"teacher_disagreement_score":0.005592889,"about_ca_system_score_codex":0.0011018489,"about_ca_system_score_gemma":0.0004093483,"threshold_uncertainty_score":0.018710077},"labels":[],"label_agreement":null},{"id":"W3100427284","doi":"","title":"Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Degree (music); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics; Graph; Mathematical optimization","score_opus":0.0222772638909818,"score_gpt":0.32917001272122837,"score_spread":0.3068927488302466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100427284","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.7707298,0.001128285,0.18385632,0.0011411157,0.00013836863,0.0000856178,0.0008793749,0.00045218854,0.04158889],"genre_scores_gemma":[0.97632295,0.0002942568,0.01734625,0.00033652296,0.000063236155,0.00008229054,0.00042687193,0.00011364861,0.005014065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.00014525285,0.00004100782,0.00022816271,0.00013243408,0.00024650988],"domain_scores_gemma":[0.99545383,0.0021429115,0.00048743893,0.00077934755,0.0004060802,0.0007303117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009406574,0.0006405822,0.0007197165,0.0010294949,0.0013739426,0.002002461,0.0016822338,0.0010020225,0.008602639],"category_scores_gemma":[0.008146842,0.0007477012,0.0008002289,0.00088670553,0.0018592727,0.0042909537,0.0031888948,0.002182243,0.0007473998],"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.0005278997,0.00008777,0.006043233,0.00045478783,0.00008145129,0.00074037275,0.00076312653,0.039522376,0.01485566,0.91636,0.0049130693,0.015650203],"study_design_scores_gemma":[0.00007097788,0.00009643891,0.0023237923,0.00007141045,0.00005067247,0.000538975,0.0004388977,0.11509134,0.008524189,0.8678184,0.004929333,0.00004557164],"about_ca_topic_score_codex":0.0012642189,"about_ca_topic_score_gemma":0.0020302054,"teacher_disagreement_score":0.008602639,"about_ca_system_score_codex":0.00089401874,"about_ca_system_score_gemma":0.0004543118,"threshold_uncertainty_score":0.028778732},"labels":[],"label_agreement":null},{"id":"W3103428152","doi":"10.55016/ojs/cdm.v12i1.62551","title":"The conjugacy problem for automorphism groups of homogeneous digraphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjugacy class; Combinatorics; Automorphism; Homogeneous; Automorphism group; Conjugacy problem; Outer automorphism group; Discrete mathematics","score_opus":0.047924952731339794,"score_gpt":0.3849457489432524,"score_spread":0.3370207962119126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103428152","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.9188022,0.00034500056,0.060808957,0.0019882466,0.00004917064,0.000076476485,0.00036202138,0.000085534346,0.01748235],"genre_scores_gemma":[0.9895818,0.0002126097,0.006455034,0.000105678904,0.0001237443,0.00005278156,0.0004157475,0.000025971236,0.0030265562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980692,0.0004997132,0.00015501976,0.0005726662,0.00035969654,0.00034370014],"domain_scores_gemma":[0.9778765,0.018590555,0.0012104285,0.0009877736,0.00039571486,0.00093897345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018909277,0.0005086137,0.0011203575,0.0021249854,0.0026182788,0.0062180357,0.0011961386,0.0020686078,0.004725722],"category_scores_gemma":[0.012497129,0.0005822345,0.0014070148,0.0015294914,0.0046410817,0.0097735245,0.00300465,0.0032599834,0.0003362656],"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.00025359908,0.0001322903,0.008965669,0.00013928722,0.00006958701,0.0002878866,0.0012572181,0.008509405,0.0033290242,0.9628072,0.0012493362,0.012999476],"study_design_scores_gemma":[0.000033302153,0.00003714146,0.0015620654,0.000020222138,0.000026219304,0.00010780672,0.0003263327,0.018301146,0.0024075003,0.9760477,0.0011087303,0.000021886248],"about_ca_topic_score_codex":0.0014894649,"about_ca_topic_score_gemma":0.0013468817,"teacher_disagreement_score":0.0062180357,"about_ca_system_score_codex":0.0034944124,"about_ca_system_score_gemma":0.00088979345,"threshold_uncertainty_score":0.025353849},"labels":[],"label_agreement":null},{"id":"W3114956369","doi":"10.55016/ojs/cdm.v16i3.72075","title":"On the real roots of domination polynomials","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Closure (psychology); Cardinality (data modeling); Graph; Domination analysis; Order (exchange); Discrete mathematics","score_opus":0.019161338421442364,"score_gpt":0.3299928174266208,"score_spread":0.31083147900517843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114956369","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.6140949,0.005127188,0.29038864,0.0035734964,0.00037763355,0.00006973779,0.00069761404,0.00026762168,0.08540315],"genre_scores_gemma":[0.9722725,0.0019368472,0.0154537875,0.00021257147,0.0006066604,0.000052799456,0.000286017,0.000087699875,0.0090911845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998725,0.00025338525,0.000043467997,0.00033818663,0.00032719082,0.00031279773],"domain_scores_gemma":[0.9918508,0.0056960885,0.0008361301,0.00038425613,0.00063294603,0.0005997258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015351701,0.00070326874,0.0010354937,0.002343489,0.0011518202,0.0026489154,0.0008594139,0.00051494926,0.0033568174],"category_scores_gemma":[0.010920627,0.00033842164,0.0006616338,0.0016388694,0.0051377146,0.005245926,0.0028264204,0.00377699,0.0006404714],"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.00012878046,0.000038189755,0.0006158391,0.00008897151,0.000011226514,0.00017847522,0.0005226087,0.004318273,0.0020286131,0.9772915,0.0011583021,0.013619192],"study_design_scores_gemma":[0.000036644225,0.000044752738,0.0005429577,0.00003156526,0.000009741529,0.0002496057,0.000184204,0.01921771,0.0008055635,0.97426695,0.004582348,0.00002804521],"about_ca_topic_score_codex":0.0017652829,"about_ca_topic_score_gemma":0.0008809209,"teacher_disagreement_score":0.0033568174,"about_ca_system_score_codex":0.0016625719,"about_ca_system_score_gemma":0.0007256178,"threshold_uncertainty_score":0.012062848},"labels":[],"label_agreement":null},{"id":"W3115384833","doi":"10.55016/ojs/cdm.v15i1.62630","title":"Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Upper and lower bounds; Domination analysis; Type (biology); Discrete mathematics","score_opus":0.0494903473845529,"score_gpt":0.33917181318300416,"score_spread":0.2896814657984513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115384833","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.27354178,0.011090509,0.6283466,0.003125662,0.000554309,0.0002160585,0.0013297119,0.00028536617,0.08150991],"genre_scores_gemma":[0.880851,0.004089982,0.10110839,0.0006943165,0.00075231335,0.0004565958,0.0005575203,0.000121010424,0.011368843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716777,0.0008878187,0.00017782707,0.00054284313,0.00078770623,0.00043598167],"domain_scores_gemma":[0.97574234,0.01944464,0.001719403,0.0010356281,0.0009553232,0.001102678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004727604,0.0018128209,0.002115636,0.0061014644,0.0019589113,0.0035293,0.004398198,0.0023647938,0.006671165],"category_scores_gemma":[0.02576993,0.0014417671,0.001998537,0.005169187,0.0040859696,0.009984376,0.003644447,0.004689991,0.00072916516],"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.00019752543,0.00008682094,0.0028004905,0.00036035076,0.000105688436,0.00025940445,0.00050100946,0.068288825,0.0027575684,0.8990576,0.003913446,0.021671306],"study_design_scores_gemma":[0.000026381473,0.00007957851,0.0019558903,0.00013188548,0.00005562054,0.00032771914,0.00018959767,0.18839365,0.0017016972,0.80274904,0.004314706,0.000074171854],"about_ca_topic_score_codex":0.0019477895,"about_ca_topic_score_gemma":0.0027338397,"teacher_disagreement_score":0.006671165,"about_ca_system_score_codex":0.0029761586,"about_ca_system_score_gemma":0.00080938905,"threshold_uncertainty_score":0.025002241},"labels":[],"label_agreement":null},{"id":"W3118184077","doi":"10.11575/cdm.vi.62290","title":"A complete solution to the spectrum problem for graphs with six vertices and up to nine edges","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Cograph; 1-planar graph; Indifference graph; Chordal graph; Pathwidth; Metric dimension; Vertex (graph theory); Discrete mathematics; Neighbourhood (mathematics); Clique-sum; Graph; Line graph","score_opus":0.02038946915703298,"score_gpt":0.2462494282127911,"score_spread":0.22585995905575812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118184077","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.05591194,0.00045420628,0.88849217,0.0021269375,0.00028735847,0.00023249749,0.00077271415,0.00045504846,0.051267073],"genre_scores_gemma":[0.23958687,0.0008658928,0.7269945,0.00079775025,0.0002528054,0.0004116532,0.0016713942,0.0003802237,0.029038796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887437,0.0003032601,0.000060827584,0.00026849835,0.0003434031,0.0001495546],"domain_scores_gemma":[0.99849343,0.00081527955,0.00010399315,0.00027810244,0.00020318525,0.00010590699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008320608,0.001090176,0.0008579137,0.00075411453,0.0013623727,0.0012844433,0.0010752232,0.0019123927,0.016962323],"category_scores_gemma":[0.0039065024,0.0005946128,0.0014454989,0.00082896376,0.0013079634,0.0026397489,0.0018691177,0.002445603,0.0031506738],"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.00019842605,0.0002407948,0.0007503913,0.00079545315,0.00007775843,0.00040940483,0.00052731053,0.05913064,0.011289482,0.71403766,0.032859482,0.17968318],"study_design_scores_gemma":[0.00009721828,0.00012526006,0.00024851403,0.00009946142,0.000032991953,0.0003988356,0.00030253772,0.06012053,0.003698897,0.9022378,0.032605372,0.000032553708],"about_ca_topic_score_codex":0.000965922,"about_ca_topic_score_gemma":0.0013260323,"teacher_disagreement_score":0.016962323,"about_ca_system_score_codex":0.0007832182,"about_ca_system_score_gemma":0.001698585,"threshold_uncertainty_score":0.056744635},"labels":[],"label_agreement":null},{"id":"W3118723405","doi":"10.11575/cdm.v15i1.62606","title":"Pell Coding and Pell Decoding Methods with Some Applications","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Coding (social sciences); Coding theory; Mathematics; Combinatorics; Algorithm; Arithmetic; Computer science; Discrete mathematics; Statistics","score_opus":0.011925442076098415,"score_gpt":0.3222616855712542,"score_spread":0.31033624349515576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118723405","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.0071264436,0.0010674613,0.9667418,0.00062520924,0.00022317814,0.000043875276,0.00009411931,0.00033019172,0.023747705],"genre_scores_gemma":[0.19095734,0.004023906,0.7702862,0.0007838641,0.00063621433,0.00028360137,0.0002959182,0.00070392224,0.032028954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992654,0.00027307542,0.000044130426,0.00010439303,0.00022950867,0.00008347891],"domain_scores_gemma":[0.999005,0.0004391511,0.00008098578,0.00015596059,0.00026515598,0.000053650583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009137875,0.001234692,0.0006099426,0.0013176842,0.0008165545,0.0012643003,0.0008979976,0.0012280482,0.005906817],"category_scores_gemma":[0.0039417953,0.00038762073,0.000951823,0.0014499527,0.00261266,0.0026255383,0.001626463,0.002370599,0.0025680314],"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.00001861294,0.000007892106,0.0001006709,0.00005101106,0.00000576536,0.0000381963,0.00008377761,0.009549745,0.0016473231,0.9569859,0.001979059,0.029532056],"study_design_scores_gemma":[0.000015128312,0.000037439073,0.000073795374,0.00003550855,0.000011742142,0.00017609207,0.0000336665,0.103655234,0.005776784,0.86682314,0.023311177,0.000050334827],"about_ca_topic_score_codex":0.0015418291,"about_ca_topic_score_gemma":0.0008914877,"teacher_disagreement_score":0.005906817,"about_ca_system_score_codex":0.0010627127,"about_ca_system_score_gemma":0.0010508858,"threshold_uncertainty_score":0.01976031},"labels":[],"label_agreement":null},{"id":"W3119622264","doi":"10.55016/ojs/cdm.v15i1.62679","title":"Total colouring of some cartesian and direct product graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Combinatorics; Mathematics; Bipartite graph; Chromatic scale; Graph; Direct product; Windmill graph; Discrete mathematics; Graph power; Line graph","score_opus":0.01224504562014082,"score_gpt":0.24493825443889572,"score_spread":0.2326932088187549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119622264","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.8363503,0.00041296042,0.11257188,0.0003694335,0.00004825407,0.000042957534,0.00063330465,0.00020805906,0.04936282],"genre_scores_gemma":[0.93787134,0.00029112844,0.047357377,0.0000799237,0.00003048291,0.000046544847,0.0007683941,0.000070691814,0.013484058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953794,0.00010193705,0.000024373136,0.00017154115,0.00008905856,0.00007520891],"domain_scores_gemma":[0.99861,0.0005963458,0.00018557541,0.00019090447,0.00022277396,0.00019434473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043630463,0.00031876078,0.00027783884,0.0007975211,0.0008040323,0.001203317,0.00041135508,0.00030214322,0.0033088983],"category_scores_gemma":[0.001411781,0.0003438793,0.0003997419,0.0008106348,0.0016584845,0.0012511058,0.000924231,0.0005745041,0.000253166],"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.0002797449,0.000052390453,0.0030509492,0.00017145206,0.000028432249,0.00031149996,0.0008981749,0.015581959,0.011278489,0.942479,0.0033543704,0.022513513],"study_design_scores_gemma":[0.000068796166,0.00014616048,0.00485054,0.000036484093,0.000057448848,0.0010601855,0.0004927874,0.062580325,0.008446787,0.9017321,0.020479904,0.000048348975],"about_ca_topic_score_codex":0.0023969896,"about_ca_topic_score_gemma":0.0027724192,"teacher_disagreement_score":0.0033088983,"about_ca_system_score_codex":0.000847796,"about_ca_system_score_gemma":0.00046983716,"threshold_uncertainty_score":0.011069357},"labels":[],"label_agreement":null},{"id":"W3123301734","doi":"10.55016/ojs/cdm.v15i3.62663","title":"Two properties of maximal antichains in strict chain product posets","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partially ordered set; Bijection; Combinatorics; Mathematics; Product (mathematics); Chain (unit); Discrete mathematics; Physics","score_opus":0.05162957173494855,"score_gpt":0.331628948203587,"score_spread":0.2799993764686385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123301734","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.4713168,0.0014635271,0.3781008,0.0012574884,0.00034800937,0.00024124017,0.0019543986,0.00086134917,0.14445633],"genre_scores_gemma":[0.92607504,0.0004805185,0.059239488,0.00027534107,0.00023156079,0.0002026029,0.0014730758,0.00023442355,0.0117879845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984503,0.00025697218,0.00014097252,0.00049157575,0.00037578295,0.0002844987],"domain_scores_gemma":[0.99560803,0.001988561,0.0005416984,0.00045419415,0.00071191945,0.0006956484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011050223,0.00056704995,0.0005312782,0.0013435244,0.0027729466,0.0027964434,0.0008285369,0.0006944087,0.012021749],"category_scores_gemma":[0.0031918623,0.000694644,0.0009498363,0.0016464541,0.0035592318,0.00757732,0.002128113,0.0019361473,0.00084794825],"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.0001283912,0.00009828129,0.0021290993,0.00015393285,0.000016010688,0.0004282785,0.001150534,0.0012144201,0.0073761498,0.9700484,0.0016880808,0.015568328],"study_design_scores_gemma":[0.00003962026,0.00015947029,0.0026696357,0.0000760343,0.000034551733,0.0011491255,0.00085155404,0.007220493,0.012385012,0.95424265,0.021122498,0.000049336668],"about_ca_topic_score_codex":0.0013109023,"about_ca_topic_score_gemma":0.0025442687,"teacher_disagreement_score":0.012021749,"about_ca_system_score_codex":0.0009108915,"about_ca_system_score_gemma":0.00088627764,"threshold_uncertainty_score":0.040216744},"labels":[],"label_agreement":null},{"id":"W3125851689","doi":"10.55016/ojs/cdm.v18i1.72779","title":"Beck-type companion identities for Franklin's identity","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Identity (music); Mathematics; Combinatorics; Type (biology); Conjecture; Euler's formula; Element (criminal law); Order (exchange); Discrete mathematics; Pure mathematics; Law; Mathematical analysis; Philosophy","score_opus":0.06141344593056062,"score_gpt":0.4058369316031631,"score_spread":0.34442348567260245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125851689","genre_codex":"other","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.2867552,0.0020985908,0.3477124,0.007068685,0.0017030617,0.0001935408,0.00067729707,0.0005274332,0.3532638],"genre_scores_gemma":[0.90644693,0.0008684487,0.048083145,0.0015952154,0.0007654855,0.00017140486,0.0003376963,0.00011764238,0.041614003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817514,0.0003657098,0.00012309887,0.00041532298,0.0006202749,0.00030040342],"domain_scores_gemma":[0.99730057,0.0011577159,0.00024298283,0.0004310935,0.0005381276,0.00032961028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020709697,0.00048405598,0.00091492874,0.0016416619,0.0029177926,0.0024354903,0.0006991013,0.0013449052,0.010897263],"category_scores_gemma":[0.008650284,0.00038415106,0.0009697736,0.0012768796,0.003812407,0.0065551884,0.0038011055,0.002714193,0.0019611835],"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.00001540783,0.00000865852,0.00026762031,0.00001087898,0.0000015590293,0.00002546944,0.00016822743,0.00012533642,0.00018277239,0.99480504,0.0010842914,0.0033047064],"study_design_scores_gemma":[0.000010827844,0.000022625714,0.0003750656,0.000010175601,0.0000049254304,0.00014025942,0.00008030222,0.0019347754,0.00049483037,0.9871977,0.009716237,0.000012231082],"about_ca_topic_score_codex":0.0009437716,"about_ca_topic_score_gemma":0.00078350975,"teacher_disagreement_score":0.010897263,"about_ca_system_score_codex":0.0015425326,"about_ca_system_score_gemma":0.0011842963,"threshold_uncertainty_score":0.036454916},"labels":[],"label_agreement":null},{"id":"W3134287918","doi":"10.55016/ojs/cdm.v17i2.72263","title":"Coverings with congruent and non-congruent hyperballs generated by doubly truncated Coxeter orthoschemes","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coxeter group; Combinatorics; Mathematics; Upper and lower bounds; Space (punctuation); Simplex; Hyperbolic space; Tetrahedron; Complement (music); Geometry; Mathematical analysis","score_opus":0.005797694538495067,"score_gpt":0.2437620962796846,"score_spread":0.23796440174118952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134287918","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.9723327,0.000121391895,0.022091914,0.000047660767,0.000018502156,0.000015046192,0.00006924259,0.000025917927,0.0052775545],"genre_scores_gemma":[0.98570883,0.0001617036,0.010867922,0.000018131781,0.000026640048,0.00003084914,0.00028121012,0.000023595898,0.0028810115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968505,0.000053946027,0.00002490972,0.000072112496,0.0000876889,0.000076269695],"domain_scores_gemma":[0.99942064,0.00020642557,0.0001260495,0.00009157825,0.0000447139,0.000110655936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023569426,0.00028331176,0.00036229138,0.0008015705,0.0007059449,0.001132117,0.00039911797,0.00034130074,0.0036708277],"category_scores_gemma":[0.0014405333,0.0003004582,0.0004974854,0.00047557135,0.0011388178,0.0010226795,0.0011423407,0.0004702962,0.00027737618],"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.00088693557,0.0001576608,0.023438845,0.00028879684,0.00011805951,0.002016252,0.0016156102,0.05834759,0.059982926,0.79313755,0.0022452015,0.057764716],"study_design_scores_gemma":[0.00014876343,0.00042691227,0.027902745,0.00009553247,0.00009922747,0.003282021,0.0021097977,0.31713578,0.039797597,0.5966037,0.012313379,0.00008454447],"about_ca_topic_score_codex":0.0007061246,"about_ca_topic_score_gemma":0.0005936301,"teacher_disagreement_score":0.0036708277,"about_ca_system_score_codex":0.00041286228,"about_ca_system_score_gemma":0.00017800598,"threshold_uncertainty_score":0.012280166},"labels":[],"label_agreement":null},{"id":"W3136082331","doi":"10.55016/ojs/cdm.v15i2.62672","title":"Equality Perfect Graphs and Digraphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Graph; Chromatic scale; Alice and Bob; Discrete mathematics; Alice (programming language); Computer science","score_opus":0.030712067699897636,"score_gpt":0.3319881593684025,"score_spread":0.30127609166850483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136082331","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.3364505,0.0034995233,0.42951182,0.0027075848,0.00043624543,0.00026073807,0.0021599166,0.00061733514,0.22435637],"genre_scores_gemma":[0.94184697,0.0012914505,0.034964062,0.0005935453,0.0001476763,0.0001469099,0.0009346741,0.000051255003,0.020023504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895155,0.0002727986,0.000054086682,0.00029529072,0.00021157421,0.0002146496],"domain_scores_gemma":[0.99821293,0.0009716902,0.00023350786,0.00017658468,0.0001633182,0.00024209205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006157415,0.0006482144,0.0005301249,0.0015117876,0.001520486,0.002311478,0.0007885893,0.00079318474,0.0070088417],"category_scores_gemma":[0.0031582278,0.000396336,0.00034969236,0.0018764033,0.0033029749,0.003288491,0.0017435811,0.001130716,0.0005322838],"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.000018909031,0.000011231912,0.00023732457,0.000036243848,0.000003884304,0.000044183427,0.00012053525,0.0019991854,0.00023216281,0.9902082,0.0010135035,0.006074756],"study_design_scores_gemma":[0.000018375165,0.00001624172,0.0004153239,0.000018928358,0.000008603795,0.000119181335,0.00009049388,0.0074589597,0.00026884399,0.9804863,0.011087226,0.000011533964],"about_ca_topic_score_codex":0.0046341987,"about_ca_topic_score_gemma":0.005166616,"teacher_disagreement_score":0.0070088417,"about_ca_system_score_codex":0.0024897486,"about_ca_system_score_gemma":0.000799509,"threshold_uncertainty_score":0.023446918},"labels":[],"label_agreement":null},{"id":"W3137542213","doi":"10.11575/cdm.v15i2.68165","title":"Hyperball packings related to truncated cube and octahedron tilings in hyperbolic space","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coxeter group; Combinatorics; Mathematics; Hyperbolic space; Cube (algebra); Octahedron; Space (punctuation); Hypersphere; Voronoi diagram; Crystallography; Geometry; Crystal structure","score_opus":0.011037282932389036,"score_gpt":0.2798916512988554,"score_spread":0.26885436836646637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137542213","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.9619212,0.00018430571,0.0289851,0.000048024758,0.000029793948,0.000022943592,0.00010703061,0.00005633768,0.008645285],"genre_scores_gemma":[0.98521245,0.0001631709,0.011388342,0.000037093563,0.000018387354,0.000032633186,0.00028506757,0.00003238269,0.0028304358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999819,0.000024113975,0.000009946627,0.000049848186,0.000052836996,0.000044400975],"domain_scores_gemma":[0.99979526,0.000041089814,0.000051207957,0.000038393613,0.000023631588,0.000050415256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094194926,0.00025076754,0.00029179844,0.00046619793,0.00055606716,0.0007128205,0.00050288864,0.00030461213,0.0033173724],"category_scores_gemma":[0.000548093,0.00025127686,0.00028646545,0.0003742413,0.0009548322,0.00079079036,0.0007172074,0.0004217602,0.00029491776],"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.00077463593,0.000227287,0.018733315,0.0004444783,0.000115141775,0.0028955003,0.001051707,0.17726202,0.11356421,0.619243,0.0036162552,0.06207243],"study_design_scores_gemma":[0.00014889032,0.00046725752,0.020507492,0.0000685903,0.000054002154,0.0025325103,0.0013594027,0.62705296,0.048624463,0.29048866,0.008592103,0.000103727805],"about_ca_topic_score_codex":0.0016835122,"about_ca_topic_score_gemma":0.0012932996,"teacher_disagreement_score":0.0033173724,"about_ca_system_score_codex":0.00042448565,"about_ca_system_score_gemma":0.00025029414,"threshold_uncertainty_score":0.011097789},"labels":[],"label_agreement":null},{"id":"W3140032042","doi":"10.55016/ojs/cdm.v20i1.73743","title":"Saved by the rook: a case of matchings and Hamiltonian cycles","year":2025,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Cartesian product; Hamiltonian path; Graph; Vertex (graph theory); Mathematics; Complete graph; Hamiltonian (control theory); Complement graph; Discrete mathematics; Line graph; Graph power","score_opus":0.015544680755604775,"score_gpt":0.3371160409681031,"score_spread":0.3215713602124983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140032042","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.76390994,0.0013062838,0.13967904,0.0058736904,0.00016538244,0.00020020289,0.0006003284,0.00034997414,0.087915175],"genre_scores_gemma":[0.9590919,0.00040563953,0.030609984,0.00038450293,0.000078414625,0.00008318553,0.00019320234,0.00006401272,0.009089184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981292,0.000505298,0.00008877441,0.00049331936,0.00027050366,0.00051300525],"domain_scores_gemma":[0.996557,0.0017840412,0.00057321746,0.00042379825,0.0001489378,0.0005130297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011166682,0.00048779554,0.0008414981,0.0011355577,0.0023447245,0.0029002787,0.0015265063,0.004712544,0.0072984505],"category_scores_gemma":[0.009081866,0.00088028575,0.0008791911,0.0028402614,0.003759669,0.007324508,0.00239393,0.0017645916,0.0006529665],"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.00027279093,0.00014939229,0.0018712276,0.00013859723,0.00004453643,0.0040520197,0.0010636575,0.01841276,0.0014416904,0.9502712,0.004446686,0.017835408],"study_design_scores_gemma":[0.00013679142,0.00007336161,0.0006427462,0.000041239036,0.000042152948,0.002082141,0.0010954966,0.06660733,0.0011037197,0.91868436,0.009445464,0.000045219454],"about_ca_topic_score_codex":0.003167394,"about_ca_topic_score_gemma":0.003342864,"teacher_disagreement_score":0.0072984505,"about_ca_system_score_codex":0.001237368,"about_ca_system_score_gemma":0.0007716998,"threshold_uncertainty_score":0.024415731},"labels":[],"label_agreement":null},{"id":"W3140444966","doi":"10.55016/ojs/cdm.v3i2.61933","title":"LC reductions yield isomorphic simplicial complexes","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Yield (engineering); Combinatorics; Simplicial complex; Materials science","score_opus":0.03808600290545455,"score_gpt":0.2923542278538305,"score_spread":0.2542682249483759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140444966","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.90171045,0.0002991417,0.045842253,0.00040704382,0.00010557545,0.000054516833,0.0003551828,0.0005503774,0.05067547],"genre_scores_gemma":[0.97407454,0.0002068357,0.0142256655,0.00015407089,0.00004184602,0.00004923017,0.0007294363,0.00019620066,0.010322206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894017,0.00012629868,0.000061072715,0.00024833885,0.00036357075,0.00026060757],"domain_scores_gemma":[0.99874425,0.0003555963,0.000104098865,0.00045758093,0.00017473391,0.00016373473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000347759,0.00058178155,0.00042502276,0.0011871307,0.0015502202,0.0021761174,0.0010088288,0.0008294995,0.0074946457],"category_scores_gemma":[0.001972486,0.000508542,0.001120014,0.00057718856,0.0016999543,0.0020702789,0.003886189,0.0017678265,0.0011777579],"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.00023354893,0.00022733108,0.0038376134,0.0002087548,0.00009093516,0.00196814,0.002389275,0.007709093,0.04990678,0.8952758,0.0036493328,0.034503438],"study_design_scores_gemma":[0.000077683064,0.000093133924,0.0030408234,0.00004661693,0.0001284764,0.0019376421,0.0015875866,0.013374584,0.058075313,0.8885886,0.032981277,0.000068280955],"about_ca_topic_score_codex":0.0011012795,"about_ca_topic_score_gemma":0.0015639546,"teacher_disagreement_score":0.0074946457,"about_ca_system_score_codex":0.0010495436,"about_ca_system_score_gemma":0.00041115945,"threshold_uncertainty_score":0.025072157},"labels":[],"label_agreement":null},{"id":"W3156518500","doi":"10.55016/ojs/cdm.v16i1.67834","title":"Note on group distance magicness on product graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Bijection; Abelian group; Vertex (graph theory); MAGIC (telescope); Lexicographical order; Discrete mathematics; Graph; Physics","score_opus":0.012756938084583776,"score_gpt":0.2739200354274208,"score_spread":0.26116309734283705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156518500","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.57562464,0.00095432205,0.32292232,0.0019516158,0.00016481754,0.000072474744,0.00047903726,0.00045821964,0.09737256],"genre_scores_gemma":[0.94708794,0.00043186662,0.046049893,0.0002656771,0.00014161393,0.000063581305,0.0003034869,0.00006684419,0.0055890814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992137,0.00014945054,0.000047627163,0.0002543396,0.00021483844,0.00011993204],"domain_scores_gemma":[0.9974234,0.0015079131,0.0002374812,0.00037464185,0.00024627204,0.0002103393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057314197,0.00032459362,0.00042917227,0.0008840153,0.0012087771,0.0010029939,0.0006156614,0.00070354424,0.0056746765],"category_scores_gemma":[0.002350208,0.00035077636,0.000503606,0.0010168871,0.0027425273,0.0029089928,0.001656798,0.0017175374,0.0004729622],"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.0001228234,0.00003877081,0.0018371253,0.00009332726,0.00001353977,0.00024678741,0.0007753574,0.002672804,0.006581566,0.9690907,0.0015150945,0.017012183],"study_design_scores_gemma":[0.0000353343,0.0001321221,0.0013533975,0.000023238701,0.000036054542,0.000642918,0.00034162903,0.0112171015,0.0065528685,0.9674544,0.01218196,0.000028933391],"about_ca_topic_score_codex":0.0009320941,"about_ca_topic_score_gemma":0.001113322,"teacher_disagreement_score":0.0056746765,"about_ca_system_score_codex":0.00053904275,"about_ca_system_score_gemma":0.0003789425,"threshold_uncertainty_score":0.018983722},"labels":[],"label_agreement":null},{"id":"W3158320605","doi":"10.55016/ojs/cdm.v16i1.62636","title":"Equivalent classes of degree sequences for triangulated polyhedra and their convex realization","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyhedron; Mathematics; Combinatorics; Regular polygon; Degree (music); Equivalence (formal languages); Set (abstract data type); Convex polytope; Realization (probability); Dual polyhedron; Discrete mathematics; Convex set; Convex optimization; Geometry; Computer science","score_opus":0.04225962854213899,"score_gpt":0.3325056220029084,"score_spread":0.2902459934607694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158320605","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.5979759,0.0001979094,0.36164564,0.00027561557,0.00010232838,0.00012083222,0.0007390603,0.00026041965,0.038682375],"genre_scores_gemma":[0.9371044,0.00016676019,0.054974284,0.000059722166,0.00007340832,0.00013655866,0.00091340794,0.00011486241,0.0064565456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864,0.0001644903,0.00007653567,0.00028985724,0.0005129566,0.0003161759],"domain_scores_gemma":[0.99834144,0.00063808553,0.00019295022,0.00022463493,0.000271779,0.00033113422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006351755,0.00040630886,0.0006787676,0.0017171156,0.0015711496,0.0034722215,0.0010258304,0.00064783124,0.007480043],"category_scores_gemma":[0.0033499745,0.0004235687,0.0009354758,0.0011538541,0.0022854253,0.0037357253,0.0018386022,0.0021831505,0.00045276794],"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.000089081186,0.00006360258,0.001026387,0.00003973071,0.000007675013,0.00008033872,0.00028302977,0.009946239,0.0018306061,0.9721777,0.00064427813,0.013811415],"study_design_scores_gemma":[0.00003837452,0.000092686074,0.001415654,0.00004876747,0.000013262056,0.00018591258,0.00046257864,0.07282579,0.0041001877,0.91316336,0.007615574,0.00003787211],"about_ca_topic_score_codex":0.0020105096,"about_ca_topic_score_gemma":0.0022226993,"teacher_disagreement_score":0.007480043,"about_ca_system_score_codex":0.0016930704,"about_ca_system_score_gemma":0.00059144164,"threshold_uncertainty_score":0.025023282},"labels":[],"label_agreement":null},{"id":"W3159958616","doi":"10.55016/ojs/cdm.v20i2.75407","title":"Enumeration of parallelogram polycubes","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Direction Générale de la Recherche Scientifique et du Développement Technologique","keywords":"Parallelogram; Mathematics; Polyomino; Enumeration; Function (biology); Generating function; Dirichlet distribution; Pure mathematics; Combinatorics; Mathematical analysis; Applied mathematics; Geometry; Computer science; Regular polygon; Artificial intelligence","score_opus":0.017091246355771864,"score_gpt":0.36991035817255113,"score_spread":0.3528191118167793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159958616","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.51761824,0.0015940781,0.38945562,0.0006346501,0.00039836735,0.00015396193,0.0008816993,0.000561893,0.08870151],"genre_scores_gemma":[0.90932846,0.0012016437,0.067003734,0.00016553239,0.00027212017,0.00024165369,0.0013065381,0.00024464147,0.02023573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994025,0.00014753414,0.000037557445,0.00009388462,0.00020723269,0.00011137077],"domain_scores_gemma":[0.99911505,0.00032519162,0.000115819246,0.00012066391,0.00019976437,0.00012362225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004870723,0.00050752284,0.00057675684,0.001813098,0.0008189705,0.0017053166,0.0006589269,0.0004762645,0.006748591],"category_scores_gemma":[0.0024877812,0.000308878,0.00045966526,0.001298948,0.001164535,0.0023730067,0.0017013508,0.0008998553,0.0011419996],"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.00016303056,0.000050645256,0.0024862345,0.00017312758,0.000018603669,0.00038862313,0.00027763154,0.019180082,0.008495351,0.9128876,0.0037683768,0.05211081],"study_design_scores_gemma":[0.00002688691,0.000066408924,0.0014649812,0.00007393093,0.000014723891,0.000651509,0.00034455175,0.091836676,0.008975561,0.8776118,0.01889565,0.00003724326],"about_ca_topic_score_codex":0.00027742144,"about_ca_topic_score_gemma":0.00026363265,"teacher_disagreement_score":0.006748591,"about_ca_system_score_codex":0.00045667405,"about_ca_system_score_gemma":0.00030266045,"threshold_uncertainty_score":0.022576272},"labels":[],"label_agreement":null},{"id":"W3161412004","doi":"10.55016/ojs/cdm.v17i2.72886","title":"Heesch numbers of unmarked polyforms","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Compute Canada","keywords":"Simple (philosophy); Computation; Computer science; Solver; Algorithm; Mathematics; Theoretical computer science","score_opus":0.008354561850720256,"score_gpt":0.26144257709851504,"score_spread":0.2530880152477948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161412004","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.6825201,0.00035709466,0.24958849,0.00046870922,0.00014786658,0.00010619941,0.0019010986,0.0013006757,0.0636099],"genre_scores_gemma":[0.84832186,0.00019607136,0.13619013,0.00011054118,0.00004587705,0.00007146153,0.0019542424,0.00024737543,0.012862324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999308,0.00008165342,0.000052018422,0.00016230253,0.00025901536,0.0001370009],"domain_scores_gemma":[0.99793917,0.0010710572,0.00016185331,0.00040573752,0.00031923509,0.000102945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047845845,0.0005369208,0.0005221312,0.0013927255,0.0010439871,0.0021216716,0.0008395303,0.0005718049,0.015792074],"category_scores_gemma":[0.004204603,0.0003306507,0.000748409,0.0016433994,0.0023751254,0.004144106,0.0010470195,0.0012263814,0.0019753801],"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.00046227113,0.00013122856,0.0071590887,0.0003529272,0.000044013614,0.00034550586,0.0007099953,0.07926122,0.012410201,0.75227123,0.008237221,0.1386151],"study_design_scores_gemma":[0.000037980877,0.00011528823,0.0015475721,0.000043189902,0.000019057778,0.00018009734,0.00026227682,0.11184763,0.022664087,0.8498189,0.013408418,0.00005549656],"about_ca_topic_score_codex":0.0012697943,"about_ca_topic_score_gemma":0.0027081373,"teacher_disagreement_score":0.015792074,"about_ca_system_score_codex":0.0009778328,"about_ca_system_score_gemma":0.0007659526,"threshold_uncertainty_score":0.052829742},"labels":[],"label_agreement":null},{"id":"W3175217316","doi":"10.55016/ojs/cdm.v16i2.71725","title":"Completing graphs to metric spaces","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Deutsche Forschungsgemeinschaft; Grantová Agentura, Univerzita Karlova; Austrian Science Fund; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Mathematics; Perimeter; Combinatorics; Homogeneous; Extension (predicate logic); Automorphism; Property (philosophy); Metric space; Metric (unit); Discrete mathematics; Computer science; Geometry","score_opus":0.030580161571091034,"score_gpt":0.3587711210130111,"score_spread":0.32819095944192006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175217316","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.70371884,0.0013796294,0.15474238,0.0013073124,0.00025787338,0.0000692683,0.00032066886,0.00031277834,0.13789122],"genre_scores_gemma":[0.95843923,0.0008127363,0.02073414,0.0002007652,0.00021280981,0.00004949003,0.00028089475,0.00010440692,0.019165533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966645,0.00012013946,0.000012501746,0.000080002355,0.00006880382,0.00005208187],"domain_scores_gemma":[0.9988814,0.0004494507,0.00014783724,0.00021019446,0.00013871372,0.00017237505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037443527,0.00039959783,0.0003310734,0.0007732044,0.00067652337,0.0008185,0.00034702988,0.00031273178,0.0051205605],"category_scores_gemma":[0.0018029639,0.0001959624,0.0003615761,0.0006732342,0.001571297,0.0020505239,0.0017279595,0.0010957093,0.0004663466],"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.000009119686,0.000007390152,0.0001996294,0.000025408825,0.0000025011568,0.000058499878,0.00024518708,0.0013606577,0.00083670754,0.9913032,0.0008248205,0.005126731],"study_design_scores_gemma":[0.000010266518,0.000035317138,0.0007243472,0.000016038712,0.000006412552,0.0002132829,0.00026368888,0.0054377546,0.0007666678,0.96968377,0.022835344,0.000007048589],"about_ca_topic_score_codex":0.00058041466,"about_ca_topic_score_gemma":0.00064616604,"teacher_disagreement_score":0.0051205605,"about_ca_system_score_codex":0.0006187184,"about_ca_system_score_gemma":0.00019077296,"threshold_uncertainty_score":0.017129958},"labels":[],"label_agreement":null},{"id":"W3183587779","doi":"10.55016/ojs/cdm.v16i2.71729","title":"Reconstructing the topology on monoids and polymorphism clones of reducts of the rationals","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rational number; Monoid; Endomorphism; Mathematics; Combinatorics","score_opus":0.011116799403799933,"score_gpt":0.2674111510308947,"score_spread":0.25629435162709474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183587779","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.8017436,0.0006951132,0.17983577,0.0005607341,0.00007717501,0.00005522523,0.00021674756,0.00032767552,0.016488083],"genre_scores_gemma":[0.94846225,0.00063153874,0.040076796,0.00011869306,0.00011530388,0.00005464759,0.00035634876,0.00012642283,0.010057943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889153,0.00022425747,0.00008690627,0.000340282,0.00031783112,0.00013917533],"domain_scores_gemma":[0.9960289,0.0018169554,0.0005502311,0.00085424766,0.00039804194,0.00035167136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012271883,0.000447434,0.000708683,0.0016871144,0.0010053815,0.0029895667,0.00075003656,0.0006513027,0.0027943952],"category_scores_gemma":[0.004761017,0.0005292857,0.0012001432,0.0010407477,0.0027929698,0.005431704,0.00285508,0.002134759,0.00039242933],"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.00011834532,0.000029499357,0.0027273134,0.000079937585,0.000018268505,0.0004359226,0.0016825373,0.0032390768,0.0075061736,0.9664484,0.0002470627,0.01746742],"study_design_scores_gemma":[0.00004599487,0.00016915702,0.0030981174,0.000036844034,0.00004693546,0.0010394827,0.0009193576,0.016503872,0.015453669,0.9514985,0.0111247795,0.000063345986],"about_ca_topic_score_codex":0.0010939784,"about_ca_topic_score_gemma":0.00075849,"teacher_disagreement_score":0.0029895667,"about_ca_system_score_codex":0.0009760481,"about_ca_system_score_gemma":0.0004840802,"threshold_uncertainty_score":0.009348154},"labels":[],"label_agreement":null},{"id":"W3185146491","doi":"10.55016/ojs/cdm.v17i2.72680","title":"simplicity index of tournaments","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Simplicity; Combinatorics; Mathematics; Vertex (graph theory); Simple (philosophy); Index (typography); Class (philosophy); Discrete mathematics; Physics; Computer science; Graph; Philosophy","score_opus":0.017368946544547556,"score_gpt":0.3296349611501178,"score_spread":0.31226601460557024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185146491","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.89530206,0.0005094295,0.036440164,0.0003335841,0.000052992447,0.000072564355,0.00071529095,0.00014449639,0.066429436],"genre_scores_gemma":[0.9857906,0.00018885083,0.007662619,0.00006040273,0.00007336288,0.000056384397,0.0004888193,0.000031825755,0.0056470605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992248,0.00009589528,0.00005138184,0.000202134,0.00024383434,0.00018196373],"domain_scores_gemma":[0.99793696,0.00069188076,0.0005094683,0.00024186292,0.00015243255,0.00046740606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003978581,0.0003518704,0.00051819306,0.0012610602,0.0011771596,0.0018661229,0.00064378564,0.00047507882,0.0036765798],"category_scores_gemma":[0.0025077786,0.00032368297,0.0006106517,0.0012363514,0.0014255844,0.001437552,0.0011095464,0.000790413,0.00039951995],"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.00086057,0.00019650122,0.024780907,0.00025941056,0.0001325502,0.00075226574,0.001178592,0.028689308,0.034761835,0.83156985,0.0070630694,0.06975517],"study_design_scores_gemma":[0.00017631205,0.00071766303,0.04239371,0.000054839027,0.00010056454,0.002064981,0.00035625763,0.09366753,0.012526822,0.8150827,0.032727577,0.00013110098],"about_ca_topic_score_codex":0.0010081298,"about_ca_topic_score_gemma":0.0012472009,"teacher_disagreement_score":0.0036765798,"about_ca_system_score_codex":0.0012124481,"about_ca_system_score_gemma":0.00038008613,"threshold_uncertainty_score":0.012299418},"labels":[],"label_agreement":null},{"id":"W3185544879","doi":"10.55016/ojs/cdm.v16i2.71727","title":"Siblings of an ℵ0-categorical relational structure","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Université de Lyon; Agence Nationale de la Recherche","keywords":"Countable set; Mathematics; Isomorphism (crystallography); Combinatorics; Categorical variable; Discrete mathematics","score_opus":0.02671381009991368,"score_gpt":0.3539586292768096,"score_spread":0.3272448191768959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185544879","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.60633934,0.000745206,0.28778386,0.0017388726,0.00015067469,0.000088933775,0.00095209136,0.000590206,0.10161072],"genre_scores_gemma":[0.9379114,0.00018810362,0.04323652,0.00021663359,0.0000769371,0.00006601434,0.00057248183,0.000049639093,0.017682383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876523,0.00017569473,0.000079858386,0.00039717957,0.0004274499,0.00015456096],"domain_scores_gemma":[0.9981902,0.00055020506,0.00024361463,0.00039083144,0.00033054265,0.00029454893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084199983,0.00028693888,0.00038218038,0.0009077153,0.0014087853,0.001634429,0.0008266317,0.00046308382,0.0050557195],"category_scores_gemma":[0.0017024105,0.00035199136,0.0005576512,0.00069453154,0.0038482063,0.004992591,0.0024345708,0.0014275373,0.00067125954],"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.000019682864,0.0000077961095,0.0008763312,0.00001869715,0.000004601863,0.00010100568,0.00050770055,0.00014999094,0.0023436446,0.9911747,0.00043719076,0.0043586004],"study_design_scores_gemma":[0.000012692359,0.000049353068,0.0018708461,0.000019753741,0.000017739727,0.00055173883,0.0005594991,0.0039266394,0.003618887,0.96175027,0.02760164,0.000021021613],"about_ca_topic_score_codex":0.0013376742,"about_ca_topic_score_gemma":0.0015257288,"teacher_disagreement_score":0.0050557195,"about_ca_system_score_codex":0.0014456352,"about_ca_system_score_gemma":0.00059727154,"threshold_uncertainty_score":0.016913116},"labels":[],"label_agreement":null},{"id":"W3185882927","doi":"10.55016/ojs/cdm.v16i2.71728","title":"Fraïssé theory and the Poulsen simplex","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simplex; Perspective (graphical); Mathematics; Combinatorics; Geometry","score_opus":0.016239517176395084,"score_gpt":0.34737493152052024,"score_spread":0.33113541434412513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185882927","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.141122,0.007728294,0.1527182,0.0064797257,0.0008095862,0.000043574903,0.00039275648,0.00019093748,0.690515],"genre_scores_gemma":[0.92732376,0.0033164995,0.01841037,0.00053389947,0.00064292905,0.00004355556,0.00016630364,0.00010672848,0.049456056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992706,0.00021131328,0.000034016462,0.00013470411,0.00021570825,0.00013358663],"domain_scores_gemma":[0.99882406,0.00053756725,0.00010873474,0.00014484677,0.00023814286,0.00014664757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010299908,0.00043464272,0.00066900096,0.0023712667,0.0030649723,0.003359572,0.00075918937,0.0013141682,0.011268038],"category_scores_gemma":[0.0030892778,0.00025232838,0.00066883396,0.0020750011,0.0057456465,0.0056582205,0.0025387276,0.0023764726,0.0013748981],"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.0000030944184,0.0000010437594,0.000024566718,0.0000052931764,9.671662e-7,0.000014188624,0.00005558971,0.00021767885,0.000051588304,0.9984798,0.00028049637,0.00086566026],"study_design_scores_gemma":[0.000002012395,0.00000424122,0.000046086923,0.000011821198,0.000001334946,0.00004990437,0.00009714061,0.00080798066,0.00009802366,0.9909123,0.00796534,0.0000037253285],"about_ca_topic_score_codex":0.0021222592,"about_ca_topic_score_gemma":0.0013827255,"teacher_disagreement_score":0.011268038,"about_ca_system_score_codex":0.0018829628,"about_ca_system_score_gemma":0.00072386174,"threshold_uncertainty_score":0.037695408},"labels":[],"label_agreement":null},{"id":"W3186474464","doi":"10.55016/ojs/cdm.v16i2.71724","title":"Canonical functions: a proof via topological dynamics","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund; Grantová Agentura České Republiky","keywords":"Mathematics; Countable set; Algebraic number; Topological dynamics; Algebraic properties; Argument (complex analysis); Topology (electrical circuits); Pure mathematics; Combinatorics; Discrete mathematics; Functional analysis","score_opus":0.021472327807081037,"score_gpt":0.3424850571934865,"score_spread":0.32101272938640546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186474464","genre_codex":"methods","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.047001228,0.002841548,0.80134004,0.013975385,0.001701874,0.00020214524,0.0008708792,0.00072089507,0.13134593],"genre_scores_gemma":[0.8123398,0.005320244,0.14176068,0.0042181523,0.0017759398,0.00079484534,0.0007092258,0.00037438783,0.032706838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921846,0.00016892399,0.000046054272,0.00017119774,0.00025982788,0.00013553786],"domain_scores_gemma":[0.9978033,0.0012360585,0.00011430762,0.00018911551,0.00044757553,0.00020965903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019410944,0.0012101324,0.0006892745,0.0022556763,0.0017997691,0.0023368218,0.0010619209,0.0014136886,0.0101636555],"category_scores_gemma":[0.0043256674,0.00047697962,0.001674514,0.0013765214,0.0050352938,0.007940563,0.006167852,0.004069728,0.0012303793],"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.0000061166575,0.0000106884745,0.000069469796,0.000041405594,0.0000040802142,0.0000710983,0.00011266741,0.0003224027,0.0004915482,0.9947514,0.0011412762,0.0029778513],"study_design_scores_gemma":[0.000018833482,0.000025230862,0.00024408444,0.00004010876,0.000012250692,0.00030061722,0.00016009649,0.0033769778,0.001446774,0.97256553,0.021786144,0.000023335246],"about_ca_topic_score_codex":0.0015131191,"about_ca_topic_score_gemma":0.0010640738,"teacher_disagreement_score":0.0101636555,"about_ca_system_score_codex":0.0020585174,"about_ca_system_score_gemma":0.0013192364,"threshold_uncertainty_score":0.034000874},"labels":[],"label_agreement":null},{"id":"W3192511544","doi":"10.55016/ojs/cdm.v16i2.71726","title":"Conant's generalised metric spaces are Ramsey","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Mathematics; Monoid; Metric (unit); Extension (predicate logic); Combinatorics; Metric space; Property (philosophy); Commutative property; Ramsey's theorem; Automorphism; Discrete mathematics; Computer science","score_opus":0.029580346795944446,"score_gpt":0.34943987807521587,"score_spread":0.3198595312792714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192511544","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.47420174,0.0026989966,0.2978849,0.0019956517,0.0002717296,0.000102482954,0.00042769642,0.000638992,0.22177775],"genre_scores_gemma":[0.9358299,0.00064672425,0.039515436,0.00037865047,0.000084801795,0.000077796976,0.00021969077,0.000071935356,0.023175161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992471,0.00019574643,0.000035929137,0.00016321415,0.0002334617,0.00012458584],"domain_scores_gemma":[0.9990926,0.0002853136,0.00009385461,0.00017959907,0.00021313969,0.00013544908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090692984,0.0004398389,0.0005006479,0.0011614348,0.0011898555,0.0015529091,0.00058980554,0.0006900487,0.0040500006],"category_scores_gemma":[0.0016337733,0.0003104903,0.000824945,0.0010339145,0.002876661,0.0057536745,0.002809719,0.0022210344,0.0005285872],"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.000021383747,0.0000053841154,0.00015152222,0.000024209914,0.0000030965084,0.00011734172,0.00035476466,0.0004584936,0.001095514,0.9921618,0.00057249755,0.005033994],"study_design_scores_gemma":[0.000008465709,0.000037239282,0.00060749124,0.000022031709,0.000012311204,0.0006592088,0.00033671004,0.0059717107,0.0013221769,0.9678574,0.023143075,0.000022176551],"about_ca_topic_score_codex":0.001352787,"about_ca_topic_score_gemma":0.0018266652,"teacher_disagreement_score":0.0040500006,"about_ca_system_score_codex":0.0010173145,"about_ca_system_score_gemma":0.00033254846,"threshold_uncertainty_score":0.013548553},"labels":[],"label_agreement":null},{"id":"W3196602131","doi":"","title":"Sun toughness and P ≥3 -factors in graphs.","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Toughness; Discrete mathematics; Composite material; Materials science","score_opus":0.010436303664367408,"score_gpt":0.25557560084099556,"score_spread":0.24513929717662816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196602131","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.608549,0.007086399,0.18904568,0.010002607,0.0011563927,0.00010019515,0.0013558421,0.0004938598,0.18221007],"genre_scores_gemma":[0.95538574,0.001538169,0.021356447,0.0007481539,0.0007231139,0.00006238746,0.0005373104,0.00012131274,0.019527229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990545,0.00020534756,0.000037671834,0.00029921235,0.00017737655,0.00022603253],"domain_scores_gemma":[0.9948738,0.0030110448,0.0005827078,0.00039896707,0.00027302426,0.00086045824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086459634,0.00079221633,0.0009299239,0.0014615594,0.0024324954,0.0027700868,0.0013562435,0.00132916,0.014612483],"category_scores_gemma":[0.0060132556,0.0005245418,0.0010185693,0.0017535532,0.0036756422,0.0061523737,0.0025956477,0.003320267,0.000944908],"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.00011554527,0.000048129103,0.0020193884,0.00013894607,0.000025835488,0.0001264185,0.00046280213,0.0035967147,0.0008795592,0.9734196,0.00795651,0.011210567],"study_design_scores_gemma":[0.000014112099,0.000014055191,0.00090103305,0.000028737795,0.000012201723,0.00012070656,0.00018038045,0.0067510973,0.0003214623,0.98686254,0.004778314,0.00001535389],"about_ca_topic_score_codex":0.0032678174,"about_ca_topic_score_gemma":0.0030611763,"teacher_disagreement_score":0.014612483,"about_ca_system_score_codex":0.0016232746,"about_ca_system_score_gemma":0.0006445776,"threshold_uncertainty_score":0.048883677},"labels":[],"label_agreement":null},{"id":"W3196775760","doi":"10.55016/ojs/cdm.v15i2.68165","title":"Hyperball packings related to truncated cube and octahedron tilings in hyperbolic space","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coxeter group; Combinatorics; Mathematics; Hyperbolic space; Cube (algebra); Octahedron; Space (punctuation); Hypersphere; Voronoi diagram; Crystallography; Geometry; Crystal structure","score_opus":0.011037282932389036,"score_gpt":0.2798916512988554,"score_spread":0.26885436836646637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196775760","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.9603622,0.0001924612,0.029514704,0.00004897958,0.00003108706,0.000024157582,0.00011788346,0.00006383909,0.009644597],"genre_scores_gemma":[0.98474693,0.00017269037,0.011342578,0.000038363472,0.000020877997,0.000035203087,0.00031792044,0.00003814356,0.0032872744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998117,0.000025195099,0.00001040614,0.000050500585,0.00005502224,0.000047132813],"domain_scores_gemma":[0.9997725,0.000046105037,0.00005423975,0.000044114313,0.000027098664,0.000056060537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097558055,0.0002665175,0.00030690685,0.0004992792,0.0005850275,0.0007438496,0.00050578284,0.00030859423,0.0036151698],"category_scores_gemma":[0.0005936185,0.00026467632,0.00029353314,0.0003929283,0.0009813369,0.00083713623,0.0007453603,0.0004395064,0.00032897794],"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.000730103,0.00022677102,0.017625226,0.0004375668,0.00011012662,0.002851383,0.0010743124,0.1651686,0.10262443,0.6450198,0.00387823,0.060253408],"study_design_scores_gemma":[0.00014528079,0.00045979157,0.020726586,0.000073915915,0.000055979766,0.0025815596,0.0013953669,0.59920573,0.046696614,0.3193963,0.009158002,0.000104878214],"about_ca_topic_score_codex":0.001546145,"about_ca_topic_score_gemma":0.0012542827,"teacher_disagreement_score":0.0036151698,"about_ca_system_score_codex":0.00043071923,"about_ca_system_score_gemma":0.00024240473,"threshold_uncertainty_score":0.012093961},"labels":[],"label_agreement":null},{"id":"W3199372147","doi":"10.55016/ojs/cdm.v17i1.73727","title":"Metric properties of incomparability graphs with an emphasis on paths","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche; Canadian Defence Academy","keywords":"Combinatorics; Mathematics; Partially ordered set; Discrete mathematics; Distance-hereditary graph; Graph; Split graph; Line graph; Pathwidth; Graph power","score_opus":0.03238023183835661,"score_gpt":0.3065640118442675,"score_spread":0.2741837800059109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199372147","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.64895344,0.0012218476,0.30342427,0.001114899,0.0000930435,0.00009229126,0.00078635913,0.00028327105,0.04403054],"genre_scores_gemma":[0.9511005,0.00085841626,0.042680845,0.00018108435,0.0001751336,0.00016296636,0.0009238112,0.00013509265,0.003782051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869967,0.00027001504,0.000084995205,0.00035272478,0.00045259477,0.00013994562],"domain_scores_gemma":[0.99482685,0.0025222593,0.0010777605,0.0005560945,0.0005055005,0.0005116089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007398842,0.0008832306,0.00064987317,0.0025363609,0.0014403049,0.0016055432,0.0012496748,0.0010277653,0.0048950473],"category_scores_gemma":[0.0047082184,0.00041403147,0.00088989385,0.0025022621,0.0022782886,0.004857731,0.0018142721,0.0019719903,0.00036546195],"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.00005026773,0.00003997123,0.0017668122,0.00010420792,0.000021637123,0.000523276,0.0005038318,0.015076515,0.005877375,0.96394974,0.0007969796,0.011289349],"study_design_scores_gemma":[0.0000091774455,0.00007466967,0.0018417571,0.000021712834,0.00001928623,0.0008206464,0.00023853945,0.030438373,0.0029096592,0.957272,0.0063321395,0.000022119364],"about_ca_topic_score_codex":0.00078460015,"about_ca_topic_score_gemma":0.00060730096,"teacher_disagreement_score":0.0048950473,"about_ca_system_score_codex":0.00090369774,"about_ca_system_score_gemma":0.00028209432,"threshold_uncertainty_score":0.016375601},"labels":[],"label_agreement":null},{"id":"W3213466060","doi":"10.55016/ojs/cdm.v18i2.74415","title":"On some new families of $k$-Mersenne and generalized $k$-Gaussian Mersenne numbers and their polynomials","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mersenne prime; Mathematics; Gaussian; Combinatorics; Physics; Quantum mechanics","score_opus":0.01022743975645085,"score_gpt":0.28953938956164044,"score_spread":0.2793119498051896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213466060","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.49441057,0.007496789,0.33077177,0.002202577,0.00089866883,0.00009508768,0.0004932075,0.00025203475,0.1633793],"genre_scores_gemma":[0.93011165,0.0029401425,0.046386745,0.0004920874,0.0007240476,0.00008491616,0.00025808084,0.00009483712,0.018907584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994936,0.00009991151,0.00002460217,0.0001138852,0.00017366462,0.000094330084],"domain_scores_gemma":[0.9990238,0.0003037874,0.00017238663,0.00009853424,0.00028409855,0.00011742917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067520834,0.00044640878,0.00045970973,0.0018934095,0.0013198056,0.001163812,0.0005930651,0.0006712995,0.003956871],"category_scores_gemma":[0.0025190867,0.00020273996,0.0005377613,0.0013673421,0.0019283934,0.00407753,0.0011141548,0.0014410752,0.0005408881],"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.000018203267,0.000008519496,0.00031312168,0.000051782754,0.0000044532435,0.00010284136,0.00016465205,0.001209339,0.0012233463,0.9877962,0.00098066,0.008126923],"study_design_scores_gemma":[0.0000129291675,0.00004105164,0.000746987,0.000040045383,0.000010138043,0.00060565147,0.00018142568,0.021018196,0.001209614,0.96190953,0.014187813,0.000036618545],"about_ca_topic_score_codex":0.0005856996,"about_ca_topic_score_gemma":0.00055584486,"teacher_disagreement_score":0.003956871,"about_ca_system_score_codex":0.00082662934,"about_ca_system_score_gemma":0.0005111558,"threshold_uncertainty_score":0.013237119},"labels":[],"label_agreement":null},{"id":"W4226336034","doi":"10.55016/ojs/cdm.v20i1.76009","title":"On the double covers of a line graph.","year":2025,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Prime (order theory); Mathematics; Graph; Coprime integers; Discrete mathematics","score_opus":0.04081099044575935,"score_gpt":0.35660132929703264,"score_spread":0.3157903388512733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226336034","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.82509226,0.0014301148,0.091360174,0.00080780924,0.0001347984,0.00003720372,0.00037480996,0.00013201429,0.08063091],"genre_scores_gemma":[0.9738749,0.0008300085,0.015306392,0.00016019848,0.0001372865,0.00003682092,0.00037931366,0.000053887103,0.009221103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972945,0.0000656639,0.000008461316,0.000066995985,0.00006418686,0.000065228436],"domain_scores_gemma":[0.999506,0.00018657277,0.00013078413,0.00004863951,0.0000480943,0.00007979615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018888856,0.00039806162,0.00021981711,0.0011965989,0.0010271012,0.0008845739,0.00030657114,0.00047008714,0.0042918664],"category_scores_gemma":[0.0007814997,0.00024755532,0.00029935737,0.0006994862,0.0013671533,0.0018099628,0.0008958807,0.00066986005,0.00042635214],"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.000058227975,0.000016898024,0.00093491137,0.00004709805,0.000008947425,0.00028146323,0.00038859376,0.0023696427,0.005827592,0.97877824,0.0013640216,0.009924404],"study_design_scores_gemma":[0.000018321836,0.000080399106,0.00416459,0.000047540547,0.000022982113,0.001207898,0.00069644325,0.028618775,0.0060410853,0.9364411,0.022631442,0.000029354174],"about_ca_topic_score_codex":0.00084571633,"about_ca_topic_score_gemma":0.0008622244,"teacher_disagreement_score":0.0042918664,"about_ca_system_score_codex":0.00064311596,"about_ca_system_score_gemma":0.00016060016,"threshold_uncertainty_score":0.014357686},"labels":[],"label_agreement":null},{"id":"W4390712968","doi":"10.55016/ojs/cdm.v18i1.73590","title":"Intriguing sets of strongly regular graphs and their related structures","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hrvatska Zaklada za Znanost","keywords":"Mathematics; Combinatorics; Indifference graph; Chordal graph; Strongly regular graph; Rank (graph theory); Discrete mathematics; Pathwidth; Graph; Line graph","score_opus":0.01991071899593015,"score_gpt":0.29235962726682346,"score_spread":0.2724489082708933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390712968","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.5246149,0.00070224353,0.37848964,0.0012642517,0.00016907032,0.00013307793,0.0005523754,0.0004632878,0.09361122],"genre_scores_gemma":[0.9354971,0.00035256968,0.054648686,0.00015630435,0.00008282899,0.0001326696,0.0003682672,0.00008408258,0.008677474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940884,0.00018769711,0.00002694172,0.00014044304,0.00016396686,0.000072158604],"domain_scores_gemma":[0.9984665,0.00067710836,0.00022720709,0.00024243636,0.00017049495,0.00021629859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053562963,0.00031824218,0.000303069,0.0012976131,0.0017891166,0.001782461,0.0007238052,0.00062540034,0.004582457],"category_scores_gemma":[0.0017133591,0.00044387442,0.00061646255,0.0006920571,0.0029995465,0.003457967,0.0019757731,0.0013396459,0.00048323255],"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.000019547635,0.000008570029,0.00034086008,0.000034112625,0.000005317965,0.000108615,0.00027142427,0.0011250855,0.0014455521,0.99280375,0.00036918552,0.003468045],"study_design_scores_gemma":[0.000012011614,0.00002603362,0.0005114172,0.000020357405,0.000014774551,0.00039802428,0.00041157284,0.0065716393,0.002589561,0.9803601,0.0090638725,0.000020634805],"about_ca_topic_score_codex":0.00021356986,"about_ca_topic_score_gemma":0.00026904684,"teacher_disagreement_score":0.004582457,"about_ca_system_score_codex":0.00057954463,"about_ca_system_score_gemma":0.00022545115,"threshold_uncertainty_score":0.015329897},"labels":[],"label_agreement":null},{"id":"W4390712990","doi":"10.55016/ojs/cdm.v18i1.74400","title":"On a generalized basic series and Rogers–Ramanujan type identities - II","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Series (stratigraphy); Ramanujan's sum; Type (biology); Ramanujan theta function; Continuation; Combinatorics; Generating function; Algebra over a field; Pure mathematics; Computer science","score_opus":0.03394376022461132,"score_gpt":0.3492758703111695,"score_spread":0.3153321100865582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390712990","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.5273843,0.0029663665,0.17826127,0.002104163,0.0013151075,0.000084154795,0.00021120791,0.00019932417,0.28747407],"genre_scores_gemma":[0.92319953,0.0019028181,0.035630666,0.00038857787,0.0010421005,0.00006570644,0.0001511543,0.00008251509,0.037537027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995517,0.00011619952,0.000018546003,0.00006422878,0.00017679793,0.00007237416],"domain_scores_gemma":[0.99946564,0.00013719616,0.00008486123,0.00010044562,0.00012554877,0.000086351385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087282574,0.00044741054,0.00043422342,0.0011403033,0.0006955811,0.0012930214,0.0007365268,0.0005532583,0.0038101077],"category_scores_gemma":[0.0015085685,0.00015722429,0.00065161,0.0009507784,0.002248658,0.0030881134,0.001178626,0.001299183,0.00060607604],"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.0000082178785,0.00000829063,0.000059772803,0.000017322302,0.000002307489,0.00006605887,0.00008894764,0.0007493776,0.001208098,0.9940607,0.000438369,0.0032926172],"study_design_scores_gemma":[0.0000066544508,0.000023088089,0.00020739171,0.00001250831,0.000003389833,0.00021346506,0.000067921756,0.004074802,0.00068786857,0.98774904,0.006943487,0.000010400793],"about_ca_topic_score_codex":0.0003566963,"about_ca_topic_score_gemma":0.00028846943,"teacher_disagreement_score":0.0038101077,"about_ca_system_score_codex":0.0007487658,"about_ca_system_score_gemma":0.00044632345,"threshold_uncertainty_score":0.012746096},"labels":[],"label_agreement":null},{"id":"W4390712995","doi":"10.55016/ojs/cdm.v18i1.73025","title":"On a generalized basic series and Rogers-Ramanujan type identities","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University Grants Commission","keywords":"Mathematics; Bijection; Combinatorics; Type (biology); Ramanujan theta function; Combinatorial proof; Generating function; Series (stratigraphy); Ramanujan's sum; Generalization; Class (philosophy); Ramanujan tau function; Combinatorial principles; Discrete mathematics; Combinatorial explosion; Computer science","score_opus":0.03593593663408055,"score_gpt":0.35439882126449296,"score_spread":0.3184628846304124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390712995","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.38405755,0.0025509254,0.2459459,0.0015148213,0.0013325599,0.00009846649,0.00019563864,0.00034538022,0.36395878],"genre_scores_gemma":[0.89321357,0.0015921497,0.051269285,0.0005973449,0.0008999705,0.00010456475,0.00013250393,0.00012641866,0.052064184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994517,0.00014148028,0.00002859585,0.00009458493,0.00019863769,0.00008507998],"domain_scores_gemma":[0.9995958,0.000121021694,0.000053971573,0.0000842114,0.00008143226,0.00006365097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010072716,0.0006254137,0.00051039585,0.0014863592,0.001118914,0.0016461578,0.00090262253,0.00076782017,0.0048955977],"category_scores_gemma":[0.0014426749,0.00022270325,0.0008798502,0.0009721604,0.0026269436,0.0036542,0.0015264374,0.0014126827,0.0011310941],"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.0000037535908,0.0000045838538,0.000035493053,0.0000107655105,0.0000010692144,0.00005903153,0.00007208654,0.00036304508,0.00057868805,0.99634874,0.00026062754,0.002261964],"study_design_scores_gemma":[0.000005794993,0.000015710684,0.000117355434,0.000011210737,0.0000035822713,0.00029282772,0.000046509067,0.0040520923,0.0005978598,0.9871733,0.007670971,0.00001282039],"about_ca_topic_score_codex":0.00041785694,"about_ca_topic_score_gemma":0.00036788968,"teacher_disagreement_score":0.0048955977,"about_ca_system_score_codex":0.0007248247,"about_ca_system_score_gemma":0.00042144934,"threshold_uncertainty_score":0.01637739},"labels":[],"label_agreement":null},{"id":"W4390714284","doi":"10.55016/ojs/cdm.v17i2.62707","title":"Brooks' theorem for 2-fold coloring","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Brooks' theorem; Graph; Edge coloring; Vertex (graph theory); Wheel graph; Windmill graph; Graph coloring; List coloring; Discrete mathematics; Complete coloring; Graph power; Line graph","score_opus":0.016673213339947403,"score_gpt":0.27662019205305416,"score_spread":0.25994697871310674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714284","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.07706309,0.00228741,0.7047884,0.004514036,0.0008288583,0.00013714947,0.0012496073,0.0017700961,0.20736136],"genre_scores_gemma":[0.7801531,0.0020995399,0.14629456,0.0031078826,0.0007143315,0.00043867892,0.0009936601,0.0005081805,0.06569006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999074,0.000116870746,0.000040338982,0.00025999578,0.0002876464,0.00022113459],"domain_scores_gemma":[0.9975273,0.0013915071,0.0001430596,0.00045211674,0.00031884146,0.00016721086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010248193,0.0008557747,0.0007596423,0.0013684885,0.0016831589,0.001598773,0.0013752012,0.0012826353,0.013112199],"category_scores_gemma":[0.0049671894,0.0005141572,0.0011862535,0.0010339735,0.0025899382,0.004243418,0.0022350193,0.0024435634,0.0023290927],"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.00005163252,0.000012431977,0.00036642404,0.00008684404,0.000012981311,0.000069886315,0.00021276054,0.0033260167,0.0013000534,0.9677352,0.007994995,0.018830687],"study_design_scores_gemma":[0.000021297716,0.000015687485,0.000350456,0.00002601043,0.0000122963265,0.00015129594,0.000041996544,0.009879948,0.00094536535,0.9719802,0.016559012,0.000016438868],"about_ca_topic_score_codex":0.0038569039,"about_ca_topic_score_gemma":0.0031341414,"teacher_disagreement_score":0.013112199,"about_ca_system_score_codex":0.0016607661,"about_ca_system_score_gemma":0.0010078168,"threshold_uncertainty_score":0.043864608},"labels":[],"label_agreement":null},{"id":"W4390714288","doi":"10.55016/ojs/cdm.v17i2.72522","title":"Some notes on generic rectangulations","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rectangle; Subdivision; Combinatorics; Mathematics; Polytope; Planar; Geometry; Computer science; Computer graphics (images)","score_opus":0.04387160354192173,"score_gpt":0.33940400049216923,"score_spread":0.2955323969502475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714288","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.07576234,0.010573533,0.268226,0.004594254,0.0023512822,0.0001199167,0.0010225438,0.000574471,0.63677573],"genre_scores_gemma":[0.7544222,0.012173735,0.12921877,0.0022536688,0.0020517695,0.00017312176,0.0011845018,0.0004892316,0.098033085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995977,0.00009374091,0.00002681387,0.000081181184,0.00012820576,0.000072295334],"domain_scores_gemma":[0.99962795,0.00013845776,0.00004945473,0.00007020868,0.00007169325,0.000042184245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003958717,0.0006065117,0.00036085845,0.0009614763,0.0013007375,0.0019759706,0.0006155091,0.00072148576,0.012927602],"category_scores_gemma":[0.0014230785,0.000308807,0.00077720085,0.0012991423,0.002294569,0.0025089704,0.0015290086,0.0017986585,0.0018586216],"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.000011467851,0.000004547939,0.00009211413,0.000040956875,0.0000023014293,0.00012010958,0.0001549049,0.0010759507,0.0005749022,0.9842733,0.004891028,0.008758345],"study_design_scores_gemma":[0.000012048647,0.000050405866,0.000550352,0.000050755534,0.000010249062,0.00045215272,0.00033289817,0.0039598444,0.0011657141,0.7977098,0.19567887,0.000026869873],"about_ca_topic_score_codex":0.0023574592,"about_ca_topic_score_gemma":0.0018917469,"teacher_disagreement_score":0.012927602,"about_ca_system_score_codex":0.0012111969,"about_ca_system_score_gemma":0.00027625164,"threshold_uncertainty_score":0.043247104},"labels":[],"label_agreement":null},{"id":"W4390714305","doi":"10.55016/ojs/cdm.v17i2.70452","title":"Refining overpartitions by properties of non-overlined parts","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bijection; Mathematics; Divisibility rule; Congruence relation; Combinatorics; Mathematical proof; Enumeration; Modulo; Combinatorial proof; Generating function; Discrete mathematics","score_opus":0.03374710155494807,"score_gpt":0.32667215621551215,"score_spread":0.29292505466056407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714305","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.7161385,0.00035610696,0.22078271,0.00031563983,0.00008813164,0.00004638877,0.000095340474,0.00030248877,0.061874714],"genre_scores_gemma":[0.9803094,0.00013381208,0.015073138,0.00007078979,0.000053826203,0.00003074553,0.00006193521,0.00011929491,0.004146908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987956,0.00030491082,0.00006386636,0.000259684,0.00033312934,0.0002427882],"domain_scores_gemma":[0.9952642,0.0021993134,0.000631611,0.0013194181,0.00032818553,0.00025726264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207418,0.00043359923,0.0004563979,0.0012829412,0.0014937901,0.0025610195,0.00068619923,0.0004685804,0.0046536652],"category_scores_gemma":[0.0058350987,0.0003901885,0.0007472361,0.0009408833,0.0032152813,0.004670358,0.0019573495,0.0015218259,0.00051343377],"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.000037661994,0.000015151572,0.0008155176,0.000024574578,0.0000055083933,0.00015555894,0.00040973164,0.0031144295,0.004282435,0.9840461,0.00028731156,0.006806034],"study_design_scores_gemma":[0.000008113601,0.00003207639,0.00092363753,0.00002456007,0.0000138527985,0.00040204905,0.00022180758,0.018135,0.0070719644,0.96704406,0.0061016814,0.000021223937],"about_ca_topic_score_codex":0.00036638515,"about_ca_topic_score_gemma":0.00048190594,"teacher_disagreement_score":0.0046536652,"about_ca_system_score_codex":0.00067685614,"about_ca_system_score_gemma":0.00032496642,"threshold_uncertainty_score":0.015568078},"labels":[],"label_agreement":null},{"id":"W4390714306","doi":"10.55016/ojs/cdm.v17i2.69706","title":"On $D_{\\alpha}$ spectrum of connected graphs","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Spectral radius; Combinatorics; Mathematics; Diagonal; Alpha (finance); Graph; Eigenvalues and eigenvectors; Physics; Geometry","score_opus":0.01871690452322534,"score_gpt":0.3125228308750543,"score_spread":0.29380592635182895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714306","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.449748,0.008116275,0.48915654,0.0018938306,0.00022441919,0.000103615865,0.0007773098,0.00076853053,0.049211457],"genre_scores_gemma":[0.9311746,0.005055543,0.05809892,0.0005242826,0.00044889303,0.00024176379,0.00053911156,0.00031504288,0.0036018388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981598,0.000824486,0.000065123044,0.00038371753,0.00035012327,0.0002167754],"domain_scores_gemma":[0.9877401,0.008972887,0.0010445226,0.00081800966,0.0005361145,0.0008883278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015748222,0.0017931106,0.0014014528,0.0037259029,0.0012876126,0.001858059,0.0017418177,0.0014551766,0.0035731343],"category_scores_gemma":[0.011363338,0.00062413915,0.0007954115,0.0021725895,0.0035944427,0.0035824978,0.002445937,0.0020932667,0.0010751095],"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.00026881875,0.000072281444,0.0011643716,0.0002882423,0.000052648946,0.00039543465,0.0006776806,0.04353559,0.013555119,0.9159454,0.003823849,0.020220589],"study_design_scores_gemma":[0.00003504189,0.00007886357,0.0013670654,0.0001286765,0.00003706219,0.0005964468,0.0002496908,0.1982913,0.0035042677,0.7915897,0.004052428,0.000069388036],"about_ca_topic_score_codex":0.00097357616,"about_ca_topic_score_gemma":0.0006593626,"teacher_disagreement_score":0.0037259029,"about_ca_system_score_codex":0.0012365963,"about_ca_system_score_gemma":0.00038580218,"threshold_uncertainty_score":0.011953294},"labels":[],"label_agreement":null},{"id":"W4390714307","doi":"10.55016/ojs/cdm.v17i2.62734","title":"Hamilton cycles in bidirected complete graphs","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Generalization; Indifference graph; 1-planar graph; Chordal graph; Discrete mathematics; Graph","score_opus":0.03429892041570055,"score_gpt":0.32880357045648684,"score_spread":0.2945046500407863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714307","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.702787,0.0012745612,0.22450842,0.001383023,0.0001520716,0.00015623786,0.00062012824,0.0001975644,0.06892097],"genre_scores_gemma":[0.95363855,0.000799273,0.03386092,0.00032978065,0.000058270063,0.00014586166,0.00037911613,0.000035215737,0.010752959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996693,0.00009765686,0.000020233687,0.00006865824,0.000090670546,0.00005343072],"domain_scores_gemma":[0.9988815,0.00043762525,0.00017261902,0.00008000101,0.00026011086,0.00016807638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037497806,0.00028739334,0.00023517663,0.0012399015,0.0007650943,0.0010979861,0.0005593214,0.00041350056,0.002733716],"category_scores_gemma":[0.0021602982,0.00030179316,0.00025329448,0.00091573026,0.0012855558,0.0015627808,0.0010411182,0.0006954021,0.00026156785],"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.00003004382,0.000015222376,0.0004279797,0.000046022684,0.00000671782,0.00011175235,0.00028295934,0.0026392804,0.0017249121,0.9869131,0.00095884904,0.006843276],"study_design_scores_gemma":[0.00002969106,0.000017455524,0.0003982023,0.00001594437,0.00000975117,0.00007945566,0.0001460055,0.01593499,0.0009248443,0.97634614,0.006083522,0.000013988997],"about_ca_topic_score_codex":0.0027548831,"about_ca_topic_score_gemma":0.0029603704,"teacher_disagreement_score":0.0027548831,"about_ca_system_score_codex":0.0008069247,"about_ca_system_score_gemma":0.0005446359,"threshold_uncertainty_score":0.009145141},"labels":[],"label_agreement":null},{"id":"W4390714308","doi":"10.55016/ojs/cdm.v17i2.67832","title":"On uniformly resolvable $(C_4,K_{1,3})$-designs","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Resolution (logic); Class (philosophy); Complete graph; Discrete mathematics; Computer science","score_opus":0.011618421720882403,"score_gpt":0.24143616208692215,"score_spread":0.22981774036603975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714308","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.66868925,0.00063527067,0.28927174,0.00026650043,0.000052568415,0.00005543495,0.00024753384,0.0001893865,0.040592313],"genre_scores_gemma":[0.9405623,0.00030430738,0.050781712,0.000114748545,0.000045399884,0.00006542909,0.00023574397,0.00005620468,0.007834173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990558,0.0003194098,0.000033572498,0.0001707486,0.00021736638,0.00020313633],"domain_scores_gemma":[0.9987356,0.0006230422,0.00020717282,0.00021522974,0.00012532553,0.00009363426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068463705,0.00055115955,0.00037910434,0.00097124063,0.00073383015,0.0010378995,0.00047837317,0.00072964345,0.004387166],"category_scores_gemma":[0.0018891826,0.0003753858,0.00046949176,0.00065983157,0.0012557608,0.0012382871,0.00084154913,0.00082994497,0.0007212252],"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.0002688859,0.00004403567,0.00081877527,0.0000860477,0.000026424688,0.00026395312,0.0002606656,0.03171588,0.014455537,0.9282963,0.0009747382,0.022788793],"study_design_scores_gemma":[0.000066985274,0.0001395816,0.0007513978,0.000074687865,0.000025188736,0.00041717736,0.0001876328,0.089936145,0.010349521,0.8921663,0.0058476664,0.00003768968],"about_ca_topic_score_codex":0.00055757014,"about_ca_topic_score_gemma":0.00081317325,"teacher_disagreement_score":0.004387166,"about_ca_system_score_codex":0.0005962174,"about_ca_system_score_gemma":0.000403855,"threshold_uncertainty_score":0.014676571},"labels":[],"label_agreement":null},{"id":"W4390714589","doi":"10.55016/ojs/cdm.v17i1.70935","title":"A note on the fully degenerate Bell polynomials of the second kind","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bell polynomials; Degenerate energy levels; Difference polynomials; Hahn polynomials; Wilson polynomials; Orthogonal polynomials; Classical orthogonal polynomials; Discrete orthogonal polynomials; Combinatorics; Koornwinder polynomials; Pure mathematics; Algebra over a field; Discrete mathematics; Gegenbauer polynomials; Quantum mechanics; Physics","score_opus":0.028878925340430597,"score_gpt":0.31982503541355634,"score_spread":0.29094611007312576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714589","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.12061961,0.0075792423,0.6831941,0.013264873,0.0043087313,0.000064816086,0.00019889674,0.00033148524,0.17043824],"genre_scores_gemma":[0.8690493,0.0042798766,0.09720562,0.0047322167,0.0023084173,0.000055357566,0.00010722158,0.00018582001,0.022076314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987583,0.0003891008,0.000054219257,0.00015198193,0.00046300027,0.00018339866],"domain_scores_gemma":[0.9985469,0.0006236794,0.00013972115,0.00027443006,0.0002506191,0.00016461006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002356068,0.00048292335,0.0006302543,0.00092479336,0.002151035,0.0016237446,0.0012223421,0.0015446556,0.003166891],"category_scores_gemma":[0.0036906851,0.00031490476,0.00091125956,0.0008116373,0.004642095,0.003987158,0.002233474,0.0043695536,0.0005909022],"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.0000079233705,0.0000044595063,0.000051022966,0.000021126529,0.0000021036587,0.0000708506,0.00011098462,0.00030225076,0.0006004245,0.99582434,0.0008888021,0.0021156892],"study_design_scores_gemma":[0.0000036172823,0.000021843798,0.00008779047,0.00001441683,0.00000405867,0.00019872234,0.000038817125,0.0057211462,0.0005246778,0.98652995,0.006840723,0.00001422412],"about_ca_topic_score_codex":0.00074482383,"about_ca_topic_score_gemma":0.0005452218,"teacher_disagreement_score":0.003166891,"about_ca_system_score_codex":0.00080287387,"about_ca_system_score_gemma":0.0008250806,"threshold_uncertainty_score":0.012460232},"labels":[],"label_agreement":null},{"id":"W4390714603","doi":"10.55016/ojs/cdm.v17i1.62338","title":"The endomorphisms monoids of Helm graph and its generalization","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Chemical Synthesis and Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Combinatorics; Generalization; Monoid; Graph; Discrete mathematics","score_opus":0.006460612361203112,"score_gpt":0.24955127750351558,"score_spread":0.24309066514231248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714603","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.8076771,0.0007197895,0.14697021,0.00046926006,0.000118057505,0.000051643816,0.00038645533,0.00013730756,0.043470155],"genre_scores_gemma":[0.95986754,0.00037881863,0.026864057,0.00014952669,0.00013224673,0.00006354678,0.00027630906,0.000049002978,0.012218851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995697,0.00006437011,0.00002527915,0.0001583916,0.00010723242,0.00007501753],"domain_scores_gemma":[0.99933535,0.00018846263,0.00011657879,0.000120769735,0.0001193526,0.00011942523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004152271,0.00021957034,0.00025765045,0.0010372229,0.0009870972,0.0008415619,0.0003805384,0.000451027,0.002268195],"category_scores_gemma":[0.0008035589,0.0002096067,0.0005346294,0.00044342346,0.0014514842,0.0019263065,0.0015180504,0.0009180667,0.00027882122],"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.000047547703,0.000021634234,0.0012531566,0.000036007765,0.000010262808,0.00019239675,0.00040421906,0.000945507,0.007020283,0.9800116,0.00046531585,0.009592044],"study_design_scores_gemma":[0.000011452026,0.00008416438,0.003437322,0.000018127143,0.00002566259,0.00071934843,0.0003966144,0.008494572,0.0056715924,0.9666157,0.01449463,0.00003086467],"about_ca_topic_score_codex":0.0005270643,"about_ca_topic_score_gemma":0.00051317055,"teacher_disagreement_score":0.002268195,"about_ca_system_score_codex":0.00040582442,"about_ca_system_score_gemma":0.00027415785,"threshold_uncertainty_score":0.00758785},"labels":[],"label_agreement":null},{"id":"W4390714611","doi":"10.55016/ojs/cdm.v17i1.67951","title":"Pushes in words-a primitive sorting algorithm","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Alphabet; Sorting; Combinatorics; Mathematics; Statistic; Order (exchange); Word (group theory); Degree (music); Function (biology); Algorithm; Discrete mathematics; Arithmetic; Statistics; Geometry","score_opus":0.010191505785043426,"score_gpt":0.2709214146603092,"score_spread":0.2607299088752658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714611","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.30357128,0.00016890792,0.6836823,0.0004635772,0.0000928529,0.0000970957,0.00041813162,0.0020286373,0.009477162],"genre_scores_gemma":[0.8469541,0.0001657656,0.14167945,0.00018306107,0.00012179876,0.00017055815,0.00057617476,0.0004722344,0.009676882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984779,0.00030437697,0.000117319454,0.000355475,0.0005441253,0.00020080173],"domain_scores_gemma":[0.9934807,0.0034884026,0.00060844474,0.001286721,0.0006846959,0.00045111455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014777839,0.00044551966,0.00078247255,0.0017087254,0.00090868573,0.0027678024,0.0010278965,0.00082695985,0.0042028343],"category_scores_gemma":[0.009349056,0.00033576362,0.0007420354,0.0015202514,0.002658378,0.0032137565,0.0017381087,0.0013174119,0.0011576412],"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.00032647344,0.000067270266,0.0036869568,0.00011091445,0.000027887332,0.00023881152,0.00057048426,0.030459387,0.012945129,0.8736559,0.0020064896,0.07590425],"study_design_scores_gemma":[0.00004007047,0.00012996844,0.0011528328,0.000027716804,0.00001942616,0.00025836687,0.00013791595,0.20788744,0.011612122,0.7730913,0.005592854,0.000050028033],"about_ca_topic_score_codex":0.00064808474,"about_ca_topic_score_gemma":0.0006492071,"teacher_disagreement_score":0.0042028343,"about_ca_system_score_codex":0.00088616105,"about_ca_system_score_gemma":0.0011617651,"threshold_uncertainty_score":0.014059901},"labels":[],"label_agreement":null},{"id":"W4390714620","doi":"10.55016/ojs/cdm.v17i1.71829","title":"Spirals in Periodic Tilings","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Substitution tiling; Hexagonal tiling; Penrose tiling; Combinatorics; Mathematics; Spiral (railway); Tessellation (computer graphics); Tile; Set (abstract data type); Square tiling; Quasicrystal; Geometry; Computer science; Mathematical analysis","score_opus":0.012832943442732734,"score_gpt":0.2737523537030152,"score_spread":0.2609194102602825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714620","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.5666961,0.0037227725,0.21262799,0.0011593018,0.0005381422,0.000090323505,0.0003838143,0.0005909378,0.21419057],"genre_scores_gemma":[0.9431263,0.0010804249,0.0378215,0.00019403397,0.00013742979,0.000058915066,0.00018458576,0.000102455066,0.017294295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980944,0.0000283943,0.000016202455,0.00005479877,0.000056892433,0.00003437536],"domain_scores_gemma":[0.999663,0.000112063746,0.00007001884,0.00006308066,0.000048095804,0.000043598666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015258112,0.00021656389,0.00022037195,0.00053964264,0.0006241781,0.0013058168,0.0002265404,0.0004936104,0.005659179],"category_scores_gemma":[0.000965491,0.00023869255,0.000358418,0.0003193025,0.0014841465,0.0012120578,0.0006793199,0.0005076898,0.0007497215],"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.000028426217,0.000008091588,0.00037262947,0.000093374125,0.0000038196954,0.0001905537,0.00027110483,0.003730542,0.007938581,0.9720827,0.0013862727,0.013893983],"study_design_scores_gemma":[0.000023365175,0.00006493107,0.0009830941,0.0000620583,0.000008250573,0.0007065696,0.00032538731,0.019930767,0.004857242,0.9387978,0.03422036,0.000020113805],"about_ca_topic_score_codex":0.0004369727,"about_ca_topic_score_gemma":0.0004057708,"teacher_disagreement_score":0.005659179,"about_ca_system_score_codex":0.00037095108,"about_ca_system_score_gemma":0.00021580224,"threshold_uncertainty_score":0.018931866},"labels":[],"label_agreement":null},{"id":"W4390714624","doi":"10.55016/ojs/cdm.v17i1.69695","title":"Kn(λ) is fully {P5,C6}-decomposable","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University Grants Commission","keywords":"Multigraph; Mathematics; Combinatorics; Lambda; Path (computing); Decomposition; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Physics; Computer science","score_opus":0.006452648171387555,"score_gpt":0.2344828851408915,"score_spread":0.22803023696950395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714624","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.6673513,0.0004805137,0.123632155,0.0017059133,0.00041664625,0.00025911376,0.004160876,0.0009310271,0.20106252],"genre_scores_gemma":[0.8988355,0.0004449233,0.037494645,0.00078435126,0.0002113846,0.00016812308,0.0068940646,0.00028223198,0.054884713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991893,0.00008878535,0.000039686933,0.00024265215,0.00018354885,0.00025607698],"domain_scores_gemma":[0.99872905,0.00037381056,0.00026796738,0.00012413411,0.00022902506,0.00027595097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004211831,0.000997907,0.0006206479,0.0010048595,0.0012994448,0.0018226947,0.00092344667,0.0007992309,0.011793504],"category_scores_gemma":[0.0009783817,0.00054065924,0.000583286,0.00082654785,0.0015192898,0.0021363178,0.0013856131,0.0018724147,0.0021715136],"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.0011465356,0.0004556434,0.0019147317,0.0006861219,0.000132529,0.0024416938,0.0009822138,0.01597806,0.033321384,0.8566352,0.027440159,0.058865704],"study_design_scores_gemma":[0.0001845222,0.0001444907,0.0027779797,0.00008017828,0.000053901276,0.0010681063,0.0005439832,0.02775019,0.008273971,0.93436795,0.024684649,0.00007006685],"about_ca_topic_score_codex":0.0023987896,"about_ca_topic_score_gemma":0.0036731353,"teacher_disagreement_score":0.011793504,"about_ca_system_score_codex":0.0010134546,"about_ca_system_score_gemma":0.00072989793,"threshold_uncertainty_score":0.03945315},"labels":[],"label_agreement":null},{"id":"W4390714631","doi":"10.55016/ojs/cdm.v17i1.72482","title":"Homothetic covering of convex hulls of compact convex sets","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shanxi Province; National Natural Science Foundation of China","keywords":"Mathematics; Convex hull; Combinatorics; Homothetic transformation; Convex set; Convex polytope; Orthogonal convex hull; Convex body; Cover (algebra); Regular polygon; Convex combination; Parallelepiped; Subderivative; Convex analysis; Integer (computer science); Geometry; Convex optimization; Computer science","score_opus":0.03718798935189808,"score_gpt":0.346655638837027,"score_spread":0.3094676494851289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714631","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.7723614,0.00076192326,0.21178406,0.0001340889,0.00003478832,0.000025772852,0.00017922418,0.00010482176,0.014613854],"genre_scores_gemma":[0.9717083,0.00050192105,0.023736494,0.000021624,0.00003785559,0.000034209457,0.00031923858,0.000054285803,0.003586023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937975,0.00015020072,0.0000247062,0.000091478316,0.000242217,0.0001116674],"domain_scores_gemma":[0.99778,0.0012217781,0.00033881073,0.00025220742,0.00019108863,0.00021615297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006696711,0.0005559158,0.00055725564,0.0015764319,0.00052868796,0.0010490873,0.0005263464,0.00024960158,0.002945569],"category_scores_gemma":[0.0031736887,0.00028484798,0.0006594468,0.00081710477,0.0018318737,0.0013273775,0.0011529376,0.0007313573,0.00027649512],"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.00042773952,0.000087679575,0.006637269,0.00027275077,0.000098238976,0.00081653235,0.00089469925,0.179083,0.05519293,0.69183743,0.0019244433,0.06272727],"study_design_scores_gemma":[0.00001873394,0.00022167567,0.011838029,0.000041003255,0.00003484507,0.0009133877,0.00044485403,0.6664932,0.018605715,0.29582042,0.005530135,0.000038041308],"about_ca_topic_score_codex":0.0012116607,"about_ca_topic_score_gemma":0.0006242397,"teacher_disagreement_score":0.002945569,"about_ca_system_score_codex":0.00086279114,"about_ca_system_score_gemma":0.000264926,"threshold_uncertainty_score":0.0098538995},"labels":[],"label_agreement":null},{"id":"W4391148148","doi":"10.55016/ojs/cdm.v18i2.73491","title":"Combinatorial settlement planning","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Urban Design and Spatial Analysis","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Sveučilište u Zagrebu","keywords":"Settlement (finance); Combinatorics; Mathematics; Combinatorial analysis; Computer science; World Wide Web","score_opus":0.014891184586600393,"score_gpt":0.2701460217193458,"score_spread":0.25525483713274544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148148","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.017160289,0.0010016845,0.8821426,0.00079094083,0.00017452851,0.0001597183,0.00077822484,0.00035529904,0.09743675],"genre_scores_gemma":[0.55555856,0.0025069104,0.39536917,0.00032155172,0.0001979004,0.0004571309,0.0019560498,0.00037414342,0.04325851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929166,0.00028870048,0.000022380505,0.00015456059,0.0001272987,0.00011533298],"domain_scores_gemma":[0.9994659,0.0002933111,0.000044919245,0.00007261877,0.000057771034,0.00006548083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005275699,0.0010788527,0.0010611144,0.000687742,0.0010535868,0.0019456234,0.0018035115,0.0012374988,0.015939746],"category_scores_gemma":[0.0017214582,0.000660829,0.0010470403,0.0017094902,0.0012751052,0.0017071911,0.001312707,0.0013316554,0.0016531331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00003598414,0.000055992023,0.000293802,0.00016699432,0.000029422272,0.00012913567,0.00005517165,0.6707546,0.00043776075,0.2931555,0.009584192,0.025301417],"study_design_scores_gemma":[0.000025040228,0.000046987738,0.00016584762,0.000036481186,0.000019084386,0.00011167545,0.00010834562,0.72002304,0.00039647176,0.25822172,0.020829642,0.000015727697],"about_ca_topic_score_codex":0.0051302374,"about_ca_topic_score_gemma":0.008201715,"teacher_disagreement_score":0.015939746,"about_ca_system_score_codex":0.0017941394,"about_ca_system_score_gemma":0.0011315403,"threshold_uncertainty_score":0.053323746},"labels":[],"label_agreement":null},{"id":"W4391148150","doi":"10.55016/ojs/cdm.v18i2.73457","title":"On Colouring Oriented Graphs of Large Girth","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics","score_opus":0.016449777144991736,"score_gpt":0.3373477100802734,"score_spread":0.3208979329352817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148150","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.4522709,0.0010689475,0.4891412,0.0013338424,0.00019934766,0.00012357197,0.00027136345,0.00063064444,0.05496012],"genre_scores_gemma":[0.88583225,0.0016488099,0.097795255,0.0006351865,0.00027023195,0.00017565304,0.0006017044,0.00029496633,0.0127459625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991542,0.00017841785,0.00002771784,0.00026876264,0.00018267294,0.00018816629],"domain_scores_gemma":[0.99386567,0.0038377324,0.00078843033,0.000752389,0.00028630137,0.00046943972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007543086,0.0009621763,0.0004603173,0.0011135378,0.0012254704,0.0015503375,0.0011858592,0.0008471442,0.004417642],"category_scores_gemma":[0.0058664368,0.000535957,0.0008472359,0.0013408037,0.004026811,0.0034338115,0.0032797281,0.0019543942,0.000849433],"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.0001725555,0.00010748468,0.0032330917,0.00024300112,0.000039989427,0.0003640603,0.00091941876,0.033491585,0.013769971,0.9139594,0.003344066,0.03035543],"study_design_scores_gemma":[0.00004722326,0.00010245157,0.0014082398,0.000056543104,0.000046530873,0.00036366947,0.00024500658,0.052320875,0.0060103666,0.9298055,0.009550821,0.00004270874],"about_ca_topic_score_codex":0.0023155017,"about_ca_topic_score_gemma":0.0024288266,"teacher_disagreement_score":0.004417642,"about_ca_system_score_codex":0.0016809594,"about_ca_system_score_gemma":0.00069709175,"threshold_uncertainty_score":0.014778435},"labels":[],"label_agreement":null},{"id":"W4391148153","doi":"10.55016/ojs/cdm.v18i2.73143","title":"On some partition theorems of M. V. Subbarao","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Discrete mathematics","score_opus":0.035257067068527846,"score_gpt":0.36723579070121876,"score_spread":0.33197872363269093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148153","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.33095217,0.019295944,0.35938168,0.0143982805,0.003178555,0.00018567916,0.0005908783,0.0002846164,0.27173233],"genre_scores_gemma":[0.89701474,0.007680244,0.053893648,0.0035209148,0.002533891,0.00041989793,0.00050669117,0.00024111514,0.03418899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789906,0.0006275871,0.00007196046,0.00046577107,0.00057942275,0.00035619902],"domain_scores_gemma":[0.99589795,0.0027381927,0.0003470202,0.00036243588,0.00040182093,0.00025255862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004026268,0.00076809677,0.0014763542,0.0024234336,0.003044426,0.003274694,0.0014935397,0.001079085,0.003769677],"category_scores_gemma":[0.008840705,0.0006386163,0.0015648529,0.002068727,0.0049725,0.007116814,0.0034086588,0.0033447058,0.00090594275],"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.000026539874,0.0000139240865,0.00016508879,0.000024563285,0.000005031268,0.000025716927,0.0002045714,0.00043742172,0.0003305028,0.9935684,0.0017497928,0.0034483834],"study_design_scores_gemma":[0.000018828005,0.000021731872,0.00032560696,0.000028258793,0.0000090290905,0.00008430742,0.00008385286,0.003080165,0.00078731164,0.9857648,0.009779349,0.000016847438],"about_ca_topic_score_codex":0.0011835773,"about_ca_topic_score_gemma":0.0006167825,"teacher_disagreement_score":0.004026268,"about_ca_system_score_codex":0.0032470715,"about_ca_system_score_gemma":0.00088443735,"threshold_uncertainty_score":0.023559213},"labels":[],"label_agreement":null},{"id":"W4391148156","doi":"10.55016/ojs/cdm.v18i2.62607","title":"Resolvability in Hypergraphs","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015678541215553475,"score_gpt":0.29367569208763117,"score_spread":0.2779971508720777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148156","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.6890906,0.002917058,0.25734022,0.0033568637,0.00014813548,0.000054772667,0.0009833019,0.00049539434,0.045613587],"genre_scores_gemma":[0.96833974,0.001019597,0.023632439,0.0002316676,0.00024577888,0.00005801873,0.000519777,0.00013143783,0.005821527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769884,0.00068784173,0.00008586849,0.0006321847,0.00058039586,0.00031481872],"domain_scores_gemma":[0.9808384,0.013863355,0.0012865529,0.0018712807,0.00090122514,0.0012391434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013855228,0.0006133137,0.0010333379,0.0024987285,0.0020661042,0.00519771,0.0015750643,0.0014548461,0.005240594],"category_scores_gemma":[0.011636135,0.000900387,0.0009894548,0.0028315883,0.0039880467,0.007649196,0.0037006633,0.0036255985,0.0005607517],"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.00009699679,0.00002015985,0.001449319,0.00013111443,0.000034257624,0.000071993745,0.00038164444,0.009351356,0.0020838869,0.9760134,0.0012725333,0.009093314],"study_design_scores_gemma":[0.000015679472,0.000020593283,0.0008074004,0.000030058383,0.000018099516,0.00018410796,0.00015026584,0.025308918,0.001403323,0.9688487,0.0031911412,0.000021743832],"about_ca_topic_score_codex":0.0012608501,"about_ca_topic_score_gemma":0.0013980623,"teacher_disagreement_score":0.005240594,"about_ca_system_score_codex":0.0023301623,"about_ca_system_score_gemma":0.0006153895,"threshold_uncertainty_score":0.017531514},"labels":[],"label_agreement":null},{"id":"W4391148160","doi":"10.55016/ojs/cdm.v18i2.73182","title":"A graph related to the sum of element orders of a finite group","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Group (periodic table); Finite group; Discrete mathematics; Chemistry","score_opus":0.03771115176451516,"score_gpt":0.3573950771517207,"score_spread":0.3196839253872055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148160","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.588321,0.001506862,0.31162807,0.0016252158,0.00035670312,0.00026336728,0.0018682886,0.00036070586,0.09406982],"genre_scores_gemma":[0.8783543,0.0015520101,0.09466863,0.0003881724,0.00030459577,0.0002136049,0.0025847019,0.00017017436,0.021763813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967337,0.00006158808,0.000019117399,0.00013308493,0.00006380098,0.000049156457],"domain_scores_gemma":[0.99919194,0.00029491057,0.00017412791,0.00010527974,0.00012838861,0.00010527412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001835177,0.0003523086,0.00024875204,0.0010456498,0.0011918684,0.00096207735,0.0005715578,0.0005240226,0.0044302708],"category_scores_gemma":[0.0008663185,0.00019026069,0.0004434811,0.0009779591,0.0016045108,0.0020390258,0.00077048515,0.0008938633,0.0005048941],"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.00008400305,0.000045770816,0.0018518283,0.00023918785,0.000029432242,0.000563884,0.0011052568,0.0028491172,0.013466436,0.9534884,0.002118679,0.02415796],"study_design_scores_gemma":[0.000018856243,0.000080854305,0.0046511292,0.00007945826,0.00006354715,0.0018791812,0.00089541316,0.0143143535,0.0077428506,0.90480983,0.06542385,0.00004053697],"about_ca_topic_score_codex":0.0013307831,"about_ca_topic_score_gemma":0.0014745361,"teacher_disagreement_score":0.0044302708,"about_ca_system_score_codex":0.00070402614,"about_ca_system_score_gemma":0.00036146824,"threshold_uncertainty_score":0.014820695},"labels":[],"label_agreement":null},{"id":"W4391148170","doi":"10.55016/ojs/cdm.v18i2.73995","title":"Hankel Determinants of shifted sequences of Bernoulli and Euler numbers","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bernoulli's principle; Euler's formula; Combinatorics; Euler number (physics); Hankel transform; Euler equations; Semi-implicit Euler method; Mathematical analysis; Backward Euler method; Physics","score_opus":0.041519369895329145,"score_gpt":0.36173281081238956,"score_spread":0.3202134409170604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148170","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.5965734,0.0017306564,0.34316897,0.00043043902,0.0005695727,0.000049232392,0.00013863313,0.00015710943,0.057181973],"genre_scores_gemma":[0.9427279,0.0012311476,0.03772956,0.00017697026,0.00039666085,0.000030221117,0.00010330404,0.0001373543,0.01746689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993162,0.00013348777,0.00003261963,0.000089441695,0.00029406452,0.00013421258],"domain_scores_gemma":[0.99870884,0.00047932848,0.00017171494,0.000114382674,0.00035976508,0.00016602426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009861693,0.00046517185,0.00047051438,0.001830852,0.0006793066,0.0014362213,0.0005843563,0.0005382431,0.005177394],"category_scores_gemma":[0.004116172,0.00023826121,0.00040253915,0.0008307652,0.001858181,0.0026554528,0.0011211359,0.0011690262,0.00067043805],"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.000033164106,0.00002491578,0.0006056241,0.000056484456,0.000007593066,0.00016722885,0.00032395133,0.004942649,0.0060024327,0.9680293,0.00042744656,0.019379152],"study_design_scores_gemma":[0.000010113498,0.000061849554,0.0015242308,0.0000523042,0.000010827873,0.00039867076,0.000199192,0.04143956,0.007001502,0.94305646,0.0061956593,0.00004962321],"about_ca_topic_score_codex":0.00044826348,"about_ca_topic_score_gemma":0.0004820555,"teacher_disagreement_score":0.005177394,"about_ca_system_score_codex":0.00061159354,"about_ca_system_score_gemma":0.0006207905,"threshold_uncertainty_score":0.017320156},"labels":[],"label_agreement":null},{"id":"W4391148171","doi":"10.55016/ojs/cdm.v18i2.73074","title":"Extended inverse theorems for $h$-fold sumsets in integers","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Council of Scientific and Industrial Research, India","keywords":"Mathematics; Fold (higher-order function); Combinatorics; Inverse; Computer science; Geometry","score_opus":0.03397540666762246,"score_gpt":0.36110881993711624,"score_spread":0.3271334132694938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148171","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.459829,0.0036930868,0.2876574,0.0025887254,0.0007001581,0.00010954623,0.00045387208,0.00048058192,0.24448758],"genre_scores_gemma":[0.8968466,0.0017073461,0.07712071,0.0009420425,0.00047884748,0.00015478229,0.0004052302,0.000246414,0.022098038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989825,0.00024231704,0.00009088501,0.00021695095,0.0002838723,0.00018347516],"domain_scores_gemma":[0.99650866,0.0024134268,0.0002275477,0.0003318731,0.000310166,0.00020837804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019316477,0.0006363977,0.0006562443,0.0020252273,0.0017356368,0.0025529917,0.0009012213,0.0011464052,0.005490063],"category_scores_gemma":[0.006200214,0.00046435,0.0016653873,0.0009450629,0.003564668,0.007361727,0.0025096103,0.0031565726,0.00072236505],"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.000028762037,0.000017074193,0.00021289673,0.00004866602,0.0000071156146,0.00015661177,0.00034093915,0.0006207433,0.0008493821,0.99197304,0.00067088625,0.0050740205],"study_design_scores_gemma":[0.000009215909,0.00001640277,0.00014698897,0.00001849301,0.00000806601,0.00022931812,0.0001501493,0.0021253552,0.0012777646,0.99171317,0.004291119,0.000013968513],"about_ca_topic_score_codex":0.0004419022,"about_ca_topic_score_gemma":0.0005414514,"teacher_disagreement_score":0.005490063,"about_ca_system_score_codex":0.00090802065,"about_ca_system_score_gemma":0.00040831396,"threshold_uncertainty_score":0.018366098},"labels":[],"label_agreement":null},{"id":"W4391148175","doi":"10.55016/ojs/cdm.v18i2.74005","title":"Structural theory of trees II. Completeness and completions of trees","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Completeness (order theory); Combinatorics; Discrete mathematics","score_opus":0.028014663443532727,"score_gpt":0.2949397485622686,"score_spread":0.2669250851187359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148175","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.124057174,0.006638513,0.7956619,0.003460148,0.00020576383,0.0001560212,0.001545813,0.0005029931,0.06777176],"genre_scores_gemma":[0.7254512,0.0039355764,0.24309674,0.0005693818,0.00053928146,0.0002766482,0.0022716313,0.00017739878,0.023682244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851304,0.00037042404,0.00010066264,0.00033396605,0.0005155537,0.00016629847],"domain_scores_gemma":[0.9968368,0.0015092124,0.0002714395,0.00045841234,0.00056024356,0.000363861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002271403,0.00046506737,0.00068114355,0.0017490317,0.0013596831,0.0032364875,0.0010183384,0.00081341894,0.0031583195],"category_scores_gemma":[0.003518799,0.00055403216,0.0010880501,0.0016756043,0.0049228165,0.007851991,0.0015501028,0.0028772918,0.0007321063],"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.000010222186,0.000010150339,0.0001906783,0.000052926986,0.0000055505975,0.000023128328,0.00027783666,0.0017721702,0.00057959446,0.99317366,0.00082698895,0.003077076],"study_design_scores_gemma":[0.00000878971,0.000019743116,0.00029416132,0.000027847407,0.0000066357065,0.0000929738,0.0001916656,0.0059224046,0.0007709416,0.97916573,0.013488794,0.000010256278],"about_ca_topic_score_codex":0.0015750232,"about_ca_topic_score_gemma":0.0013712327,"teacher_disagreement_score":0.0032364875,"about_ca_system_score_codex":0.0018016205,"about_ca_system_score_gemma":0.001334181,"threshold_uncertainty_score":0.013071775},"labels":[],"label_agreement":null},{"id":"W4391148177","doi":"10.55016/ojs/cdm.v18i2.73702","title":"Further Rogers-Ramanujan type identities for modified lattice paths","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Ramanujan's sum; Type (biology); Lattice (music); Biology; Paleontology; Physics","score_opus":0.061742362360772435,"score_gpt":0.38184891160686896,"score_spread":0.3201065492460965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148177","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.19467443,0.0010465108,0.5376217,0.0011361847,0.0015519824,0.00027303965,0.00040411716,0.0004333941,0.26285863],"genre_scores_gemma":[0.65038216,0.0010030861,0.2414348,0.0008273057,0.0005120854,0.00028799957,0.00032421033,0.00026237994,0.10496594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886334,0.00022721502,0.0000707096,0.00019239952,0.0004806831,0.00016565973],"domain_scores_gemma":[0.99910885,0.0002332,0.0001466922,0.00017422106,0.00023256814,0.00010436225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011000244,0.0007173988,0.0004340968,0.0015408604,0.0010599435,0.0024404933,0.001020512,0.001084792,0.00902117],"category_scores_gemma":[0.0024983624,0.00032707752,0.0012365715,0.0008663032,0.001750926,0.0047035837,0.0017132505,0.0024732442,0.0018660707],"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.000009640395,0.000013288375,0.000103417704,0.000019550353,0.0000040317545,0.00009517432,0.00010870036,0.00062173593,0.0018513979,0.9913229,0.0004859965,0.0053642504],"study_design_scores_gemma":[0.000013639768,0.000028045768,0.000264616,0.000019503885,0.000011337892,0.0005112166,0.00009389449,0.00757826,0.0036319753,0.96656334,0.021246947,0.000037321195],"about_ca_topic_score_codex":0.00044964647,"about_ca_topic_score_gemma":0.0006351398,"teacher_disagreement_score":0.00902117,"about_ca_system_score_codex":0.000920489,"about_ca_system_score_gemma":0.0007975883,"threshold_uncertainty_score":0.030178785},"labels":[],"label_agreement":null},{"id":"W4391148179","doi":"10.55016/ojs/cdm.v18i2.74004","title":"Structural theory of trees I. Branching and condensations of trees","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Branching (polymer chemistry); Mathematics; Combinatorics; Tree (set theory); Chemistry","score_opus":0.02636778410779442,"score_gpt":0.3287260191071142,"score_spread":0.30235823499931974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148179","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.071910195,0.030066084,0.747219,0.0046532536,0.00079050893,0.00012672349,0.0011181022,0.00050385756,0.14361227],"genre_scores_gemma":[0.7636861,0.018638156,0.18941891,0.0015993797,0.0016263766,0.00026943602,0.0011725178,0.0002258568,0.023363248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919254,0.00023886816,0.000046621586,0.00019501094,0.00023471317,0.00009229744],"domain_scores_gemma":[0.999059,0.00045261817,0.00014085561,0.00012735164,0.00012259041,0.00009761474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000737527,0.00045668424,0.000430313,0.0013120095,0.0010566143,0.0026082748,0.00081288855,0.0010305052,0.00419854],"category_scores_gemma":[0.0020390956,0.00041107088,0.0008550924,0.0021413167,0.0052912226,0.0048800954,0.0013828719,0.0020388386,0.0010658564],"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.0000055658134,0.000004281986,0.00009311464,0.000056525703,0.0000033459578,0.000021765432,0.00021993568,0.0009905488,0.00096643466,0.99355316,0.0006907278,0.0033946198],"study_design_scores_gemma":[0.000005318385,0.000020211826,0.00017820766,0.000043584663,0.0000055849955,0.000107319494,0.00011492791,0.0034831974,0.0007257682,0.9721453,0.023161553,0.000009069745],"about_ca_topic_score_codex":0.0009344777,"about_ca_topic_score_gemma":0.00073232816,"teacher_disagreement_score":0.00419854,"about_ca_system_score_codex":0.0018987366,"about_ca_system_score_gemma":0.0006267635,"threshold_uncertainty_score":0.0140455365},"labels":[],"label_agreement":null},{"id":"W4391148181","doi":"10.55016/ojs/cdm.v18i2.73022","title":"On signs of certain Toeplitz-Hessenberg determinants whose elements involve Bernoulli numbers","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toeplitz matrix; Mathematics; Bernoulli's principle; Combinatorics; Bernoulli number; Pure mathematics","score_opus":0.06309121257354112,"score_gpt":0.39221205056856345,"score_spread":0.32912083799502234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148181","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.5931232,0.0013173433,0.24226144,0.0011290212,0.0007125733,0.000068712856,0.00020364783,0.00035060858,0.16083342],"genre_scores_gemma":[0.9620347,0.0006152052,0.01831022,0.00018128654,0.00017557626,0.00004077782,0.00008328725,0.0001189835,0.018439919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960333,0.00010196831,0.00001789034,0.000052221618,0.00015836417,0.000066294866],"domain_scores_gemma":[0.9986707,0.0005714159,0.00021972647,0.00007455156,0.00031140563,0.00015219674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006482614,0.00046330743,0.0003874246,0.0013451484,0.00046083448,0.0017029982,0.0004676092,0.0005993256,0.0064981924],"category_scores_gemma":[0.005497191,0.0002240072,0.00028992412,0.0009207039,0.0018403296,0.0021121528,0.0006912378,0.001324794,0.0009957881],"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.000029314675,0.000017819004,0.00041784026,0.000028618048,0.0000036502383,0.0001805521,0.000119462224,0.00123517,0.0036093416,0.98356414,0.0007735134,0.010020596],"study_design_scores_gemma":[0.000015600726,0.000043169865,0.0012398534,0.000027076114,0.000008248712,0.0005367309,0.00010719192,0.02121352,0.005595847,0.9671737,0.003996844,0.00004226981],"about_ca_topic_score_codex":0.00027842566,"about_ca_topic_score_gemma":0.0002829792,"teacher_disagreement_score":0.0064981924,"about_ca_system_score_codex":0.00048912456,"about_ca_system_score_gemma":0.00044511087,"threshold_uncertainty_score":0.021738589},"labels":[],"label_agreement":null},{"id":"W4391148187","doi":"10.55016/ojs/cdm.v18i2.70912","title":"Total dominator total coloring of a graph","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Fractional coloring; List coloring; Complete coloring; Total coloring; Edge coloring; Graph coloring; Greedy coloring; Graph; Graph power; Line graph","score_opus":0.012886857894524775,"score_gpt":0.27473355643379,"score_spread":0.26184669853926523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148187","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.5710056,0.0009863484,0.366357,0.0006290181,0.0000973379,0.000076607656,0.0012892897,0.0003845739,0.059174333],"genre_scores_gemma":[0.90821606,0.0010216605,0.07146681,0.00022072857,0.00007863469,0.00007078469,0.001007178,0.0001417932,0.017776283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995523,0.00009293945,0.000016966822,0.00012639476,0.00009862672,0.00011275981],"domain_scores_gemma":[0.99885714,0.00054471416,0.00009319716,0.00018349239,0.00020132793,0.00012001679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042533726,0.00039443249,0.00035600242,0.000908349,0.0009058448,0.0012441931,0.0004720996,0.0002778685,0.0033105607],"category_scores_gemma":[0.0010809633,0.00021881566,0.00033054673,0.0014289566,0.00091298594,0.0012896709,0.00062902167,0.00056912814,0.00025246604],"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.00016340213,0.00005846135,0.0046528475,0.00029890522,0.000066576125,0.00021898153,0.0007118615,0.052909825,0.020842452,0.8717433,0.0069047892,0.041428495],"study_design_scores_gemma":[0.000041999607,0.000121732184,0.003691992,0.000050221424,0.00007456655,0.00079355587,0.0004942134,0.1485517,0.0110248,0.7975114,0.037607323,0.00003643738],"about_ca_topic_score_codex":0.002380016,"about_ca_topic_score_gemma":0.003563374,"teacher_disagreement_score":0.0033105607,"about_ca_system_score_codex":0.0013272883,"about_ca_system_score_gemma":0.0006759591,"threshold_uncertainty_score":0.01107496},"labels":[],"label_agreement":null},{"id":"W4391148188","doi":"10.55016/ojs/cdm.v18i2.73497","title":"q-Analogues of $\\pi$-Series by Applying Carlitz Inversions to q-Pfaff-Saalschutz Theorem","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Series (stratigraphy); Pure mathematics; Combinatorics; Geometry","score_opus":0.033504270999982905,"score_gpt":0.34612237007474433,"score_spread":0.31261809907476146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148188","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.17294158,0.0015085095,0.4446939,0.001749631,0.0018899684,0.00015898603,0.00018764546,0.00054322835,0.3763265],"genre_scores_gemma":[0.79489493,0.0017348767,0.13380916,0.00093969225,0.001347589,0.00020438478,0.00017816237,0.00038350958,0.06650776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992617,0.00013765067,0.00007877175,0.00011874222,0.0002945975,0.000108637236],"domain_scores_gemma":[0.9988136,0.00039715186,0.00015431437,0.00017028801,0.0003452994,0.000119402735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016529426,0.00080220593,0.00048225682,0.002167526,0.0018041881,0.0025356973,0.0012772292,0.0006645594,0.008555608],"category_scores_gemma":[0.0042197756,0.00028378458,0.0010471735,0.0011463789,0.0035387839,0.0044881245,0.0019798807,0.0030519902,0.002136836],"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.000007997238,0.000010885864,0.00008849448,0.000015088696,0.0000015767904,0.000079007026,0.00014845753,0.00017782688,0.00076198706,0.9938883,0.00042265208,0.004397777],"study_design_scores_gemma":[0.000010320287,0.000024489362,0.00020976638,0.000023595003,0.000008248863,0.00025751017,0.00009581465,0.0038821201,0.003360828,0.9802045,0.011903664,0.00001906475],"about_ca_topic_score_codex":0.00057327613,"about_ca_topic_score_gemma":0.0006967636,"teacher_disagreement_score":0.008555608,"about_ca_system_score_codex":0.0013330025,"about_ca_system_score_gemma":0.00097284233,"threshold_uncertainty_score":0.028621376},"labels":[],"label_agreement":null},{"id":"W4396627085","doi":"10.55016/ojs/cdm.v19i1","title":"Prime 2-structures","year":2024,"lang":"en","type":"paratext","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Université de Nantes","keywords":"Mathematics; Combinatorics; Prime (order theory)","score_opus":0.025313247317834218,"score_gpt":0.3304641257187605,"score_spread":0.30515087840092625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396627085","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.006444527,0.004973001,0.011387651,0.013948716,0.006408273,0.000050938197,0.0015893461,0.0005824974,0.9546151],"genre_scores_gemma":[0.06846923,0.0042705475,0.0051389867,0.001962931,0.005652085,0.00012269939,0.0016670822,0.00037680924,0.9123396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933916,0.00018826952,0.000018780927,0.00016797562,0.00021620622,0.000069576214],"domain_scores_gemma":[0.9991605,0.00037017214,0.000046411682,0.000095233314,0.00017884452,0.00014873056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011097356,0.0010566134,0.00091794075,0.0014229444,0.0018944102,0.0063959495,0.00070569065,0.001350356,0.21973972],"category_scores_gemma":[0.0023464195,0.00027734842,0.00052078353,0.0018112935,0.0012809236,0.0045611295,0.0023215008,0.003010236,0.04888895],"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.000080338454,0.0000517968,0.00018452828,0.00021600822,0.000009795957,0.00008904231,0.00023832858,0.00058786315,0.00082594075,0.7097145,0.24633335,0.041668624],"study_design_scores_gemma":[0.000027378423,0.000028961478,0.0005407052,0.00010576589,0.0000110515275,0.0001340824,0.00010632748,0.0009806283,0.00062474946,0.37727574,0.6201514,0.00001324856],"about_ca_topic_score_codex":0.00075181486,"about_ca_topic_score_gemma":0.0011007919,"teacher_disagreement_score":0.21973972,"about_ca_system_score_codex":0.0028040214,"about_ca_system_score_gemma":0.0011516173,"threshold_uncertainty_score":0.7351026},"labels":[],"label_agreement":null},{"id":"W4396627087","doi":"10.55016/ojs/cdm.v19i1.73551","title":"Prime 2-structures","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Prime (order theory)","score_opus":0.023146051329267083,"score_gpt":0.3225657235785452,"score_spread":0.2994196722492781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396627087","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.32496333,0.0019712832,0.41309834,0.0013676564,0.00075256656,0.00025025144,0.0018749109,0.0010524617,0.25466916],"genre_scores_gemma":[0.84706503,0.0009085144,0.10466676,0.00068195834,0.0004085626,0.00017214131,0.0009587465,0.00018148866,0.044956688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993741,0.00012348472,0.000041413354,0.00021969217,0.00012670107,0.00011455474],"domain_scores_gemma":[0.9991722,0.00021022657,0.00013843345,0.00016851535,0.00016170286,0.00014885944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056408165,0.00043044589,0.00044004864,0.0012765396,0.0012991169,0.0024398572,0.0006322788,0.00069870165,0.012208615],"category_scores_gemma":[0.0011773446,0.0004158312,0.00065552106,0.0008007106,0.0018196651,0.004298514,0.0016615062,0.0011954323,0.0019411655],"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.000028396957,0.000015648884,0.00019844748,0.000037962094,0.000006257479,0.00012798028,0.00016346588,0.00054769183,0.0010753663,0.98887223,0.001201165,0.0077252947],"study_design_scores_gemma":[0.000016648952,0.000035787834,0.00024643005,0.00001702962,0.000008642571,0.0003342675,0.00006652745,0.0018976748,0.0011922067,0.97306496,0.023104686,0.000015018989],"about_ca_topic_score_codex":0.00032313567,"about_ca_topic_score_gemma":0.00040735348,"teacher_disagreement_score":0.012208615,"about_ca_system_score_codex":0.0006958529,"about_ca_system_score_gemma":0.0004351796,"threshold_uncertainty_score":0.040841877},"labels":[],"label_agreement":null},{"id":"W4400596696","doi":"10.55016/ojs/cdm.v13i2.62733","title":"The Complexity of Power Graphs Associated With Finite Groups","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; King Saud University; Division of Mathematical Sciences; Kent State University","keywords":"Combinatorics; Mathematics; Clique graph; Vertex (graph theory); Graph; Finite group; Simplex graph; Discrete mathematics; Split graph; Simple graph; Clique; Graph power; Group (periodic table); Line graph; Pathwidth","score_opus":0.014652087546509748,"score_gpt":0.23763441569815247,"score_spread":0.2229823281516427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596696","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.93857604,0.00058925414,0.04547091,0.0019393301,0.00004017186,0.00005401077,0.0008142995,0.000103342645,0.012412619],"genre_scores_gemma":[0.9870133,0.00038709404,0.008482003,0.00010096565,0.00014692644,0.00007962642,0.00061058946,0.000044538087,0.0031349119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983835,0.00038598923,0.00006926292,0.00032773308,0.0005638335,0.00026965298],"domain_scores_gemma":[0.9877038,0.009007031,0.0012285999,0.0007035865,0.000585976,0.0007709403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009839339,0.0005184648,0.00088362786,0.0022447351,0.0010519656,0.003941921,0.0016536076,0.0013537039,0.004762641],"category_scores_gemma":[0.008564479,0.00044929655,0.0006938752,0.0018601763,0.0034178167,0.007636509,0.0021531365,0.0017400515,0.000267152],"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.00044905473,0.00016368678,0.009623357,0.00034824468,0.00007839455,0.0004740293,0.0018441934,0.06494661,0.0058176047,0.89258647,0.003984685,0.019683694],"study_design_scores_gemma":[0.000036653804,0.000027592223,0.002652008,0.000022261698,0.000018435647,0.0002209761,0.00031561672,0.10209175,0.0013168254,0.89161444,0.0016541951,0.0000292299],"about_ca_topic_score_codex":0.0014010427,"about_ca_topic_score_gemma":0.0012089245,"teacher_disagreement_score":0.004762641,"about_ca_system_score_codex":0.002580753,"about_ca_system_score_gemma":0.00071063347,"threshold_uncertainty_score":0.01872474},"labels":[],"label_agreement":null},{"id":"W4400596698","doi":"10.55016/ojs/cdm.v14i1.62415","title":"Feedback vertex number of Sierpi\\'{n}ski-type graphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Upper and lower bounds; Clique number; Wheel graph; Discrete mathematics; Graph power; Line graph","score_opus":0.016495107194708706,"score_gpt":0.32924276054402213,"score_spread":0.3127476533493134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596698","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.868992,0.00037908106,0.09936645,0.0004659918,0.00007142993,0.00007079192,0.0010171667,0.0009164166,0.028720768],"genre_scores_gemma":[0.98042715,0.00023656327,0.014627642,0.00007884566,0.000030414267,0.00011130075,0.00049273705,0.00007040689,0.003925051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972075,0.00004082362,0.000013038659,0.00006519876,0.00007755788,0.00008264115],"domain_scores_gemma":[0.9984896,0.00072298537,0.00021664402,0.00013264862,0.0001752935,0.00026274446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002728574,0.00038682378,0.00037756303,0.00076971314,0.0007145733,0.000682209,0.0009921759,0.0005611115,0.005334082],"category_scores_gemma":[0.002270851,0.000184486,0.0002697691,0.00056216394,0.00080484635,0.0012065931,0.0005134622,0.0006242858,0.0004555842],"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.0009885196,0.00026694412,0.0061182776,0.0006122728,0.00005010279,0.0005639314,0.00078941346,0.11575088,0.13136321,0.65766186,0.008610642,0.07722396],"study_design_scores_gemma":[0.00014310097,0.00030865922,0.0053532966,0.00009502238,0.00007382241,0.00060446485,0.00035208327,0.5132164,0.05397228,0.41641617,0.009381137,0.00008362328],"about_ca_topic_score_codex":0.00146197,"about_ca_topic_score_gemma":0.0034300294,"teacher_disagreement_score":0.005334082,"about_ca_system_score_codex":0.00113365,"about_ca_system_score_gemma":0.0006255091,"threshold_uncertainty_score":0.01784426},"labels":[],"label_agreement":null},{"id":"W4400596699","doi":"10.55016/ojs/cdm.v13i2.62378","title":"Decomposition of the complete bipartite graph with a 1-factor removed into paths and stars","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Combinatorics; Bipartite graph; Mathematics; Complete bipartite graph; Decomposition; Disjoint sets; Star (game theory); Stars; Graph; Path (computing); Discrete mathematics; Chemistry; Physics; Computer science; Astrophysics","score_opus":0.007471612639337897,"score_gpt":0.23914193056462946,"score_spread":0.23167031792529155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596699","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.2627471,0.0005679208,0.6998129,0.0004936791,0.000077800476,0.00017672933,0.0018756138,0.00029348713,0.03395481],"genre_scores_gemma":[0.724382,0.00057514734,0.25493532,0.00020685646,0.000082960934,0.00020323117,0.0031348553,0.00010871086,0.016370878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945575,0.00012659232,0.00003240205,0.00015854916,0.0001091979,0.00011744443],"domain_scores_gemma":[0.9990619,0.00025729492,0.00014959494,0.00014874878,0.00020488215,0.00017764975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047425786,0.00054284476,0.00038779448,0.0008402038,0.0005575776,0.0008780483,0.0003945128,0.0004292862,0.0034822444],"category_scores_gemma":[0.0013176367,0.0003256236,0.00057309936,0.0006348142,0.0007716196,0.0010935554,0.00094431493,0.0007967523,0.0006262649],"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.00052916113,0.00013796927,0.0025348205,0.0003334282,0.00009237993,0.00072359695,0.0004455353,0.0684894,0.032985006,0.83097845,0.010558667,0.05219152],"study_design_scores_gemma":[0.000102162965,0.00017899525,0.003082261,0.00010525117,0.000070024325,0.0013590821,0.00040279952,0.24488916,0.007576412,0.72293884,0.01924893,0.000046092966],"about_ca_topic_score_codex":0.0019106868,"about_ca_topic_score_gemma":0.0022745174,"teacher_disagreement_score":0.0034822444,"about_ca_system_score_codex":0.00069473765,"about_ca_system_score_gemma":0.0007624228,"threshold_uncertainty_score":0.011649311},"labels":[],"label_agreement":null},{"id":"W4400596703","doi":"10.55016/ojs/cdm.v14i1.62676","title":"Sun toughness and $P_{\\geq3}$-factors in graphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Combinatorics; Graph; Mathematics; Discrete mathematics","score_opus":0.014420542068680871,"score_gpt":0.3067048240553862,"score_spread":0.2922842819867053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596703","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.7357979,0.0037162653,0.21200515,0.0016118415,0.00032426303,0.00016694145,0.0018471968,0.0008611043,0.0436693],"genre_scores_gemma":[0.95362747,0.0015424722,0.03032533,0.00024695563,0.0003988156,0.0001576874,0.0014150931,0.00026541966,0.012020733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998654,0.00019656231,0.00007128649,0.00045754726,0.0002730627,0.00034747345],"domain_scores_gemma":[0.99658847,0.0012197624,0.00079279154,0.00025694544,0.00026736245,0.0008747403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007209507,0.0013620418,0.00087509496,0.0024228734,0.0018906703,0.002425859,0.0011015853,0.0010230308,0.012226962],"category_scores_gemma":[0.0034177825,0.00065425655,0.0011042078,0.0021075946,0.0032483232,0.005044622,0.0021734403,0.0017170087,0.0010368485],"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.0005094243,0.00019271816,0.010568218,0.0005149448,0.00010149026,0.0007973648,0.0021973723,0.036594883,0.010823192,0.8645382,0.013874549,0.059287623],"study_design_scores_gemma":[0.000042079606,0.00015783848,0.00877141,0.00012358828,0.000057729274,0.0010871191,0.0009380727,0.06426939,0.0039720456,0.8928718,0.027588481,0.00012045096],"about_ca_topic_score_codex":0.0027666537,"about_ca_topic_score_gemma":0.0022702299,"teacher_disagreement_score":0.012226962,"about_ca_system_score_codex":0.0015379288,"about_ca_system_score_gemma":0.000514673,"threshold_uncertainty_score":0.04090327},"labels":[],"label_agreement":null},{"id":"W4400596706","doi":"10.55016/ojs/cdm.v13i2.62416","title":"A lower bound on the hypergraph Ramsey number R(4,5;3)","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ramsey's theorem; Hypergraph; Combinatorics; Mathematics; Set (abstract data type); Element (criminal law); Upper and lower bounds; Discrete mathematics; Graph; Computer science","score_opus":0.022868031830504846,"score_gpt":0.3238653703416144,"score_spread":0.30099733851110955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596706","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.23019879,0.006341376,0.41923395,0.01975465,0.00096085697,0.0003682065,0.0054799593,0.008354877,0.30930743],"genre_scores_gemma":[0.7679588,0.001921922,0.19828378,0.0030418981,0.0003563462,0.0004161487,0.0022380524,0.0011047099,0.024678295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971276,0.00072148367,0.00011788696,0.00067316595,0.0007112383,0.00064865634],"domain_scores_gemma":[0.9859314,0.010792387,0.00043806105,0.001599646,0.00060309266,0.0006354093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032838462,0.0010219943,0.0011170508,0.0011732907,0.0015652396,0.0033956312,0.0025403982,0.0016709189,0.02701426],"category_scores_gemma":[0.0127591025,0.0006255431,0.0014115954,0.0011461366,0.0019749685,0.008771921,0.0025115174,0.0038096213,0.004425083],"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.0016800542,0.00042146206,0.002600298,0.0010119282,0.00016113615,0.0004219821,0.0006016273,0.067911945,0.021861125,0.7155559,0.05290896,0.13486359],"study_design_scores_gemma":[0.00016578987,0.0003091897,0.0015087215,0.00022628612,0.00015602227,0.0007954007,0.00025052606,0.16321088,0.019692514,0.7599991,0.05357638,0.00010915674],"about_ca_topic_score_codex":0.0020146882,"about_ca_topic_score_gemma":0.004301103,"teacher_disagreement_score":0.02701426,"about_ca_system_score_codex":0.0026606356,"about_ca_system_score_gemma":0.002466069,"threshold_uncertainty_score":0.09037167},"labels":[],"label_agreement":null},{"id":"W4400596709","doi":"10.55016/ojs/cdm.v13i2.62731","title":"Small on-line Ramsey numbers---a new approach","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Generalization; Line (geometry); Discrete mathematics; Graph","score_opus":0.07199690665834285,"score_gpt":0.3478691049751285,"score_spread":0.27587219831678567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596709","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.02711509,0.0009424423,0.95594406,0.0005465995,0.0002496852,0.00009220459,0.00012675267,0.0011262832,0.013856895],"genre_scores_gemma":[0.34670788,0.0010110008,0.6419624,0.00040729967,0.00042380524,0.00029591608,0.00032691105,0.00073415035,0.008130618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828905,0.0006777897,0.0000801808,0.00034288538,0.0005025998,0.000107494714],"domain_scores_gemma":[0.99547464,0.0019706213,0.0002932572,0.0014191525,0.00062309427,0.00021923518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019138969,0.00092400383,0.00085393625,0.002588447,0.0008022334,0.00227607,0.0029436857,0.0010490143,0.008586513],"category_scores_gemma":[0.009757174,0.0005354742,0.00077205064,0.0010370762,0.0014794519,0.008491756,0.003036973,0.0022661272,0.0018675277],"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.00027762385,0.0002695086,0.002335108,0.00050862844,0.00010049032,0.00025647742,0.00032827308,0.09707888,0.01501751,0.63868785,0.008636411,0.2365032],"study_design_scores_gemma":[0.000036598914,0.00012507466,0.00043721055,0.00006061953,0.000019444322,0.0002844644,0.00014932404,0.41079304,0.007524722,0.5618306,0.018682031,0.000056899113],"about_ca_topic_score_codex":0.00076191407,"about_ca_topic_score_gemma":0.00085343275,"teacher_disagreement_score":0.008586513,"about_ca_system_score_codex":0.0010282241,"about_ca_system_score_gemma":0.00072899566,"threshold_uncertainty_score":0.02872479},"labels":[],"label_agreement":null},{"id":"W4400596715","doi":"10.55016/ojs/cdm.v13i2.62729","title":"On the order of appearance of product of consecutive Fibonacci numbers","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Silpakorn University; Thailand Research Fund; Institute for the Promotion of Teaching Science and Technology","keywords":"Combinatorics; Fibonacci number; Order (exchange); Integer (computer science); Product (mathematics); Mathematics; Physics; Geometry; Computer science","score_opus":0.008473039852822684,"score_gpt":0.3024948939827146,"score_spread":0.29402185412989196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596715","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.3841211,0.0027004133,0.35345545,0.0018754319,0.0016366811,0.00021415182,0.00078003353,0.0011293569,0.25408727],"genre_scores_gemma":[0.85667026,0.0014734715,0.11116324,0.00072344474,0.0004624111,0.00024622373,0.00069601403,0.00048155832,0.028083313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982986,0.0003187555,0.0001115134,0.00030217587,0.00061482884,0.0003541693],"domain_scores_gemma":[0.9963814,0.0017700585,0.00032327944,0.000421375,0.0008442016,0.00025970215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016013158,0.00071140553,0.00057352777,0.0017014398,0.001991339,0.0030761154,0.0012323604,0.0009429224,0.0074026147],"category_scores_gemma":[0.007967255,0.0006878049,0.0007624563,0.0012490435,0.0024875943,0.0044336347,0.0014022579,0.0022442695,0.0021131136],"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.00025396192,0.000045476183,0.0022376007,0.00015747301,0.000012326538,0.00083316973,0.00064370764,0.0019773904,0.010904801,0.9528588,0.005209691,0.024865653],"study_design_scores_gemma":[0.00008614597,0.00034893828,0.0035665503,0.00017271301,0.00008076297,0.0027813844,0.00049349316,0.04797099,0.026219,0.8585999,0.059527103,0.00015298693],"about_ca_topic_score_codex":0.0013041421,"about_ca_topic_score_gemma":0.0016739052,"teacher_disagreement_score":0.0074026147,"about_ca_system_score_codex":0.0012976694,"about_ca_system_score_gemma":0.0009711527,"threshold_uncertainty_score":0.02476424},"labels":[],"label_agreement":null},{"id":"W4400596716","doi":"10.55016/ojs/cdm.v13i1.62554","title":"Some inequalities for orderings of acyclic digraphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Order (exchange); Partially ordered set; Class (philosophy); Dimension (graph theory); Comparability; Discrete mathematics","score_opus":0.028690178979588993,"score_gpt":0.351742915839808,"score_spread":0.323052736860219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596716","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.13033766,0.0066553163,0.49076605,0.0061803693,0.00084395026,0.0004000613,0.009646997,0.0007868743,0.35438272],"genre_scores_gemma":[0.7500809,0.0055883015,0.18160461,0.0023844063,0.0013075822,0.0007184124,0.008589485,0.00052209914,0.049204282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681914,0.0006563157,0.00030224846,0.0006452676,0.0008279511,0.0007489072],"domain_scores_gemma":[0.98727965,0.009002374,0.0008189441,0.000602097,0.0014376378,0.0008594193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029712585,0.0012945376,0.0007110328,0.0035617035,0.001742481,0.003556578,0.001536076,0.0009745074,0.019609548],"category_scores_gemma":[0.011225311,0.0007197185,0.0012169761,0.0042434563,0.0020115727,0.008093087,0.0020817807,0.0039495016,0.0016836205],"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.000085805055,0.000055272092,0.00091241807,0.00018538117,0.000022018496,0.00020272796,0.00031192673,0.0022150117,0.0010800208,0.96612084,0.0061565707,0.02265195],"study_design_scores_gemma":[0.000036700574,0.00006993751,0.0014225574,0.00013159121,0.000043200518,0.000298977,0.00024822776,0.01782742,0.0013829763,0.9493115,0.02919534,0.000031610245],"about_ca_topic_score_codex":0.005769531,"about_ca_topic_score_gemma":0.007775351,"teacher_disagreement_score":0.019609548,"about_ca_system_score_codex":0.0040511005,"about_ca_system_score_gemma":0.0012495713,"threshold_uncertainty_score":0.065600455},"labels":[],"label_agreement":null},{"id":"W4400596718","doi":"10.55016/ojs/cdm.v14i1.62428","title":"Cyclic Orthogonal Double Covers of Circulants by Certain Nerve Cell Graphs.","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Circulant matrix; Circulant graph; Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.01524160891194308,"score_gpt":0.2983028389239839,"score_spread":0.2830612300120408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596718","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.7196062,0.0012519604,0.19166747,0.0004620143,0.00032699198,0.000091077585,0.0003792595,0.0001717026,0.08604336],"genre_scores_gemma":[0.94419014,0.00081236725,0.040897615,0.00019521892,0.00015271004,0.00010382079,0.00050527765,0.00006294966,0.013079821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995431,0.0000776012,0.000015392356,0.00010282549,0.0001475183,0.000113591996],"domain_scores_gemma":[0.99942183,0.0001519081,0.00013807179,0.00008325893,0.00008134956,0.0001235916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016977104,0.0003911736,0.0002490634,0.0010375036,0.0012370521,0.0008962226,0.0004654455,0.0004483079,0.0036195612],"category_scores_gemma":[0.00077496696,0.00018980843,0.00031829832,0.0006463847,0.0011046265,0.0011575138,0.0011678399,0.0006981399,0.00030891947],"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.00006037031,0.000030031297,0.000824471,0.00008822801,0.000017186201,0.00042136048,0.00029629146,0.0030716932,0.014604122,0.9640621,0.0019297298,0.014594544],"study_design_scores_gemma":[0.00003401162,0.00013858207,0.0043437313,0.0000829383,0.00006661846,0.0030982723,0.00097361236,0.044437815,0.033863515,0.8371741,0.0757202,0.00006651758],"about_ca_topic_score_codex":0.0010566083,"about_ca_topic_score_gemma":0.0015278269,"teacher_disagreement_score":0.0036195612,"about_ca_system_score_codex":0.00054686074,"about_ca_system_score_gemma":0.00030485907,"threshold_uncertainty_score":0.012108624},"labels":[],"label_agreement":null},{"id":"W4400596720","doi":"10.55016/ojs/cdm.v13i1.62549","title":"A characterization of well-founced algebraic lattices","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Semilattice; Omega; Join (topology); Mathematics; Combinatorics; Corollary; Algebraic number; Lattice (music); Distributive lattice; Partially ordered set; Discrete mathematics; Pure mathematics; Distributive property; Physics","score_opus":0.012597248641765868,"score_gpt":0.28048196341450937,"score_spread":0.2678847147727435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596720","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.6424275,0.0010195336,0.33509934,0.00065601623,0.00009702946,0.00009787985,0.00040207122,0.00036739104,0.01983315],"genre_scores_gemma":[0.94871014,0.00021600004,0.046888184,0.000080973994,0.00007121166,0.000060715694,0.00025883224,0.000042819,0.0036711216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800926,0.0003857921,0.00017942674,0.00036510357,0.0007946187,0.0002658291],"domain_scores_gemma":[0.9951243,0.0015350153,0.00079955434,0.0005158297,0.0011625505,0.0008627585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018217249,0.00042111662,0.00031961984,0.001851967,0.0011055155,0.003933837,0.000780114,0.0005987552,0.0021511363],"category_scores_gemma":[0.0033511561,0.0004172207,0.0005225799,0.0008145638,0.0041921074,0.0055939765,0.0017934734,0.0016194693,0.00039944623],"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.00013553203,0.00008361688,0.0038575532,0.0001022122,0.000024973235,0.0003439377,0.0014857337,0.0053544384,0.022987267,0.95458895,0.0004115885,0.010624203],"study_design_scores_gemma":[0.00004847398,0.0003098157,0.003067983,0.000079606914,0.00005243532,0.0010764824,0.00203062,0.063830204,0.031869564,0.878837,0.018689618,0.000108263426],"about_ca_topic_score_codex":0.0005904723,"about_ca_topic_score_gemma":0.00090196356,"teacher_disagreement_score":0.003933837,"about_ca_system_score_codex":0.0011296523,"about_ca_system_score_gemma":0.0008027136,"threshold_uncertainty_score":0.009634316},"labels":[],"label_agreement":null},{"id":"W4400596723","doi":"10.55016/ojs/cdm.v13i2.62459","title":"Regularity in Weighted Graphs a Symmetric Function Approach","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Enumeration; Combinatorics; Scalar (mathematics); Generating function; Class (philosophy); Product (mathematics); Symmetric function; Stanley symmetric function; Finite set; Function (biology); Discrete mathematics; Ring of symmetric functions; Computer science; Mathematical analysis; Geometry","score_opus":0.024336946782796395,"score_gpt":0.318283688302708,"score_spread":0.29394674151991157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596723","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.52988666,0.0009441832,0.3806165,0.0011555633,0.0001382738,0.000040724906,0.00022510291,0.00023325128,0.08675978],"genre_scores_gemma":[0.9561467,0.000595414,0.027282635,0.00012616826,0.00021329518,0.000035293582,0.00013308116,0.00009032555,0.015376989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998104,0.00005950137,0.000009536685,0.000036632602,0.00005297373,0.000030987092],"domain_scores_gemma":[0.99948055,0.00022201188,0.000052224514,0.00009348818,0.00009421648,0.00005757871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005101356,0.00034114395,0.00029132393,0.0017129269,0.0004484359,0.0008591597,0.0005972278,0.00043757065,0.0030025525],"category_scores_gemma":[0.0013029396,0.00017017704,0.00055724266,0.0005898761,0.001023373,0.002350057,0.00070070376,0.000669659,0.0003859646],"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.000006168867,0.0000058000182,0.0001765062,0.000010984449,0.000002698479,0.000029124816,0.00004919425,0.0027023326,0.001544253,0.99143595,0.0002627731,0.003774337],"study_design_scores_gemma":[0.0000035011265,0.0000130877515,0.0002881448,0.000007748973,0.0000052476994,0.000077472396,0.000041505853,0.03765297,0.00075431186,0.95888996,0.0022586386,0.000007518804],"about_ca_topic_score_codex":0.00060743385,"about_ca_topic_score_gemma":0.0005125695,"teacher_disagreement_score":0.0030025525,"about_ca_system_score_codex":0.0006812169,"about_ca_system_score_gemma":0.00024319782,"threshold_uncertainty_score":0.010044515},"labels":[],"label_agreement":null},{"id":"W4400596724","doi":"10.55016/ojs/cdm.v15i1.62323","title":"Construction of strongly regular graphs having an automorphism group of composite order","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hrvatska Zaklada za Znanost","keywords":"Mathematics; Automorphism; Automorphism group; Combinatorics; Isomorphism (crystallography); Outer automorphism group; Order (exchange); Graph automorphism; Discrete mathematics; Group (periodic table); Inner automorphism; Generalization; Orbit (dynamics); Graph; Crystallography; Physics; Chemistry","score_opus":0.040214625618972245,"score_gpt":0.3332336608738456,"score_spread":0.29301903525487333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596724","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.24198282,0.00007606584,0.74396396,0.0001424166,0.00005930571,0.00017709754,0.00024499785,0.0011994304,0.012153884],"genre_scores_gemma":[0.6269883,0.00015331668,0.36556655,0.0000746807,0.000043272226,0.000119436416,0.0008175085,0.00027571173,0.0059612747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996346,0.000068880545,0.000022748036,0.000100667756,0.00011523115,0.00005783691],"domain_scores_gemma":[0.999094,0.00025832502,0.00010644999,0.00030936423,0.00014978433,0.000082024104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030142884,0.00036136314,0.0003105874,0.00076567347,0.0005555411,0.0005433961,0.00047371833,0.00026308754,0.002342517],"category_scores_gemma":[0.0012033501,0.00025420316,0.0007853613,0.0004054661,0.0008468453,0.0010950994,0.00075246673,0.00073281757,0.0005369543],"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.00027149418,0.00021550615,0.006789945,0.0003256784,0.00006380315,0.0009595463,0.0013133863,0.027700305,0.1648151,0.63470465,0.0039164987,0.15892407],"study_design_scores_gemma":[0.00007665368,0.00047125065,0.0053108153,0.00006534495,0.00014649765,0.0012123026,0.00069641415,0.14787745,0.13602714,0.66193527,0.046072964,0.0001078127],"about_ca_topic_score_codex":0.0005443925,"about_ca_topic_score_gemma":0.0009296431,"teacher_disagreement_score":0.002342517,"about_ca_system_score_codex":0.00036863057,"about_ca_system_score_gemma":0.0005085999,"threshold_uncertainty_score":0.007836521},"labels":[],"label_agreement":null},{"id":"W4400596725","doi":"10.55016/ojs/cdm.v15i1.62160","title":"The polar of convex lattice sets","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Convex hull; Combinatorics; Mathematics; Lattice (music); Polar; Convex set; Regular polygon; Convex polytope; Convex body; Convex analysis; Geometry; Physics; Convex optimization","score_opus":0.017744305992649007,"score_gpt":0.28703961189519955,"score_spread":0.2692953059025506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596725","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.21772404,0.003917176,0.5608694,0.0028589417,0.0006877306,0.00012245617,0.0018564708,0.00025823273,0.21170564],"genre_scores_gemma":[0.9055338,0.0040502143,0.06738248,0.0005118361,0.0007508283,0.00020905987,0.0016485836,0.0002142798,0.019698957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987841,0.00035147037,0.00006199249,0.00022948676,0.00041268853,0.00016017763],"domain_scores_gemma":[0.99811894,0.0008232631,0.00019926055,0.00012501843,0.00045057412,0.00028290914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011072751,0.000601661,0.0005832109,0.0021837687,0.001203666,0.0044737943,0.00062733813,0.00039683311,0.005229236],"category_scores_gemma":[0.0037975572,0.00044374054,0.0005010835,0.0015590851,0.005102851,0.005030511,0.002495988,0.0028569605,0.0013128351],"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.00005605442,0.0000062420345,0.00019794464,0.000040269966,0.000004684646,0.000048652968,0.00019678294,0.0012197202,0.0010115491,0.98971444,0.0010183338,0.0064854207],"study_design_scores_gemma":[0.000019843817,0.000038624665,0.00043943073,0.000043932992,0.000008122525,0.00022783021,0.0005640559,0.012283675,0.0026734066,0.9648081,0.018865196,0.000027830225],"about_ca_topic_score_codex":0.0011647608,"about_ca_topic_score_gemma":0.0005693069,"teacher_disagreement_score":0.005229236,"about_ca_system_score_codex":0.0012574226,"about_ca_system_score_gemma":0.000618967,"threshold_uncertainty_score":0.017493546},"labels":[],"label_agreement":null},{"id":"W4400596729","doi":"10.55016/ojs/cdm.v15i1.68264","title":"Some combinatorial properties of hexagonal lattices","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Enumeration; Bijection; Combinatorics; Hexagonal crystal system; Mathematics; Lattice (music); Hexagonal lattice; Order (exchange); Discrete mathematics; Crystallography; Condensed matter physics; Physics; Chemistry","score_opus":0.05046230563172189,"score_gpt":0.3203116130201553,"score_spread":0.26984930738843343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596729","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.71937066,0.0011273611,0.09657639,0.0010170857,0.00021250128,0.00008925048,0.00076430716,0.00019580679,0.18064663],"genre_scores_gemma":[0.97504336,0.0004584032,0.017103406,0.00017337721,0.0001602465,0.0000557982,0.00041103366,0.000038424,0.006555958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941194,0.00013780706,0.000031574342,0.00006688267,0.00022437281,0.00012747926],"domain_scores_gemma":[0.9989687,0.00035712533,0.00018793787,0.00012737048,0.00021657732,0.00014223656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042577967,0.00017795066,0.00025092062,0.0011897559,0.0012183372,0.0018048503,0.0003996521,0.00030895954,0.005153645],"category_scores_gemma":[0.0019218231,0.00020375679,0.00025330606,0.0010742515,0.001494374,0.0018589993,0.000758485,0.0006560198,0.0004187853],"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.000055738452,0.000026197587,0.001330995,0.00006423923,0.0000071092413,0.00014899962,0.00020604642,0.0027010185,0.0032755279,0.9751741,0.0016637723,0.015346205],"study_design_scores_gemma":[0.000033673878,0.000076135046,0.0025131411,0.00003099167,0.000012653961,0.00055804447,0.00059165247,0.019842174,0.0057218904,0.9539155,0.016670838,0.000033348253],"about_ca_topic_score_codex":0.0013222598,"about_ca_topic_score_gemma":0.0013125858,"teacher_disagreement_score":0.005153645,"about_ca_system_score_codex":0.00059572805,"about_ca_system_score_gemma":0.0003677648,"threshold_uncertainty_score":0.017240703},"labels":[],"label_agreement":null},{"id":"W4400596730","doi":"10.55016/ojs/cdm.v14i1.62700","title":"Proof of a conjecture of Z.W. Sun","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Conjecture; Combinatorics; Mathematics; Limit (mathematics); Sequence (biology); Discrete mathematics; Mathematical analysis; Chemistry","score_opus":0.015218124404647223,"score_gpt":0.324143688988716,"score_spread":0.3089255645840688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596730","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.15012014,0.010678123,0.10812199,0.2176184,0.01611216,0.00015656764,0.001963069,0.0009760425,0.49425358],"genre_scores_gemma":[0.87979984,0.004949534,0.026340393,0.020640489,0.008889896,0.0002602932,0.0012613748,0.00029701483,0.057561234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864894,0.00032663494,0.000057332367,0.00036126998,0.00039680698,0.0002090065],"domain_scores_gemma":[0.99357396,0.0038344224,0.00042765486,0.0006806084,0.0009722693,0.00051098166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001927207,0.0008114811,0.0010552624,0.0012576525,0.0024758289,0.0018843022,0.0010741,0.0013821003,0.013898438],"category_scores_gemma":[0.01220858,0.0005203124,0.0011049102,0.0015719674,0.0038143273,0.00578672,0.0035699406,0.0052424837,0.0021996128],"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.000118340235,0.0000689848,0.0010083402,0.00014661338,0.000025607153,0.00019725056,0.00037634533,0.0011686392,0.00062649045,0.9180829,0.06783396,0.010346585],"study_design_scores_gemma":[0.00006112301,0.00004488835,0.001084795,0.000067073925,0.000021429018,0.0002670044,0.00012367032,0.005486323,0.00070057396,0.9382074,0.053906366,0.00002947648],"about_ca_topic_score_codex":0.0020850552,"about_ca_topic_score_gemma":0.001336329,"teacher_disagreement_score":0.013898438,"about_ca_system_score_codex":0.0018824277,"about_ca_system_score_gemma":0.0010579152,"threshold_uncertainty_score":0.0464949},"labels":[],"label_agreement":null},{"id":"W4400596733","doi":"10.55016/ojs/cdm.v15i1.68111","title":"Closed formulas and identities on the Bell polynomials and falling factorials","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Mathematics; Expression (computer science); Falling (accident); Bessel function; Combinatorics; Bell polynomials; Pure mathematics; Mathematical analysis","score_opus":0.06137965349062514,"score_gpt":0.3260544114094571,"score_spread":0.264674757918832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596733","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.05742034,0.0016619352,0.80121064,0.0014911897,0.0010559687,0.00012326484,0.0002345189,0.00039424098,0.13640802],"genre_scores_gemma":[0.5957294,0.0020415427,0.35068265,0.0016417654,0.001277984,0.00037747947,0.00043141362,0.0006393485,0.047178376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803036,0.00042464872,0.0001605279,0.00028086925,0.00079464004,0.00030898623],"domain_scores_gemma":[0.99776673,0.00081693346,0.00022828302,0.0003211751,0.00067039375,0.00019657618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030050115,0.00145946,0.0011053786,0.0034241276,0.0023394101,0.0043816813,0.002165629,0.0022294002,0.009260682],"category_scores_gemma":[0.008367628,0.0007800574,0.001704036,0.002259886,0.0052263667,0.0075682355,0.0030916268,0.0041014403,0.0026986736],"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.000004415881,0.00000680031,0.00002652315,0.00001413481,0.0000021062783,0.00004065609,0.00011181529,0.00021664242,0.0003252132,0.995565,0.00055738376,0.003129299],"study_design_scores_gemma":[0.0000052124055,0.000008471276,0.000046530786,0.000016550228,0.000003556773,0.00011192076,0.00004724574,0.0038749059,0.00047359802,0.9927194,0.0026758993,0.000016687987],"about_ca_topic_score_codex":0.0008588543,"about_ca_topic_score_gemma":0.0008959182,"teacher_disagreement_score":0.009260682,"about_ca_system_score_codex":0.0017977469,"about_ca_system_score_gemma":0.0011137075,"threshold_uncertainty_score":0.03098005},"labels":[],"label_agreement":null},{"id":"W4400596734","doi":"10.55016/ojs/cdm.v13i2.62728","title":"Some remarks on the lonely runner conjecture","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Conjecture; Combinatorics; Mathematics; Constant (computer programming); Lonely runner conjecture; Upper and lower bounds; Unit (ring theory); Binary logarithm; Collatz conjecture; Mathematical analysis; Computer science","score_opus":0.013893580866742798,"score_gpt":0.2813669509504867,"score_spread":0.2674733700837439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596734","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.11660935,0.019438587,0.32007155,0.252528,0.016936393,0.00012352601,0.0015697309,0.0028074842,0.26991537],"genre_scores_gemma":[0.74750274,0.013915467,0.10009669,0.037234303,0.020494327,0.00035990233,0.0024844704,0.0012581164,0.07665401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683315,0.0010127196,0.00014334093,0.0007969467,0.0007295257,0.00048432942],"domain_scores_gemma":[0.9833061,0.0111978585,0.0008698603,0.0019517479,0.0015226131,0.0011518712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005758488,0.0013809536,0.0014440673,0.0013121188,0.0031402123,0.0023918333,0.0035837574,0.0029660382,0.024441421],"category_scores_gemma":[0.02079652,0.00057844585,0.0012015502,0.0019308259,0.005939946,0.013201057,0.003575004,0.006117212,0.0037055712],"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.00045951398,0.00013281517,0.003105686,0.00038660935,0.000048918675,0.00066842034,0.00078149495,0.010686294,0.0016466521,0.84892607,0.09845158,0.034705978],"study_design_scores_gemma":[0.00009904257,0.00016303419,0.0017702824,0.00013948312,0.000030808915,0.00034930906,0.00057538575,0.012004428,0.0010656118,0.9222404,0.06147469,0.000087527704],"about_ca_topic_score_codex":0.0030774875,"about_ca_topic_score_gemma":0.002210341,"teacher_disagreement_score":0.024441421,"about_ca_system_score_codex":0.0011875428,"about_ca_system_score_gemma":0.0006663561,"threshold_uncertainty_score":0.0817647},"labels":[],"label_agreement":null},{"id":"W4400596743","doi":"10.55016/ojs/cdm.v15i1.67935","title":"3-uniform hypergraphs: modular decomposition and realization by tournaments","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Realization (probability); Mathematics; Combinatorics; Modular design; Tournament; Decomposition; Discrete mathematics; Element (criminal law); Computer science","score_opus":0.00590559664333025,"score_gpt":0.23519904584602175,"score_spread":0.22929344920269149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596743","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.73547876,0.0004046938,0.23892699,0.0003913198,0.00006448135,0.00005856839,0.00037185964,0.00024245196,0.02406096],"genre_scores_gemma":[0.97183436,0.0001766556,0.024418684,0.00006586591,0.000056143996,0.00005939853,0.00025076736,0.000034643752,0.0031034313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996543,0.00007340528,0.000018871784,0.00008898911,0.000062581516,0.00010195299],"domain_scores_gemma":[0.9994598,0.00014981774,0.00012678518,0.00007923276,0.00005085508,0.00013350518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029295974,0.00033864434,0.0002879051,0.00058849994,0.00058098254,0.0013051821,0.00046685032,0.00050012727,0.003103868],"category_scores_gemma":[0.0009612862,0.0002804066,0.00052339316,0.00058287085,0.0008743598,0.0012967397,0.00087814534,0.00071377394,0.00031961408],"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.00015346533,0.00005586806,0.0014345335,0.00004480758,0.000019696214,0.000244227,0.00026110138,0.013972345,0.015667628,0.94934964,0.0013360238,0.017460681],"study_design_scores_gemma":[0.000049749626,0.000090754256,0.0025420603,0.000027741535,0.00002419127,0.00042963924,0.00018589555,0.10554119,0.006041318,0.87879133,0.006239606,0.00003659373],"about_ca_topic_score_codex":0.0006955055,"about_ca_topic_score_gemma":0.0007950758,"teacher_disagreement_score":0.003103868,"about_ca_system_score_codex":0.00065740704,"about_ca_system_score_gemma":0.00023530156,"threshold_uncertainty_score":0.010383546},"labels":[],"label_agreement":null},{"id":"W4400596744","doi":"10.55016/ojs/cdm.v15i1.62718","title":"An elementary, geometric proof of the non-existence of a projective plane of order 6","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Narodowym Centrum Nauki","keywords":"Projective plane; Mathematics; Elementary proof; Projective test; Order (exchange); Combinatorics; Plane (geometry); Collineation; Blocking set; Binary number; Line at infinity; Pure mathematics; Discrete mathematics; Projective space; Geometry; Arithmetic","score_opus":0.014683256317517292,"score_gpt":0.2749188379889225,"score_spread":0.26023558167140526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596744","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.086930886,0.002324456,0.6811306,0.009372746,0.0015628128,0.00015775241,0.00076044566,0.00054425024,0.21721609],"genre_scores_gemma":[0.76683503,0.0025491554,0.20049022,0.0023060795,0.0013807123,0.0002824623,0.0007511489,0.00019616468,0.025208898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923193,0.00015419802,0.00003400642,0.00013608005,0.00034045344,0.00010335654],"domain_scores_gemma":[0.99702257,0.0018808377,0.00022009603,0.00037122561,0.00033547386,0.00016974325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000977079,0.00091992924,0.0006367708,0.001004713,0.0013801121,0.0018202412,0.001543514,0.001122678,0.009909781],"category_scores_gemma":[0.0048921006,0.00054794416,0.00089686195,0.00053799764,0.0060565174,0.0047751134,0.005365774,0.004606762,0.0015396607],"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.000014720409,0.000018192299,0.00013168105,0.00008072064,0.0000071667832,0.00018049065,0.000102166836,0.0006549155,0.0016512788,0.99076414,0.0023707983,0.004023784],"study_design_scores_gemma":[0.0000330618,0.00006215147,0.0004661961,0.0000499283,0.000013293463,0.0006336543,0.00009507239,0.0025963983,0.0053188764,0.95506066,0.035639204,0.000031523276],"about_ca_topic_score_codex":0.00039296245,"about_ca_topic_score_gemma":0.00041367757,"teacher_disagreement_score":0.009909781,"about_ca_system_score_codex":0.0007590168,"about_ca_system_score_gemma":0.00067784055,"threshold_uncertainty_score":0.033151507},"labels":[],"label_agreement":null},{"id":"W4400596745","doi":"10.55016/ojs/cdm.v14i1.62673","title":"On 2-adic behavior of the number of domino tilings on torus","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission; National Natural Science Foundation of China","keywords":"Mathematics; Domino; Combinatorics; Torus; Invariant (physics); Analogy; Discrete mathematics; Geometry; Mathematical physics; Chemistry","score_opus":0.015374319386233775,"score_gpt":0.33304110345313276,"score_spread":0.31766678406689897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596745","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.9618853,0.00097156403,0.017437043,0.0006836902,0.00011061077,0.000015695905,0.00015964783,0.00011947381,0.018617027],"genre_scores_gemma":[0.9936475,0.0003412692,0.0032554665,0.000043211763,0.00011744718,0.000030926465,0.00013671449,0.000034282595,0.0023930988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999616,0.000088745364,0.0000207118,0.00008689784,0.00009266075,0.00009489614],"domain_scores_gemma":[0.99668914,0.0014199843,0.000869272,0.00017469945,0.00026188305,0.0005850301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007402132,0.0004774969,0.0005660151,0.0032414214,0.0011930685,0.0021417863,0.0008488031,0.00068534206,0.00415178],"category_scores_gemma":[0.005340649,0.0003442606,0.0004166041,0.0012125595,0.0027959517,0.0023132898,0.000986957,0.0007039235,0.00031060193],"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.00037806528,0.00008103741,0.008608082,0.00019541652,0.000044864257,0.0010276296,0.0009930991,0.044654503,0.01856826,0.9078324,0.0028147644,0.014801875],"study_design_scores_gemma":[0.00008329809,0.00018244989,0.010138015,0.00010199094,0.00004892351,0.0017862553,0.0007686745,0.30901137,0.0095725,0.66157806,0.006618285,0.00011022834],"about_ca_topic_score_codex":0.00081361464,"about_ca_topic_score_gemma":0.0007831887,"teacher_disagreement_score":0.00415178,"about_ca_system_score_codex":0.0013865331,"about_ca_system_score_gemma":0.00032917937,"threshold_uncertainty_score":0.013889134},"labels":[],"label_agreement":null},{"id":"W4400596747","doi":"10.55016/ojs/cdm.v14i1.62646","title":"Anchored Hyperspaces and Multigraphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Hyperspace; Multigraph; Mathematics; Combinatorics; Hausdorff distance; Metric (unit); Polytope; Space (punctuation); Metric space; Compact space; Set (abstract data type); Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.013491551134297869,"score_gpt":0.3278347807790937,"score_spread":0.3143432296447959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596747","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.43792075,0.005391573,0.46566966,0.0030071766,0.00030005677,0.00008441713,0.0009500484,0.00036496398,0.08631139],"genre_scores_gemma":[0.92297083,0.0015258819,0.06042477,0.00039604565,0.00019182885,0.00008938813,0.0005556912,0.00006832964,0.013777374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993591,0.00016432923,0.00003369989,0.00015674678,0.00019924725,0.000086971326],"domain_scores_gemma":[0.9989806,0.0003494334,0.00016685286,0.00012766995,0.0001409003,0.00023454233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004897756,0.0003836939,0.00032406833,0.0019541134,0.001258311,0.0019012947,0.00070420426,0.00079758227,0.0045366483],"category_scores_gemma":[0.0011824038,0.0003240955,0.0006540044,0.0014301519,0.0023949519,0.0033942098,0.003715153,0.0017299487,0.0003892319],"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.000009555483,0.000006150163,0.00016924953,0.000021208481,0.000008006192,0.00007972284,0.00016299091,0.0020087275,0.0007186968,0.9924499,0.00044109044,0.003924689],"study_design_scores_gemma":[0.0000063369794,0.00002304657,0.00060059316,0.000027046017,0.000009017888,0.00020196763,0.00032329754,0.0151558025,0.0005734971,0.97017866,0.012886272,0.000014641009],"about_ca_topic_score_codex":0.0017298466,"about_ca_topic_score_gemma":0.0017944273,"teacher_disagreement_score":0.0045366483,"about_ca_system_score_codex":0.0012507489,"about_ca_system_score_gemma":0.0003580982,"threshold_uncertainty_score":0.015176654},"labels":[],"label_agreement":null},{"id":"W4400596748","doi":"10.55016/ojs/cdm.v13i2.62732","title":"Arrangements of Homothets of a Convex Body II","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nemzeti Kutatási, Fejlesztési és Innovaciós Alap; Emberi Eroforrások Minisztériuma; Magyar Tudományos Akadémia","keywords":"Convex body; Combinatorics; Mathematics; Minkowski space; Regular polygon; Minkowski addition; Euclidean space; Boundary (topology); Center (category theory); Mixed volume; Sequence (biology); Convex set; Convex hull; Geometry; Mathematical analysis; Crystallography; Convex optimization; Chemistry","score_opus":0.03397938438709129,"score_gpt":0.3605655692135098,"score_spread":0.3265861848264185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596748","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.68923473,0.00053222675,0.23051867,0.0003981248,0.00024551395,0.00009392534,0.00043217398,0.0002441974,0.07830046],"genre_scores_gemma":[0.929531,0.00034506348,0.046946626,0.00011772298,0.0001213953,0.00008516848,0.0006267641,0.00012092836,0.022105377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993086,0.000084343825,0.00004433926,0.00019016639,0.00019108046,0.0001815266],"domain_scores_gemma":[0.99901724,0.00017873532,0.00023495236,0.00020583633,0.000139937,0.00022333013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036143875,0.00041309316,0.00047719612,0.0010722087,0.0015974424,0.0015113825,0.00066486094,0.00039661565,0.00913626],"category_scores_gemma":[0.0015185225,0.0004513887,0.00065890054,0.00064683764,0.0025490217,0.0015461169,0.0022390138,0.00152704,0.0012009249],"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.0002632305,0.00006171622,0.005203487,0.00010643125,0.000035331504,0.0006562166,0.0008152056,0.012531765,0.017671598,0.9137593,0.00341683,0.04547896],"study_design_scores_gemma":[0.000076029835,0.00033842784,0.011461491,0.00009292115,0.000046618825,0.0016529551,0.0019698357,0.064712696,0.0169111,0.8706796,0.0319741,0.00008425108],"about_ca_topic_score_codex":0.0012406169,"about_ca_topic_score_gemma":0.0010680442,"teacher_disagreement_score":0.00913626,"about_ca_system_score_codex":0.00072035147,"about_ca_system_score_gemma":0.000374739,"threshold_uncertainty_score":0.030563831},"labels":[],"label_agreement":null},{"id":"W4400596750","doi":"10.55016/ojs/cdm.v14i1.62399","title":"Hamiltonian paths in $m \\times n$ projective checkerboards","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Rectangle; Mathematics; Combinatorics; Projective plane; Square (algebra); Twist; Hamiltonian (control theory); Projective test; Checkerboard; Geometry; Pure mathematics","score_opus":0.004960986473503946,"score_gpt":0.23566436345648492,"score_spread":0.23070337698298096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596750","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.80620784,0.0006514455,0.13263634,0.0006061511,0.00016449929,0.00012960848,0.00097386615,0.0003642636,0.058265876],"genre_scores_gemma":[0.9461421,0.00028368467,0.039093174,0.0001313062,0.00003247921,0.00008034735,0.0005261984,0.000054392185,0.013656366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995152,0.00011082715,0.000026174606,0.00010699215,0.00007007328,0.00017074062],"domain_scores_gemma":[0.999166,0.00038832656,0.00017008543,0.00009572791,0.000059758982,0.00012013018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023104956,0.00043086812,0.00031764532,0.0006776139,0.0011241726,0.0016131412,0.0006951973,0.0007588953,0.010182174],"category_scores_gemma":[0.0013698674,0.00035836265,0.0003776626,0.00083685707,0.0012826829,0.0016618551,0.0013533765,0.0006792866,0.0005930535],"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.00037003125,0.00010952184,0.0018195218,0.00020928848,0.000055737688,0.001036988,0.00063484,0.044888593,0.010244151,0.89946777,0.0059113214,0.035252273],"study_design_scores_gemma":[0.0002490678,0.000148431,0.0023028075,0.000072746356,0.000035456585,0.00040986907,0.0005807746,0.11311982,0.0061657187,0.85979635,0.01706404,0.00005498955],"about_ca_topic_score_codex":0.003094925,"about_ca_topic_score_gemma":0.0050267703,"teacher_disagreement_score":0.010182174,"about_ca_system_score_codex":0.0009179522,"about_ca_system_score_gemma":0.000493809,"threshold_uncertainty_score":0.034062743},"labels":[],"label_agreement":null},{"id":"W4400596751","doi":"10.55016/ojs/cdm.v15i1.62708","title":"Latin Squares and their Bruhat Order","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Latin square; Mathematics; Combinatorics; Class (philosophy); Order (exchange); Relation (database); Cover (algebra); Computer science; Biology; Artificial intelligence","score_opus":0.010507876194894855,"score_gpt":0.2220730865490173,"score_spread":0.21156521035412246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596751","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.6986201,0.0017212817,0.1654931,0.0014575028,0.00019575463,0.00005773432,0.00027184706,0.0002724921,0.13191019],"genre_scores_gemma":[0.9491347,0.0006058022,0.027702248,0.00025553833,0.0003388925,0.000056392677,0.00029456324,0.000112190566,0.021499757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902356,0.00018312066,0.000034657347,0.00021417368,0.00031399995,0.00023041732],"domain_scores_gemma":[0.9978532,0.0011682606,0.0002792853,0.00025314646,0.00024489954,0.00020113135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040024598,0.00034496648,0.0005607832,0.0014668397,0.002018596,0.0019775124,0.0004732745,0.00079368445,0.005228499],"category_scores_gemma":[0.002477912,0.00040873667,0.00051510805,0.0008934504,0.0028077543,0.0030233515,0.0011963943,0.0015956365,0.0007867118],"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.00007788358,0.000019474237,0.000790434,0.00003638287,0.000009193882,0.00012390867,0.00033382996,0.0028846017,0.004111506,0.9827539,0.000751034,0.008107831],"study_design_scores_gemma":[0.000019706618,0.00006891595,0.001165774,0.000029721165,0.0000118089665,0.0003647469,0.00026047777,0.016227541,0.005062225,0.96031195,0.016449802,0.000027307222],"about_ca_topic_score_codex":0.0011660502,"about_ca_topic_score_gemma":0.0010624956,"teacher_disagreement_score":0.005228499,"about_ca_system_score_codex":0.0008280744,"about_ca_system_score_gemma":0.00035032822,"threshold_uncertainty_score":0.017491043},"labels":[],"label_agreement":null},{"id":"W4400596753","doi":"10.55016/ojs/cdm.v15i1.62385","title":"On the first two entries of the f-vectors of 6-polytopes","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Characterization (materials science); Physics","score_opus":0.008947915511209567,"score_gpt":0.2183748864401502,"score_spread":0.20942697092894064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596753","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.4101059,0.0048308065,0.34533298,0.0012825803,0.00079910154,0.00022289467,0.0030762472,0.0004941721,0.23385529],"genre_scores_gemma":[0.8221726,0.005031527,0.09729274,0.0004823883,0.00078220014,0.00032766713,0.003996736,0.00043128038,0.0694829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990227,0.000118926175,0.000048928374,0.0002195253,0.00032315342,0.00026674385],"domain_scores_gemma":[0.99897456,0.00032161965,0.00019527395,0.00008211777,0.00022929162,0.000197138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042852247,0.0013269704,0.0006279558,0.0026931406,0.0012175239,0.002706448,0.00078621303,0.0007249622,0.011847051],"category_scores_gemma":[0.0020394546,0.0004158665,0.0006250434,0.0022112022,0.0024376183,0.0031518135,0.0011477607,0.003373982,0.0039653108],"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.00014416348,0.00009895567,0.0009353018,0.00014131312,0.000014891053,0.00019501544,0.0003597283,0.0076760086,0.0053867446,0.9174469,0.008044895,0.05955596],"study_design_scores_gemma":[0.00004278233,0.0002778246,0.0039869514,0.00020343922,0.000021619562,0.00074059225,0.00059178454,0.041784804,0.008421284,0.8564554,0.08725234,0.00022118932],"about_ca_topic_score_codex":0.0019238959,"about_ca_topic_score_gemma":0.0010969505,"teacher_disagreement_score":0.011847051,"about_ca_system_score_codex":0.0008103344,"about_ca_system_score_gemma":0.0006537598,"threshold_uncertainty_score":0.03963232},"labels":[],"label_agreement":null},{"id":"W4400596754","doi":"10.55016/ojs/cdm.v15i1.62603","title":"Factorizations of complete graphs into cycles and 1-factors","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Focus (optics); Complete graph; Discrete mathematics","score_opus":0.015975935800053572,"score_gpt":0.24105505167068036,"score_spread":0.2250791158706268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596754","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.39345512,0.0020757937,0.5169413,0.00069640536,0.0003079518,0.00024184813,0.0008955984,0.000540512,0.08484542],"genre_scores_gemma":[0.8654945,0.0011016488,0.10102778,0.00024164807,0.00020632171,0.00017535698,0.00095268094,0.00022711088,0.030572983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935216,0.00010264617,0.000034559416,0.00021391582,0.00011856625,0.00017823311],"domain_scores_gemma":[0.999297,0.00020604249,0.00013869311,0.00012581295,0.00012701271,0.000105411775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004134296,0.00074757263,0.0004236911,0.00074701785,0.0013666162,0.0012273565,0.00042009098,0.00054533145,0.010765681],"category_scores_gemma":[0.0019341266,0.00034191937,0.0009573135,0.0006050322,0.0012795719,0.0025779598,0.0009898056,0.00086959364,0.0012032734],"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.00011588795,0.000042708973,0.0008010458,0.00017608864,0.00002670285,0.00038519676,0.00058496767,0.007023817,0.006033236,0.95223635,0.0037337253,0.028840326],"study_design_scores_gemma":[0.000026328773,0.00006947101,0.00053083,0.000058958503,0.00002174664,0.0004833419,0.0003951115,0.012540307,0.0037559923,0.96380544,0.018278258,0.00003405968],"about_ca_topic_score_codex":0.0017124133,"about_ca_topic_score_gemma":0.0024443064,"teacher_disagreement_score":0.010765681,"about_ca_system_score_codex":0.00073019677,"about_ca_system_score_gemma":0.0004904734,"threshold_uncertainty_score":0.036014736},"labels":[],"label_agreement":null},{"id":"W4400596755","doi":"10.55016/ojs/cdm.v14i1.62685","title":"On the illumination of a class of convex bodies","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"North University of China","keywords":"Combinatorics; Hyperplane; Mathematics; Regular polygon; Convex hull; Class (philosophy); Convex body; Convex set; Convex optimization; Geometry; Computer science; Artificial intelligence","score_opus":0.028499293701435523,"score_gpt":0.319293087568204,"score_spread":0.2907937938667685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596755","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.23443477,0.0011935377,0.6976001,0.0015042309,0.00013708886,0.000078430654,0.0003981279,0.0001961491,0.06445762],"genre_scores_gemma":[0.9002771,0.0012771206,0.07477775,0.00038508256,0.00040097893,0.00014787007,0.00086701615,0.00022028731,0.021646792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991534,0.0002300279,0.000018752631,0.00017898093,0.00023797841,0.00018088272],"domain_scores_gemma":[0.99824333,0.0010736436,0.00021508265,0.00013326514,0.00016244396,0.0001722705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009843493,0.00064556097,0.00092404697,0.0010905333,0.0010474913,0.0020171576,0.0012246269,0.001443839,0.0054621315],"category_scores_gemma":[0.0048301867,0.0005161906,0.0010931008,0.0008751575,0.0026434714,0.0023472,0.0022536532,0.0022084203,0.000605787],"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.000118742944,0.000062527855,0.0014136924,0.00013038152,0.000042401407,0.00030149348,0.0003731735,0.10926863,0.0030578303,0.8520366,0.004165373,0.029029148],"study_design_scores_gemma":[0.000035669946,0.00006883579,0.00211249,0.000055998666,0.000015960652,0.00027364792,0.00022401483,0.4442757,0.0021254749,0.5430788,0.0076959073,0.0000376001],"about_ca_topic_score_codex":0.0019075569,"about_ca_topic_score_gemma":0.0006946814,"teacher_disagreement_score":0.0054621315,"about_ca_system_score_codex":0.0015554721,"about_ca_system_score_gemma":0.00041297995,"threshold_uncertainty_score":0.018272698},"labels":[],"label_agreement":null},{"id":"W4400596757","doi":"10.55016/ojs/cdm.v14i1.62631","title":"A wide class of Combinatorial matrices related with Reciprocal Pascal and Super Catalan matrices","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pascal (unit); Reciprocal; Mathematics; Catalan number; Combinatorics; Catalan; Combinatorial proof; Matrix (chemical analysis); Class (philosophy); Pascal matrix; Algebra over a field; Pure mathematics; Symmetric matrix; Computer science; Nonnegative matrix; Eigenvalues and eigenvectors","score_opus":0.010194493843890153,"score_gpt":0.28756985979341965,"score_spread":0.2773753659495295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596757","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.16714314,0.002071669,0.6260111,0.0019959798,0.0010815319,0.00028580936,0.00064541254,0.0007531676,0.20001224],"genre_scores_gemma":[0.79592806,0.0017714447,0.1552294,0.0016526033,0.0017170586,0.00042814482,0.0010502296,0.0004287704,0.041794322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998585,0.0002693573,0.000057427194,0.00028256467,0.000633089,0.00017266606],"domain_scores_gemma":[0.9985801,0.0003984308,0.00027333718,0.00023658495,0.0003240299,0.00018760427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006617637,0.000885084,0.00048579604,0.0023353358,0.0017465333,0.002447493,0.0011031505,0.0012152548,0.00857592],"category_scores_gemma":[0.0038908215,0.00042830233,0.000729674,0.0019841592,0.002355919,0.0036780841,0.001218238,0.003072697,0.0016670775],"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.000023380866,0.00002401966,0.00017948794,0.0000698901,0.000007120677,0.00017778721,0.00012924886,0.0011583363,0.0023243218,0.9816341,0.0025241007,0.011748322],"study_design_scores_gemma":[0.000013248578,0.0000339779,0.00031611364,0.000029538056,0.000010919351,0.00096180185,0.00012153827,0.012937844,0.002381048,0.96687216,0.01627767,0.000044070755],"about_ca_topic_score_codex":0.0006199202,"about_ca_topic_score_gemma":0.0007631137,"teacher_disagreement_score":0.00857592,"about_ca_system_score_codex":0.00078290515,"about_ca_system_score_gemma":0.000715395,"threshold_uncertainty_score":0.028689325},"labels":[],"label_agreement":null},{"id":"W4400596768","doi":"10.55016/ojs/cdm.v15i1.67964","title":"On parity and recurrences for certain partition functions","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Parity (physics); Combinatorics; Legendre polynomials; Euler's formula; Recurrence relation; Discrete mathematics; Mathematical analysis","score_opus":0.06222150038527333,"score_gpt":0.3641647935390036,"score_spread":0.30194329315373025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596768","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.4451403,0.0040598055,0.45587853,0.0020925656,0.00062278344,0.00009225751,0.00040735537,0.00044868104,0.09125773],"genre_scores_gemma":[0.9539566,0.001397264,0.029563855,0.00044006293,0.00047796677,0.00012442673,0.00026026162,0.00020210016,0.013577385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991677,0.00017543479,0.000055095607,0.00012960867,0.000281749,0.00019050986],"domain_scores_gemma":[0.99724776,0.0016524872,0.00040582696,0.00018860113,0.00036689994,0.0001383831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001710243,0.0005801622,0.00069057534,0.0020184817,0.0013925809,0.0022336491,0.0009803846,0.00084938924,0.004064432],"category_scores_gemma":[0.008883841,0.0003212258,0.0006584752,0.001530007,0.0025935103,0.004087295,0.0010056932,0.0018720299,0.0008454428],"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.00001714181,0.000008065234,0.0002740462,0.000035056444,0.000003266104,0.00012502175,0.00029570315,0.0011532957,0.0014088546,0.9900794,0.00061800843,0.0059822532],"study_design_scores_gemma":[0.000008175961,0.000014219939,0.00027771082,0.00001965335,0.000007223054,0.00023363438,0.00007901643,0.0114382645,0.0014181003,0.9840716,0.0024140698,0.00001831235],"about_ca_topic_score_codex":0.0007242223,"about_ca_topic_score_gemma":0.0006479267,"teacher_disagreement_score":0.004064432,"about_ca_system_score_codex":0.001334019,"about_ca_system_score_gemma":0.0004873215,"threshold_uncertainty_score":0.013596892},"labels":[],"label_agreement":null},{"id":"W4400596773","doi":"10.55016/ojs/cdm.v15i1.62697","title":"Corrigendum to ``\"On the enumeration of a class of toroidal graphs\" [Contrib. Discrete Math. 13 (2018), no. 1, 79-119]","year":2020,"lang":"en","type":"erratum","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Toroid; Class (philosophy); Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics; Plasma; Quantum mechanics; Artificial intelligence","score_opus":0.03011817204652721,"score_gpt":0.2997804728554948,"score_spread":0.2696623008089676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596773","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.00030413884,0.0065330123,0.0029074166,0.09272656,0.8002137,0.000064996624,0.0026997179,0.0010311723,0.093519345],"genre_scores_gemma":[0.010797295,0.012994428,0.005057678,0.05250057,0.13366577,0.0002051788,0.0045476956,0.0021491556,0.77808213],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962513,0.0005642346,0.00024901755,0.0006865157,0.0018826538,0.0003663065],"domain_scores_gemma":[0.9890147,0.001981796,0.00041074163,0.00084210304,0.007030051,0.0007206128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022189443,0.0017907849,0.0019656818,0.0036392582,0.0036139542,0.0042938148,0.0028779113,0.004000704,0.18048695],"category_scores_gemma":[0.018482085,0.00083643023,0.0016470498,0.002699009,0.0027588054,0.005686247,0.0027064777,0.0076840986,0.09997512],"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.000008988049,0.000004167341,0.000017030185,0.000061163984,0.0000030312153,0.000018702573,0.000011651929,0.000024460356,0.000030222169,0.004105749,0.99231917,0.0033955858],"study_design_scores_gemma":[0.000010196665,0.0000107056385,0.00031191486,0.00015509932,0.000014282361,0.00009598537,0.000037843754,0.0001790524,0.00023178528,0.011224706,0.9877037,0.000024865898],"about_ca_topic_score_codex":0.014386087,"about_ca_topic_score_gemma":0.022631194,"teacher_disagreement_score":0.18048695,"about_ca_system_score_codex":0.0074782874,"about_ca_system_score_gemma":0.0032457258,"threshold_uncertainty_score":0.603789},"labels":[],"label_agreement":null},{"id":"W4400596774","doi":"10.55016/ojs/cdm.v14i1.62644","title":"New parity results of sums of partitions and squares in arithmetic progressions","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Combinatorics; Parity (physics); Square (algebra); Arithmetic; Discrete mathematics; Geometry; Physics; Atomic physics","score_opus":0.02405772631396179,"score_gpt":0.35658888369641417,"score_spread":0.33253115738245237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596774","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.56135714,0.0034942154,0.24727015,0.0051332894,0.0017414361,0.00007459011,0.0003410904,0.00039049715,0.18019758],"genre_scores_gemma":[0.9516366,0.001125165,0.028791456,0.0008146604,0.0011275238,0.00007661606,0.00018237428,0.00019316554,0.016052483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853384,0.0003785531,0.00008585516,0.00021971732,0.0005580368,0.0002240079],"domain_scores_gemma":[0.99754155,0.0013156601,0.0002856264,0.00026889166,0.00032098562,0.00026727558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017604614,0.00075885403,0.0006798646,0.0017380012,0.0015251748,0.002481043,0.0012115695,0.0008120342,0.0054257703],"category_scores_gemma":[0.007600652,0.00048047057,0.0008239889,0.0012902995,0.0038278953,0.0060392125,0.0037572286,0.0024828305,0.00090096024],"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.00007752947,0.00002674695,0.00069857284,0.000066582776,0.0000093283725,0.00024139913,0.0004021913,0.0009852321,0.002270893,0.9823459,0.0019128899,0.010962851],"study_design_scores_gemma":[0.000023232215,0.000052135478,0.0005932868,0.000022226805,0.000022030415,0.0004367365,0.00014551326,0.0074917665,0.002690008,0.9827975,0.005704604,0.000020917181],"about_ca_topic_score_codex":0.00047449706,"about_ca_topic_score_gemma":0.00031807323,"teacher_disagreement_score":0.0054257703,"about_ca_system_score_codex":0.0009387894,"about_ca_system_score_gemma":0.0006198986,"threshold_uncertainty_score":0.018151045},"labels":[],"label_agreement":null},{"id":"W4400596775","doi":"10.55016/ojs/cdm.v15i1.62808","title":"Partitioning the $5\\times 5$ array into restrictions of circles","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Combinatorics; Mathematics; Lattice (music); Algorithm; Physics","score_opus":0.014238984320288294,"score_gpt":0.25174485062424046,"score_spread":0.23750586630395215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596775","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.17941181,0.00024272568,0.7707811,0.00044012823,0.00014073859,0.0001254195,0.0002867529,0.0005208329,0.0480505],"genre_scores_gemma":[0.49345082,0.00032053396,0.49477416,0.00016670907,0.000046422574,0.00022069614,0.00048329373,0.00026659665,0.010270814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998995,0.00021203491,0.000063480176,0.00019679997,0.00032012677,0.00021262882],"domain_scores_gemma":[0.99897027,0.00029038644,0.00014311277,0.00031694083,0.00016841752,0.00011091683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047216058,0.00061333826,0.00078199175,0.00053153146,0.0007793988,0.0013537826,0.0011046723,0.0005677068,0.010423177],"category_scores_gemma":[0.002066049,0.00033145965,0.0006612713,0.0007905,0.0011351872,0.0020253959,0.0020049957,0.0011943125,0.0025087309],"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.0011232749,0.00029438082,0.0025465337,0.00048157625,0.000084575906,0.0005253865,0.0007712082,0.28056103,0.056597114,0.43878832,0.012535875,0.2056907],"study_design_scores_gemma":[0.00015391601,0.0005317976,0.0014003933,0.000116211944,0.000047957863,0.0007307546,0.00083320757,0.6165235,0.05571097,0.25366607,0.07015499,0.00013024197],"about_ca_topic_score_codex":0.0015040581,"about_ca_topic_score_gemma":0.0012738949,"teacher_disagreement_score":0.010423177,"about_ca_system_score_codex":0.00041090063,"about_ca_system_score_gemma":0.00070556457,"threshold_uncertainty_score":0.034869015},"labels":[],"label_agreement":null},{"id":"W4400596777","doi":"10.55016/ojs/cdm.v14i1.62665","title":"Distinguishing number and distinguishing index of neighbourhood corona of two graphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Neighbourhood (mathematics); Automorphism; Mathematics; Vertex (graph theory); Graph; Star (game theory); Discrete mathematics","score_opus":0.008566774733699252,"score_gpt":0.2773433885324417,"score_spread":0.26877661379874246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596777","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.9358215,0.00032399342,0.04105134,0.00040444813,0.000052636587,0.000035215468,0.00041002172,0.00014636996,0.021754567],"genre_scores_gemma":[0.9821669,0.00016856586,0.01499765,0.000051573505,0.000050928535,0.000034415534,0.0004232666,0.000029729108,0.0020769024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992324,0.00011205971,0.000050714112,0.00027324745,0.0001741499,0.00015745079],"domain_scores_gemma":[0.99545896,0.0025240893,0.0005537918,0.0005797681,0.0002476734,0.0006357059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005403813,0.0003078499,0.0004932285,0.0011701409,0.0013531658,0.0014644915,0.0007818394,0.00081839977,0.003085327],"category_scores_gemma":[0.003481561,0.0003002314,0.0006336404,0.00075307215,0.002113179,0.0025906393,0.0015238872,0.0011025612,0.000293513],"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.0006681334,0.0001997273,0.02452638,0.0002660019,0.000055376015,0.00047500213,0.0012854686,0.016689202,0.04459527,0.86296284,0.0038049633,0.04447168],"study_design_scores_gemma":[0.00008958776,0.00026401563,0.01457524,0.000041526193,0.00010999208,0.0019087363,0.000592255,0.09089197,0.02905106,0.84613013,0.016252998,0.00009252929],"about_ca_topic_score_codex":0.00046250195,"about_ca_topic_score_gemma":0.0004950202,"teacher_disagreement_score":0.003085327,"about_ca_system_score_codex":0.0014042385,"about_ca_system_score_gemma":0.0004606419,"threshold_uncertainty_score":0.010321379},"labels":[],"label_agreement":null},{"id":"W4400596785","doi":"10.55016/ojs/cdm.v16i1.67968","title":"The estimation of the zeros of some counting polynomials","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Eulerian path; Combinatorics; Difference polynomials; Orthogonal polynomials; Discrete mathematics; Pure mathematics","score_opus":0.022090159754319542,"score_gpt":0.33872961538362895,"score_spread":0.3166394556293094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596785","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.28656152,0.0017386408,0.6854862,0.0014017423,0.00018630651,0.000030259935,0.00023981849,0.000491944,0.023863541],"genre_scores_gemma":[0.95745903,0.0012374892,0.035066105,0.00015388607,0.00025438078,0.00004829323,0.00019506377,0.00020381481,0.005381794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988494,0.000411101,0.000039090955,0.00020357758,0.00025651258,0.00024040937],"domain_scores_gemma":[0.9921908,0.005349681,0.0009246941,0.00050572894,0.0005904147,0.0004387093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021326707,0.00091402786,0.00075746473,0.0030865709,0.0009558795,0.0021538895,0.0012677399,0.0008904762,0.0044229976],"category_scores_gemma":[0.02137308,0.00045468783,0.00040399804,0.0010473457,0.0034190414,0.0040786862,0.0019076722,0.0032680659,0.00091378967],"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.00023046411,0.000047753343,0.0025154946,0.0003319028,0.000023661316,0.00031537667,0.0005265304,0.028650094,0.020658582,0.91785073,0.0015771292,0.027272321],"study_design_scores_gemma":[0.00001801368,0.00008935409,0.0018562104,0.00033769128,0.00003455235,0.00040819167,0.0003326723,0.3515719,0.02572302,0.61514294,0.0043488136,0.00013655951],"about_ca_topic_score_codex":0.001002745,"about_ca_topic_score_gemma":0.0005728924,"teacher_disagreement_score":0.0044229976,"about_ca_system_score_codex":0.000860448,"about_ca_system_score_gemma":0.00073870836,"threshold_uncertainty_score":0.014796376},"labels":[],"label_agreement":null},{"id":"W4400596788","doi":"10.55016/ojs/cdm.v15i3.69350","title":"Bounds of characteristic polynomials of regular matroids","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Mathematics; Unimodular matrix; Matroid; Combinatorics; Equivalence (formal languages); Discrete mathematics","score_opus":0.008651262275556838,"score_gpt":0.23158512091227587,"score_spread":0.22293385863671902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596788","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.62690455,0.0028567447,0.27707377,0.0027803716,0.00029884116,0.000059460348,0.0007160819,0.00058032124,0.08872983],"genre_scores_gemma":[0.97745425,0.0010632839,0.013787579,0.00014029318,0.00037365232,0.000050975937,0.00025473195,0.00011065975,0.006764708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985555,0.0001949435,0.00004009588,0.0003234668,0.00043243836,0.00045356853],"domain_scores_gemma":[0.99224126,0.0046718153,0.00077585183,0.00067053764,0.00085261045,0.0007880061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012940766,0.00084478204,0.0008439204,0.0033778516,0.001074899,0.0028737057,0.001408578,0.00063306926,0.0053804344],"category_scores_gemma":[0.011968951,0.00044464183,0.0007181485,0.0020882634,0.0031085827,0.0053755376,0.002270878,0.0028565382,0.0007768284],"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.00013332734,0.00005736864,0.001486884,0.00009763808,0.00001735673,0.00010835188,0.000340709,0.010864263,0.0026151657,0.96329194,0.0022960494,0.018690785],"study_design_scores_gemma":[0.000017305556,0.00004941002,0.00079716626,0.000035278157,0.000020425143,0.00012309717,0.00010185842,0.057531346,0.0020220624,0.93597054,0.0033046335,0.000026845682],"about_ca_topic_score_codex":0.001720598,"about_ca_topic_score_gemma":0.00179357,"teacher_disagreement_score":0.0053804344,"about_ca_system_score_codex":0.0028364854,"about_ca_system_score_gemma":0.0008195341,"threshold_uncertainty_score":0.020580232},"labels":[],"label_agreement":null},{"id":"W4400596792","doi":"10.55016/ojs/cdm.v16i1.68085","title":"A neighborhood condition for graphs to have restricted fractional (g,f)-factors","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Function (biology); Discrete mathematics","score_opus":0.029987197248491273,"score_gpt":0.3230272442340674,"score_spread":0.2930400469855762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596792","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.7618029,0.001140512,0.17993097,0.0015034063,0.00028998125,0.00018202011,0.0017410346,0.001077795,0.052331395],"genre_scores_gemma":[0.9252149,0.00040699236,0.059972785,0.0004118119,0.00022483607,0.00022117031,0.0017870405,0.00031106302,0.011449462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986848,0.00014436175,0.000097519485,0.00064192875,0.00021123249,0.00022015454],"domain_scores_gemma":[0.99575067,0.0018007401,0.00053916377,0.00062299136,0.00052195066,0.00076448073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068645464,0.0005852635,0.001061974,0.0009885541,0.0026912636,0.0019044118,0.0010449382,0.0015374537,0.0091219125],"category_scores_gemma":[0.008829017,0.0005512168,0.0014199464,0.00084804604,0.0019403083,0.00381981,0.0016722367,0.0012015479,0.0012804029],"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.0011857755,0.00021483889,0.008573538,0.00029098347,0.000063466054,0.0009610137,0.0017084867,0.011882117,0.017198646,0.91708153,0.009530718,0.031308923],"study_design_scores_gemma":[0.0003040772,0.0005899226,0.005211612,0.00018590127,0.00015453703,0.0035141718,0.0014376268,0.0940911,0.015498321,0.83668435,0.04213754,0.0001908869],"about_ca_topic_score_codex":0.0043714195,"about_ca_topic_score_gemma":0.004012164,"teacher_disagreement_score":0.0091219125,"about_ca_system_score_codex":0.0010843591,"about_ca_system_score_gemma":0.0008163545,"threshold_uncertainty_score":0.03051585},"labels":[],"label_agreement":null},{"id":"W4400596793","doi":"10.55016/ojs/cdm.v16i1.71235","title":"Geometric polynomials and integer partitions","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Integer (computer science); Combinatorics; Bernoulli number; Context (archaeology); Bernoulli's principle; Discrete mathematics; Computer science","score_opus":0.03434620968807975,"score_gpt":0.36045388712113957,"score_spread":0.3261076774330598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596793","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.2030697,0.009827705,0.42104182,0.0043408945,0.0025295592,0.00004281088,0.00029240627,0.00041895593,0.35843605],"genre_scores_gemma":[0.9230601,0.0032282236,0.041661736,0.00097107654,0.0013227464,0.00003571081,0.00021068567,0.00014836853,0.02936136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925727,0.0001654465,0.000024752908,0.000114274255,0.00027696113,0.00016130906],"domain_scores_gemma":[0.99955934,0.00016754573,0.00007136983,0.00006159368,0.00008967683,0.000050380582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004884043,0.00067512994,0.000463322,0.0015161703,0.0010433288,0.0018726796,0.000681164,0.00052980584,0.005955132],"category_scores_gemma":[0.0019792693,0.00016694875,0.0004099581,0.0013420621,0.0030465052,0.0040722373,0.0019500878,0.0018372271,0.0012389164],"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.000007881475,0.0000023641467,0.00004373157,0.000016092901,0.0000012228568,0.000029483474,0.00006027226,0.000510949,0.00036377835,0.9940877,0.00056982355,0.0043066167],"study_design_scores_gemma":[0.0000041612834,0.000012580245,0.00013003366,0.00002059475,0.0000045569795,0.00016871009,0.0000644279,0.0029638812,0.00070173497,0.9801119,0.015806748,0.000010649472],"about_ca_topic_score_codex":0.00074181653,"about_ca_topic_score_gemma":0.0007945869,"teacher_disagreement_score":0.005955132,"about_ca_system_score_codex":0.0010419412,"about_ca_system_score_gemma":0.0004998306,"threshold_uncertainty_score":0.019921899},"labels":[],"label_agreement":null},{"id":"W4400596794","doi":"10.55016/ojs/cdm.v16i1.62666","title":"Bounds on r-identifying codes in q-ary Lee space","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Hypercube; Combinatorics; Cardinality (data modeling); Upper and lower bounds; Mathematics; Discrete mathematics; Computer science","score_opus":0.012316153291424704,"score_gpt":0.2664175244968444,"score_spread":0.2541013712054197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596794","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.45096204,0.0034842612,0.50335026,0.0019308868,0.0001855741,0.00013474384,0.0010456163,0.0010367356,0.037869826],"genre_scores_gemma":[0.8752255,0.001807571,0.11693027,0.00029884087,0.00014906042,0.00023141531,0.0009693883,0.00024708948,0.0041408753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972453,0.00081829325,0.000178724,0.0003257627,0.00081067724,0.0006213494],"domain_scores_gemma":[0.9776593,0.015864404,0.002152116,0.002223254,0.0014530026,0.00064790563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020469315,0.001154847,0.00085028895,0.0022118378,0.001436185,0.0016635339,0.001381464,0.00095714297,0.0035579046],"category_scores_gemma":[0.017484015,0.00041699604,0.00070695987,0.0023474556,0.0027621344,0.0060939565,0.00277596,0.0021475346,0.001224554],"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.0007583036,0.00019980327,0.0078666,0.0005380687,0.00008628291,0.00040278735,0.00097617105,0.36254513,0.022768568,0.50609374,0.0072960868,0.090468444],"study_design_scores_gemma":[0.000035946643,0.000396476,0.0023240105,0.00017442949,0.000050030103,0.0005997489,0.00056967814,0.5104729,0.0388719,0.432809,0.013537069,0.00015894834],"about_ca_topic_score_codex":0.001200763,"about_ca_topic_score_gemma":0.002544408,"teacher_disagreement_score":0.0035579046,"about_ca_system_score_codex":0.0014148167,"about_ca_system_score_gemma":0.0013157323,"threshold_uncertainty_score":0.011902332},"labels":[],"label_agreement":null},{"id":"W4400596797","doi":"10.55016/ojs/cdm.v15i3.62692","title":"Decomposition of complete tripartite graphs into cycles and paths of length three","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Decomposition; Path (computing); Discrete mathematics; Computer science; Chemistry","score_opus":0.013751420812721989,"score_gpt":0.2541824710650604,"score_spread":0.24043105025233844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596797","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.38821533,0.0009774108,0.5449684,0.0007315161,0.00009992101,0.00029511846,0.0021063387,0.00039997877,0.062205963],"genre_scores_gemma":[0.8577306,0.00057299645,0.1269307,0.00035939467,0.00005662033,0.00024647772,0.0025666365,0.000113757254,0.011422808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995073,0.00011158647,0.00003224706,0.00012162069,0.000090726855,0.0001365112],"domain_scores_gemma":[0.9986355,0.00041384425,0.00019485447,0.00023351537,0.00029039904,0.00023195152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003313876,0.00052382785,0.0003449479,0.0011868237,0.0008587255,0.001323889,0.00064319436,0.00054950383,0.0053931167],"category_scores_gemma":[0.0020091743,0.0003794267,0.0005767681,0.0009997835,0.00086175627,0.0019295554,0.0011217833,0.0009036379,0.00065093406],"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.00031698847,0.00012959495,0.0022532342,0.0003222972,0.00007319315,0.00045550146,0.00059016637,0.039528355,0.013819817,0.8825195,0.007997971,0.05199332],"study_design_scores_gemma":[0.00005752541,0.000092330556,0.0017568906,0.00011513583,0.000072497,0.00058298354,0.0004571204,0.13980952,0.006934447,0.82979876,0.020273544,0.000049231687],"about_ca_topic_score_codex":0.00215128,"about_ca_topic_score_gemma":0.0039581414,"teacher_disagreement_score":0.0053931167,"about_ca_system_score_codex":0.0009784899,"about_ca_system_score_gemma":0.0008390988,"threshold_uncertainty_score":0.01804179},"labels":[],"label_agreement":null},{"id":"W4400596798","doi":"10.55016/ojs/cdm.v15i3.68674","title":"On the uniformity of the approximation for $r$-associated Stirling numbers of the second Kind","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stirling numbers of the second kind; Stirling numbers of the first kind; Stirling number; Mathematics; Stirling engine; Bell polynomials; Extension (predicate logic); Range (aeronautics); Generating function; Partition (number theory); Combinatorics; Function (biology); Spouge's approximation; Natural number; Discrete mathematics; Applied mathematics; Minimax approximation algorithm; Computer science; Physics","score_opus":0.03972416383204305,"score_gpt":0.3168064005049099,"score_spread":0.2770822366728668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596798","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.12463941,0.005567796,0.8002056,0.0022094222,0.000579479,0.00013686148,0.0005345556,0.0012594961,0.06486743],"genre_scores_gemma":[0.81499,0.0045177173,0.1581802,0.0016798759,0.00082381105,0.00039063272,0.00092272396,0.00088584324,0.017609194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559265,0.0013955196,0.00018754331,0.00088791514,0.0013066382,0.00062983355],"domain_scores_gemma":[0.9655011,0.026384532,0.001408617,0.0038189779,0.0022544481,0.0006323271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072114333,0.0014826447,0.0015606647,0.0023728893,0.001786085,0.0030125724,0.0032628032,0.0015664398,0.0056530535],"category_scores_gemma":[0.055104863,0.0006863788,0.001848069,0.0017774801,0.005246471,0.0066020004,0.0035355098,0.0051776986,0.0026211953],"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.00083738647,0.00011429709,0.004771164,0.0004234132,0.00009419089,0.0002689705,0.00069733144,0.048936676,0.0052290387,0.8880931,0.0066854656,0.0438488],"study_design_scores_gemma":[0.000047770485,0.00020358441,0.002130132,0.000256231,0.000104230945,0.00054854155,0.00020202131,0.38703787,0.007511892,0.5912228,0.01060418,0.00013059146],"about_ca_topic_score_codex":0.0030736392,"about_ca_topic_score_gemma":0.0021618907,"teacher_disagreement_score":0.0072114333,"about_ca_system_score_codex":0.002739614,"about_ca_system_score_gemma":0.0015000312,"threshold_uncertainty_score":0.03813815},"labels":[],"label_agreement":null},{"id":"W4400596802","doi":"10.55016/ojs/cdm.v16i1.62556","title":"Combinatorial interpretations of two identities of Guo and Yang","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Class (philosophy); Combinatorial analysis; Combinatorial principles; Combinatorial explosion; Computer science; Artificial intelligence","score_opus":0.0212955601876057,"score_gpt":0.3677586141242663,"score_spread":0.3464630539366606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596802","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.25978312,0.002584348,0.38027203,0.009375195,0.0019088698,0.00016563597,0.0008262865,0.0003571689,0.3447274],"genre_scores_gemma":[0.8940606,0.0010094283,0.080439545,0.0019123813,0.00080505124,0.0002140869,0.00046656642,0.00014528012,0.02094707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977837,0.0007026986,0.00013280069,0.00048369076,0.0006276966,0.00026949047],"domain_scores_gemma":[0.9974031,0.000977153,0.000308223,0.0005066672,0.00048593612,0.00031895802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020565044,0.0005947987,0.00073701824,0.0013621146,0.0020021496,0.0020585114,0.0013227011,0.0009847282,0.004555305],"category_scores_gemma":[0.005213931,0.00044802937,0.0009642618,0.001227912,0.0042991773,0.0052429014,0.0040167817,0.0028932984,0.0007195673],"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.00002601549,0.000011657638,0.00016386567,0.000017105445,0.0000022048473,0.00011608707,0.00035619613,0.00021028712,0.0004604731,0.99388725,0.001142982,0.0036058978],"study_design_scores_gemma":[0.000026871696,0.000020888536,0.0005200964,0.000016506048,0.000010394461,0.00035830413,0.00019707104,0.0019047409,0.00083887007,0.97705305,0.019030817,0.000022524677],"about_ca_topic_score_codex":0.00075210293,"about_ca_topic_score_gemma":0.0006495645,"teacher_disagreement_score":0.004555305,"about_ca_system_score_codex":0.001283262,"about_ca_system_score_gemma":0.000789501,"threshold_uncertainty_score":0.01523906},"labels":[],"label_agreement":null},{"id":"W4400596804","doi":"10.55016/ojs/cdm.v16i3.62468","title":"New cyclic Kautz digraphs with optimal diameter","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; European Regional Development Fund; Agència de Gestió d'Ajuts Universitaris i de Recerca; European Commission","keywords":"Digraph; Combinatorics; Iterated function; Mathematics; Alphabet; Sequence (biology); Discrete mathematics; Mathematical analysis","score_opus":0.008987353394995507,"score_gpt":0.25575134147274214,"score_spread":0.24676398807774663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596804","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.45464897,0.0015786124,0.455609,0.0010195778,0.0002744612,0.00031392524,0.002313677,0.0011038941,0.083138],"genre_scores_gemma":[0.8083576,0.00089472195,0.15660185,0.0005833132,0.00010513519,0.000323787,0.0026470087,0.00022832354,0.03025826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996482,0.00005717303,0.000023544482,0.000115518356,0.000069746224,0.000085817715],"domain_scores_gemma":[0.9992835,0.00022504941,0.000073725685,0.00013957295,0.00013469235,0.00014349705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002447977,0.00043693147,0.0004346991,0.00088975014,0.0010032611,0.0012142041,0.0007237907,0.00064490084,0.0047191796],"category_scores_gemma":[0.0013288638,0.00035992978,0.00056368124,0.0007578401,0.0006456154,0.001601186,0.00080072426,0.00078990246,0.0008378856],"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.00034219693,0.00015196412,0.002033159,0.0003879604,0.000060610575,0.00056849763,0.0006329304,0.035658095,0.037578527,0.8231617,0.015118058,0.084306315],"study_design_scores_gemma":[0.00014575616,0.00018025057,0.0022332424,0.000082091436,0.000091840244,0.0010793649,0.00041860182,0.16116546,0.019895783,0.7091467,0.10545442,0.00010653848],"about_ca_topic_score_codex":0.0019081989,"about_ca_topic_score_gemma":0.0033583385,"teacher_disagreement_score":0.0047191796,"about_ca_system_score_codex":0.0014445976,"about_ca_system_score_gemma":0.00071970205,"threshold_uncertainty_score":0.015787184},"labels":[],"label_agreement":null},{"id":"W4400596810","doi":"10.55016/ojs/cdm.v15i3.69846","title":"Binomial transforms of the balancing and Lucas-balancing polynomials","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Catalan number; Mathematics; Binomial (polynomial); Recurrence relation; Binomial coefficient; Catalan; Combinatorics; Discrete mathematics; Statistics","score_opus":0.008304321983629265,"score_gpt":0.2711280594762513,"score_spread":0.262823737492622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596810","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.4051064,0.0026740092,0.37477767,0.0013131324,0.00076324935,0.0001013231,0.00034573968,0.00025480252,0.21466371],"genre_scores_gemma":[0.9366526,0.0014572091,0.03180495,0.00030913347,0.000581061,0.00007538641,0.00023477052,0.00013836726,0.028746534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995721,0.000080939775,0.00001433547,0.00005568477,0.00016351843,0.00011346277],"domain_scores_gemma":[0.99935323,0.0002105516,0.000109515204,0.00004039904,0.0001959968,0.00009040491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086621917,0.00044393475,0.00033980922,0.0017986952,0.00080916274,0.0012711484,0.00059069187,0.0004739417,0.0068515865],"category_scores_gemma":[0.0034484465,0.00017885547,0.0004240749,0.0012124834,0.0013715527,0.0024444074,0.00076175213,0.0013639851,0.0012112984],"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.00001557933,0.000010336024,0.0001710129,0.00001941649,0.0000017400405,0.00006261996,0.000093498,0.0014806447,0.001711795,0.98800695,0.00066572323,0.0077606365],"study_design_scores_gemma":[0.000013229525,0.000033974207,0.0007017486,0.000036398706,0.000007540257,0.00044223687,0.00014602352,0.037115306,0.0022525555,0.95088774,0.008329836,0.000033395754],"about_ca_topic_score_codex":0.00095002865,"about_ca_topic_score_gemma":0.00091978326,"teacher_disagreement_score":0.0068515865,"about_ca_system_score_codex":0.0008276319,"about_ca_system_score_gemma":0.00059039664,"threshold_uncertainty_score":0.022920847},"labels":[],"label_agreement":null},{"id":"W4400596815","doi":"10.55016/ojs/cdm.v16i1.69407","title":"Direct and inverse problems for restricted signed sumsets in integers","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Human Resource Development; Ministry of Education, India; Indian Institute of Technology Roorkee","keywords":"Mathematics; Combinatorics; Inverse; Abelian group; Integer (computer science); Lambda; Cardinality (data modeling); Wedge (geometry); Sigma; Discrete mathematics; Physics; Geometry; Computer science","score_opus":0.024886383372675666,"score_gpt":0.31594890040409046,"score_spread":0.2910625170314148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596815","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.25502038,0.0013658784,0.6956945,0.0025908388,0.0003781806,0.00032915265,0.0007770404,0.00048982323,0.04335421],"genre_scores_gemma":[0.49990526,0.0014643084,0.4581297,0.0008420688,0.0008749565,0.00062275375,0.0026009008,0.00050210685,0.035057954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677163,0.0008182369,0.0002678355,0.0009795644,0.0007692033,0.00039361502],"domain_scores_gemma":[0.9927746,0.0051976424,0.00050043024,0.00083404925,0.0003902342,0.000303117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025188266,0.0015896335,0.0018264602,0.0014016645,0.0017953799,0.0036783218,0.0023546831,0.0025209745,0.010067232],"category_scores_gemma":[0.013025376,0.0009180296,0.0027276843,0.0021627983,0.0033614777,0.008915385,0.0036773188,0.004890086,0.0015747456],"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.0005964449,0.00034020335,0.0013108599,0.0008140564,0.00011999502,0.00067164935,0.0011839345,0.039552804,0.0055611245,0.8477027,0.0066612335,0.09548508],"study_design_scores_gemma":[0.00010969625,0.00011731241,0.0002547121,0.00006154975,0.00005315016,0.00044889844,0.0003410388,0.057230227,0.0044823666,0.9298746,0.006964255,0.00006215341],"about_ca_topic_score_codex":0.0007164198,"about_ca_topic_score_gemma":0.0009815613,"teacher_disagreement_score":0.010067232,"about_ca_system_score_codex":0.001206269,"about_ca_system_score_gemma":0.0011729571,"threshold_uncertainty_score":0.033678234},"labels":[],"label_agreement":null},{"id":"W4400596816","doi":"10.55016/ojs/cdm.v16i3.62279","title":"Graphs where each spanning tree has a perfect matching","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Spanning tree; Minimum degree spanning tree; Matching (statistics); Graph; Connectivity; Discrete mathematics; Connected dominating set; Tree (set theory); Minimum spanning tree","score_opus":0.02635374451992335,"score_gpt":0.3218086747465916,"score_spread":0.29545493022666824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596816","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.7704423,0.0008387828,0.14831142,0.0007042253,0.00006792219,0.000070091446,0.0013417299,0.00042252368,0.07780096],"genre_scores_gemma":[0.9645573,0.0005174745,0.02662994,0.00015793508,0.00005563921,0.00003654948,0.00084625813,0.00005321154,0.007145675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996387,0.00005055911,0.00003391634,0.0001272691,0.000068152774,0.000081398786],"domain_scores_gemma":[0.9992454,0.000229291,0.0002036748,0.00016109883,0.00009378664,0.00006675855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019554562,0.00031326563,0.00032699708,0.00078131206,0.00091328396,0.0010340721,0.00041452728,0.000508415,0.004053949],"category_scores_gemma":[0.0011900278,0.0002683856,0.00035108597,0.001076552,0.0006574287,0.0025463072,0.0007808614,0.00030263216,0.0005895442],"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.00025760054,0.000084758765,0.004973164,0.00032738713,0.000089562636,0.00087693956,0.00064154353,0.018643081,0.0309963,0.8617322,0.0063916403,0.0749857],"study_design_scores_gemma":[0.000028968516,0.000128074,0.0056768632,0.00006392324,0.00010915299,0.0028999809,0.0006885168,0.046550788,0.016317088,0.88820195,0.03929811,0.000036568334],"about_ca_topic_score_codex":0.00070092414,"about_ca_topic_score_gemma":0.0012304467,"teacher_disagreement_score":0.004053949,"about_ca_system_score_codex":0.0004467898,"about_ca_system_score_gemma":0.00040786734,"threshold_uncertainty_score":0.013561785},"labels":[],"label_agreement":null},{"id":"W4400596818","doi":"10.55016/ojs/cdm.v16i1.70710","title":"Symmetric association schemes arising from abstract regular polytopes","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coxeter group; Mathematics; Combinatorics; Polytope; Coset; Vertex (graph theory); Symmetric group; Type (biology); Finite group; Group (periodic table); Graph; Physics","score_opus":0.009539156373322692,"score_gpt":0.2651140095327008,"score_spread":0.2555748531593781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596818","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.81163144,0.0002940605,0.123252764,0.0005282683,0.00019449831,0.00009992074,0.00027537296,0.00033495427,0.06338868],"genre_scores_gemma":[0.97788197,0.00013780037,0.010443575,0.00006427598,0.00008360262,0.000071068294,0.00017323742,0.000047748046,0.011096689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990375,0.00015263456,0.00007191624,0.0002390216,0.00027357455,0.00022541454],"domain_scores_gemma":[0.99921715,0.00022943283,0.00013969671,0.00016627883,0.00008005492,0.00016735443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004615566,0.00036917886,0.000474493,0.0009724489,0.0015924817,0.0032917466,0.00052784785,0.0006691017,0.0059292195],"category_scores_gemma":[0.0013136356,0.0003824042,0.0006763909,0.00096933026,0.0026887513,0.003404243,0.0025379537,0.001161863,0.0007970557],"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.000023363264,0.000013638984,0.00021917962,0.00001290493,0.0000030897872,0.00014314192,0.00025328354,0.00076958985,0.0012382627,0.9945648,0.00020725087,0.0025516031],"study_design_scores_gemma":[0.000039653263,0.000041684867,0.00039415117,0.00001667405,0.000012422292,0.00026668687,0.00044392108,0.008756205,0.0027725706,0.9782079,0.0090274,0.000020776954],"about_ca_topic_score_codex":0.00055547967,"about_ca_topic_score_gemma":0.00052061945,"teacher_disagreement_score":0.0059292195,"about_ca_system_score_codex":0.0011151014,"about_ca_system_score_gemma":0.000512243,"threshold_uncertainty_score":0.019835234},"labels":[],"label_agreement":null},{"id":"W4400596821","doi":"10.55016/ojs/cdm.v16i1.62717","title":"Coloring permutation-gain graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Greedy coloring; Edge coloring; Graph coloring; Fractional coloring; Complete coloring; Discrete mathematics; List coloring; Permutation graph; Graph; Line graph; Graph power","score_opus":0.013859159797262998,"score_gpt":0.2784190764770123,"score_spread":0.2645599166797493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596821","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.17484394,0.00047313547,0.7515212,0.0010517928,0.000416706,0.00018016486,0.000579636,0.0011097286,0.0698236],"genre_scores_gemma":[0.85210687,0.0006786726,0.12155332,0.0005100546,0.000243012,0.00019484185,0.00077997794,0.00037197166,0.023561276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991357,0.00021395762,0.000029055043,0.00022617508,0.00022007672,0.00017508671],"domain_scores_gemma":[0.99858236,0.00045499922,0.0001169761,0.00044994432,0.00026594137,0.00012976359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005843315,0.00049429334,0.00035317856,0.00084144564,0.0011118408,0.0015330053,0.0008320255,0.0005894582,0.007210768],"category_scores_gemma":[0.0021871398,0.00034055105,0.0006137488,0.0011602599,0.0017463579,0.0032212164,0.0015263574,0.0013465849,0.001008957],"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.00005970985,0.000030954503,0.00044791016,0.000059646445,0.000011138701,0.00008178307,0.00020349817,0.0072284495,0.0041029295,0.95932156,0.0034211366,0.025031356],"study_design_scores_gemma":[0.000021813023,0.000043781612,0.00041215582,0.000015118059,0.000015833348,0.0002110779,0.0001733675,0.029788064,0.003954272,0.94181025,0.023535118,0.000019083825],"about_ca_topic_score_codex":0.0014040907,"about_ca_topic_score_gemma":0.0021207198,"teacher_disagreement_score":0.007210768,"about_ca_system_score_codex":0.0016409509,"about_ca_system_score_gemma":0.0009069809,"threshold_uncertainty_score":0.024122417},"labels":[],"label_agreement":null},{"id":"W4400596823","doi":"10.55016/ojs/cdm.v16i1.68557","title":"k-Forcing number for Cartesian product of some graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Bipartite graph; Forcing (mathematics); Mathematics; Combinatorics; Graph coloring; Graph; Product (mathematics); Discrete mathematics; Generalization; Geometry; Mathematical analysis","score_opus":0.019671688235078175,"score_gpt":0.3361353020900227,"score_spread":0.3164636138549445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596823","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.7221816,0.00035282955,0.23856033,0.00062459137,0.0001386839,0.00006973372,0.00042014706,0.00027842057,0.0373737],"genre_scores_gemma":[0.9447853,0.00029019784,0.047787312,0.00012704165,0.000102410704,0.00010913473,0.0003272483,0.00010206857,0.0063693374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990953,0.00019090417,0.000061032875,0.00027911927,0.00019804019,0.00017567303],"domain_scores_gemma":[0.9965906,0.0017670051,0.00042692843,0.00040200911,0.00038153116,0.00043197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009021084,0.00033992666,0.00041269584,0.0013894592,0.0015198911,0.001187328,0.00061378535,0.0006781756,0.0066214935],"category_scores_gemma":[0.0034181692,0.00026135572,0.00064530264,0.00063851377,0.002558913,0.0032082591,0.0012274962,0.0011612877,0.0006722317],"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.00006213142,0.000020912807,0.0015228604,0.00005576248,0.000008631174,0.000117606,0.00033928704,0.0046022134,0.0043939115,0.98057,0.0011707167,0.007135924],"study_design_scores_gemma":[0.000017434357,0.000075616204,0.0016196463,0.000030100831,0.000013855768,0.0004550347,0.00015580146,0.03383952,0.004803281,0.9523736,0.006574107,0.00004196532],"about_ca_topic_score_codex":0.0005808137,"about_ca_topic_score_gemma":0.00052082125,"teacher_disagreement_score":0.0066214935,"about_ca_system_score_codex":0.00068574684,"about_ca_system_score_gemma":0.0005890297,"threshold_uncertainty_score":0.022151053},"labels":[],"label_agreement":null},{"id":"W4400596830","doi":"10.55016/ojs/cdm.v15i3.68174","title":"Degree sequence of the generalized Sierpiński graph","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sierpinski triangle; Combinatorics; Mathematics; Degree (music); Discrete mathematics; Fractal; Graph; Sequence (biology)","score_opus":0.08688189845068182,"score_gpt":0.34426589242265393,"score_spread":0.2573839939719721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596830","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.9481562,0.0004649036,0.038963705,0.00018197589,0.000047565372,0.000020052134,0.00034783845,0.00009818352,0.011719586],"genre_scores_gemma":[0.98952544,0.0004255662,0.0073470264,0.000046555193,0.000044077737,0.00002509137,0.0002743446,0.000025784719,0.00228613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986386,0.000020882268,0.000006936359,0.000038066933,0.000034690333,0.000035623572],"domain_scores_gemma":[0.9994967,0.00015518552,0.00009566265,0.000039763174,0.00008418756,0.00012837585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014618532,0.00022180474,0.0002389904,0.0012885714,0.00042870306,0.0006447883,0.00036117545,0.00026770044,0.0011649993],"category_scores_gemma":[0.001115077,0.00015319092,0.00021048631,0.00050704076,0.0007879745,0.0010676765,0.0003978452,0.0005145908,0.00016920718],"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.00015240061,0.00004534609,0.0068300734,0.00015034841,0.000017000697,0.00036834885,0.0005817275,0.026659794,0.037139557,0.89922816,0.0020615605,0.026765687],"study_design_scores_gemma":[0.00003279864,0.00011902508,0.014305936,0.00005902517,0.000027156277,0.0007429808,0.00032481962,0.18088655,0.01566486,0.7760268,0.011712788,0.00009726447],"about_ca_topic_score_codex":0.0014291505,"about_ca_topic_score_gemma":0.0017145877,"teacher_disagreement_score":0.0014291505,"about_ca_system_score_codex":0.0005253359,"about_ca_system_score_gemma":0.0003080592,"threshold_uncertainty_score":0.0038973093},"labels":[],"label_agreement":null},{"id":"W4400596835","doi":"10.55016/ojs/cdm.v15i3.62290","title":"A complete solution to the spectrum problem for graphs with six vertices and up to nine edges","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Cograph; 1-planar graph; Pathwidth; Indifference graph; Chordal graph; Metric dimension; Discrete mathematics; Vertex (graph theory); Clique-sum; Neighbourhood (mathematics); Graph; Line graph","score_opus":0.0162376995996428,"score_gpt":0.23206859272246858,"score_spread":0.21583089312282577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596835","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.054095525,0.00046976187,0.8866285,0.002268825,0.00031378382,0.0002376951,0.00080888876,0.000479102,0.05469789],"genre_scores_gemma":[0.22870891,0.0008764827,0.73608077,0.0008071726,0.000258808,0.0004024279,0.0017195665,0.00040371373,0.03074209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988696,0.00030021102,0.00006029813,0.00027266727,0.000346113,0.00015114632],"domain_scores_gemma":[0.9985227,0.0007918467,0.00009945632,0.00027625044,0.00020546388,0.00010430988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082584244,0.0010960653,0.0008489717,0.00076829776,0.0013839107,0.0012939076,0.0010683419,0.0019156593,0.017785795],"category_scores_gemma":[0.0038557225,0.00059414003,0.0014650493,0.0008441922,0.0013320989,0.002677566,0.0018965887,0.0025236425,0.0033608612],"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.00019328647,0.00023820462,0.00072845997,0.00078602915,0.000075737196,0.00040915096,0.0005254196,0.05371412,0.011346991,0.71728164,0.033553224,0.18114777],"study_design_scores_gemma":[0.00009364475,0.00012191037,0.0002457041,0.000102028025,0.000032342334,0.00040402598,0.00030872296,0.054690175,0.0036774846,0.9049707,0.035321426,0.000031821968],"about_ca_topic_score_codex":0.0009882536,"about_ca_topic_score_gemma":0.001373087,"teacher_disagreement_score":0.017785795,"about_ca_system_score_codex":0.00077941286,"about_ca_system_score_gemma":0.0017095797,"threshold_uncertainty_score":0.059499383},"labels":[],"label_agreement":null},{"id":"W4400596836","doi":"10.55016/ojs/cdm.v15i2.67943","title":"Minimum size blocking sets of certain line sets with respect to an elliptic quadric in $PG(3,q)$","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Human Resource Development; Science and Engineering Research Board; Ministry of Education, India; Council of Scientific and Industrial Research, India","keywords":"Quadric; Combinatorics; Mathematics; Line (geometry); Blocking (statistics); Type (biology); Blocking set; Connection (principal bundle); Discrete mathematics; Geometry; Pure mathematics; Projective space; Statistics","score_opus":0.015431631780813145,"score_gpt":0.26435813305748357,"score_spread":0.24892650127667043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596836","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.9461247,0.00023278336,0.041537028,0.0002714729,0.000011190673,0.000070366616,0.0010815364,0.00017128017,0.01049974],"genre_scores_gemma":[0.96361035,0.00034569373,0.028755099,0.00009424576,0.00004824145,0.00022679474,0.0022123798,0.000110431894,0.00459668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999213,0.00014587,0.000058431713,0.00015381689,0.0002241002,0.00020471429],"domain_scores_gemma":[0.99599886,0.0015974452,0.0010383128,0.00032942032,0.00040130902,0.0006346461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051606685,0.0005718144,0.00072774594,0.0013749852,0.0011838215,0.0023084008,0.001238011,0.0006914275,0.0045460705],"category_scores_gemma":[0.0037432557,0.00053843705,0.0004066661,0.001554632,0.0010909521,0.0021289466,0.0010533349,0.0008374306,0.0007112588],"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.0030857073,0.00051682425,0.03738513,0.0006683434,0.00021507838,0.0010656107,0.0021238895,0.1685519,0.10509731,0.6019418,0.013953245,0.06539528],"study_design_scores_gemma":[0.00044097038,0.000797238,0.022603849,0.00017119515,0.00018442936,0.0020721422,0.0023888578,0.5236527,0.051765148,0.3697767,0.025989302,0.00015748075],"about_ca_topic_score_codex":0.0021720745,"about_ca_topic_score_gemma":0.0014478831,"teacher_disagreement_score":0.0045460705,"about_ca_system_score_codex":0.0012128766,"about_ca_system_score_gemma":0.0006372623,"threshold_uncertainty_score":0.015208125},"labels":[],"label_agreement":null},{"id":"W4400596839","doi":"10.55016/ojs/cdm.v15i2.62547","title":"Diameter 3","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Class (philosophy); Property (philosophy); Set (abstract data type); Metric space; Metric (unit); Finite set; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.039395814137579276,"score_gpt":0.35431667660441274,"score_spread":0.3149208624668335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596839","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.24745268,0.0026225406,0.05321754,0.002915917,0.0011217648,0.00012181236,0.0057936707,0.0012240994,0.68552995],"genre_scores_gemma":[0.83098686,0.0011182677,0.01802443,0.0009475262,0.00030256424,0.00016300291,0.0056502055,0.00034987446,0.14245729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995859,0.000036091868,0.00001794368,0.0001633159,0.000097853524,0.00009886546],"domain_scores_gemma":[0.9995047,0.000119830314,0.0000681638,0.00008211238,0.00010801409,0.000117114854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017598923,0.00046630055,0.0005106739,0.00070172653,0.0012351461,0.0022993172,0.000794348,0.0006925519,0.034124102],"category_scores_gemma":[0.0009375084,0.00027653624,0.00045135667,0.00048082037,0.0007929051,0.001377339,0.001926432,0.001067013,0.007322057],"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.00024180126,0.00003638245,0.002334635,0.00020445592,0.000029210543,0.00040608118,0.00038264116,0.00090608955,0.010946848,0.9057852,0.042025976,0.03670063],"study_design_scores_gemma":[0.00008188569,0.00010831582,0.0044162325,0.00008839088,0.00004008733,0.0026484753,0.000738624,0.003997109,0.012625761,0.41296408,0.5622504,0.000040707662],"about_ca_topic_score_codex":0.0012648025,"about_ca_topic_score_gemma":0.0010807476,"teacher_disagreement_score":0.034124102,"about_ca_system_score_codex":0.00077298115,"about_ca_system_score_gemma":0.00027058364,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4400596840","doi":"10.55016/ojs/cdm.v16i1.62258","title":"H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México","keywords":"Digraph; Combinatorics; Mathematics; Transitive relation; Arc (geometry); Kernel (algebra); Independence (probability theory); Discrete mathematics; Geometry","score_opus":0.012375351633211898,"score_gpt":0.3119576176220196,"score_spread":0.2995822659888077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596840","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.6797539,0.00040321096,0.26310563,0.0008099342,0.00012434475,0.00010059004,0.0006034237,0.00033154027,0.054767366],"genre_scores_gemma":[0.9729865,0.00021569483,0.017802302,0.00021985402,0.00007809044,0.00006015693,0.00039989225,0.000049137958,0.008188496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992194,0.00013010544,0.000035861012,0.00023105183,0.0001689894,0.00021454525],"domain_scores_gemma":[0.9960031,0.0022061355,0.0006033057,0.0004300396,0.00028979604,0.00046761005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050646404,0.00035629372,0.00042571896,0.00075015886,0.0015253745,0.00168437,0.00082630204,0.00066477794,0.0070524905],"category_scores_gemma":[0.002344767,0.0006086401,0.0008791667,0.00059291447,0.0021940481,0.0031810545,0.0014334721,0.0021966165,0.0008246027],"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.00025866457,0.00017057128,0.0033254283,0.00017277377,0.000066300374,0.0007851409,0.0011533514,0.0046168054,0.016219199,0.95659935,0.0016981573,0.014934282],"study_design_scores_gemma":[0.000106377316,0.00013744274,0.0038235842,0.000039319802,0.00009725213,0.00097641663,0.00038417132,0.035028737,0.011913229,0.9364429,0.010997638,0.00005297672],"about_ca_topic_score_codex":0.0021475386,"about_ca_topic_score_gemma":0.0021598397,"teacher_disagreement_score":0.0070524905,"about_ca_system_score_codex":0.00084474945,"about_ca_system_score_gemma":0.0005698017,"threshold_uncertainty_score":0.02359289},"labels":[],"label_agreement":null},{"id":"W4400596842","doi":"10.55016/ojs/cdm.v16i2.71723","title":"Problems Section BIRS Proceedings","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Section (typography); Homogeneous; Combinatorics; Mathematics; Genealogy; Special section; Library science; Computer science; History; Engineering; Engineering physics","score_opus":0.0065658054730559755,"score_gpt":0.22467358478569605,"score_spread":0.21810777931264008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596842","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.0035379669,0.013913305,0.030689474,0.013793074,0.020508658,0.0002825941,0.0060443003,0.0016756076,0.9095551],"genre_scores_gemma":[0.03208979,0.010550289,0.01994864,0.0025761623,0.008581829,0.00024516322,0.013582777,0.0014331605,0.9109924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976545,0.0003327329,0.0001401874,0.000597534,0.0010238218,0.00025119638],"domain_scores_gemma":[0.99782217,0.0003704326,0.000096096606,0.00048778873,0.0008068746,0.0004167367],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019773412,0.0016080398,0.0011899633,0.0023224254,0.0028725401,0.0060605025,0.0022940997,0.0022955365,0.3653104],"category_scores_gemma":[0.0032841223,0.00046821093,0.0010450145,0.002153584,0.0009997878,0.0040033436,0.0037122865,0.0029423987,0.16737589],"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.00010881432,0.000094907904,0.00023756649,0.00043245818,0.000024537228,0.00010690237,0.00010834317,0.0008418681,0.0014698651,0.12667625,0.685258,0.18464056],"study_design_scores_gemma":[0.00001229309,0.000025675008,0.0003674711,0.00010283675,0.000009645617,0.00013898959,0.000081778155,0.0008386746,0.0007313637,0.03663017,0.9610485,0.000012510995],"about_ca_topic_score_codex":0.0026359002,"about_ca_topic_score_gemma":0.0038408742,"teacher_disagreement_score":0.3653104,"about_ca_system_score_codex":0.002817488,"about_ca_system_score_gemma":0.003258662,"threshold_uncertainty_score":0.90530765},"labels":[],"label_agreement":null},{"id":"W4400596848","doi":"10.55016/ojs/cdm.v15i2.62857","title":"A subspace based subspace inclusion graph on vector space","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Linear subspace; Geometry","score_opus":0.02762793962611365,"score_gpt":0.287593333763203,"score_spread":0.25996539413708936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596848","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.2783438,0.0008365615,0.6323392,0.001042621,0.00019746344,0.00016981066,0.0024947617,0.0014225221,0.083153404],"genre_scores_gemma":[0.8705493,0.0008734702,0.09551668,0.00046988946,0.00015121048,0.0002651954,0.004842151,0.0002755414,0.027056614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994137,0.00012718502,0.000022560145,0.0001663439,0.0001665412,0.00010365769],"domain_scores_gemma":[0.9992931,0.00010377533,0.00013751014,0.000104569306,0.00023028592,0.00013083112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021959443,0.00040793399,0.00037941802,0.0014802302,0.0009973262,0.0013086313,0.0005953574,0.00044019255,0.0054829684],"category_scores_gemma":[0.00070978946,0.00017304083,0.00042868446,0.0016729262,0.0010837642,0.0021118934,0.001408535,0.0008391856,0.001172938],"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.00006764627,0.000044393728,0.0009982751,0.00008361616,0.000020459058,0.00020994694,0.00048449272,0.0072079822,0.0037927995,0.9433624,0.0050431164,0.038684715],"study_design_scores_gemma":[0.000017721008,0.00013221566,0.002287736,0.00004029824,0.000026056767,0.00061710074,0.000612516,0.06989961,0.003987514,0.87681586,0.0455093,0.000054083637],"about_ca_topic_score_codex":0.0023085119,"about_ca_topic_score_gemma":0.0018858578,"teacher_disagreement_score":0.0054829684,"about_ca_system_score_codex":0.0006050077,"about_ca_system_score_gemma":0.0005795493,"threshold_uncertainty_score":0.018342376},"labels":[],"label_agreement":null},{"id":"W4400596849","doi":"10.55016/ojs/cdm.v15i2.62866","title":"A new mathematical model for tiling finite regions of the plane with polyominoes","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Underdetermined system; MATLAB; Mathematics; Polyomino; Backtracking; Binary number; Linear programming; Computer science; Algorithm; Combinatorics; Discrete mathematics; Geometry","score_opus":0.026359110865044805,"score_gpt":0.2696174514845941,"score_spread":0.2432583406195493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596849","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.010420261,0.00065979693,0.96980596,0.0013218609,0.00029714964,0.000064195185,0.0003098339,0.00015556831,0.0169654],"genre_scores_gemma":[0.3484024,0.0023287055,0.57753986,0.0013069669,0.0007071497,0.0011692125,0.00093625707,0.0005320028,0.06707736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.0001278175,0.00003333435,0.00015133752,0.00020219799,0.00006712706],"domain_scores_gemma":[0.9993703,0.00027793497,0.00011551201,0.00008373175,0.00008750243,0.00006506238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007111304,0.0007102766,0.0009720581,0.00095832336,0.00087269803,0.0018652341,0.0018355926,0.0017637074,0.009152806],"category_scores_gemma":[0.0020752698,0.00062733155,0.0015943896,0.0010678748,0.002551393,0.0027918746,0.0017195825,0.0020953044,0.0015953827],"study_design_candidate":"simulation_or_modeling","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.00001932237,0.000021840473,0.00026877914,0.0001332561,0.000011051949,0.000121946214,0.00013084966,0.26163706,0.002644398,0.7235274,0.004561095,0.0069230692],"study_design_scores_gemma":[0.000016679116,0.00003197189,0.000117477815,0.000035214856,0.00000903806,0.00014126733,0.000048714595,0.6824373,0.00083322974,0.29907805,0.017226078,0.000025019035],"about_ca_topic_score_codex":0.0030916475,"about_ca_topic_score_gemma":0.0036614619,"teacher_disagreement_score":0.009152806,"about_ca_system_score_codex":0.001718122,"about_ca_system_score_gemma":0.0010501401,"threshold_uncertainty_score":0.030619144},"labels":[],"label_agreement":null},{"id":"W4400596851","doi":"10.55016/ojs/cdm.v15i3.62721","title":"Alternating series of Apéry-type for the Riemann zeta function","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Riemann zeta function; Mathematics; Series (stratigraphy); Particular values of Riemann zeta function; Type (biology); Riemann hypothesis; Transformation (genetics); Class (philosophy); Pure mathematics; Arithmetic zeta function; Function (biology); Mathematical analysis; Prime zeta function; Combinatorics; Computer science; Chemistry","score_opus":0.062275568514576995,"score_gpt":0.3553928450027088,"score_spread":0.2931172764881318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596851","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.5554081,0.0008804961,0.28025705,0.0011347149,0.0009958032,0.000114503644,0.00017254466,0.00043719838,0.16059963],"genre_scores_gemma":[0.93636775,0.0006155228,0.0325392,0.0003013381,0.0006239168,0.0001032654,0.000118687276,0.00015939088,0.029170992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954444,0.00010212736,0.000028444603,0.000070976785,0.00018543135,0.00006850434],"domain_scores_gemma":[0.99924785,0.00025591304,0.0001284346,0.00011656414,0.00012716584,0.00012401528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009720848,0.00078491046,0.0004631454,0.0016625935,0.0012286415,0.0020243987,0.0010189522,0.0009396712,0.0077078803],"category_scores_gemma":[0.0036524208,0.00021723019,0.00084370613,0.0007483877,0.0021941273,0.0032465064,0.0013868026,0.0018716217,0.001484275],"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.000021501928,0.000017375734,0.00030208874,0.000021648304,0.0000034578109,0.00016910964,0.00018994007,0.00064169796,0.002521212,0.9898023,0.0004868809,0.005822874],"study_design_scores_gemma":[0.00002026426,0.00003095747,0.00038018162,0.000019906343,0.000009336643,0.00045726157,0.00010014908,0.013314853,0.0022314126,0.97866666,0.0047483044,0.000020868949],"about_ca_topic_score_codex":0.0002098571,"about_ca_topic_score_gemma":0.00020682871,"teacher_disagreement_score":0.0077078803,"about_ca_system_score_codex":0.00071553246,"about_ca_system_score_gemma":0.00036632578,"threshold_uncertainty_score":0.025785446},"labels":[],"label_agreement":null},{"id":"W4400596853","doi":"10.55016/ojs/cdm.v16i1.69831","title":"Lengths of extremal square-free ternary words","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square-free integer; Ternary operation; Word (group theory); Mathematics; Square (algebra); Alphabet; Combinatorics; Sigma; Discrete mathematics; Geometry; Computer science; Linguistics; Physics","score_opus":0.010786793229228257,"score_gpt":0.27178721306637393,"score_spread":0.26100041983714567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596853","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.91987705,0.0015785384,0.05668714,0.00044626743,0.00013326432,0.000029949822,0.0006467481,0.00027816923,0.020322917],"genre_scores_gemma":[0.9788366,0.00033089521,0.017717518,0.0000705797,0.00009717879,0.000063274776,0.00035431975,0.00009850676,0.00243112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991346,0.0001477401,0.000114884126,0.00023477634,0.00022510045,0.00014283523],"domain_scores_gemma":[0.9955668,0.0022545923,0.0008592742,0.00032508632,0.00058219355,0.00041201696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004835812,0.00034134448,0.0003834727,0.0013417719,0.0009666589,0.0015888135,0.0005938816,0.00067833526,0.004213683],"category_scores_gemma":[0.006314625,0.00042666803,0.0003218398,0.00085649255,0.0013772722,0.0021103204,0.0012412487,0.00070191856,0.00056039524],"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.00080843834,0.00008213421,0.007411156,0.0006764122,0.00006864665,0.0010287055,0.00133497,0.021002738,0.059291113,0.8553895,0.003179107,0.04972717],"study_design_scores_gemma":[0.000054463148,0.00021948901,0.0054246658,0.00012897066,0.00006679535,0.0017855064,0.000751327,0.05304984,0.034948826,0.89059424,0.012817598,0.00015823107],"about_ca_topic_score_codex":0.00014246228,"about_ca_topic_score_gemma":0.00019133314,"teacher_disagreement_score":0.004213683,"about_ca_system_score_codex":0.0006147578,"about_ca_system_score_gemma":0.00031493718,"threshold_uncertainty_score":0.0140962005},"labels":[],"label_agreement":null},{"id":"W4400596854","doi":"10.55016/ojs/cdm.v16i3.69926","title":"Degree conditions of nearly induced matching extendable graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Graph; Matching (statistics); Factor-critical graph; Discrete mathematics; Graph power; Line graph","score_opus":0.037133332334841104,"score_gpt":0.34569371354047956,"score_spread":0.30856038120563845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596854","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.89575887,0.0005043717,0.068701915,0.00075091276,0.00006301794,0.0000962736,0.0017807027,0.00028311313,0.032060906],"genre_scores_gemma":[0.98206306,0.00034376126,0.012934686,0.00014692234,0.00007623393,0.000065930566,0.0013938833,0.00004450959,0.002931016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992874,0.000094441675,0.000055800672,0.00023167391,0.00017273973,0.00015797146],"domain_scores_gemma":[0.9970957,0.0012305566,0.0004940424,0.0002525486,0.00036503345,0.000562141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005003161,0.0005095,0.00051402976,0.0011312751,0.00067081576,0.0009587059,0.0007983932,0.00075311307,0.004705198],"category_scores_gemma":[0.0033028023,0.00033069614,0.00049804855,0.0009905678,0.000866295,0.0028584038,0.0015340172,0.0013382426,0.00051803846],"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.0012134485,0.00040660397,0.014573857,0.0007109637,0.000100901736,0.0026906733,0.0015813851,0.067200124,0.0947105,0.75397575,0.0069431276,0.05589273],"study_design_scores_gemma":[0.00017674862,0.00036618765,0.013429265,0.00011157223,0.0000801854,0.0021440673,0.0010892726,0.11249282,0.035474744,0.8185954,0.01593481,0.00010493963],"about_ca_topic_score_codex":0.0008442139,"about_ca_topic_score_gemma":0.0012494047,"teacher_disagreement_score":0.004705198,"about_ca_system_score_codex":0.00065270736,"about_ca_system_score_gemma":0.0003351398,"threshold_uncertainty_score":0.015740454},"labels":[],"label_agreement":null},{"id":"W4400596855","doi":"10.55016/ojs/cdm.v15i3.62247","title":"Normality of one-matching semi-Cayley graphs over finite abelian groups with maximum degree 3","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Cayley graph; Vertex-transitive graph; Abelian group; Graph; Cayley's theorem; Discrete mathematics; Matching (statistics); Finite group; Degree (music); Line graph; Group (periodic table); Voltage graph; Statistics","score_opus":0.07135929301127203,"score_gpt":0.33384762210727553,"score_spread":0.2624883290960035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596855","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.9689984,0.000079291385,0.021474935,0.00020656569,0.000013473538,0.000020886382,0.00017440089,0.00011396289,0.008918125],"genre_scores_gemma":[0.99451244,0.00006437228,0.0036327026,0.000025707874,0.0000145596205,0.000013254637,0.00024650426,0.000014442074,0.0014760629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995499,0.00009558714,0.000032666863,0.0001369105,0.000108639775,0.00007623044],"domain_scores_gemma":[0.99775934,0.000798038,0.00050304364,0.00027569485,0.0003007325,0.0003631923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030832423,0.00037210752,0.00034602458,0.00086995325,0.00067748607,0.0014152175,0.0006749208,0.00038401378,0.0019445894],"category_scores_gemma":[0.0016656893,0.0002512311,0.0004034202,0.0005975839,0.0017885196,0.0020999669,0.00087381055,0.0006556176,0.00031532234],"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.00057682494,0.00019145908,0.019389333,0.00020464092,0.000065842,0.0009501184,0.002724302,0.012692915,0.05641015,0.8777424,0.0018366956,0.027215373],"study_design_scores_gemma":[0.000059821665,0.00016280796,0.0061840448,0.000030827723,0.000050485072,0.0010991828,0.0013562201,0.051530395,0.026196085,0.9073762,0.005910592,0.00004329755],"about_ca_topic_score_codex":0.0015432884,"about_ca_topic_score_gemma":0.0013108474,"teacher_disagreement_score":0.0019445894,"about_ca_system_score_codex":0.00070665975,"about_ca_system_score_gemma":0.00043505064,"threshold_uncertainty_score":0.0065053105},"labels":[],"label_agreement":null},{"id":"W4400596861","doi":"10.55016/ojs/cdm.v15i3.62742","title":"A classification of isomorphism-invariant random digraphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission","keywords":"Combinatorics; Mathematics; Randomness; Vertex (graph theory); Discrete mathematics; Invariant (physics); Isomorphism (crystallography); Random graph; Graph","score_opus":0.032306691093479986,"score_gpt":0.3125621024309222,"score_spread":0.2802554113374422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596861","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.40464514,0.001106756,0.53458786,0.0011799156,0.00017623228,0.00037708465,0.0026032715,0.0011397249,0.05418406],"genre_scores_gemma":[0.93934244,0.0007476337,0.043970775,0.00044753996,0.00012608578,0.00028337695,0.0031896832,0.00014428813,0.011748158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986897,0.00027584168,0.00011283615,0.00045304155,0.00023493177,0.00023363299],"domain_scores_gemma":[0.9954366,0.0020630516,0.0006361625,0.00083974213,0.0005041005,0.00052030303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074384216,0.0005937517,0.0006964407,0.0025224295,0.0009721349,0.002209776,0.0009268148,0.0009462914,0.0059359577],"category_scores_gemma":[0.00515339,0.0003665988,0.00090582354,0.0014038226,0.001909826,0.0024336192,0.0012950215,0.0012199954,0.0007988194],"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.000096324264,0.000083880615,0.0067264414,0.00014253381,0.000054465003,0.00034267097,0.000314279,0.010197591,0.0035896117,0.9410406,0.003306185,0.034105368],"study_design_scores_gemma":[0.0000614882,0.00012458423,0.004869362,0.000059367518,0.000051040253,0.00076456595,0.0002903388,0.078730024,0.002256779,0.8940316,0.018679101,0.00008175928],"about_ca_topic_score_codex":0.0015488745,"about_ca_topic_score_gemma":0.001213484,"teacher_disagreement_score":0.0059359577,"about_ca_system_score_codex":0.0015300077,"about_ca_system_score_gemma":0.00069052866,"threshold_uncertainty_score":0.019857764},"labels":[],"label_agreement":null},{"id":"W4400596866","doi":"10.55016/ojs/cdm.v15i2.62639","title":"The 2-tuple dominating independent number of a random graph","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Tuple; Graph; Dominating set; Random graph; Discrete mathematics","score_opus":0.01744434532324139,"score_gpt":0.3260284658623288,"score_spread":0.3085841205390874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596866","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.37626433,0.006361227,0.5427318,0.009525902,0.00055684906,0.00028235972,0.0014178095,0.0008213293,0.062038347],"genre_scores_gemma":[0.9391093,0.0031850622,0.03884512,0.0011551691,0.00068152416,0.00039979053,0.00056442764,0.00022852967,0.015831087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979882,0.0007476435,0.000075020005,0.00045770837,0.0004464481,0.00028488442],"domain_scores_gemma":[0.98398095,0.0117692305,0.0010842959,0.0009225717,0.00093119545,0.0013116809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020737653,0.0012564211,0.0018584534,0.0030792376,0.0018812759,0.0036329718,0.0024695224,0.0016224285,0.004067214],"category_scores_gemma":[0.016292479,0.00076275313,0.0011391123,0.0020304963,0.0044061374,0.0068586804,0.0030422155,0.0033416855,0.0009635524],"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.000355546,0.000060558294,0.0020507104,0.0003161004,0.00008977899,0.0003060325,0.0005368994,0.043297708,0.006768771,0.9229822,0.009600443,0.013635348],"study_design_scores_gemma":[0.00007457827,0.00017263766,0.0018396974,0.000103850405,0.00010515716,0.00089011475,0.00013981598,0.40876895,0.008341918,0.5686335,0.010821255,0.00010859997],"about_ca_topic_score_codex":0.00080367154,"about_ca_topic_score_gemma":0.0005231919,"teacher_disagreement_score":0.004067214,"about_ca_system_score_codex":0.0027510906,"about_ca_system_score_gemma":0.00095881283,"threshold_uncertainty_score":0.019960701},"labels":[],"label_agreement":null},{"id":"W4400596869","doi":"10.55016/ojs/cdm.v15i2.62472","title":"Triple product sums of Catalan triangle numbers","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Catalan number; Combinatorics; Conjecture; Product (mathematics); Transformation (genetics); Catalan; Hypergeometric distribution; Quadratic equation; Pure mathematics; Geometry","score_opus":0.04524312105624283,"score_gpt":0.34983096123410956,"score_spread":0.3045878401778667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596869","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.3710617,0.0017138812,0.3114968,0.0009441371,0.0017644096,0.00014173063,0.00043610623,0.0005835011,0.31185767],"genre_scores_gemma":[0.9006361,0.0012329655,0.045417547,0.0003973087,0.0009980802,0.00019007821,0.0005282221,0.0003890567,0.05021064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904627,0.0001380744,0.000048636804,0.0001611099,0.00047043155,0.00013551839],"domain_scores_gemma":[0.999356,0.00017863675,0.000072842304,0.00008993631,0.00019386268,0.00010887806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838722,0.0005637715,0.0006555357,0.0029286682,0.0012448635,0.002893952,0.0010075389,0.00069016876,0.009358012],"category_scores_gemma":[0.0027449892,0.00032970827,0.000909063,0.0016181136,0.0019178658,0.0029383292,0.0013690015,0.0020798142,0.0018940956],"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.000019359299,0.000014719758,0.00016345603,0.00003529962,0.000005809418,0.00015484726,0.0001478987,0.00080698135,0.0023874794,0.98513895,0.0011699019,0.0099552395],"study_design_scores_gemma":[0.000008148297,0.000024512723,0.0003923006,0.000020742145,0.000011126489,0.00042901124,0.000092055576,0.011738378,0.0031146929,0.9755442,0.008598865,0.000025938638],"about_ca_topic_score_codex":0.00047354726,"about_ca_topic_score_gemma":0.0006040691,"teacher_disagreement_score":0.009358012,"about_ca_system_score_codex":0.00093502406,"about_ca_system_score_gemma":0.0005110382,"threshold_uncertainty_score":0.03130567},"labels":[],"label_agreement":null},{"id":"W4400596870","doi":"10.55016/ojs/cdm.v15i2.62352","title":"$Q_4$-Factorization of $\\lambda K_n$ and $\\lambda K_x(m)$","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Lambda; Factorization; Combinatorics; Mathematics; Graph; Physics; Algorithm","score_opus":0.008506781654910561,"score_gpt":0.22344907458835542,"score_spread":0.21494229293344486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596870","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.4001261,0.0007221985,0.5028815,0.0012498593,0.00040652347,0.00036333685,0.0013163487,0.00054737896,0.092386745],"genre_scores_gemma":[0.8251924,0.00039347788,0.14615124,0.00050404784,0.00018401565,0.00023440938,0.0010660349,0.00020410793,0.026070198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998944,0.00013629302,0.000046505997,0.00035265082,0.00016286522,0.00035761273],"domain_scores_gemma":[0.99789494,0.00085835304,0.00022549712,0.00033538466,0.00036238562,0.00032342027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079601316,0.0007533406,0.00060843537,0.0005458148,0.002086389,0.001490825,0.00051932817,0.00077957223,0.016141344],"category_scores_gemma":[0.0027254117,0.00053149596,0.0014255315,0.0003204843,0.0017586824,0.0031384977,0.0014988704,0.001935659,0.002801797],"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.0008933395,0.00025498506,0.003782086,0.00037060573,0.00004674909,0.0010103473,0.00092912634,0.01696785,0.06519699,0.86997485,0.009751737,0.030821325],"study_design_scores_gemma":[0.00011021296,0.00048348296,0.0023542435,0.00012756648,0.00007880856,0.0015837668,0.000990975,0.06730258,0.036376227,0.84897095,0.04151215,0.00010902549],"about_ca_topic_score_codex":0.0023666057,"about_ca_topic_score_gemma":0.0038019815,"teacher_disagreement_score":0.016141344,"about_ca_system_score_codex":0.0011172673,"about_ca_system_score_gemma":0.0014795645,"threshold_uncertainty_score":0.053998232},"labels":[],"label_agreement":null},{"id":"W4400596963","doi":"10.55016/ojs/cdm.v16i3.71007","title":"Flag vector pairs, fatness, and their bounds for 4-polytopes","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chosun University","keywords":"Polytope; Flag (linear algebra); Combinatorics; Mathematics; Regular polygon; Function (biology); Pure mathematics; Algebra over a field; Geometry","score_opus":0.04650167863584513,"score_gpt":0.35150466674295855,"score_spread":0.3050029881071134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596963","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.440028,0.005277003,0.47546172,0.0011179979,0.00024984535,0.000100726,0.0010715583,0.00035784667,0.07633525],"genre_scores_gemma":[0.9180388,0.0024960672,0.06591323,0.0002747881,0.00016444126,0.0002061346,0.0013415897,0.00017970997,0.011385198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989643,0.0002297991,0.00005372161,0.00021737134,0.00027980408,0.00025494242],"domain_scores_gemma":[0.99663866,0.001945243,0.0004187869,0.00021461159,0.00037636174,0.00040630923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015329651,0.001279689,0.0009051654,0.0031453916,0.0011893411,0.001967992,0.001468826,0.00080128066,0.009708972],"category_scores_gemma":[0.0057635517,0.00058047083,0.001275746,0.0019337559,0.002365119,0.0051529896,0.002757343,0.0029421328,0.00085676846],"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.00022721651,0.000077623605,0.0046831807,0.00037719752,0.00007209363,0.00027965094,0.00046285026,0.03320907,0.004614384,0.91726434,0.00332611,0.035406273],"study_design_scores_gemma":[0.000024453526,0.00026730986,0.006953713,0.00015748001,0.000067232744,0.0004479788,0.0006053161,0.13268824,0.0038016546,0.84228384,0.012617766,0.00008503872],"about_ca_topic_score_codex":0.0020141753,"about_ca_topic_score_gemma":0.0013364409,"teacher_disagreement_score":0.009708972,"about_ca_system_score_codex":0.0014139345,"about_ca_system_score_gemma":0.00048384655,"threshold_uncertainty_score":0.032479763},"labels":[],"label_agreement":null},{"id":"W4400596966","doi":"10.55016/ojs/cdm.v16i3.72114","title":"On the homotopy type of complexes of graphs with bounded domination number","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Mathematics; Combinatorics; Homotopy; Bounded function; Type (biology); Assertion; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.020209359730731957,"score_gpt":0.29798672960534367,"score_spread":0.2777773698746117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596966","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.8961225,0.00055249606,0.070065945,0.0006878637,0.000087351815,0.000038564976,0.00029553726,0.00013539357,0.03201437],"genre_scores_gemma":[0.9848363,0.0003025044,0.0087222615,0.00013844854,0.00006272949,0.000045760276,0.00033485796,0.00006295658,0.0054942872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907076,0.0002169633,0.000062225736,0.00020836323,0.00024122061,0.00020057904],"domain_scores_gemma":[0.99401677,0.003301052,0.0006544512,0.0004926907,0.00052594655,0.0010090497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013663716,0.00046343464,0.0004653472,0.004726415,0.0018810584,0.0039625545,0.0012986517,0.0010419963,0.007073055],"category_scores_gemma":[0.007144852,0.0004498685,0.00059474516,0.0016213938,0.0031938215,0.0060766093,0.0026710378,0.0012075503,0.0005293152],"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.000112424015,0.000034358287,0.005470463,0.00004010705,0.000016865668,0.00029949675,0.0007927557,0.0021803048,0.0026680646,0.97963583,0.0008553237,0.007893894],"study_design_scores_gemma":[0.000029808461,0.000043277516,0.003760364,0.00005213812,0.000025650716,0.00046088692,0.00087312795,0.023758005,0.0026842756,0.96285707,0.0054137493,0.000041643958],"about_ca_topic_score_codex":0.0018567743,"about_ca_topic_score_gemma":0.0013588035,"teacher_disagreement_score":0.007073055,"about_ca_system_score_codex":0.0015569392,"about_ca_system_score_gemma":0.00038686697,"threshold_uncertainty_score":0.023661673},"labels":[],"label_agreement":null},{"id":"W4400596989","doi":"10.55016/ojs/cdm.v16i3.71109","title":"Starred Italian domination in graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Domination analysis; Neighbourhood (mathematics); Vertex (graph theory); Graph; Omega; Discrete mathematics; Physics","score_opus":0.015552851451988425,"score_gpt":0.3261180961084776,"score_spread":0.31056524465648916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596989","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.7248104,0.002124344,0.2315401,0.00091981195,0.000060196482,0.00008104989,0.0014090043,0.00076232327,0.038292766],"genre_scores_gemma":[0.97074854,0.00080327236,0.022803295,0.00014436671,0.00008299229,0.00004534048,0.00072958204,0.00008228293,0.0045602317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933285,0.00012809383,0.000032052696,0.00021479542,0.00014665036,0.00014553189],"domain_scores_gemma":[0.9976508,0.0015098745,0.0002497367,0.00023541546,0.00016990495,0.00018425005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005507379,0.0006584884,0.00046944906,0.0013707314,0.0008703546,0.0017039258,0.0007229538,0.00048163044,0.0024336295],"category_scores_gemma":[0.003583681,0.00034223372,0.000524954,0.0022161356,0.001754485,0.0026288843,0.0009792486,0.0008050013,0.00032554878],"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.0005513431,0.00016250537,0.01357924,0.00053069927,0.00011981161,0.00058029115,0.0016314271,0.13069932,0.01425004,0.69993556,0.012268368,0.1256914],"study_design_scores_gemma":[0.000041475767,0.00008025464,0.0061396672,0.000057066125,0.00007764968,0.0007342857,0.00035997282,0.267519,0.006132197,0.6991823,0.019622209,0.000053844975],"about_ca_topic_score_codex":0.002946248,"about_ca_topic_score_gemma":0.003924991,"teacher_disagreement_score":0.002946248,"about_ca_system_score_codex":0.0021003846,"about_ca_system_score_gemma":0.0006899057,"threshold_uncertainty_score":0.015239358},"labels":[],"label_agreement":null},{"id":"W4400596992","doi":"10.55016/ojs/cdm.v1i1.61879","title":"N-free extensions of posets. Note on a theorem of P.A.Grillet","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially ordered set; Combinatorics; Diagonal; Mathematics; Vertex (graph theory); Hasse diagram; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Graph; Geometry; Computer science","score_opus":0.01532253781801179,"score_gpt":0.3206978809269528,"score_spread":0.305375343108941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596992","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.18219483,0.003426169,0.603118,0.0017433505,0.00095855613,0.00017549847,0.0004867692,0.0007932588,0.20710352],"genre_scores_gemma":[0.81731445,0.0017510089,0.124065734,0.0010509432,0.0005756826,0.00032055652,0.0007128895,0.00041084978,0.05379785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910504,0.00024934794,0.00006252071,0.0002882169,0.00016373531,0.00013104672],"domain_scores_gemma":[0.9985519,0.0008940876,0.000091826725,0.00018443758,0.00008691401,0.00019093759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011687513,0.0008610401,0.0005985002,0.0011260364,0.00221676,0.002201246,0.0009934187,0.0007684994,0.01175203],"category_scores_gemma":[0.0024305775,0.0007786998,0.0018674583,0.0008115631,0.00404945,0.0069093783,0.0049892976,0.0030343798,0.0014354311],"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.000047726408,0.000030708292,0.00022702604,0.0000636911,0.0000055207092,0.00014006077,0.00046709817,0.0012067013,0.0015102745,0.9821614,0.0013068535,0.012833078],"study_design_scores_gemma":[0.000019028734,0.000040465955,0.00019550142,0.000023356908,0.000007498366,0.0002725258,0.00009732491,0.0015981748,0.0014087417,0.9785001,0.017820964,0.000016302203],"about_ca_topic_score_codex":0.0009374999,"about_ca_topic_score_gemma":0.0016587994,"teacher_disagreement_score":0.01175203,"about_ca_system_score_codex":0.0007290453,"about_ca_system_score_gemma":0.0004387897,"threshold_uncertainty_score":0.03931451},"labels":[],"label_agreement":null},{"id":"W4400597008","doi":"10.55016/ojs/cdm.v16i3.71250","title":"Bailey and Daum's q-Kummer Theorem and Extensions","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Integer (computer science); Linearization; Combinatorics; Algebra over a field; Pure mathematics; Nonlinear system; Computer science","score_opus":0.027237223760112214,"score_gpt":0.34811961973209793,"score_spread":0.3208823959719857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400597008","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.097161025,0.0026677514,0.6324868,0.0026609404,0.00060842565,0.000086590946,0.0001421199,0.00066708896,0.2635193],"genre_scores_gemma":[0.83183044,0.0023645926,0.09676069,0.0012846948,0.00077580154,0.00014569395,0.00009969558,0.00037034476,0.06636811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963427,0.000108782995,0.000023397764,0.000059322003,0.00012312911,0.00005110259],"domain_scores_gemma":[0.9994307,0.00023420535,0.0000613724,0.00007558695,0.00013562653,0.0000624903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011079352,0.00061562174,0.0005166971,0.0016249223,0.0014637741,0.0017797727,0.0012159338,0.0008584943,0.0070661264],"category_scores_gemma":[0.0027690295,0.00024931284,0.00073629414,0.0010914624,0.00331193,0.003588281,0.0015246028,0.0018907854,0.002452223],"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.0000040486043,0.000006018915,0.000033323988,0.000017003907,0.0000012045616,0.00003126069,0.00012537674,0.00028873121,0.0004427261,0.99512887,0.0005082487,0.003413169],"study_design_scores_gemma":[0.000004236358,0.000011468368,0.00005697314,0.000011891328,0.0000028887164,0.00011192308,0.00006358129,0.0036365348,0.00068709714,0.9890149,0.006387402,0.000011141589],"about_ca_topic_score_codex":0.00057234196,"about_ca_topic_score_gemma":0.000442953,"teacher_disagreement_score":0.0070661264,"about_ca_system_score_codex":0.0010246382,"about_ca_system_score_gemma":0.00051181886,"threshold_uncertainty_score":0.023638546},"labels":[],"label_agreement":null},{"id":"W4400597021","doi":"10.55016/ojs/cdm.v1i1.61883","title":"Convolution over Lie and Jordan algebras","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Saskatchewan","keywords":"Mathematics; Convolution (computer science); Non-associative algebra; Class (philosophy); Commutative property; Pure mathematics; Lie algebra; Associative property; Jordan algebra; Subalgebra; Lie conformal algebra; Set (abstract data type); Algebra over a field; Algebra representation; Computer science","score_opus":0.016267927703843398,"score_gpt":0.31707918417331477,"score_spread":0.3008112564694714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400597021","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.4888301,0.0022269813,0.3833975,0.0012361904,0.00026848778,0.000084063744,0.0002737681,0.0003506801,0.12333228],"genre_scores_gemma":[0.93836784,0.0006289862,0.046852723,0.00023008883,0.0002731625,0.00006450038,0.00017053689,0.00005816453,0.013353967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984737,0.00037848137,0.00010969705,0.000270443,0.00049719086,0.00027039324],"domain_scores_gemma":[0.9986462,0.0003210069,0.00019147662,0.00016229563,0.00036192907,0.00031713364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017720205,0.0003741796,0.00050297467,0.0009639091,0.0018885938,0.0021120552,0.000508343,0.00058832444,0.003389257],"category_scores_gemma":[0.0036738038,0.00025893276,0.0008488731,0.0010112831,0.0025151873,0.004409536,0.0024938344,0.0010857044,0.00059152365],"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.000025520312,0.000012446649,0.00022105851,0.00001603433,0.000004663587,0.0000852954,0.00022055437,0.0006972359,0.0011759435,0.99353856,0.00027344347,0.003729283],"study_design_scores_gemma":[0.000007986186,0.00003791706,0.00037744406,0.000014630797,0.000010909858,0.00030688386,0.000117779964,0.011814808,0.002689939,0.97725767,0.0073465244,0.000017642018],"about_ca_topic_score_codex":0.001145408,"about_ca_topic_score_gemma":0.00094940653,"teacher_disagreement_score":0.003389257,"about_ca_system_score_codex":0.0015042,"about_ca_system_score_gemma":0.0010403581,"threshold_uncertainty_score":0.011338234},"labels":[],"label_agreement":null},{"id":"W4400597037","doi":"10.55016/ojs/cdm.v16i3.71273","title":"Oriented unicyclic graphs with minimal skew Randić energy","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Sigma; Graph; Skew-symmetric matrix; Skew; Eigenvalues and eigenvectors; Physics; Symmetric matrix; Square matrix","score_opus":0.014509283144606405,"score_gpt":0.29761211877887217,"score_spread":0.28310283563426575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400597037","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.87602216,0.0006109472,0.041318838,0.00048475724,0.00013792384,0.00007257645,0.0007198024,0.00033489647,0.080298126],"genre_scores_gemma":[0.97756803,0.00033824414,0.011818655,0.00020115246,0.000038736394,0.00007027693,0.00061964727,0.00008439676,0.009260958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997756,0.000039468323,0.000012375548,0.000039470655,0.00006437624,0.00006870556],"domain_scores_gemma":[0.99950707,0.000109330846,0.00012117043,0.00006516394,0.00008774238,0.000109611676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012533095,0.00038003613,0.00041548608,0.001028689,0.00078462367,0.0011335707,0.0005013847,0.0006248427,0.0047321157],"category_scores_gemma":[0.0009075982,0.00033345103,0.00023524277,0.0010273135,0.00067210966,0.0006168807,0.00078289397,0.0004479886,0.0007333471],"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.0003363061,0.0000749974,0.0018066169,0.00030718386,0.000038196362,0.00081079185,0.00033707992,0.030233335,0.015413472,0.9031157,0.008445149,0.039081175],"study_design_scores_gemma":[0.000111763155,0.0001237594,0.0032304497,0.00008505947,0.000048307982,0.001302104,0.00041301077,0.097333916,0.008122901,0.8716187,0.017536825,0.00007330523],"about_ca_topic_score_codex":0.0007326521,"about_ca_topic_score_gemma":0.0014256163,"teacher_disagreement_score":0.0047321157,"about_ca_system_score_codex":0.0005078735,"about_ca_system_score_gemma":0.00035835002,"threshold_uncertainty_score":0.015830457},"labels":[],"label_agreement":null},{"id":"W4403969767","doi":"10.55016/ojs/cdm.v19i3.74134","title":"A linear time approach to three-dimensional reconstruction by discrete tomography","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Università Cattolica del Sacro Cuore; Monash University","keywords":"Mathematics; Tomography; Algorithm; Applied mathematics; Mathematical optimization; Medicine; Radiology","score_opus":0.009945675056371128,"score_gpt":0.27015537570318493,"score_spread":0.2602097006468138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403969767","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.0022246307,0.00013758375,0.99403787,0.00031903322,0.0000294924,0.00001606961,0.00001845802,0.00011821253,0.0030985244],"genre_scores_gemma":[0.14931773,0.00055969704,0.8403127,0.00022031197,0.00008905076,0.00014443672,0.00010194386,0.00017670431,0.009077431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996613,0.00012025715,0.000011457635,0.000043662298,0.00013497246,0.00002824863],"domain_scores_gemma":[0.9992348,0.00047040812,0.00006684454,0.00013014826,0.00006094501,0.000036885293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061107206,0.00042966122,0.00039159448,0.00051085115,0.0004543627,0.0011900449,0.0012530361,0.0007563932,0.0038124416],"category_scores_gemma":[0.0019637286,0.0003343538,0.0005714799,0.000545319,0.0020381692,0.0013416351,0.0016885382,0.0022528653,0.0007387918],"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.00012184723,0.00007695384,0.00036737838,0.00026623084,0.000036256388,0.00013513755,0.00023852775,0.21167688,0.015402681,0.7016571,0.002732186,0.06728879],"study_design_scores_gemma":[0.000014538405,0.00001680491,0.000051103736,0.00001121438,0.0000034296124,0.00006010889,0.00001991501,0.9120486,0.0024805102,0.08100517,0.0042760023,0.000012544571],"about_ca_topic_score_codex":0.0012869996,"about_ca_topic_score_gemma":0.0015260486,"teacher_disagreement_score":0.0038124416,"about_ca_system_score_codex":0.0010208216,"about_ca_system_score_gemma":0.00071542844,"threshold_uncertainty_score":0.012753844},"labels":[],"label_agreement":null},{"id":"W4403969777","doi":"10.55016/ojs/cdm.v19i2.72712","title":"Combinatorial proof of Girard-Waring formula","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorial proof; Mathematics; Combinatorics; Combinatorial analysis; Combinatorial algorithms","score_opus":0.008893299956262939,"score_gpt":0.3094824492079608,"score_spread":0.3005891492516979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403969777","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.117192045,0.0080064135,0.32024768,0.012198722,0.0031527006,0.0001599253,0.0013310519,0.00085743883,0.5368539],"genre_scores_gemma":[0.82672954,0.0047561587,0.09887002,0.0030680785,0.0027442344,0.00025398188,0.0011396289,0.00041106495,0.062027212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993431,0.00011307237,0.00003452405,0.00013668963,0.00029140018,0.00008114216],"domain_scores_gemma":[0.9991247,0.00039890708,0.000062096835,0.00011486787,0.00020869786,0.00009080092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058066286,0.0006505232,0.0008900804,0.0017077716,0.0016706064,0.0022144017,0.001579285,0.00091110234,0.014608908],"category_scores_gemma":[0.002568298,0.00045885515,0.0008970859,0.0016632677,0.0022103935,0.002884472,0.0026960557,0.003650188,0.00183965],"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.0000091386255,0.000023650458,0.0001286245,0.00006270199,0.000007201105,0.00016549152,0.00010218201,0.0007282364,0.0007733269,0.98513526,0.0057232147,0.0071410094],"study_design_scores_gemma":[0.000013709855,0.000014592562,0.0002628632,0.0000258712,0.00001183615,0.00027836717,0.00004409729,0.004755242,0.0008181889,0.9760768,0.017683122,0.000015396377],"about_ca_topic_score_codex":0.0012512441,"about_ca_topic_score_gemma":0.0017394205,"teacher_disagreement_score":0.014608908,"about_ca_system_score_codex":0.0013441325,"about_ca_system_score_gemma":0.00065888825,"threshold_uncertainty_score":0.048871696},"labels":[],"label_agreement":null},{"id":"W4403969779","doi":"10.55016/ojs/cdm.v19i3.68835","title":"Uniformly resolvable ${P_4, C_k}$-decomposition of $K_n$ - a complete solution","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Atomic Energy, Government of India; University Grants Commission","keywords":"Mathematics; Combinatorics; Decomposition; Discrete mathematics; Chemistry; Organic chemistry","score_opus":0.010436032785876681,"score_gpt":0.26578712690123246,"score_spread":0.2553510941153558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403969779","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.3601682,0.00033932988,0.5677537,0.0012062353,0.00011358249,0.00035409722,0.002020249,0.00034004063,0.067704625],"genre_scores_gemma":[0.6952358,0.0004944273,0.27159455,0.0005221249,0.00008133975,0.0005234236,0.004753564,0.00020498814,0.026589843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994659,0.00011815699,0.00002189043,0.00014494703,0.00009067457,0.00015838529],"domain_scores_gemma":[0.99894553,0.00041459006,0.00012176198,0.00017439952,0.00017397625,0.00016981908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005240393,0.0008373943,0.0006127905,0.00063296646,0.0008882826,0.0012542754,0.0008354181,0.0009399314,0.0095648505],"category_scores_gemma":[0.0024717436,0.00044603573,0.0008316296,0.00052999804,0.0009413424,0.0014806223,0.0014451019,0.0019199866,0.001099176],"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.00051262125,0.00030170847,0.0015334751,0.0003551582,0.000108576096,0.00049404433,0.00055763504,0.13429874,0.021163996,0.7763494,0.01688878,0.04743579],"study_design_scores_gemma":[0.00014988208,0.00015095898,0.0009483605,0.00007969809,0.000046631572,0.00034121057,0.00061417813,0.25213102,0.008122947,0.72375613,0.013624433,0.000034515673],"about_ca_topic_score_codex":0.0018785051,"about_ca_topic_score_gemma":0.0028944334,"teacher_disagreement_score":0.0095648505,"about_ca_system_score_codex":0.0008579109,"about_ca_system_score_gemma":0.0013399515,"threshold_uncertainty_score":0.03199762},"labels":[],"label_agreement":null},{"id":"W4403975908","doi":"10.55016/ojs/cdm.v19i2.75062","title":"Tilings of a honeycomb strip and higher order Fibonacci numbers","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Fibonacci number; Mathematics; Combinatorics; Order (exchange); Honeycomb; Geometry","score_opus":0.009778313946547112,"score_gpt":0.27882501780632063,"score_spread":0.26904670385977353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975908","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.5504885,0.0016746843,0.2889819,0.0005242477,0.0005375458,0.000083914,0.00021405477,0.00030936548,0.15718585],"genre_scores_gemma":[0.9135939,0.0005331764,0.06501701,0.00019133599,0.00011290998,0.0000977668,0.00015548193,0.00006613675,0.02023236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998148,0.000025855465,0.000015698171,0.000043132837,0.00006559784,0.00003495703],"domain_scores_gemma":[0.9996635,0.00014409394,0.0000507689,0.000060380593,0.000048901376,0.000032401185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016527947,0.00018219819,0.00019408691,0.00057528,0.00066337484,0.00090718304,0.00032157937,0.00041308254,0.0056683435],"category_scores_gemma":[0.00072941923,0.00015280039,0.00031408021,0.00042788425,0.0010031669,0.0015347076,0.00050086074,0.00048562032,0.00048279125],"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.000033549557,0.0000130682665,0.0005199799,0.00007615855,0.0000046304417,0.0002822082,0.00020511376,0.0027692604,0.010597508,0.96636057,0.0010164647,0.018121505],"study_design_scores_gemma":[0.000026899177,0.000085007625,0.0019223132,0.00003683901,0.000012854909,0.000987863,0.0003378857,0.036752474,0.016474798,0.9180392,0.025293209,0.000030564886],"about_ca_topic_score_codex":0.00042899212,"about_ca_topic_score_gemma":0.0007118379,"teacher_disagreement_score":0.0056683435,"about_ca_system_score_codex":0.00033095694,"about_ca_system_score_gemma":0.0001807161,"threshold_uncertainty_score":0.018962502},"labels":[],"label_agreement":null},{"id":"W4403975911","doi":"10.55016/ojs/cdm.v19i3.74917","title":"Reflexible covers of prisms","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optics and Image Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012397782149606924,"score_gpt":0.2903778717439958,"score_spread":0.2779800895943889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975911","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.7976503,0.00042783195,0.1074679,0.0003616469,0.000103966835,0.00005693453,0.0005535359,0.00046715324,0.09291083],"genre_scores_gemma":[0.9725725,0.00021602125,0.013740802,0.00006277812,0.000052084066,0.000038566828,0.00047485874,0.00006167465,0.0127807595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938345,0.00007316736,0.00003253731,0.00017847834,0.00020600058,0.00012642403],"domain_scores_gemma":[0.9992995,0.00020995241,0.00015049105,0.00012334723,0.00007897528,0.00013772548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022210611,0.00038150334,0.00036571044,0.0008414709,0.0010490383,0.0016366278,0.00047044933,0.00046240055,0.006854822],"category_scores_gemma":[0.0010486831,0.0004139855,0.00054932735,0.00044218244,0.0018711258,0.0018259248,0.00195335,0.001130675,0.0005953168],"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.000099413475,0.000025859612,0.0010139421,0.000094795985,0.000021654498,0.0004585394,0.00045366643,0.005134722,0.008458253,0.97216225,0.0009268711,0.011150012],"study_design_scores_gemma":[0.000055373206,0.00016884114,0.0037823564,0.00007224066,0.000041130097,0.0013813234,0.00094600307,0.028042836,0.0125334915,0.9264871,0.026439486,0.00004972899],"about_ca_topic_score_codex":0.0011814979,"about_ca_topic_score_gemma":0.0010640068,"teacher_disagreement_score":0.006854822,"about_ca_system_score_codex":0.0006316382,"about_ca_system_score_gemma":0.00032718165,"threshold_uncertainty_score":0.022931695},"labels":[],"label_agreement":null},{"id":"W4403975920","doi":"10.55016/ojs/cdm.v19i3.74589","title":"The interlacing properties of generalized Narayana polynomials","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Interlacing; Mathematics; Combinatorics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.03486424669583746,"score_gpt":0.34345029246839304,"score_spread":0.30858604577255555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975920","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.5911429,0.0016668098,0.35412136,0.00055944314,0.00022791888,0.000068475994,0.00030769195,0.00043647265,0.05146899],"genre_scores_gemma":[0.9639305,0.000512096,0.025637453,0.000116809446,0.00017230849,0.000047098343,0.00013109563,0.000109941604,0.009342595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945456,0.00008531707,0.00003178476,0.00013386797,0.00017847164,0.00011601527],"domain_scores_gemma":[0.9985683,0.00042056365,0.00033433444,0.00017904388,0.00033742163,0.00016021513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005274566,0.00042497332,0.00048997643,0.0012181508,0.0010058249,0.0009918152,0.0007801455,0.00035217984,0.004381671],"category_scores_gemma":[0.0041189776,0.00023905537,0.0005238276,0.0008140781,0.0013655911,0.0021019862,0.0008965543,0.0014564992,0.0006843912],"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.00010793391,0.000017417873,0.00095531816,0.00010652629,0.000011247905,0.00029765608,0.0005861304,0.004028143,0.01307711,0.96229416,0.0008701544,0.017648082],"study_design_scores_gemma":[0.000037393256,0.00014168017,0.0020432172,0.00005223263,0.000035840225,0.0010381138,0.00035621735,0.063382275,0.0111139305,0.9095654,0.012133223,0.000100471545],"about_ca_topic_score_codex":0.001100928,"about_ca_topic_score_gemma":0.0011346434,"teacher_disagreement_score":0.004381671,"about_ca_system_score_codex":0.00070187706,"about_ca_system_score_gemma":0.0005028369,"threshold_uncertainty_score":0.014658093},"labels":[],"label_agreement":null},{"id":"W4403975924","doi":"10.55016/ojs/cdm.v19i3.75984","title":"A new trigonometric identity with applications","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Identity (music); Trigonometry; Combinatorics; Geometry; Art; Aesthetics","score_opus":0.012579075943925634,"score_gpt":0.3272360181337652,"score_spread":0.31465694218983953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975924","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.039360993,0.0062115462,0.59965837,0.006872179,0.010230128,0.000067507026,0.00024522154,0.0005580761,0.33679602],"genre_scores_gemma":[0.60191214,0.010034168,0.22386162,0.007315554,0.012344557,0.00016212012,0.00038501708,0.0011858795,0.14279895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989312,0.0002632636,0.00006320387,0.00020907575,0.00035884554,0.00017433932],"domain_scores_gemma":[0.99901795,0.00033365504,0.000078061705,0.00015510705,0.0002779963,0.00013734857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012069109,0.001199449,0.0009614377,0.002561191,0.0023097114,0.0026253797,0.0014523565,0.0011493679,0.009495516],"category_scores_gemma":[0.0037560097,0.00038278732,0.0012519963,0.002156536,0.003724399,0.0044452553,0.003287247,0.0044369446,0.0036321604],"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.000016125736,0.00002126749,0.00012073479,0.00006203028,0.0000051518246,0.00014711179,0.0001846845,0.0005118289,0.0011806216,0.97841007,0.005052594,0.014287893],"study_design_scores_gemma":[0.000008275891,0.00003569473,0.00021605573,0.000045543457,0.000013430561,0.0005382596,0.00009053978,0.009010414,0.0019145312,0.9359718,0.05212306,0.000032361833],"about_ca_topic_score_codex":0.0012649195,"about_ca_topic_score_gemma":0.0011203928,"teacher_disagreement_score":0.009495516,"about_ca_system_score_codex":0.001460089,"about_ca_system_score_gemma":0.0012004707,"threshold_uncertainty_score":0.0317657},"labels":[],"label_agreement":null},{"id":"W4403975939","doi":"10.55016/ojs/cdm.v19i2.62694","title":"Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Combinatorics; Spanning tree; Mathematics; Discrete mathematics; Minimum spanning tree; Kruskal's algorithm; Minimum degree spanning tree; Trémaux tree; Graph; Line graph; Pathwidth","score_opus":0.0337211460636568,"score_gpt":0.29924187987234085,"score_spread":0.2655207338086841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975939","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.8014751,0.0009178923,0.15168095,0.001367379,0.000083400795,0.00009560689,0.001969453,0.00026575435,0.042144407],"genre_scores_gemma":[0.9586698,0.00038554188,0.033203542,0.00024738317,0.000084763655,0.00012644197,0.0013825165,0.000056292978,0.00584368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949765,0.00010483488,0.00003361821,0.00017808522,0.000083620085,0.000102216596],"domain_scores_gemma":[0.9983032,0.00076561485,0.00034664586,0.00021453931,0.00015057129,0.00021939502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032343494,0.00035271826,0.00048674535,0.0009999003,0.001454186,0.0014510833,0.0006835479,0.00082762353,0.005428205],"category_scores_gemma":[0.0021261475,0.0004330121,0.0006747195,0.0011028843,0.0010504363,0.0024196233,0.0009934268,0.0010171555,0.0004265629],"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.00021037395,0.00007561864,0.0031934401,0.00028949906,0.000046577432,0.00028906317,0.00081069925,0.015976613,0.0127515355,0.9403735,0.007118268,0.018864686],"study_design_scores_gemma":[0.000050087194,0.00010033525,0.006229646,0.000053323238,0.00007954449,0.0012482014,0.00066146534,0.068481974,0.006702273,0.8992761,0.017071566,0.00004566458],"about_ca_topic_score_codex":0.0007104283,"about_ca_topic_score_gemma":0.001279567,"teacher_disagreement_score":0.005428205,"about_ca_system_score_codex":0.00077848724,"about_ca_system_score_gemma":0.00040210635,"threshold_uncertainty_score":0.018159151},"labels":[],"label_agreement":null},{"id":"W4403975941","doi":"10.55016/ojs/cdm.v19i3.72392","title":"Canonical cuts of path powers","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Combinatorics; Computer science","score_opus":0.021397908840977906,"score_gpt":0.3312595906425476,"score_spread":0.3098616818015697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975941","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.35585296,0.0013375891,0.5768418,0.00076094933,0.00020301418,0.00024053022,0.0035426957,0.0014118619,0.059808724],"genre_scores_gemma":[0.82502633,0.00085173704,0.15908572,0.00030020642,0.00015621794,0.00026269382,0.0034246037,0.00077417056,0.010118337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981993,0.0003146497,0.000094375915,0.00053719105,0.00047652487,0.00037793844],"domain_scores_gemma":[0.9938373,0.003591224,0.0005651004,0.0009261372,0.0006905528,0.00038962986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009843155,0.00085566135,0.00072018744,0.0016376823,0.0009387142,0.0031886098,0.0010786745,0.0009933814,0.020245515],"category_scores_gemma":[0.013029109,0.00070097024,0.0012289949,0.0022872635,0.0024334004,0.005072234,0.0020610432,0.0021431278,0.0018348756],"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.0006200788,0.00009079731,0.0037097025,0.00049670966,0.00007387389,0.0003951917,0.00040746955,0.06944348,0.007527053,0.82029957,0.013038012,0.083898045],"study_design_scores_gemma":[0.00005963778,0.000106896776,0.0012845037,0.000084059604,0.000044232052,0.00048096507,0.00019163497,0.12087099,0.0061204,0.8558784,0.014847234,0.000031028467],"about_ca_topic_score_codex":0.0014166286,"about_ca_topic_score_gemma":0.0013897014,"teacher_disagreement_score":0.020245515,"about_ca_system_score_codex":0.0013048024,"about_ca_system_score_gemma":0.00080502464,"threshold_uncertainty_score":0.06772804},"labels":[],"label_agreement":null},{"id":"W4403975959","doi":"10.55016/ojs/cdm.v19i3.75377","title":"Split lattice paths and Rogers-Ramanujan type identities","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Ramanujan's sum; Type (biology); Lattice (music); Biology; Physics; Paleontology","score_opus":0.029934202469222636,"score_gpt":0.3631547433422232,"score_spread":0.33322054087300057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975959","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.28667018,0.0020148342,0.36465538,0.0028574395,0.00095778157,0.00008347337,0.00023531244,0.00031401077,0.34221166],"genre_scores_gemma":[0.8907329,0.0010782724,0.07749097,0.00066611747,0.0004388079,0.00009490503,0.00010161365,0.000103808794,0.029292565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934393,0.00020399291,0.000027367398,0.00010887675,0.00022418215,0.00009162835],"domain_scores_gemma":[0.9994165,0.00021362379,0.00008855063,0.000090100846,0.00010895082,0.00008240534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082378165,0.00043081184,0.00036680367,0.0010935424,0.0010950622,0.0018019918,0.0008686305,0.0007133091,0.0066666035],"category_scores_gemma":[0.0019527607,0.00020533947,0.0005965002,0.00077707716,0.0026616405,0.004045024,0.0012556775,0.0015134312,0.0008863186],"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.000002366595,0.0000024693281,0.000027818196,0.0000056715057,6.626373e-7,0.000023221504,0.000052888885,0.00012865372,0.00015244562,0.99836427,0.0001836199,0.0010559866],"study_design_scores_gemma":[0.0000026766065,0.0000052368237,0.000046177036,0.0000053546655,0.0000014191577,0.0000907589,0.00004767039,0.001504408,0.00017662649,0.9947785,0.0033370736,0.000004137753],"about_ca_topic_score_codex":0.00038649683,"about_ca_topic_score_gemma":0.00041301482,"teacher_disagreement_score":0.0066666035,"about_ca_system_score_codex":0.0007737432,"about_ca_system_score_gemma":0.00043983117,"threshold_uncertainty_score":0.022301972},"labels":[],"label_agreement":null},{"id":"W4403975962","doi":"10.55016/ojs/cdm.v19i3.72148","title":"Multicolor compositions and conjugation of N-color compositions","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Pigment Synthesis and Properties","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Chemistry","score_opus":0.012731199784279912,"score_gpt":0.2859918584628363,"score_spread":0.2732606586785564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975962","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.3030891,0.0019905774,0.47045544,0.0008170269,0.000688824,0.0001454231,0.0003080388,0.00054102234,0.22196451],"genre_scores_gemma":[0.7911246,0.0013236912,0.15686977,0.0004953368,0.00021454557,0.00017043352,0.00026738827,0.00026241087,0.049271822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995704,0.00008419955,0.000027304533,0.00011467476,0.00012531226,0.00007810815],"domain_scores_gemma":[0.9996879,0.00008709641,0.000056748268,0.00007832919,0.000051110397,0.00003889394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040070617,0.00046911513,0.00026361656,0.00067785283,0.0011441278,0.0009899229,0.00041332835,0.00047838708,0.0057299123],"category_scores_gemma":[0.00090524676,0.00019940735,0.00047447078,0.00049945054,0.0018388623,0.0017767131,0.0018395345,0.0010896781,0.0011800898],"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.000024547875,0.000014073205,0.00020444287,0.000030289115,0.0000028858792,0.00006827691,0.00016432334,0.0012145772,0.0066113994,0.975223,0.0006115478,0.015830668],"study_design_scores_gemma":[0.000010444515,0.000048490998,0.00040910597,0.00003056353,0.000009731774,0.00037645252,0.000118160206,0.009984345,0.020809794,0.9125526,0.055624135,0.000025984238],"about_ca_topic_score_codex":0.00031362273,"about_ca_topic_score_gemma":0.0004660075,"teacher_disagreement_score":0.0057299123,"about_ca_system_score_codex":0.0008623649,"about_ca_system_score_gemma":0.0003946439,"threshold_uncertainty_score":0.019168496},"labels":[],"label_agreement":null},{"id":"W4403975967","doi":"10.55016/ojs/cdm.v19i3.74031","title":"Unified framework for tableau models of Grothendieck Polynomials","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.024598212673889248,"score_gpt":0.30908797722307413,"score_spread":0.2844897645491849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975967","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.049519457,0.0013438107,0.82605636,0.0017559873,0.00037687595,0.00015987577,0.00055121246,0.00052751106,0.1197089],"genre_scores_gemma":[0.7570364,0.0017971802,0.21290691,0.0009930856,0.0006231788,0.00047369263,0.0007523275,0.00039873098,0.02501849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998243,0.00045150897,0.00007304742,0.00027792266,0.0006583908,0.0002961334],"domain_scores_gemma":[0.9984957,0.0006723285,0.00011962558,0.00031316825,0.00025891594,0.00014029692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017625274,0.0012484435,0.0012488639,0.0025398545,0.002389394,0.006574282,0.0025102573,0.0018893471,0.011255355],"category_scores_gemma":[0.0034283688,0.0009576073,0.0023622797,0.002202809,0.004624498,0.010066737,0.0033119742,0.0056288852,0.0019005247],"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.0000022648312,0.0000041353737,0.000009406517,0.000008001371,0.0000013520894,0.000016890815,0.00003059471,0.00044571963,0.0001266967,0.9987595,0.00014536436,0.00045002566],"study_design_scores_gemma":[0.00000815443,0.000007373831,0.000022840133,0.000013539921,0.0000046420823,0.00003554868,0.000026275022,0.0054843226,0.00031819823,0.9908454,0.003224602,0.000009143544],"about_ca_topic_score_codex":0.002342885,"about_ca_topic_score_gemma":0.002586964,"teacher_disagreement_score":0.011255355,"about_ca_system_score_codex":0.0038835227,"about_ca_system_score_gemma":0.0014498389,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4403975975","doi":"10.55016/ojs/cdm.v19i3.62807","title":"The Fractional Local Metric Dimension of Graphs","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Metric dimension; Dimension (graph theory); Metric (unit); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.01030655384091915,"score_gpt":0.27721046390645254,"score_spread":0.2669039100655334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975975","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.8053017,0.0023706618,0.1689382,0.0011883104,0.00008927045,0.00002556173,0.00062138593,0.00022588257,0.02123905],"genre_scores_gemma":[0.9838387,0.00049368024,0.013673113,0.00008621484,0.000094837415,0.000025919244,0.0001530469,0.000036726422,0.0015977303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930584,0.00016281627,0.00003365089,0.00020157076,0.00015760916,0.00013852897],"domain_scores_gemma":[0.99719894,0.0013389898,0.0004330692,0.00043262486,0.00023945108,0.00035698427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066963345,0.00046018392,0.0006672856,0.002152834,0.001058275,0.0019384522,0.00074933574,0.00059117144,0.002249761],"category_scores_gemma":[0.004306125,0.00027232122,0.000598296,0.0016437522,0.0023433408,0.0038217525,0.0015645227,0.0010711591,0.00016490891],"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.00008950145,0.000020558906,0.0028793435,0.000075404736,0.000027430324,0.000078665355,0.00031434165,0.0163169,0.0028955764,0.96508735,0.0012233288,0.010991512],"study_design_scores_gemma":[0.000011699886,0.00004562358,0.003041085,0.000023480214,0.000025898136,0.0002849079,0.00020502055,0.06795948,0.0020416803,0.92018855,0.0061370265,0.00003566969],"about_ca_topic_score_codex":0.001057287,"about_ca_topic_score_gemma":0.00076062564,"teacher_disagreement_score":0.002249761,"about_ca_system_score_codex":0.0017024186,"about_ca_system_score_gemma":0.00033165785,"threshold_uncertainty_score":0.01235193},"labels":[],"label_agreement":null},{"id":"W4403975977","doi":"10.55016/ojs/cdm.v19i2.62669","title":"Combinatorial results for order-preserving partial injective contraction mappings","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Injective function; Mathematics; Combinatorics; Contraction (grammar); Order (exchange); Combinatorial analysis; Discrete mathematics; Biology","score_opus":0.024771959614914414,"score_gpt":0.34521346992037955,"score_spread":0.32044151030546514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975977","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.557209,0.001693139,0.2408995,0.0017324989,0.00032029688,0.0001518026,0.00065561215,0.00029248637,0.19704556],"genre_scores_gemma":[0.93543273,0.000785174,0.04013728,0.00038463422,0.00047602464,0.00024321931,0.00080637366,0.00011962767,0.021614967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852777,0.00029871686,0.00011577866,0.00037550763,0.00047462858,0.00020760731],"domain_scores_gemma":[0.9956618,0.0025423495,0.0004517632,0.0003913329,0.000476847,0.00047585552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018027253,0.000653728,0.00079463876,0.0027664735,0.0019606554,0.0035213882,0.0010465333,0.00086571905,0.0077846376],"category_scores_gemma":[0.0041537243,0.00049709977,0.0015228072,0.0015919238,0.002892004,0.0046091806,0.0016951656,0.002545318,0.0007051713],"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.000024356978,0.000030890544,0.00029465466,0.000035396162,0.000004991142,0.000072785326,0.00023943104,0.0006290794,0.0013256185,0.99446684,0.00036200756,0.0025139246],"study_design_scores_gemma":[0.000028087337,0.000048870123,0.0006711428,0.000021324931,0.000017028198,0.00023952781,0.00019227465,0.009446763,0.0016756848,0.9828235,0.0048149717,0.000020848984],"about_ca_topic_score_codex":0.00070459663,"about_ca_topic_score_gemma":0.00071992876,"teacher_disagreement_score":0.0077846376,"about_ca_system_score_codex":0.0016129935,"about_ca_system_score_gemma":0.0006506612,"threshold_uncertainty_score":0.026042223},"labels":[],"label_agreement":null},{"id":"W4403975978","doi":"10.55016/ojs/cdm.v19i2.73812","title":"Lattice paths in corridors and cyclic corridors","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lattice (music); Combinatorics; Mathematics; Physics","score_opus":0.02055935184930199,"score_gpt":0.3458147296163022,"score_spread":0.32525537776700025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975978","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.7114558,0.0012848412,0.23311858,0.0004379537,0.00016008945,0.000055360524,0.00080423214,0.00033022842,0.052352875],"genre_scores_gemma":[0.92598385,0.00085625314,0.058483057,0.000087627326,0.000091300055,0.0000877798,0.00056443043,0.00010521799,0.01374047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995158,0.00009192693,0.000025220475,0.00009311002,0.00017785492,0.000096100564],"domain_scores_gemma":[0.9986237,0.0005024458,0.00029592498,0.00010652679,0.00022511499,0.00024619693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036775993,0.00046036186,0.00032404144,0.002510027,0.0010996755,0.0012632253,0.0006388208,0.0008129291,0.0071338806],"category_scores_gemma":[0.0022687584,0.00022095306,0.000493001,0.0019383869,0.0013627919,0.003309801,0.0011469994,0.0008455249,0.0004604553],"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.00007186151,0.000016696713,0.0013735796,0.00007225789,0.000011771761,0.00010716088,0.00016125554,0.0063123438,0.0020043978,0.9728345,0.00075073115,0.01628347],"study_design_scores_gemma":[0.000017834573,0.000065462504,0.00191184,0.000055996472,0.000015856422,0.00058147014,0.0003575238,0.04122478,0.0029527675,0.9410148,0.011759117,0.000042593245],"about_ca_topic_score_codex":0.0013989167,"about_ca_topic_score_gemma":0.0013783014,"teacher_disagreement_score":0.0071338806,"about_ca_system_score_codex":0.0007455305,"about_ca_system_score_gemma":0.0003876677,"threshold_uncertainty_score":0.023865163},"labels":[],"label_agreement":null},{"id":"W4403976072","doi":"10.55016/ojs/cdm.v19i3.74733","title":"Noncrystallographic tail-triangle C-groups of rank 4 and interlacing number 2","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Commission on Higher Education","keywords":"Interlacing; Mathematics; Combinatorics; Rank (graph theory); Computer science; Artificial intelligence","score_opus":0.005477877879873135,"score_gpt":0.2520836286754161,"score_spread":0.24660575079554298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976072","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.8332695,0.0001950974,0.0616347,0.0004360148,0.00021641412,0.00008475642,0.00013451073,0.00040638237,0.103622615],"genre_scores_gemma":[0.9644742,0.000088396635,0.012789531,0.00011791281,0.00008606118,0.000039011185,0.00018132277,0.00009360921,0.022129888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995895,0.000063213076,0.000019866575,0.000073050935,0.00011560889,0.0001387697],"domain_scores_gemma":[0.99934834,0.00015513199,0.00012631668,0.00015870396,0.00010004886,0.00011150873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030146388,0.00038612416,0.00037654833,0.0008143546,0.00086401525,0.0010109373,0.0005304213,0.00043625018,0.008959463],"category_scores_gemma":[0.0010582897,0.00018017346,0.00041346115,0.0003233064,0.0015392482,0.0011465838,0.0013074123,0.0008293201,0.0014173621],"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.00026010105,0.00005458069,0.00087996706,0.0000673731,0.000011820845,0.00047069002,0.0006022718,0.002565835,0.014508737,0.95954686,0.0020862694,0.01894557],"study_design_scores_gemma":[0.000118817436,0.00035192462,0.0014768136,0.00003478244,0.00003319685,0.00082685926,0.0006445967,0.02457963,0.03442922,0.9107775,0.026666397,0.000060235463],"about_ca_topic_score_codex":0.0007319591,"about_ca_topic_score_gemma":0.000966863,"teacher_disagreement_score":0.008959463,"about_ca_system_score_codex":0.00037581744,"about_ca_system_score_gemma":0.0004899136,"threshold_uncertainty_score":0.029972434},"labels":[],"label_agreement":null},{"id":"W4403976080","doi":"10.55016/ojs/cdm.v19i3.72597","title":"Some results about star-factors in graphs","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Combinatorics; Mathematics","score_opus":0.026070265175263486,"score_gpt":0.3353275022472045,"score_spread":0.30925723707194097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976080","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.1282352,0.022979757,0.5265879,0.0047601885,0.0013168141,0.00025408025,0.0041048382,0.0021659462,0.30959523],"genre_scores_gemma":[0.7183325,0.024470372,0.12143036,0.0031570399,0.0038778596,0.00043458948,0.006336502,0.00226201,0.119698875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886835,0.00016531619,0.000076583245,0.0003665494,0.00031011662,0.00021319452],"domain_scores_gemma":[0.9976974,0.0011403974,0.00023183908,0.0002525704,0.00033125246,0.00034653433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011134439,0.001748474,0.0012153138,0.0035088914,0.0020466684,0.0026024561,0.0013998635,0.0011330459,0.023641292],"category_scores_gemma":[0.003910304,0.00085529697,0.0027574257,0.0054411534,0.002906355,0.006869667,0.0019134614,0.0033659423,0.00436878],"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.0001222411,0.000078891,0.0012355278,0.00054756296,0.00005763713,0.00023306784,0.0009346661,0.0060331444,0.0020505951,0.9286391,0.016424766,0.043642726],"study_design_scores_gemma":[0.00002199958,0.00007385021,0.001129583,0.00009739011,0.000057219724,0.00034823333,0.00026829203,0.0118483305,0.0009910689,0.9444832,0.04064821,0.00003260543],"about_ca_topic_score_codex":0.004464288,"about_ca_topic_score_gemma":0.0036371686,"teacher_disagreement_score":0.023641292,"about_ca_system_score_codex":0.0020899484,"about_ca_system_score_gemma":0.0006876735,"threshold_uncertainty_score":0.07908797},"labels":[],"label_agreement":null},{"id":"W4403976095","doi":"10.55016/ojs/cdm.v19i3.62620","title":"On characterization and recognition of proper tagged probe interval graphs","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University Grants Commission","keywords":"Characterization (materials science); Combinatorics; Interval (graph theory); Mathematics; Discrete mathematics; Physics","score_opus":0.016638996920622304,"score_gpt":0.27113760204364906,"score_spread":0.25449860512302674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976095","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.093173556,0.00029483865,0.90204597,0.00024035337,0.00002978719,0.00006356928,0.000286066,0.00052766345,0.0033383132],"genre_scores_gemma":[0.6497551,0.00054790283,0.34401312,0.00023972767,0.00009547064,0.00014173317,0.0019078365,0.00025221985,0.0030468716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991732,0.00015003183,0.000053001397,0.00033587002,0.00019047041,0.00009742342],"domain_scores_gemma":[0.9955369,0.0027078893,0.0005565329,0.0005812286,0.00043955605,0.00017786367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005074225,0.0004732569,0.00047973555,0.0011475978,0.00049634196,0.0012708827,0.00087683223,0.0007347063,0.002306874],"category_scores_gemma":[0.0066224188,0.00027351975,0.0005600036,0.0016666062,0.0012359415,0.0032341257,0.00089616067,0.0012393101,0.0004983855],"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.00053395325,0.00020103993,0.006993374,0.00039118578,0.000048506005,0.0004991742,0.00093864836,0.13919319,0.056466356,0.41407573,0.008880171,0.37177864],"study_design_scores_gemma":[0.000023876175,0.00016693576,0.0032674072,0.000039134393,0.00002753748,0.0006038576,0.00037272583,0.60373247,0.014867194,0.3672159,0.009623619,0.000059386693],"about_ca_topic_score_codex":0.0011941083,"about_ca_topic_score_gemma":0.0010588579,"teacher_disagreement_score":0.002306874,"about_ca_system_score_codex":0.0006782522,"about_ca_system_score_gemma":0.0004067349,"threshold_uncertainty_score":0.007717252},"labels":[],"label_agreement":null},{"id":"W4403976098","doi":"10.55016/ojs/cdm.v19i3.68885","title":"Construction of the projective plane $PG(2,q^2)$ from the unitary group $PSU(3,q)$","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hrvatska Zaklada za Znanost","keywords":"Mathematics; Unitary state; Projective test; Combinatorics; Projective unitary group; Group (periodic table); Projective plane; Unitary group; Projective linear group; Plane (geometry); Pure mathematics; Projective space; Geometry; Collineation; Physics; Quantum mechanics","score_opus":0.03268176431596116,"score_gpt":0.34012760501372913,"score_spread":0.307445840697768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976098","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.25218368,0.0019186785,0.46091896,0.0038654201,0.0011995938,0.0003434137,0.00066913076,0.0013024175,0.27759877],"genre_scores_gemma":[0.83446574,0.0009907252,0.12217585,0.0005019238,0.0002526126,0.000111389214,0.00061027496,0.000327851,0.040563617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944824,0.00017009812,0.000019937594,0.00009618236,0.0001631057,0.00010242827],"domain_scores_gemma":[0.9997409,0.000083215964,0.000025774138,0.00004286647,0.00005590469,0.000051392497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044673143,0.00068326236,0.00035325013,0.00070141,0.0016079502,0.001315446,0.00056212075,0.00047306519,0.008940109],"category_scores_gemma":[0.0010038605,0.0002515043,0.00058987434,0.0006375754,0.002113871,0.002373139,0.001796133,0.0018988125,0.001399647],"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.00006214899,0.000025412854,0.0002255291,0.000057223384,0.000010955813,0.00024096858,0.00075022527,0.0012482798,0.0030212824,0.968038,0.0031332406,0.02318678],"study_design_scores_gemma":[0.00009966248,0.00027143076,0.0007249801,0.000046453737,0.000032694854,0.0007006463,0.00078960246,0.0074662515,0.020608297,0.7301011,0.2390784,0.00008039003],"about_ca_topic_score_codex":0.0009936421,"about_ca_topic_score_gemma":0.0009871264,"teacher_disagreement_score":0.008940109,"about_ca_system_score_codex":0.0007042154,"about_ca_system_score_gemma":0.0006171568,"threshold_uncertainty_score":0.029907644},"labels":[],"label_agreement":null},{"id":"W4403976109","doi":"10.55016/ojs/cdm.v19i3.75983","title":"On the blocking numbers of some special convex bodies","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Blocking (statistics); Regular polygon; Geometry; Statistics","score_opus":0.03721193003695116,"score_gpt":0.34241312391765005,"score_spread":0.3052011938806989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976109","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.6570392,0.002708225,0.24777098,0.00071619696,0.00015620393,0.00005408704,0.00051405106,0.00027812124,0.09076298],"genre_scores_gemma":[0.94548726,0.0014237204,0.03858232,0.00012755832,0.00013650143,0.000115324096,0.0007215081,0.00018535303,0.013220391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993875,0.00008605272,0.000018548613,0.00009943051,0.00020806665,0.00020040188],"domain_scores_gemma":[0.99809784,0.00086863054,0.000350646,0.0001523529,0.00021727852,0.00031328623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006063487,0.0007181026,0.00077894947,0.0015279569,0.0012067684,0.0013488522,0.0013482762,0.00073607767,0.0072733746],"category_scores_gemma":[0.0029912302,0.000481476,0.0006792179,0.000758038,0.0019832472,0.002480333,0.0010962872,0.0015528232,0.0009875195],"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.00016910081,0.000051018775,0.0018813084,0.00016390046,0.000024580977,0.0001461412,0.00025429376,0.08169455,0.010612113,0.89020693,0.0031060544,0.011689925],"study_design_scores_gemma":[0.000036218225,0.00008953128,0.0023179622,0.000053126274,0.000031873376,0.0002757,0.00022652493,0.49076134,0.0097272815,0.48620203,0.010217892,0.000060502578],"about_ca_topic_score_codex":0.0034328308,"about_ca_topic_score_gemma":0.0018677489,"teacher_disagreement_score":0.0072733746,"about_ca_system_score_codex":0.0013987595,"about_ca_system_score_gemma":0.00057502725,"threshold_uncertainty_score":0.024331868},"labels":[],"label_agreement":null},{"id":"W4412376432","doi":"10.55016/ojs/cdm.v10i1.62182","title":"Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Lemma (botany); Mathematics; Combinatorics; Finite field; Pure mathematics; Discrete mathematics","score_opus":0.03380846415234004,"score_gpt":0.3295930332362433,"score_spread":0.29578456908390327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376432","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.6025715,0.0016229384,0.30236325,0.0037459705,0.00020476614,0.00010561366,0.00080689153,0.0005254135,0.08805369],"genre_scores_gemma":[0.9597438,0.00068769214,0.029521305,0.00042193095,0.00037395005,0.00010423762,0.0006586167,0.000110671645,0.008377834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988613,0.00024371452,0.00006389882,0.00028982165,0.0003306914,0.0002105654],"domain_scores_gemma":[0.99541485,0.003189099,0.0003574637,0.00039298364,0.00032636925,0.0003193165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021000877,0.00044657025,0.0007162914,0.0016229098,0.0012209865,0.0017069791,0.000979298,0.0005606517,0.0028245596],"category_scores_gemma":[0.0057088435,0.00037503205,0.0011647558,0.001325112,0.003837548,0.006513467,0.0031082397,0.0031660332,0.0003259687],"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.000056989327,0.000017070859,0.00094776007,0.000048694354,0.000007755371,0.00016533902,0.0003662942,0.0015640846,0.002149222,0.9884057,0.0007157085,0.005555303],"study_design_scores_gemma":[0.00004091584,0.00007754878,0.0021388151,0.000037004447,0.000028968332,0.00061808684,0.0002576326,0.021043863,0.0024483895,0.9647727,0.008500697,0.000035405857],"about_ca_topic_score_codex":0.0008276035,"about_ca_topic_score_gemma":0.00063994,"teacher_disagreement_score":0.0028245596,"about_ca_system_score_codex":0.0013329663,"about_ca_system_score_gemma":0.00049746165,"threshold_uncertainty_score":0.011106491},"labels":[],"label_agreement":null},{"id":"W4412376449","doi":"10.55016/ojs/cdm.v10i1.62266","title":"On uniformly resolvable {K_2, P_k}-designs with with k=3,4","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016433725059316805,"score_gpt":0.2377580312302699,"score_spread":0.22132430617095308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376449","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.7019669,0.0003699378,0.26867038,0.00025489938,0.0000403294,0.00008173666,0.000350118,0.00016560475,0.02810008],"genre_scores_gemma":[0.9150667,0.0003625418,0.07788424,0.00012693905,0.00007097137,0.0001368596,0.0003257522,0.000059915168,0.0059660757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985819,0.0005136169,0.0000766469,0.00028081553,0.00028476288,0.0002623426],"domain_scores_gemma":[0.9967308,0.0018264623,0.0005631386,0.0004902993,0.00019462552,0.00019472853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552806,0.00070375745,0.0004307359,0.0008592542,0.00078484847,0.0010346535,0.00057307235,0.000829477,0.0032827116],"category_scores_gemma":[0.0028030507,0.00049095496,0.0005002786,0.00069781725,0.0016492798,0.0014690029,0.00094022736,0.0009147906,0.00052127696],"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.0010366765,0.00015479379,0.0018713638,0.0002455502,0.000056078206,0.00044915624,0.00053945085,0.08939992,0.035604972,0.8200404,0.001680004,0.04892161],"study_design_scores_gemma":[0.00013490446,0.00034157644,0.0011052858,0.00013154936,0.000031099862,0.00042848266,0.00022429711,0.1390939,0.014845054,0.83923537,0.004359741,0.00006879844],"about_ca_topic_score_codex":0.00056188507,"about_ca_topic_score_gemma":0.0009532152,"teacher_disagreement_score":0.0032827116,"about_ca_system_score_codex":0.00078580255,"about_ca_system_score_gemma":0.0005832298,"threshold_uncertainty_score":0.010981798},"labels":[],"label_agreement":null},{"id":"W4412376451","doi":"10.55016/ojs/cdm.v10i1.62293","title":"Chasing robbers on percolated random geometric graphs","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Combinatorics; Mathematics; Random graph; Discrete mathematics; Graph","score_opus":0.025639752924634742,"score_gpt":0.2881849538665438,"score_spread":0.2625452009419091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376451","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.5315549,0.0008709475,0.44494754,0.0019044217,0.00009837938,0.00028081646,0.0005125828,0.0006579841,0.01917246],"genre_scores_gemma":[0.95454365,0.0005653792,0.035597127,0.00043911845,0.000104071245,0.00032814418,0.00048479368,0.00023551572,0.0077021327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996252,0.0017609257,0.0001220049,0.0006018742,0.0005718972,0.0006914573],"domain_scores_gemma":[0.978123,0.01524349,0.0026726471,0.0013517258,0.00068263727,0.0019265305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028042693,0.0017702661,0.002231185,0.0019991496,0.002126609,0.00234312,0.0032259475,0.0028542248,0.0052607004],"category_scores_gemma":[0.024330392,0.0010675798,0.0013836595,0.0013017172,0.00494424,0.0067082336,0.0041680587,0.0027064288,0.0008039652],"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.00058856123,0.00024716867,0.002730606,0.00029756827,0.00020278685,0.00080380676,0.0006841159,0.38799202,0.0053563435,0.5855155,0.0048003327,0.010781253],"study_design_scores_gemma":[0.0000881061,0.00011837453,0.00043427496,0.00003485413,0.000037267422,0.00018236798,0.00019418134,0.76002795,0.00094494346,0.23642196,0.0014750148,0.00004061429],"about_ca_topic_score_codex":0.0036316412,"about_ca_topic_score_gemma":0.003784102,"teacher_disagreement_score":0.0052607004,"about_ca_system_score_codex":0.0025119926,"about_ca_system_score_gemma":0.0013392058,"threshold_uncertainty_score":0.018225849},"labels":[],"label_agreement":null},{"id":"W4412376457","doi":"10.55016/ojs/cdm.v10i1.62222","title":"A curious polynomial interpolation of Carlitz-Riordan's q-ballot numbers","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Interpolation (computer graphics); Combinatorics; Polynomial interpolation; Ballot; Polynomial; Linear interpolation; Mathematical analysis; Computer science; Voting; Law; Computer graphics (images); Political science","score_opus":0.04152957417294601,"score_gpt":0.370751454272188,"score_spread":0.32922188009924197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376457","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.57714075,0.0015795913,0.31915647,0.0019997854,0.0007691914,0.000055042266,0.00014738042,0.00031958293,0.09883221],"genre_scores_gemma":[0.9452238,0.0005157353,0.033984028,0.00030646837,0.00016127415,0.000044966786,0.00006369845,0.000113710594,0.019586377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969125,0.00008912099,0.00000861194,0.000045047662,0.000099882855,0.00006617593],"domain_scores_gemma":[0.9996191,0.0001432579,0.000057809048,0.000036138048,0.00007449209,0.00006923835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082051003,0.000398647,0.00044719034,0.0008007323,0.0009070331,0.00081810314,0.0007858217,0.0005821591,0.0037701675],"category_scores_gemma":[0.0029799102,0.00019434356,0.0003965714,0.0006344407,0.0017562413,0.0015168085,0.00097175484,0.0016757103,0.00064974657],"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.00004972399,0.000015070698,0.00023955743,0.000031418003,0.0000031292602,0.00009180919,0.00018910653,0.0027965289,0.0019379249,0.98786175,0.0008365012,0.0059474884],"study_design_scores_gemma":[0.00003696248,0.00009745061,0.00060372974,0.000061325954,0.000012978453,0.00029540117,0.00018449084,0.08087173,0.005047835,0.90248024,0.010259095,0.0000486309],"about_ca_topic_score_codex":0.0020892562,"about_ca_topic_score_gemma":0.0017723638,"teacher_disagreement_score":0.0037701675,"about_ca_system_score_codex":0.00091461104,"about_ca_system_score_gemma":0.00067756575,"threshold_uncertainty_score":0.012612462},"labels":[],"label_agreement":null},{"id":"W4412402095","doi":"10.55016/ojs/cdm.v10i2.62216","title":"On the chromatic index of Latin squares","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Latin square; Mathematics; Index (typography); Combinatorics; Chromatic scale; Statistics; Computer science; Biology","score_opus":0.01604076548206836,"score_gpt":0.2581452710296603,"score_spread":0.24210450554759191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402095","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.76896214,0.0035003938,0.0938287,0.002577805,0.00025152796,0.000041459887,0.00047275194,0.00029555324,0.13006961],"genre_scores_gemma":[0.97130346,0.0015058273,0.017773144,0.0002860417,0.00022257707,0.000050489016,0.00035016972,0.00017795623,0.008330371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992893,0.0001708574,0.000026013427,0.00016501751,0.0001518177,0.00019703506],"domain_scores_gemma":[0.99521846,0.0032805032,0.0004391496,0.0004128983,0.00031797515,0.00033093177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087925885,0.00048800666,0.00060148985,0.0020104016,0.0012217544,0.0023039992,0.00091160514,0.00073057576,0.004305786],"category_scores_gemma":[0.0048570274,0.00036755047,0.00038258338,0.0015994658,0.003101445,0.0033772802,0.0015106357,0.0016306582,0.0006337451],"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.00039360535,0.0001062546,0.006495486,0.000121225334,0.000031474345,0.00016482855,0.00073625334,0.039218258,0.01056281,0.91173476,0.0066974005,0.02373759],"study_design_scores_gemma":[0.000036328896,0.000049800597,0.0028395883,0.000069175905,0.000023452545,0.0001544559,0.00034550688,0.0896482,0.00456747,0.8945791,0.007644606,0.000042343727],"about_ca_topic_score_codex":0.0029734334,"about_ca_topic_score_gemma":0.0030042045,"teacher_disagreement_score":0.004305786,"about_ca_system_score_codex":0.0021820394,"about_ca_system_score_gemma":0.0006716688,"threshold_uncertainty_score":0.015831888},"labels":[],"label_agreement":null},{"id":"W4412402096","doi":"10.55016/ojs/cdm.v10i2.62253","title":"A Lower Bound for Radio k-chromatic Number of an Arbitrary Graph","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Graph; Windmill graph; Upper and lower bounds; Friendship graph; Discrete mathematics; Graph power; Line graph","score_opus":0.012929653346634677,"score_gpt":0.28469703053284234,"score_spread":0.2717673771862077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402096","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.15321478,0.0055926833,0.6913298,0.008286641,0.0006023045,0.00024997574,0.002250509,0.002654636,0.1358186],"genre_scores_gemma":[0.75983685,0.0041300515,0.19217606,0.002418674,0.0006523915,0.00066872744,0.0023425173,0.0011059281,0.03666885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980665,0.00026012672,0.000068773676,0.00053057476,0.00039904303,0.00067495747],"domain_scores_gemma":[0.99486405,0.0030187725,0.00032044816,0.00097360497,0.00037662894,0.00044645168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001328467,0.002014068,0.001239365,0.0016165952,0.0020676365,0.0026340869,0.0032674975,0.0014823059,0.0153921],"category_scores_gemma":[0.0057480526,0.0006800888,0.0012078638,0.0017835906,0.0029000014,0.0066171824,0.0029559387,0.004071,0.0032914132],"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.0016407553,0.00036012701,0.004737574,0.0014601491,0.00022594277,0.0004278897,0.00075355533,0.27687272,0.0519219,0.48333335,0.052475553,0.12579057],"study_design_scores_gemma":[0.00016225158,0.00047875915,0.0039019103,0.00024746257,0.00020179006,0.0010594077,0.00041196254,0.60037404,0.02614397,0.30383706,0.06300255,0.00017891423],"about_ca_topic_score_codex":0.004040633,"about_ca_topic_score_gemma":0.007134512,"teacher_disagreement_score":0.0153921,"about_ca_system_score_codex":0.0036613108,"about_ca_system_score_gemma":0.0016572129,"threshold_uncertainty_score":0.051491678},"labels":[],"label_agreement":null},{"id":"W4412402110","doi":"10.55016/ojs/cdm.v10i2.62217","title":"A theorem on fractional ID - ( g , f ) - factor-critical graphs","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; National Social Science Fund of China; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics; Factor (programming language); Computer science","score_opus":0.023433605097989585,"score_gpt":0.3495409181538872,"score_spread":0.32610731305589763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402110","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.5046173,0.0023629332,0.3611383,0.0026299509,0.0004431305,0.0001921851,0.0014122725,0.001056867,0.12614706],"genre_scores_gemma":[0.92789215,0.0009721289,0.05698908,0.00083251327,0.0003211258,0.00012699288,0.00094298733,0.00018840388,0.01173461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996623,0.00003498111,0.000015180319,0.00013053218,0.000064062566,0.00009294524],"domain_scores_gemma":[0.9982925,0.00093550823,0.00015183602,0.0001764301,0.00021377217,0.0002299437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048022237,0.0006222447,0.00050994114,0.0013446446,0.0018816199,0.0012437524,0.0007764457,0.00067842903,0.0075932574],"category_scores_gemma":[0.0031163841,0.0003366768,0.00083433907,0.0008081802,0.002139741,0.0026433002,0.0014185376,0.0011906481,0.00068300584],"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.00018168995,0.000045158104,0.0018036003,0.00017720643,0.000024796549,0.00026225153,0.0005533774,0.0052902033,0.0063397973,0.957543,0.0070791985,0.020699779],"study_design_scores_gemma":[0.000080718164,0.000117594995,0.0014948294,0.00007867985,0.00007209713,0.00093629357,0.00049025094,0.023924468,0.0074288407,0.93413717,0.031187681,0.00005141839],"about_ca_topic_score_codex":0.002767367,"about_ca_topic_score_gemma":0.0022112045,"teacher_disagreement_score":0.0075932574,"about_ca_system_score_codex":0.0012707883,"about_ca_system_score_gemma":0.0006333834,"threshold_uncertainty_score":0.02540195},"labels":[],"label_agreement":null},{"id":"W4412402127","doi":"10.55016/ojs/cdm.v10i2.62371","title":"On bisectors in normed planes","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006157138654072794,"score_gpt":0.23045405420678156,"score_spread":0.22429691555270875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402127","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.3398475,0.0013785909,0.5770204,0.00043492045,0.00026040396,0.00015942042,0.00071933895,0.00045137617,0.079728074],"genre_scores_gemma":[0.8609246,0.0010116915,0.11684161,0.00023600456,0.00019618585,0.00016176082,0.00082652015,0.00040394205,0.01939776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987878,0.00028673426,0.000058688936,0.00021811304,0.00051680923,0.00013176003],"domain_scores_gemma":[0.9989698,0.0001899265,0.0002482297,0.000089715104,0.00035245344,0.00014996009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006379207,0.0007081432,0.00042008614,0.0026821818,0.0010698151,0.0019334458,0.0007988974,0.00062584813,0.005526602],"category_scores_gemma":[0.002464179,0.0003582037,0.00041040016,0.0020978905,0.0022495526,0.0030642555,0.0021091187,0.0016155243,0.0015064441],"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.00007801562,0.000017799113,0.0005065563,0.00003303301,0.000008060675,0.00011591205,0.0003102639,0.0060618916,0.0037500465,0.97261626,0.0009774169,0.015524577],"study_design_scores_gemma":[0.000031496842,0.00011202599,0.0010585946,0.00006398572,0.00001050939,0.00056348724,0.000631477,0.063307725,0.0040011336,0.8969178,0.033242125,0.000059607646],"about_ca_topic_score_codex":0.001593353,"about_ca_topic_score_gemma":0.0010345012,"teacher_disagreement_score":0.005526602,"about_ca_system_score_codex":0.00083821977,"about_ca_system_score_gemma":0.00029791385,"threshold_uncertainty_score":0.018488348},"labels":[],"label_agreement":null},{"id":"W4412402130","doi":"10.55016/ojs/cdm.v10i2.62320","title":"Triangle-free Uniquely 3-Edge Colorable Cubic Graphs","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Cubic graph; Discrete mathematics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.015254640304786907,"score_gpt":0.2641215160142489,"score_spread":0.24886687570946198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402130","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.5024087,0.0024727308,0.21804433,0.0019293547,0.0004980484,0.00011319026,0.0018052572,0.0012857249,0.2714427],"genre_scores_gemma":[0.9183201,0.001014213,0.06353903,0.00033939964,0.00007221681,0.000071804905,0.0008635967,0.0002118554,0.015567678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955493,0.000062330335,0.000013482141,0.000071735885,0.00016272922,0.00013472611],"domain_scores_gemma":[0.9993042,0.00023134309,0.00008857075,0.00012506523,0.000119045246,0.00013176781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014616972,0.0004457826,0.00044522883,0.0007989834,0.0015691925,0.0010312614,0.00084774545,0.00067873485,0.008808761],"category_scores_gemma":[0.0011905234,0.0003672995,0.00045329024,0.0012600824,0.00094691146,0.0013403766,0.0014818587,0.0019541997,0.00071061484],"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.00014718492,0.000040614985,0.0008431659,0.0003391959,0.000019292529,0.00089674024,0.00064015307,0.014745252,0.012416931,0.9063627,0.010766109,0.052782614],"study_design_scores_gemma":[0.00007246806,0.00007074453,0.0019136005,0.00006902748,0.000040782223,0.0021318765,0.00055614434,0.037949882,0.0098218825,0.8622326,0.08504198,0.00009893089],"about_ca_topic_score_codex":0.0040310994,"about_ca_topic_score_gemma":0.009196121,"teacher_disagreement_score":0.008808761,"about_ca_system_score_codex":0.0009156338,"about_ca_system_score_gemma":0.000689374,"threshold_uncertainty_score":0.029468238},"labels":[],"label_agreement":null},{"id":"W4412402131","doi":"10.55016/ojs/cdm.v10i2.62228","title":"On universally rigid frameworks on the line","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund; Hungarian Scientific Research Fund; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Line (geometry); Geometry","score_opus":0.006291910177358452,"score_gpt":0.22915617334711572,"score_spread":0.22286426316975727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402131","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.49133134,0.001224368,0.39496282,0.0015534054,0.00014570761,0.000090987094,0.0008158679,0.00063750235,0.10923791],"genre_scores_gemma":[0.95145404,0.00044457885,0.041243635,0.00029718375,0.00009481603,0.00009404516,0.0005052736,0.00014884783,0.005717558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978648,0.0005501503,0.000092051116,0.0005470374,0.00045167078,0.0004942584],"domain_scores_gemma":[0.99816304,0.0005294143,0.00031315375,0.00042522515,0.00021225812,0.00035684445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011888128,0.00071325205,0.000777927,0.001441735,0.002318221,0.0019919854,0.0012141909,0.0018857394,0.0069212783],"category_scores_gemma":[0.0035382528,0.00046995992,0.0010434048,0.0011667513,0.004615043,0.0040195086,0.0038080106,0.001886804,0.0007731627],"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.000012626071,0.0000068795007,0.00010527393,0.000013545448,0.0000040486566,0.000037604183,0.00007959606,0.0045595895,0.0004331436,0.992968,0.0002837483,0.0014958241],"study_design_scores_gemma":[0.000009956209,0.00001833873,0.00025197235,0.000020967049,0.0000057463963,0.00006261599,0.00012425071,0.016459841,0.00021349547,0.9798196,0.0029909404,0.000022260998],"about_ca_topic_score_codex":0.0028440794,"about_ca_topic_score_gemma":0.002379451,"teacher_disagreement_score":0.0069212783,"about_ca_system_score_codex":0.001266372,"about_ca_system_score_gemma":0.00060227636,"threshold_uncertainty_score":0.02315402},"labels":[],"label_agreement":null},{"id":"W4412435891","doi":"10.55016/ojs/cdm.v11i2.62359","title":"On the Equation $\\displaystyle{\\sum_{i=1}^n \\frac{1}{x_i}=1} $ in Distinct Odd or Even Numbers","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.07090141217410696,"score_gpt":0.3981647055043395,"score_spread":0.3272632933302326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435891","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.4287611,0.0025819205,0.2758374,0.007832846,0.0016422372,0.00009189332,0.00039155057,0.000314287,0.28254667],"genre_scores_gemma":[0.8537808,0.00337283,0.063335374,0.0021283475,0.0012557772,0.000110281304,0.0004165209,0.00035466373,0.07524546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995647,0.0000895084,0.000021185404,0.00008755518,0.00013968839,0.00009731912],"domain_scores_gemma":[0.9989813,0.0006593624,0.00012705919,0.00007698134,0.00010249208,0.000052681473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084563164,0.0006656757,0.0007196973,0.0012835548,0.0017519054,0.0015738006,0.0010276733,0.0014654108,0.014385323],"category_scores_gemma":[0.0035963936,0.00027742883,0.00069188303,0.0014236674,0.0033977197,0.0050034598,0.0013273578,0.002925086,0.0021378938],"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.000031534935,0.000012291989,0.00014650368,0.00004582455,0.0000034933214,0.00008572966,0.00013398647,0.0018659659,0.0010884072,0.989449,0.0018695532,0.0052676406],"study_design_scores_gemma":[0.000015601305,0.000011725493,0.00010162081,0.000015842637,0.000004930714,0.00012888447,0.00006756133,0.00862279,0.0010666313,0.9871264,0.0028222285,0.000015804384],"about_ca_topic_score_codex":0.0007136039,"about_ca_topic_score_gemma":0.00078528724,"teacher_disagreement_score":0.014385323,"about_ca_system_score_codex":0.0007512462,"about_ca_system_score_gemma":0.0007265865,"threshold_uncertainty_score":0.048123658},"labels":[],"label_agreement":null},{"id":"W4412435894","doi":"10.55016/ojs/cdm.v11i2.62576","title":"New combinatorial interpretations of some Rogers-Ramanujan type identities","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Combinatorial proof; Ramanujan's sum; Biology; Paleontology","score_opus":0.03294415499262443,"score_gpt":0.38034389020851955,"score_spread":0.3473997352158951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435894","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.27866608,0.0013251503,0.41418242,0.0014579684,0.0011527707,0.00014915108,0.00028338176,0.00032538033,0.3024577],"genre_scores_gemma":[0.8403853,0.0009353459,0.11222547,0.000627758,0.0007441414,0.0001915591,0.00017610802,0.0001456924,0.044568505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988165,0.00038000397,0.00008234229,0.00015718382,0.00041694514,0.00014699287],"domain_scores_gemma":[0.9989993,0.0003205155,0.00016378576,0.00017997302,0.0001971425,0.0001393581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013210023,0.00060110074,0.00048065194,0.0018195699,0.0014400773,0.0024692582,0.0012138139,0.0009904125,0.005616078],"category_scores_gemma":[0.0025713595,0.0003364793,0.0009664973,0.0010367818,0.0025824895,0.003967136,0.0014628244,0.001721241,0.0009421679],"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.0000050697936,0.0000066809557,0.00007607349,0.000009592898,0.0000017006201,0.00006122857,0.0000787817,0.00031241184,0.00043334375,0.9967483,0.00030890203,0.0019579611],"study_design_scores_gemma":[0.000008177549,0.000013632207,0.00015372754,0.0000126010345,0.0000067926417,0.0003091467,0.000090803456,0.005330404,0.0008885417,0.98706585,0.006100117,0.000020184387],"about_ca_topic_score_codex":0.00034406653,"about_ca_topic_score_gemma":0.00047189827,"teacher_disagreement_score":0.005616078,"about_ca_system_score_codex":0.0009509207,"about_ca_system_score_gemma":0.00063747336,"threshold_uncertainty_score":0.018787622},"labels":[],"label_agreement":null},{"id":"W4412435922","doi":"10.55016/ojs/cdm.v11i2.62225","title":"Contractions of Polygons in Abstract Polytopes, Part I","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Combinatorics; Mathematics","score_opus":0.02321674580177565,"score_gpt":0.32801789323190933,"score_spread":0.3048011474301337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435922","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.17430496,0.002462571,0.7553225,0.0009685841,0.00043516274,0.00012794799,0.00025872714,0.00025874272,0.06586079],"genre_scores_gemma":[0.738568,0.0024445346,0.22176717,0.00044356188,0.00033917336,0.00036209196,0.0008182037,0.00037103277,0.03488619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994349,0.00012936951,0.000043158903,0.00015107862,0.00016549391,0.0000760797],"domain_scores_gemma":[0.99935514,0.0002604549,0.00009238301,0.00011950406,0.00007272389,0.00009992386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006082672,0.00050189183,0.00037104587,0.0006310402,0.00082771503,0.0013420621,0.0006602895,0.0005663543,0.00431729],"category_scores_gemma":[0.002050999,0.00055021973,0.0010409406,0.0005396355,0.0027232338,0.0023381629,0.002181697,0.002021679,0.000591725],"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.00004043512,0.000020881516,0.00055752037,0.00014541068,0.000010197717,0.00024153953,0.00050423323,0.017254274,0.009250533,0.946146,0.0025441067,0.023284772],"study_design_scores_gemma":[0.000039353177,0.00014380662,0.0016046409,0.00015771762,0.000024745032,0.0007707775,0.0006173508,0.08610256,0.012330266,0.82916605,0.068998046,0.00004476087],"about_ca_topic_score_codex":0.0007554362,"about_ca_topic_score_gemma":0.00078170677,"teacher_disagreement_score":0.00431729,"about_ca_system_score_codex":0.00091283413,"about_ca_system_score_gemma":0.00035102258,"threshold_uncertainty_score":0.014442742},"labels":[],"label_agreement":null},{"id":"W4412435948","doi":"10.55016/ojs/cdm.v11i2.62346","title":"A class of spherical folding subdivisions","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Theoretical and Applied Studies in Material Sciences and Geometry","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Subdivision; Mathematics; Class (philosophy); Combinatorics; Folding (DSP implementation); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.009950567006813911,"score_gpt":0.29345142925024453,"score_spread":0.28350086224343063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435948","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.6528654,0.00084809266,0.19779742,0.00031698163,0.00016854912,0.00009682479,0.0006577496,0.0008855708,0.14636339],"genre_scores_gemma":[0.95053625,0.00027689405,0.01845464,0.00013915128,0.0000761617,0.000038951704,0.0009714469,0.00011976466,0.029386707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997495,0.00002947288,0.000014541861,0.00005962805,0.000092751725,0.00005419135],"domain_scores_gemma":[0.9996587,0.00006682254,0.000039604864,0.00009670578,0.000077192395,0.00006095592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014614422,0.00028631746,0.0003268808,0.00064737233,0.0005731816,0.0012843057,0.0003784856,0.00036983477,0.008450995],"category_scores_gemma":[0.0009893356,0.00014785792,0.00039655043,0.00048485232,0.0009495523,0.0007281739,0.00085072906,0.0005552166,0.0016293118],"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.00014276989,0.000039619576,0.0050227097,0.000104162114,0.000021479904,0.00036379305,0.0008450673,0.007874888,0.015757559,0.83313423,0.0052453387,0.13144834],"study_design_scores_gemma":[0.000057928606,0.0002190224,0.010817453,0.00006986797,0.000030133782,0.0028072295,0.0008939741,0.07392042,0.010944606,0.7724821,0.12770398,0.00005328522],"about_ca_topic_score_codex":0.0011581926,"about_ca_topic_score_gemma":0.0008473336,"teacher_disagreement_score":0.008450995,"about_ca_system_score_codex":0.00036773377,"about_ca_system_score_gemma":0.00016673528,"threshold_uncertainty_score":0.028271377},"labels":[],"label_agreement":null},{"id":"W4412435968","doi":"10.55016/ojs/cdm.v11i2.62457","title":"Sufficient conditions for certain structural properties of graphs based on Wiener-type indices","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Type (biology); Wiener index; Graph; Biology","score_opus":0.04887605859054891,"score_gpt":0.35994521970138227,"score_spread":0.3110691611108334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435968","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.6977278,0.00044083176,0.24570476,0.0012621252,0.00022185965,0.0002007097,0.0017771146,0.0006074686,0.05205742],"genre_scores_gemma":[0.9646336,0.0002708435,0.030449826,0.00021980125,0.00019006092,0.00021364987,0.0014458976,0.00017186318,0.0024044646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985839,0.00031753755,0.00012636867,0.00036816899,0.00028806026,0.0003159363],"domain_scores_gemma":[0.98403555,0.007959513,0.0028515735,0.0013375161,0.0016946369,0.0021211507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001963296,0.00068425253,0.00086269947,0.0025195803,0.0015260442,0.0019388113,0.0013363544,0.0015602598,0.0059870547],"category_scores_gemma":[0.015605696,0.00084905146,0.0012222537,0.0012054042,0.003193981,0.0058241715,0.0020520058,0.0026104804,0.0012898633],"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.00022094861,0.00010763401,0.0031383145,0.00012395062,0.000024608422,0.00033776116,0.00048300202,0.0065360884,0.010130067,0.97218937,0.001925323,0.0047829673],"study_design_scores_gemma":[0.000095205745,0.00020212361,0.0027852138,0.00007588379,0.000034736535,0.00049888954,0.000516232,0.054500706,0.008794838,0.9290929,0.003329661,0.000073616255],"about_ca_topic_score_codex":0.00040106635,"about_ca_topic_score_gemma":0.0009301676,"teacher_disagreement_score":0.0059870547,"about_ca_system_score_codex":0.0010515032,"about_ca_system_score_gemma":0.0011242084,"threshold_uncertainty_score":0.02002865},"labels":[],"label_agreement":null},{"id":"W4412435997","doi":"10.55016/ojs/cdm.v11i2.62553","title":"Fully Indecomposable and Nearly Decomposable Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Research in Fundamental Sciences; School of Mathematics, Institute for Research in Fundamental Sciences; Sharif University of Technology","keywords":"Combinatorics; Mathematics; Indecomposable module; Cograph; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.018580713753969132,"score_gpt":0.3376772356103748,"score_spread":0.3190965218564057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435997","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.76696503,0.0003782319,0.19550502,0.00053574546,0.00005451125,0.00007100487,0.0013076962,0.0004473596,0.034735482],"genre_scores_gemma":[0.9631385,0.000260981,0.02866589,0.00016914698,0.00006879656,0.000062414045,0.0012897855,0.00006192945,0.006282557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995302,0.00007333012,0.000027200542,0.00016772246,0.000102469014,0.00009913979],"domain_scores_gemma":[0.99816656,0.00068340625,0.0003377874,0.00031376592,0.00019253303,0.00030585282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028687075,0.00048341387,0.00025810214,0.0006681523,0.00044376953,0.00066706236,0.000656779,0.0004874787,0.004406344],"category_scores_gemma":[0.0018825603,0.0003441123,0.00033050985,0.0005670654,0.0009024424,0.001559244,0.000880103,0.0009279113,0.00048706259],"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.000491211,0.00023650477,0.005680252,0.00026772372,0.00009227523,0.0045326105,0.0009380172,0.036971644,0.07231393,0.7985704,0.006516572,0.07338895],"study_design_scores_gemma":[0.000031726842,0.00010804654,0.0032186033,0.000025656107,0.00002453749,0.0021909608,0.0002885495,0.061691705,0.009988104,0.91551477,0.0068837935,0.000033627453],"about_ca_topic_score_codex":0.00033568582,"about_ca_topic_score_gemma":0.0003920926,"teacher_disagreement_score":0.004406344,"about_ca_system_score_codex":0.00023546495,"about_ca_system_score_gemma":0.00021820294,"threshold_uncertainty_score":0.014740646},"labels":[],"label_agreement":null},{"id":"W4412436079","doi":"10.55016/ojs/cdm.v11i2.62453","title":"On monochromatic linear recurrence sequences","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hungarian Scientific Research Fund","keywords":"Monochromatic color; Mathematics; Combinatorics; Physics; Optics","score_opus":0.054490159564570886,"score_gpt":0.4087793426577629,"score_spread":0.354289183093192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412436079","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.1828511,0.0037910894,0.71570325,0.0012983696,0.000804621,0.00012541494,0.00067823636,0.00061613356,0.094131835],"genre_scores_gemma":[0.831928,0.0026413826,0.1286515,0.0011972063,0.00073714077,0.00023319715,0.00086736295,0.00027654023,0.033467606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988085,0.0002648153,0.000078094774,0.0002606473,0.0003756576,0.00021227308],"domain_scores_gemma":[0.9971908,0.0015327111,0.00042312936,0.00030542212,0.00043657713,0.0001114531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014904093,0.00070208876,0.00059580134,0.001295045,0.0009396556,0.0011036515,0.0011228422,0.0006643862,0.009631641],"category_scores_gemma":[0.006579984,0.00034675273,0.0008387915,0.0012342829,0.0011567,0.0024764554,0.0011014242,0.0014612183,0.0015547437],"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.000059451588,0.000020560798,0.0002609429,0.00012724852,0.000013524616,0.00019454036,0.00023488166,0.0062754485,0.0031432516,0.9619268,0.0022845506,0.025458803],"study_design_scores_gemma":[0.000028790382,0.00008870169,0.0003099686,0.000054984655,0.000022879432,0.00036915322,0.0000853533,0.05215215,0.005373143,0.9292411,0.012239258,0.000034489174],"about_ca_topic_score_codex":0.0014000642,"about_ca_topic_score_gemma":0.0013273029,"teacher_disagreement_score":0.009631641,"about_ca_system_score_codex":0.0010104192,"about_ca_system_score_gemma":0.00057351385,"threshold_uncertainty_score":0.03222102},"labels":[],"label_agreement":null},{"id":"W4412439609","doi":"10.55016/ojs/cdm.v11i1.62391","title":"Barnes-type Boole polynomials","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Biology","score_opus":0.034723283528363014,"score_gpt":0.3643940343036846,"score_spread":0.3296707507753216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412439609","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.4741987,0.0019968152,0.33431017,0.0015222237,0.0006926045,0.00007245568,0.0002645912,0.00044410484,0.18649827],"genre_scores_gemma":[0.9498827,0.00081403065,0.020927766,0.0003099383,0.00033444157,0.000019541198,0.0001123125,0.000080155514,0.027519178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997646,0.000035920948,0.000007780008,0.00003081749,0.00008841353,0.00007250095],"domain_scores_gemma":[0.9997309,0.000066410845,0.0000415728,0.000029707679,0.00008119215,0.00005028256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003855676,0.00041800912,0.0003130256,0.0012521292,0.0011032148,0.0008289918,0.0005764408,0.00049702276,0.004345393],"category_scores_gemma":[0.0012566647,0.00012344883,0.0003685921,0.0008525865,0.0012806442,0.0025646042,0.0009372056,0.0013313727,0.00072080677],"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.000026034757,0.0000094905645,0.00020742381,0.000032364398,0.0000029233065,0.00013939608,0.0001310637,0.00066326454,0.0027712877,0.98919255,0.00048326628,0.006341037],"study_design_scores_gemma":[0.0000110304345,0.00003371202,0.00052711036,0.000019148847,0.000009663501,0.00049301836,0.0001325913,0.009520649,0.002957271,0.9775367,0.008736364,0.000022778995],"about_ca_topic_score_codex":0.0007292065,"about_ca_topic_score_gemma":0.0008280559,"teacher_disagreement_score":0.004345393,"about_ca_system_score_codex":0.0004287646,"about_ca_system_score_gemma":0.00034636603,"threshold_uncertainty_score":0.014536798},"labels":[],"label_agreement":null},{"id":"W4412439628","doi":"10.55016/ojs/cdm.v11i1.62406","title":"The annihilating-ideal graph of Z n is weakly perfect","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shahid Rajaee Teacher Training University; Kharazmi University","keywords":"Mathematics; Combinatorics; Ideal (ethics); Graph; Discrete mathematics","score_opus":0.021044444024519403,"score_gpt":0.30152784908124763,"score_spread":0.28048340505672825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412439628","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.84515584,0.00040254305,0.10117744,0.00077853526,0.0001134376,0.00006953791,0.00083901425,0.00020853191,0.05125508],"genre_scores_gemma":[0.9751015,0.00034929576,0.015536024,0.00012242075,0.00006042981,0.0000458953,0.00055888575,0.000041961706,0.008183612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997352,0.000053502055,0.00001210385,0.000088953886,0.0000482232,0.0000619383],"domain_scores_gemma":[0.9993549,0.00021731951,0.00015136691,0.00006970926,0.000092350136,0.00011436719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028774128,0.0003298419,0.0003227579,0.0008236294,0.0009410227,0.0009381496,0.000478588,0.00021076806,0.0026554985],"category_scores_gemma":[0.00069297187,0.0001763181,0.0003078264,0.0005417676,0.0017164138,0.0013736502,0.0006419081,0.00041086538,0.00028623338],"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.0001394569,0.000022099128,0.002271489,0.000106184714,0.000023391336,0.00017856501,0.0003879894,0.0034168214,0.009414953,0.97055066,0.001851837,0.011636664],"study_design_scores_gemma":[0.000028514256,0.00010768754,0.0055103456,0.00002877563,0.000049897153,0.00062380166,0.00044348522,0.023632733,0.010166616,0.9380332,0.021332148,0.000042740026],"about_ca_topic_score_codex":0.0016022986,"about_ca_topic_score_gemma":0.002172851,"teacher_disagreement_score":0.0026554985,"about_ca_system_score_codex":0.0007610821,"about_ca_system_score_gemma":0.00047977647,"threshold_uncertainty_score":0.008883536},"labels":[],"label_agreement":null},{"id":"W4412439629","doi":"10.55016/ojs/cdm.v11i1.62309","title":"Distinct values of bilinear forms on algebraic curves","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Bilinear interpolation; Algebraic number; Combinatorics; Bilinear form; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.03659989439661144,"score_gpt":0.32775517058884035,"score_spread":0.2911552761922289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412439629","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.88450724,0.0006682856,0.07021568,0.00068223587,0.00010748268,0.000034186556,0.00018951991,0.0001223985,0.043473102],"genre_scores_gemma":[0.9890534,0.00017412426,0.007352775,0.000058045098,0.00006314566,0.000024196452,0.000100194084,0.000026365535,0.0031476398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818546,0.00040223874,0.00012255111,0.0004798848,0.00037272452,0.00043712306],"domain_scores_gemma":[0.99530953,0.001969252,0.0005620541,0.0006608581,0.00055277697,0.00094558933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015886887,0.00092817616,0.00082264456,0.0022758173,0.0023329884,0.0035779914,0.0012156976,0.0010431624,0.004269011],"category_scores_gemma":[0.005934022,0.0006049947,0.0007517801,0.0013894532,0.006399745,0.0058577806,0.005729858,0.0030407854,0.00075375964],"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.00011979329,0.000029230949,0.0013506584,0.000050099938,0.000014007078,0.0003148824,0.0005574081,0.0013497989,0.00412047,0.9863689,0.00036712145,0.0053576003],"study_design_scores_gemma":[0.00003823406,0.00006614915,0.0006007601,0.000029283523,0.000013953523,0.00052228145,0.00038306124,0.004626939,0.0059183496,0.9829454,0.0048124352,0.000043128188],"about_ca_topic_score_codex":0.00032902564,"about_ca_topic_score_gemma":0.0002333173,"teacher_disagreement_score":0.004269011,"about_ca_system_score_codex":0.0016567877,"about_ca_system_score_gemma":0.0005324264,"threshold_uncertainty_score":0.014281213},"labels":[],"label_agreement":null},{"id":"W4412439630","doi":"10.55016/ojs/cdm.v11i1.62390","title":"Automorphisms of circulants that respect partitions","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Automorphism; Mathematics; Combinatorics","score_opus":0.04983588222167305,"score_gpt":0.34409065007234896,"score_spread":0.2942547678506759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412439630","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.7467862,0.0004186372,0.19771464,0.00025524618,0.00039253398,0.00018503907,0.00017238823,0.0005032743,0.053572178],"genre_scores_gemma":[0.9570325,0.0003268267,0.028355729,0.00021816953,0.00029455964,0.000116442774,0.00024772092,0.00024383268,0.01316416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907696,0.0001547036,0.000054249387,0.00025182794,0.0002121595,0.0002502094],"domain_scores_gemma":[0.99843675,0.00036883174,0.00030897354,0.00044132688,0.00022593261,0.000218162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005625077,0.00049821305,0.00049799826,0.0010653092,0.001506059,0.0015260435,0.00039710177,0.00050384464,0.002423173],"category_scores_gemma":[0.0026277346,0.0003300882,0.0008003333,0.0005191356,0.0024372358,0.0016248372,0.0012877518,0.0009748594,0.00069176627],"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.000106067266,0.000046738613,0.0008919277,0.0000455624,0.000020944666,0.00024181731,0.00090044655,0.005283272,0.018175708,0.95682544,0.00084878545,0.016613303],"study_design_scores_gemma":[0.00007134884,0.00013567357,0.0016223071,0.000029261964,0.00003109008,0.0003652526,0.00032261937,0.013451034,0.010421872,0.9580185,0.015487449,0.00004363793],"about_ca_topic_score_codex":0.0021852457,"about_ca_topic_score_gemma":0.0020117508,"teacher_disagreement_score":0.002423173,"about_ca_system_score_codex":0.0009486918,"about_ca_system_score_gemma":0.00071556173,"threshold_uncertainty_score":0.008106291},"labels":[],"label_agreement":null},{"id":"W4412582169","doi":"10.55016/ojs/cdm.v12i2.62487","title":"Lower Bounds on the Distance Domination Number of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; University of Johannesburg; National Research Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.020261008347206164,"score_gpt":0.3484921222010613,"score_spread":0.3282311138538551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582169","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.4191047,0.030063145,0.42681536,0.0073582255,0.00053109584,0.00018183702,0.003334884,0.0015234636,0.11108731],"genre_scores_gemma":[0.918705,0.007935108,0.061458077,0.0007839124,0.0006587008,0.00024516252,0.001703017,0.0003610491,0.008149876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975013,0.0004601801,0.000117372605,0.0006705175,0.00071378297,0.00053684314],"domain_scores_gemma":[0.97797966,0.017134055,0.0012025579,0.0013564718,0.0011153693,0.0012118955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021243272,0.0019938233,0.0016407642,0.0031840405,0.0013493905,0.0029062154,0.0025139493,0.0013237604,0.0045314785],"category_scores_gemma":[0.014414052,0.0007034611,0.0012529268,0.0021819158,0.002263217,0.0050119176,0.0032671993,0.003151135,0.0011738316],"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.002006081,0.00043040677,0.023506902,0.002358436,0.00055191404,0.0010215228,0.0015843366,0.34651893,0.09050277,0.37723267,0.023054123,0.13123196],"study_design_scores_gemma":[0.00009091073,0.00040812237,0.011113385,0.00042858155,0.0002764614,0.0023094148,0.0004097156,0.62542677,0.02460088,0.3079234,0.026823651,0.00018865349],"about_ca_topic_score_codex":0.0012729142,"about_ca_topic_score_gemma":0.0016234205,"teacher_disagreement_score":0.0045314785,"about_ca_system_score_codex":0.0033953553,"about_ca_system_score_gemma":0.0007596698,"threshold_uncertainty_score":0.024635077},"labels":[],"label_agreement":null},{"id":"W4412582188","doi":"10.55016/ojs/cdm.v12i2.62745","title":"Permutations avoiding connected graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.028515208239438185,"score_gpt":0.35768140537228726,"score_spread":0.32916619713284906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582188","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.72767866,0.00057125563,0.16168225,0.0014411038,0.000330494,0.00018551697,0.0005286608,0.0008514343,0.10673065],"genre_scores_gemma":[0.95049155,0.0004792749,0.030675372,0.0003302704,0.00022041242,0.00019662698,0.0006859599,0.0001617639,0.016758742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989807,0.0002400382,0.000078547084,0.0002597071,0.0002225451,0.00021840079],"domain_scores_gemma":[0.99786454,0.00084803585,0.0003509643,0.0003708294,0.00020095857,0.0003647849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044519402,0.0005123131,0.00054345286,0.0014227418,0.0020223851,0.0019017825,0.00061324274,0.0013452676,0.0043839244],"category_scores_gemma":[0.00352962,0.0005588657,0.0005683822,0.001560942,0.0026909923,0.0025648763,0.0025884458,0.0014047314,0.0008596649],"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.00015291663,0.000029148296,0.0012111622,0.00008237528,0.000012984532,0.00064365886,0.000584861,0.0021312227,0.007570071,0.9660415,0.0024036192,0.019136459],"study_design_scores_gemma":[0.000026953307,0.000037241312,0.0005120317,0.000018216486,0.000016559716,0.000603726,0.00016415725,0.0050482205,0.0029425377,0.9770081,0.013605092,0.000017083928],"about_ca_topic_score_codex":0.0005240788,"about_ca_topic_score_gemma":0.00067501666,"teacher_disagreement_score":0.0043839244,"about_ca_system_score_codex":0.00079650903,"about_ca_system_score_gemma":0.00054946926,"threshold_uncertainty_score":0.014665663},"labels":[],"label_agreement":null},{"id":"W4412582193","doi":"10.55016/ojs/cdm.v12i2.62287","title":"The Forcing Strong Metric Dimension of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Dimension (graph theory); Graph; Metric (unit); Forcing (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.017901472927710552,"score_gpt":0.29517904130806233,"score_spread":0.2772775683803518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582193","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.72508967,0.0020937216,0.22473945,0.002366614,0.00032289943,0.00009019067,0.0032009801,0.00032681815,0.04176967],"genre_scores_gemma":[0.94645673,0.0008522131,0.047362685,0.00022757988,0.00030252628,0.000112266905,0.0010721531,0.000048595277,0.0035652788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991547,0.00015197297,0.000064474094,0.00028944737,0.00021122991,0.00012823526],"domain_scores_gemma":[0.99763834,0.0011371273,0.00037629937,0.0003099141,0.00022380125,0.00031450883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005873515,0.00043632876,0.00049098,0.0019418539,0.00097459333,0.0019353873,0.0006289344,0.00057431334,0.0021027715],"category_scores_gemma":[0.002838227,0.00025921507,0.00062259915,0.0016513168,0.001965979,0.0030083447,0.0015087252,0.0009839643,0.00029340415],"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.00012750286,0.000036154688,0.003453096,0.00016045925,0.00003889719,0.000114339375,0.000427447,0.009589245,0.0060994257,0.948919,0.004382372,0.026652006],"study_design_scores_gemma":[0.000020109044,0.00007418351,0.003391323,0.00004131585,0.000025271389,0.0004928815,0.00019335996,0.038525432,0.0029992952,0.93628424,0.017902322,0.00005017545],"about_ca_topic_score_codex":0.00058076053,"about_ca_topic_score_gemma":0.0004916331,"teacher_disagreement_score":0.0021027715,"about_ca_system_score_codex":0.0012836533,"about_ca_system_score_gemma":0.00058555807,"threshold_uncertainty_score":0.009313643},"labels":[],"label_agreement":null},{"id":"W4412582201","doi":"10.55016/ojs/cdm.v12i2.62550","title":"Bounds for the m -Eternal Domination Number of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.025918743299742482,"score_gpt":0.38280737895624833,"score_spread":0.35688863565650586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582201","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.51101154,0.0084323855,0.29207382,0.010178724,0.0003770775,0.0001832317,0.0042637666,0.0014336222,0.17204584],"genre_scores_gemma":[0.9417681,0.0022601332,0.041516278,0.000678806,0.00039357864,0.00019704351,0.0009970829,0.0002543666,0.011934647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818134,0.00026427043,0.00008068798,0.0004906028,0.0004096334,0.00057345355],"domain_scores_gemma":[0.9820869,0.012989063,0.0010834537,0.0016764295,0.00075355626,0.0014105715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020854154,0.0012428624,0.0011176707,0.0026996492,0.0015332608,0.0025058421,0.002761835,0.0010916351,0.008969643],"category_scores_gemma":[0.012538708,0.00060457597,0.0010522272,0.0017252407,0.002805882,0.0058200755,0.0026985172,0.0031287782,0.0011234964],"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.0019697107,0.00043298685,0.018524582,0.0011098352,0.00030339675,0.00069849787,0.0009821171,0.17037211,0.04403918,0.6422429,0.022294642,0.097030066],"study_design_scores_gemma":[0.000108218126,0.00026710014,0.009809924,0.00023429147,0.00017249903,0.0010121344,0.00021384218,0.34379193,0.0144202,0.60855645,0.02126844,0.00014496745],"about_ca_topic_score_codex":0.0022270456,"about_ca_topic_score_gemma":0.004155265,"teacher_disagreement_score":0.008969643,"about_ca_system_score_codex":0.0033426909,"about_ca_system_score_gemma":0.0011707034,"threshold_uncertainty_score":0.030006409},"labels":[],"label_agreement":null},{"id":"W4412582204","doi":"10.55016/ojs/cdm.v12i2.62488","title":"Split (n + t)-color partitions and 2-color F-partitions","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Council of Scientific and Industrial Research, India","keywords":"Combinatorics; Mathematics","score_opus":0.014824146259061383,"score_gpt":0.33193528487317103,"score_spread":0.31711113861410967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582204","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.46786776,0.0030736316,0.23210368,0.0025354621,0.001159084,0.00009586654,0.000308271,0.00022458954,0.29263166],"genre_scores_gemma":[0.93032783,0.0011617718,0.03682394,0.00071136036,0.00044965616,0.00007354466,0.0001514929,0.0000991421,0.030201333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996153,0.00007359321,0.000018629775,0.00008084452,0.00010552925,0.00010610164],"domain_scores_gemma":[0.999458,0.00018771047,0.000072568626,0.00009352887,0.000105921376,0.000082283506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051028415,0.00050980604,0.0003281566,0.0010387102,0.0016086885,0.0016274025,0.00053425017,0.0006389682,0.006701628],"category_scores_gemma":[0.001477252,0.00024193784,0.0007453521,0.0009207535,0.0032512394,0.0036517077,0.0012214467,0.0016441535,0.0006476821],"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.000013978844,0.000005053328,0.00013584063,0.000010964276,0.0000017174401,0.000050742605,0.00012861217,0.0002718729,0.00055861735,0.9940817,0.0008133006,0.0039276024],"study_design_scores_gemma":[0.0000080964655,0.000012706444,0.00048035162,0.000008541816,0.000004581484,0.00029825626,0.00012055263,0.001460688,0.0008757958,0.9875338,0.009185366,0.000011087726],"about_ca_topic_score_codex":0.00091312383,"about_ca_topic_score_gemma":0.0013816014,"teacher_disagreement_score":0.006701628,"about_ca_system_score_codex":0.0010397943,"about_ca_system_score_gemma":0.0003996563,"threshold_uncertainty_score":0.022419155},"labels":[],"label_agreement":null},{"id":"W4412582216","doi":"10.55016/ojs/cdm.v12i2.62496","title":"On combinatorial extensions of Rogers-Ramanujan type identities","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Combinatorial proof; Ramanujan's sum","score_opus":0.04324982663820147,"score_gpt":0.3888282136038647,"score_spread":0.34557838696566323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582216","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.61190915,0.0012797818,0.11649305,0.0010319208,0.000530058,0.00005084315,0.00010845762,0.00017145643,0.2684253],"genre_scores_gemma":[0.96356666,0.000488557,0.015868917,0.00024716256,0.00029404878,0.000042436586,0.000059889484,0.00004512705,0.01938725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939907,0.00017620472,0.000033336637,0.00008340254,0.00021457767,0.00009341746],"domain_scores_gemma":[0.9993449,0.00024145945,0.00008865971,0.00011264548,0.00011139993,0.000100951365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092015,0.0004026182,0.00038964936,0.0011438095,0.0012488086,0.0018206544,0.0008163312,0.0005375548,0.003607447],"category_scores_gemma":[0.0017665756,0.00021690795,0.00055803405,0.0007812953,0.0026555944,0.0030527606,0.0015973093,0.0013938759,0.00055121834],"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.0000057033108,0.000006107636,0.00007416558,0.0000069367766,9.746408e-7,0.000047736117,0.000090039626,0.00028113445,0.0004345,0.99760276,0.00010726061,0.0013428563],"study_design_scores_gemma":[0.00000949735,0.000017633754,0.00025676927,0.000009333287,0.0000036857498,0.00017755007,0.00010889053,0.0030980231,0.0004202979,0.99205935,0.0038298864,0.00000915192],"about_ca_topic_score_codex":0.00045124933,"about_ca_topic_score_gemma":0.0005664793,"teacher_disagreement_score":0.003607447,"about_ca_system_score_codex":0.00093586853,"about_ca_system_score_gemma":0.00048671244,"threshold_uncertainty_score":0.012068152},"labels":[],"label_agreement":null},{"id":"W4412582229","doi":"10.55016/ojs/cdm.v12i2.62481","title":"Ball hulls, ball intersections, and 2-center problems for gauges","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Junta de Extremadura","keywords":"Ball (mathematics); Mathematics; Hull; Combinatorics; Center (category theory); Geometry; Engineering; Marine engineering; Crystallography","score_opus":0.021089062618290574,"score_gpt":0.30980261489859967,"score_spread":0.2887135522803091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582229","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.09357327,0.00080215465,0.89190125,0.00062697957,0.00008065704,0.00006844047,0.00017575517,0.00015819211,0.012613251],"genre_scores_gemma":[0.65952617,0.0012502316,0.32538646,0.00020825978,0.00030047665,0.00021832515,0.0007801356,0.00023154334,0.012098308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869746,0.00047748073,0.00006297444,0.00023985757,0.00037709172,0.00014519462],"domain_scores_gemma":[0.9969459,0.0018537433,0.0003419605,0.0003039992,0.00029467593,0.00025977448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017774962,0.00080623035,0.0011346823,0.00196016,0.0012633223,0.0021812785,0.001588725,0.0015977868,0.0046608667],"category_scores_gemma":[0.006855932,0.000488079,0.0010245377,0.0016120416,0.0040268074,0.005884694,0.004556752,0.0024979347,0.00053607806],"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.00004042239,0.00002661376,0.0004813191,0.0000729102,0.000010688295,0.00006648775,0.00018457744,0.026408982,0.00071452715,0.9566982,0.0015240106,0.013771276],"study_design_scores_gemma":[0.00001516015,0.00003335279,0.00035797255,0.000023064014,0.0000073465903,0.00009333482,0.00017039383,0.13261709,0.0011158901,0.8611777,0.004369916,0.000018811792],"about_ca_topic_score_codex":0.0014518739,"about_ca_topic_score_gemma":0.0012062478,"teacher_disagreement_score":0.0046608667,"about_ca_system_score_codex":0.0015133611,"about_ca_system_score_gemma":0.0007437486,"threshold_uncertainty_score":0.015592158},"labels":[],"label_agreement":null},{"id":"W4412582233","doi":"10.55016/ojs/cdm.v12i2.62785","title":"Internal and external duality in abstract polytopes","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Duality (order theory)","score_opus":0.016404281631802912,"score_gpt":0.302181869160699,"score_spread":0.2857775875288961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582233","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.53530824,0.00045619634,0.38226286,0.00029876173,0.00012599198,0.00006965826,0.00033914697,0.00016591811,0.0809732],"genre_scores_gemma":[0.94831985,0.00021510122,0.04160458,0.00007285568,0.00006559778,0.00006402751,0.000341015,0.0000650621,0.009251883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999193,0.00015853377,0.000036425994,0.00015970283,0.00029371213,0.00015852622],"domain_scores_gemma":[0.9992299,0.0002098439,0.0001608102,0.00014200008,0.00010650052,0.00015097375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048456146,0.00035860125,0.00038847342,0.00088710774,0.0008729896,0.0019725394,0.0005402971,0.00044769852,0.005207085],"category_scores_gemma":[0.0015271404,0.00030677728,0.0007181516,0.0005033526,0.0025243834,0.0016272888,0.0020533772,0.0011570349,0.00046929112],"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.000058224323,0.00006492333,0.0007860442,0.00006868764,0.000014395432,0.0001607711,0.00018888841,0.021630641,0.0032069867,0.9608015,0.0009786602,0.012040206],"study_design_scores_gemma":[0.0000408524,0.00012271934,0.0013052848,0.00005815557,0.00001963313,0.0005538096,0.00054664334,0.09012372,0.005051408,0.8890038,0.013140427,0.000033471948],"about_ca_topic_score_codex":0.00037965356,"about_ca_topic_score_gemma":0.00034545173,"teacher_disagreement_score":0.005207085,"about_ca_system_score_codex":0.00048721206,"about_ca_system_score_gemma":0.00023229778,"threshold_uncertainty_score":0.017419457},"labels":[],"label_agreement":null},{"id":"W4412582246","doi":"10.55016/ojs/cdm.v12i2.62514","title":"Degree Associated Reconstruction Parameters of Total Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics","score_opus":0.032414841910564075,"score_gpt":0.3101735317346863,"score_spread":0.2777586898241222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582246","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.8338596,0.00032210306,0.15070632,0.00021193187,0.000020382813,0.00004624038,0.000530115,0.00019227361,0.014110921],"genre_scores_gemma":[0.97152406,0.00026117743,0.02462852,0.0000486503,0.00003279861,0.000054358647,0.0005060776,0.00010531359,0.0028390693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992304,0.00020175785,0.000048297592,0.00023524174,0.0001853001,0.00009899896],"domain_scores_gemma":[0.99374723,0.0032357487,0.00093941414,0.0010312981,0.0005346373,0.0005116784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092272024,0.0005077464,0.0004317599,0.0018252617,0.0005938332,0.0013390183,0.0011159638,0.0007161202,0.0036867703],"category_scores_gemma":[0.007620225,0.00036564874,0.00041702547,0.0011490362,0.0016878479,0.003144269,0.0010171463,0.0011235152,0.0003898517],"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.00041007972,0.00008944294,0.011922752,0.00020575359,0.00006253318,0.00023885684,0.00077340624,0.1028001,0.01508738,0.81691855,0.00201806,0.049473096],"study_design_scores_gemma":[0.00005167043,0.00016569218,0.00810089,0.00005738874,0.00006532396,0.0010920458,0.0005222445,0.23518352,0.013223034,0.73307866,0.008369218,0.00009031212],"about_ca_topic_score_codex":0.00048061484,"about_ca_topic_score_gemma":0.00069765,"teacher_disagreement_score":0.0036867703,"about_ca_system_score_codex":0.0008825723,"about_ca_system_score_gemma":0.00032481435,"threshold_uncertainty_score":0.012333453},"labels":[],"label_agreement":null},{"id":"W4412582248","doi":"10.55016/ojs/cdm.v12i2.62380","title":"On Chromatic Number of General Kneser Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Discrete mathematics","score_opus":0.014544447626875321,"score_gpt":0.30835567676570436,"score_spread":0.293811229138829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582248","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.7026399,0.0036336286,0.1350544,0.0026062739,0.0002687156,0.00005685301,0.0006264779,0.00050288625,0.15461092],"genre_scores_gemma":[0.96620107,0.0015499942,0.017138707,0.00024757796,0.00023618965,0.00006160776,0.00040494217,0.00017034716,0.013989604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939895,0.00012079609,0.000019491094,0.00017573347,0.00014932154,0.0001357449],"domain_scores_gemma":[0.9970092,0.0018715201,0.00036343597,0.00023213497,0.00023592058,0.00028780985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000764265,0.0005392285,0.00048480288,0.0026297497,0.0015030281,0.0018805491,0.0010237868,0.0008639819,0.0067699016],"category_scores_gemma":[0.0044325697,0.0004044832,0.00042077753,0.0019045669,0.0029903827,0.0035504168,0.0014402906,0.0017405346,0.0005844053],"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.00017066633,0.000042001495,0.0016089774,0.00014275899,0.000022484352,0.00010297195,0.0004413415,0.0306587,0.004528425,0.9452286,0.004627617,0.012425386],"study_design_scores_gemma":[0.0000295763,0.00004172228,0.0018156443,0.000047607547,0.000027956703,0.00016396426,0.00028732145,0.0871852,0.0019374528,0.9000522,0.008366071,0.00004531572],"about_ca_topic_score_codex":0.0043422976,"about_ca_topic_score_gemma":0.0058210497,"teacher_disagreement_score":0.0067699016,"about_ca_system_score_codex":0.002465342,"about_ca_system_score_gemma":0.00060909794,"threshold_uncertainty_score":0.02264756},"labels":[],"label_agreement":null},{"id":"W4412582255","doi":"10.55016/ojs/cdm.v12i2.62508","title":"On Cops and Robbers on G Ξ and cop-edge critical graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Center for Research and Development in Mathematics and Applications","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Artificial intelligence","score_opus":0.023302382710995946,"score_gpt":0.3636016574214429,"score_spread":0.34029927471044696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582255","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.65962,0.0012287077,0.25880113,0.0023139494,0.000107691536,0.00023089498,0.00042534195,0.00019982572,0.07707247],"genre_scores_gemma":[0.9483057,0.0010982166,0.036845937,0.00039264772,0.00013769568,0.00021276019,0.00045415296,0.00014876586,0.012404193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911124,0.00034118342,0.0000347355,0.00019219637,0.000114020586,0.00020665806],"domain_scores_gemma":[0.99501026,0.00318325,0.00067691784,0.00018446015,0.00018379113,0.0007613929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007195494,0.00137146,0.0009285592,0.00201679,0.002048866,0.0018706645,0.0011902591,0.0017722921,0.00645449],"category_scores_gemma":[0.004976772,0.0006061329,0.0008325859,0.0012380701,0.004061266,0.0035302273,0.0020618455,0.0019882547,0.00045586485],"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.00014903881,0.00008396203,0.0013574235,0.00016698767,0.00003479683,0.0005406713,0.0005964868,0.04853442,0.0029689982,0.9343162,0.0029595038,0.008291396],"study_design_scores_gemma":[0.00004008096,0.0000819168,0.0011224898,0.00007056398,0.000028021232,0.00030146874,0.00040197882,0.102273256,0.0010299607,0.8899511,0.004665078,0.00003411929],"about_ca_topic_score_codex":0.0041191694,"about_ca_topic_score_gemma":0.0031972968,"teacher_disagreement_score":0.00645449,"about_ca_system_score_codex":0.00221051,"about_ca_system_score_gemma":0.00079769775,"threshold_uncertainty_score":0.021592438},"labels":[],"label_agreement":null},{"id":"W4412582259","doi":"10.55016/ojs/cdm.v12i2.62479","title":"On the metric dimension of circulant graphs with 4 generators","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Circulant matrix; Mathematics; Metric dimension; Dimension (graph theory); Combinatorics; Metric (unit); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.016319587907723282,"score_gpt":0.2642509834178813,"score_spread":0.247931395510158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582259","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.82756346,0.006648016,0.0918519,0.003465019,0.00042106802,0.000051727126,0.0013646743,0.00032539075,0.068308644],"genre_scores_gemma":[0.97479445,0.0021209973,0.01630617,0.00048263615,0.00050482975,0.0000804188,0.000838506,0.00013925714,0.0047328263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909484,0.00027694355,0.000034931993,0.00022005556,0.00016895238,0.00020430531],"domain_scores_gemma":[0.99412835,0.00353226,0.00070639775,0.0003759752,0.00042875926,0.0008282308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083508267,0.0010034068,0.0009743525,0.0025718855,0.0012215378,0.0023409708,0.0014372563,0.0010221725,0.0044471803],"category_scores_gemma":[0.0050468286,0.00043340362,0.00048924884,0.0018543307,0.002528487,0.003799663,0.0022471917,0.0021755933,0.00080116576],"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.0002730763,0.00009858377,0.004208504,0.00023821682,0.000059420716,0.00017969139,0.00054313795,0.01722972,0.007530637,0.93415624,0.011344976,0.024137774],"study_design_scores_gemma":[0.000030244284,0.00008246873,0.003452185,0.00006596366,0.000042360025,0.0003334261,0.0002312136,0.07307008,0.0030500456,0.91068846,0.0088665495,0.00008700844],"about_ca_topic_score_codex":0.0010106354,"about_ca_topic_score_gemma":0.0010652336,"teacher_disagreement_score":0.0044471803,"about_ca_system_score_codex":0.0013013906,"about_ca_system_score_gemma":0.0005743267,"threshold_uncertainty_score":0.014877319},"labels":[],"label_agreement":null},{"id":"W4412582263","doi":"10.55016/ojs/cdm.v12i2.62445","title":"On the total signed domination number of the Cartesian product of paths","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Cartesian product; Mathematics; Combinatorics; Product (mathematics); Geometry","score_opus":0.015871039270510267,"score_gpt":0.32509482120535843,"score_spread":0.3092237819348482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582263","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.62440586,0.0030676126,0.3249942,0.001288472,0.00017414597,0.0001160703,0.0009763842,0.00029194448,0.04468528],"genre_scores_gemma":[0.93614,0.0018100039,0.056011792,0.00023995273,0.00019318624,0.00019038243,0.0006269701,0.000106865766,0.0046809423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985563,0.00039792026,0.000086272405,0.00034471333,0.00039428665,0.00022048842],"domain_scores_gemma":[0.9834712,0.012947124,0.0010845478,0.0008268907,0.00080158905,0.0008686587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023015256,0.0011590635,0.00092739606,0.0025144995,0.0010068615,0.0021432687,0.001273961,0.00066142384,0.003540834],"category_scores_gemma":[0.015337634,0.00044255605,0.00069410075,0.002019949,0.0029330072,0.0045944783,0.0018845918,0.0014653278,0.00042755072],"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.001157476,0.00020750439,0.014311314,0.00074696355,0.00020404047,0.00055556727,0.0011556747,0.15313318,0.020007733,0.73179305,0.0058511584,0.070876315],"study_design_scores_gemma":[0.000066358305,0.00040344693,0.005329681,0.00019198885,0.00015044895,0.0010742708,0.00026971364,0.32868716,0.0074114227,0.64772564,0.008607073,0.000082747436],"about_ca_topic_score_codex":0.00081250054,"about_ca_topic_score_gemma":0.0009722535,"teacher_disagreement_score":0.003540834,"about_ca_system_score_codex":0.0015926356,"about_ca_system_score_gemma":0.0008545007,"threshold_uncertainty_score":0.012171805},"labels":[],"label_agreement":null},{"id":"W4412582271","doi":"10.55016/ojs/cdm.v12i2.62342","title":"The Outercoarseness of the n-cube","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cube (algebra); Combinatorics; Mathematics","score_opus":0.01214290612318316,"score_gpt":0.2730259981374543,"score_spread":0.2608830920142712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582271","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.40992415,0.0049455315,0.35643417,0.0035416544,0.0007374107,0.000105905616,0.0015789014,0.0006592045,0.22207305],"genre_scores_gemma":[0.91662186,0.0017443062,0.06137179,0.0009838282,0.0005071321,0.0001159125,0.00089547574,0.0002749772,0.017484667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792385,0.0006391686,0.00012858937,0.00041666487,0.0005660096,0.00032572084],"domain_scores_gemma":[0.9906116,0.005174032,0.00063462555,0.0016734928,0.001359168,0.00054705376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738679,0.0007576845,0.0008305546,0.0011681725,0.0011630129,0.0029610489,0.0010785254,0.0007223829,0.00882231],"category_scores_gemma":[0.0131241,0.00047374843,0.0009573245,0.0013234138,0.0041364874,0.007924233,0.00312947,0.002602331,0.0017214196],"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.00063877983,0.000037888145,0.0014757768,0.00030230798,0.000046277204,0.0003590369,0.00047985377,0.028110685,0.012111952,0.902479,0.011243887,0.042714544],"study_design_scores_gemma":[0.000040839637,0.00014422929,0.0015047122,0.000060785802,0.00001714601,0.0005317195,0.00019307209,0.0457838,0.010164312,0.91326755,0.028222771,0.00006907761],"about_ca_topic_score_codex":0.0012243039,"about_ca_topic_score_gemma":0.00057339383,"teacher_disagreement_score":0.00882231,"about_ca_system_score_codex":0.00069697155,"about_ca_system_score_gemma":0.0005308532,"threshold_uncertainty_score":0.029513597},"labels":[],"label_agreement":null},{"id":"W4412617744","doi":"10.55016/ojs/cdm.v12i1.62349","title":"Comments on the Golden Partition Conjecture","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Partition (number theory); Mathematics; Combinatorics; Genealogy; History","score_opus":0.07582106081252431,"score_gpt":0.4071750072494486,"score_spread":0.3313539464369243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617744","genre_codex":"commentary","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.006097985,0.0023278825,0.0033007988,0.9038366,0.030067725,0.000030614014,0.00050558074,0.00032740235,0.053505387],"genre_scores_gemma":[0.2391849,0.005748081,0.004424201,0.6146213,0.06451651,0.00016857323,0.0007190664,0.00034240918,0.0702751],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739045,0.00044238858,0.00015736377,0.0005977936,0.0010803795,0.00033148957],"domain_scores_gemma":[0.9913327,0.004304766,0.0006544283,0.00077350496,0.002276763,0.00065772654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033904328,0.00081208453,0.00065325847,0.0009865448,0.002408512,0.001804426,0.002866105,0.005022508,0.020790316],"category_scores_gemma":[0.01700965,0.00028332608,0.00079333165,0.0008421218,0.0054754717,0.0075636064,0.0027559588,0.008494808,0.0061555062],"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.0001100997,0.000028980765,0.00064357865,0.00017191253,0.000012399417,0.00055999024,0.00043113303,0.00047694522,0.00048644072,0.24234933,0.7465829,0.008146357],"study_design_scores_gemma":[0.000059909307,0.000043366283,0.0019436097,0.00025182933,0.000014582349,0.00060514046,0.000681563,0.0011251743,0.0009502835,0.24093749,0.7533248,0.0000622025],"about_ca_topic_score_codex":0.007758539,"about_ca_topic_score_gemma":0.003191127,"teacher_disagreement_score":0.020790316,"about_ca_system_score_codex":0.002877579,"about_ca_system_score_gemma":0.00086700765,"threshold_uncertainty_score":0.069550514},"labels":[],"label_agreement":null},{"id":"W4412617745","doi":"10.55016/ojs/cdm.v12i1.62277","title":"Independence complexes and incidence graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Independence (probability theory); Mathematics; Combinatorics; Independence number; Genealogy; Discrete mathematics; Graph; Statistics; History","score_opus":0.01821556129790029,"score_gpt":0.3112182112554097,"score_spread":0.2930026499575094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617745","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.4157801,0.0007976945,0.3232927,0.0014011916,0.0004539759,0.000118028176,0.0004797221,0.0004601076,0.25721645],"genre_scores_gemma":[0.95509535,0.00068619516,0.02036736,0.00030225274,0.0002879048,0.00008717497,0.00040683313,0.00015005078,0.022616914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899775,0.00014604135,0.000049417853,0.00022819267,0.000376505,0.00020203856],"domain_scores_gemma":[0.9969709,0.0011368115,0.0003864149,0.00041346444,0.000543118,0.0005492666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552965,0.00057306985,0.0004002139,0.00402202,0.0020308595,0.0032398521,0.0009644961,0.00085550355,0.014008736],"category_scores_gemma":[0.003606801,0.00044993628,0.0006930306,0.0019541327,0.0030432309,0.0069148024,0.0038260592,0.003068197,0.0013810443],"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.00001063357,0.000013353344,0.00042326818,0.000016646136,0.0000043938003,0.00008440878,0.00022234042,0.0004885315,0.0008028563,0.9925452,0.00066073285,0.004727628],"study_design_scores_gemma":[0.0000068086115,0.000013277074,0.0006667574,0.000015663323,0.000011562117,0.00032099462,0.00024025113,0.0054076617,0.0015681081,0.98386985,0.007862993,0.000016026437],"about_ca_topic_score_codex":0.0013937717,"about_ca_topic_score_gemma":0.000917866,"teacher_disagreement_score":0.014008736,"about_ca_system_score_codex":0.001012291,"about_ca_system_score_gemma":0.0005011439,"threshold_uncertainty_score":0.046863854},"labels":[],"label_agreement":null},{"id":"W4412617746","doi":"10.55016/ojs/cdm.v12i1.62581","title":"Conjectures on uniquely 3-edge-colorable graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Edge coloring; Discrete mathematics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.018878948315707942,"score_gpt":0.30164947933759173,"score_spread":0.28277053102188376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617746","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.7513337,0.00266026,0.13951933,0.010192754,0.0004715275,0.0001269127,0.002781263,0.0012044575,0.09170974],"genre_scores_gemma":[0.97308844,0.0010323554,0.019289188,0.0010001095,0.00024511685,0.00006793924,0.0015086189,0.00008836813,0.0036797903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745554,0.00050240126,0.00017782037,0.00089737086,0.0004438323,0.00052307895],"domain_scores_gemma":[0.98680127,0.007208027,0.0016585434,0.002538133,0.0008497988,0.00094422756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020490317,0.00070197,0.0009985194,0.0014921451,0.0023487457,0.0034832305,0.0018060094,0.0025145186,0.0065582073],"category_scores_gemma":[0.011789087,0.0007253869,0.0011988687,0.0025913354,0.0053110034,0.00816786,0.0027645258,0.002595002,0.0006189567],"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.00019393444,0.000077154524,0.007272039,0.00020702396,0.00002396483,0.0002450166,0.0013551317,0.011809248,0.0017651157,0.9551741,0.008019409,0.0138578415],"study_design_scores_gemma":[0.000032878717,0.000036425714,0.0018783383,0.00004411061,0.00002125524,0.00033399684,0.00072045415,0.011919058,0.001010925,0.9762635,0.0077037746,0.000035225505],"about_ca_topic_score_codex":0.0025906207,"about_ca_topic_score_gemma":0.002600108,"teacher_disagreement_score":0.0065582073,"about_ca_system_score_codex":0.0017854857,"about_ca_system_score_gemma":0.00082454423,"threshold_uncertainty_score":0.021939397},"labels":[],"label_agreement":null},{"id":"W4412617747","doi":"10.55016/ojs/cdm.v12i1.62236","title":"Congruences modulo powers of 2 and 3 for a restricted binary partition function a la Andrews and Lewis","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Congruence relation; Modulo; Mathematics; Partition (number theory); Combinatorics; Binary number; Arithmetic","score_opus":0.04227631620074517,"score_gpt":0.37314860189541027,"score_spread":0.3308722856946651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617747","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.670845,0.0031452186,0.08073946,0.005007992,0.0008554928,0.00017288937,0.00031954522,0.00019393774,0.23872039],"genre_scores_gemma":[0.97185946,0.0008429037,0.013706112,0.0005155137,0.0009890895,0.00011404046,0.00013748299,0.00006198084,0.011773373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973774,0.0007403482,0.00016585558,0.00041160377,0.00074902445,0.00055575406],"domain_scores_gemma":[0.9954959,0.0027475853,0.00048475034,0.00042149148,0.0003727863,0.00047746123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031743764,0.0006690456,0.001310778,0.0015319086,0.002918456,0.0040843207,0.00064961304,0.00081949116,0.005240236],"category_scores_gemma":[0.009101626,0.00052157784,0.0015370285,0.0014359985,0.0066652936,0.005425397,0.0031587896,0.0041178316,0.00086825935],"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.00004986761,0.000030338186,0.0003919766,0.00001925979,0.0000049438145,0.00010460283,0.00042718166,0.0003698638,0.0011857621,0.9941251,0.00092472084,0.0023663598],"study_design_scores_gemma":[0.00003923516,0.000016512562,0.00041272634,0.000013492285,0.000007351834,0.00009886942,0.00008674677,0.002585285,0.00068668625,0.9926247,0.0034142255,0.00001405449],"about_ca_topic_score_codex":0.001729826,"about_ca_topic_score_gemma":0.0009381111,"teacher_disagreement_score":0.005240236,"about_ca_system_score_codex":0.0018983643,"about_ca_system_score_gemma":0.0010737701,"threshold_uncertainty_score":0.017530322},"labels":[],"label_agreement":null},{"id":"W4412617749","doi":"10.55016/ojs/cdm.v12i1.62531","title":"Closing the Gap: Eternal Domination on 3 x n Grids","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Closing (real estate); Combinatorics; Mathematics; Law; Political science","score_opus":0.027804162392918913,"score_gpt":0.3259153034617716,"score_spread":0.2981111410688527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617749","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.34610954,0.0038361615,0.577414,0.004772143,0.0005655767,0.00007871377,0.0004307427,0.000655032,0.066138074],"genre_scores_gemma":[0.9422744,0.0019542978,0.04218876,0.0007640669,0.00026480292,0.00007695467,0.00023792898,0.00015738161,0.012081497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912006,0.00027905163,0.00003709422,0.00017316238,0.0001875046,0.000203161],"domain_scores_gemma":[0.9953047,0.003115919,0.000353475,0.00065597263,0.00030995085,0.0002600869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008738576,0.00042323567,0.000696023,0.00055854995,0.0010329324,0.0015487884,0.0012085319,0.00075347343,0.004664213],"category_scores_gemma":[0.0054950095,0.00025513847,0.0006148958,0.0009776871,0.0016286217,0.004051016,0.0023877306,0.0017552226,0.00043729504],"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.0006165947,0.00007715247,0.003391242,0.0003113332,0.00008268368,0.00059351244,0.00060783233,0.18996027,0.009511181,0.7104272,0.01298888,0.0714322],"study_design_scores_gemma":[0.00005409328,0.00007056386,0.0011810086,0.000053840995,0.00002706887,0.00044226288,0.00030408864,0.27455723,0.003852065,0.70098525,0.0184433,0.000029187568],"about_ca_topic_score_codex":0.0022555604,"about_ca_topic_score_gemma":0.00260581,"teacher_disagreement_score":0.004664213,"about_ca_system_score_codex":0.0010889336,"about_ca_system_score_gemma":0.0004654872,"threshold_uncertainty_score":0.0156033635},"labels":[],"label_agreement":null},{"id":"W4412617754","doi":"10.55016/ojs/cdm.v12i1.62402","title":"Some non-existence results for distance- j ovoids in small generalized polygons","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.06182706065280062,"score_gpt":0.3743802658007771,"score_spread":0.31255320514797647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617754","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.5657346,0.004643365,0.29446307,0.0026339327,0.00081972335,0.00015052049,0.00080983684,0.0005658811,0.13017915],"genre_scores_gemma":[0.91638505,0.0017123434,0.06725099,0.00048637533,0.0003590398,0.00016893196,0.0008555045,0.0001962106,0.012585557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914646,0.00015942332,0.00007685864,0.00020942536,0.00022256568,0.00018526951],"domain_scores_gemma":[0.99342114,0.0042410176,0.0005285731,0.0005661379,0.0005086889,0.0007345744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011208364,0.00082805357,0.00097170664,0.0019139069,0.0019424389,0.002761613,0.0017277565,0.0010272518,0.0076581165],"category_scores_gemma":[0.007951784,0.0010044608,0.0014849402,0.0013248514,0.0033098056,0.004837938,0.0037667896,0.0041356036,0.00078101543],"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.00030718115,0.00005565221,0.003350289,0.0006362393,0.000052414605,0.0010631221,0.0010393693,0.01105982,0.0080856895,0.95025814,0.004400752,0.019691363],"study_design_scores_gemma":[0.00006926199,0.00017324061,0.0017750779,0.00015658389,0.00007206532,0.0010588587,0.0011889702,0.037779447,0.009813055,0.9282309,0.019594172,0.00008838364],"about_ca_topic_score_codex":0.0009256424,"about_ca_topic_score_gemma":0.0010944704,"teacher_disagreement_score":0.0076581165,"about_ca_system_score_codex":0.0009916249,"about_ca_system_score_gemma":0.0004602289,"threshold_uncertainty_score":0.02561897},"labels":[],"label_agreement":null},{"id":"W4412617757","doi":"10.55016/ojs/cdm.v12i1.62344","title":"α-Resolvable λ-fold G-designs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fold (higher-order function); Combinatorics; Mathematics; Computer science; Programming language","score_opus":0.019686769001258552,"score_gpt":0.27854811497171394,"score_spread":0.2588613459704554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617757","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.40361232,0.0002899282,0.581065,0.0002513922,0.000050191822,0.00012715405,0.0002864488,0.00052494236,0.0137926005],"genre_scores_gemma":[0.84147865,0.00015177845,0.15272419,0.00012619204,0.000030293484,0.00015539749,0.0003045537,0.00006118215,0.0049677757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886477,0.00036913677,0.000078235076,0.0002506554,0.00022899087,0.0002082571],"domain_scores_gemma":[0.9964958,0.0016694297,0.00048147,0.0008321972,0.0003648399,0.00015635061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008825597,0.0005680808,0.00049807277,0.00045415873,0.00053660054,0.00077800703,0.00069681247,0.0010102566,0.0034837686],"category_scores_gemma":[0.0036868474,0.0005320911,0.000636891,0.00030455698,0.00072573015,0.0011129837,0.000864733,0.0009236003,0.00067456457],"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.001442408,0.00029839325,0.005455047,0.0006580981,0.00016870929,0.00072854094,0.00062813616,0.18746631,0.18077,0.44301057,0.0027485017,0.1766253],"study_design_scores_gemma":[0.00030603044,0.0019397055,0.0027507672,0.00020174515,0.00013016495,0.0017788528,0.00034778478,0.38211346,0.12797394,0.46461526,0.017716918,0.00012547325],"about_ca_topic_score_codex":0.0002794245,"about_ca_topic_score_gemma":0.0005648892,"teacher_disagreement_score":0.0034837686,"about_ca_system_score_codex":0.0004519437,"about_ca_system_score_gemma":0.00057293795,"threshold_uncertainty_score":0.011654377},"labels":[],"label_agreement":null},{"id":"W4412617758","doi":"10.55016/ojs/cdm.v12i1.62743","title":"The Spectrum of Balanced P^(3)(1, 5)-Designs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spectrum (functional analysis); Physics","score_opus":0.012829032395431789,"score_gpt":0.26471875447806387,"score_spread":0.25188972208263205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617758","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.8047266,0.0007147965,0.16442275,0.00043399588,0.00005514451,0.00006634326,0.00043523018,0.00018890479,0.028956195],"genre_scores_gemma":[0.9694443,0.00032846123,0.026340201,0.00012544043,0.00005718122,0.00012650518,0.00019834361,0.00003897985,0.003340559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900705,0.0003006942,0.000063333086,0.00019581105,0.00025144342,0.00018165934],"domain_scores_gemma":[0.9981547,0.0008556738,0.00033630963,0.0001976427,0.00023451254,0.00022118473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053138,0.00049199146,0.00041571562,0.0011424746,0.0008055553,0.0015087223,0.00047145694,0.0008293896,0.00375505],"category_scores_gemma":[0.003311461,0.00033361735,0.0003298381,0.00069704297,0.0010993959,0.0013903759,0.00085267925,0.0005425569,0.00039947577],"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.00050503394,0.000073848125,0.0020832336,0.00014318222,0.000036512458,0.0003202577,0.00032357825,0.018835435,0.023248555,0.91148895,0.0023270543,0.0406143],"study_design_scores_gemma":[0.00014627939,0.0002975821,0.0019785562,0.00010022953,0.000036864087,0.00071246264,0.0002639722,0.08457721,0.008040933,0.8957142,0.008096718,0.00003493265],"about_ca_topic_score_codex":0.00037230426,"about_ca_topic_score_gemma":0.0003327232,"teacher_disagreement_score":0.00375505,"about_ca_system_score_codex":0.000825407,"about_ca_system_score_gemma":0.00053459324,"threshold_uncertainty_score":0.012561917},"labels":[],"label_agreement":null},{"id":"W4412617759","doi":"10.55016/ojs/cdm.v12i1.62175","title":"Bounds on several versions of restrained domination number","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph","score_opus":0.022056640730318405,"score_gpt":0.3656217373183562,"score_spread":0.3435650965880378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617759","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.29949772,0.012917911,0.5626874,0.0030587295,0.00052670296,0.00034641818,0.0021354714,0.0017467726,0.11708293],"genre_scores_gemma":[0.8943808,0.0037096245,0.09224753,0.00065560616,0.000551801,0.00041841355,0.0009070068,0.0005089274,0.00662039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941012,0.0013469962,0.00034506767,0.0015135097,0.0018430754,0.00085003173],"domain_scores_gemma":[0.92949814,0.04703863,0.0062913527,0.009913397,0.004438516,0.0028199933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050229942,0.0018941406,0.0015144914,0.0048193345,0.0015611933,0.0032622106,0.005806819,0.0020904108,0.008461398],"category_scores_gemma":[0.04319788,0.00093467266,0.0016619611,0.0039971215,0.00472707,0.013766708,0.0034329141,0.006121008,0.0009788064],"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.0012709581,0.0003803673,0.012224813,0.00139299,0.00038082752,0.0007438882,0.0010701279,0.19081876,0.018529778,0.63980305,0.01234909,0.12103539],"study_design_scores_gemma":[0.00008512715,0.00028965937,0.0049394644,0.0003667925,0.00024926633,0.0013019447,0.0002785336,0.31445596,0.013960437,0.64660734,0.017234534,0.00023108596],"about_ca_topic_score_codex":0.00073500245,"about_ca_topic_score_gemma":0.0010419914,"teacher_disagreement_score":0.008461398,"about_ca_system_score_codex":0.0035354057,"about_ca_system_score_gemma":0.0010379935,"threshold_uncertainty_score":0.028306127},"labels":[],"label_agreement":null},{"id":"W4412617760","doi":"10.55016/ojs/cdm.v12i1.62559","title":"ON THE SPECTRUM OF OCTAGON QUADRANGLE SYSTEMS OF ANY INDEX","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadrangle; Mathematics; Index (typography); Spectrum (functional analysis); Combinatorics; Geography; Computer science; Archaeology; Physics","score_opus":0.031044708136879103,"score_gpt":0.33760125708704514,"score_spread":0.30655654895016604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617760","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.93978614,0.0005942262,0.02797253,0.00022124952,0.00004890876,0.00001758985,0.00019110006,0.00007065169,0.031097554],"genre_scores_gemma":[0.993672,0.0002601158,0.003809584,0.00004270502,0.000045659737,0.000029200277,0.00019079636,0.000032870383,0.0019171874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997603,0.000037871127,0.000010228984,0.000042981683,0.00007066842,0.0000778513],"domain_scores_gemma":[0.99939287,0.00022306919,0.00011713102,0.00005024888,0.00007878766,0.00013790316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022518865,0.00040633904,0.00046552846,0.001398053,0.0009439304,0.0010362956,0.000548127,0.00047082192,0.004234719],"category_scores_gemma":[0.0011462125,0.00021014782,0.00028372533,0.00055154425,0.0017038948,0.0013283469,0.00095860864,0.00055402616,0.000447434],"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.0001924516,0.00008815287,0.002733788,0.00010669194,0.000016320488,0.00041047786,0.0005817055,0.017847247,0.010084892,0.9525748,0.0022452353,0.01311816],"study_design_scores_gemma":[0.00004246981,0.000077362776,0.002201193,0.000059948088,0.000007991591,0.00030474825,0.000419751,0.093358964,0.0020014937,0.89882195,0.002676839,0.000027389988],"about_ca_topic_score_codex":0.00092690747,"about_ca_topic_score_gemma":0.0007511818,"teacher_disagreement_score":0.004234719,"about_ca_system_score_codex":0.0005159006,"about_ca_system_score_gemma":0.0003123894,"threshold_uncertainty_score":0.014166594},"labels":[],"label_agreement":null},{"id":"W4412617762","doi":"10.55016/ojs/cdm.v12i1.62176","title":"Geometric Algorithms for Minimal Enclosing Disks in Strictly Convex Normed Planes","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Regular polygon; Convex body; Convex analysis; Algorithm; Convex optimization; Geometry","score_opus":0.037614912779776764,"score_gpt":0.3450550316480724,"score_spread":0.30744011886829564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617762","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.00951099,0.00011483849,0.9892725,0.0000629697,0.000012999665,0.000023409531,0.000039588194,0.00023265475,0.0007300773],"genre_scores_gemma":[0.10910501,0.0002019638,0.88873285,0.000031089992,0.0000223579,0.0000791343,0.00026421453,0.00018050097,0.001382933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992624,0.00018469416,0.000061055835,0.00013206158,0.00030048608,0.000059179994],"domain_scores_gemma":[0.99830544,0.0009196885,0.0001497225,0.00027777973,0.0002750456,0.00007236739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009227857,0.00073621416,0.0010858751,0.0011246374,0.00050675427,0.0013514438,0.0021692717,0.00093060825,0.0026334366],"category_scores_gemma":[0.006260729,0.0005880267,0.00065056595,0.0010498326,0.0009926482,0.0021674116,0.00279965,0.0015819834,0.000752835],"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.00027540216,0.00009279245,0.0014628061,0.000337008,0.000050455765,0.00015810205,0.0005571241,0.4321337,0.01313121,0.23850702,0.0048657055,0.3084287],"study_design_scores_gemma":[0.00005458544,0.00004936766,0.00019567605,0.00002721333,0.000009574412,0.000096308926,0.000103153274,0.8951957,0.0051742396,0.094111025,0.0049650082,0.000018106113],"about_ca_topic_score_codex":0.0017753629,"about_ca_topic_score_gemma":0.002186474,"teacher_disagreement_score":0.0026334366,"about_ca_system_score_codex":0.0006089964,"about_ca_system_score_gemma":0.0005172355,"threshold_uncertainty_score":0.008809686},"labels":[],"label_agreement":null},{"id":"W4412617764","doi":"10.55016/ojs/cdm.v12i1.62318","title":"STAR SUPER EDGE MAGIC DEFICIENCY OF GRAPHS","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Star (game theory); MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Astrophysics; Artificial intelligence; Physics","score_opus":0.018467501203954205,"score_gpt":0.28791336142901,"score_spread":0.2694458602250558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617764","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.83575827,0.00071028125,0.12698108,0.00039611186,0.00007599112,0.00005860642,0.00095425046,0.0003109641,0.03475438],"genre_scores_gemma":[0.96751183,0.00029301987,0.027195053,0.00009735166,0.000048062582,0.00003992531,0.00086586736,0.000053802905,0.003895153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995478,0.000084666994,0.000028851831,0.000116971794,0.00014178824,0.00007997303],"domain_scores_gemma":[0.99888355,0.0003291859,0.00018312539,0.00013674852,0.00024146217,0.00022592748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003952608,0.00033988585,0.00038249584,0.0015877412,0.0004575311,0.0007570924,0.00037496645,0.00030790715,0.0030883527],"category_scores_gemma":[0.0019895288,0.00025239697,0.0002759129,0.00083929754,0.0007807204,0.0015141021,0.0007630537,0.0005051714,0.0003872767],"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.0009318258,0.000078071134,0.013278542,0.00035939136,0.000059333655,0.00066793483,0.0007911109,0.022725306,0.03171947,0.8236541,0.007289268,0.09844563],"study_design_scores_gemma":[0.00006832554,0.00026919745,0.008763111,0.00007216981,0.000052794112,0.0021838876,0.00046199953,0.11026747,0.0133812195,0.8317175,0.03270859,0.000053709642],"about_ca_topic_score_codex":0.0007740009,"about_ca_topic_score_gemma":0.0010041082,"teacher_disagreement_score":0.0030883527,"about_ca_system_score_codex":0.0006535651,"about_ca_system_score_gemma":0.00037797974,"threshold_uncertainty_score":0.010331571},"labels":[],"label_agreement":null},{"id":"W4412617786","doi":"10.55016/ojs/cdm.v12i1.62435","title":"Characterizations and algorithms for generalized Cops and Robbers games","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Combinatorics","score_opus":0.08899808708330083,"score_gpt":0.4303909892209791,"score_spread":0.3413929021376783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617786","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.027346438,0.00047753772,0.95847535,0.0005407625,0.00007338365,0.0003018158,0.00043679398,0.0005082306,0.01183963],"genre_scores_gemma":[0.27847964,0.0012406552,0.7023123,0.00048047057,0.00024312391,0.0010999838,0.0025323126,0.0006095748,0.013001919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968194,0.0007875869,0.00023142307,0.0007871,0.00076016586,0.00061432895],"domain_scores_gemma":[0.9959001,0.002283576,0.0004819034,0.00058917113,0.00045886906,0.0002864344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021032558,0.0022129063,0.0018204733,0.0021309492,0.0012540353,0.0054477607,0.0039791316,0.0020182875,0.007701938],"category_scores_gemma":[0.010148895,0.00095770997,0.0020227202,0.002810256,0.0024290993,0.010374838,0.003768282,0.0042864433,0.001571241],"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.000078679404,0.00010174611,0.0006202589,0.00025203067,0.000049517817,0.00007129627,0.000439136,0.063175924,0.0010075278,0.8849068,0.0048378147,0.04445919],"study_design_scores_gemma":[0.000040337225,0.000034357614,0.00018489515,0.00005281249,0.000023870949,0.00008171626,0.00013607505,0.18007146,0.0007133808,0.81147504,0.0071563423,0.00002963702],"about_ca_topic_score_codex":0.0036792587,"about_ca_topic_score_gemma":0.0038705675,"teacher_disagreement_score":0.007701938,"about_ca_system_score_codex":0.0032633566,"about_ca_system_score_gemma":0.0021280209,"threshold_uncertainty_score":0.025765538},"labels":[],"label_agreement":null},{"id":"W4412646948","doi":"10.55016/ojs/cdm.v3i1.62009","title":"A complete span of H(4,4) admitting PSL_2(11) and related structures","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Protein Tyrosine Phosphatases","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"PSL; Mathematics; Span (engineering); Combinatorics; Structural engineering; Engineering","score_opus":0.01198715237415992,"score_gpt":0.26939797153786854,"score_spread":0.2574108191637086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646948","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.858683,0.00026520243,0.09541228,0.00028250823,0.00010701493,0.000063239626,0.00053455745,0.00020831366,0.044443876],"genre_scores_gemma":[0.9679009,0.00012995742,0.01586828,0.00010495767,0.00008848197,0.000057569672,0.00068313937,0.000054395994,0.015112391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996929,0.00006844145,0.000014475304,0.000063284046,0.00007592188,0.00008499134],"domain_scores_gemma":[0.99968696,0.000052589938,0.000076627664,0.00003258521,0.0000476564,0.00010357119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002911368,0.0005414181,0.0003449969,0.0006668377,0.0006574227,0.000813601,0.00039031557,0.0004072191,0.0076628756],"category_scores_gemma":[0.00049174577,0.00018867328,0.0004359866,0.00035315903,0.00086033077,0.0010549683,0.0016635743,0.0007749537,0.0011557747],"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.00034381592,0.00011326714,0.0018092868,0.00017237346,0.000040358154,0.00085209514,0.0006638241,0.0069368756,0.02193615,0.92755234,0.0027215828,0.036858045],"study_design_scores_gemma":[0.00008043985,0.0006446217,0.0021730186,0.00003930523,0.000030253217,0.00075012055,0.00048534974,0.014598681,0.015686499,0.9410618,0.024388097,0.000061675026],"about_ca_topic_score_codex":0.00018507444,"about_ca_topic_score_gemma":0.00019020864,"teacher_disagreement_score":0.0076628756,"about_ca_system_score_codex":0.0002902909,"about_ca_system_score_gemma":0.0002421617,"threshold_uncertainty_score":0.025634825},"labels":[],"label_agreement":null},{"id":"W4412646950","doi":"10.55016/ojs/cdm.v3i1.61909","title":"Ferenc Kárteszi (1907--1989): A short biography","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Hungarian Social, Economic and Educational Studies","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Biography; Mathematics; Combinatorics; Genealogy; Art history; Art; History","score_opus":0.04511092601404286,"score_gpt":0.3473952961759649,"score_spread":0.302284370161922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646950","genre_codex":"review","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.009219565,0.7339027,0.0060674334,0.0799289,0.070324704,0.000052566724,0.00061336375,0.00007760151,0.09981323],"genre_scores_gemma":[0.25099358,0.43961838,0.0048667113,0.022722121,0.07768235,0.00014430552,0.0005675522,0.00028614653,0.20311873],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945754,0.00013685763,0.000046896363,0.00018076187,0.0001154001,0.0000624049],"domain_scores_gemma":[0.9995753,0.00021282335,0.00005173472,0.000017418864,0.0000919688,0.00005075533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012103313,0.0012229419,0.0007790219,0.0032395998,0.0017576974,0.0018580873,0.00055258954,0.0020812596,0.0051000165],"category_scores_gemma":[0.0018940946,0.00034546325,0.0003568111,0.0023587055,0.0035113967,0.0029459877,0.0019842405,0.0029260155,0.0033253771],"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.0002132483,0.0000974265,0.0014758324,0.0012631556,0.000056032444,0.0006099528,0.0031347596,0.00064552913,0.0009185018,0.3115586,0.49071333,0.18931362],"study_design_scores_gemma":[0.000007977144,0.000029724402,0.0011802372,0.00036140837,0.000013316897,0.0002664487,0.0001149732,0.00007141749,0.00040546383,0.013427495,0.9841039,0.000017677692],"about_ca_topic_score_codex":0.002576761,"about_ca_topic_score_gemma":0.0022507214,"teacher_disagreement_score":0.0051000165,"about_ca_system_score_codex":0.0034534382,"about_ca_system_score_gemma":0.0010722409,"threshold_uncertainty_score":0.025056541},"labels":[],"label_agreement":null},{"id":"W4412646968","doi":"10.55016/ojs/cdm.v3i1.62768","title":"Preface","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024257837233508203,"score_gpt":0.30859356618418876,"score_spread":0.28433572895068054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646968","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013892681,0.016522512,0.018028777,0.045149196,0.29484802,0.0002251924,0.0039050183,0.0010046866,0.61892736],"genre_scores_gemma":[0.009836854,0.006903204,0.004613619,0.0059009898,0.053499524,0.0001249645,0.0024842033,0.00066947244,0.91596717],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992755,0.00013239912,0.000035112836,0.00013504202,0.00036338842,0.00005843225],"domain_scores_gemma":[0.9969222,0.0005331767,0.000101710044,0.00035503626,0.0015880575,0.0004997795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001306239,0.0010482611,0.0006873672,0.003175062,0.002625109,0.0030262535,0.0012190818,0.001105197,0.23991454],"category_scores_gemma":[0.006908848,0.00026867207,0.0006003881,0.0019721903,0.0009221833,0.0027410528,0.0019282538,0.0035486713,0.15028943],"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.000022357357,0.000021892878,0.000080848025,0.00008883493,0.0000034529598,0.000031674583,0.00006287318,0.00009968405,0.00015824595,0.032056134,0.9265968,0.040777177],"study_design_scores_gemma":[0.0000042469032,0.000009976556,0.00017943684,0.00007425519,0.0000029850535,0.000041834046,0.00004856478,0.0000713181,0.0001348277,0.01851099,0.98091596,0.0000055231603],"about_ca_topic_score_codex":0.0019205824,"about_ca_topic_score_gemma":0.0027635072,"teacher_disagreement_score":0.23991454,"about_ca_system_score_codex":0.0021442713,"about_ca_system_score_gemma":0.0015139523,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4412646976","doi":"10.55016/ojs/cdm.v3i1.61981","title":"Partitioning the flags of PG(2,q) into strong representative systems","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"FLAGS register; Mathematics; Combinatorics; Computer science","score_opus":0.014457357920457273,"score_gpt":0.26399478753059696,"score_spread":0.2495374296101397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646976","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.7554786,0.00035032988,0.21862765,0.00030363855,0.00014065002,0.00009729887,0.00017632367,0.0002917757,0.024533657],"genre_scores_gemma":[0.9470144,0.00018971405,0.041893415,0.00016404063,0.000062109495,0.00005803442,0.0002846449,0.00008939375,0.010244369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976474,0.00004648228,0.000010570111,0.000051503583,0.000037300444,0.00008939305],"domain_scores_gemma":[0.999561,0.00011960302,0.000062235726,0.00010423517,0.000062320534,0.00009064879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030301503,0.00023655653,0.0002681352,0.0006376244,0.0010644387,0.0008117549,0.00038066562,0.00024176699,0.005288609],"category_scores_gemma":[0.0007765409,0.00019470227,0.00029090207,0.00053634285,0.0010871093,0.0013957681,0.0013364523,0.00068086275,0.00066795683],"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.0002107634,0.000060009912,0.0030274498,0.0001368849,0.000014665978,0.00027632213,0.0011055606,0.005008778,0.02223289,0.91262627,0.0025373315,0.05276294],"study_design_scores_gemma":[0.00008502946,0.00036045915,0.0038803432,0.000051322455,0.000037516562,0.00049361476,0.0009559445,0.030708954,0.020224808,0.9035067,0.039640386,0.00005484927],"about_ca_topic_score_codex":0.0006309334,"about_ca_topic_score_gemma":0.0010462501,"teacher_disagreement_score":0.005288609,"about_ca_system_score_codex":0.0004420657,"about_ca_system_score_gemma":0.0003521209,"threshold_uncertainty_score":0.017692149},"labels":[],"label_agreement":null},{"id":"W4412646978","doi":"10.55016/ojs/cdm.v3i1.61998","title":"On geometric constructions of (k, g)-graphs","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics","score_opus":0.015445024210330022,"score_gpt":0.25903407828659775,"score_spread":0.2435890540762677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646978","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.17883664,0.0021243652,0.710568,0.0022493687,0.0006732688,0.00016812957,0.0006206511,0.0018065206,0.10295304],"genre_scores_gemma":[0.59074074,0.0023871302,0.3864472,0.0009172954,0.0002565483,0.00029774854,0.0007142242,0.0007568781,0.01748223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999231,0.00023918442,0.000049364095,0.00017998868,0.00014942419,0.00015115313],"domain_scores_gemma":[0.99914277,0.00028668248,0.00013904939,0.00020260896,0.00008451082,0.00014433774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005711047,0.0012403523,0.0006123526,0.0014859636,0.001939674,0.0021524695,0.0014381572,0.0011620685,0.0057833437],"category_scores_gemma":[0.0019044228,0.00087271,0.0010241537,0.0019153312,0.0034185478,0.0042403243,0.004070151,0.0026663481,0.0017230199],"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.00005102962,0.00002803327,0.00038337312,0.00011443372,0.000012018994,0.00021404758,0.00046992023,0.0049241534,0.0033902505,0.96968085,0.003421066,0.017310753],"study_design_scores_gemma":[0.000033212265,0.00005938953,0.00039707762,0.0000652644,0.000027556369,0.0005195188,0.0003274015,0.008069657,0.0039454084,0.9526848,0.033821136,0.000049658778],"about_ca_topic_score_codex":0.00045080477,"about_ca_topic_score_gemma":0.0007559958,"teacher_disagreement_score":0.0057833437,"about_ca_system_score_codex":0.0010598515,"about_ca_system_score_gemma":0.0003318685,"threshold_uncertainty_score":0.01934725},"labels":[],"label_agreement":null},{"id":"W4412646979","doi":"10.55016/ojs/cdm.v3i1.61962","title":"Two character sets in finite linear spaces","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Character (mathematics); Combinatorics; Geometry","score_opus":0.013650253567308255,"score_gpt":0.259812493195392,"score_spread":0.24616223962808376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646979","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.8588292,0.0005351091,0.101747714,0.00045378337,0.00009693146,0.000043378303,0.00033116492,0.00013435261,0.037828315],"genre_scores_gemma":[0.98337656,0.00008926384,0.010201195,0.000041751588,0.000042237854,0.000040248295,0.00018115163,0.000012803617,0.0060147746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987495,0.0003544056,0.00008950409,0.0002827665,0.00031181774,0.00021199553],"domain_scores_gemma":[0.997945,0.0008424461,0.0003371335,0.00022899307,0.0002731282,0.000373286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057903,0.00036542345,0.00038247323,0.002145007,0.0014118099,0.0041155075,0.00072426646,0.0009745641,0.0039580194],"category_scores_gemma":[0.0028962812,0.00038470043,0.00041955008,0.0014358766,0.0026704662,0.0046695084,0.0020321868,0.001101969,0.0004214594],"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.00011818392,0.00002945564,0.0015908837,0.00004106331,0.00000926126,0.00026168412,0.0009954908,0.0015155642,0.0030171839,0.98331016,0.0004234509,0.008687638],"study_design_scores_gemma":[0.00004766196,0.00014408736,0.003022076,0.00007779092,0.000025861022,0.0013050303,0.0020272587,0.023849122,0.008912979,0.94828564,0.012229678,0.00007275917],"about_ca_topic_score_codex":0.0003792611,"about_ca_topic_score_gemma":0.0002709006,"teacher_disagreement_score":0.0041155075,"about_ca_system_score_codex":0.0015532315,"about_ca_system_score_gemma":0.00027228595,"threshold_uncertainty_score":0.013240874},"labels":[],"label_agreement":null},{"id":"W4412646989","doi":"10.55016/ojs/cdm.v3i1.61923","title":"Construction of a 3-dimensional MDS-code","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Code (set theory); Computer science; Programming language; Set (abstract data type)","score_opus":0.017860019110940803,"score_gpt":0.2702157163423182,"score_spread":0.2523556972313774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646989","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.26276118,0.00022634098,0.71383405,0.00038561242,0.00023036622,0.0003054824,0.0008217412,0.001170102,0.020265112],"genre_scores_gemma":[0.5081829,0.00021925072,0.48110723,0.00014640333,0.000034250887,0.00023014625,0.0006632072,0.00015706455,0.009259547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997913,0.00003374136,0.000014007688,0.000028476983,0.0000979928,0.000034496872],"domain_scores_gemma":[0.99972874,0.000049617698,0.000033433353,0.00006247633,0.000070394584,0.00005520983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018463768,0.0003823003,0.00040827208,0.00062907115,0.0006718881,0.00040665912,0.00038067467,0.0003463094,0.0033931276],"category_scores_gemma":[0.00050876476,0.00020637052,0.00049828767,0.00044712576,0.0005041713,0.0003112959,0.0011698595,0.0006227701,0.0013307331],"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.0004606404,0.00017908732,0.0029376117,0.0004990612,0.00008184216,0.0018741253,0.0011482895,0.048253573,0.3064473,0.46873882,0.006269385,0.16311033],"study_design_scores_gemma":[0.00017994504,0.0006772444,0.0024592793,0.00014053225,0.00009823297,0.0031814543,0.0003669384,0.26028827,0.4761876,0.17628342,0.07987955,0.00025763793],"about_ca_topic_score_codex":0.0004744346,"about_ca_topic_score_gemma":0.00066703884,"teacher_disagreement_score":0.0033931276,"about_ca_system_score_codex":0.00027312394,"about_ca_system_score_gemma":0.00086798804,"threshold_uncertainty_score":0.011351109},"labels":[],"label_agreement":null},{"id":"W4412647229","doi":"10.55016/ojs/cdm.v3i1.61931","title":"S-spaces from free extensions","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03553366560848419,"score_gpt":0.3356668870261026,"score_spread":0.3001332214176184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647229","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.6184746,0.0019263237,0.25294137,0.0007564751,0.00031487498,0.000087002554,0.0005742494,0.0003411548,0.12458391],"genre_scores_gemma":[0.94041973,0.0005986608,0.039018955,0.00021512625,0.00015027488,0.00007178734,0.00060618273,0.000081624385,0.018837698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935323,0.00011499521,0.000055603912,0.00017072092,0.00018240362,0.00012301952],"domain_scores_gemma":[0.9988423,0.00044267927,0.00016603268,0.00017958526,0.000140222,0.00022921097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063501205,0.00084404665,0.0005434844,0.0012869531,0.0013095664,0.002065372,0.0005803096,0.0005603515,0.007584114],"category_scores_gemma":[0.0015021261,0.0003559415,0.0012077463,0.0007647007,0.0030254826,0.005043655,0.0036934866,0.0018943613,0.0009011114],"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.00003962382,0.000015772197,0.00027305415,0.000050744347,0.000013727674,0.00013416752,0.00021389387,0.0010343423,0.001486802,0.9912369,0.0004933781,0.0050077597],"study_design_scores_gemma":[0.00002349308,0.000053683092,0.00030083905,0.000024288765,0.000015686102,0.00030598367,0.00017116642,0.0032233917,0.0028665038,0.9826292,0.010370904,0.0000149834095],"about_ca_topic_score_codex":0.00027294457,"about_ca_topic_score_gemma":0.00029259687,"teacher_disagreement_score":0.007584114,"about_ca_system_score_codex":0.0006371323,"about_ca_system_score_gemma":0.00031692753,"threshold_uncertainty_score":0.025371432},"labels":[],"label_agreement":null},{"id":"W4412647240","doi":"10.55016/ojs/cdm.v3i1.61969","title":"The transitive and co-transitive blocking sets in P^2(F_q)","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transitive relation; Mathematics; Combinatorics; Blocking (statistics); Transitive reduction; Transitive closure; Graph; Statistics; Line graph; Voltage graph","score_opus":0.012679004613922034,"score_gpt":0.27959254246855,"score_spread":0.26691353785462796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647240","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.79157543,0.0008013412,0.09980384,0.00061965385,0.00007971182,0.00011776993,0.001188383,0.00029031985,0.1055236],"genre_scores_gemma":[0.9658284,0.00034694144,0.018750817,0.000078115634,0.000049144062,0.0001050305,0.0010182182,0.00006346427,0.01375983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947315,0.000056703244,0.000027457658,0.00009252513,0.00013517917,0.00021506049],"domain_scores_gemma":[0.99910223,0.00032321733,0.0002126851,0.00012192343,0.00011444519,0.0001254678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004586735,0.0005980073,0.0005273668,0.001617469,0.0017529349,0.0028862515,0.000941306,0.00071188103,0.0055723633],"category_scores_gemma":[0.0012162258,0.00036710384,0.0005847594,0.0012501505,0.0018159904,0.0027540212,0.00096616865,0.0010484298,0.000940619],"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.00014644797,0.000038437596,0.0013704401,0.000054857213,0.000014370918,0.000096011965,0.00035951546,0.0021824085,0.003884686,0.9821529,0.0012162088,0.008483748],"study_design_scores_gemma":[0.00005414455,0.000075803844,0.002628813,0.000055330634,0.00004526847,0.00052301754,0.00053245167,0.01423511,0.0103837205,0.9484722,0.02295168,0.000042444673],"about_ca_topic_score_codex":0.003537449,"about_ca_topic_score_gemma":0.0025060927,"teacher_disagreement_score":0.0055723633,"about_ca_system_score_codex":0.0013441215,"about_ca_system_score_gemma":0.0008270977,"threshold_uncertainty_score":0.018641353},"labels":[],"label_agreement":null},{"id":"W4412647247","doi":"10.55016/ojs/cdm.v3i1.61979","title":"Constructions of small complete arcs with prescribed symmetry","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis of Composite Materials","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Symmetry (geometry); Combinatorics; Geometry","score_opus":0.014914058187692716,"score_gpt":0.22686346774370159,"score_spread":0.21194940955600888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647247","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.48203066,0.00024736268,0.46549377,0.00020990535,0.00008724293,0.00023422085,0.00048233938,0.0007374062,0.05047715],"genre_scores_gemma":[0.8385896,0.00020676934,0.14742951,0.000049245784,0.000024309804,0.00020816618,0.0005386339,0.00026246527,0.01269129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978393,0.000042095093,0.0000110726505,0.000045680285,0.000075720534,0.00004157639],"domain_scores_gemma":[0.99945575,0.00017461146,0.00007146248,0.00014376095,0.00006043037,0.00009400825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025000912,0.0003936964,0.00038457717,0.0005577052,0.0008106407,0.0006209269,0.0005234845,0.0003039058,0.004812102],"category_scores_gemma":[0.0011459155,0.00030422062,0.0005069026,0.00040071554,0.0008508417,0.0007240539,0.0015016219,0.0010691376,0.0006008183],"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.00018440034,0.000046530517,0.0014842816,0.00013358178,0.000021943539,0.00036695268,0.00045831743,0.012996345,0.031421546,0.9111242,0.0013739842,0.040387996],"study_design_scores_gemma":[0.00021098854,0.00043526263,0.004227936,0.00008150577,0.00008375257,0.0010698248,0.0006434937,0.0830336,0.12009863,0.70947164,0.08056639,0.00007711044],"about_ca_topic_score_codex":0.00038966013,"about_ca_topic_score_gemma":0.0007593474,"teacher_disagreement_score":0.004812102,"about_ca_system_score_codex":0.0005051382,"about_ca_system_score_gemma":0.00040844825,"threshold_uncertainty_score":0.016098022},"labels":[],"label_agreement":null},{"id":"W4412647289","doi":"10.55016/ojs/cdm.v3i1.62767","title":"Affinely regular polygons in an affine plane","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hungarian Scientific Research Fund; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Combinatorics; Affine transformation; Affine plane (incidence geometry); Plane (geometry); Regular polygon; Geometry","score_opus":0.0456000522991196,"score_gpt":0.3440949486395253,"score_spread":0.29849489634040566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647289","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.3636231,0.013499061,0.41960412,0.0006806888,0.00026026057,0.00009454994,0.00082685787,0.00043924982,0.20097205],"genre_scores_gemma":[0.8699,0.011996343,0.09604349,0.00015697443,0.00038765647,0.000050529634,0.0010292039,0.000104332044,0.020331558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994947,0.00007551936,0.000038593964,0.00012771397,0.0001969519,0.000066513036],"domain_scores_gemma":[0.9994012,0.00016689034,0.00018492712,0.00008847821,0.00010696822,0.000051589985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002785218,0.0004905861,0.00038263135,0.0015409251,0.000713846,0.0020221495,0.00047711036,0.00031567938,0.003134891],"category_scores_gemma":[0.0010463638,0.00029072823,0.00033490668,0.0018592408,0.0018352021,0.0031711208,0.00082208554,0.000935844,0.000815673],"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.000031492902,0.000016062253,0.00064543885,0.00011262458,0.0000080323025,0.00019201657,0.00020565273,0.008274115,0.0022096934,0.9561809,0.0011371013,0.030986808],"study_design_scores_gemma":[0.000016048736,0.00013402426,0.0025210262,0.000089504814,0.0000320432,0.001452231,0.00065520196,0.031089231,0.0076693813,0.854677,0.101617865,0.000046358557],"about_ca_topic_score_codex":0.0011719838,"about_ca_topic_score_gemma":0.00078188744,"teacher_disagreement_score":0.003134891,"about_ca_system_score_codex":0.00070642884,"about_ca_system_score_gemma":0.00026575403,"threshold_uncertainty_score":0.010487199},"labels":[],"label_agreement":null},{"id":"W4412647334","doi":"10.55016/ojs/cdm.v3i1.61983","title":"Configurations graphs of neighbourhood geometries","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Neighbourhood (mathematics); Mathematics; Combinatorics; Mathematical analysis","score_opus":0.016637047107502866,"score_gpt":0.2746005900086304,"score_spread":0.25796354290112755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647334","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.9285233,0.00033065907,0.022072634,0.00013792008,0.000072438525,0.00004761584,0.00035006757,0.0002795604,0.048185896],"genre_scores_gemma":[0.9913509,0.000097645694,0.0039562914,0.00003529249,0.000027591841,0.000024501918,0.00027650018,0.00004793525,0.00418339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995315,0.00007894383,0.000023462568,0.00014230829,0.00012788175,0.000095945295],"domain_scores_gemma":[0.99917185,0.00016115104,0.00021239142,0.0001387506,0.00012834759,0.00018746211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015710155,0.00043142829,0.0003902912,0.0015296581,0.0012459138,0.0012837658,0.00065035396,0.0007846585,0.007450657],"category_scores_gemma":[0.0012834816,0.00036765385,0.00046295475,0.00083281315,0.0022458846,0.0015044886,0.0012631887,0.0006459309,0.0006428512],"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.00018518064,0.00003324155,0.0063151293,0.00012289765,0.000032929653,0.0011564523,0.00082856975,0.009438031,0.012190661,0.9457364,0.0027304979,0.021229949],"study_design_scores_gemma":[0.000045435056,0.00011893188,0.0114036305,0.000055129625,0.000040282568,0.0032109222,0.00093640183,0.02041272,0.008318434,0.9435982,0.011786369,0.00007358834],"about_ca_topic_score_codex":0.0009421437,"about_ca_topic_score_gemma":0.0009105631,"teacher_disagreement_score":0.007450657,"about_ca_system_score_codex":0.00053713965,"about_ca_system_score_gemma":0.00020791125,"threshold_uncertainty_score":0.024924994},"labels":[],"label_agreement":null},{"id":"W4412647336","doi":"10.55016/ojs/cdm.v3i1.61964","title":"A survey on semiovals","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.05444497815643056,"score_gpt":0.34578845631010996,"score_spread":0.2913434781536794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647336","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037997082,0.45278,0.18866578,0.0068770745,0.0031256343,0.00013390985,0.0011608833,0.00066441897,0.30859527],"genre_scores_gemma":[0.3098509,0.5099524,0.09520455,0.0029355779,0.0075304755,0.00027418247,0.0032702284,0.000770989,0.070210755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862874,0.00030289157,0.00014777898,0.00034812774,0.00042419214,0.00014842163],"domain_scores_gemma":[0.9982796,0.0009009229,0.00015662571,0.0002295551,0.00030091166,0.000132382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012037313,0.0010719085,0.0016967971,0.00504533,0.002519765,0.005082653,0.001777239,0.0020109324,0.010349933],"category_scores_gemma":[0.0034423545,0.0011268224,0.0010515668,0.009313544,0.0035364307,0.013012551,0.0032628342,0.0029851156,0.004283615],"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.000032980104,0.00004798971,0.0006297246,0.0010795179,0.000018422452,0.00014311117,0.000301155,0.002125942,0.0003822789,0.86895174,0.015101778,0.111185364],"study_design_scores_gemma":[0.000009627793,0.000045827885,0.0004912254,0.0007209736,0.000019587049,0.0012573295,0.00024602492,0.0032925778,0.0006106127,0.6978044,0.29546502,0.00003691527],"about_ca_topic_score_codex":0.0014181662,"about_ca_topic_score_gemma":0.0010128017,"teacher_disagreement_score":0.010349933,"about_ca_system_score_codex":0.0020814845,"about_ca_system_score_gemma":0.0010706332,"threshold_uncertainty_score":0.03462398},"labels":[],"label_agreement":null},{"id":"W4412647363","doi":"10.55016/ojs/cdm.v3i1.61999","title":"Arcs in Desarguesian nets","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics","score_opus":0.030685607786433755,"score_gpt":0.32472518810292195,"score_spread":0.2940395803164882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647363","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.3992159,0.0017752753,0.50859225,0.00083529344,0.00014078361,0.00011683666,0.0005298161,0.0012922593,0.08750161],"genre_scores_gemma":[0.90406346,0.00079578895,0.0778382,0.00011209234,0.00008754204,0.00007839222,0.0002978529,0.00017274938,0.01655402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991615,0.0001772109,0.00009066684,0.0002194164,0.00021808564,0.00013320785],"domain_scores_gemma":[0.9977714,0.001404705,0.00028194484,0.00019247661,0.00017665142,0.0001729603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093385734,0.00042102992,0.0003379812,0.0012138122,0.0009842991,0.0016945396,0.000595067,0.00048351663,0.005024815],"category_scores_gemma":[0.0023068322,0.0004784024,0.0005276298,0.0010289111,0.002582826,0.004412836,0.0018270296,0.0011568629,0.00064326247],"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.00018978129,0.00001898232,0.0009237421,0.0001175751,0.000009171051,0.00026901532,0.0006971767,0.012237968,0.004065353,0.9648628,0.00045277763,0.016155621],"study_design_scores_gemma":[0.000025262183,0.00004047768,0.00045874616,0.000034760757,0.000018362947,0.00017719339,0.00024976573,0.025727194,0.0075033484,0.94192374,0.023820352,0.000020848787],"about_ca_topic_score_codex":0.002022777,"about_ca_topic_score_gemma":0.0022247646,"teacher_disagreement_score":0.005024815,"about_ca_system_score_codex":0.0013639287,"about_ca_system_score_gemma":0.000416821,"threshold_uncertainty_score":0.016809702},"labels":[],"label_agreement":null},{"id":"W4412647388","doi":"10.55016/ojs/cdm.v2i2.61984","title":"The cop density of a graph","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Mitacs; McGill University","keywords":"Combinatorics; Mathematics; Graph","score_opus":0.019359780623625485,"score_gpt":0.33642489472371545,"score_spread":0.31706511410009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647388","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.63084805,0.00067205855,0.32644898,0.0021795076,0.000077532815,0.000087904045,0.0002914511,0.00029515324,0.039099332],"genre_scores_gemma":[0.98975897,0.0002204916,0.0071864375,0.00012026533,0.00004881141,0.0000561146,0.00007803174,0.000044362794,0.0024865158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895144,0.00037704373,0.000027263797,0.00023579791,0.00020514299,0.00020322633],"domain_scores_gemma":[0.9942543,0.0036990535,0.0006263716,0.00036877696,0.00039086767,0.0006605879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452868,0.00053561333,0.00088542013,0.0017352204,0.0011946799,0.001935985,0.0013041451,0.0010813412,0.003751712],"category_scores_gemma":[0.011860953,0.00047247438,0.00047237577,0.00076603174,0.0043730903,0.003088457,0.0017169662,0.0014502088,0.000317533],"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.000052674623,0.000029898307,0.001272837,0.000048226946,0.000025746242,0.0002740915,0.0003460791,0.022912737,0.0012896351,0.96864074,0.0010525213,0.0040547037],"study_design_scores_gemma":[0.000022690661,0.000055275745,0.0011417025,0.000033070995,0.00002535537,0.0003058942,0.00021777954,0.30368757,0.00088525494,0.6910939,0.0024969846,0.000034463246],"about_ca_topic_score_codex":0.0038121936,"about_ca_topic_score_gemma":0.0015331608,"teacher_disagreement_score":0.0038121936,"about_ca_system_score_codex":0.0019457993,"about_ca_system_score_gemma":0.0005501277,"threshold_uncertainty_score":0.014117777},"labels":[],"label_agreement":null},{"id":"W4412647406","doi":"10.55016/ojs/cdm.v2i2.61953","title":"Pseudopowers and primality proving","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Österreichischen Akademie der Wissenschaften","keywords":"Primality test; Mathematics; Combinatorics; Prime (order theory)","score_opus":0.03265548630649473,"score_gpt":0.38848742701440175,"score_spread":0.355831940707907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647406","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.1314462,0.004687302,0.75012684,0.007868221,0.00091015274,0.00017562813,0.00038460968,0.0018141507,0.102586895],"genre_scores_gemma":[0.7792983,0.0025604516,0.19936997,0.0013979537,0.0013015073,0.00013586794,0.00043994182,0.00049996923,0.014995991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99553514,0.0017411826,0.00022523478,0.0006792064,0.0012802802,0.00053898693],"domain_scores_gemma":[0.9841155,0.010875839,0.00073786126,0.0026461806,0.0011674532,0.00045720526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048858486,0.0007272932,0.0009699973,0.001544194,0.0018352887,0.00347931,0.0016205867,0.0008999072,0.008582101],"category_scores_gemma":[0.018363679,0.0007950705,0.0014617954,0.0017238256,0.00634651,0.009429063,0.00547589,0.004404805,0.0022655732],"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.00007870125,0.000041060444,0.0007750098,0.00015593879,0.000014095347,0.00011907393,0.00032354158,0.0021848995,0.0015814196,0.9552816,0.0025836888,0.03686078],"study_design_scores_gemma":[0.000027139604,0.0000548095,0.00020849169,0.000048259182,0.000013631614,0.00022618526,0.000085081396,0.010720817,0.0034006152,0.97174555,0.013445584,0.000023797751],"about_ca_topic_score_codex":0.0007840968,"about_ca_topic_score_gemma":0.0005570217,"teacher_disagreement_score":0.008582101,"about_ca_system_score_codex":0.0018068161,"about_ca_system_score_gemma":0.0016122313,"threshold_uncertainty_score":0.028710008},"labels":[],"label_agreement":null},{"id":"W4412647423","doi":"10.55016/ojs/cdm.v2i2.61935","title":"Martin's axiom and almost disjoint families","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mathematics; Axiom of choice; Combinatorics; Zermelo–Fraenkel set theory; Axiom; Urelement; Discrete mathematics; Genealogy; Set (abstract data type); Set theory; Computer science","score_opus":0.017104014079290825,"score_gpt":0.3459929088778381,"score_spread":0.3288888947985473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647423","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.2057788,0.003538924,0.4411994,0.01038056,0.00059307413,0.00010202608,0.0011831673,0.00056639523,0.33665758],"genre_scores_gemma":[0.8623915,0.0014910721,0.08927309,0.0024051024,0.0004276157,0.00029389595,0.0009533234,0.00015381398,0.04261062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972583,0.0007425698,0.00016160552,0.0006322787,0.00081218634,0.00039301594],"domain_scores_gemma":[0.9961881,0.0019462873,0.00030393823,0.0005266618,0.00061557826,0.00041945637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030737927,0.00058268616,0.000984973,0.0014943058,0.0032635087,0.0019435864,0.0014894734,0.0014603414,0.0073596775],"category_scores_gemma":[0.004961788,0.0007939769,0.0019253936,0.0010882921,0.0046949997,0.0074086995,0.0050764643,0.0034672834,0.00077315717],"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.000009482954,0.000004181066,0.000096748176,0.000016744785,0.0000061959495,0.000029743282,0.00009316212,0.00017088235,0.00023198368,0.99736434,0.000646652,0.0013298917],"study_design_scores_gemma":[0.0000208685,0.000020143882,0.00047569696,0.000028376611,0.000013465766,0.00022561249,0.00013908971,0.0026740776,0.00051611895,0.9801073,0.015760921,0.000018383556],"about_ca_topic_score_codex":0.0020417948,"about_ca_topic_score_gemma":0.0025402785,"teacher_disagreement_score":0.0073596775,"about_ca_system_score_codex":0.0022604656,"about_ca_system_score_gemma":0.0010694936,"threshold_uncertainty_score":0.024620593},"labels":[],"label_agreement":null},{"id":"W4412647470","doi":"10.55016/ojs/cdm.v2i2.62766","title":"Bounds on the f-vectors of tight spans","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics","score_opus":0.008045191233884797,"score_gpt":0.27843182950585554,"score_spread":0.27038663827197074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647470","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.3407918,0.0044014077,0.57534724,0.0015298867,0.00032459485,0.0001080209,0.0016543943,0.000705313,0.075137444],"genre_scores_gemma":[0.923992,0.0033419016,0.054487105,0.00033595503,0.0005418943,0.00025217168,0.0017174629,0.00040077278,0.01493073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764025,0.00033662998,0.00013816085,0.00046426593,0.00076996686,0.0006506814],"domain_scores_gemma":[0.99130356,0.0041622804,0.00085126876,0.00077006273,0.0014038489,0.0015089033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022622494,0.0019525496,0.001097446,0.0051572444,0.001492084,0.003923947,0.0018147781,0.001154528,0.011971877],"category_scores_gemma":[0.018627075,0.0007754823,0.00072465383,0.00229715,0.0033340713,0.008321235,0.0052969255,0.0037646643,0.0018413004],"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.00028202625,0.00007231775,0.0028081918,0.00018607086,0.000036189773,0.00017171986,0.0003582839,0.01602447,0.0037556763,0.91673684,0.003345644,0.056222588],"study_design_scores_gemma":[0.000021824717,0.00019073465,0.0021348,0.00013689829,0.000035153524,0.00036932548,0.00030541548,0.05627173,0.004533522,0.9264381,0.00949114,0.00007142352],"about_ca_topic_score_codex":0.0010642111,"about_ca_topic_score_gemma":0.00083532784,"teacher_disagreement_score":0.011971877,"about_ca_system_score_codex":0.0015322361,"about_ca_system_score_gemma":0.0005352104,"threshold_uncertainty_score":0.04004997},"labels":[],"label_agreement":null},{"id":"W4412647483","doi":"10.55016/ojs/cdm.v2i2.61973","title":"Priestley duality for some algebras with a negation operator","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Negation; Mathematics; Duality (order theory); Operator (biology); Algebra over a field; Combinatorics; Pure mathematics; Linguistics; Chemistry; Philosophy","score_opus":0.014864322971557814,"score_gpt":0.3054678893635603,"score_spread":0.29060356639200247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647483","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.14797127,0.006461626,0.6452243,0.0043192236,0.0012527413,0.0001000675,0.00033050333,0.00028864422,0.19405167],"genre_scores_gemma":[0.8310622,0.0022176825,0.13633002,0.0018368039,0.00084626884,0.00020196012,0.0002976792,0.00010653335,0.027100934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986883,0.0005028289,0.0000859557,0.00023351659,0.000359781,0.00012961036],"domain_scores_gemma":[0.9993266,0.00021127654,0.000070131246,0.00007743523,0.00021474021,0.00009975962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018612738,0.00043331226,0.00061106915,0.0011411607,0.0019142048,0.003163581,0.00058346696,0.00092964625,0.0027173157],"category_scores_gemma":[0.0018671572,0.00034649385,0.0011383427,0.0010837241,0.003058987,0.006005121,0.0019482602,0.0028255724,0.0007191289],"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.000008300794,0.000006414338,0.000042292264,0.0000104639375,0.0000029128662,0.000032398475,0.0000977438,0.000114829265,0.00035328337,0.9974316,0.00027935609,0.0016204005],"study_design_scores_gemma":[0.000006058937,0.000016854587,0.00004875827,0.000007828981,0.0000034602417,0.00009699173,0.000045319077,0.0015277528,0.000736896,0.990366,0.0071350383,0.00000897842],"about_ca_topic_score_codex":0.00034714554,"about_ca_topic_score_gemma":0.0003048498,"teacher_disagreement_score":0.003163581,"about_ca_system_score_codex":0.0010684116,"about_ca_system_score_gemma":0.00066198694,"threshold_uncertainty_score":0.009843469},"labels":[],"label_agreement":null},{"id":"W4412647485","doi":"10.55016/ojs/cdm.v2i2.61971","title":"On the oriented chromatic number of dense graphs","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Ministerio de Economía y Competitividad; European Commission","keywords":"Mathematics; Combinatorics; Chromatic scale; Discrete mathematics","score_opus":0.01102268038947433,"score_gpt":0.28220492781912215,"score_spread":0.2711822474296478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647485","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.7007432,0.0023909505,0.22408186,0.0015066598,0.00013646325,0.000094393,0.00075001374,0.00040281334,0.069893695],"genre_scores_gemma":[0.9495281,0.0013853449,0.042282715,0.00026723894,0.0001726662,0.00011129748,0.00055059296,0.00013946963,0.0055625956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992539,0.00016422718,0.00002750756,0.00017119109,0.0001772858,0.00020590024],"domain_scores_gemma":[0.99395084,0.004182857,0.0006376982,0.00045679495,0.00034786592,0.0004239964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010458945,0.00064534653,0.0005133198,0.0024309037,0.0011882444,0.001894173,0.0011694222,0.0006184239,0.0047607184],"category_scores_gemma":[0.007026196,0.0004648706,0.0003463325,0.002401803,0.0032950318,0.0033283352,0.0016220432,0.0011316335,0.00048157375],"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.00063299685,0.00016032354,0.011609188,0.00031690465,0.00006162313,0.00020881358,0.00069373904,0.12439961,0.017399702,0.7761168,0.008312204,0.060088005],"study_design_scores_gemma":[0.0000910555,0.00014664582,0.007076054,0.0001345885,0.000054483946,0.0004157412,0.00040466004,0.2293267,0.009279706,0.7395225,0.013466542,0.00008135359],"about_ca_topic_score_codex":0.0037766441,"about_ca_topic_score_gemma":0.0038326604,"teacher_disagreement_score":0.0047607184,"about_ca_system_score_codex":0.0025100757,"about_ca_system_score_gemma":0.0007026343,"threshold_uncertainty_score":0.018211901},"labels":[],"label_agreement":null},{"id":"W4412647490","doi":"10.55016/ojs/cdm.v2i2.61978","title":"Class number approximation in cubic function fields","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical and Theoretical Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Class (philosophy); Combinatorics; Function (biology); Computer science; Biology; Evolutionary biology","score_opus":0.01691004093064994,"score_gpt":0.323083853522819,"score_spread":0.306173812592169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647490","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.18391025,0.00082854007,0.7376628,0.0010333146,0.0004068152,0.0000634058,0.0001996369,0.00068205764,0.075213216],"genre_scores_gemma":[0.88874215,0.00077045796,0.09362682,0.00014921233,0.0002904722,0.000065986074,0.00025090371,0.00040572375,0.015698146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939096,0.00011605945,0.000023674851,0.0000613462,0.0002947756,0.000113184266],"domain_scores_gemma":[0.9978815,0.0010411259,0.0001851269,0.0003748922,0.0003279549,0.0001894074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014372864,0.0007734416,0.0006901691,0.0021014311,0.00082797813,0.0017855656,0.0014709661,0.0006499534,0.0055123265],"category_scores_gemma":[0.00866587,0.0002526211,0.00080085057,0.000807948,0.0023586787,0.004530266,0.0018160597,0.0026509129,0.0010349897],"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.000022751201,0.000016405025,0.00039252374,0.000036587306,0.000004066551,0.000052476757,0.00008667481,0.025194751,0.00055483833,0.96697927,0.00086991856,0.0057897535],"study_design_scores_gemma":[0.000007638628,0.0000115537005,0.00016397811,0.000025800908,0.000004079206,0.000036213616,0.000023646231,0.27684256,0.0007879226,0.719992,0.0020918737,0.000012680595],"about_ca_topic_score_codex":0.0035197558,"about_ca_topic_score_gemma":0.0039576003,"teacher_disagreement_score":0.0055123265,"about_ca_system_score_codex":0.0024418382,"about_ca_system_score_gemma":0.0010300968,"threshold_uncertainty_score":0.018440545},"labels":[],"label_agreement":null},{"id":"W4412647517","doi":"10.55016/ojs/cdm.v2i2.61963","title":"Aspects of singular cofinality","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cofinality; Mathematics; Combinatorics; Uncountable set","score_opus":0.015302729185797751,"score_gpt":0.30302730938609956,"score_spread":0.28772458020030184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647517","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.56768423,0.0021342777,0.33750924,0.0022490039,0.00018633323,0.00009556443,0.00022354542,0.00045052305,0.08946726],"genre_scores_gemma":[0.9845516,0.00030621412,0.010907635,0.00011971521,0.00011724866,0.00003506103,0.0001038304,0.000040497802,0.0038182558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838257,0.00029307787,0.00012371979,0.0004155351,0.00044563384,0.00033943204],"domain_scores_gemma":[0.9925161,0.0037749987,0.0006958747,0.0010420019,0.0010210952,0.0009500243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023314608,0.00045509398,0.00066468894,0.0020379566,0.0027701303,0.0034853993,0.0009478602,0.0010827886,0.0037852202],"category_scores_gemma":[0.006235512,0.0003874654,0.0012881162,0.0011519837,0.009168765,0.00789592,0.0036598204,0.0025127265,0.00036307314],"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.000037651655,0.000024946245,0.0010020921,0.000052871976,0.000007909591,0.00024716055,0.00093573186,0.00070134393,0.002593559,0.9911929,0.00020932422,0.002994516],"study_design_scores_gemma":[0.000013909283,0.000049186343,0.0008539956,0.000037293277,0.000019341462,0.00036597165,0.00051257457,0.0051028365,0.0044167475,0.9842324,0.0043782135,0.0000175147],"about_ca_topic_score_codex":0.0012949673,"about_ca_topic_score_gemma":0.001211566,"teacher_disagreement_score":0.0037852202,"about_ca_system_score_codex":0.0016491832,"about_ca_system_score_gemma":0.0008964024,"threshold_uncertainty_score":0.012662828},"labels":[],"label_agreement":null},{"id":"W4412647858","doi":"10.55016/ojs/cdm.v2i1.61890","title":"Coloring edges and vertices of graphs without short or long cycles","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.024361929138435805,"score_gpt":0.3102164975382111,"score_spread":0.2858545683997753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647858","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.64830345,0.0021090729,0.32075697,0.0018452132,0.00015781989,0.00018251904,0.0010304829,0.0005572207,0.025057161],"genre_scores_gemma":[0.9107583,0.0012917741,0.07853687,0.00032725921,0.00015670879,0.00013760026,0.0010721548,0.00015264623,0.00756668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901795,0.00026403274,0.00005251086,0.0003479613,0.00013651529,0.00018099796],"domain_scores_gemma":[0.9942338,0.0038645444,0.0007949209,0.0005672403,0.00019076918,0.0003486573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056746736,0.0007686533,0.00058686995,0.0008692117,0.001047708,0.003042036,0.0011679683,0.0014370512,0.0034818207],"category_scores_gemma":[0.0060850563,0.0006605507,0.0006485747,0.0015560478,0.001886822,0.0047702305,0.0019199508,0.0014886128,0.0004162982],"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.0010762168,0.0002857646,0.012097895,0.0005930887,0.000119156735,0.0004841579,0.0007327842,0.12255198,0.017827371,0.72315735,0.009493637,0.11158057],"study_design_scores_gemma":[0.000062809486,0.000054813197,0.0017489387,0.000044176526,0.000042035233,0.00027159936,0.00026962458,0.11713727,0.0053260396,0.86753273,0.0074754604,0.000034593533],"about_ca_topic_score_codex":0.002097139,"about_ca_topic_score_gemma":0.0022101346,"teacher_disagreement_score":0.0034818207,"about_ca_system_score_codex":0.0011976383,"about_ca_system_score_gemma":0.0006284045,"threshold_uncertainty_score":0.01164788},"labels":[],"label_agreement":null},{"id":"W4412647866","doi":"10.55016/ojs/cdm.v2i1.61930","title":"Bounds on the achromatic number of partial triple systems","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Achromatic lens; Mathematics; Combinatorics; Physics","score_opus":0.010416507884809528,"score_gpt":0.2646640253499947,"score_spread":0.2542475174651852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647866","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.6666496,0.0033126173,0.22961599,0.0010713255,0.00008388669,0.00006920947,0.0009066696,0.00044387084,0.09784678],"genre_scores_gemma":[0.96269596,0.0009877154,0.030998614,0.00005429234,0.000044756915,0.00005475428,0.00030409519,0.0000695884,0.0047902814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898714,0.00019416149,0.000060223727,0.00022023128,0.0002950074,0.00024322298],"domain_scores_gemma":[0.99521834,0.002921741,0.00046304832,0.000579382,0.0004644286,0.00035301349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000862778,0.0006504733,0.0006314625,0.0016833905,0.0010337313,0.0022284333,0.0008603701,0.0005751177,0.0047013457],"category_scores_gemma":[0.0053175795,0.00046448904,0.0004945118,0.0011502836,0.0016652364,0.0035588294,0.0015553278,0.0009815384,0.00052155973],"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.0011107388,0.000092379414,0.0064676898,0.0005484768,0.000118384145,0.00038412985,0.00063487416,0.09374103,0.06129454,0.7567892,0.0044287858,0.074389696],"study_design_scores_gemma":[0.00008009801,0.00026777163,0.0041098,0.00015106966,0.000098367236,0.0010793743,0.00043948667,0.12088738,0.047688793,0.810514,0.014591497,0.000092479226],"about_ca_topic_score_codex":0.0006801559,"about_ca_topic_score_gemma":0.0011811474,"teacher_disagreement_score":0.0047013457,"about_ca_system_score_codex":0.0015604567,"about_ca_system_score_gemma":0.00044770024,"threshold_uncertainty_score":0.01572758},"labels":[],"label_agreement":null},{"id":"W4412647867","doi":"10.55016/ojs/cdm.v2i1.61952","title":"The flow lattice of oriented matroids","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Freie Universität Berlin","keywords":"Matroid; Mathematics; Combinatorics; Lattice (music); Physics","score_opus":0.00521944936892398,"score_gpt":0.2785005600038057,"score_spread":0.2732811106348817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647867","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.8864332,0.00043186013,0.09460926,0.00041134367,0.000060989165,0.00005130892,0.00047164812,0.00014828263,0.017382193],"genre_scores_gemma":[0.96261626,0.00024673284,0.032891642,0.00010559946,0.0000850708,0.000043401415,0.00037363943,0.00002984139,0.003607842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953926,0.00011693677,0.000026889094,0.00007763437,0.0001557119,0.00008357995],"domain_scores_gemma":[0.9991629,0.0002461941,0.00017151816,0.000080445614,0.00011950329,0.000219522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045529855,0.00027186002,0.00031780134,0.0010952458,0.0006541091,0.0017134829,0.00033780417,0.00022868038,0.0016849908],"category_scores_gemma":[0.001294635,0.00024877337,0.0003252488,0.000594699,0.0014099792,0.0019832256,0.00071596995,0.0007171852,0.00016999409],"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.00019349056,0.00010115325,0.0025088873,0.00007074711,0.000014657053,0.0000902119,0.00030711343,0.020138552,0.011693287,0.938018,0.0014843014,0.025379477],"study_design_scores_gemma":[0.000048297432,0.000106514126,0.0024038895,0.000023307119,0.000011907336,0.00026232115,0.0002672186,0.09538085,0.007446551,0.88480866,0.009189509,0.00005098983],"about_ca_topic_score_codex":0.0009650016,"about_ca_topic_score_gemma":0.00083547947,"teacher_disagreement_score":0.0017134829,"about_ca_system_score_codex":0.00080472906,"about_ca_system_score_gemma":0.00043164162,"threshold_uncertainty_score":0.005838692},"labels":[],"label_agreement":null},{"id":"W4412647871","doi":"10.55016/ojs/cdm.v2i1.61917","title":"A proof of an extension of the icosahedral conjecture of Steiner for generalized deltahedra","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Icosahedral symmetry; Extension (predicate logic); Steiner system; Steiner tree problem; Combinatorial proof; Discrete mathematics; Computer science; Geometry","score_opus":0.031289550972978426,"score_gpt":0.360196301268681,"score_spread":0.3289067502957026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647871","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.14843269,0.0033225522,0.5009841,0.009713639,0.0045300894,0.00014806354,0.00088764954,0.0005703295,0.33141088],"genre_scores_gemma":[0.8426441,0.003234457,0.11608041,0.004322691,0.0031051494,0.00021089244,0.0011877593,0.00030904813,0.028905516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902356,0.00016053126,0.000035192577,0.00019356621,0.00045930053,0.00012772562],"domain_scores_gemma":[0.99792045,0.00089987123,0.00018302332,0.00037359592,0.00036646845,0.00025652465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008858391,0.0007792688,0.0008122184,0.0010962909,0.0015230421,0.0013635507,0.00131422,0.0012724167,0.011252055],"category_scores_gemma":[0.0048206067,0.00035763127,0.0012833476,0.0012440692,0.0031041172,0.0044605597,0.0043237787,0.0037014645,0.001232567],"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.000028410745,0.000016782926,0.00036898925,0.00010502932,0.000010337806,0.00025461434,0.00013617157,0.002180826,0.00091726525,0.9800274,0.0069316747,0.009022564],"study_design_scores_gemma":[0.00001999748,0.00003512426,0.00040766236,0.0000468271,0.000010483784,0.00037396094,0.000114876675,0.00873729,0.00069588766,0.96580464,0.023737222,0.000016087119],"about_ca_topic_score_codex":0.00091703254,"about_ca_topic_score_gemma":0.0007097448,"teacher_disagreement_score":0.011252055,"about_ca_system_score_codex":0.00094153214,"about_ca_system_score_gemma":0.00048316884,"threshold_uncertainty_score":0.037641823},"labels":[],"label_agreement":null},{"id":"W4412647882","doi":"10.55016/ojs/cdm.v2i1.61876","title":"An explicit treatment of biquadratic function fields","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Function (biology); Combinatorics; Pure mathematics; Evolutionary biology; Biology","score_opus":0.026664503825741186,"score_gpt":0.3391348229069486,"score_spread":0.31247031908120737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647882","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.12773247,0.0033193834,0.5537118,0.0022055754,0.0008691652,0.00008558626,0.00035488125,0.00065927533,0.31106192],"genre_scores_gemma":[0.79955035,0.0024934744,0.126554,0.00096601795,0.0007815759,0.00011878003,0.0003142773,0.00039791927,0.068823606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964833,0.000051220897,0.000017398037,0.000049856368,0.00014952938,0.00008367601],"domain_scores_gemma":[0.9997576,0.000046429494,0.000023630202,0.00008252913,0.00006157923,0.00002826159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046643836,0.0007766144,0.00046394384,0.001280451,0.0014971038,0.0017711982,0.0012368065,0.0008310003,0.009993024],"category_scores_gemma":[0.0010630352,0.00024044885,0.0004425668,0.0012364786,0.0013792877,0.0042833895,0.0013325562,0.0022539524,0.0023670413],"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.000010228513,0.000016113732,0.00007751679,0.00003367791,0.0000011390644,0.00007080264,0.000120867626,0.0010840143,0.0014615713,0.989012,0.0010498253,0.0070622233],"study_design_scores_gemma":[0.000009491729,0.000022626391,0.00014441523,0.00003841907,0.000004736195,0.00029844214,0.00007320262,0.015498873,0.0017550192,0.9485311,0.033606086,0.000017591714],"about_ca_topic_score_codex":0.0006120382,"about_ca_topic_score_gemma":0.0008435855,"teacher_disagreement_score":0.009993024,"about_ca_system_score_codex":0.00080391124,"about_ca_system_score_gemma":0.00044356164,"threshold_uncertainty_score":0.03342998},"labels":[],"label_agreement":null},{"id":"W4412647884","doi":"10.55016/ojs/cdm.v2i1.61950","title":"A canonical partition theorem for trees","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Discrete mathematics","score_opus":0.031732370162845344,"score_gpt":0.36440235914605473,"score_spread":0.3326699889832094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647884","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.12301317,0.0023552035,0.75548697,0.0018154263,0.00066649227,0.00010079668,0.00060434017,0.0007086435,0.11524895],"genre_scores_gemma":[0.87573063,0.0019096025,0.09094712,0.00112759,0.00079839,0.00023509879,0.0013362028,0.00076376053,0.027151657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871135,0.0001988769,0.00005397115,0.00038184712,0.00038911926,0.00026490772],"domain_scores_gemma":[0.9980531,0.0008901128,0.00009767105,0.00025250317,0.00046673632,0.00023984505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009697063,0.0005082078,0.00073580106,0.0012949279,0.0020808626,0.0030260852,0.0009301295,0.00080438127,0.008692052],"category_scores_gemma":[0.003442876,0.0005083111,0.0014435704,0.001174594,0.0038056618,0.0058439625,0.0035298215,0.0029642165,0.0020393198],"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.0000071676545,0.0000053922463,0.00017802307,0.000025696258,0.0000046477417,0.000034527646,0.00015976446,0.00046948387,0.0005471427,0.9937483,0.0012695688,0.0035502978],"study_design_scores_gemma":[0.000012320646,0.000017188906,0.00024495486,0.000024735484,0.000013146955,0.00018604232,0.00013508085,0.00604429,0.0011701065,0.97959685,0.012541899,0.000013411652],"about_ca_topic_score_codex":0.001662276,"about_ca_topic_score_gemma":0.0017303267,"teacher_disagreement_score":0.008692052,"about_ca_system_score_codex":0.0015667217,"about_ca_system_score_gemma":0.0008202498,"threshold_uncertainty_score":0.029077828},"labels":[],"label_agreement":null},{"id":"W4412647898","doi":"10.55016/ojs/cdm.v2i1.61875","title":"Classes of codes from quadratic surfaces of PG(3,q)","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Quadratic equation; Geometry","score_opus":0.013079741330489067,"score_gpt":0.2896136453142532,"score_spread":0.27653390398376415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647898","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.8800588,0.000994831,0.07154414,0.0010621888,0.00009511266,0.00008734723,0.00034411653,0.00037292094,0.045440476],"genre_scores_gemma":[0.9805252,0.00057765224,0.0115844775,0.00016877335,0.000097706936,0.00007765791,0.000424673,0.0001007341,0.006443126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933475,0.00006817632,0.000026059206,0.000104840685,0.00031009992,0.0001560326],"domain_scores_gemma":[0.9985524,0.00065023144,0.00028651828,0.00018277108,0.00018429614,0.00014385585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003348987,0.00059510436,0.0004926883,0.0019742148,0.001433978,0.002098869,0.00063032185,0.0010425126,0.003226251],"category_scores_gemma":[0.0026051681,0.0002574879,0.0004596057,0.0014073706,0.0023757163,0.002119021,0.0011075283,0.0014960371,0.0003544771],"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.0001123687,0.00003681181,0.0019783515,0.00011928414,0.000012667873,0.00033149592,0.0006419484,0.012343619,0.005449718,0.951,0.0015163579,0.026457349],"study_design_scores_gemma":[0.0000800314,0.00014496944,0.004037775,0.00014244857,0.000026452888,0.0014774399,0.00048145402,0.070574395,0.0170957,0.87906706,0.026783513,0.00008883779],"about_ca_topic_score_codex":0.001438993,"about_ca_topic_score_gemma":0.0008223785,"teacher_disagreement_score":0.003226251,"about_ca_system_score_codex":0.0013545622,"about_ca_system_score_gemma":0.00056346046,"threshold_uncertainty_score":0.010792911},"labels":[],"label_agreement":null},{"id":"W4412647922","doi":"10.55016/ojs/cdm.v2i1.61885","title":"On the rigidity of regular bicycle (n,k)-gons","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rigidity (electromagnetism); Combinatorics; Materials science","score_opus":0.020391223131922997,"score_gpt":0.33276876695995283,"score_spread":0.31237754382802985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647922","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.93798226,0.00046446876,0.036100343,0.0001415607,0.000043076438,0.000022861364,0.00011121712,0.00005294643,0.025081232],"genre_scores_gemma":[0.9896572,0.00025598245,0.0066966163,0.00002966223,0.000023920527,0.000010369652,0.00010150303,0.000029400426,0.0031952385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971646,0.00004972372,0.000017876928,0.00006321327,0.00008102492,0.00007165448],"domain_scores_gemma":[0.99934214,0.00025298123,0.00015395287,0.0000891038,0.000054659817,0.00010713177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023094274,0.00032454412,0.00038965605,0.0010247988,0.0008733311,0.00068505574,0.00057263905,0.0005383588,0.0038113892],"category_scores_gemma":[0.0011880492,0.00033429102,0.00050778757,0.00048602535,0.0020267477,0.00091592356,0.0010151903,0.0007335977,0.00029215895],"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.00025541635,0.000048158654,0.005544767,0.00020665515,0.000030798736,0.0009547758,0.0009632971,0.06201347,0.021039313,0.88236725,0.0010698531,0.02550628],"study_design_scores_gemma":[0.000031803826,0.00029185138,0.011902989,0.00011104099,0.000032575113,0.0015567292,0.00090874115,0.16662931,0.008614693,0.7999357,0.009866489,0.00011805909],"about_ca_topic_score_codex":0.0012940684,"about_ca_topic_score_gemma":0.00129519,"teacher_disagreement_score":0.0038113892,"about_ca_system_score_codex":0.0004974811,"about_ca_system_score_gemma":0.0001971164,"threshold_uncertainty_score":0.012750387},"labels":[],"label_agreement":null},{"id":"W4412648037","doi":"10.55016/ojs/cdm.v1i1.61914","title":"Uniquely circular colourable and uniquely fractional colourable graphs of large girth","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Combinatorics; Mathematics; Girth (graph theory)","score_opus":0.010675779929692698,"score_gpt":0.2983649979812065,"score_spread":0.2876892180515138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648037","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.84769756,0.0005802813,0.12025591,0.0006532684,0.00007038913,0.000046026267,0.00034618887,0.00032673075,0.030023552],"genre_scores_gemma":[0.9670924,0.0003021006,0.028062722,0.00017166208,0.000037670696,0.000036956983,0.00024734525,0.00004565964,0.0040034237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991823,0.0001302441,0.000036726316,0.00028932866,0.000120866105,0.00024048744],"domain_scores_gemma":[0.9960473,0.001964109,0.00053378916,0.00083584635,0.00024520743,0.00037365218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000624492,0.00046171897,0.00059703144,0.0006509989,0.0014312017,0.0016980635,0.00086732453,0.0010061513,0.0032459325],"category_scores_gemma":[0.0044279215,0.00054222683,0.00056959153,0.0007200107,0.00234498,0.0033086515,0.0018507879,0.0013883223,0.000318305],"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.000577326,0.00006262964,0.00558366,0.00029196637,0.000044869692,0.0011056011,0.0012982925,0.02951271,0.041500427,0.8844283,0.002557348,0.033036895],"study_design_scores_gemma":[0.00008727097,0.00018445794,0.0056234957,0.00006880296,0.00010065098,0.0028755143,0.001000558,0.05283832,0.03316095,0.88626033,0.017694596,0.00010505647],"about_ca_topic_score_codex":0.00081363716,"about_ca_topic_score_gemma":0.0011815688,"teacher_disagreement_score":0.0032459325,"about_ca_system_score_codex":0.0008050979,"about_ca_system_score_gemma":0.00063818216,"threshold_uncertainty_score":0.010858655},"labels":[],"label_agreement":null},{"id":"W4412648039","doi":"10.55016/ojs/cdm.v1i1.61900","title":"Szemer'edi's regularity lemma revisited","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lemma (botany); Combinatorics; Mathematics; Genealogy; Biology; History; Botany","score_opus":0.016080342111403027,"score_gpt":0.3121497507281633,"score_spread":0.2960694086167603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648039","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.14134821,0.008181925,0.55898684,0.018513303,0.0016294862,0.000108188826,0.001059002,0.00053320656,0.26963982],"genre_scores_gemma":[0.8980778,0.0049803522,0.053344376,0.0026687512,0.0016304253,0.00014299121,0.0002995491,0.0002977883,0.038557947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828964,0.00032579392,0.000106151885,0.00042724944,0.00060468906,0.00024642856],"domain_scores_gemma":[0.99598145,0.0023103359,0.0002944184,0.0005842622,0.00066042156,0.0001691738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024127236,0.00041873858,0.0009468411,0.0022536435,0.0014020676,0.0022842286,0.0017314621,0.0017543214,0.005690732],"category_scores_gemma":[0.006830829,0.00046813526,0.0013101059,0.0020747858,0.0053408467,0.008201835,0.0031048318,0.003952883,0.0009742308],"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.0000107990545,0.000004432189,0.0001225241,0.000019087742,0.00000516834,0.000045589415,0.00006280231,0.0004847889,0.00027664952,0.99446255,0.00097259687,0.003532937],"study_design_scores_gemma":[0.000009376221,0.000014164302,0.00028268129,0.00001632984,0.000008664577,0.00017835695,0.00004829838,0.004867919,0.00089083705,0.9810472,0.012618752,0.00001742927],"about_ca_topic_score_codex":0.0011869525,"about_ca_topic_score_gemma":0.0005577432,"teacher_disagreement_score":0.005690732,"about_ca_system_score_codex":0.0018154139,"about_ca_system_score_gemma":0.00071777694,"threshold_uncertainty_score":0.019037366},"labels":[],"label_agreement":null},{"id":"W4412648042","doi":"10.55016/ojs/cdm.v1i1.61901","title":"Classification of linear codes exploiting an invariant","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Invariant (physics); Combinatorics; Discrete mathematics","score_opus":0.024009442177748672,"score_gpt":0.28978886986806357,"score_spread":0.2657794276903149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648042","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.40394294,0.00041614825,0.58065945,0.0005209439,0.00015766986,0.00010187332,0.00027774757,0.00037762304,0.013545531],"genre_scores_gemma":[0.8592282,0.00034615715,0.13442133,0.00015543526,0.00027566077,0.0000926672,0.0008975247,0.00011840216,0.004464611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986071,0.00017981183,0.00012202489,0.0002648063,0.0005901085,0.0002361662],"domain_scores_gemma":[0.99711466,0.0009870201,0.0005501343,0.00072964403,0.0004209153,0.00019766587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008174874,0.00038341366,0.00082819595,0.0023138036,0.0008886432,0.0020195607,0.0007917782,0.0007888189,0.0022121768],"category_scores_gemma":[0.00415464,0.0002093816,0.00093331427,0.0016486768,0.0023184866,0.0027858168,0.0015968082,0.0013012945,0.00058774435],"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.00026541998,0.00018453806,0.0038077082,0.00014441607,0.000033676693,0.00025480657,0.00065402285,0.03141355,0.013693456,0.7813537,0.0026611486,0.16553357],"study_design_scores_gemma":[0.00002861242,0.00024600222,0.0014676743,0.000028927227,0.000019583542,0.00035553673,0.00018452833,0.2211605,0.011584484,0.7592004,0.0056717894,0.000052039475],"about_ca_topic_score_codex":0.00093919813,"about_ca_topic_score_gemma":0.0004605848,"teacher_disagreement_score":0.0023138036,"about_ca_system_score_codex":0.0010441402,"about_ca_system_score_gemma":0.0005983858,"threshold_uncertainty_score":0.00757581},"labels":[],"label_agreement":null},{"id":"W4412648058","doi":"10.55016/ojs/cdm.v1i1.61912","title":"On primitive symmetric association schemes with m_1=3","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Association scheme; Combinatorics; Association (psychology); Psychology","score_opus":0.019730529632924612,"score_gpt":0.3260243892405387,"score_spread":0.3062938596076141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648058","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.87096757,0.00080455124,0.072019435,0.00044493083,0.00022196962,0.00006969653,0.00037841903,0.00022667917,0.054866754],"genre_scores_gemma":[0.9728581,0.00042895324,0.019834498,0.000096520045,0.00014576304,0.00004200987,0.0003915737,0.000037313213,0.0061653215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989349,0.00016246553,0.00006658281,0.00017616538,0.00031430554,0.0003456692],"domain_scores_gemma":[0.997827,0.00047542178,0.0005699436,0.0004656433,0.00026067594,0.0004013549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009717418,0.00056829496,0.00049650023,0.0027205197,0.0018610619,0.0022141752,0.0008380541,0.00096012873,0.0042293416],"category_scores_gemma":[0.0017458501,0.0003138279,0.00074077555,0.0024873482,0.0038574336,0.0044915965,0.0035117355,0.0012671526,0.00097057596],"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.000059269616,0.000014479116,0.001163706,0.00003205865,0.0000041135772,0.0001049424,0.00029831342,0.0012133821,0.0014250438,0.98538035,0.0007103352,0.009594076],"study_design_scores_gemma":[0.000024744353,0.00009735755,0.0021813058,0.000058872203,0.000014752071,0.0005270935,0.0004091306,0.0071218293,0.0016235353,0.9717613,0.0161335,0.000046655765],"about_ca_topic_score_codex":0.00096319075,"about_ca_topic_score_gemma":0.00075807923,"teacher_disagreement_score":0.0042293416,"about_ca_system_score_codex":0.0009608902,"about_ca_system_score_gemma":0.0007146346,"threshold_uncertainty_score":0.014148533},"labels":[],"label_agreement":null},{"id":"W4412648062","doi":"10.55016/ojs/cdm.v1i1.61911","title":"Best Simultaneous Diophantine Approximations under a Constraint on the Denominator","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Mathematics; Diophantine equation; Diophantine set; Constraint (computer-aided design); Combinatorics; Approximations of π; Diophantine approximation; Discrete mathematics; Applied mathematics; Geometry","score_opus":0.021211247150970086,"score_gpt":0.3072325860784801,"score_spread":0.28602133892751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648062","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.118846685,0.0011309132,0.8577749,0.0008920956,0.00011173768,0.000032293894,0.00014957644,0.00029121456,0.020770563],"genre_scores_gemma":[0.85359806,0.0008325002,0.13695706,0.00020256454,0.00011854649,0.000107812404,0.00018855,0.00035086522,0.0076440065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972156,0.00073825836,0.0001577444,0.0005457527,0.00087940734,0.00046312044],"domain_scores_gemma":[0.9918772,0.0057431725,0.00043398252,0.0012111339,0.00054037414,0.00019418693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038975282,0.000938673,0.0016594502,0.001102514,0.0009027081,0.0025584835,0.0015345146,0.0010540863,0.0047695534],"category_scores_gemma":[0.021513185,0.0006326504,0.0010365201,0.0014417205,0.0021003627,0.004968785,0.0029941937,0.0033449347,0.000962091],"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.00037516482,0.000065445565,0.0008943288,0.00028067976,0.00007330143,0.00015445816,0.00032095314,0.15334548,0.0071573225,0.789027,0.0024374498,0.045868494],"study_design_scores_gemma":[0.000032378786,0.000089912006,0.00020476352,0.000050447998,0.000039000966,0.00012598638,0.000080691585,0.41957876,0.0064838226,0.57057565,0.0027095117,0.000029078044],"about_ca_topic_score_codex":0.00090151804,"about_ca_topic_score_gemma":0.0009887043,"teacher_disagreement_score":0.0047695534,"about_ca_system_score_codex":0.0014860407,"about_ca_system_score_gemma":0.00077413337,"threshold_uncertainty_score":0.020612359},"labels":[],"label_agreement":null},{"id":"W4412648066","doi":"10.55016/ojs/cdm.v1i1.62769","title":"Sum and product of different sets","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Product (mathematics); Geometry","score_opus":0.01382463946740584,"score_gpt":0.2961174915697767,"score_spread":0.2822928521023708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648066","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.19457546,0.004949935,0.6311513,0.0023436507,0.00091927906,0.00014263514,0.0009849269,0.0009947956,0.1639381],"genre_scores_gemma":[0.7687535,0.0019908072,0.19450992,0.00072429824,0.0008532886,0.00035216357,0.00092722324,0.00039845923,0.03149033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948448,0.0011646496,0.00036818327,0.0014036531,0.0017041906,0.00051444065],"domain_scores_gemma":[0.99210936,0.0037105838,0.0005887924,0.0017573987,0.0011211453,0.0007126807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028326712,0.0007646796,0.0013416607,0.0032111516,0.0029503999,0.006200557,0.0014628111,0.0009547503,0.011650123],"category_scores_gemma":[0.01238673,0.00074715493,0.0016312466,0.0026481005,0.006692949,0.014187511,0.006918497,0.0022242672,0.0020087662],"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.000046898687,0.000009297588,0.00021194821,0.00005049699,0.000016699692,0.00008371853,0.00028159213,0.0004576034,0.00070148427,0.9875261,0.0010438702,0.0095701795],"study_design_scores_gemma":[0.0000066006182,0.000018964556,0.00014328344,0.000025457275,0.000019190338,0.0002470075,0.00012390525,0.003432787,0.0010759755,0.9827005,0.012189813,0.00001649765],"about_ca_topic_score_codex":0.0005232685,"about_ca_topic_score_gemma":0.00044692503,"teacher_disagreement_score":0.011650123,"about_ca_system_score_codex":0.0013469068,"about_ca_system_score_gemma":0.0007283724,"threshold_uncertainty_score":0.03897351},"labels":[],"label_agreement":null},{"id":"W4412648067","doi":"10.55016/ojs/cdm.v1i1.61915","title":"Induced Subgraphs of Bounded Degree and Bounded Treewidth","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Treewidth; Bounded function; Mathematics; Combinatorics; Degree (music); Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.025956985522601995,"score_gpt":0.3125563119720091,"score_spread":0.2865993264494071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648067","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.6564919,0.0008730771,0.3128233,0.0010564451,0.000040768016,0.000084931075,0.0015259895,0.00061208656,0.026491448],"genre_scores_gemma":[0.9425,0.00060999306,0.051113162,0.00023140642,0.00007321061,0.00010356963,0.0013814529,0.000120786215,0.0038663868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991774,0.00013487831,0.000037796024,0.00019235892,0.00022509204,0.00023245285],"domain_scores_gemma":[0.9936573,0.003463737,0.0011515939,0.0009152824,0.00040718322,0.00040485393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048711846,0.00042828702,0.0004767651,0.0006886366,0.0004820833,0.0013273458,0.0011017381,0.0005125182,0.0026255508],"category_scores_gemma":[0.0037030214,0.0005011623,0.0005699035,0.0011610183,0.0007650225,0.0024736465,0.001359465,0.0012880524,0.00040587797],"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.00057944993,0.00033037388,0.009454085,0.00050299766,0.00015381712,0.0012162466,0.0009254093,0.10946762,0.08120581,0.7396342,0.007855642,0.04867436],"study_design_scores_gemma":[0.00014551403,0.00013762401,0.007305892,0.00006313735,0.0001211958,0.0012345936,0.00025818672,0.2693786,0.024568908,0.6825937,0.014148302,0.000044444325],"about_ca_topic_score_codex":0.0006135406,"about_ca_topic_score_gemma":0.0010089244,"teacher_disagreement_score":0.0026255508,"about_ca_system_score_codex":0.0010185203,"about_ca_system_score_gemma":0.0004401783,"threshold_uncertainty_score":0.00878334},"labels":[],"label_agreement":null},{"id":"W4412648091","doi":"10.55016/ojs/cdm.v13i1.62505","title":"On the number of partitions into odd parts or congruent to ± 2 ( mod 10 )","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Combinatorics","score_opus":0.044636064606772434,"score_gpt":0.39246376853548004,"score_spread":0.3478277039287076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648091","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.844744,0.0024898364,0.09231701,0.0016745904,0.00040166336,0.00007371895,0.0012079834,0.00030647145,0.056784704],"genre_scores_gemma":[0.972955,0.0008624313,0.019378813,0.00022069155,0.00035472712,0.00013932228,0.00071705243,0.0001288292,0.005243179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831617,0.00038235943,0.0001229112,0.0004294023,0.00034484742,0.00040426437],"domain_scores_gemma":[0.99055016,0.006558256,0.0012754059,0.00046764838,0.00059861876,0.0005499469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002480505,0.00078177796,0.0010316834,0.0030818325,0.0014328716,0.00242564,0.0018189742,0.001129523,0.005095659],"category_scores_gemma":[0.012510765,0.00031961742,0.0005191074,0.0018973436,0.0046965396,0.0035009175,0.0017336031,0.0015306489,0.0010164314],"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.0006162678,0.00008285291,0.009387413,0.00033105313,0.00004910839,0.00037375218,0.0012806464,0.010995039,0.014618921,0.905593,0.006232504,0.050439563],"study_design_scores_gemma":[0.00009935495,0.00013811246,0.009821069,0.00018692552,0.00007819222,0.0010010285,0.00044039518,0.04772086,0.0132063385,0.91704315,0.0100943195,0.00017033759],"about_ca_topic_score_codex":0.0007794574,"about_ca_topic_score_gemma":0.0006279076,"teacher_disagreement_score":0.005095659,"about_ca_system_score_codex":0.0011898596,"about_ca_system_score_gemma":0.000595874,"threshold_uncertainty_score":0.01704669},"labels":[],"label_agreement":null},{"id":"W4412648234","doi":"10.55016/ojs/cdm.v13i1.62310","title":"On the enumeration of a class of toroidal graphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Enumeration; Combinatorics; Mathematics; Toroid; Class (philosophy); Computer science; Physics; Artificial intelligence","score_opus":0.01820904632752397,"score_gpt":0.3194199532373009,"score_spread":0.3012109069097769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648234","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.80951804,0.0006035821,0.09967837,0.000658107,0.0001321772,0.000058764694,0.00060887536,0.0003838686,0.0883582],"genre_scores_gemma":[0.96100736,0.0005382563,0.02600452,0.00016510209,0.00009601937,0.00008015767,0.000742311,0.00009325707,0.011273173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996493,0.00008340759,0.000020542268,0.000075038166,0.00008494209,0.00008685938],"domain_scores_gemma":[0.99902296,0.0004270604,0.00014223967,0.00014336513,0.00013835114,0.00012604345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002905678,0.0003596468,0.0004277085,0.0017488935,0.0015832372,0.0017836383,0.0005771214,0.0005690286,0.004969611],"category_scores_gemma":[0.0017799871,0.00020140302,0.00037168877,0.001966758,0.0015486121,0.0027710644,0.0010844329,0.000809901,0.00044139515],"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.00009757679,0.000027394193,0.0012200554,0.00009047265,0.0000069330977,0.0002403574,0.000545352,0.004351876,0.0032682181,0.96158886,0.0022328617,0.026330048],"study_design_scores_gemma":[0.000012221633,0.000038177186,0.0015758502,0.000055072433,0.000014464152,0.00060975767,0.00066914735,0.025616094,0.002933065,0.9526816,0.015762117,0.00003240983],"about_ca_topic_score_codex":0.00097252685,"about_ca_topic_score_gemma":0.0011174898,"teacher_disagreement_score":0.004969611,"about_ca_system_score_codex":0.0007204191,"about_ca_system_score_gemma":0.00035399297,"threshold_uncertainty_score":0.016624987},"labels":[],"label_agreement":null},{"id":"W4412648238","doi":"10.55016/ojs/cdm.v13i1.62469","title":"On the combinatorics of modified lattice paths and generalized q --series","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Council of Scientific and Industrial Research, India","keywords":"Combinatorics; Mathematics; Series (stratigraphy); Lattice (music); Discrete mathematics; Physics; Biology","score_opus":0.03575819493167208,"score_gpt":0.33404429448157,"score_spread":0.29828609954989793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648238","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.54093313,0.0018660837,0.29621726,0.0019396576,0.00047619338,0.00009413827,0.00024429325,0.0004024311,0.15782678],"genre_scores_gemma":[0.92172253,0.0010520599,0.05321635,0.0003368194,0.0003421033,0.00007881526,0.0001283924,0.0001372786,0.022985732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994443,0.00015580494,0.000030960327,0.00011105363,0.00017850046,0.00007941211],"domain_scores_gemma":[0.99901557,0.0003358894,0.00017041976,0.00021090043,0.0001379629,0.000129333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087499,0.00058063044,0.00045350767,0.0012729185,0.0011819877,0.0020716498,0.0011010702,0.00061896176,0.0060073417],"category_scores_gemma":[0.002154119,0.00027406533,0.0007201418,0.0011713476,0.0033630533,0.0053071887,0.0016321307,0.0017464287,0.0006082597],"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.000011032159,0.0000061337773,0.000088448665,0.000011850213,0.00000226464,0.000053684602,0.000102826176,0.00052546576,0.00053972355,0.9952238,0.00022211047,0.0032124817],"study_design_scores_gemma":[0.000008691864,0.000010145037,0.0001171912,0.0000067533483,0.0000034476745,0.00012396394,0.00005349091,0.002541156,0.000434181,0.99308676,0.0036050696,0.000009093215],"about_ca_topic_score_codex":0.00046425377,"about_ca_topic_score_gemma":0.0004720499,"teacher_disagreement_score":0.0060073417,"about_ca_system_score_codex":0.0008995,"about_ca_system_score_gemma":0.00043275792,"threshold_uncertainty_score":0.02009654},"labels":[],"label_agreement":null},{"id":"W4412648254","doi":"10.55016/ojs/cdm.v13i1.62548","title":"Uniformly resolvable (C4, K1,3) -designs of index 2","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics; Index (typography); Statistics; Discrete mathematics; Computer science","score_opus":0.01208784937286285,"score_gpt":0.25704937298803887,"score_spread":0.24496152361517604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648254","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.7402986,0.0003891577,0.21643396,0.0002408885,0.00007703181,0.00009436505,0.0003887441,0.00032253138,0.04175476],"genre_scores_gemma":[0.9506262,0.00009994335,0.043650944,0.00009316117,0.000020454687,0.0000592034,0.00023052642,0.00004708822,0.005172488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992237,0.00021020773,0.00003610812,0.0001585178,0.00014811472,0.0002234355],"domain_scores_gemma":[0.99844754,0.0005705654,0.00028727995,0.00037042552,0.00018444116,0.00013967593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000662062,0.00049846794,0.00039775987,0.0006771707,0.00085537485,0.0011428408,0.0005794844,0.00072078203,0.0057205698],"category_scores_gemma":[0.0022661197,0.00034119256,0.00039656763,0.00048161825,0.000900986,0.0010204391,0.00076016993,0.00087800605,0.00090967934],"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.00074586,0.00009094115,0.002535978,0.00018272961,0.00006452317,0.0004846745,0.0005349684,0.022806382,0.049275443,0.8865425,0.0022302947,0.03450576],"study_design_scores_gemma":[0.00021994935,0.00042937606,0.0021221142,0.00011703344,0.00007411735,0.0011238045,0.0005165193,0.15891519,0.060137205,0.76066864,0.015563914,0.000112166344],"about_ca_topic_score_codex":0.00050937274,"about_ca_topic_score_gemma":0.00092583644,"teacher_disagreement_score":0.0057205698,"about_ca_system_score_codex":0.0006538673,"about_ca_system_score_gemma":0.0005545867,"threshold_uncertainty_score":0.019137144},"labels":[],"label_agreement":null},{"id":"W4412648266","doi":"10.55016/ojs/cdm.v13i1.62452","title":"Bounds for the boxicity of Mycielski graphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.016998247141056855,"score_gpt":0.298509867634204,"score_spread":0.28151162049314715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648266","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.8057446,0.0017306576,0.16822474,0.00095088134,0.000056302728,0.000056332483,0.0007814814,0.0003182309,0.022136763],"genre_scores_gemma":[0.9689793,0.00056701095,0.027828744,0.00012109629,0.00007011444,0.0000630386,0.00048487366,0.000073058574,0.0018127013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992918,0.00013194235,0.000033314056,0.00020643379,0.0001815573,0.000154926],"domain_scores_gemma":[0.9942861,0.0037605371,0.0006485222,0.0004742143,0.00033838782,0.0004922868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009035488,0.00050990883,0.00064988405,0.0014615747,0.00073346694,0.0011741432,0.0008194868,0.00052147073,0.0020725913],"category_scores_gemma":[0.0041742264,0.00037683072,0.0005549055,0.0009250168,0.0020535071,0.0030127503,0.0015793158,0.0014150147,0.00022488396],"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.00058711716,0.00008420008,0.013091726,0.00028318053,0.000065056964,0.00026494343,0.0007294952,0.04783559,0.024698,0.8891081,0.0031935729,0.0200591],"study_design_scores_gemma":[0.00006964181,0.00018924849,0.010590684,0.000109965484,0.000092645794,0.00042277653,0.00039884023,0.16289431,0.0154364435,0.79894024,0.01079222,0.00006293329],"about_ca_topic_score_codex":0.0008351587,"about_ca_topic_score_gemma":0.0013257653,"teacher_disagreement_score":0.0020725913,"about_ca_system_score_codex":0.001138083,"about_ca_system_score_gemma":0.00037617984,"threshold_uncertainty_score":0.008257389},"labels":[],"label_agreement":null},{"id":"W4412648270","doi":"10.55016/ojs/cdm.v13i1.62475","title":"String C-groups of order 1024","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council of the Philippines; Commission on Higher Education","keywords":"Mathematics; Combinatorics; Order (exchange); String (physics); Mathematical physics","score_opus":0.01049363309361958,"score_gpt":0.2827691279041704,"score_spread":0.27227549481055086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648270","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.89828295,0.00036946437,0.032573637,0.0004611369,0.00020685748,0.000037740803,0.00015202019,0.0002775532,0.067638636],"genre_scores_gemma":[0.98162985,0.00011109984,0.00965238,0.00006210528,0.00008031258,0.000020252977,0.00015796708,0.00006031609,0.008225797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994925,0.000072281866,0.00002981684,0.00009866333,0.00014951391,0.00015718915],"domain_scores_gemma":[0.99910337,0.00026727136,0.00015543573,0.00016945228,0.00011317014,0.00019133915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003470206,0.00044338222,0.0004289342,0.0012762947,0.0012392215,0.001083647,0.00044987234,0.00052524277,0.008530954],"category_scores_gemma":[0.0020227423,0.00014718076,0.00047429377,0.0005424013,0.0018309836,0.0026948652,0.0016445458,0.0010906787,0.0011406787],"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.0002732701,0.00006961137,0.0025052426,0.0001123813,0.000010998877,0.00047143947,0.0009808791,0.0021536679,0.011378971,0.94322807,0.0016158748,0.037199616],"study_design_scores_gemma":[0.00003250398,0.0001672558,0.0015750852,0.000052165004,0.000018646608,0.00083294266,0.0005552234,0.008710018,0.013402372,0.95859253,0.016004173,0.00005701853],"about_ca_topic_score_codex":0.00049172045,"about_ca_topic_score_gemma":0.00057721575,"teacher_disagreement_score":0.008530954,"about_ca_system_score_codex":0.0006468324,"about_ca_system_score_gemma":0.00067024544,"threshold_uncertainty_score":0.028538823},"labels":[],"label_agreement":null},{"id":"W4413106059","doi":"10.55016/ojs/cdm.v4i1.62002","title":"Classifying real Lehmer triples: a revived computation","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical and Theoretical Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Mathematics; Combinatorics; Algorithm","score_opus":0.03699826079995998,"score_gpt":0.3669715250301218,"score_spread":0.3299732642301618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106059","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.42294917,0.0028555274,0.30238196,0.005645585,0.0006330759,0.000078782825,0.0004071127,0.0004274379,0.26462138],"genre_scores_gemma":[0.9466656,0.00076806184,0.03386503,0.00046818712,0.00033668635,0.000047810336,0.00025583865,0.0000889242,0.017503982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999464,0.00013538048,0.0000311553,0.000109015455,0.00018492338,0.00007564694],"domain_scores_gemma":[0.999183,0.00040529316,0.00007793527,0.00011716831,0.0001236803,0.000093016555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007487008,0.00033476207,0.00041124568,0.0016837392,0.001770265,0.003135235,0.00070680864,0.0007819694,0.0060898224],"category_scores_gemma":[0.0032409008,0.00022645446,0.0003522846,0.0009502636,0.0036933355,0.0061497213,0.001967504,0.0015238435,0.0007450077],"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.000008673277,0.000002931767,0.00010863999,0.00001551344,0.0000012568505,0.000015423526,0.00012745726,0.00029367986,0.00017222893,0.99525166,0.00060329575,0.0033992038],"study_design_scores_gemma":[0.000004277938,0.000005706559,0.00008048893,0.000012602612,0.0000025259196,0.000049588736,0.000080791324,0.0025369113,0.00026377063,0.9914085,0.0055481223,0.000006765406],"about_ca_topic_score_codex":0.00071817276,"about_ca_topic_score_gemma":0.00067788904,"teacher_disagreement_score":0.0060898224,"about_ca_system_score_codex":0.001382043,"about_ca_system_score_gemma":0.0004476317,"threshold_uncertainty_score":0.02037251},"labels":[],"label_agreement":null},{"id":"W4413106070","doi":"10.55016/ojs/cdm.v4i1.61986","title":"Geometric realizations of special toroidal complexes","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Molecular spectroscopy and chirality","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toroid; Mathematics; Combinatorics; Geometry; Physics; Quantum mechanics; Plasma","score_opus":0.011062772101680404,"score_gpt":0.29940436149831845,"score_spread":0.28834158939663806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106070","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.77169806,0.00055264303,0.07405819,0.000738804,0.00021037909,0.000069105445,0.000344919,0.00025217264,0.15207563],"genre_scores_gemma":[0.9842366,0.00015342743,0.010467296,0.00005698274,0.000053729025,0.000038898226,0.00020111325,0.000024535215,0.004767463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956566,0.00008168103,0.000026307916,0.000082479135,0.00014061411,0.000103182436],"domain_scores_gemma":[0.9996159,0.000077992234,0.00007725447,0.000076173914,0.00005269609,0.000100008394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002710874,0.00030720545,0.00039841852,0.0007262767,0.0011223295,0.002446974,0.00053008314,0.0005517072,0.0044701407],"category_scores_gemma":[0.0009296932,0.0002681421,0.00040897873,0.0004465405,0.0021670123,0.0013599525,0.0012326203,0.0008349009,0.0004289295],"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.000017853085,0.0000040727823,0.00012620045,0.000013301619,0.0000021826452,0.00009695448,0.00010820758,0.0012348235,0.00076527725,0.9950192,0.0004605043,0.0021514713],"study_design_scores_gemma":[0.000019563493,0.000020957203,0.00045047817,0.000015326475,0.0000065254103,0.0002862919,0.00029923208,0.01251095,0.0012513802,0.97474426,0.010378186,0.00001688569],"about_ca_topic_score_codex":0.00080490275,"about_ca_topic_score_gemma":0.0008653191,"teacher_disagreement_score":0.0044701407,"about_ca_system_score_codex":0.0010217888,"about_ca_system_score_gemma":0.00030268065,"threshold_uncertainty_score":0.01495409},"labels":[],"label_agreement":null},{"id":"W4413106078","doi":"10.55016/ojs/cdm.v4i1.61929","title":"A local characterization of combinatorial multihedrality in tilings","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Russian Foundation for Basic Research","keywords":"Characterization (materials science); Combinatorics; Mathematics; Physics","score_opus":0.009875489948862925,"score_gpt":0.2703849971073572,"score_spread":0.26050950715849425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106078","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.87968147,0.00035316445,0.09916627,0.00010262481,0.000029968494,0.000041537274,0.00019667439,0.00021388053,0.020214459],"genre_scores_gemma":[0.9912703,0.00008306204,0.0060653323,0.000022608932,0.00002955619,0.000026543845,0.00013244397,0.000032667147,0.00233754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997336,0.000032044554,0.00001751251,0.00010708076,0.00005550151,0.000054193486],"domain_scores_gemma":[0.99920243,0.00021716827,0.0001836262,0.00015364417,0.00009603398,0.0001470822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019577976,0.00027521324,0.00029165632,0.0008735491,0.00054569414,0.0016515526,0.00047668398,0.0003543644,0.0031495222],"category_scores_gemma":[0.0007750693,0.00022252603,0.00031059983,0.0003787424,0.0022388413,0.0017086089,0.0011728946,0.00071365456,0.00034921148],"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.000137595,0.00006171336,0.005752439,0.00023105959,0.000020153424,0.0007703683,0.0012401065,0.016038368,0.07209657,0.874272,0.0009036365,0.028475987],"study_design_scores_gemma":[0.00006879546,0.00060789706,0.016578903,0.00015107177,0.000074384276,0.0031742242,0.0025027567,0.10775912,0.07341289,0.7758413,0.019709952,0.000118626114],"about_ca_topic_score_codex":0.0002471836,"about_ca_topic_score_gemma":0.00036440746,"teacher_disagreement_score":0.0031495222,"about_ca_system_score_codex":0.0005161212,"about_ca_system_score_gemma":0.00013265038,"threshold_uncertainty_score":0.010536134},"labels":[],"label_agreement":null},{"id":"W4413106080","doi":"10.55016/ojs/cdm.v4i1.62036","title":"Computing holes in semi-groups and its applications to transportation problems","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014055370327497355,"score_gpt":0.2799719674900482,"score_spread":0.26591659716255084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106080","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.29433328,0.0002756307,0.7011669,0.0005823866,0.00002831811,0.00010129217,0.00022608334,0.00048449927,0.0028016104],"genre_scores_gemma":[0.7146012,0.00012128284,0.28348473,0.0000636913,0.000030771327,0.000071410985,0.00031689266,0.00007560313,0.0012344716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992655,0.00020564768,0.00006508056,0.00017138322,0.00018711475,0.00010534575],"domain_scores_gemma":[0.9961808,0.0027006823,0.00027134625,0.00040611366,0.00022445509,0.00021668381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014920102,0.0005859874,0.0008200934,0.0014644489,0.0009623065,0.0014162502,0.0011789661,0.0008754865,0.0027029894],"category_scores_gemma":[0.0070097377,0.0004872109,0.0010998385,0.0011785653,0.0023273749,0.005012001,0.00254118,0.001194168,0.0001916923],"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.00059300964,0.00017733156,0.0067667146,0.0003426363,0.00007518923,0.0003617522,0.0022078427,0.22548985,0.008352212,0.6722197,0.0017870425,0.081626736],"study_design_scores_gemma":[0.000035552275,0.000074188945,0.0005221599,0.000026344198,0.000015803,0.00010618201,0.00031004133,0.36265782,0.003551668,0.6305373,0.0021419215,0.000021001004],"about_ca_topic_score_codex":0.002476882,"about_ca_topic_score_gemma":0.0020485285,"teacher_disagreement_score":0.0027029894,"about_ca_system_score_codex":0.0011813416,"about_ca_system_score_gemma":0.0007568399,"threshold_uncertainty_score":0.009042382},"labels":[],"label_agreement":null},{"id":"W4413106090","doi":"10.55016/ojs/cdm.v4i1.61874","title":"The search for N-e.c. graphs","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Mathematics","score_opus":0.02301138307289361,"score_gpt":0.3528199337561546,"score_spread":0.329808550683261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106090","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.6829957,0.0045655915,0.1982962,0.0077843075,0.00023261567,0.00006271513,0.00059136277,0.0006682163,0.10480332],"genre_scores_gemma":[0.8905047,0.002594987,0.09350047,0.00079692004,0.00018963634,0.000060880215,0.00069423404,0.00010338834,0.01155476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975663,0.00006209724,0.0000092851205,0.000081357946,0.00005558325,0.0000350981],"domain_scores_gemma":[0.99816364,0.0011170513,0.00016834236,0.0002723873,0.00017153317,0.0001069638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047388574,0.0003109471,0.00039175412,0.0008249257,0.0011235891,0.001271261,0.00076306175,0.0012189785,0.0031251768],"category_scores_gemma":[0.003655745,0.000390567,0.00033223917,0.0010396849,0.0018485817,0.0023780072,0.0008910444,0.0015608476,0.00042858516],"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.000043789896,0.000022484299,0.0009859302,0.00013810524,0.000009299661,0.00019099591,0.00013912444,0.0053024073,0.0027506691,0.95311046,0.0039367783,0.033370007],"study_design_scores_gemma":[0.000017574166,0.000024705341,0.000872675,0.000070887676,0.000012959835,0.00069124065,0.00021643689,0.01982454,0.0035051075,0.95445144,0.02029039,0.00002218098],"about_ca_topic_score_codex":0.0005309206,"about_ca_topic_score_gemma":0.00076687423,"teacher_disagreement_score":0.0031251768,"about_ca_system_score_codex":0.0006946808,"about_ca_system_score_gemma":0.00036876483,"threshold_uncertainty_score":0.0104548335},"labels":[],"label_agreement":null},{"id":"W4413106099","doi":"10.55016/ojs/cdm.v4i1.61995","title":"{-1,2}-hypomorphy and hereditary hypomorphy coincide for posets","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Star product","score_opus":0.008793655662201274,"score_gpt":0.2777571475324041,"score_spread":0.26896349187020285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106099","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.8183675,0.00050263223,0.15673663,0.0008598282,0.00010264292,0.00009878231,0.0005288233,0.00024338518,0.022559883],"genre_scores_gemma":[0.9677643,0.0002319733,0.026926752,0.00022638665,0.00012876789,0.000119139804,0.0006580818,0.000053556952,0.0038910748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981273,0.00047178345,0.00013340198,0.0006041771,0.00034405597,0.0003193196],"domain_scores_gemma":[0.9946654,0.0029478786,0.0009242837,0.0006017266,0.0004363599,0.00042432512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011557158,0.00051298377,0.00070666044,0.0013452612,0.0013386837,0.0022461175,0.0008724664,0.0008476397,0.004031582],"category_scores_gemma":[0.006264432,0.000542589,0.0011300354,0.001239499,0.0037824165,0.004622687,0.002026901,0.0017563392,0.00033936536],"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.00028118363,0.000112613576,0.007902317,0.00010365597,0.00005664543,0.00075099565,0.0015266492,0.0056827483,0.0062982542,0.9509923,0.0013294906,0.02496316],"study_design_scores_gemma":[0.00004864331,0.00012985338,0.0045480235,0.000026879197,0.000042542877,0.0011922391,0.0006633045,0.014386679,0.004218207,0.9695528,0.0051463097,0.00004458264],"about_ca_topic_score_codex":0.0007135866,"about_ca_topic_score_gemma":0.00088846375,"teacher_disagreement_score":0.004031582,"about_ca_system_score_codex":0.0009760188,"about_ca_system_score_gemma":0.000636604,"threshold_uncertainty_score":0.013486922},"labels":[],"label_agreement":null},{"id":"W4413106101","doi":"10.55016/ojs/cdm.v4i1.61878","title":"Results on permutations with distinct difference property","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Property (philosophy); Combinatorics","score_opus":0.010103001978321065,"score_gpt":0.23740924101247035,"score_spread":0.2273062390341493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106101","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.26122764,0.0074660564,0.39800605,0.007694178,0.0010615371,0.0002011931,0.0009617078,0.0006694915,0.32271215],"genre_scores_gemma":[0.8884444,0.006179618,0.0745614,0.0023992413,0.0012172968,0.00029654318,0.0015271426,0.0003382943,0.025035955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750525,0.0005555797,0.00018636274,0.0006410711,0.0006844819,0.00042736303],"domain_scores_gemma":[0.9866051,0.008755861,0.001067704,0.002160364,0.0008515008,0.0005594297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021802036,0.0011704926,0.0012994789,0.002291617,0.0029267499,0.003007441,0.0014188119,0.0016197083,0.010097996],"category_scores_gemma":[0.010304726,0.0007607768,0.0014504533,0.0033046063,0.0039825914,0.009277116,0.0035221914,0.004068047,0.0024351336],"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.00031445327,0.00012797015,0.0023027943,0.00037917504,0.00003744608,0.000368697,0.0004089024,0.005988125,0.004698693,0.94236284,0.0051956265,0.037815254],"study_design_scores_gemma":[0.000055187404,0.00014566023,0.00070931634,0.000068273876,0.000043644046,0.00069304596,0.00014719546,0.008754521,0.0052443785,0.96114826,0.022953553,0.000036899055],"about_ca_topic_score_codex":0.0006867023,"about_ca_topic_score_gemma":0.0004802322,"teacher_disagreement_score":0.010097996,"about_ca_system_score_codex":0.0016690205,"about_ca_system_score_gemma":0.0010711683,"threshold_uncertainty_score":0.03378123},"labels":[],"label_agreement":null},{"id":"W4413106111","doi":"10.55016/ojs/cdm.v4i1.62031","title":"Weakly partitive families on infinite sets","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024752719970845535,"score_gpt":0.3583746169209983,"score_spread":0.33362189695015276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106111","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.5620004,0.0011945189,0.34221205,0.0007052314,0.000092414964,0.00009203422,0.00075478666,0.0003266167,0.092622],"genre_scores_gemma":[0.9405663,0.00045857023,0.04638607,0.00013839739,0.00019214282,0.00015904882,0.00081822847,0.000048149723,0.011233001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985044,0.0004058887,0.00011796432,0.00031264545,0.00047156488,0.0001875056],"domain_scores_gemma":[0.9958949,0.0019292984,0.0005527825,0.00047418728,0.0006348384,0.0005140347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015078491,0.000397115,0.0004442876,0.0025854844,0.0018144222,0.0024657687,0.00059565535,0.00048936775,0.0027915358],"category_scores_gemma":[0.0046864557,0.0005761187,0.0005988625,0.0016607123,0.002171867,0.004140282,0.0019937968,0.0013423598,0.0003638309],"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.000044804834,0.000014252049,0.0009305579,0.00004092491,0.000012440061,0.00016140427,0.00094809424,0.0022193426,0.0020355834,0.98647726,0.0005723249,0.0065429453],"study_design_scores_gemma":[0.000022481801,0.00008128656,0.0027869127,0.00005886237,0.000024945868,0.00043637407,0.0006693992,0.034179654,0.0026703125,0.9415139,0.017523067,0.00003283078],"about_ca_topic_score_codex":0.001168606,"about_ca_topic_score_gemma":0.0010438727,"teacher_disagreement_score":0.0027915358,"about_ca_system_score_codex":0.001797195,"about_ca_system_score_gemma":0.00038494696,"threshold_uncertainty_score":0.0130396485},"labels":[],"label_agreement":null},{"id":"W4413184403","doi":"10.55016/ojs/cdm.v8i1.62120","title":"An improved bound on the number of point-surface incidences in three dimensions","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Defense Science and Engineering Graduate; U.S. Department of Defense","keywords":"Mathematics; Combinatorics; Point (geometry); Surface (topology); Geometry","score_opus":0.014971908942121701,"score_gpt":0.29572869700788385,"score_spread":0.28075678806576215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184403","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.4693432,0.0015811855,0.4899731,0.00082816003,0.00014503761,0.000065295506,0.0004841273,0.0011706197,0.036409333],"genre_scores_gemma":[0.9051455,0.00067372253,0.08807,0.00015052194,0.00006582348,0.00008776099,0.0004114862,0.00016662847,0.0052285427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862945,0.000211434,0.000094531184,0.00023532548,0.00049898925,0.0003302239],"domain_scores_gemma":[0.9958515,0.0021822422,0.00037392732,0.0008486633,0.0003696499,0.0003738977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014345435,0.00091137976,0.0010332095,0.0012954201,0.0008656444,0.001732064,0.0015881555,0.00077177625,0.004399605],"category_scores_gemma":[0.0059219,0.0005249027,0.0010797776,0.0010460907,0.0018851327,0.0029084522,0.003831271,0.0022697905,0.0009341184],"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.0011663539,0.00018746768,0.012396872,0.0006467764,0.00012832435,0.0006232868,0.00096022955,0.20946981,0.07201246,0.5850293,0.0071682557,0.110210836],"study_design_scores_gemma":[0.00008413866,0.0002958406,0.00572291,0.000089200286,0.000106624466,0.0005718712,0.00030292833,0.64368415,0.040674027,0.29684895,0.011497639,0.00012183785],"about_ca_topic_score_codex":0.002253339,"about_ca_topic_score_gemma":0.0026783096,"teacher_disagreement_score":0.004399605,"about_ca_system_score_codex":0.0013493116,"about_ca_system_score_gemma":0.0007455105,"threshold_uncertainty_score":0.014718115},"labels":[],"label_agreement":null},{"id":"W4413184431","doi":"10.55016/ojs/cdm.v8i1.62128","title":"Quasi--Hermitian varieties in PG(r,q^2), q even","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hermitian matrix; Combinatorics; Pure mathematics","score_opus":0.01733721951035055,"score_gpt":0.3240131942493804,"score_spread":0.30667597473902986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184431","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.6060058,0.003006886,0.15229385,0.0018577484,0.00093463133,0.00009356774,0.00046837755,0.00049711374,0.234842],"genre_scores_gemma":[0.9649142,0.00039916573,0.013206829,0.00018441674,0.00018987035,0.000023503066,0.00016096116,0.000060949413,0.020860031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997093,0.00009903271,0.000011805256,0.00005262262,0.00007403039,0.000053173757],"domain_scores_gemma":[0.9997205,0.00006791388,0.000052270636,0.00003607615,0.00004951188,0.00007375173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028067353,0.00041110162,0.0003073147,0.0009221951,0.000973502,0.0017605997,0.00037585062,0.00031198937,0.0055518122],"category_scores_gemma":[0.00044806287,0.00016747635,0.00025407184,0.0007025037,0.0017652981,0.0018393648,0.0010280195,0.0009962897,0.0005364597],"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.000021559455,0.0000039128417,0.00015305515,0.000016413165,0.0000024256724,0.000116071904,0.00015325144,0.0002487161,0.0009071063,0.99429965,0.00064249535,0.0034353256],"study_design_scores_gemma":[0.000031602052,0.00008689235,0.0016546823,0.00002189697,0.000007837708,0.00087729795,0.00036376552,0.004336351,0.0023497075,0.95963025,0.030606152,0.000033395776],"about_ca_topic_score_codex":0.0005002934,"about_ca_topic_score_gemma":0.00043556187,"teacher_disagreement_score":0.0055518122,"about_ca_system_score_codex":0.000391812,"about_ca_system_score_gemma":0.00021288247,"threshold_uncertainty_score":0.018572688},"labels":[],"label_agreement":null},{"id":"W4413184434","doi":"10.55016/ojs/cdm.v8i1.61907","title":"Computations in cubic function fields of characteristic three","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Computation; Function (biology); Combinatorics; Applied mathematics; Algorithm; Evolutionary biology; Biology","score_opus":0.019510685286102305,"score_gpt":0.292993977061359,"score_spread":0.2734832917752567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184434","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.7998864,0.0006930511,0.13042581,0.0008694428,0.00008684588,0.000052036434,0.0003074709,0.00084901316,0.06682987],"genre_scores_gemma":[0.9543546,0.00027451522,0.04011653,0.000057079567,0.000037445512,0.00001628211,0.00019241018,0.00014837131,0.004802834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971443,0.000032987078,0.000014359761,0.00003453477,0.000091406284,0.00011236103],"domain_scores_gemma":[0.9994031,0.00030742527,0.000052990796,0.00009336538,0.00009584702,0.00004716304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004858238,0.00043755627,0.0004578287,0.0012289797,0.0010996672,0.0016071122,0.00067230256,0.0002653803,0.004678897],"category_scores_gemma":[0.001993775,0.0001607612,0.0005241203,0.0016785006,0.0021163498,0.002695484,0.0011399965,0.0009237495,0.0004848001],"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.00031113235,0.000049720868,0.0032693562,0.00024763396,0.000015298647,0.0003382767,0.0013891716,0.017487388,0.0044923048,0.9083608,0.0027141823,0.061324783],"study_design_scores_gemma":[0.000041411502,0.00004883909,0.0014178058,0.000052841144,0.000020366073,0.0002317685,0.00039699007,0.040774673,0.0072926455,0.93385404,0.015832622,0.00003598631],"about_ca_topic_score_codex":0.0030154022,"about_ca_topic_score_gemma":0.003482655,"teacher_disagreement_score":0.004678897,"about_ca_system_score_codex":0.0018531899,"about_ca_system_score_gemma":0.00096843485,"threshold_uncertainty_score":0.015652478},"labels":[],"label_agreement":null},{"id":"W4413184960","doi":"10.55016/ojs/cdm.v6i1.62078","title":"Dual linear spaces generated by a non-Desarguesian configuration","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Art","score_opus":0.012466961325010253,"score_gpt":0.26383733401366455,"score_spread":0.2513703726886543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184960","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.58389807,0.0002524977,0.3522738,0.0002209243,0.000081736776,0.00006728012,0.00020317863,0.0003024259,0.06270019],"genre_scores_gemma":[0.92964035,0.000102134305,0.059856255,0.000040874314,0.000024565074,0.000041940904,0.00022273914,0.000082334926,0.009988705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995633,0.00011255755,0.000022109134,0.000099173994,0.00012582954,0.00007696936],"domain_scores_gemma":[0.99959,0.00010814958,0.00005724013,0.000086842716,0.00007379417,0.000084080675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040873064,0.00041988297,0.0002503101,0.00082800456,0.0007885165,0.0012787903,0.0005491415,0.00022246642,0.007346059],"category_scores_gemma":[0.0011500962,0.00026340855,0.00040934264,0.00040234654,0.0017608595,0.0020619957,0.0017825223,0.0015222657,0.0007951235],"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.00010542123,0.00004694906,0.0011532524,0.000047678488,0.0000119504675,0.00029762505,0.00033652695,0.0041081896,0.006853417,0.9694612,0.0004584822,0.017119415],"study_design_scores_gemma":[0.00006436039,0.00020849785,0.0013825591,0.000033832588,0.00001922274,0.0005935752,0.0005499081,0.02710116,0.02965245,0.9159767,0.024376689,0.000041031944],"about_ca_topic_score_codex":0.0002853193,"about_ca_topic_score_gemma":0.00040812365,"teacher_disagreement_score":0.007346059,"about_ca_system_score_codex":0.00053138455,"about_ca_system_score_gemma":0.00028646272,"threshold_uncertainty_score":0.024575055},"labels":[],"label_agreement":null},{"id":"W4413184961","doi":"10.55016/ojs/cdm.v6i1.62018","title":"Coefficients of chromatic polynomials and tension polynomials","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Mathematics; Chromatic scale; Combinatorics; Orthogonal polynomials; Difference polynomials","score_opus":0.01823574874700167,"score_gpt":0.2860671981192674,"score_spread":0.2678314493722657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184961","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.88214666,0.0004578395,0.09571826,0.00022767103,0.0001185587,0.000030753294,0.00031236923,0.00023975226,0.020748211],"genre_scores_gemma":[0.9913818,0.0002211406,0.0051096627,0.000017044566,0.00004911145,0.000013382389,0.00015557137,0.00008444437,0.0029677798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996517,0.00006098928,0.000009770362,0.000064597276,0.00011505226,0.00009796715],"domain_scores_gemma":[0.99852246,0.00069346285,0.00019087114,0.00016448788,0.00022558878,0.0002030697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004292588,0.00061155675,0.00030588912,0.002233631,0.00044361176,0.001060107,0.0007925029,0.00040927532,0.004471455],"category_scores_gemma":[0.00423708,0.00016508308,0.00041722588,0.0012806931,0.0012970516,0.0021705725,0.00084539247,0.0010443691,0.00044195677],"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.0005018096,0.00016924294,0.022485405,0.0005256898,0.00012212011,0.0008205796,0.001082705,0.06892818,0.069542505,0.7577276,0.0035890802,0.074505016],"study_design_scores_gemma":[0.000041066276,0.00014143923,0.018975453,0.000116785726,0.00010621158,0.0012209137,0.00070709805,0.3365133,0.04005286,0.5951241,0.006867057,0.00013379338],"about_ca_topic_score_codex":0.0009049325,"about_ca_topic_score_gemma":0.0008647606,"teacher_disagreement_score":0.004471455,"about_ca_system_score_codex":0.00056353863,"about_ca_system_score_gemma":0.0003636334,"threshold_uncertainty_score":0.014958501},"labels":[],"label_agreement":null},{"id":"W4413184967","doi":"10.55016/ojs/cdm.v6i1.62094","title":"Partially critical tournaments and partially critical supports","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.09823530041768298,"score_gpt":0.4256145755361205,"score_spread":0.3273792751184375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184967","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.85746783,0.0010531046,0.101020604,0.00061186665,0.000097150376,0.00008166687,0.0013082897,0.0002567473,0.038102735],"genre_scores_gemma":[0.98115015,0.00020150021,0.012290251,0.00006504379,0.000093682094,0.0000617251,0.00087888044,0.000030319334,0.0052284976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992143,0.00011715511,0.000053604384,0.00024329266,0.00018060158,0.00019107755],"domain_scores_gemma":[0.99750817,0.0008325562,0.0005060775,0.0002712506,0.0003106145,0.0005713457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046300367,0.00046122365,0.00047010847,0.0013124308,0.0012213239,0.0023349847,0.0006099824,0.0005033099,0.006643186],"category_scores_gemma":[0.0029440976,0.00031871066,0.0006483825,0.0010866352,0.0015769762,0.0018218126,0.0011965608,0.0009599915,0.00036314892],"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.00037491292,0.00010476127,0.007504687,0.00013699889,0.00007403184,0.0005776803,0.0008919548,0.015077039,0.005577669,0.9323796,0.0028146575,0.034486085],"study_design_scores_gemma":[0.00012307975,0.00032637856,0.006015012,0.00008228614,0.000053464093,0.0009309319,0.0007246493,0.047202084,0.003509747,0.91840446,0.02257426,0.000053741056],"about_ca_topic_score_codex":0.0011689122,"about_ca_topic_score_gemma":0.0010225524,"teacher_disagreement_score":0.006643186,"about_ca_system_score_codex":0.0009149358,"about_ca_system_score_gemma":0.00045784874,"threshold_uncertainty_score":0.022223651},"labels":[],"label_agreement":null},{"id":"W4413184999","doi":"10.55016/ojs/cdm.v6i1.61918","title":"On a generalization of the Blaschke-Lebesgue theorem for disk-polygons","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Blaschke product; Combinatorics; Lebesgue integration; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.05375632978043507,"score_gpt":0.32758599799074123,"score_spread":0.2738296682103062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184999","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.06574642,0.0061022267,0.82075304,0.0043765013,0.0008446759,0.00008714908,0.00036807207,0.0002724236,0.10144955],"genre_scores_gemma":[0.79549044,0.009277856,0.15107264,0.0023630164,0.0019188959,0.00021602046,0.00063504174,0.00034934244,0.0386768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887854,0.00031982796,0.00003768776,0.00021285417,0.000408506,0.00014242704],"domain_scores_gemma":[0.99662495,0.0018817075,0.00024571258,0.00032722723,0.00063247216,0.0002878606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020212047,0.00082787086,0.000943572,0.0018233168,0.0013094124,0.0020141092,0.0013526633,0.0011946054,0.005876905],"category_scores_gemma":[0.008483534,0.00030239453,0.0012815117,0.0011909776,0.0034470882,0.0057145385,0.0031320208,0.0036486797,0.0011053608],"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.000039360842,0.000020926725,0.00040995033,0.0001205169,0.000016201637,0.00024726056,0.00016753894,0.008368495,0.0013986658,0.9738782,0.003588363,0.011744568],"study_design_scores_gemma":[0.000019903264,0.000062980434,0.00068650744,0.00007470165,0.000018586697,0.00042034654,0.00013958674,0.061611976,0.0012112932,0.9086585,0.027064864,0.000030774434],"about_ca_topic_score_codex":0.0018434655,"about_ca_topic_score_gemma":0.00087850477,"teacher_disagreement_score":0.005876905,"about_ca_system_score_codex":0.0012490276,"about_ca_system_score_gemma":0.00058478006,"threshold_uncertainty_score":0.019660175},"labels":[],"label_agreement":null},{"id":"W4413185004","doi":"10.55016/ojs/cdm.v6i1.62057","title":"Cones of partial metrics","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Differential Geometry Research","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03872418803701318,"score_gpt":0.33649020499380505,"score_spread":0.2977660169567919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413185004","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.6587227,0.0027950543,0.26995528,0.00048590085,0.0001165496,0.00009675385,0.0019465453,0.00017210824,0.06570922],"genre_scores_gemma":[0.9448116,0.0010737574,0.043168265,0.00006332616,0.0001510291,0.00008481908,0.0012617137,0.000040094445,0.009345422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989963,0.00021856361,0.00006530367,0.0001695712,0.00043734466,0.00011300456],"domain_scores_gemma":[0.9983359,0.00051443337,0.0002626985,0.0001304658,0.00041924033,0.00033725335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079782703,0.0006233571,0.0004728159,0.001739987,0.0007200097,0.0020925435,0.00048702356,0.0002634864,0.0031640518],"category_scores_gemma":[0.003036836,0.00024717042,0.00046968943,0.0012199241,0.0017663983,0.0018728266,0.0012227753,0.0007611234,0.00025889103],"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.0000417961,0.00000970036,0.001670929,0.00005563443,0.000012812721,0.00008286503,0.0002264055,0.005444672,0.0016026086,0.9746528,0.0013296176,0.014870171],"study_design_scores_gemma":[0.000016013226,0.00010301766,0.0054642344,0.000048291095,0.00001208707,0.0005324404,0.00037520085,0.048851464,0.0016582154,0.91987944,0.023034126,0.000025583424],"about_ca_topic_score_codex":0.001313961,"about_ca_topic_score_gemma":0.0010008052,"teacher_disagreement_score":0.0031640518,"about_ca_system_score_codex":0.00077169825,"about_ca_system_score_gemma":0.00043381154,"threshold_uncertainty_score":0.010584831},"labels":[],"label_agreement":null},{"id":"W4413185026","doi":"10.55016/ojs/cdm.v6i1.61977","title":"Option-closed games","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Mathematical economics","score_opus":0.10561705731949414,"score_gpt":0.39778226734596206,"score_spread":0.2921652100264679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413185026","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.1470618,0.0012981317,0.58969,0.0027787588,0.0003192263,0.00024045446,0.0007238846,0.00023400309,0.25765368],"genre_scores_gemma":[0.9128451,0.000797559,0.04744794,0.00052024267,0.0002590809,0.00024502355,0.0004199551,0.00005084988,0.03741421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979081,0.00070955034,0.000083416584,0.0004123136,0.00057578523,0.00031083333],"domain_scores_gemma":[0.9980108,0.0009908576,0.00020043885,0.00017606403,0.00025288144,0.0003688761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012786223,0.0008068571,0.00070556527,0.00074290176,0.0012993718,0.0033761116,0.0018182512,0.0012999418,0.008928633],"category_scores_gemma":[0.0050789425,0.0002659961,0.000751325,0.0011774533,0.0033884528,0.0048708273,0.00213372,0.0023824174,0.0011985285],"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.000013207533,0.000017507185,0.00006332757,0.00001048801,0.000004580728,0.00004217568,0.00004253271,0.0026391246,0.00015570791,0.99350655,0.00065890746,0.002845887],"study_design_scores_gemma":[0.000017896808,0.000017556997,0.00004413046,0.000006547576,0.000003344972,0.00004929625,0.000029662477,0.014303519,0.00011438015,0.98118687,0.004220892,0.000005982538],"about_ca_topic_score_codex":0.0014412112,"about_ca_topic_score_gemma":0.0010977738,"teacher_disagreement_score":0.008928633,"about_ca_system_score_codex":0.0011780615,"about_ca_system_score_gemma":0.00081877765,"threshold_uncertainty_score":0.029869258},"labels":[],"label_agreement":null},{"id":"W4413185127","doi":"10.55016/ojs/cdm.v6i1.62011","title":"Adjusting a conjecture of Erdős","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Conjecture; Mathematics; Combinatorics","score_opus":0.07596645509067344,"score_gpt":0.3709482334577344,"score_spread":0.29498177836706096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413185127","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.17193502,0.014973954,0.17489995,0.2766493,0.010848902,0.00010554715,0.0015890392,0.0010885776,0.34790963],"genre_scores_gemma":[0.9196592,0.0048225787,0.019461395,0.018462814,0.0070919576,0.00014711084,0.00062474277,0.00042870798,0.02930158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99529654,0.0015745127,0.00015214918,0.0013179098,0.0011314052,0.00052747416],"domain_scores_gemma":[0.98370343,0.009341808,0.0012099487,0.0028614926,0.0017693669,0.0011139857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050725783,0.00077296497,0.0014764548,0.001391853,0.0041169715,0.00404653,0.0018231849,0.0033219936,0.011405681],"category_scores_gemma":[0.037370604,0.00057975895,0.0009831233,0.0019015707,0.008952987,0.017236758,0.0067529716,0.00801382,0.002539166],"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.00017347788,0.000041311945,0.0008512666,0.00008733378,0.000023944065,0.00007738754,0.00030515846,0.0015174145,0.00036114643,0.951052,0.03479831,0.010711172],"study_design_scores_gemma":[0.00003917678,0.000029110572,0.0002529777,0.00004018784,0.000011999995,0.00007368013,0.00013979232,0.0041826623,0.0002898145,0.97054696,0.024375373,0.000018218581],"about_ca_topic_score_codex":0.0017349395,"about_ca_topic_score_gemma":0.00086591544,"teacher_disagreement_score":0.011405681,"about_ca_system_score_codex":0.0029794346,"about_ca_system_score_gemma":0.0011804388,"threshold_uncertainty_score":0.038155794},"labels":[],"label_agreement":null},{"id":"W4413186058","doi":"10.55016/ojs/cdm.v6i2.62097","title":"Cards, permutations, and sums","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Winnipeg","keywords":"Combinatorics; Mathematics","score_opus":0.011680211440807824,"score_gpt":0.23045438583522634,"score_spread":0.2187741743944185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186058","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.11788077,0.006626808,0.4748286,0.006907077,0.0014618614,0.0001851729,0.00080141,0.000494747,0.39081353],"genre_scores_gemma":[0.74600434,0.0047177253,0.15063544,0.0018938165,0.0012599535,0.00032297763,0.00080815866,0.000300961,0.09405664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982851,0.00062002096,0.00011682915,0.00038761826,0.00034667682,0.00024372773],"domain_scores_gemma":[0.9987596,0.00057900505,0.00013198848,0.0002361106,0.00015719539,0.00013603337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009469353,0.0007282103,0.00066614844,0.0013074508,0.0023375056,0.0037590496,0.00085845304,0.0012646599,0.01487697],"category_scores_gemma":[0.0042447983,0.0004741835,0.0007030432,0.001863291,0.005489376,0.007369665,0.0026213387,0.0024592292,0.001987553],"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.000015164106,0.0000072174203,0.000081019934,0.000022673412,0.0000028946888,0.000021221435,0.00008322,0.0009152481,0.0001526414,0.98992807,0.0017693674,0.0070012813],"study_design_scores_gemma":[0.0000054789116,0.000010073783,0.000060932674,0.00001412132,0.000003826178,0.00004998924,0.000054108605,0.0022231196,0.00015240835,0.9846176,0.012802054,0.00000628542],"about_ca_topic_score_codex":0.0018380318,"about_ca_topic_score_gemma":0.0020253274,"teacher_disagreement_score":0.01487697,"about_ca_system_score_codex":0.0015409308,"about_ca_system_score_gemma":0.00096889905,"threshold_uncertainty_score":0.04976839},"labels":[],"label_agreement":null},{"id":"W4413186062","doi":"10.55016/ojs/cdm.v6i2.62104","title":"Strong d-collapsibility","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.025946684510748677,"score_gpt":0.29574599632323806,"score_spread":0.2697993118124894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186062","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.23038678,0.0033991043,0.61178225,0.002832387,0.0006333304,0.00020539375,0.0012635678,0.00040906173,0.14908805],"genre_scores_gemma":[0.9056318,0.0017923582,0.074479714,0.0010141843,0.00040593478,0.0003557617,0.00065537484,0.00009385466,0.01557098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965448,0.00040710252,0.0002786636,0.0008783143,0.0013267065,0.00056437234],"domain_scores_gemma":[0.9920806,0.0034914557,0.00077322865,0.0015812956,0.0012034739,0.0008699914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019968448,0.0011683656,0.0009497196,0.001930915,0.0023913726,0.0032764862,0.001954092,0.0010720376,0.006998395],"category_scores_gemma":[0.006458427,0.00065341155,0.0017212615,0.0015293566,0.0051709213,0.0074692536,0.013716707,0.0033556342,0.0010919585],"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.00008445306,0.00002630617,0.0010758316,0.00015036158,0.000044105116,0.00048711023,0.00033890145,0.0026813417,0.0039751204,0.98073006,0.0010990008,0.009307364],"study_design_scores_gemma":[0.000022899916,0.00009151095,0.0005982226,0.000057782643,0.00003404504,0.0009265294,0.00022660024,0.0068316828,0.0047039674,0.96961546,0.016856724,0.00003455025],"about_ca_topic_score_codex":0.0005163402,"about_ca_topic_score_gemma":0.00030920116,"teacher_disagreement_score":0.006998395,"about_ca_system_score_codex":0.0013554546,"about_ca_system_score_gemma":0.00079483946,"threshold_uncertainty_score":0.02341193},"labels":[],"label_agreement":null},{"id":"W4413186082","doi":"10.55016/ojs/cdm.v5i2.61945","title":"Polytopes derived from sporadic simple groups","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"BIM and Construction Integration","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Combinatorics; Mathematics; Polytope","score_opus":0.006054601706075786,"score_gpt":0.23153755397967007,"score_spread":0.2254829522735943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186082","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.77453357,0.0006274873,0.110958435,0.0001926381,0.00012689,0.00008975598,0.00022691583,0.00019057271,0.11305387],"genre_scores_gemma":[0.9665415,0.00029219524,0.012022082,0.00004826026,0.00007809603,0.000046090157,0.00031288833,0.000041616433,0.020617252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997222,0.000028940069,0.000015129053,0.000053556698,0.0001159816,0.00006418241],"domain_scores_gemma":[0.99974436,0.00006159456,0.0000703981,0.00004289034,0.00004129762,0.000039352042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015301062,0.00033270323,0.00028539874,0.0008700884,0.0009262573,0.0012010821,0.00022213449,0.00027406716,0.007258746],"category_scores_gemma":[0.00057923817,0.00018098115,0.0004659187,0.0004748943,0.001372172,0.0009278083,0.00089643436,0.0005565624,0.00085425156],"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.000111776935,0.000043659038,0.0016651205,0.0001649244,0.000025493306,0.0008958548,0.00064698095,0.008628137,0.014314927,0.95013535,0.0015446238,0.021823224],"study_design_scores_gemma":[0.000056094614,0.00030413797,0.005425539,0.00006337468,0.00004282497,0.0022516623,0.0013084036,0.024505952,0.012483321,0.89617074,0.057331532,0.00005639779],"about_ca_topic_score_codex":0.000528855,"about_ca_topic_score_gemma":0.00078006263,"teacher_disagreement_score":0.007258746,"about_ca_system_score_codex":0.00040579366,"about_ca_system_score_gemma":0.00031591512,"threshold_uncertainty_score":0.024282932},"labels":[],"label_agreement":null},{"id":"W4413186099","doi":"10.55016/ojs/cdm.v5i2.62020","title":"Freiman's theorem for solvable groups","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"John D. and Catherine T. MacArthur Foundation; National Science Foundation","keywords":"Mathematics; Combinatorics; Solvable group; Discrete mathematics; Abelian group","score_opus":0.01734946785670586,"score_gpt":0.32039881222157457,"score_spread":0.3030493443648687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186099","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.2775165,0.0064790864,0.360357,0.0060408977,0.00061335147,0.00013153306,0.0007014775,0.00060232024,0.34755796],"genre_scores_gemma":[0.92036086,0.0021810026,0.04237408,0.00056689396,0.00060305936,0.00018253928,0.00038840013,0.00010271087,0.033240285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925,0.00011183534,0.000045002747,0.00019258857,0.00028492184,0.00011564812],"domain_scores_gemma":[0.99895453,0.0004390692,0.000103279366,0.00018841165,0.00020144552,0.000113171314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096286775,0.00041166064,0.0006038564,0.0016223977,0.0018058962,0.0017969043,0.00085402164,0.00077409606,0.0042163967],"category_scores_gemma":[0.003149235,0.0002070815,0.00075181166,0.0009525352,0.0039023275,0.0058844592,0.0021421432,0.0015425443,0.0009255141],"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.0000072861776,0.0000033010688,0.000059973827,0.000015881575,0.0000023682926,0.000028461729,0.00014726451,0.00034876415,0.00036841645,0.99468815,0.000650445,0.0036796087],"study_design_scores_gemma":[0.00000533576,0.000007230197,0.000098449505,0.000006937382,0.0000024970786,0.000048076417,0.000043306325,0.0011851338,0.00035279398,0.9897398,0.00850493,0.0000055847886],"about_ca_topic_score_codex":0.0013806275,"about_ca_topic_score_gemma":0.000910301,"teacher_disagreement_score":0.0042163967,"about_ca_system_score_codex":0.0015643559,"about_ca_system_score_gemma":0.0005418182,"threshold_uncertainty_score":0.01410526},"labels":[],"label_agreement":null},{"id":"W4413186102","doi":"10.55016/ojs/cdm.v5i2.62068","title":"Least-squares approximation by a tree distance","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory)","score_opus":0.01513562904331142,"score_gpt":0.31808903524545673,"score_spread":0.30295340620214534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186102","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.006443653,0.00009127528,0.9928347,0.000044883353,0.000017588747,0.0000062595996,0.000026900581,0.00013149407,0.00040336273],"genre_scores_gemma":[0.24182777,0.00037548467,0.75408065,0.00008128407,0.000059980455,0.00008873875,0.00033808453,0.00016263567,0.002985306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932957,0.00022485126,0.00003095273,0.00015358697,0.00021173846,0.000049387236],"domain_scores_gemma":[0.99799585,0.0012770494,0.00014005521,0.00023545623,0.00029174346,0.000059927872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089704496,0.0007744882,0.00087142835,0.0007985126,0.00030435756,0.0009023718,0.0011261362,0.00084968394,0.0018614499],"category_scores_gemma":[0.007680114,0.0004156556,0.0005480656,0.0011237491,0.0007208418,0.0016511487,0.0008120516,0.0013408209,0.00084926386],"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.00012784971,0.00004609099,0.00076130143,0.00012575253,0.00006705177,0.00008046519,0.00010824326,0.86499625,0.0057778456,0.04322985,0.0018159546,0.08286345],"study_design_scores_gemma":[0.0000034278785,0.000010484817,0.00005894699,0.000003985961,0.0000025523755,0.000016791737,0.000007767913,0.9901541,0.000657384,0.008613697,0.00046627063,0.000004537253],"about_ca_topic_score_codex":0.0035010604,"about_ca_topic_score_gemma":0.0027058867,"teacher_disagreement_score":0.0035010604,"about_ca_system_score_codex":0.00053629326,"about_ca_system_score_gemma":0.00080697786,"threshold_uncertainty_score":0.0069613457},"labels":[],"label_agreement":null},{"id":"W4413186111","doi":"10.55016/ojs/cdm.v5i2.62764","title":"Generalized CPR-graphs and applications","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.012707080345668788,"score_gpt":0.31933515415495034,"score_spread":0.30662807380928153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186111","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.16994429,0.0011173314,0.47139272,0.0031942625,0.0006934989,0.00032017363,0.001344988,0.001419583,0.3505732],"genre_scores_gemma":[0.7752329,0.0012045231,0.16985875,0.0011176704,0.00036741575,0.00023097363,0.0019371839,0.0004389543,0.049611583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991615,0.00019581124,0.00004600437,0.00023091068,0.00024614565,0.00011966768],"domain_scores_gemma":[0.99867404,0.000344886,0.00014818592,0.0003221896,0.0003463688,0.00016440511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056551304,0.00051687297,0.0004475163,0.0010690347,0.0012937197,0.0016148008,0.000886045,0.0009584018,0.016407749],"category_scores_gemma":[0.0025770036,0.0003288149,0.00088226,0.0010588933,0.0017155347,0.0021349601,0.0017307634,0.0020790119,0.0021093294],"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.00001572841,0.000013615597,0.00017062329,0.00005163284,0.0000046561163,0.00013409319,0.00006997692,0.003819481,0.0017785509,0.9816591,0.0021488732,0.010133728],"study_design_scores_gemma":[0.000014101999,0.000025609168,0.000241891,0.00003431032,0.000008425451,0.00032158566,0.00015541096,0.014407337,0.0020583316,0.95850176,0.024212506,0.00001878339],"about_ca_topic_score_codex":0.002004741,"about_ca_topic_score_gemma":0.0019306798,"teacher_disagreement_score":0.016407749,"about_ca_system_score_codex":0.0011711775,"about_ca_system_score_gemma":0.0007756937,"threshold_uncertainty_score":0.05488944},"labels":[],"label_agreement":null},{"id":"W4413186118","doi":"10.55016/ojs/cdm.v5i2.62030","title":"On the Parity of p(n,3) and p_Ψ(n,3)","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Parity (physics); Combinatorics; Physics","score_opus":0.02669140672475212,"score_gpt":0.34633851742805116,"score_spread":0.31964711070329904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186118","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.76027733,0.001061676,0.13037047,0.0041355407,0.00071086903,0.00006368987,0.00059742347,0.00015634934,0.10262676],"genre_scores_gemma":[0.970721,0.00083294214,0.018782353,0.00048108757,0.0008836453,0.00014638937,0.0003753711,0.00010773918,0.0076695164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997177,0.0008559002,0.000158785,0.00051263126,0.000640083,0.0006554565],"domain_scores_gemma":[0.9878307,0.0075428234,0.0014250401,0.0011738763,0.0008931878,0.0011343914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041427677,0.00080141396,0.0009434673,0.0019799345,0.0021149404,0.003927695,0.0013303751,0.0013120276,0.0061740745],"category_scores_gemma":[0.015365903,0.00043478547,0.0005613024,0.0014079678,0.007407763,0.007701064,0.0037720397,0.002606591,0.0011461672],"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.00029707878,0.0000399254,0.002187959,0.000041700754,0.000009448296,0.00022856765,0.00050476595,0.001108469,0.0028533775,0.9770831,0.0013159962,0.01432969],"study_design_scores_gemma":[0.00003660858,0.00006080348,0.0016338547,0.000035318517,0.000014947015,0.00033365778,0.00018953426,0.008653066,0.0018935936,0.98380685,0.003309116,0.000032730517],"about_ca_topic_score_codex":0.00048073696,"about_ca_topic_score_gemma":0.00031368402,"teacher_disagreement_score":0.0061740745,"about_ca_system_score_codex":0.0010462193,"about_ca_system_score_gemma":0.000811192,"threshold_uncertainty_score":0.021909297},"labels":[],"label_agreement":null},{"id":"W4413186147","doi":"10.55016/ojs/cdm.v6i2.62106","title":"Computation of atomic fibers of Z-linear maps","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computation; Mathematics; Combinatorics; Algorithm","score_opus":0.04980807729592444,"score_gpt":0.3482556195861984,"score_spread":0.2984475422902739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186147","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.42549118,0.00012482423,0.5669819,0.00009956412,0.000021529295,0.0000514186,0.00029951002,0.0011504602,0.0057796137],"genre_scores_gemma":[0.67852664,0.000115363364,0.3174565,0.000019414874,0.000021704967,0.0000610184,0.00072024274,0.0001726198,0.0029065036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997274,0.000030074963,0.000019308463,0.00006587408,0.00008470717,0.00007257062],"domain_scores_gemma":[0.9992949,0.00027780698,0.00008046614,0.00013900903,0.00015071483,0.000057172394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031725553,0.00046098762,0.0004906144,0.0008949545,0.00069954176,0.00096930814,0.00060468086,0.00037173947,0.0045600426],"category_scores_gemma":[0.0017664941,0.00035319454,0.00042832294,0.0005361328,0.0006988895,0.0019174389,0.0013526505,0.00047000338,0.0007492726],"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.0013859606,0.00017027264,0.019892285,0.00047324577,0.00010846312,0.0009445406,0.0014846601,0.104569785,0.05722999,0.42620894,0.00533763,0.38219425],"study_design_scores_gemma":[0.00007617733,0.00017564996,0.0028516906,0.00005466921,0.000047819678,0.00034954693,0.0003990326,0.6118238,0.05601968,0.31955558,0.008601565,0.00004474345],"about_ca_topic_score_codex":0.0008650561,"about_ca_topic_score_gemma":0.0015760334,"teacher_disagreement_score":0.0045600426,"about_ca_system_score_codex":0.00045331707,"about_ca_system_score_gemma":0.0005101998,"threshold_uncertainty_score":0.015254915},"labels":[],"label_agreement":null},{"id":"W4413186177","doi":"10.55016/ojs/cdm.v5i2.62061","title":"Bounds and constructions for n-e.c. tournaments","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Mitacs","keywords":"Combinatorics; Mathematics","score_opus":0.013908649085259137,"score_gpt":0.33539140497317166,"score_spread":0.32148275588791253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186177","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.24486491,0.0013313774,0.7020415,0.0010365071,0.00013294698,0.00017897511,0.00055870693,0.0009957069,0.048859328],"genre_scores_gemma":[0.8475861,0.00054838543,0.14555469,0.0003013321,0.00008955297,0.00043240757,0.00065178954,0.0001973495,0.0046384213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975484,0.0006888937,0.00018977134,0.00051863707,0.0006432102,0.0004110225],"domain_scores_gemma":[0.989019,0.0075754193,0.00078826863,0.0014607225,0.00060096243,0.0005556929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002416666,0.0006531327,0.0006504838,0.001259056,0.0015515418,0.0025439954,0.0017197022,0.0011408775,0.0054300427],"category_scores_gemma":[0.012061987,0.0005926772,0.001224105,0.0013598081,0.0017337581,0.0022965807,0.0018772001,0.001964036,0.00054723775],"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.00023628896,0.00016315318,0.0019672054,0.00018972145,0.00004750347,0.00015278517,0.00026389217,0.05275836,0.009442798,0.89788836,0.003445072,0.033444963],"study_design_scores_gemma":[0.000112596834,0.00023869461,0.0014162563,0.00009014614,0.00008610964,0.00046894196,0.00008475168,0.21566513,0.013343347,0.7547611,0.013666623,0.00006626225],"about_ca_topic_score_codex":0.00067306863,"about_ca_topic_score_gemma":0.0009869016,"teacher_disagreement_score":0.0054300427,"about_ca_system_score_codex":0.0020797877,"about_ca_system_score_gemma":0.0007586986,"threshold_uncertainty_score":0.01816529},"labels":[],"label_agreement":null},{"id":"W4413186186","doi":"10.55016/ojs/cdm.v5i2.62064","title":"Homotopy types of independence complexes of forests","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homotopy; Independence (probability theory); Combinatorics; Pure mathematics; Statistics","score_opus":0.012441116789803074,"score_gpt":0.29295498788831076,"score_spread":0.28051387109850767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186186","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.7329052,0.0009709539,0.15009066,0.00079190143,0.0002465064,0.00013630922,0.00085778284,0.00031400655,0.113686725],"genre_scores_gemma":[0.9685845,0.0004118256,0.016188106,0.0001272272,0.00018162913,0.00009676869,0.00085895247,0.00009483965,0.013456154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977202,0.000258611,0.00016712617,0.00043238455,0.0010592145,0.0003624099],"domain_scores_gemma":[0.9926629,0.003297735,0.0006829062,0.0009084612,0.0012238726,0.0012241924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015801657,0.00047111174,0.0005253507,0.0058066705,0.00259103,0.004025314,0.0010703289,0.0007895906,0.008401652],"category_scores_gemma":[0.007479919,0.0009048557,0.00082095515,0.0019674243,0.0034224228,0.007606744,0.0038570245,0.0026346683,0.0007649573],"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.0000830591,0.00004204256,0.0037817203,0.00004185258,0.00002029837,0.00031831433,0.0010298012,0.0011437533,0.0032132743,0.9767437,0.0013570152,0.012225181],"study_design_scores_gemma":[0.00003003464,0.00003513033,0.0060981177,0.000035380817,0.000039386454,0.00070842594,0.0005857231,0.009275594,0.00645455,0.9617762,0.014906532,0.00005498724],"about_ca_topic_score_codex":0.001936162,"about_ca_topic_score_gemma":0.0015102344,"teacher_disagreement_score":0.008401652,"about_ca_system_score_codex":0.0015051407,"about_ca_system_score_gemma":0.0005479901,"threshold_uncertainty_score":0.028106332},"labels":[],"label_agreement":null},{"id":"W4413186187","doi":"10.55016/ojs/cdm.v6i2.62092","title":"A bijection between noncrossing and nonnesting partitions of types A, B and C","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centro de Matemática, Universidade de Coimbra; Universidade de Coimbra; Universität Wien","keywords":"Bijection; Combinatorics; Mathematics; Type (biology); Biology; Paleontology","score_opus":0.05411428008197684,"score_gpt":0.3264523449599007,"score_spread":0.2723380648779239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186187","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.5317476,0.0021920616,0.2541573,0.0013358559,0.0015078454,0.00021362006,0.0005114439,0.0006708191,0.20766357],"genre_scores_gemma":[0.8841417,0.0014236901,0.073954664,0.00073767785,0.00058700284,0.0002909519,0.0004737718,0.0002405586,0.038150083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989127,0.00031536742,0.00008764004,0.00026322555,0.00028868954,0.00013241898],"domain_scores_gemma":[0.99791616,0.000743869,0.00027481833,0.00032008896,0.00037770768,0.00036734022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010083527,0.0004417782,0.00034041164,0.0018605368,0.0018206597,0.0027961032,0.0006020247,0.00097213767,0.00506502],"category_scores_gemma":[0.0028091138,0.00047394852,0.00051474705,0.0011181809,0.0025686827,0.0040700682,0.001399705,0.0015959541,0.00094153255],"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.00006988648,0.000054340824,0.0006854832,0.00007004449,0.000009053385,0.00013619084,0.0005771304,0.00044597182,0.005799271,0.9711222,0.0021236637,0.01890685],"study_design_scores_gemma":[0.00005773213,0.0001062223,0.0024625494,0.00007687541,0.0000332218,0.001793784,0.00065206306,0.004848041,0.006616289,0.9393856,0.04389187,0.00007580998],"about_ca_topic_score_codex":0.00041617776,"about_ca_topic_score_gemma":0.000608215,"teacher_disagreement_score":0.00506502,"about_ca_system_score_codex":0.00066643674,"about_ca_system_score_gemma":0.00044345975,"threshold_uncertainty_score":0.01694417},"labels":[],"label_agreement":null},{"id":"W4413186190","doi":"10.55016/ojs/cdm.v5i2.61990","title":"Signed b-matchings and b-edge covers of strong product graphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Discrete mathematics; Computer science; Geometry; Telecommunications","score_opus":0.01596193014654573,"score_gpt":0.290743395297669,"score_spread":0.2747814651511233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186190","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.89350766,0.0005709105,0.08900956,0.00026122466,0.000033333596,0.000025242032,0.00018162082,0.000105371815,0.01630496],"genre_scores_gemma":[0.9874041,0.00029182495,0.010323641,0.000048090107,0.00004098544,0.000032423854,0.0001376819,0.000021705739,0.0016996135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940133,0.00014930978,0.00003440694,0.00013889119,0.00018606782,0.00008993997],"domain_scores_gemma":[0.99651474,0.0019189654,0.00077240146,0.0002426717,0.00020242573,0.000348782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537707,0.0004563292,0.00047367025,0.0014809156,0.00078719284,0.0015082296,0.00051869295,0.0007177021,0.003705242],"category_scores_gemma":[0.0039668474,0.00034547792,0.0003656543,0.0011817924,0.0014640981,0.0046217414,0.0012962914,0.00070265273,0.00037104535],"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.00038044283,0.00007620526,0.005603551,0.00021804532,0.000051388983,0.00029829278,0.00042176695,0.016030919,0.019981686,0.9228,0.0012805827,0.032857146],"study_design_scores_gemma":[0.00004213299,0.00017033589,0.0043082736,0.000043035674,0.00004786726,0.00082790427,0.00027064368,0.05864427,0.012412012,0.9168704,0.0063223154,0.000040847055],"about_ca_topic_score_codex":0.00019287264,"about_ca_topic_score_gemma":0.00017604309,"teacher_disagreement_score":0.003705242,"about_ca_system_score_codex":0.00047997662,"about_ca_system_score_gemma":0.00021041006,"threshold_uncertainty_score":0.012395263},"labels":[],"label_agreement":null},{"id":"W4413186192","doi":"10.55016/ojs/cdm.v6i2.62095","title":"A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.014953510623808203,"score_gpt":0.2223248306890903,"score_spread":0.2073713200652821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186192","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.15195902,0.00065894163,0.802183,0.0052542174,0.00039991422,0.00038271752,0.0007573892,0.00066627236,0.03773855],"genre_scores_gemma":[0.817748,0.0007839591,0.16928032,0.0014686735,0.00058442255,0.0004176287,0.0010174267,0.00021964565,0.00847995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99699247,0.0007188051,0.00016075232,0.0007583021,0.0008318413,0.00053776545],"domain_scores_gemma":[0.9779554,0.017348902,0.001242969,0.0017305467,0.0007468942,0.00097517663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018621092,0.00093167677,0.001312655,0.00093208614,0.002374609,0.0039413217,0.0030791028,0.0018379575,0.015631003],"category_scores_gemma":[0.012956707,0.00084175915,0.0026487203,0.0015794903,0.004214105,0.009803399,0.004720486,0.0075000674,0.0007490384],"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.00023152296,0.00026975776,0.0017406185,0.00046359666,0.00013806303,0.0005171311,0.0007441218,0.048986576,0.0066191615,0.9080156,0.007915469,0.024358466],"study_design_scores_gemma":[0.00014161802,0.0001354916,0.0007729254,0.000037425398,0.00008442602,0.00038145226,0.00016716545,0.08587166,0.0033733668,0.90116256,0.007812153,0.0000597844],"about_ca_topic_score_codex":0.002826271,"about_ca_topic_score_gemma":0.0024138475,"teacher_disagreement_score":0.015631003,"about_ca_system_score_codex":0.0029883662,"about_ca_system_score_gemma":0.0018733641,"threshold_uncertainty_score":0.052290857},"labels":[],"label_agreement":null},{"id":"W4413186200","doi":"10.55016/ojs/cdm.v5i2.62045","title":"Some Ramsey theorems for finite n-colorable and n-chromatic graphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Université de Neuchâtel","keywords":"Mathematics; Combinatorics; Chromatic scale; Ramsey theory; Discrete mathematics","score_opus":0.01642191983257651,"score_gpt":0.329794284250865,"score_spread":0.3133723644182885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186200","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.5233389,0.0049661123,0.37711406,0.0034607959,0.00033829422,0.000112157104,0.00095684576,0.0009007407,0.08881208],"genre_scores_gemma":[0.9484765,0.0018578016,0.042289376,0.00066425157,0.00025878922,0.00011888302,0.00040488373,0.00008998193,0.0058394517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961394,0.00010340858,0.000022163433,0.00012399578,0.000068752786,0.000067757195],"domain_scores_gemma":[0.99636877,0.0024547076,0.00033075135,0.00031769727,0.00023773558,0.00029027258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017742097,0.0006377423,0.0005725768,0.0013686572,0.0012121791,0.0014132551,0.0011526803,0.0006375663,0.003337738],"category_scores_gemma":[0.0045912126,0.0004553176,0.0011633697,0.00092202955,0.0020077273,0.0043011047,0.0015208719,0.0018406773,0.00028870825],"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.00007944927,0.00004097772,0.0010915545,0.00012067383,0.000027489503,0.0001298908,0.0005138285,0.004158373,0.0019826258,0.9771778,0.003532408,0.011145041],"study_design_scores_gemma":[0.000027137105,0.00005131549,0.001090486,0.00004118065,0.000043844015,0.00029409962,0.00019512014,0.021509716,0.0020016844,0.9696843,0.005036106,0.000024971612],"about_ca_topic_score_codex":0.001616489,"about_ca_topic_score_gemma":0.0019299934,"teacher_disagreement_score":0.003337738,"about_ca_system_score_codex":0.0016482822,"about_ca_system_score_gemma":0.0005656796,"threshold_uncertainty_score":0.0119591355},"labels":[],"label_agreement":null},{"id":"W4413186243","doi":"10.55016/ojs/cdm.v6i2.62059","title":"A variant of the bipartite relation theorem and its application to clique graphs","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Clique; Bipartite graph; Clique graph; Robertson–Seymour theorem; Discrete mathematics; Cograph; Relation (database); Chordal graph; Graph; 1-planar graph; Line graph; Computer science; Voltage graph","score_opus":0.02114390511315031,"score_gpt":0.29782461520389014,"score_spread":0.27668071009073986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186243","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.3917106,0.0018148515,0.4753858,0.0035136181,0.00058584264,0.000071778624,0.00023619086,0.0002759816,0.12640534],"genre_scores_gemma":[0.9550087,0.0007413317,0.029187595,0.00048658423,0.0003701166,0.000045415298,0.00015631718,0.000093497525,0.013910507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999468,0.00017027206,0.000017649263,0.00012287816,0.00012921845,0.00009193166],"domain_scores_gemma":[0.99907494,0.00040628563,0.00010658407,0.000108485256,0.000120824196,0.00018294468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092784676,0.00029983924,0.0003688037,0.00166564,0.0014762292,0.0013735965,0.0009347987,0.0009736926,0.0060746507],"category_scores_gemma":[0.0027797811,0.00020261396,0.0005455784,0.0013715795,0.0025969269,0.0036390228,0.0029025162,0.0013269072,0.00052762195],"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.0000055071782,0.000004777338,0.00015301461,0.000012892822,0.0000018668827,0.000048598664,0.00010620949,0.00041282712,0.000523413,0.9964205,0.00029392634,0.0020165748],"study_design_scores_gemma":[0.000008245037,0.00002538183,0.00041770315,0.0000118067555,0.000005628867,0.00018291168,0.00019724407,0.006963359,0.0005873357,0.9864807,0.0051067728,0.00001301008],"about_ca_topic_score_codex":0.002049132,"about_ca_topic_score_gemma":0.0015291608,"teacher_disagreement_score":0.0060746507,"about_ca_system_score_codex":0.0007351057,"about_ca_system_score_gemma":0.00037262545,"threshold_uncertainty_score":0.020321667},"labels":[],"label_agreement":null},{"id":"W4413186321","doi":"10.55016/ojs/cdm.v7i2.62161","title":"Distinguishing homomorphisms of infinite graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01777632943254971,"score_gpt":0.27833875989420526,"score_spread":0.26056243046165556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186321","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.73525363,0.0003002048,0.21950997,0.0006070361,0.00010360591,0.000042334545,0.0002788033,0.0007235884,0.04318084],"genre_scores_gemma":[0.97559345,0.00008570553,0.020423267,0.00009157319,0.000047454298,0.000028415814,0.00017978197,0.000059638758,0.0034907346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991186,0.00015154429,0.00004688395,0.00033744535,0.00017323413,0.00017224801],"domain_scores_gemma":[0.9943651,0.0033076487,0.00039930077,0.0009196762,0.00035332394,0.00065484416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934391,0.00036882164,0.0003845288,0.0010365453,0.0015011079,0.001732872,0.0010809221,0.00050362735,0.004252004],"category_scores_gemma":[0.003184319,0.00036242572,0.00067353866,0.000645876,0.0026760853,0.0039071944,0.0027576433,0.0020669596,0.0003037103],"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.000109509936,0.000051413084,0.0020144621,0.00007017062,0.000012457651,0.00013453943,0.00050539424,0.003965119,0.010281382,0.9710876,0.00069480785,0.011073284],"study_design_scores_gemma":[0.000021958456,0.000064979846,0.0011148932,0.00001862334,0.000023431614,0.00033891018,0.00018817555,0.021716798,0.010104422,0.9602173,0.0061624297,0.000027992348],"about_ca_topic_score_codex":0.0005987196,"about_ca_topic_score_gemma":0.0009148782,"teacher_disagreement_score":0.004252004,"about_ca_system_score_codex":0.0014612561,"about_ca_system_score_gemma":0.00046706016,"threshold_uncertainty_score":0.01422441},"labels":[],"label_agreement":null},{"id":"W4413186330","doi":"10.55016/ojs/cdm.v7i2.62152","title":"Algorithms for classifying regular polytopes with a fixed automorphism group","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fédération Wallonie-Bruxelles","keywords":"Mathematics; Combinatorics; Polytope; Automorphism group; Group (periodic table); Automorphism; Outer automorphism group; Discrete mathematics","score_opus":0.01561005595092591,"score_gpt":0.2570172356043343,"score_spread":0.2414071796534084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186330","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.04574583,0.00024598156,0.9478427,0.00013100287,0.00006204258,0.00021365176,0.00033947898,0.0014409205,0.0039784326],"genre_scores_gemma":[0.12000302,0.00032669937,0.8733167,0.0000557691,0.00006638876,0.00027395305,0.002840158,0.00033999438,0.00277727],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844545,0.00025786523,0.00015425411,0.0005210139,0.00041398517,0.00020745581],"domain_scores_gemma":[0.9948725,0.0026233762,0.00032128778,0.0013831232,0.0006382497,0.00016138687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010935669,0.0008672382,0.0010771157,0.0026255683,0.0012909909,0.0027037275,0.0017295528,0.0010339377,0.0081426315],"category_scores_gemma":[0.0059564733,0.0005214638,0.001404827,0.0023155194,0.0013084207,0.0046070786,0.001770207,0.0017964859,0.0019533834],"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.00058420177,0.00036280332,0.0043292884,0.0008101701,0.00010832142,0.00015139961,0.00074308243,0.04725262,0.015184691,0.17661922,0.010263691,0.7435905],"study_design_scores_gemma":[0.00017141207,0.00038627224,0.0031351522,0.00014219989,0.00011140628,0.00070443243,0.0010280767,0.49778482,0.023243131,0.442478,0.030688468,0.0001266594],"about_ca_topic_score_codex":0.0013495261,"about_ca_topic_score_gemma":0.001575158,"teacher_disagreement_score":0.0081426315,"about_ca_system_score_codex":0.0009840871,"about_ca_system_score_gemma":0.0010760567,"threshold_uncertainty_score":0.0272398},"labels":[],"label_agreement":null},{"id":"W4413186338","doi":"10.55016/ojs/cdm.v7i2.62119","title":"A discrete Faà di Bruno's formula","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Universidade do Minho","keywords":"Mathematics; Combinatorics; Mathematical economics","score_opus":0.038036867905148396,"score_gpt":0.3495598248174457,"score_spread":0.3115229569122973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186338","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.04208185,0.0020560203,0.67469084,0.0050136778,0.0017550897,0.000066362845,0.00029246864,0.0003307505,0.27371296],"genre_scores_gemma":[0.68412054,0.0014100319,0.2292168,0.0026776646,0.0007930167,0.0001686962,0.00024187486,0.00042267086,0.08094871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994443,0.00009305419,0.000026424104,0.000117804855,0.00023461362,0.00008378021],"domain_scores_gemma":[0.99945635,0.00019414785,0.000029072797,0.00008613205,0.0001715741,0.00006270975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010528498,0.00040498015,0.0005841358,0.0012364638,0.0009063537,0.0014397674,0.0011516222,0.0010776222,0.0073261512],"category_scores_gemma":[0.003543968,0.00023152874,0.00076711696,0.00055253186,0.0026068748,0.0030012764,0.0015950083,0.0024892774,0.0011681814],"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.0000033624813,0.000002623545,0.00004270486,0.0000102667655,0.0000015964466,0.000017956276,0.0000333216,0.0002982615,0.00032815585,0.99532133,0.00059123937,0.0033492942],"study_design_scores_gemma":[0.000006667888,0.0000073456818,0.00008612606,0.000016219396,0.0000036514232,0.0000823012,0.000020147323,0.009328466,0.00065933296,0.97885484,0.010926184,0.000008703501],"about_ca_topic_score_codex":0.0016869876,"about_ca_topic_score_gemma":0.0012077781,"teacher_disagreement_score":0.0073261512,"about_ca_system_score_codex":0.0014545843,"about_ca_system_score_gemma":0.00052170415,"threshold_uncertainty_score":0.024508417},"labels":[],"label_agreement":null},{"id":"W4413186341","doi":"10.55016/ojs/cdm.v7i2.62052","title":"Some rigid moieties of homogeneous graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Homogeneous; Combinatorics; Mathematics","score_opus":0.00712342329979698,"score_gpt":0.23514631941352018,"score_spread":0.2280228961137232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186341","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.83330286,0.00030004804,0.075198136,0.0004689561,0.00007548385,0.000075262455,0.00038167916,0.00035140378,0.08984622],"genre_scores_gemma":[0.9793935,0.00017393097,0.0072637657,0.000119834236,0.00006547028,0.000043529002,0.00026925522,0.00008165893,0.012589092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956447,0.00007402926,0.000026863783,0.0001307106,0.00010014315,0.00010383441],"domain_scores_gemma":[0.9994105,0.00010644218,0.00014791485,0.00015529813,0.000044451503,0.00013532315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030193877,0.0003523321,0.00032994128,0.00097607647,0.0011019827,0.0012541721,0.000551216,0.0005020502,0.009243613],"category_scores_gemma":[0.0010491182,0.00032499278,0.0006476081,0.00052057556,0.0016765137,0.0024008343,0.002282345,0.0010927058,0.0011576539],"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.00006674603,0.000024326102,0.00043299908,0.0000311573,0.000010156124,0.00025350097,0.00052165025,0.0013572087,0.007293107,0.9846889,0.0004976594,0.004822486],"study_design_scores_gemma":[0.000046455814,0.00018115221,0.0026617928,0.000034687477,0.000045405293,0.00044875432,0.00066649774,0.014434949,0.010560763,0.9555562,0.015323302,0.00004002458],"about_ca_topic_score_codex":0.00067453727,"about_ca_topic_score_gemma":0.00059668015,"teacher_disagreement_score":0.009243613,"about_ca_system_score_codex":0.0006694528,"about_ca_system_score_gemma":0.00020983987,"threshold_uncertainty_score":0.03092295},"labels":[],"label_agreement":null},{"id":"W4413186344","doi":"10.55016/ojs/cdm.v7i2.61908","title":"Vertex decompositions of two-dimensional complexes and graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.016072123820208443,"score_gpt":0.3008052375639724,"score_spread":0.284733113743764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186344","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.73206043,0.0019913826,0.23972116,0.0014528708,0.00007933339,0.0001539384,0.0008237076,0.00023601644,0.023481097],"genre_scores_gemma":[0.9336927,0.0007162205,0.059621386,0.00013332807,0.00004479158,0.00012217498,0.0011443577,0.00005340984,0.004471623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989598,0.00022328853,0.000064584216,0.00027957794,0.00027907608,0.00019379414],"domain_scores_gemma":[0.995624,0.0025293757,0.0005888267,0.0004951807,0.0002911581,0.00047147193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059812726,0.0005633826,0.00065119716,0.001883573,0.001068119,0.003256959,0.0010497686,0.00095490366,0.0045447135],"category_scores_gemma":[0.004590668,0.00053068955,0.0007895804,0.0020956167,0.0025688745,0.0052856295,0.002131375,0.0019239251,0.00040414714],"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.00013446997,0.00010630747,0.0038491702,0.00019488207,0.00003415295,0.00032037022,0.00097078097,0.04204352,0.006224201,0.9176111,0.002315874,0.026195152],"study_design_scores_gemma":[0.000027113243,0.00003242469,0.0015080736,0.000043230713,0.00001581645,0.00036209027,0.00057220535,0.08767785,0.0030518319,0.90040433,0.0062756664,0.00002939908],"about_ca_topic_score_codex":0.0019060449,"about_ca_topic_score_gemma":0.0013450602,"teacher_disagreement_score":0.0045447135,"about_ca_system_score_codex":0.0014403557,"about_ca_system_score_gemma":0.00044590776,"threshold_uncertainty_score":0.015203536},"labels":[],"label_agreement":null},{"id":"W4413186378","doi":"10.55016/ojs/cdm.v7i2.62135","title":"Frobenius partition theoretic interpretations of some basic series identities","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Series (stratigraphy); Combinatorics","score_opus":0.021880266221267385,"score_gpt":0.33718385775176707,"score_spread":0.3153035915304997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186378","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.3665037,0.0012331478,0.16685396,0.0017066081,0.00084021786,0.000107026266,0.0002265463,0.00032112212,0.46220762],"genre_scores_gemma":[0.91922164,0.0007926199,0.036566168,0.0003368438,0.00039901256,0.00009000985,0.00012336396,0.00009866181,0.0423717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996074,0.000076086726,0.000020574404,0.000057575257,0.00013246131,0.000105852276],"domain_scores_gemma":[0.9996803,0.00007736651,0.000050655908,0.00007102286,0.00006466125,0.000056034736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006848423,0.00068595953,0.00046362643,0.0013808063,0.0013774649,0.002697609,0.0009380088,0.0008371063,0.0059263483],"category_scores_gemma":[0.0012329427,0.00022410078,0.0007774552,0.0008136856,0.003502771,0.004104363,0.001448939,0.0015599516,0.0009727793],"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.0000032094897,0.0000026494267,0.00003761745,0.0000059743797,6.420516e-7,0.000033676326,0.00012241278,0.00013558895,0.00031170904,0.9980357,0.00015711294,0.0011537339],"study_design_scores_gemma":[0.0000055285477,0.000008273318,0.00013948609,0.000012633049,0.000003396911,0.00014844294,0.00013222497,0.0010896812,0.0005852618,0.9918582,0.006008406,0.000008481113],"about_ca_topic_score_codex":0.0006302696,"about_ca_topic_score_gemma":0.00077317783,"teacher_disagreement_score":0.0059263483,"about_ca_system_score_codex":0.001112522,"about_ca_system_score_gemma":0.0005607105,"threshold_uncertainty_score":0.019825578},"labels":[],"label_agreement":null},{"id":"W4413186386","doi":"10.55016/ojs/cdm.v7i2.62130","title":"A continuous variant of the inverse Littlewood-Offord problem for quadratic forms","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Inverse; Quadratic equation; Geometry","score_opus":0.009092201562467931,"score_gpt":0.26784169735271873,"score_spread":0.2587494957902508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186386","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.09044536,0.0018728154,0.8781101,0.0031539116,0.00030771468,0.00008324639,0.0001983225,0.0001527482,0.025675751],"genre_scores_gemma":[0.87400126,0.0025570705,0.07854987,0.0011545626,0.0011876924,0.00024830864,0.00048032874,0.0003374012,0.04148348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983089,0.00062689,0.000079218094,0.00034152996,0.00043767583,0.00020575945],"domain_scores_gemma":[0.9915713,0.005272044,0.000798242,0.0005272071,0.00096055784,0.00087068067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004064731,0.0013262199,0.0014693947,0.002315362,0.0013115342,0.0030636599,0.0026468793,0.0027375396,0.005626681],"category_scores_gemma":[0.023674278,0.00069883815,0.0011058279,0.0012751101,0.005185795,0.005901113,0.0038829728,0.0031675475,0.0006452104],"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.000036931866,0.000022447677,0.00048417365,0.000084105646,0.000021975722,0.00013789674,0.00010001661,0.018000396,0.0010424922,0.9745594,0.0017316561,0.003778562],"study_design_scores_gemma":[0.000029448756,0.000066674074,0.00047430673,0.00005689252,0.000017327458,0.0003522893,0.00007595235,0.35450444,0.0011053495,0.6399174,0.0033570062,0.000042932887],"about_ca_topic_score_codex":0.0017675759,"about_ca_topic_score_gemma":0.00096887315,"teacher_disagreement_score":0.005626681,"about_ca_system_score_codex":0.0019286207,"about_ca_system_score_gemma":0.0010303196,"threshold_uncertainty_score":0.021496594},"labels":[],"label_agreement":null},{"id":"W4413186388","doi":"10.55016/ojs/cdm.v7i2.62146","title":"Tournaments with kernels by monochromatic paths","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Biology","score_opus":0.018384650141789576,"score_gpt":0.25268886806937596,"score_spread":0.23430421792758638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186388","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.87866586,0.00020277429,0.11260436,0.00008809209,0.00002712914,0.000042096966,0.00014554104,0.00018181339,0.008042317],"genre_scores_gemma":[0.9862278,0.00007126065,0.011233327,0.000027723067,0.000012530253,0.00002785199,0.000109467466,0.000024572055,0.0022653746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899036,0.0002168143,0.000056400273,0.00026540333,0.00020317707,0.00026776057],"domain_scores_gemma":[0.9978636,0.0007842574,0.00047650345,0.0003381454,0.0001839252,0.0003535753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048619075,0.0003858408,0.0005687854,0.0005787387,0.0007984594,0.0015774883,0.00073772273,0.0004983266,0.0045968406],"category_scores_gemma":[0.0026319043,0.0003510684,0.00071731675,0.00063973904,0.0013485092,0.0021669774,0.0012535738,0.000878627,0.00035459048],"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.0006059217,0.00011157362,0.00461442,0.00014960574,0.00006936788,0.00048725898,0.0007138118,0.026968589,0.016831322,0.9282999,0.0011841761,0.01996401],"study_design_scores_gemma":[0.0001992652,0.0003180563,0.0056641083,0.00003174575,0.000056195466,0.0005970803,0.0003547369,0.19253325,0.007497508,0.78681874,0.0058612586,0.00006807854],"about_ca_topic_score_codex":0.0020101345,"about_ca_topic_score_gemma":0.0017063835,"teacher_disagreement_score":0.0045968406,"about_ca_system_score_codex":0.0007957148,"about_ca_system_score_gemma":0.0003055242,"threshold_uncertainty_score":0.015377939},"labels":[],"label_agreement":null},{"id":"W4413186403","doi":"10.55016/ojs/cdm.v7i2.62089","title":"Domination Value in Graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Value (mathematics); Statistics","score_opus":0.018171568515713735,"score_gpt":0.33151473795935527,"score_spread":0.31334316944364154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186403","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.61799777,0.0050080568,0.3201098,0.0015513031,0.00009343072,0.00010754259,0.00079722557,0.00027363576,0.054061253],"genre_scores_gemma":[0.97713506,0.00089221116,0.017474178,0.00009681882,0.00012146869,0.00006706783,0.0002487292,0.000044974076,0.003919429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986726,0.00033559577,0.00007305635,0.00033918011,0.0003722189,0.00020721449],"domain_scores_gemma":[0.99409133,0.004187857,0.0004443848,0.00035819254,0.00053010276,0.0003881793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013516351,0.00043113108,0.00067245855,0.0023195622,0.00087817584,0.0027455296,0.0008434436,0.0007068501,0.0016422012],"category_scores_gemma":[0.008387934,0.0002802938,0.0004663157,0.002465152,0.0027514268,0.0041041486,0.0012010336,0.00086616504,0.00019150597],"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.000106293366,0.00004004912,0.0052678552,0.00016287804,0.000059409256,0.00016361348,0.0008562046,0.031646103,0.0048447265,0.9108079,0.0020994449,0.04394541],"study_design_scores_gemma":[0.000015001222,0.000041649677,0.0026165303,0.00003931582,0.000028345596,0.00037236357,0.00024669856,0.08157869,0.0022827864,0.90356266,0.009189875,0.00002599794],"about_ca_topic_score_codex":0.000979097,"about_ca_topic_score_gemma":0.0006066082,"teacher_disagreement_score":0.0027455296,"about_ca_system_score_codex":0.0021149807,"about_ca_system_score_gemma":0.00043047237,"threshold_uncertainty_score":0.015345335},"labels":[],"label_agreement":null},{"id":"W4413186436","doi":"10.55016/ojs/cdm.v7i1.62080","title":"Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; GCHQ; Government of the United Kingdom; University of Regina","keywords":"Mathematics; Decoding methods; Combinatorics; Statistics","score_opus":0.01720815216040471,"score_gpt":0.2905550909592932,"score_spread":0.2733469387988885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186436","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.48250157,0.0002979195,0.49843457,0.00079260085,0.000057167104,0.00008764072,0.0001501864,0.0004213946,0.017256884],"genre_scores_gemma":[0.90077,0.0002144493,0.09380706,0.00013370508,0.00004362989,0.00011170839,0.00013845414,0.000087972054,0.0046930066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983494,0.00039761633,0.00010819289,0.00015415486,0.00070456567,0.00028603664],"domain_scores_gemma":[0.993381,0.0035904313,0.0007139826,0.0012382412,0.00090253144,0.00017385445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014002909,0.00049156795,0.0005962373,0.0010093921,0.0006427722,0.0014306137,0.0010872487,0.0010714128,0.0026107845],"category_scores_gemma":[0.011909511,0.00025641682,0.00047547618,0.00075278303,0.00215477,0.0024428312,0.0018510944,0.0011734193,0.0005070869],"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.00055223407,0.000079224024,0.0032660817,0.00019000162,0.000049659368,0.00041634616,0.00049950794,0.16649278,0.028239,0.744939,0.001261039,0.05401516],"study_design_scores_gemma":[0.00004730335,0.00009314588,0.0004585312,0.00003857545,0.000018921095,0.00032695045,0.00008561561,0.6110638,0.027781729,0.35875183,0.0012841662,0.000049524017],"about_ca_topic_score_codex":0.0010031512,"about_ca_topic_score_gemma":0.0013351471,"teacher_disagreement_score":0.0026107845,"about_ca_system_score_codex":0.0011606512,"about_ca_system_score_gemma":0.0010118542,"threshold_uncertainty_score":0.008733928},"labels":[],"label_agreement":null},{"id":"W4413186446","doi":"10.55016/ojs/cdm.v7i1.62117","title":"Complementaries to Kummer's degree seven reciprocity law and a Dickson Diophantine system","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Reciprocity law; Diophantine equation; Degree (music); Reciprocity (cultural anthropology); Combinatorics; Pure mathematics; Sociology; Social science","score_opus":0.043957219125466664,"score_gpt":0.32722758107271865,"score_spread":0.28327036194725197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186446","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.79807836,0.00061096344,0.048370928,0.0011622965,0.00018357838,0.00005096538,0.00015103439,0.00012479823,0.15126699],"genre_scores_gemma":[0.98391044,0.00023175351,0.0076096016,0.0001347358,0.00009882228,0.000029027027,0.00007601046,0.000018808096,0.007890816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994153,0.00010795603,0.000029232127,0.00011249742,0.00020659975,0.00012849142],"domain_scores_gemma":[0.9982869,0.0006918205,0.0002142555,0.00027706657,0.00031347052,0.00021648896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010215732,0.00018802479,0.0005293205,0.00094598485,0.0011728923,0.0016542091,0.0005199252,0.0005168617,0.003464836],"category_scores_gemma":[0.002944698,0.00021578085,0.00043721395,0.00048263994,0.0053525623,0.0019278493,0.0017432352,0.0013134173,0.00046033287],"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.000010262296,0.000006686005,0.0002461336,0.0000071504082,0.0000015069163,0.000049299957,0.00014054956,0.000175693,0.00025365117,0.9972325,0.00025829312,0.0016182426],"study_design_scores_gemma":[0.000021596945,0.000025618161,0.000609164,0.000011899858,0.0000068200297,0.00020652935,0.00014984875,0.0027668301,0.00061914715,0.98989046,0.0056793652,0.000012824622],"about_ca_topic_score_codex":0.0012444154,"about_ca_topic_score_gemma":0.0009804668,"teacher_disagreement_score":0.003464836,"about_ca_system_score_codex":0.0010628109,"about_ca_system_score_gemma":0.0007962411,"threshold_uncertainty_score":0.011591077},"labels":[],"label_agreement":null},{"id":"W4413186452","doi":"10.55016/ojs/cdm.v7i1.62107","title":"Monochromatic even cycles","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Biology; Botany","score_opus":0.01470262452217187,"score_gpt":0.29740589687461466,"score_spread":0.2827032723524428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186452","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.6716528,0.0024692633,0.17101598,0.0010432889,0.00043138722,0.0001840954,0.0013024207,0.0007843864,0.15111639],"genre_scores_gemma":[0.9291778,0.0010365419,0.047607433,0.0006698794,0.00009950213,0.00012638139,0.00056286703,0.0001463661,0.020573253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993131,0.0001039575,0.000032184696,0.00019533008,0.00011264029,0.00024269424],"domain_scores_gemma":[0.99900997,0.00028255823,0.00018340934,0.00025730996,0.00015653236,0.0001102669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028515013,0.00065377535,0.000492624,0.00046792402,0.00095534953,0.0008781533,0.00076876936,0.00046020214,0.008511866],"category_scores_gemma":[0.0012206092,0.00039572662,0.00048379716,0.0004887911,0.00068127335,0.001341144,0.0013521372,0.0007172651,0.0014059928],"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.000837139,0.00017238985,0.004539034,0.0009986596,0.00009440924,0.0016166026,0.0009889877,0.013497589,0.104738116,0.75692177,0.017018342,0.09857698],"study_design_scores_gemma":[0.00024029831,0.00051331,0.006739014,0.00028023502,0.00015109863,0.002477181,0.0008351222,0.051583767,0.13282798,0.6769438,0.12727714,0.00013106686],"about_ca_topic_score_codex":0.0018648942,"about_ca_topic_score_gemma":0.0023519124,"teacher_disagreement_score":0.008511866,"about_ca_system_score_codex":0.0006175484,"about_ca_system_score_gemma":0.00051947986,"threshold_uncertainty_score":0.028475046},"labels":[],"label_agreement":null},{"id":"W4413186453","doi":"10.55016/ojs/cdm.v7i1.62051","title":"2-generated Cayley digraphs on nilpotent groups have hamiltonian paths","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nilpotent; Mathematics; Combinatorics; Cayley graph; Cayley's theorem; Hamiltonian (control theory); Nilpotent group; Discrete mathematics; Graph; Voltage graph","score_opus":0.010370156541710187,"score_gpt":0.2377313745768587,"score_spread":0.2273612180351485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186453","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.8381692,0.00039667834,0.07477557,0.0004695962,0.00013325052,0.000089081834,0.00051483087,0.00037792212,0.08507378],"genre_scores_gemma":[0.974585,0.00016945577,0.012652259,0.00019100941,0.000051772597,0.00006895357,0.00029254795,0.000029000998,0.011959833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985695,0.00003112712,0.0000074139284,0.000028824008,0.00003077029,0.00004492285],"domain_scores_gemma":[0.99954337,0.00016712783,0.00008398387,0.00004462396,0.00006731331,0.000093576564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013030328,0.0002742692,0.00020193045,0.0007397425,0.00065273157,0.0009403895,0.00030190882,0.00040848448,0.0069013936],"category_scores_gemma":[0.00052230596,0.0001966051,0.0002716807,0.00047802515,0.00054038595,0.0009371414,0.00072037964,0.00045889278,0.00062185875],"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.00008515622,0.00006996321,0.0013310311,0.00008527536,0.000019924477,0.00063657557,0.000718372,0.005012585,0.010081642,0.95799625,0.0025615345,0.021401703],"study_design_scores_gemma":[0.00006012643,0.00008429294,0.0014326295,0.0000183988,0.000011961576,0.000445488,0.00030971764,0.01863454,0.0044718427,0.9626595,0.011843911,0.00002753949],"about_ca_topic_score_codex":0.0008243824,"about_ca_topic_score_gemma":0.0014165823,"teacher_disagreement_score":0.0069013936,"about_ca_system_score_codex":0.00044243122,"about_ca_system_score_gemma":0.00035163213,"threshold_uncertainty_score":0.023087442},"labels":[],"label_agreement":null},{"id":"W4413186458","doi":"10.55016/ojs/cdm.v7i1.62112","title":"Packing of points into the unit 6-dimensional cube","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unit cube; Combinatorics; Mathematics; Cube (algebra); Unit (ring theory)","score_opus":0.015321443876219634,"score_gpt":0.2733699689505132,"score_spread":0.25804852507429354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186458","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.08303101,0.006092615,0.857765,0.0013041432,0.001203938,0.00011381878,0.0010479855,0.0008793922,0.04856208],"genre_scores_gemma":[0.5108009,0.009049417,0.45040578,0.0008190896,0.0011691048,0.00042646742,0.00332959,0.0006727166,0.023326939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668294,0.0008218705,0.00022935215,0.00048670865,0.0014009544,0.0003782301],"domain_scores_gemma":[0.9958305,0.0018962575,0.00044190607,0.000980807,0.0006466228,0.00020400633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012186407,0.0016129329,0.0026026356,0.0021882046,0.0014201163,0.0027685054,0.0023654194,0.0015484301,0.009292832],"category_scores_gemma":[0.012880688,0.0010098356,0.001417967,0.0033088778,0.0021181824,0.004944625,0.0052686282,0.003766133,0.0062199924],"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.001706671,0.00023151268,0.002247184,0.0015055604,0.00020217116,0.0011643126,0.0006994422,0.15715048,0.026806498,0.47349837,0.040123884,0.29466394],"study_design_scores_gemma":[0.000069619295,0.00039877178,0.0025632733,0.00027842793,0.000097539574,0.0013363597,0.00032644212,0.42944297,0.030403282,0.47239047,0.06250027,0.00019261334],"about_ca_topic_score_codex":0.001160056,"about_ca_topic_score_gemma":0.0008257126,"teacher_disagreement_score":0.009292832,"about_ca_system_score_codex":0.00067577587,"about_ca_system_score_gemma":0.00061196287,"threshold_uncertainty_score":0.031087637},"labels":[],"label_agreement":null},{"id":"W4413186459","doi":"10.55016/ojs/cdm.v7i1.62138","title":"Characterizing graph classes by intersections of neighborhoods","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph","score_opus":0.01357958070157754,"score_gpt":0.2749103765177576,"score_spread":0.2613307958161801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186459","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.8688939,0.00048215585,0.10275628,0.0008327077,0.000024818082,0.000044328583,0.0007242148,0.00025902133,0.025982441],"genre_scores_gemma":[0.9828787,0.00018491804,0.01398479,0.00006490572,0.00005932461,0.000049964146,0.0005521012,0.00004974264,0.002175745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872965,0.00023854744,0.00007509736,0.000504361,0.0002576176,0.00019462267],"domain_scores_gemma":[0.99632794,0.0018128919,0.00074652676,0.00044604132,0.00027786448,0.0003888542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007388249,0.0003869702,0.0005382921,0.0031667405,0.0016431317,0.0038290753,0.0008947742,0.00089183013,0.003036686],"category_scores_gemma":[0.003347104,0.00044041293,0.00058612094,0.002152531,0.0032647806,0.006457194,0.0024991338,0.0013006706,0.00024387284],"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.00008520769,0.000030947976,0.006969797,0.00004510662,0.000017033495,0.00009972919,0.0007570442,0.004490852,0.0021344647,0.97400224,0.0010402447,0.010327284],"study_design_scores_gemma":[0.000019856654,0.000039926636,0.005041458,0.000032056356,0.000028596256,0.00040466472,0.00095996715,0.027696354,0.0023528305,0.95473987,0.00865331,0.00003114511],"about_ca_topic_score_codex":0.0014959623,"about_ca_topic_score_gemma":0.0015649229,"teacher_disagreement_score":0.0038290753,"about_ca_system_score_codex":0.002057674,"about_ca_system_score_gemma":0.00037453847,"threshold_uncertainty_score":0.014929533},"labels":[],"label_agreement":null},{"id":"W4413186460","doi":"10.55016/ojs/cdm.v7i1.62108","title":"Notes on the illumination parameters of convex bodies","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Satellite Image Processing and Photogrammetry","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Regular polygon; Mathematics; Combinatorics; Geometry","score_opus":0.021872712804564244,"score_gpt":0.2762518885393609,"score_spread":0.2543791757347966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186460","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.03628681,0.00585361,0.79162014,0.0018376714,0.0013960283,0.00004547734,0.00065637834,0.0005756596,0.16172822],"genre_scores_gemma":[0.75549716,0.0077676196,0.18722692,0.00062682974,0.002963231,0.00016267785,0.0008694834,0.00086645875,0.04401964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955434,0.000116743424,0.000020186224,0.00009469131,0.00017973075,0.000034432825],"domain_scores_gemma":[0.9987435,0.0007346969,0.000082398714,0.00018032841,0.0001994263,0.000059678707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005703722,0.0008450139,0.00065827195,0.0012049237,0.0006608485,0.0014517849,0.000695305,0.00067484204,0.011642905],"category_scores_gemma":[0.003504749,0.0003824164,0.0005304167,0.0013866388,0.0021837063,0.0019561676,0.0015616897,0.003559677,0.0021023934],"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.00005484617,0.000011446146,0.00013700427,0.00011003752,0.00000918868,0.000115105715,0.00013810303,0.027409649,0.0050643114,0.9086313,0.0075879344,0.050730973],"study_design_scores_gemma":[0.000015256348,0.000054690187,0.0006829109,0.000070625756,0.000012204253,0.00025012446,0.00012340561,0.063407786,0.004411865,0.89934015,0.031570278,0.00006075323],"about_ca_topic_score_codex":0.00091970304,"about_ca_topic_score_gemma":0.00067390694,"teacher_disagreement_score":0.011642905,"about_ca_system_score_codex":0.00075406284,"about_ca_system_score_gemma":0.0003025641,"threshold_uncertainty_score":0.03894937},"labels":[],"label_agreement":null},{"id":"W4413186462","doi":"10.55016/ojs/cdm.v7i1.62115","title":"On characterizing game-perfect graphs by forbidden induced subgraphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.02203298500575682,"score_gpt":0.32223342822638623,"score_spread":0.3002004432206294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186462","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.48422396,0.0009787903,0.48207873,0.0012867295,0.00009556148,0.00025502988,0.0009153571,0.0003223866,0.029843437],"genre_scores_gemma":[0.9382707,0.00062190107,0.056971107,0.0003195346,0.00017245885,0.00019660946,0.0006051142,0.000117051495,0.0027255812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974567,0.0008543353,0.00011944505,0.0007289858,0.0004263665,0.0004140083],"domain_scores_gemma":[0.9852341,0.01054893,0.0018257439,0.0010489036,0.00054105505,0.0008012439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021270502,0.0012874134,0.0010310481,0.0023692383,0.0019591565,0.003101874,0.0017466448,0.0013275904,0.0025828837],"category_scores_gemma":[0.012418532,0.0006418157,0.0011079272,0.0029585653,0.00464317,0.0071282526,0.0019816908,0.001716426,0.00025632052],"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.0002219367,0.00015308104,0.005009579,0.00017830783,0.00006185824,0.00020031101,0.0006856372,0.05369115,0.0049829697,0.9181287,0.002139527,0.014546846],"study_design_scores_gemma":[0.00005011491,0.000085334716,0.0017761062,0.000055409444,0.00004903619,0.00038683298,0.00027940073,0.12103241,0.0020436307,0.8698313,0.004362713,0.000047618334],"about_ca_topic_score_codex":0.0033842563,"about_ca_topic_score_gemma":0.0029447174,"teacher_disagreement_score":0.0033842563,"about_ca_system_score_codex":0.0026533648,"about_ca_system_score_gemma":0.0012379976,"threshold_uncertainty_score":0.019251585},"labels":[],"label_agreement":null},{"id":"W4413186463","doi":"10.55016/ojs/cdm.v7i1.62116","title":"Beaded partitions with k colors","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01150612146195542,"score_gpt":0.2958458362604123,"score_spread":0.2843397147984569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186463","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.39180306,0.0008983927,0.4658552,0.0006538823,0.0008745261,0.00020221644,0.0006467792,0.0010017373,0.13806412],"genre_scores_gemma":[0.88735735,0.00040045005,0.06175979,0.00036574053,0.00027853914,0.00025408436,0.0005215265,0.00040330106,0.04865915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983267,0.00024341153,0.000088268775,0.000363745,0.0005218878,0.00045596875],"domain_scores_gemma":[0.9985488,0.00031763237,0.00015704491,0.00040895713,0.00033846666,0.00022921205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063938147,0.00043340545,0.0006031504,0.0011407188,0.0019407793,0.0030819627,0.000887731,0.00084654836,0.008647631],"category_scores_gemma":[0.0018342163,0.00049623294,0.0008101777,0.0010731207,0.0030330662,0.0034311786,0.0029122268,0.001399603,0.0019634033],"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.00008533751,0.000013838882,0.0002930981,0.000030690837,0.0000056546696,0.00009420622,0.0003253521,0.0011694649,0.003712112,0.98566324,0.0011040635,0.007503018],"study_design_scores_gemma":[0.000041193514,0.00006058999,0.00069332524,0.000031851923,0.000015083885,0.0003263762,0.00027819167,0.009936555,0.0050766524,0.9538476,0.029638473,0.00005409851],"about_ca_topic_score_codex":0.0011916193,"about_ca_topic_score_gemma":0.0008741153,"teacher_disagreement_score":0.008647631,"about_ca_system_score_codex":0.0011163843,"about_ca_system_score_gemma":0.0006450262,"threshold_uncertainty_score":0.028929174},"labels":[],"label_agreement":null},{"id":"W4413186465","doi":"10.55016/ojs/cdm.v4i2.62086","title":"The distribution of polynomials over finite fields, with applications to the Gowers norms","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"John D. and Catherine T. MacArthur Foundation; National Science Foundation","keywords":"Mathematics; Distribution (mathematics); Combinatorics; Finite field; Orthogonal polynomials; Pure mathematics; Mathematical analysis","score_opus":0.021690663179078997,"score_gpt":0.3436793809764977,"score_spread":0.3219887177974187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186465","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.4165996,0.0029904183,0.5550055,0.003342398,0.0001548482,0.000048748938,0.00025753633,0.00027504883,0.021325808],"genre_scores_gemma":[0.96741253,0.0015842965,0.026214164,0.00020378633,0.00063483155,0.00007446054,0.0001586162,0.00010331023,0.00361402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777967,0.000991232,0.000072825125,0.00040711826,0.0005000802,0.00024917227],"domain_scores_gemma":[0.9830183,0.011783551,0.0018322257,0.0015419222,0.0009545491,0.0008694846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037250218,0.0005163018,0.00077147264,0.0020500782,0.0010389077,0.0016989473,0.0011453453,0.0005849673,0.001718959],"category_scores_gemma":[0.022322273,0.00032893624,0.00066067505,0.0017789352,0.0056136926,0.006064433,0.0023132754,0.0020438537,0.00020835736],"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.0000690997,0.000016710314,0.0023896392,0.000042391046,0.000012688845,0.00008084962,0.0002209704,0.016148798,0.001247414,0.97064173,0.00046176687,0.008667945],"study_design_scores_gemma":[0.00001941013,0.00008084061,0.0014704749,0.000030426396,0.000012059152,0.00022994036,0.00019401053,0.11932047,0.0023287362,0.8728986,0.0033809799,0.000033984135],"about_ca_topic_score_codex":0.0016391963,"about_ca_topic_score_gemma":0.0007280508,"teacher_disagreement_score":0.0037250218,"about_ca_system_score_codex":0.0019116765,"about_ca_system_score_gemma":0.0006375855,"threshold_uncertainty_score":0.01970005},"labels":[],"label_agreement":null},{"id":"W4413186473","doi":"10.55016/ojs/cdm.v4i2.62022","title":"Fractional illumination of convex bodies","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; University of Alberta","keywords":"Mathematics; Regular polygon; Combinatorics; Geometry","score_opus":0.032162685822232404,"score_gpt":0.3524299917607267,"score_spread":0.3202673059384943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186473","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.09353662,0.0007022392,0.88083905,0.0003904729,0.0001348377,0.000043733286,0.00015161035,0.00015946555,0.024041936],"genre_scores_gemma":[0.85198003,0.0009140275,0.13139679,0.00024418955,0.00020212216,0.00011423039,0.00025776337,0.00013634116,0.014754553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992785,0.00013244133,0.000024161925,0.00016141929,0.00023269217,0.00017088358],"domain_scores_gemma":[0.99910563,0.0003529286,0.0001356295,0.00019797255,0.000117063864,0.00009075261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049779844,0.00069616135,0.0007915546,0.00067734625,0.00072088337,0.0013943798,0.0010076622,0.0008203107,0.005169317],"category_scores_gemma":[0.0022892198,0.00034825513,0.0009362627,0.0006553081,0.0013801745,0.0020058774,0.0020877796,0.0014309128,0.0004938763],"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.00037098472,0.000088212015,0.0017328202,0.00021336637,0.000048503545,0.00040810637,0.00031066718,0.27082187,0.03709966,0.58902156,0.003227496,0.096656784],"study_design_scores_gemma":[0.000037077105,0.00013299924,0.0009822315,0.00003437165,0.000019952024,0.00027184418,0.00014419979,0.69272864,0.0115088085,0.2823581,0.011748654,0.000033099368],"about_ca_topic_score_codex":0.0010686,"about_ca_topic_score_gemma":0.00061501417,"teacher_disagreement_score":0.005169317,"about_ca_system_score_codex":0.0010067832,"about_ca_system_score_gemma":0.00033059303,"threshold_uncertainty_score":0.017293036},"labels":[],"label_agreement":null},{"id":"W4413186477","doi":"10.55016/ojs/cdm.v4i2.62763","title":"On the Hall-Janko graph with 100 vertices and the near-octagon of order (2,4)","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vlaamse regering; Fonds Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Graph; Order (exchange); Business","score_opus":0.005192508490468586,"score_gpt":0.21655889918899499,"score_spread":0.2113663906985264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186477","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.9082815,0.00028486585,0.049726278,0.00025117848,0.00009863871,0.000039204424,0.00010768881,0.00014220754,0.04106845],"genre_scores_gemma":[0.96756816,0.00019388185,0.025632303,0.00008847408,0.000023261417,0.000020804739,0.00015045112,0.000030334584,0.0062922793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99988055,0.00003491621,0.0000031800835,0.000022468435,0.000028702563,0.000030091363],"domain_scores_gemma":[0.99987555,0.000035055873,0.000023209373,0.000022111886,0.000012383445,0.000031636322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008945377,0.000250736,0.0002102324,0.00044738347,0.0008771293,0.00047239446,0.00028503436,0.0002447342,0.002841915],"category_scores_gemma":[0.00026527126,0.00014193049,0.00021995549,0.0003105513,0.0012426452,0.00082746946,0.00079123024,0.00050868065,0.0003842038],"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.00028609968,0.00007568434,0.0015269413,0.00013128713,0.000016887005,0.0007165659,0.0005219722,0.01845796,0.013505767,0.9362594,0.0016435866,0.026857907],"study_design_scores_gemma":[0.00009185128,0.0002925153,0.003734259,0.00008503909,0.000037288086,0.00086984574,0.0019286532,0.08180587,0.02192265,0.8617546,0.027402405,0.00007515302],"about_ca_topic_score_codex":0.0012903503,"about_ca_topic_score_gemma":0.0021619063,"teacher_disagreement_score":0.002841915,"about_ca_system_score_codex":0.0003266867,"about_ca_system_score_gemma":0.0002671614,"threshold_uncertainty_score":0.009507179},"labels":[],"label_agreement":null},{"id":"W4413186484","doi":"10.55016/ojs/cdm.v7i1.61906","title":"Deformations of associahedra and visibility graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Satellite Image Processing and Photogrammetry","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Williams College; National Science Foundation","keywords":"Combinatorics; Visibility; Mathematics; Graph; Geography","score_opus":0.00934794924895526,"score_gpt":0.2737147896242457,"score_spread":0.26436684037529046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186484","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.60715187,0.00027880305,0.32774842,0.000504237,0.00017715938,0.00006750053,0.00023460326,0.00021730355,0.063620105],"genre_scores_gemma":[0.96893644,0.00018432124,0.019415222,0.00006217393,0.000086463064,0.000039595456,0.00014789752,0.000073610994,0.011054203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995209,0.00008902893,0.00002280307,0.00013301263,0.00014145218,0.00009291278],"domain_scores_gemma":[0.9993123,0.00018301819,0.00014365713,0.0001520787,0.000054550805,0.00015440423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024211993,0.00035020045,0.00037170565,0.0008376018,0.0010634855,0.0018579166,0.0006698517,0.0005809325,0.005213944],"category_scores_gemma":[0.001235142,0.00032000465,0.00061989157,0.00061916583,0.0026408203,0.0024078235,0.0020447953,0.0015520399,0.0005007068],"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.000030652634,0.000014978187,0.00036118628,0.000015027707,0.0000039655483,0.00014777036,0.00014361429,0.008373413,0.0022970573,0.98139346,0.00046972744,0.006749193],"study_design_scores_gemma":[0.000018517285,0.00005405625,0.0011649651,0.000017514549,0.000009531036,0.0006377878,0.00038093256,0.07531023,0.0037081987,0.9058714,0.012788784,0.000038038474],"about_ca_topic_score_codex":0.0007822947,"about_ca_topic_score_gemma":0.0006441035,"teacher_disagreement_score":0.005213944,"about_ca_system_score_codex":0.00059035444,"about_ca_system_score_gemma":0.00023221919,"threshold_uncertainty_score":0.017442405},"labels":[],"label_agreement":null},{"id":"W4413186491","doi":"10.55016/ojs/cdm.v4i2.61994","title":"The sum-product phenomenon in arbitrary rings","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"John D. and Catherine T. MacArthur Foundation; National Science Foundation","keywords":"Mathematics; Phenomenon; Combinatorics; Product (mathematics); Geometry; Physics","score_opus":0.02230196316525949,"score_gpt":0.3000663226122716,"score_spread":0.2777643594470121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186491","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.43777302,0.003652619,0.46906224,0.0023432751,0.0003163865,0.000051866402,0.00013778536,0.00047391947,0.08618891],"genre_scores_gemma":[0.9581875,0.0012782217,0.032715917,0.0002942204,0.0004003657,0.000051370407,0.000059621525,0.000112735186,0.006899942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980399,0.0006409687,0.00013980478,0.0003275756,0.0006899095,0.00016188493],"domain_scores_gemma":[0.9964753,0.0019730986,0.00038945916,0.00061225734,0.0002983409,0.00025145113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033252805,0.00046974,0.0007565813,0.0012883836,0.0021022854,0.0039916546,0.0009727705,0.00085355964,0.0029588577],"category_scores_gemma":[0.00729603,0.00052493275,0.000932656,0.0010938226,0.009291629,0.010972393,0.0040912647,0.0021354274,0.00046896868],"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.000014932155,0.000005431866,0.00020942929,0.000031098527,0.000004394985,0.000096182186,0.00018674409,0.00046560282,0.00051614636,0.99615866,0.00027699055,0.0020343612],"study_design_scores_gemma":[0.000007921728,0.000023158733,0.00026430743,0.000014893297,0.000010411803,0.000365063,0.00012921153,0.0047395173,0.0018444445,0.98953235,0.0030563232,0.000012354127],"about_ca_topic_score_codex":0.000214472,"about_ca_topic_score_gemma":0.00015875227,"teacher_disagreement_score":0.0039916546,"about_ca_system_score_codex":0.00060311466,"about_ca_system_score_gemma":0.00046621813,"threshold_uncertainty_score":0.017585993},"labels":[],"label_agreement":null},{"id":"W4413186523","doi":"10.55016/ojs/cdm.v4i2.62044","title":"Another short proof of the Joni-Rota-Godsil integral formula for counting bipartite matchings","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Bipartite graph; Mathematics; Combinatorics; Discrete mathematics; Mathematical economics","score_opus":0.029815331775303815,"score_gpt":0.35779366167627763,"score_spread":0.3279783299009738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186523","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.02963653,0.021517796,0.61860114,0.07361165,0.0322252,0.0005044752,0.0026273998,0.0024660833,0.21880971],"genre_scores_gemma":[0.49667528,0.014253296,0.32254574,0.018318227,0.020725826,0.0008476521,0.0026424085,0.001671878,0.12231967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984652,0.00023699286,0.000106623505,0.0003458917,0.00065122533,0.00019407539],"domain_scores_gemma":[0.9958234,0.0023360162,0.00020257334,0.00029082896,0.0009352141,0.00041209706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024341862,0.001936855,0.0012586897,0.0023698728,0.0027679775,0.0026445114,0.0017678686,0.0022158246,0.019993372],"category_scores_gemma":[0.010833276,0.00086187985,0.002162893,0.002860273,0.0030016804,0.005994849,0.0034844042,0.0062695667,0.0039909948],"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.00016087176,0.00019289115,0.0006439468,0.00059342344,0.00008221926,0.000498042,0.0005212066,0.0030784772,0.0061622886,0.79590994,0.083142556,0.10901417],"study_design_scores_gemma":[0.0000718886,0.00014565588,0.0015313618,0.00018318399,0.00009370427,0.0004689188,0.00017237567,0.007335512,0.0029100867,0.8687298,0.11826002,0.00009756907],"about_ca_topic_score_codex":0.0029723337,"about_ca_topic_score_gemma":0.0033338415,"teacher_disagreement_score":0.019993372,"about_ca_system_score_codex":0.002940087,"about_ca_system_score_gemma":0.0013144823,"threshold_uncertainty_score":0.06688446},"labels":[],"label_agreement":null},{"id":"W4413186785","doi":"10.55016/ojs/cdm.v5i1.61881","title":"Injective and non-injective realizations with symmetry","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Biochemical and Structural Characterization","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Berlin; Deutsche Forschungsgemeinschaft","keywords":"Injective function; Mathematics; Symmetry (geometry); Monomorphism; Combinatorics; Pure mathematics; Geometry","score_opus":0.0027994163739783057,"score_gpt":0.243813245510995,"score_spread":0.2410138291370167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186785","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.41328564,0.00059903675,0.49677458,0.00076714146,0.00016205403,0.00009533645,0.00038673915,0.00040733,0.0875221],"genre_scores_gemma":[0.96631294,0.00017904514,0.027410526,0.000105658284,0.000060082406,0.00006945051,0.0002295322,0.000046887104,0.0055858335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814665,0.00030797868,0.00012274088,0.00036083424,0.00063963945,0.00042212236],"domain_scores_gemma":[0.99876094,0.00023494202,0.00026491634,0.0004004631,0.00015606276,0.00018268552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011424196,0.00039468793,0.0004608248,0.0008066634,0.0013213691,0.0022929017,0.0007794069,0.0008973577,0.0047369534],"category_scores_gemma":[0.0017812067,0.0002939294,0.0011495557,0.0006295129,0.0039180773,0.0039363457,0.0022388115,0.0012173292,0.00050929724],"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.0000059360514,0.0000059759936,0.00023481202,0.000008795534,0.0000032326982,0.0000513612,0.00008302454,0.0006360876,0.0007233029,0.9959014,0.000109885645,0.0022362361],"study_design_scores_gemma":[0.000011648093,0.000054776225,0.001143251,0.000016342752,0.000012096274,0.00042572326,0.00024568252,0.0088305175,0.0017677598,0.9793122,0.008147426,0.00003259522],"about_ca_topic_score_codex":0.0007052254,"about_ca_topic_score_gemma":0.0007738516,"teacher_disagreement_score":0.0047369534,"about_ca_system_score_codex":0.0007905222,"about_ca_system_score_gemma":0.0007327714,"threshold_uncertainty_score":0.01584673},"labels":[],"label_agreement":null},{"id":"W4413186789","doi":"10.55016/ojs/cdm.v5i1.61894","title":"A characterization of the base-matroids of a graphic matroid","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Matroid; Combinatorics; Graphic matroid; Mathematics; Characterization (materials science); Base (topology); Oriented matroid; Matroid partitioning; Discrete mathematics; Physics","score_opus":0.006365721138295434,"score_gpt":0.2445884879603464,"score_spread":0.23822276682205099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186789","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.92057276,0.0006358199,0.056950796,0.00020751478,0.00002320015,0.000046743826,0.00051732006,0.00015268878,0.020893233],"genre_scores_gemma":[0.9842771,0.00022144035,0.011157883,0.00005267977,0.00007757246,0.00005068687,0.0005351239,0.00002901808,0.003598384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995653,0.0000565008,0.000021764457,0.00011754023,0.00015962862,0.00007917488],"domain_scores_gemma":[0.9988871,0.00026217516,0.00021605793,0.00014268197,0.0001485725,0.00034340948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003351555,0.00044826177,0.00041898515,0.001728236,0.00075263204,0.0020293545,0.00074551516,0.00058448466,0.003228167],"category_scores_gemma":[0.0014258056,0.00040759996,0.0003849486,0.001375515,0.0013624135,0.0020319142,0.0013186435,0.00092893786,0.00038153806],"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.00042603276,0.00014066818,0.013152764,0.0002901932,0.00007326227,0.0009913344,0.002086829,0.008676732,0.06495131,0.8607343,0.0022236288,0.046252985],"study_design_scores_gemma":[0.00007309122,0.00052115996,0.023424959,0.00009857416,0.00012117431,0.003720333,0.0015939474,0.07536603,0.030462492,0.8328627,0.03165894,0.00009659154],"about_ca_topic_score_codex":0.00085141836,"about_ca_topic_score_gemma":0.0007649803,"teacher_disagreement_score":0.003228167,"about_ca_system_score_codex":0.0008357586,"about_ca_system_score_gemma":0.00026043958,"threshold_uncertainty_score":0.010799289},"labels":[],"label_agreement":null},{"id":"W4413186794","doi":"10.55016/ojs/cdm.v5i1.62761","title":"On the universal rigidity of generic bar frameworks","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rigidity (electromagnetism); Mathematics; Bar (unit); Combinatorics; Geometry; Structural engineering; Physics; Engineering","score_opus":0.006001362911046983,"score_gpt":0.22400737233743345,"score_spread":0.21800600942638648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186794","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.470354,0.003828654,0.3836143,0.0017490648,0.00025324532,0.000094260846,0.00075461017,0.00055476127,0.13879715],"genre_scores_gemma":[0.9684552,0.000999596,0.025270093,0.00024366444,0.0001928039,0.000069600035,0.00033943745,0.00007419505,0.0043553845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756026,0.00063651457,0.00013790178,0.0006121698,0.00046857298,0.00058461126],"domain_scores_gemma":[0.99512357,0.0022288898,0.00089938997,0.0006792766,0.00035792717,0.00071099174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002608482,0.0007835956,0.0011881855,0.002701116,0.0029838856,0.0020311263,0.001591929,0.0018045977,0.007186827],"category_scores_gemma":[0.008425158,0.00078322715,0.0013197033,0.001816076,0.0064396826,0.0048225233,0.0053750356,0.0018631127,0.00063096825],"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.000044428332,0.000011224546,0.00041812134,0.00006906243,0.000014870249,0.00007664911,0.00017590274,0.010211722,0.00054388365,0.98284733,0.0005269185,0.0050599175],"study_design_scores_gemma":[0.0000155251,0.00006496166,0.00093166466,0.00007503858,0.000019268047,0.00019555102,0.00019666419,0.019887194,0.00043693965,0.9743815,0.003757872,0.00003786832],"about_ca_topic_score_codex":0.0017362674,"about_ca_topic_score_gemma":0.0017372145,"teacher_disagreement_score":0.007186827,"about_ca_system_score_codex":0.0014831482,"about_ca_system_score_gemma":0.00061396294,"threshold_uncertainty_score":0.024042368},"labels":[],"label_agreement":null},{"id":"W4413186795","doi":"10.55016/ojs/cdm.v5i1.62066","title":"Deletion constructions of symmetric 4-configurations. Part I.","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.005168732471958994,"score_gpt":0.2271772617436259,"score_spread":0.22200852927166692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186795","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.096360765,0.0011103562,0.8241543,0.00053252693,0.0005887979,0.0002550576,0.0004526433,0.00093730143,0.0756083],"genre_scores_gemma":[0.65067405,0.0013008566,0.30805013,0.0006527585,0.00017473988,0.00059246033,0.0008700318,0.0004128918,0.03727205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990808,0.00032116927,0.000049247217,0.00016934393,0.00022087453,0.00015857813],"domain_scores_gemma":[0.9991365,0.00025935675,0.0001148413,0.00034965997,0.000077965975,0.0000616984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000576797,0.00069468573,0.00036964178,0.0009006921,0.0010498216,0.00083785405,0.0017117155,0.0009003039,0.011436768],"category_scores_gemma":[0.001401862,0.00044351982,0.000723081,0.0006996475,0.0020410896,0.0018600206,0.0029510888,0.0016608578,0.0032519873],"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.00014300291,0.00005499006,0.0005615554,0.00022443576,0.00001871273,0.00052767387,0.0005144441,0.004034846,0.035626374,0.89726686,0.0042736004,0.056753557],"study_design_scores_gemma":[0.00010259977,0.0003034607,0.0009805644,0.00011819414,0.00005190239,0.0037828255,0.00048319073,0.021433447,0.11435875,0.7229234,0.13535126,0.000110335386],"about_ca_topic_score_codex":0.00012171738,"about_ca_topic_score_gemma":0.00017406236,"teacher_disagreement_score":0.011436768,"about_ca_system_score_codex":0.0004817585,"about_ca_system_score_gemma":0.00031786438,"threshold_uncertainty_score":0.038259804},"labels":[],"label_agreement":null},{"id":"W4413186797","doi":"10.55016/ojs/cdm.v5i1.62034","title":"On a theorem of G. D. Chakerian","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01683206992624857,"score_gpt":0.3488449981570065,"score_spread":0.3320129282307579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186797","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.05329198,0.0352646,0.2378781,0.048169333,0.007808593,0.00007848842,0.0012755782,0.0006269694,0.6156064],"genre_scores_gemma":[0.72554374,0.01769413,0.087701336,0.020053223,0.008675123,0.00032607623,0.0011379715,0.00088465284,0.13798389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989951,0.00021103029,0.000042449305,0.00036663137,0.00025015575,0.00013466775],"domain_scores_gemma":[0.9979723,0.0012070232,0.00010139074,0.00022924032,0.00035059758,0.00013950565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014586423,0.00069184013,0.00110816,0.0021374922,0.0025879128,0.0027144447,0.0010499955,0.0012876882,0.012716037],"category_scores_gemma":[0.0049457722,0.00037167658,0.0010665283,0.0020335044,0.004797345,0.0056673605,0.0034880075,0.004330141,0.0024064814],"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.000028475815,0.000010797898,0.00013206697,0.0000630446,0.000009937628,0.000038888356,0.00015135965,0.00051983714,0.00025557601,0.9756118,0.012255235,0.010923029],"study_design_scores_gemma":[0.00001493799,0.000018879986,0.0003312898,0.000031798132,0.00000843718,0.0001396308,0.00004729538,0.0011869031,0.00031281885,0.9323372,0.065557696,0.000013141308],"about_ca_topic_score_codex":0.002453357,"about_ca_topic_score_gemma":0.0014222459,"teacher_disagreement_score":0.012716037,"about_ca_system_score_codex":0.0022503394,"about_ca_system_score_gemma":0.001008222,"threshold_uncertainty_score":0.04253936},"labels":[],"label_agreement":null},{"id":"W4413186803","doi":"10.55016/ojs/cdm.v5i1.61893","title":"Unavoidable arrays","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.004529183765111108,"score_gpt":0.2323996767364395,"score_spread":0.2278704929713284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186803","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.24651451,0.00080697314,0.6699352,0.000787029,0.00052624673,0.0001024365,0.0012760501,0.0011681608,0.07888341],"genre_scores_gemma":[0.81675,0.00059228897,0.15368235,0.00055303314,0.00032807933,0.00022326877,0.0010445233,0.00038913317,0.026437294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788374,0.00034083592,0.000194988,0.0006295554,0.0005602477,0.00039064433],"domain_scores_gemma":[0.9937471,0.0026262153,0.001009118,0.0014881581,0.0008447251,0.0002846363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069068104,0.00048622134,0.00050345674,0.00064560986,0.0015603215,0.001751391,0.0014030413,0.0008083335,0.010095566],"category_scores_gemma":[0.005475415,0.00038524024,0.00064116245,0.00117798,0.0020835507,0.0035350213,0.0019717051,0.0013650995,0.001177229],"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.00020374132,0.000039291102,0.00244194,0.00029212498,0.000043041447,0.0004909002,0.0005522883,0.011880733,0.016454872,0.91205364,0.005443088,0.050104354],"study_design_scores_gemma":[0.000029360599,0.00017799012,0.0014116635,0.00006507352,0.000040135656,0.0013047338,0.0005481697,0.033570766,0.019695306,0.86817807,0.07490799,0.00007064277],"about_ca_topic_score_codex":0.0004260819,"about_ca_topic_score_gemma":0.00073408964,"teacher_disagreement_score":0.010095566,"about_ca_system_score_codex":0.00057341356,"about_ca_system_score_gemma":0.0006271561,"threshold_uncertainty_score":0.033773005},"labels":[],"label_agreement":null},{"id":"W4413187066","doi":"10.55016/ojs/cdm.v3i2.61934","title":"Colourful transversal theorems","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Transversal (combinatorics); Mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.02085932868845986,"score_gpt":0.3110499104651051,"score_spread":0.29019058177664525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187066","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.07526485,0.0008720704,0.82303905,0.0017884867,0.00075337675,0.000113494694,0.0005987538,0.0009799912,0.096590005],"genre_scores_gemma":[0.8690207,0.0013457407,0.07018689,0.0021763628,0.00065569376,0.00025915747,0.00072841835,0.00050885946,0.055118334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773824,0.0003243328,0.00013051012,0.00063908385,0.00064601685,0.00052188215],"domain_scores_gemma":[0.9932145,0.001972768,0.0005878119,0.0016996416,0.0017227615,0.00080251775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025257128,0.00089531357,0.00059585215,0.0015692262,0.0016018052,0.0028540741,0.0016670916,0.0013142132,0.014714491],"category_scores_gemma":[0.007886565,0.00062689284,0.0017885715,0.0010308636,0.003805277,0.0076499376,0.005320754,0.0052129203,0.0029924447],"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.000028303833,0.000008504409,0.00018682618,0.000027852802,0.000007717351,0.00006477954,0.00013788289,0.00064181176,0.001166119,0.99205995,0.0017651981,0.0039050113],"study_design_scores_gemma":[0.000021494181,0.00004054844,0.00021809057,0.000017282939,0.000016335389,0.0002580543,0.000098079945,0.006145942,0.0034845723,0.98003197,0.009646786,0.000020888518],"about_ca_topic_score_codex":0.0014875854,"about_ca_topic_score_gemma":0.0009568608,"teacher_disagreement_score":0.014714491,"about_ca_system_score_codex":0.001667241,"about_ca_system_score_gemma":0.0009171322,"threshold_uncertainty_score":0.049224854},"labels":[],"label_agreement":null},{"id":"W4413187079","doi":"10.55016/ojs/cdm.v3i2.61976","title":"A new example of non-amorphous association schemes","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Metallic Glasses and Amorphous Alloys","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Association (psychology); Association scheme; Mathematics; Combinatorics; Psychology","score_opus":0.013615699875301417,"score_gpt":0.24275314031093154,"score_spread":0.2291374404356301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187079","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.66629076,0.000656999,0.21605481,0.0010865512,0.00017681964,0.00013711586,0.0005293209,0.0005408867,0.11452678],"genre_scores_gemma":[0.9509314,0.00017417662,0.037529472,0.00008361597,0.000039289745,0.00004451207,0.00021390995,0.000042406937,0.010941101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992986,0.0001415308,0.000051844796,0.00014744101,0.00024668677,0.000113954884],"domain_scores_gemma":[0.9990005,0.00024672895,0.000120216166,0.00035087328,0.00015324396,0.00012849187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058796,0.00021306971,0.00025814667,0.0008258286,0.0018428338,0.0014003029,0.0006249785,0.0007640335,0.004712812],"category_scores_gemma":[0.0011811267,0.00024044541,0.00043548626,0.0009330119,0.0021410466,0.0027753504,0.0018481666,0.0013240958,0.00046577703],"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.000022538212,0.000006928279,0.00027960658,0.0000162503,0.0000026204127,0.00009353703,0.00019399094,0.0005693862,0.0026103687,0.99226147,0.00032658534,0.0036166064],"study_design_scores_gemma":[0.00004268002,0.00006971154,0.0013696084,0.000026091913,0.000021043646,0.0007800859,0.0003231142,0.010587482,0.009146172,0.9327743,0.04482277,0.000037011658],"about_ca_topic_score_codex":0.00071302743,"about_ca_topic_score_gemma":0.000716805,"teacher_disagreement_score":0.004712812,"about_ca_system_score_codex":0.0007277844,"about_ca_system_score_gemma":0.0005103676,"threshold_uncertainty_score":0.015765965},"labels":[],"label_agreement":null},{"id":"W4413187087","doi":"10.55016/ojs/cdm.v3i2.61942","title":"A generalization of the q-Pfaff-Saalschütz formula","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.03814669208105149,"score_gpt":0.3229554187327102,"score_spread":0.28480872665165874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187087","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.07315025,0.004222993,0.6285441,0.0050309543,0.0028616472,0.00010385198,0.00044372337,0.00054037967,0.2851021],"genre_scores_gemma":[0.73616207,0.004718658,0.15023929,0.0031929757,0.0023932445,0.00016042693,0.00033180928,0.00040006358,0.1024015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965084,0.000055719112,0.00002145475,0.00007348375,0.00014323267,0.000055217115],"domain_scores_gemma":[0.9995809,0.00012315766,0.000027113476,0.000072961266,0.00015004668,0.000045739183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008597493,0.00043173484,0.0005860489,0.0016542256,0.0012572668,0.0014282961,0.0010849104,0.000999257,0.00748374],"category_scores_gemma":[0.0021596898,0.00016717082,0.0008595282,0.0011502873,0.0022171892,0.0041966666,0.0013838446,0.0022028207,0.0015820874],"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.000003268554,0.0000044609424,0.000038760576,0.000013042399,0.0000018797009,0.000031856438,0.000030813015,0.00028473214,0.0003080789,0.99201727,0.001323976,0.0059418003],"study_design_scores_gemma":[0.0000028719314,0.00000563666,0.000071433715,0.000008326868,0.000002717203,0.000094737414,0.000013858004,0.0035190224,0.00032268505,0.98968047,0.0062704803,0.000007739003],"about_ca_topic_score_codex":0.0017227918,"about_ca_topic_score_gemma":0.0014249993,"teacher_disagreement_score":0.00748374,"about_ca_system_score_codex":0.0010215465,"about_ca_system_score_gemma":0.00081534113,"threshold_uncertainty_score":0.02503562},"labels":[],"label_agreement":null},{"id":"W4413187090","doi":"10.55016/ojs/cdm.v3i2.61928","title":"Astral (n_4) configurations of pseudolines","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.012248130815646246,"score_gpt":0.2807685538845746,"score_spread":0.26852042306892837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187090","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.84123737,0.00019884994,0.06491099,0.0002965661,0.00023421357,0.000056390698,0.0005440015,0.00050759764,0.092014],"genre_scores_gemma":[0.96410143,0.00008293257,0.024714468,0.00012714794,0.000040186882,0.000075850054,0.00060558313,0.00014586526,0.010106514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995419,0.00011780332,0.000038286667,0.00009941116,0.000100264064,0.00010245565],"domain_scores_gemma":[0.99956125,0.000056823825,0.00009284815,0.00010130019,0.0000920887,0.000095652504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023749597,0.00040020363,0.00029755733,0.0008073397,0.0012816675,0.0012813543,0.00072574295,0.00063218176,0.011490512],"category_scores_gemma":[0.0007799047,0.00037241663,0.00036128666,0.0004431686,0.0015886516,0.0018091049,0.0016149723,0.0007200372,0.0013983173],"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.00032740066,0.000044345197,0.0020783204,0.000078864934,0.0000149484795,0.0008722919,0.00019521939,0.006790825,0.011072062,0.9608198,0.0036162564,0.01408975],"study_design_scores_gemma":[0.0003280485,0.00032372982,0.0043486627,0.000101016805,0.000030669726,0.0026312585,0.0012842271,0.08289248,0.029313933,0.83678675,0.041788988,0.00017023575],"about_ca_topic_score_codex":0.00041051186,"about_ca_topic_score_gemma":0.0006324005,"teacher_disagreement_score":0.011490512,"about_ca_system_score_codex":0.0004587391,"about_ca_system_score_gemma":0.0002669132,"threshold_uncertainty_score":0.03843963},"labels":[],"label_agreement":null},{"id":"W4413187093","doi":"10.55016/ojs/cdm.v3i2.61940","title":"Partitions with parts occurring at most thrice","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Mathematics; Combinatorics","score_opus":0.0347983452105031,"score_gpt":0.32258155573633707,"score_spread":0.28778321052583394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187093","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.83212185,0.0007992784,0.09425461,0.0005132592,0.00036974566,0.000068467656,0.0001153316,0.000113941875,0.07164348],"genre_scores_gemma":[0.9687866,0.00032748593,0.015839383,0.00013299464,0.000109985886,0.000071960734,0.00009514456,0.00005473617,0.014581795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996244,0.00007816355,0.000016167047,0.00007016613,0.00007375049,0.0001373633],"domain_scores_gemma":[0.9988212,0.00043382254,0.0003032688,0.00016804844,0.00009616291,0.00017741667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000487488,0.00049229147,0.0003742622,0.00080777524,0.0014418241,0.0012070547,0.00070526,0.00051719777,0.005010075],"category_scores_gemma":[0.002885889,0.00026120327,0.00051813136,0.0008684356,0.0019242704,0.002287369,0.0012400356,0.00070902484,0.0007182984],"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.00025742658,0.00006586391,0.002234493,0.00008731727,0.000020768268,0.00065801723,0.0009289208,0.0063991523,0.009718999,0.95457464,0.0018271486,0.02322729],"study_design_scores_gemma":[0.00003338109,0.00018428927,0.0018598567,0.000050612416,0.000036374327,0.0011855484,0.00094070693,0.027215518,0.007771784,0.9447732,0.01591161,0.000037208767],"about_ca_topic_score_codex":0.0005228788,"about_ca_topic_score_gemma":0.0009296781,"teacher_disagreement_score":0.005010075,"about_ca_system_score_codex":0.0005993213,"about_ca_system_score_gemma":0.00024124108,"threshold_uncertainty_score":0.01676035},"labels":[],"label_agreement":null},{"id":"W4413187103","doi":"10.55016/ojs/cdm.v3i2.62003","title":"Partially critical indecomposable graphs","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Indecomposable module; Discrete mathematics","score_opus":0.028750634360140834,"score_gpt":0.34725951642660197,"score_spread":0.3185088820664611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187103","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.93645495,0.0006297681,0.050411552,0.00021906127,0.00001942791,0.00005555506,0.0007159706,0.00013593952,0.011357713],"genre_scores_gemma":[0.98769325,0.00028216402,0.009206431,0.00004113114,0.000026036681,0.000029505225,0.0008297997,0.000017305276,0.0018744444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998134,0.00002391893,0.000009302976,0.00007032659,0.000040202172,0.000042973264],"domain_scores_gemma":[0.9991062,0.00029112256,0.00022829101,0.00010029169,0.00010724722,0.00016677298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001445759,0.0004892736,0.00028151827,0.0013223618,0.0005219648,0.0006088548,0.0006071997,0.0002987723,0.001981303],"category_scores_gemma":[0.0010702274,0.00022425038,0.00021588725,0.00073613663,0.00066234387,0.0013831372,0.000602516,0.0005586455,0.00014462374],"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.0006914472,0.00021080207,0.028653705,0.00066081126,0.00016640771,0.004613454,0.0019706902,0.055710718,0.09607969,0.7192442,0.004948292,0.08704981],"study_design_scores_gemma":[0.00005607257,0.00025559022,0.014947339,0.00009997322,0.00011885379,0.004037826,0.0011722811,0.07224639,0.03876251,0.8399897,0.028250102,0.00006329892],"about_ca_topic_score_codex":0.0005109792,"about_ca_topic_score_gemma":0.0007822593,"teacher_disagreement_score":0.001981303,"about_ca_system_score_codex":0.0005427033,"about_ca_system_score_gemma":0.00027020156,"threshold_uncertainty_score":0.006628096},"labels":[],"label_agreement":null},{"id":"W4413187115","doi":"10.55016/ojs/cdm.v3i2.61954","title":"Fold and Mycielskian on homomorphism complexes","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Homomorphism; Mathematics; Combinatorics","score_opus":0.0393067653339557,"score_gpt":0.33852350369305195,"score_spread":0.29921673835909623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187115","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.7710126,0.0013681205,0.1161415,0.002039858,0.00029598732,0.000062351915,0.0002141248,0.00029595345,0.10856953],"genre_scores_gemma":[0.9774254,0.00031202112,0.007321478,0.00021747421,0.000098612705,0.00005299249,0.000113642905,0.00007611034,0.014382321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938536,0.00013675212,0.000028417086,0.00012891162,0.00015259601,0.00016782647],"domain_scores_gemma":[0.9986205,0.00058870466,0.00012876997,0.0001659605,0.00013696123,0.00035901013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008124251,0.0006942284,0.0005396061,0.0016222794,0.0021927163,0.0025519645,0.0008211354,0.0009976061,0.008051295],"category_scores_gemma":[0.003109007,0.00043619715,0.0006638248,0.00072730804,0.0032826602,0.0064529856,0.004302018,0.0021142985,0.0007272405],"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.000035983645,0.000015510845,0.00041150636,0.00002483943,0.0000034750033,0.00010219113,0.00032054566,0.00061162515,0.0014553996,0.99410444,0.0004075211,0.0025070843],"study_design_scores_gemma":[0.000024557345,0.00003982031,0.0007229007,0.000018030047,0.000009274658,0.00026648218,0.00025945558,0.0045702737,0.0027391806,0.985068,0.006265469,0.000016605796],"about_ca_topic_score_codex":0.00073932,"about_ca_topic_score_gemma":0.00053413917,"teacher_disagreement_score":0.008051295,"about_ca_system_score_codex":0.0015219316,"about_ca_system_score_gemma":0.0003150387,"threshold_uncertainty_score":0.026934326},"labels":[],"label_agreement":null},{"id":"W4415667357","doi":"10.55016/ojs/cdm.v20i2.62407","title":"Circuit partitions and signed interlacement in 4-regular graphs","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Connection (principal bundle); Electronic circuit; Space (punctuation); Topology (electrical circuits)","score_opus":0.028018082350575117,"score_gpt":0.35524941416446815,"score_spread":0.327231331813893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667357","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.87378746,0.00064034335,0.08756154,0.0002827582,0.00016724423,0.000045881065,0.00017118957,0.0002969959,0.03704646],"genre_scores_gemma":[0.9752934,0.000308105,0.014296562,0.00012233057,0.000071291666,0.000048295253,0.00021307686,0.00009318986,0.009553764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956554,0.00008118585,0.000024936448,0.00009701091,0.000118626405,0.00011272517],"domain_scores_gemma":[0.9992926,0.00020202264,0.00019389088,0.00012847393,0.00007772342,0.000105222796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023528855,0.00037026854,0.00028619953,0.0012063518,0.0007992343,0.0012717611,0.00064817705,0.0005959251,0.0071337353],"category_scores_gemma":[0.0014624762,0.00028696543,0.00034813298,0.00092426006,0.0014010833,0.0017922001,0.0010233154,0.00080565666,0.00074961217],"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.00023585952,0.00005260288,0.00078681565,0.000078034165,0.000013225517,0.0002662869,0.00058199884,0.011212353,0.010231884,0.94207746,0.0016147674,0.03284878],"study_design_scores_gemma":[0.000039091385,0.00019627248,0.001437272,0.00005205858,0.000020576152,0.00041636286,0.0005075255,0.04190865,0.013101045,0.92366266,0.018596785,0.00006172973],"about_ca_topic_score_codex":0.0007748987,"about_ca_topic_score_gemma":0.0009926656,"teacher_disagreement_score":0.0071337353,"about_ca_system_score_codex":0.00063860504,"about_ca_system_score_gemma":0.00024465186,"threshold_uncertainty_score":0.023864686},"labels":[],"label_agreement":null},{"id":"W4415667388","doi":"10.55016/ojs/cdm.v20i2.69074","title":"The asymmetric index of a graph","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Edge-transitive graph; Complement graph; Circulant graph; Line graph; Bipartite graph; Graph power; Graph; Regular graph; Voltage graph","score_opus":0.011353924765340829,"score_gpt":0.3217568904941336,"score_spread":0.3104029657287928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667388","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.6878321,0.001154183,0.2204131,0.001020927,0.0001710704,0.00012315805,0.0012970122,0.00031160013,0.087676935],"genre_scores_gemma":[0.9665758,0.0005578961,0.028170465,0.00016123187,0.0001709605,0.00008610062,0.0006352262,0.00007669495,0.0035655582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843675,0.00025634622,0.00010661416,0.00043728107,0.0005373734,0.00022562168],"domain_scores_gemma":[0.99492896,0.001831322,0.0009982805,0.0009935534,0.0007255394,0.0005223612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006820133,0.00051948853,0.00061428075,0.0018366675,0.0009871583,0.0017517563,0.00086286967,0.000698679,0.0024488205],"category_scores_gemma":[0.0048935725,0.00030799874,0.00034680977,0.0013662884,0.0019886098,0.0034462432,0.001292908,0.0011865936,0.0005461981],"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.00021123452,0.000076372715,0.006234986,0.00018645577,0.000044821183,0.00039333952,0.0004311597,0.015189991,0.026689436,0.90512717,0.0029590416,0.042456005],"study_design_scores_gemma":[0.000026146816,0.00010007721,0.0040808492,0.00006233201,0.00004320306,0.0011478227,0.0002752516,0.0503348,0.012915678,0.9121195,0.01884845,0.00004601881],"about_ca_topic_score_codex":0.0003757114,"about_ca_topic_score_gemma":0.0003840965,"teacher_disagreement_score":0.0024488205,"about_ca_system_score_codex":0.0010727452,"about_ca_system_score_gemma":0.000463683,"threshold_uncertainty_score":0.008192122},"labels":[],"label_agreement":null},{"id":"W4415667416","doi":"10.55016/ojs/cdm.v20i2.73059","title":"Diophantine equation with balancing-like sequences associated with the Shorey–Tijdeman-type problem","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Science Education and Research Mohali; Indian Institute of Science Education and Research Bhopal","keywords":"Diophantine equation; Sequence (biology); Diophantine set; Legendre's equation; Thue equation; Integer (computer science)","score_opus":0.00935581411238532,"score_gpt":0.2839737622558756,"score_spread":0.2746179481434903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667416","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.68543124,0.0010783741,0.20734993,0.0026420834,0.00038380435,0.00009635846,0.000391014,0.00015614531,0.10247103],"genre_scores_gemma":[0.91789687,0.0005745182,0.052274838,0.00042799706,0.0001434163,0.00015391796,0.00040981936,0.000060463462,0.028058175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998661,0.000040061306,0.000007635487,0.00002129414,0.00003152904,0.000033275584],"domain_scores_gemma":[0.99980265,0.00008663377,0.00003438985,0.000017896142,0.000025323869,0.000033121443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034127032,0.00040936915,0.00048755654,0.00038508585,0.00076979044,0.0006217515,0.0006447902,0.0010054949,0.004618768],"category_scores_gemma":[0.0016160067,0.00017535272,0.00035598254,0.0005246231,0.0008393555,0.0011495015,0.00079276913,0.0011316739,0.000570323],"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.00007375002,0.00004414428,0.00047859843,0.00008649891,0.000011144955,0.00019152336,0.00017610406,0.024185058,0.0037630019,0.95829993,0.0025544413,0.010135756],"study_design_scores_gemma":[0.000084380685,0.00005680047,0.0003956201,0.000022988674,0.000008579187,0.00015439732,0.00014084553,0.15970512,0.0015905676,0.83376324,0.0040518665,0.000025681575],"about_ca_topic_score_codex":0.0014615614,"about_ca_topic_score_gemma":0.0017181272,"teacher_disagreement_score":0.004618768,"about_ca_system_score_codex":0.0006612357,"about_ca_system_score_gemma":0.000858462,"threshold_uncertainty_score":0.015451312},"labels":[],"label_agreement":null},{"id":"W4415667420","doi":"10.55016/ojs/cdm.v20i2.73928","title":"On emulational equivalence of impartial games and the game Hackenforb","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Serbian Academy of Sciences and Arts; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Equivalence (formal languages); Isomorphism (crystallography); Equivalence class (music); Combinatorial game theory; Set (abstract data type); Core (optical fiber); Class (philosophy)","score_opus":0.019741303325044694,"score_gpt":0.3407739352407661,"score_spread":0.3210326319157214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667420","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.10339489,0.0011648993,0.70231634,0.005364264,0.00041484876,0.00027217268,0.0002300157,0.0003568129,0.18648589],"genre_scores_gemma":[0.8998392,0.0005954903,0.08239985,0.0015870885,0.00020701933,0.00040056475,0.00031187938,0.00018785402,0.01447109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927987,0.003681535,0.00033504234,0.0010622512,0.0011238798,0.0009985599],"domain_scores_gemma":[0.9944267,0.003607229,0.00034443272,0.00072233524,0.00051385385,0.0003853715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036906046,0.001023235,0.0011460896,0.0015091067,0.0029783498,0.003961081,0.0017581944,0.0019232891,0.0064004087],"category_scores_gemma":[0.013578758,0.0004575337,0.0016970662,0.0011860743,0.010834963,0.010841011,0.0062704873,0.0055582584,0.0006314673],"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.000014745395,0.000018306262,0.00008532926,0.000012353181,0.0000057003613,0.00003199597,0.00025111352,0.0010293376,0.00012319093,0.9960698,0.0002887048,0.0020696113],"study_design_scores_gemma":[0.000011525436,0.000017996597,0.0000843591,0.0000149644475,0.0000057991183,0.000040429797,0.000120595796,0.005087575,0.0001790379,0.99098057,0.0034452733,0.00001189971],"about_ca_topic_score_codex":0.0047551636,"about_ca_topic_score_gemma":0.002281877,"teacher_disagreement_score":0.0064004087,"about_ca_system_score_codex":0.0030648499,"about_ca_system_score_gemma":0.0011770709,"threshold_uncertainty_score":0.022237182},"labels":[],"label_agreement":null},{"id":"W4415667423","doi":"10.55016/ojs/cdm.v20i2.73655","title":"On next-to-minimum size blocking sets of external lines to a nondegenerate quadric in $\\operatorname{PG}(3,q)$","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Science and Engineering Research Board; National Institute of Science Education and Research; Council of Scientific and Industrial Research, India","keywords":"Quadric; Blocking (statistics); Set (abstract data type); Interval (graph theory); Plane (geometry); Blocking set; Type (biology)","score_opus":0.020591323464272598,"score_gpt":0.33635225570240923,"score_spread":0.3157609322381366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667423","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.9234825,0.00018915422,0.038175,0.00018612864,0.00003596824,0.000028788012,0.0002587287,0.00019725393,0.03744657],"genre_scores_gemma":[0.9530813,0.00021512002,0.0307451,0.00013866996,0.000061292594,0.00012703912,0.0015010774,0.0003203384,0.013810071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955696,0.00007022271,0.000019104566,0.00007622865,0.00014523506,0.00013224383],"domain_scores_gemma":[0.998681,0.00038732754,0.00028525377,0.00013911932,0.00016269165,0.0003445746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004895621,0.00080021395,0.00080987974,0.0011708122,0.0017648318,0.0016542462,0.0014123585,0.0007882238,0.0062216283],"category_scores_gemma":[0.0018679037,0.0006170263,0.0009817578,0.00044397687,0.0016090914,0.0012053491,0.0014128321,0.0016019875,0.0009666466],"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.0007188135,0.00022262943,0.006326392,0.00018595885,0.00005460828,0.0005198437,0.0008590511,0.026258001,0.021685459,0.9246811,0.004238261,0.014249825],"study_design_scores_gemma":[0.00038258938,0.00043337035,0.010270788,0.00021224793,0.00010243975,0.0010190739,0.0014529226,0.23398001,0.026738571,0.7028835,0.022367602,0.00015690501],"about_ca_topic_score_codex":0.0026613367,"about_ca_topic_score_gemma":0.0024085473,"teacher_disagreement_score":0.0062216283,"about_ca_system_score_codex":0.0012754058,"about_ca_system_score_gemma":0.00045773745,"threshold_uncertainty_score":0.020813406},"labels":[],"label_agreement":null},{"id":"W4415667429","doi":"10.55016/ojs/cdm.v20i2.75363","title":"A bijection between the sets of $(a,b,b^2)$-generalized Motzkin paths avoiding $\\mathrm{uvv}$-patterns and $\\mathrm{uvu}$-patterns","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bijection; Path (computing); Quadrant (abdomen); Set (abstract data type); Lattice (music)","score_opus":0.022242724697021002,"score_gpt":0.34044089280391293,"score_spread":0.31819816810689194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667429","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.5723068,0.0016615445,0.21818134,0.0018091564,0.001311764,0.0003743113,0.0031639435,0.0010546845,0.20013647],"genre_scores_gemma":[0.7387144,0.0018078687,0.1668525,0.0014734009,0.00060616195,0.001699417,0.004781781,0.0008760882,0.08318841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901175,0.00018941499,0.00007501098,0.00030837615,0.0002211379,0.00019430797],"domain_scores_gemma":[0.9984503,0.000512597,0.00026024165,0.00016315104,0.00031530322,0.00029846132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041056334,0.0009028453,0.00071181083,0.0023347838,0.002668317,0.0035117753,0.0011383742,0.0013423292,0.012580044],"category_scores_gemma":[0.0019911153,0.0006987839,0.00088898157,0.0017705804,0.0024668514,0.0035971678,0.0019152655,0.0020098141,0.0026531972],"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.00021794112,0.000069131514,0.0005316586,0.00015192167,0.000028525536,0.0002667649,0.00043065887,0.001217244,0.004592615,0.9571253,0.005996786,0.029371424],"study_design_scores_gemma":[0.00007172191,0.000076316785,0.0010549081,0.000083518775,0.000021919095,0.0008401463,0.0003589925,0.008367561,0.0034759277,0.9488048,0.03676903,0.00007514372],"about_ca_topic_score_codex":0.0008160885,"about_ca_topic_score_gemma":0.00078317005,"teacher_disagreement_score":0.012580044,"about_ca_system_score_codex":0.0010229435,"about_ca_system_score_gemma":0.0007150706,"threshold_uncertainty_score":0.042084396},"labels":[],"label_agreement":null},{"id":"W4415667431","doi":"10.55016/ojs/cdm.v20i2.76082","title":"On a construction of self-orthogonal codes from orbit matrices of 2-designs","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Orbit (dynamics); Construct (python library); Point (geometry); Matrix (chemical analysis); Block code; Linear code","score_opus":0.006254058590538595,"score_gpt":0.2414348782628296,"score_spread":0.235180819672291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667431","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.18031411,0.00074106466,0.7848361,0.00023508586,0.00028937915,0.00019919744,0.00022775306,0.00041755667,0.032739703],"genre_scores_gemma":[0.57761157,0.0010000992,0.40183327,0.00033871108,0.00017683103,0.00026238893,0.00048072267,0.00021053807,0.01808582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992337,0.000243658,0.00004426636,0.00011392532,0.0002473136,0.000117148564],"domain_scores_gemma":[0.9989525,0.00040263246,0.00013791064,0.0002243274,0.00019819796,0.000084475716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057501683,0.0006311502,0.00038100666,0.0011979184,0.0008910024,0.0007072132,0.00038959176,0.0004984668,0.0031206002],"category_scores_gemma":[0.001763035,0.00035030782,0.0008483749,0.00063036656,0.001215506,0.0009774221,0.00137061,0.0010045647,0.0010115192],"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.00016770879,0.000087655135,0.00090960704,0.00020067081,0.00003962745,0.00028112094,0.0006369036,0.018609734,0.0303173,0.8657018,0.002048719,0.080999225],"study_design_scores_gemma":[0.000094804265,0.00071349635,0.0011182312,0.00013399246,0.000053771233,0.0010998667,0.00021702897,0.10996116,0.048672102,0.80155605,0.036208533,0.00017089148],"about_ca_topic_score_codex":0.00047955656,"about_ca_topic_score_gemma":0.00063202693,"teacher_disagreement_score":0.0031206002,"about_ca_system_score_codex":0.0003893753,"about_ca_system_score_gemma":0.0005694366,"threshold_uncertainty_score":0.0104394555},"labels":[],"label_agreement":null},{"id":"W4415667433","doi":"10.55016/ojs/cdm.v20i2.74008","title":"Dyck paths with first sojourn highest","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Catalan number; Catalan; Path (computing); Quadrant (abdomen); Lattice (music)","score_opus":0.011257386304767768,"score_gpt":0.311550056254027,"score_spread":0.30029266994925924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667433","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.7118515,0.00072072586,0.134882,0.00054418284,0.00027496828,0.00008216763,0.0010775037,0.0007631237,0.14980394],"genre_scores_gemma":[0.9294087,0.0004770665,0.032621443,0.0002554907,0.00009452581,0.0001319713,0.00094926276,0.00044238655,0.03561915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992778,0.00008457756,0.000036133424,0.00019277292,0.00017305302,0.00023571326],"domain_scores_gemma":[0.9977071,0.00080269447,0.0002594215,0.0003340442,0.00046401264,0.00043268825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045042523,0.00051175227,0.000736649,0.002044704,0.0021912928,0.0024939242,0.00079408236,0.00075820205,0.009371469],"category_scores_gemma":[0.003717851,0.00042523004,0.0007020867,0.0012595453,0.0016325798,0.0026094276,0.0018123446,0.0019045903,0.0014890231],"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.00013845187,0.000042206753,0.0018239701,0.00008246794,0.000008792428,0.00022354258,0.00032372694,0.0025978277,0.0054226727,0.9696013,0.0020344034,0.017700698],"study_design_scores_gemma":[0.000022594688,0.00009601465,0.0025519917,0.00007976331,0.00002079433,0.00063925487,0.00039198753,0.022102438,0.0076918816,0.9503962,0.015945567,0.00006162432],"about_ca_topic_score_codex":0.002322664,"about_ca_topic_score_gemma":0.0030176425,"teacher_disagreement_score":0.009371469,"about_ca_system_score_codex":0.0016766933,"about_ca_system_score_gemma":0.00087055564,"threshold_uncertainty_score":0.031350672},"labels":[],"label_agreement":null},{"id":"W4415667464","doi":"10.55016/ojs/cdm.v20i2.76852","title":"Colourings of aperiodic tilings","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Aperiodic graph; Substitution tiling; Enhanced Data Rates for GSM Evolution; Face (sociological concept); Quasicrystal","score_opus":0.0077740494361308995,"score_gpt":0.28917356031752317,"score_spread":0.28139951088139226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667464","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.8395928,0.0004957529,0.08828464,0.00030394245,0.00033262302,0.0000535128,0.0003190911,0.00041565186,0.070201896],"genre_scores_gemma":[0.96427953,0.00027572253,0.022748444,0.00007321872,0.000036498936,0.00003295851,0.00018651622,0.0001623067,0.01220486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999853,0.000020131918,0.0000107874785,0.000036913676,0.000037952228,0.000041170442],"domain_scores_gemma":[0.9997851,0.000072729796,0.00002413078,0.00004688897,0.000033424847,0.000037809164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014149296,0.0002507116,0.0002892232,0.0005017603,0.0005935882,0.0013152487,0.00032358113,0.00047495498,0.009506102],"category_scores_gemma":[0.000660191,0.00019949369,0.0002754038,0.00041002038,0.00071857945,0.0008249175,0.00048271444,0.00045399077,0.00078517414],"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.00021478749,0.00005276812,0.0008650523,0.00017192376,0.000014448666,0.0002589253,0.0002636731,0.037122644,0.051858436,0.8516658,0.0031547113,0.054356825],"study_design_scores_gemma":[0.00011827169,0.00013215341,0.0011256798,0.00004592423,0.00001982147,0.00029662438,0.00025668324,0.08917049,0.025765928,0.85961413,0.023406042,0.000048103353],"about_ca_topic_score_codex":0.0007546847,"about_ca_topic_score_gemma":0.0018123757,"teacher_disagreement_score":0.009506102,"about_ca_system_score_codex":0.0005690532,"about_ca_system_score_gemma":0.00026191873,"threshold_uncertainty_score":0.031801105},"labels":[],"label_agreement":null},{"id":"W4415667466","doi":"10.55016/ojs/cdm.v20i2.76682","title":"A generalization of the Beraha–Kahane–Weiss theorem with graph polynomial applications","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic polynomial; Tutte polynomial; Factor theorem; Graph property; Graph; Voltage graph; Polynomial; Generalization; Cubic graph","score_opus":0.007507840799624974,"score_gpt":0.2952647826141136,"score_spread":0.28775694181448863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667466","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.061072174,0.0020672053,0.87084997,0.0026612917,0.0005977109,0.00005689151,0.00023499875,0.0002887996,0.062170852],"genre_scores_gemma":[0.8161189,0.0046642907,0.12826365,0.0014542404,0.001965724,0.00018369152,0.00026749374,0.0004393049,0.046642616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993393,0.00018137901,0.000026898539,0.00016884888,0.00017072732,0.000112861846],"domain_scores_gemma":[0.9979079,0.0010796088,0.00020348774,0.00027293965,0.00035349355,0.00018247691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013921115,0.00095310394,0.00078291335,0.0024524713,0.0012746291,0.0012285566,0.001245368,0.0010259334,0.0049783476],"category_scores_gemma":[0.008906891,0.00037585202,0.0011645494,0.002080533,0.00279969,0.004525754,0.0019567683,0.0030215224,0.0013060041],"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.000015156189,0.000014140899,0.00021061712,0.000046508732,0.000006231494,0.00007037594,0.00012325746,0.003826706,0.001073387,0.9807011,0.0020152577,0.011897271],"study_design_scores_gemma":[0.000008564178,0.000021816355,0.00026065248,0.00002107964,0.000008005525,0.00019422799,0.00004321967,0.036432005,0.0009877319,0.95083344,0.01116933,0.00001992441],"about_ca_topic_score_codex":0.0015652291,"about_ca_topic_score_gemma":0.00095507066,"teacher_disagreement_score":0.0049783476,"about_ca_system_score_codex":0.0009443711,"about_ca_system_score_gemma":0.00063937274,"threshold_uncertainty_score":0.016654253},"labels":[],"label_agreement":null},{"id":"W4415667470","doi":"10.55016/ojs/cdm.v20i2.76744","title":"Asymptotic estimate on the distance energy of lattices","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Moment (physics); Moment problem; Second moment of area; Energy (signal processing); Lattice (music); Hexagonal crystal system","score_opus":0.020254120157955725,"score_gpt":0.33498349880587436,"score_spread":0.3147293786479186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667470","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.33564857,0.00926007,0.48875645,0.014505369,0.0011228089,0.000061141465,0.00085543277,0.0005907118,0.1491995],"genre_scores_gemma":[0.9315936,0.002991969,0.03687493,0.001183714,0.0015986809,0.00016087804,0.00066938484,0.00038960032,0.024537297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998796,0.00039316757,0.00003694195,0.00018363642,0.00042389455,0.00016644446],"domain_scores_gemma":[0.99217755,0.004940554,0.0004963892,0.0007303943,0.00087999756,0.00077513274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022958827,0.0009767114,0.0012807448,0.002696679,0.0010459382,0.0018932852,0.0020203,0.001468849,0.006862813],"category_scores_gemma":[0.016676843,0.0004500626,0.0008882505,0.001048263,0.0037582836,0.0049733752,0.0036293834,0.0048070257,0.0010289336],"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.000052587286,0.000026036245,0.00052102,0.00009335024,0.000019329977,0.0000653522,0.00007853265,0.008112881,0.0017298163,0.9828415,0.002779396,0.0036802758],"study_design_scores_gemma":[0.000015608519,0.00003801745,0.0007682999,0.00006118289,0.000013231047,0.00015439502,0.00007199515,0.111967914,0.0010256893,0.88248354,0.003364092,0.000036022007],"about_ca_topic_score_codex":0.0008414344,"about_ca_topic_score_gemma":0.00069223915,"teacher_disagreement_score":0.006862813,"about_ca_system_score_codex":0.002228043,"about_ca_system_score_gemma":0.0007087367,"threshold_uncertainty_score":0.022958398},"labels":[],"label_agreement":null},{"id":"W4415667471","doi":"10.55016/ojs/cdm.v20i2.75933","title":"Construction of (a, b, c) tilings of the Euclidean plane, hyperbolic plane, and the sphere","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Square tiling; Substitution tiling; Euclidean geometry; Hyperbolic geometry; Plane (geometry); Hexagonal tiling; Hyperbolic triangle; Symmetry (geometry)","score_opus":0.005575557297873989,"score_gpt":0.24219341670897027,"score_spread":0.23661785941109628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667471","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.35618764,0.00050639774,0.4671359,0.00033870913,0.00077511626,0.0002386,0.00071795593,0.0013462547,0.17275338],"genre_scores_gemma":[0.62560135,0.0004172857,0.34009525,0.00012381129,0.00005475555,0.00020689533,0.0006114844,0.00036113706,0.03252802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998511,0.00002261544,0.000014836732,0.00003734417,0.00004169708,0.000032459848],"domain_scores_gemma":[0.9999057,0.000015210263,0.000010610325,0.000025190837,0.0000177798,0.000025519787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009221021,0.00025078238,0.00023225903,0.0005231697,0.0007236721,0.00089412736,0.00030810447,0.00026288442,0.0058666095],"category_scores_gemma":[0.00023092555,0.00023531367,0.00036067615,0.00039876963,0.0006875248,0.00047004168,0.00094858016,0.0005285867,0.0013102426],"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.00011275473,0.00005630281,0.0008406928,0.00010537305,0.000012730985,0.00044317302,0.0006903841,0.013764217,0.10407263,0.7929574,0.0058693625,0.081074916],"study_design_scores_gemma":[0.00014217879,0.00044472146,0.002469291,0.0000888912,0.000039519444,0.0014671365,0.0013160428,0.14772274,0.16884184,0.46065345,0.21669674,0.00011742169],"about_ca_topic_score_codex":0.001383798,"about_ca_topic_score_gemma":0.0018457368,"teacher_disagreement_score":0.0058666095,"about_ca_system_score_codex":0.00037795736,"about_ca_system_score_gemma":0.0004259837,"threshold_uncertainty_score":0.019625783},"labels":[],"label_agreement":null},{"id":"W4415667475","doi":"10.55016/ojs/cdm.v20i2.77499","title":"About the second neighborhood conjecture for tournaments missing two stars or disjoint paths","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Disjoint sets; Vertex (graph theory); Graph; Simple (philosophy); Property (philosophy)","score_opus":0.024747095572057655,"score_gpt":0.36404841140807986,"score_spread":0.3393013158360222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667475","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.8204668,0.002205502,0.09907074,0.008698113,0.0005544187,0.00007218454,0.0005092181,0.00043995245,0.06798311],"genre_scores_gemma":[0.98519945,0.00050496514,0.008203709,0.0008474546,0.00033653236,0.000050063354,0.0005200255,0.00007307888,0.0042647473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984579,0.0004003933,0.000056826204,0.00044504442,0.00030767833,0.0003322015],"domain_scores_gemma":[0.98802084,0.008332887,0.0009909332,0.0009510509,0.00088541955,0.0008190198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017923223,0.00051592937,0.0010480643,0.0007458829,0.0027887311,0.0025438755,0.0012424055,0.0019858615,0.0059464],"category_scores_gemma":[0.0116530545,0.00038648376,0.0010877154,0.0010349405,0.0031329705,0.005228055,0.0024439343,0.0029501056,0.0005381615],"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.0011443328,0.00019138114,0.0141010415,0.0003660468,0.000120671146,0.0010187811,0.00119291,0.017379183,0.005384605,0.9191059,0.015368283,0.024626935],"study_design_scores_gemma":[0.00020824376,0.00020198408,0.0035150857,0.00007445866,0.0000783738,0.0006816462,0.00071395625,0.043079715,0.0023774302,0.9392659,0.009749738,0.000053397023],"about_ca_topic_score_codex":0.002588122,"about_ca_topic_score_gemma":0.001852838,"teacher_disagreement_score":0.0059464,"about_ca_system_score_codex":0.0010977387,"about_ca_system_score_gemma":0.00061228697,"threshold_uncertainty_score":0.019892693},"labels":[],"label_agreement":null},{"id":"W4415667477","doi":"10.55016/ojs/cdm.v20i2.77187","title":"Applications via series accelerations of new identities involving Catalan-type numbers","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Catalan number; Series (stratigraphy); Identity (music); Convergence (economics); Hypergeometric function; Geometric series; Acceleration; Algebra over a field","score_opus":0.02112979548390114,"score_gpt":0.35226019972283507,"score_spread":0.3311304042389339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667477","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.13242953,0.00091709715,0.77845734,0.00060306006,0.0008990004,0.00017529758,0.00008418614,0.00064757915,0.08578699],"genre_scores_gemma":[0.6998307,0.001190934,0.25940531,0.00057603786,0.00062744645,0.000400729,0.00014803748,0.00045365113,0.03736716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990288,0.0002781489,0.000055052078,0.00016171727,0.00035589084,0.00012050401],"domain_scores_gemma":[0.99905354,0.000266569,0.00011370204,0.00020123045,0.00023513036,0.00012982704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015808617,0.0008595274,0.0006160614,0.0016966269,0.0011614796,0.0014041401,0.0012255394,0.000812446,0.003623472],"category_scores_gemma":[0.0042633414,0.00038431917,0.0012303565,0.00080313213,0.0016356325,0.0028018702,0.0021321916,0.0026878614,0.0013143726],"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.000035726087,0.000040106985,0.0003452395,0.00005055368,0.000011551536,0.00015136605,0.0002410174,0.0069110687,0.008892092,0.9613884,0.0008820129,0.021050876],"study_design_scores_gemma":[0.000029340757,0.0001863793,0.0003784051,0.00005989779,0.000029536546,0.00040273328,0.00011748745,0.15936612,0.02277162,0.7880141,0.028584069,0.00006032205],"about_ca_topic_score_codex":0.0005301956,"about_ca_topic_score_gemma":0.00058208086,"teacher_disagreement_score":0.003623472,"about_ca_system_score_codex":0.0013514375,"about_ca_system_score_gemma":0.0008249399,"threshold_uncertainty_score":0.012121797},"labels":[],"label_agreement":null},{"id":"W4415667478","doi":"10.55016/ojs/cdm.v20i2.77218","title":"Linear arboricity of the tensor products of complete multipartite graphs","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Multipartite; Conjecture; Tensor product; Degeneracy (biology); Partition (number theory); 1-planar graph; Graph","score_opus":0.0431357673187249,"score_gpt":0.35780819350209925,"score_spread":0.3146724261833743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667478","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.9371246,0.00025414547,0.05108178,0.0002304485,0.000028087765,0.00002406466,0.00040124392,0.00015323651,0.01070243],"genre_scores_gemma":[0.9863957,0.00016480904,0.010619958,0.00004241047,0.00004213982,0.00003288344,0.00042451744,0.000057144513,0.002220385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913436,0.00023208022,0.00006244985,0.00025317745,0.00014382291,0.00017409844],"domain_scores_gemma":[0.9956821,0.0014864118,0.0010140882,0.0006092019,0.00049301115,0.00071509514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006723042,0.00037460006,0.00040590504,0.0012155783,0.0010341977,0.0017447526,0.00055507687,0.00038864385,0.0029562665],"category_scores_gemma":[0.00315697,0.0004922478,0.00060191937,0.00097220205,0.0018429856,0.0032403371,0.0011043008,0.00080058584,0.0003416678],"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.0006572574,0.00010006043,0.010650379,0.00021896225,0.000069226604,0.00076124613,0.001735503,0.022483846,0.022302914,0.91765136,0.0029176066,0.020451602],"study_design_scores_gemma":[0.000024729781,0.00015545,0.0055250404,0.000034906723,0.00006290243,0.00087855104,0.00048520372,0.08711006,0.0090375645,0.89044,0.0062024095,0.00004331152],"about_ca_topic_score_codex":0.0009448121,"about_ca_topic_score_gemma":0.0010460484,"teacher_disagreement_score":0.0029562665,"about_ca_system_score_codex":0.0006914051,"about_ca_system_score_gemma":0.00031332448,"threshold_uncertainty_score":0.009889722},"labels":[],"label_agreement":null},{"id":"W4415667486","doi":"10.55016/ojs/cdm.v20i2.77376","title":"Cayley graphs of order $8pq$ are hamiltonian","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"European Commission","keywords":"Cayley graph; Cayley's theorem; Vertex-transitive graph; Cayley transform; Hamiltonian (control theory); Graph; Order (exchange); Hamiltonian path; Finite group","score_opus":0.02444645571086837,"score_gpt":0.36110734030695874,"score_spread":0.33666088459609034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667486","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.48916167,0.00057256233,0.33739758,0.0022002554,0.00035859674,0.00028129178,0.0016226622,0.0019125579,0.16649273],"genre_scores_gemma":[0.9224749,0.0005200977,0.062334456,0.0006239369,0.00009034901,0.00011419713,0.00072651525,0.00019478794,0.012920686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997017,0.000049834212,0.000015433783,0.000075470205,0.000103750564,0.000053667467],"domain_scores_gemma":[0.998473,0.00081557705,0.00018488489,0.00018018692,0.00022486408,0.00012150202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023639938,0.0004638578,0.0002878985,0.0005141221,0.0007626623,0.001142639,0.00050100015,0.00048603688,0.011200781],"category_scores_gemma":[0.0018485833,0.0004471317,0.0005068538,0.0005171862,0.001394755,0.0016113957,0.0009352321,0.0011372236,0.0011857491],"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.0000987042,0.00006371583,0.0016134947,0.00025753502,0.000040322233,0.00076908345,0.00074559264,0.006155799,0.01750744,0.9317328,0.008581828,0.032433663],"study_design_scores_gemma":[0.00006502419,0.000039235532,0.0007024441,0.000025334077,0.000030370376,0.00036436622,0.0002101947,0.014031368,0.009663339,0.96012145,0.014720996,0.000025860296],"about_ca_topic_score_codex":0.0018407826,"about_ca_topic_score_gemma":0.003757048,"teacher_disagreement_score":0.011200781,"about_ca_system_score_codex":0.0004927198,"about_ca_system_score_gemma":0.0007463116,"threshold_uncertainty_score":0.03747034},"labels":[],"label_agreement":null},{"id":"W4415667488","doi":"10.55016/ojs/cdm.v20i2.77546","title":"Identities involving trigonometric, zeta and partition functions","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Trigonometry; Riemann zeta function; Trigonometric functions; Partition function (quantum field theory); Lambda; Proofs of trigonometric identities; Arithmetic zeta function","score_opus":0.021110006893931024,"score_gpt":0.34115697669504236,"score_spread":0.32004696980111136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667488","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.17874023,0.0036661378,0.54316944,0.0019028473,0.0029576435,0.00010339205,0.0003465134,0.00050287513,0.26861107],"genre_scores_gemma":[0.8647813,0.0036343965,0.07514378,0.000852885,0.0019079468,0.00016818731,0.00030856094,0.00038364533,0.052819196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894553,0.00020317435,0.0000707312,0.0001487709,0.00046282393,0.00016888735],"domain_scores_gemma":[0.998909,0.00035082272,0.00014582337,0.00019130885,0.00026455818,0.00013841466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014724033,0.0011573562,0.0009656197,0.003742111,0.0024169246,0.004308776,0.0015658134,0.0012468095,0.0055356896],"category_scores_gemma":[0.004262752,0.00038098652,0.001240916,0.0020087862,0.0036674617,0.0060245492,0.0024192284,0.0022751638,0.0026064795],"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.0000038605776,0.000006664102,0.000068288646,0.000018543571,0.0000017617373,0.00006650461,0.00010222169,0.00035885893,0.0005179227,0.99633163,0.00056288944,0.0019608438],"study_design_scores_gemma":[0.000003815559,0.0000060992816,0.000112177135,0.00002536017,0.000005789876,0.00017412884,0.00007111675,0.0055612694,0.00071892573,0.99019694,0.003111733,0.000012684965],"about_ca_topic_score_codex":0.0010732159,"about_ca_topic_score_gemma":0.0013274394,"teacher_disagreement_score":0.0055356896,"about_ca_system_score_codex":0.0015414387,"about_ca_system_score_gemma":0.00113841,"threshold_uncertainty_score":0.018518746},"labels":[],"label_agreement":null},{"id":"W4415667492","doi":"10.55016/ojs/cdm.v20i2.78009","title":"An Ehrhart theoretic approach to generalized Golomb rulers","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Golomb coding; Pairwise comparison; Polytope; Sequence (biology); Type (biology)","score_opus":0.01691262685178807,"score_gpt":0.33990114855736725,"score_spread":0.3229885217055792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667492","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.12443119,0.0028696407,0.6762989,0.002146125,0.00077480276,0.0001238199,0.00035059563,0.00031287994,0.19269204],"genre_scores_gemma":[0.7726877,0.0028321194,0.17116788,0.0015066526,0.0012999267,0.00016969266,0.00027893856,0.00018052271,0.049876556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866676,0.0003912321,0.00006728725,0.00022767065,0.0004185524,0.00022850638],"domain_scores_gemma":[0.99824667,0.0006724353,0.00013902859,0.0003867762,0.00042892896,0.00012626107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001249648,0.0006321631,0.0008336111,0.0021267717,0.0015200588,0.0028708337,0.0014419071,0.0011198198,0.004773849],"category_scores_gemma":[0.0042090914,0.00034311105,0.0009189939,0.0019274178,0.0038975708,0.0051018023,0.0015651613,0.0033066217,0.0011736634],"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.000003846894,0.0000049921614,0.00004220466,0.000009138538,0.0000015727705,0.00002595954,0.00004194645,0.00053667394,0.00023697494,0.9958792,0.00033421756,0.0028832974],"study_design_scores_gemma":[0.0000070171263,0.000017557202,0.000076700606,0.000012605256,0.000003544723,0.00008173478,0.000046396854,0.005187888,0.00054807734,0.98593616,0.0080691,0.000013353783],"about_ca_topic_score_codex":0.0010383803,"about_ca_topic_score_gemma":0.00076076447,"teacher_disagreement_score":0.004773849,"about_ca_system_score_codex":0.0011616577,"about_ca_system_score_gemma":0.00075565686,"threshold_uncertainty_score":0.01597011},"labels":[],"label_agreement":null},{"id":"W4415667497","doi":"10.55016/ojs/cdm.v20i2.77509","title":"Covering the crosspolytope with crosspolytopes","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Regular polygon; Convex body; Convex geometry; Type (biology)","score_opus":0.016130121680914926,"score_gpt":0.3397692729211006,"score_spread":0.32363915124018566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667497","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.5730958,0.0016169979,0.22338937,0.0008414435,0.00045620397,0.0000683684,0.0010673291,0.0009271701,0.19853738],"genre_scores_gemma":[0.9087987,0.0010391106,0.048418827,0.0005099451,0.00020210781,0.000114709044,0.0016609683,0.0005001124,0.038755488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994468,0.000054650267,0.000019434523,0.00018159256,0.00011775336,0.00017986231],"domain_scores_gemma":[0.9996364,0.0001067666,0.000049741273,0.000097650576,0.00004031176,0.00006921888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026686027,0.00078579545,0.00044083563,0.0007177616,0.0010004549,0.0016092208,0.00051742606,0.0005660693,0.017134145],"category_scores_gemma":[0.0009426972,0.00049505604,0.00079680135,0.0007340967,0.0012287742,0.0017035682,0.0024347177,0.0015238218,0.0030824728],"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.00031299223,0.00009514387,0.002149539,0.00027076196,0.0000564118,0.00087113807,0.00053659483,0.022184493,0.018520143,0.86847466,0.017332772,0.06919538],"study_design_scores_gemma":[0.0001241721,0.0004496564,0.006579711,0.00016266019,0.00008679968,0.0028229305,0.0008811048,0.09226007,0.033337492,0.6888236,0.17433639,0.00013542341],"about_ca_topic_score_codex":0.0010574572,"about_ca_topic_score_gemma":0.0007053471,"teacher_disagreement_score":0.017134145,"about_ca_system_score_codex":0.0005649428,"about_ca_system_score_gemma":0.00023239617,"threshold_uncertainty_score":0.057319462},"labels":[],"label_agreement":null},{"id":"W4415667499","doi":"10.55016/ojs/cdm.v20i2.77435","title":"Combinatorics of certain classes of plane partitions","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Plane (geometry); Lattice (music); Recurrence relation; Enumerative combinatorics; Partition (number theory)","score_opus":0.02063832478237387,"score_gpt":0.35213868945420823,"score_spread":0.33150036467183436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667499","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.88620186,0.00047517635,0.06300116,0.00043062953,0.00007005313,0.00007209889,0.00028055345,0.00020631116,0.049262058],"genre_scores_gemma":[0.9785261,0.0004212621,0.011631236,0.00009846086,0.00008822979,0.00011221102,0.0003990528,0.00009746664,0.008625939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958867,0.00007838104,0.000018114652,0.000089403315,0.000116210686,0.00010925294],"domain_scores_gemma":[0.9991654,0.00030300408,0.00021902798,0.00013283071,0.00006756629,0.00011214649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002848605,0.0003163485,0.00040084738,0.0013802791,0.0013019943,0.0023015495,0.0008364601,0.00066712144,0.0062659257],"category_scores_gemma":[0.0019860761,0.0003510885,0.00051045296,0.0011828189,0.0016333604,0.0023554135,0.00086382346,0.001109233,0.00042468216],"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.000060209593,0.000039433875,0.0010557804,0.00004383203,0.000009038266,0.00021753367,0.00026890915,0.003591559,0.0033964852,0.9826309,0.000981504,0.0077047665],"study_design_scores_gemma":[0.000057954963,0.000040024348,0.0022640517,0.00002570412,0.00002029986,0.0008082547,0.0003895137,0.024549497,0.0030339803,0.95969504,0.009079141,0.000036505055],"about_ca_topic_score_codex":0.00090064574,"about_ca_topic_score_gemma":0.0011214317,"teacher_disagreement_score":0.0062659257,"about_ca_system_score_codex":0.0007744709,"about_ca_system_score_gemma":0.00038354652,"threshold_uncertainty_score":0.020961642},"labels":[],"label_agreement":null},{"id":"W4415667510","doi":"10.55016/ojs/cdm.v20i2.77692","title":"Congruence properties modulo powers of 2 for partition pairs into distinct parts","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Chongqing Municipal Education Commission; National Natural Science Foundation of China; Chongqing Normal University","keywords":"Congruence relation; Modulo; Congruence (geometry); Partition (number theory); Integer (computer science)","score_opus":0.025206321514830907,"score_gpt":0.336200561591672,"score_spread":0.31099424007684107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667510","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.57529205,0.0023305602,0.21640797,0.0038184698,0.0011851346,0.0003615382,0.0006566279,0.00044303093,0.19950457],"genre_scores_gemma":[0.9485736,0.0009040468,0.03752733,0.0005952177,0.0010183075,0.00027653767,0.0005777584,0.00019301796,0.010334277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962131,0.0006942822,0.0003018988,0.0009951683,0.00093928486,0.0008563904],"domain_scores_gemma":[0.9944659,0.003024385,0.00083397276,0.00064876815,0.00048462392,0.0005423024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002426803,0.0009187712,0.0012716558,0.0012801741,0.0031267798,0.0041109873,0.00083842233,0.0009527957,0.008746537],"category_scores_gemma":[0.010977533,0.00065279007,0.0019804083,0.0012615258,0.006445497,0.0066410312,0.002899691,0.004255981,0.0011971188],"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.000094233525,0.000060610782,0.0013258632,0.000062096966,0.000011416865,0.00042055093,0.0013279372,0.00040014146,0.0042720763,0.98419976,0.0016562216,0.00616911],"study_design_scores_gemma":[0.00007161254,0.000050132257,0.00094949274,0.000033465007,0.0000177393,0.00040913068,0.00036571224,0.003201766,0.0035381792,0.9838035,0.0075337538,0.00002562875],"about_ca_topic_score_codex":0.0010697092,"about_ca_topic_score_gemma":0.00080373086,"teacher_disagreement_score":0.008746537,"about_ca_system_score_codex":0.0017380575,"about_ca_system_score_gemma":0.00087514496,"threshold_uncertainty_score":0.029260099},"labels":[],"label_agreement":null},{"id":"W4415667515","doi":"10.55016/ojs/cdm.v20i2.79510","title":"Fibonacci numbers and n-color compositions","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Bijection; Rectangle; Composition (language); Tile; Type (biology); Generating function","score_opus":0.010623081193120451,"score_gpt":0.347479074236419,"score_spread":0.33685599304329855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667515","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.43020934,0.004064132,0.42517757,0.0015599316,0.0005338197,0.000120065866,0.00017013725,0.00021944763,0.13794556],"genre_scores_gemma":[0.84794044,0.0014727582,0.12727329,0.00045742907,0.0002777117,0.0002305112,0.00015102913,0.000071219154,0.02212558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939334,0.00018932548,0.00004207476,0.0001331981,0.00016516255,0.00007697226],"domain_scores_gemma":[0.9987865,0.0007460843,0.000120215176,0.00013173322,0.00012559035,0.000089872985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007496646,0.00051183207,0.00044759398,0.0009434862,0.0014615844,0.0012488746,0.00047421377,0.00081018225,0.0031735937],"category_scores_gemma":[0.0025527524,0.00036976463,0.0006876919,0.00092779106,0.0026904447,0.0022757049,0.0010501607,0.0013165527,0.00047962854],"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.000052109433,0.000016388098,0.00036422038,0.000046047327,0.000006236572,0.000068449735,0.00017819513,0.006384253,0.0027875286,0.9742338,0.00077566307,0.015087169],"study_design_scores_gemma":[0.000022217879,0.000039699476,0.0007875552,0.00002208989,0.000011381771,0.00029820387,0.00010257202,0.022747139,0.0030264044,0.9592485,0.0136654815,0.000028714094],"about_ca_topic_score_codex":0.0012072439,"about_ca_topic_score_gemma":0.0014583672,"teacher_disagreement_score":0.0031735937,"about_ca_system_score_codex":0.0012585596,"about_ca_system_score_gemma":0.00064728875,"threshold_uncertainty_score":0.01061672},"labels":[],"label_agreement":null},{"id":"W4415667530","doi":"10.55016/ojs/cdm.v20i2.78838","title":"Congruence properties of 8- and 9-colored generalized Frobenius partitions modulo 5","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Chongqing Municipal Education Commission; National Natural Science Foundation of China","keywords":"Modulo; Congruence relation; Congruence (geometry); Characterization (materials science); Frobenius group; Generating function","score_opus":0.026906898225007178,"score_gpt":0.33024857039805644,"score_spread":0.30334167217304925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667530","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.9196532,0.00024938467,0.026082741,0.0003202245,0.00010316031,0.000040776522,0.00007615951,0.00006199227,0.053412408],"genre_scores_gemma":[0.98862153,0.00010886643,0.0055427235,0.000080739715,0.00007809116,0.000048402755,0.000067737004,0.000024183762,0.005427644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992471,0.00013334102,0.00003653286,0.00013884631,0.00019976028,0.00024442674],"domain_scores_gemma":[0.9993998,0.00021725839,0.000100116624,0.00006826221,0.00008882878,0.0001257887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079892174,0.0003725512,0.0004293953,0.00083519216,0.0016373596,0.0016999949,0.0006611979,0.00044093124,0.0033931567],"category_scores_gemma":[0.0020667226,0.00024733215,0.0005960041,0.00043185955,0.0027716297,0.0018051965,0.0010360462,0.0010155303,0.00032931182],"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.00005046203,0.000013778917,0.00046262838,0.000013273949,0.000003512339,0.000101711885,0.00035074924,0.0006464843,0.0037412287,0.9918174,0.00025014,0.0025486527],"study_design_scores_gemma":[0.0000530128,0.00008281102,0.0018687763,0.000030450472,0.0000149549005,0.000414381,0.00037857844,0.011799872,0.008648839,0.97067934,0.00598756,0.000041304607],"about_ca_topic_score_codex":0.0012807156,"about_ca_topic_score_gemma":0.0011800095,"teacher_disagreement_score":0.0033931567,"about_ca_system_score_codex":0.00121626,"about_ca_system_score_gemma":0.00074869586,"threshold_uncertainty_score":0.011351168},"labels":[],"label_agreement":null},{"id":"W4415667533","doi":"10.55016/ojs/cdm.v20i2.79191","title":"More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degenerate energy levels; Time complexity; Set (abstract data type); Polynomial; Incentive; Approximation algorithm","score_opus":0.007930120359548974,"score_gpt":0.29739604898819866,"score_spread":0.28946592862864967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667533","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.041476753,0.0028384174,0.9077598,0.0065406235,0.00034689732,0.00033987476,0.0006772464,0.0003431519,0.039677333],"genre_scores_gemma":[0.518606,0.005734672,0.42656824,0.00292466,0.0021718794,0.0013769066,0.00275491,0.0009185823,0.038944047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995701,0.0015040571,0.00020435364,0.0010805452,0.00098575,0.0005241711],"domain_scores_gemma":[0.98253953,0.013556127,0.0010534793,0.0012931707,0.00083014934,0.000727512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042375773,0.0031105103,0.0024974726,0.0024536103,0.0021917182,0.006654905,0.003975144,0.004001829,0.01609147],"category_scores_gemma":[0.023010885,0.0013132334,0.0032726137,0.004013363,0.0035275226,0.015771773,0.0037173124,0.0076850294,0.0014831913],"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.00018571824,0.0004858705,0.0013107592,0.00072764076,0.00017053357,0.00015182649,0.0005690801,0.161669,0.0015228821,0.7782664,0.014825122,0.0401152],"study_design_scores_gemma":[0.00008380366,0.000063470965,0.00035921118,0.00007122628,0.000056637262,0.000090054076,0.00014917464,0.1788751,0.00040747708,0.8137199,0.0060945493,0.000029382632],"about_ca_topic_score_codex":0.0021464955,"about_ca_topic_score_gemma":0.002755301,"teacher_disagreement_score":0.01609147,"about_ca_system_score_codex":0.003996395,"about_ca_system_score_gemma":0.0019506875,"threshold_uncertainty_score":0.05383134},"labels":[],"label_agreement":null},{"id":"W7077040308","doi":"10.55016/ojs/cdm.v9i1.62082","title":"Kneser-Poulsen conjecture for a small number of intersections","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Conjecture; Intersection (aeronautics); Euclidean space; Finite set; Euclidean geometry; Space (punctuation)","score_opus":0.01322533616434461,"score_gpt":0.2781463071464873,"score_spread":0.2649209709821427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077040308","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.6287479,0.002185653,0.19374476,0.007591592,0.0006451099,0.00012639357,0.000681862,0.0014991232,0.16477764],"genre_scores_gemma":[0.9674906,0.00063568616,0.0185308,0.00065890624,0.00037301984,0.00022405482,0.0005688155,0.00016925372,0.011348868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949911,0.00075484597,0.0003289433,0.001730689,0.0011832674,0.0010111297],"domain_scores_gemma":[0.9783512,0.013303664,0.0016819731,0.0036848304,0.0013308143,0.0016474207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032631257,0.000915063,0.0026038378,0.002314341,0.0056017586,0.0046305424,0.0036187307,0.0038289316,0.011590117],"category_scores_gemma":[0.03038548,0.0011807493,0.001875058,0.0020218329,0.008531338,0.013751979,0.006861893,0.006754714,0.0019019599],"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.0006102211,0.00013034054,0.0034124616,0.0002574153,0.000054356366,0.00065909186,0.00076577347,0.021620842,0.003117693,0.9503827,0.0057483455,0.013240765],"study_design_scores_gemma":[0.00009881051,0.00010285021,0.0009461293,0.000049993374,0.000045934463,0.0004896523,0.00031503063,0.034113728,0.0024224408,0.9559234,0.0054399455,0.000052047042],"about_ca_topic_score_codex":0.0012432904,"about_ca_topic_score_gemma":0.00092336186,"teacher_disagreement_score":0.011590117,"about_ca_system_score_codex":0.0016838593,"about_ca_system_score_gemma":0.0009905495,"threshold_uncertainty_score":0.03877282},"labels":[],"label_agreement":null},{"id":"W7077041364","doi":"10.55016/ojs/cdm.v9i2.62096","title":"An inductive construction of ( 2 , 1 ) -tight graphs","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Simple (philosophy); Characterization (materials science); Extension (predicate logic); Cograph; Block graph; Split graph; Graph; Simple graph; Induced subgraph","score_opus":0.020236424578296636,"score_gpt":0.28178024534876384,"score_spread":0.26154382077046723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077041364","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.123778835,0.0003772664,0.7410477,0.00095501705,0.0002679039,0.00032255152,0.00067434,0.0013810707,0.13119538],"genre_scores_gemma":[0.57279605,0.00058377144,0.36315092,0.0007426587,0.00010084522,0.0004396965,0.0013379846,0.0006112224,0.060236935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889994,0.0002272617,0.000037122456,0.0002756144,0.0002710109,0.000289028],"domain_scores_gemma":[0.9988643,0.00039622563,0.00008425392,0.00018132341,0.00024229924,0.00023151444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077078847,0.00068084756,0.0005001964,0.0013596197,0.0020942788,0.0015813509,0.001678006,0.00084487017,0.009307629],"category_scores_gemma":[0.0022974287,0.0009982864,0.000817743,0.0012953492,0.0023953551,0.0034503117,0.0060912943,0.0028314025,0.0019483587],"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.000033979402,0.00005131847,0.0003484588,0.00009479922,0.000010078085,0.0004154581,0.0010089409,0.0016444769,0.011363464,0.968251,0.0028889885,0.013889063],"study_design_scores_gemma":[0.000030866504,0.00006283161,0.0008982135,0.000059553513,0.00003771981,0.00045261247,0.000887129,0.008251334,0.014896373,0.90053153,0.07384345,0.00004843989],"about_ca_topic_score_codex":0.002110485,"about_ca_topic_score_gemma":0.0036254781,"teacher_disagreement_score":0.009307629,"about_ca_system_score_codex":0.0011991097,"about_ca_system_score_gemma":0.00080420205,"threshold_uncertainty_score":0.031137109},"labels":[],"label_agreement":null},{"id":"W7077044566","doi":"10.55016/ojs/cdm.v9i2.62197","title":"A short construction of highly chromatic digraphs without short cycles","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Vertex (graph theory); Chromatic scale; Graph; Directed graph; Critical graph; Graph theory; Set (abstract data type)","score_opus":0.02168195850709097,"score_gpt":0.2807279845701072,"score_spread":0.25904602606301624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077044566","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.08699037,0.0016307855,0.7892846,0.0011202354,0.00055964675,0.0002333057,0.0010799769,0.00087202375,0.11822908],"genre_scores_gemma":[0.59451,0.001576996,0.35080078,0.000767084,0.00018002106,0.000341837,0.0013338313,0.00027921057,0.050210144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977916,0.000047594796,0.000012030935,0.00007323921,0.000046614,0.00004136543],"domain_scores_gemma":[0.9995474,0.00013919342,0.000038775972,0.000090109716,0.00006138354,0.00012312335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022640241,0.0003979097,0.00029007814,0.0008305621,0.0014585895,0.0009179412,0.00056346826,0.00040711314,0.007371395],"category_scores_gemma":[0.00077776134,0.00051559217,0.00045790698,0.0009554574,0.0009928079,0.0009952944,0.002067838,0.0015060633,0.0011555386],"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.00002390026,0.000019128285,0.00023970392,0.0000706922,0.0000063449743,0.00016487562,0.0002187257,0.0016413959,0.005916367,0.968778,0.0032512287,0.019669635],"study_design_scores_gemma":[0.000029160685,0.00007895695,0.0006395065,0.000050016937,0.000024270208,0.000422944,0.0001315709,0.00972443,0.00469122,0.8649624,0.11920857,0.000036905367],"about_ca_topic_score_codex":0.0007662511,"about_ca_topic_score_gemma":0.001964078,"teacher_disagreement_score":0.007371395,"about_ca_system_score_codex":0.0008006499,"about_ca_system_score_gemma":0.0004016514,"threshold_uncertainty_score":0.024659753},"labels":[],"label_agreement":null},{"id":"W7077061421","doi":"10.55016/ojs/cdm.v9i2.62188","title":"A note on bounds for the cop number using tree decompositions","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Upper and lower bounds; Tree (set theory); K-ary tree; Spanning tree; Search tree","score_opus":0.04074603487903802,"score_gpt":0.337051299723855,"score_spread":0.296305264844817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077061421","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.017063858,0.017475186,0.8588689,0.0068477266,0.0039896644,0.00012245848,0.0008535315,0.0008805129,0.09389816],"genre_scores_gemma":[0.3553267,0.038148195,0.55068237,0.005300993,0.011157742,0.001192852,0.0019957318,0.003751928,0.032443464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953507,0.0009960828,0.00023555597,0.0010382009,0.001573111,0.00080627966],"domain_scores_gemma":[0.9752391,0.018482883,0.0009985284,0.0027316855,0.0014654087,0.001082346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004769332,0.002873278,0.002896573,0.0049149534,0.0026199666,0.0060182335,0.003940886,0.002090923,0.016584037],"category_scores_gemma":[0.028093966,0.001396788,0.003081929,0.006394401,0.0047722254,0.016030794,0.0071006967,0.015280116,0.0049814875],"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.00023644637,0.00011493601,0.0009875572,0.0006944153,0.00010154081,0.00043698968,0.00030218656,0.02113124,0.0054743453,0.8497901,0.04386717,0.076863006],"study_design_scores_gemma":[0.000021812775,0.0000829034,0.0007481114,0.00028750705,0.00007686896,0.00034165502,0.00007325639,0.057953067,0.0036715176,0.8932406,0.04342596,0.00007660412],"about_ca_topic_score_codex":0.0015421052,"about_ca_topic_score_gemma":0.0015012367,"teacher_disagreement_score":0.016584037,"about_ca_system_score_codex":0.0028467635,"about_ca_system_score_gemma":0.0011550862,"threshold_uncertainty_score":0.05547911},"labels":[],"label_agreement":null},{"id":"W7077063757","doi":"10.55016/ojs/cdm.v9i1.62145","title":"A short note on integer complexity","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integer (computer science); Constructive; Conjunction (astronomy); Upper and lower bounds; Radical of an integer; Integer programming","score_opus":0.02669197685879445,"score_gpt":0.29589102914232146,"score_spread":0.26919905228352703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077063757","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.004450423,0.067403,0.44148934,0.090574786,0.0794515,0.00013901081,0.0011422957,0.0019181352,0.3134316],"genre_scores_gemma":[0.14064169,0.07955695,0.34345976,0.061123725,0.15050863,0.00097296597,0.0020144007,0.0045314594,0.21719043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684393,0.00070811936,0.00020473578,0.00061889744,0.0013052498,0.00031907368],"domain_scores_gemma":[0.99015135,0.0075706267,0.00026852975,0.00068458304,0.00097600033,0.0003488042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029718874,0.0027404728,0.0015650481,0.0026166018,0.0030486942,0.0060880617,0.0024034875,0.0016785405,0.019248882],"category_scores_gemma":[0.013776422,0.0008069586,0.0019918755,0.0037927453,0.0050312486,0.014720436,0.0046480983,0.014346016,0.010869315],"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.00011902898,0.000052448748,0.00018520329,0.0003538962,0.000028315895,0.00018354309,0.00018578938,0.0015904113,0.0012213339,0.80091125,0.13807042,0.057098433],"study_design_scores_gemma":[0.000016455153,0.000054020948,0.00020416068,0.00017164381,0.000026133885,0.00014584501,0.000058258356,0.0015197914,0.0007198398,0.6712945,0.3257543,0.000034946],"about_ca_topic_score_codex":0.0022879567,"about_ca_topic_score_gemma":0.0016796228,"teacher_disagreement_score":0.019248882,"about_ca_system_score_codex":0.0035250778,"about_ca_system_score_gemma":0.0015625502,"threshold_uncertainty_score":0.06439388},"labels":[],"label_agreement":null},{"id":"W7077066995","doi":"10.55016/ojs/cdm.v9i1.62166","title":"Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Mathematical proof; Euler's formula; Linear algebra; Matrix (chemical analysis); Graph","score_opus":0.01977070169506495,"score_gpt":0.2746791818739244,"score_spread":0.2549084801788595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077066995","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.053756595,0.0008894594,0.91692066,0.00041062184,0.00037180143,0.00007156924,0.00013122636,0.00033746567,0.027110545],"genre_scores_gemma":[0.44687784,0.0020146149,0.51790303,0.0007072932,0.0011442337,0.00022860736,0.00037753468,0.0005344194,0.030212464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992441,0.00021312527,0.000045364224,0.00019697167,0.00022040789,0.00008004715],"domain_scores_gemma":[0.99888223,0.00031374034,0.00015933238,0.00032411903,0.00020022625,0.00012041684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000836031,0.00096671924,0.00064185547,0.0020186575,0.0010934741,0.0015226324,0.0015701604,0.0008602836,0.0062403246],"category_scores_gemma":[0.0017300673,0.000546371,0.0012935324,0.001359527,0.0024747069,0.004260789,0.002257306,0.0024544299,0.001505575],"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.000033602908,0.000043321397,0.00017220883,0.00007793533,0.000012911979,0.00013827065,0.00033976857,0.0078067738,0.0050661135,0.96786135,0.001314083,0.0171337],"study_design_scores_gemma":[0.000010007128,0.00008211634,0.00017057534,0.000024097146,0.000013877964,0.00024680392,0.00012716524,0.050868038,0.0034022343,0.92569244,0.019323582,0.000039076134],"about_ca_topic_score_codex":0.0010423076,"about_ca_topic_score_gemma":0.0016733739,"teacher_disagreement_score":0.0062403246,"about_ca_system_score_codex":0.0010322615,"about_ca_system_score_gemma":0.0004953572,"threshold_uncertainty_score":0.02087599},"labels":[],"label_agreement":null},{"id":"W7077068982","doi":"10.55016/ojs/cdm.v9i1.62207","title":"On the minimum order of k -cop win graphs","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Line graph; Conjecture; Graph isomorphism; Block graph; Cograph; Extremal graph theory; Cubic graph; 1-planar graph","score_opus":0.010731822499448682,"score_gpt":0.24769340644433716,"score_spread":0.23696158394488848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077068982","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.91636103,0.00029691734,0.061262414,0.00050516735,0.00003545245,0.000036187634,0.00044828045,0.00013366353,0.020920906],"genre_scores_gemma":[0.97936136,0.00025834443,0.017236378,0.000049937178,0.000049859515,0.000031714764,0.00043226444,0.000064654945,0.0025154846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999666,0.00005455653,0.000013155725,0.00008525939,0.00007837859,0.000102673395],"domain_scores_gemma":[0.9973242,0.0015112959,0.0004027642,0.00024610246,0.00023808025,0.00027746652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038904414,0.00035385767,0.00056171854,0.0012937062,0.0010555082,0.001753317,0.0007924817,0.0004773376,0.0039060884],"category_scores_gemma":[0.0037918391,0.00027056658,0.00044567487,0.0009931495,0.0015955338,0.0025057432,0.0007363233,0.0011094613,0.00035457138],"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.00047311533,0.00014979448,0.011587454,0.00035413302,0.00004949138,0.00057331094,0.00071714056,0.0483305,0.013993476,0.87872994,0.00378945,0.04125223],"study_design_scores_gemma":[0.00003758703,0.00008766441,0.004211648,0.000041495998,0.000032956115,0.00043203673,0.00042997702,0.073478125,0.0071218493,0.9090275,0.005069214,0.000029860697],"about_ca_topic_score_codex":0.0009609226,"about_ca_topic_score_gemma":0.0012414674,"teacher_disagreement_score":0.0039060884,"about_ca_system_score_codex":0.0008631685,"about_ca_system_score_gemma":0.0005563449,"threshold_uncertainty_score":0.013067186},"labels":[],"label_agreement":null},{"id":"W7077069286","doi":"10.55016/ojs/cdm.v9i2.62210","title":"Colouring isonemal fabrics with more than two colours by thin striping","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Data striping; Redundancy (engineering); Yarn; Thin film","score_opus":0.016516769514012302,"score_gpt":0.2757659268468366,"score_spread":0.2592491573328243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077069286","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.5375521,0.000699158,0.4078645,0.00019209499,0.00031025894,0.000058272195,0.00018227054,0.0010967696,0.052044533],"genre_scores_gemma":[0.8187067,0.0004156664,0.17027938,0.000072977855,0.00004406577,0.00003354573,0.0001743156,0.00031031523,0.009963069],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974126,0.00005309463,0.000017154094,0.00005161251,0.00007387322,0.000063025764],"domain_scores_gemma":[0.9992698,0.0001341567,0.00009028526,0.00031406624,0.000105830855,0.00008592663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028497566,0.0005391422,0.0003954645,0.000666508,0.00043944083,0.0010237449,0.00045752543,0.00019092637,0.00356654],"category_scores_gemma":[0.0009053137,0.00027872738,0.00045998723,0.00052253774,0.0012082113,0.0008581357,0.0008848116,0.00061107613,0.00072724844],"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.0013600584,0.00013710091,0.004720023,0.0007331561,0.0000983984,0.0012911346,0.0007967075,0.069110736,0.36589038,0.18279307,0.0053520994,0.36771715],"study_design_scores_gemma":[0.00014730741,0.0014102939,0.014278867,0.000253995,0.0001476627,0.0038694232,0.001245433,0.22674216,0.3421078,0.30935442,0.1001975,0.00024512244],"about_ca_topic_score_codex":0.0005242524,"about_ca_topic_score_gemma":0.00068941934,"teacher_disagreement_score":0.00356654,"about_ca_system_score_codex":0.0002638114,"about_ca_system_score_gemma":0.0001437078,"threshold_uncertainty_score":0.011931241},"labels":[],"label_agreement":null},{"id":"W7077075033","doi":"10.55016/ojs/cdm.v9i2.62306","title":"The copnumber for lexicographic products and sums of graphs","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Product (mathematics); Graph; Order (exchange)","score_opus":0.012957782654969715,"score_gpt":0.285722008374653,"score_spread":0.2727642257196833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077075033","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.36912447,0.004606823,0.40961263,0.0026859115,0.0014604497,0.000196031,0.0014976818,0.0005618932,0.21025404],"genre_scores_gemma":[0.85463095,0.003056323,0.11336432,0.0006141979,0.0016912041,0.00036852245,0.0013165034,0.0005290447,0.024428878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843794,0.0003034304,0.00011354706,0.00034248305,0.00055242795,0.0002501994],"domain_scores_gemma":[0.99494237,0.0029705968,0.0005310086,0.0004920225,0.00057662546,0.00048728555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013844789,0.0009254894,0.000938492,0.0038737275,0.002003419,0.0037063002,0.0010103148,0.00089432497,0.008340959],"category_scores_gemma":[0.009522459,0.00050402695,0.00091977976,0.0029040799,0.0032825773,0.007047209,0.002689397,0.0024835356,0.0015940428],"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.000063190775,0.000028573595,0.0006836512,0.0000912537,0.000011813628,0.00014449954,0.00020639272,0.0019317608,0.0015048851,0.9734514,0.0040798257,0.017802877],"study_design_scores_gemma":[0.000009045238,0.000023378385,0.0004717057,0.000036797748,0.000012524628,0.00038874085,0.000071248964,0.012253937,0.0013952253,0.973795,0.011520576,0.000021814381],"about_ca_topic_score_codex":0.00060990924,"about_ca_topic_score_gemma":0.00061906263,"teacher_disagreement_score":0.008340959,"about_ca_system_score_codex":0.0017041083,"about_ca_system_score_gemma":0.0008394531,"threshold_uncertainty_score":0.027903259},"labels":[],"label_agreement":null},{"id":"W7077076524","doi":"10.55016/ojs/cdm.v9i2.62105","title":"On cycle packings and feedback vertex sets","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Euler characteristic; Graph; Euler's formula; Upper and lower bounds; Feedback vertex set","score_opus":0.01745105219775858,"score_gpt":0.2720491629489269,"score_spread":0.25459811075116834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077076524","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.60009605,0.0060493695,0.3470846,0.0036435204,0.00035524848,0.00012638775,0.0011064924,0.0010265863,0.040511724],"genre_scores_gemma":[0.9332955,0.0027821735,0.05642283,0.0004668644,0.0004005623,0.00018624449,0.00079077284,0.0002515002,0.0054037096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986609,0.00032400546,0.00007589075,0.00030290135,0.0003139162,0.00032240667],"domain_scores_gemma":[0.9888024,0.008033073,0.0009192777,0.0010366576,0.000437381,0.00077113486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012686875,0.0011949714,0.0013807149,0.0022626463,0.0015040324,0.0020191243,0.002289944,0.0017674043,0.0071218465],"category_scores_gemma":[0.013960364,0.0007973125,0.00097275747,0.0026275807,0.003159061,0.0075494554,0.002987663,0.0017474082,0.00074208906],"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.0006325767,0.00015702634,0.0035559933,0.000425254,0.00007829787,0.00042827512,0.0005486223,0.19521403,0.010351841,0.7201983,0.0073076673,0.06110216],"study_design_scores_gemma":[0.00004026145,0.0001013466,0.0011165433,0.00008044787,0.00002381836,0.00021648606,0.00019062423,0.2192255,0.0036321385,0.770953,0.0043754373,0.00004436343],"about_ca_topic_score_codex":0.0020930166,"about_ca_topic_score_gemma":0.0019144944,"teacher_disagreement_score":0.0071218465,"about_ca_system_score_codex":0.0021753106,"about_ca_system_score_gemma":0.0005537566,"threshold_uncertainty_score":0.02382499},"labels":[],"label_agreement":null},{"id":"W7077079981","doi":"10.55016/ojs/cdm.v9i2.62169","title":"Chromatic polynomials of some sunflower mixed hypergraphs","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Chromatic scale; Chromatic polynomial; Vertex (graph theory); Monochromatic color; Function (biology); Set (abstract data type)","score_opus":0.020036650765849665,"score_gpt":0.26964203131677716,"score_spread":0.2496053805509275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077079981","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.77207136,0.00094333035,0.189852,0.000864946,0.00010155094,0.0000706545,0.00077936245,0.00019225274,0.035124466],"genre_scores_gemma":[0.96119785,0.00058776815,0.026085064,0.0001522556,0.0001304015,0.00005299689,0.0003263053,0.000062683066,0.011404799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996613,0.00005874642,0.000011680398,0.00008893545,0.000092695,0.000086551256],"domain_scores_gemma":[0.9989491,0.00049694016,0.00016461874,0.00008272185,0.00016143903,0.00014517776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046997043,0.00033962802,0.00034310174,0.001419733,0.0008941329,0.0012968243,0.0005440629,0.00039701586,0.0044946442],"category_scores_gemma":[0.002328748,0.00026070193,0.0005339363,0.0013222151,0.0009608356,0.0019998166,0.0006240071,0.0011932049,0.00024888487],"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.000207698,0.00005524157,0.0019397007,0.00011202437,0.000031054693,0.00016051631,0.0005288758,0.01819404,0.009216855,0.9419358,0.0024767576,0.025141302],"study_design_scores_gemma":[0.000055218665,0.000077107354,0.0037994273,0.000032850538,0.000028394084,0.00027703942,0.00020507655,0.12574875,0.004382439,0.8571363,0.008205245,0.000052210926],"about_ca_topic_score_codex":0.0025877825,"about_ca_topic_score_gemma":0.0025194066,"teacher_disagreement_score":0.0044946442,"about_ca_system_score_codex":0.0019164005,"about_ca_system_score_gemma":0.00061499426,"threshold_uncertainty_score":0.0150360465},"labels":[],"label_agreement":null},{"id":"W7104366022","doi":"10.55016/ojs/cdm.v20i1.77044","title":"The existence of hypersolids in $\\mathbb{E}^d$ whose Heesch number is $d-1$","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Existential quantification; Finite set; Natural number; Real number; Disjoint sets","score_opus":0.01670967034529522,"score_gpt":0.3527342548474622,"score_spread":0.336024584502167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104366022","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.62988245,0.0030673682,0.1421626,0.003995453,0.00071916956,0.00006109705,0.00050212303,0.00028049646,0.21932918],"genre_scores_gemma":[0.95445865,0.0007993321,0.022520527,0.00049864175,0.00019742863,0.00006465251,0.00034834418,0.00010522138,0.021007251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995943,0.00008839307,0.000020397365,0.000080337486,0.00011896879,0.000097706536],"domain_scores_gemma":[0.9983557,0.0007136058,0.00017792468,0.00013549293,0.00024972757,0.00036752026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053099263,0.0005789682,0.0005212131,0.001344455,0.0017272045,0.0016712213,0.00062249985,0.0008417319,0.005726366],"category_scores_gemma":[0.0035857775,0.00025085508,0.00053626386,0.00043166298,0.0030050501,0.0029161368,0.0020704926,0.001896958,0.00080095395],"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.00005088973,0.000009030818,0.0004127967,0.000055140852,0.0000060404845,0.0000839033,0.00011965344,0.0009674166,0.0028342195,0.99025226,0.0015699257,0.0036386477],"study_design_scores_gemma":[0.000021093212,0.000028416007,0.0009687506,0.000026525915,0.0000064295773,0.00029258744,0.00016524587,0.013086425,0.0033002326,0.97321653,0.008846249,0.000041456668],"about_ca_topic_score_codex":0.0009172964,"about_ca_topic_score_gemma":0.00084220007,"teacher_disagreement_score":0.005726366,"about_ca_system_score_codex":0.0010941301,"about_ca_system_score_gemma":0.00043372554,"threshold_uncertainty_score":0.019156635},"labels":[],"label_agreement":null},{"id":"W7104369327","doi":"10.55016/ojs/cdm.v20i1.75594","title":"Congruences modulo powers of 3 for 6-colored generalized Frobenius partitions","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Chongqing Municipal Education Commission; National Natural Science Foundation of China; Chongqing Normal University","keywords":"Congruence relation; Modulo; Conjecture; Generating function; Function (biology); Primitive root modulo n","score_opus":0.022595067870825717,"score_gpt":0.37132788343767686,"score_spread":0.34873281556685115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104369327","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.7598611,0.000675118,0.111270435,0.0016594665,0.0005953445,0.00015324821,0.00020135703,0.00026780387,0.12531619],"genre_scores_gemma":[0.98082626,0.0002679917,0.011664517,0.0002459263,0.00032243546,0.00007877184,0.00011663237,0.00009083313,0.006386543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985972,0.00026722567,0.00007157494,0.00029334615,0.00036350903,0.00040709277],"domain_scores_gemma":[0.99834895,0.00078315946,0.00022096063,0.00020937735,0.00018827124,0.0002492132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015774267,0.00082857715,0.00073969207,0.0009867849,0.002889301,0.0026710543,0.0005692057,0.00083976914,0.005358681],"category_scores_gemma":[0.005270128,0.0004276612,0.0016337198,0.0006281892,0.006731876,0.003564473,0.0022714918,0.0030848605,0.0008628047],"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.000046591824,0.000022523758,0.00080643647,0.000021977796,0.000003891357,0.00023624662,0.0006752702,0.00051344006,0.0019298196,0.9917008,0.00071210205,0.0033308538],"study_design_scores_gemma":[0.00003864242,0.000033550168,0.0006294615,0.00003076638,0.000010518258,0.0002965561,0.0003026339,0.003479555,0.0033467421,0.9871399,0.004663736,0.00002792008],"about_ca_topic_score_codex":0.0011832826,"about_ca_topic_score_gemma":0.00089799287,"teacher_disagreement_score":0.005358681,"about_ca_system_score_codex":0.0014076292,"about_ca_system_score_gemma":0.0008331076,"threshold_uncertainty_score":0.017926514},"labels":[],"label_agreement":null},{"id":"W7104378041","doi":"10.55016/ojs/cdm.v20i1.75051","title":"On the Directed Hamilton-Waterloo Problem with Two Cycle Sizes","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Directed graph; Directed acyclic graph; Optimization problem; Feedback arc set","score_opus":0.005041616138665181,"score_gpt":0.2342231469093046,"score_spread":0.2291815307706394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104378041","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.21037704,0.0034692243,0.56287235,0.01180861,0.0008273572,0.0007653744,0.0028831838,0.00063415954,0.20636271],"genre_scores_gemma":[0.6990963,0.0045902426,0.22800775,0.002494281,0.0011101445,0.00076244853,0.004071827,0.0004944848,0.05937248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983779,0.0005622874,0.00006987889,0.00034874186,0.00024951767,0.0003916019],"domain_scores_gemma":[0.99399155,0.0047621285,0.00029207897,0.00030349754,0.000313436,0.0003372965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016616161,0.001371409,0.001217912,0.0010115159,0.0021735148,0.0024615629,0.0018572834,0.0024991063,0.017404508],"category_scores_gemma":[0.010745915,0.000765075,0.00095817226,0.0017000093,0.002550118,0.007923494,0.0025854537,0.0029149044,0.0016525367],"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.00043637163,0.00017436389,0.0007037421,0.00039759057,0.000059271224,0.0003312342,0.00035346724,0.06777261,0.0017963137,0.84759337,0.03341983,0.04696181],"study_design_scores_gemma":[0.00014183293,0.00006531297,0.00022407279,0.00007049143,0.000027537659,0.00014669835,0.00022252803,0.085615315,0.0008540131,0.9032629,0.009326955,0.000042329135],"about_ca_topic_score_codex":0.00834036,"about_ca_topic_score_gemma":0.008646752,"teacher_disagreement_score":0.017404508,"about_ca_system_score_codex":0.0023715578,"about_ca_system_score_gemma":0.0021550201,"threshold_uncertainty_score":0.058223844},"labels":[],"label_agreement":null},{"id":"W7104379436","doi":"10.55016/ojs/cdm.v19i4.72290","title":"Moments of $q$-Jacobi polynomials and $q$-zeta values","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Dirichlet distribution; Orthogonal polynomials; Discrete orthogonal polynomials; Moment (physics); Classical orthogonal polynomials; Difference polynomials; Macdonald polynomials","score_opus":0.01660669962003441,"score_gpt":0.3635677643094129,"score_spread":0.3469610646893785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104379436","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.7265594,0.0022092445,0.15185675,0.0031733157,0.00076921337,0.000037274298,0.00019553726,0.00024893283,0.11495032],"genre_scores_gemma":[0.9807555,0.00059487944,0.006164958,0.00017812291,0.0004032152,0.000020439436,0.00004238661,0.000058540565,0.011781888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971,0.00006052546,0.000012571972,0.000054300122,0.00008517212,0.00007739575],"domain_scores_gemma":[0.99909174,0.00035527843,0.00016995946,0.00008426716,0.00011851794,0.00018026626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009314221,0.00057443866,0.00044759823,0.0017237443,0.00086458685,0.001917051,0.00090858666,0.0005698606,0.006264228],"category_scores_gemma":[0.0041730474,0.00022056155,0.00044224507,0.0008596076,0.0025948256,0.003125227,0.0012117317,0.0015659849,0.00062403147],"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.000015787864,0.0000070015667,0.00018369456,0.000015789685,0.0000019725937,0.000065547865,0.00011073747,0.000950163,0.0011393134,0.99502534,0.00033288525,0.002151705],"study_design_scores_gemma":[0.000008544881,0.000019796973,0.0004367246,0.000018807428,0.000003385332,0.00015004739,0.000105235675,0.009303993,0.0010608392,0.9867894,0.0020856387,0.000017643395],"about_ca_topic_score_codex":0.00058374566,"about_ca_topic_score_gemma":0.0004270373,"teacher_disagreement_score":0.006264228,"about_ca_system_score_codex":0.0011300186,"about_ca_system_score_gemma":0.00032790145,"threshold_uncertainty_score":0.02095598},"labels":[],"label_agreement":null},{"id":"W7104381216","doi":"10.55016/ojs/cdm.v19i4.73644","title":"On the permanent of an even-dimensional non-negative polystochastic tensor of order n","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rectangle; Hypercube; Order (exchange); Transversal (combinatorics); Tensor (intrinsic definition); Conjecture","score_opus":0.014606741465860275,"score_gpt":0.32863195459669126,"score_spread":0.314025213130831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104381216","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.52200764,0.00023714923,0.4549366,0.00049820996,0.00013072004,0.00011173979,0.0005841779,0.0013611786,0.020132575],"genre_scores_gemma":[0.8164717,0.00018557224,0.1745351,0.00010223477,0.00008212461,0.000083377956,0.0008977497,0.00033189016,0.007310266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999584,0.00006108702,0.000022860668,0.00008973903,0.00012489842,0.00011734799],"domain_scores_gemma":[0.99863064,0.0005964053,0.00019675688,0.00027711733,0.0001710122,0.0001280683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007083143,0.00056389056,0.00051295734,0.0009155937,0.0009158354,0.0009879618,0.0006235461,0.00038148588,0.006237108],"category_scores_gemma":[0.002688332,0.00025233513,0.0006952122,0.0005966912,0.0013613208,0.0027130703,0.0011777859,0.00074371276,0.0010336495],"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.0014476256,0.00031490895,0.0126693165,0.00068636803,0.00010086806,0.0013444747,0.000929164,0.1134186,0.09022079,0.5485081,0.013063106,0.21729663],"study_design_scores_gemma":[0.00007928772,0.00043875558,0.0034510668,0.00006994141,0.0000720352,0.0009032634,0.00051666173,0.44376746,0.047266297,0.49258956,0.010719873,0.00012580391],"about_ca_topic_score_codex":0.000862427,"about_ca_topic_score_gemma":0.0014226943,"teacher_disagreement_score":0.006237108,"about_ca_system_score_codex":0.000703214,"about_ca_system_score_gemma":0.0009602074,"threshold_uncertainty_score":0.020865262},"labels":[],"label_agreement":null},{"id":"W7104381928","doi":"10.55016/ojs/cdm.v19i4.70236","title":"Two families of strongly walk regular graphs from three-weight codes over $\\mathbb{Z_4}$","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Dual polyhedron; Generalization; Coset; Strongly regular graph; Code (set theory)","score_opus":0.006117288750354618,"score_gpt":0.2483047190128505,"score_spread":0.2421874302624959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104381928","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.7633713,0.00047324627,0.16569157,0.00086346874,0.00017225555,0.00013971009,0.00087841944,0.00048098929,0.067929015],"genre_scores_gemma":[0.9602041,0.00027962629,0.025646264,0.00022731072,0.0000452347,0.00014345416,0.00082603435,0.000120807876,0.012507272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996124,0.0000690867,0.00001652456,0.000105248735,0.000100935154,0.00009581517],"domain_scores_gemma":[0.9984377,0.0005586369,0.0002982547,0.00018446732,0.00023668505,0.00028422475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027861394,0.00045943444,0.00025156644,0.0010573575,0.0009156234,0.0011437774,0.00047042803,0.0007403476,0.0040653623],"category_scores_gemma":[0.0017286119,0.00039539175,0.00042208497,0.0005592934,0.0011837493,0.0010883969,0.0009667465,0.0013406058,0.00052179047],"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.00017240517,0.000049957336,0.0012471518,0.00009495211,0.000013319116,0.00079238,0.0005625842,0.0035342148,0.012039438,0.9653658,0.0025193049,0.013608477],"study_design_scores_gemma":[0.00007440554,0.000104697116,0.0029263555,0.00007843501,0.000031729345,0.0023098744,0.0005163426,0.031461716,0.014103326,0.9297936,0.01852185,0.000077650555],"about_ca_topic_score_codex":0.0007028402,"about_ca_topic_score_gemma":0.0011476781,"teacher_disagreement_score":0.0040653623,"about_ca_system_score_codex":0.0005204151,"about_ca_system_score_gemma":0.00045399665,"threshold_uncertainty_score":0.013599992},"labels":[],"label_agreement":null},{"id":"W7104391593","doi":"10.55016/ojs/cdm.v20i1.75149","title":"The flag $f$- and $h$- vectors of generalized Square posets","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Square (algebra); Flag (linear algebra); Quadrant (abdomen); Class (philosophy); Series (stratigraphy); Plane (geometry)","score_opus":0.011228172543707327,"score_gpt":0.33485808458918764,"score_spread":0.3236299120454803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104391593","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.7093493,0.0009279208,0.14000554,0.0008033803,0.0006491004,0.00008646154,0.0005303215,0.00037446685,0.14727348],"genre_scores_gemma":[0.9585848,0.00048597215,0.015024955,0.00020362288,0.00019395527,0.00006399254,0.00042014167,0.00011983051,0.024902724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968207,0.000055937504,0.000010974641,0.00006827766,0.00007093823,0.00011187516],"domain_scores_gemma":[0.99969006,0.00006492673,0.00006441747,0.000028034736,0.00006180704,0.000090657646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024085841,0.00067260955,0.00029467943,0.0012046294,0.00093751197,0.0016548685,0.00041529973,0.00043738278,0.012578415],"category_scores_gemma":[0.00085105293,0.00021658742,0.00034031106,0.00084190594,0.002490644,0.001985988,0.0011146166,0.000914233,0.0012328001],"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.00006123027,0.000019720326,0.0005775476,0.000035250425,0.000004267537,0.00019831664,0.00031117216,0.0018876266,0.0032771842,0.96859545,0.0022533254,0.0227788],"study_design_scores_gemma":[0.000027949025,0.000102184546,0.0013758437,0.000026644817,0.000005510106,0.00040448588,0.00059497636,0.0071665905,0.0030210954,0.9706783,0.016550353,0.00004596941],"about_ca_topic_score_codex":0.0013825616,"about_ca_topic_score_gemma":0.0014256252,"teacher_disagreement_score":0.012578415,"about_ca_system_score_codex":0.00047908255,"about_ca_system_score_gemma":0.00038922296,"threshold_uncertainty_score":0.04207903},"labels":[],"label_agreement":null},{"id":"W7104391789","doi":"10.55016/ojs/cdm.v20i1.76681","title":"The Involutive Double Coset Property for String C-groups of Affine Type","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coxeter group; Coset; Affine transformation; Type (biology); Property (philosophy); String (physics)","score_opus":0.02939503945327656,"score_gpt":0.3572650749736466,"score_spread":0.3278700355203701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104391789","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.7547886,0.00058954465,0.1250129,0.00044116384,0.0004029548,0.00007897188,0.00029689734,0.0001702383,0.11821882],"genre_scores_gemma":[0.976324,0.00042311486,0.00931314,0.00008241033,0.0001749682,0.000047004334,0.0003359341,0.000048659716,0.013250839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959797,0.00003605749,0.00003512035,0.00009263655,0.00013565869,0.00010257726],"domain_scores_gemma":[0.99956673,0.000085138876,0.00009889676,0.00008610082,0.00007669338,0.00008640649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028784497,0.0004300999,0.00037523892,0.0010015301,0.0014401259,0.002510784,0.00040604535,0.0004516997,0.0050122268],"category_scores_gemma":[0.00076981395,0.00013463963,0.0004662788,0.0010863169,0.0023934895,0.00230019,0.0010515627,0.0011814608,0.0005550303],"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.000059491547,0.000016482296,0.0007912385,0.000032249907,0.000004734897,0.0001898354,0.00026147265,0.0006376875,0.0036382223,0.9817587,0.00052455993,0.012085329],"study_design_scores_gemma":[0.000028972883,0.00015909577,0.0019172896,0.000039650742,0.000026038682,0.00087087427,0.0008107105,0.007282147,0.010510702,0.950715,0.027582305,0.000057315072],"about_ca_topic_score_codex":0.00059991056,"about_ca_topic_score_gemma":0.00050990126,"teacher_disagreement_score":0.0050122268,"about_ca_system_score_codex":0.00049657666,"about_ca_system_score_gemma":0.00042413027,"threshold_uncertainty_score":0.016767502},"labels":[],"label_agreement":null},{"id":"W7104391962","doi":"10.55016/ojs/cdm.v20i1.74305","title":"(G, s)-Transitive Graphs Of Valency 15","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Valency; Undirected graph; Transitive relation; Graph; Finite set; Set (abstract data type); Type (biology); Simple (philosophy)","score_opus":0.02224822933539634,"score_gpt":0.3647735727779849,"score_spread":0.34252534344258856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104391962","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.89258146,0.00024288062,0.050451797,0.00036187933,0.00008836652,0.00007478849,0.00070530415,0.00028027652,0.05521327],"genre_scores_gemma":[0.9758474,0.00017770218,0.015089404,0.00008228562,0.000033078806,0.000051280484,0.0007052456,0.000041220235,0.007972437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996563,0.00005360948,0.00002416,0.000102830665,0.00007548765,0.00008764015],"domain_scores_gemma":[0.99929845,0.00018000942,0.000203858,0.00009158417,0.00008377541,0.00014242213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021364643,0.00042513944,0.00032346178,0.0010387256,0.0011752163,0.001384875,0.00053863775,0.00036426107,0.0044253077],"category_scores_gemma":[0.0006477235,0.0002942078,0.0005234308,0.0007274134,0.0015924408,0.0010247817,0.0008315955,0.0005040663,0.00045689303],"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.0001485715,0.00004290488,0.0021249913,0.00010464142,0.000040280007,0.0009183403,0.0009426103,0.003462919,0.016062433,0.96131593,0.001801656,0.013034827],"study_design_scores_gemma":[0.000058775735,0.00013866379,0.004733033,0.00005387478,0.000094203424,0.001310164,0.00093703496,0.01722009,0.01321275,0.93815064,0.024038369,0.000052370033],"about_ca_topic_score_codex":0.0012811426,"about_ca_topic_score_gemma":0.0024440691,"teacher_disagreement_score":0.0044253077,"about_ca_system_score_codex":0.00074884604,"about_ca_system_score_gemma":0.00042551654,"threshold_uncertainty_score":0.014804184},"labels":[],"label_agreement":null},{"id":"W7104393302","doi":"10.55016/ojs/cdm.v19i4.76214","title":"Beta distributions whose moment sequences are related to integer sequences listed in the OEIS","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integer (computer science); Moment (physics); BETA (programming language); Integer sequence; Distribution (mathematics); Catalan number; Sequence (biology)","score_opus":0.021675570554427863,"score_gpt":0.34973408756364616,"score_spread":0.3280585170092183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104393302","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.2721471,0.004799947,0.58218676,0.0017295711,0.00086837803,0.00008558201,0.0009766556,0.00055410067,0.13665186],"genre_scores_gemma":[0.89669394,0.003545483,0.07797628,0.0006118,0.0011277251,0.00018093392,0.0007242307,0.0003178064,0.018821876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946195,0.00012093326,0.0000349289,0.00010413065,0.00017509577,0.0001029228],"domain_scores_gemma":[0.9975024,0.0012103735,0.00046332873,0.00021828672,0.00038183288,0.00022381963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010480778,0.00053310255,0.0005032936,0.0027323242,0.00064486364,0.001672654,0.0007202455,0.0005532032,0.007263837],"category_scores_gemma":[0.00810719,0.00032098914,0.00037551537,0.0016656616,0.0015457849,0.0027639726,0.0008160857,0.0019056647,0.0013365147],"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.00004184261,0.0000131635625,0.0009951513,0.000060241877,0.000005632427,0.00017145151,0.0001950192,0.0015424979,0.0034551038,0.9763109,0.0013479494,0.015861051],"study_design_scores_gemma":[0.00001320653,0.000051611707,0.0033068196,0.00006511234,0.0000096936865,0.001010498,0.00019001712,0.01566419,0.0036088177,0.95836836,0.017663727,0.00004789358],"about_ca_topic_score_codex":0.00046162235,"about_ca_topic_score_gemma":0.00025917185,"teacher_disagreement_score":0.007263837,"about_ca_system_score_codex":0.00071885757,"about_ca_system_score_gemma":0.00031138465,"threshold_uncertainty_score":0.02429998},"labels":[],"label_agreement":null},{"id":"W7104393363","doi":"10.55016/ojs/cdm.v19i4.71818","title":"A different approach to Gauss Fibonacci polynomials","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Fibonacci polynomials; Gauss; Order (exchange); Lucas number; Orthogonal polynomials; Recurrence relation; Matrix (chemical analysis)","score_opus":0.009833354105207125,"score_gpt":0.31760359261275234,"score_spread":0.3077702385075452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104393363","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.042892084,0.0038739615,0.8336153,0.003673737,0.0029901958,0.00008004964,0.00019492966,0.00030486967,0.11237489],"genre_scores_gemma":[0.5076889,0.00674942,0.42303464,0.003227111,0.0036171253,0.00015351386,0.00021910413,0.00031918447,0.054991055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995121,0.00011285306,0.000029937382,0.00010044732,0.00017050187,0.000074243355],"domain_scores_gemma":[0.9993912,0.0001765906,0.00005377384,0.00011461681,0.0002030021,0.000060866547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008400781,0.00077743595,0.00066706614,0.0021499044,0.0011406982,0.0017594494,0.0010932814,0.0010382596,0.004020446],"category_scores_gemma":[0.0017748694,0.00025836902,0.0012318663,0.0014811349,0.0021161071,0.003471847,0.0009133967,0.0028984353,0.0011583506],"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.000004682688,0.000007522797,0.000051117222,0.000025968493,0.0000026154362,0.000041169613,0.00013191825,0.0008551214,0.00092234643,0.9930668,0.00062402384,0.0042667254],"study_design_scores_gemma":[0.000009635002,0.000040136198,0.00017093522,0.000029002962,0.000010077405,0.00037741792,0.00009671297,0.019600073,0.0015947548,0.9372511,0.04078189,0.000038415463],"about_ca_topic_score_codex":0.0019818887,"about_ca_topic_score_gemma":0.0018883834,"teacher_disagreement_score":0.004020446,"about_ca_system_score_codex":0.0012607529,"about_ca_system_score_gemma":0.0009921971,"threshold_uncertainty_score":0.0134497285},"labels":[],"label_agreement":null},{"id":"W7104395180","doi":"10.55016/ojs/cdm.v19i4.74294","title":"Hankel determinants of certain sequences of Bernoulli polynomials","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vandermonde matrix; Bernoulli's principle; Bernoulli polynomials; Bernoulli number; Hankel matrix; Connection (principal bundle); Stirling number; Identity (music)","score_opus":0.02532810240919851,"score_gpt":0.3586381167658341,"score_spread":0.3333100143566356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104395180","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.1966669,0.0009148099,0.77472466,0.00053254946,0.00028150127,0.000046632857,0.00018427355,0.00033943748,0.0263093],"genre_scores_gemma":[0.9055145,0.000922569,0.08133328,0.0002367815,0.00031431456,0.00007263449,0.00019428805,0.00020806729,0.011203614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994342,0.00016263465,0.000019643006,0.000074582946,0.00020061086,0.00010830559],"domain_scores_gemma":[0.99698395,0.0014941919,0.00043491303,0.00025202855,0.00054567534,0.00028926865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012406418,0.0006442791,0.0004452509,0.0016192026,0.0004808185,0.0010369538,0.0007343853,0.0007088934,0.0042816247],"category_scores_gemma":[0.007952024,0.0002788805,0.0005453107,0.000838624,0.0014041127,0.001647995,0.0010037634,0.0013126419,0.000868876],"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.00004199144,0.000048463946,0.0010681517,0.000079202066,0.000022785583,0.00028740798,0.00019701771,0.034345716,0.00601849,0.9413162,0.0014967868,0.015077764],"study_design_scores_gemma":[0.000012661309,0.00004633735,0.0011876607,0.000043349,0.000013890908,0.00030563585,0.00007911393,0.44508794,0.005316996,0.5449638,0.0028907978,0.000051888142],"about_ca_topic_score_codex":0.00089048,"about_ca_topic_score_gemma":0.0010567583,"teacher_disagreement_score":0.0042816247,"about_ca_system_score_codex":0.00061483926,"about_ca_system_score_gemma":0.0006841811,"threshold_uncertainty_score":0.014323413},"labels":[],"label_agreement":null},{"id":"W7104401270","doi":"10.55016/ojs/cdm.v20i1.74719","title":"Fair partitions of the plane into incongruent pentagons","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Plane (geometry); Regular polygon; Euclidean geometry; Convex body; Convex curve","score_opus":0.012810862617321419,"score_gpt":0.33384873312555197,"score_spread":0.32103787050823057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104401270","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.49309093,0.00074277655,0.40686056,0.0013087705,0.0004517123,0.00014620488,0.0003387398,0.00025426925,0.096806064],"genre_scores_gemma":[0.9208233,0.00061786396,0.062758334,0.000305719,0.00015864562,0.00010630881,0.00030214575,0.00014012516,0.014787498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981086,0.0004982135,0.000084531624,0.00035898524,0.0005018357,0.0004478564],"domain_scores_gemma":[0.99725395,0.0010304867,0.00028204866,0.0008457471,0.00019323808,0.0003944926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141565,0.0007092252,0.0008043024,0.0008272203,0.0024577477,0.0044744955,0.0011696295,0.0006120139,0.0067749983],"category_scores_gemma":[0.005386649,0.0005606224,0.0007352042,0.0010232116,0.0036884872,0.0039486554,0.0046155313,0.0025839452,0.0009854448],"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.00041057618,0.000036708832,0.0007868112,0.000046776204,0.000028440661,0.00021400795,0.00039300474,0.019254755,0.0032477113,0.96026903,0.0026408855,0.0126711195],"study_design_scores_gemma":[0.00007646379,0.000077191195,0.0006588075,0.00004343558,0.000033572353,0.00034350835,0.00054170634,0.05331362,0.004699075,0.92446595,0.015716339,0.000030394724],"about_ca_topic_score_codex":0.0013366045,"about_ca_topic_score_gemma":0.0015620728,"teacher_disagreement_score":0.0067749983,"about_ca_system_score_codex":0.0009199138,"about_ca_system_score_gemma":0.00063096284,"threshold_uncertainty_score":0.022664607},"labels":[],"label_agreement":null},{"id":"W7104401656","doi":"10.55016/ojs/cdm.v20i1.75917","title":"On Freiman-Lev conjecture","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Conjecture; Set (abstract data type); Upper and lower bounds; Beal's conjecture; Finite set","score_opus":0.010861542113256363,"score_gpt":0.3285934601710092,"score_spread":0.31773191805775286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104401656","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.55622,0.0048094695,0.057932988,0.02121885,0.0013642967,0.00005696096,0.000926988,0.0008218802,0.35664856],"genre_scores_gemma":[0.9654988,0.0012421989,0.010041392,0.0027610657,0.0012235959,0.00011433096,0.0007179792,0.00013569086,0.018265009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984205,0.0002738902,0.00005538961,0.000423494,0.00036160197,0.00046522493],"domain_scores_gemma":[0.99743277,0.0013643659,0.00017823007,0.00034665162,0.00035016934,0.00032783902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019025328,0.0005038696,0.0011041095,0.0018843154,0.003931463,0.0025461887,0.0014728941,0.0020187602,0.00920175],"category_scores_gemma":[0.007995147,0.00038896335,0.0007832536,0.001467629,0.0045267213,0.0064636855,0.0028499232,0.0028673632,0.001887456],"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.00007970658,0.000040741055,0.0012319987,0.00007100116,0.0000081957105,0.00016727233,0.0004789611,0.00148553,0.0006205457,0.9723665,0.013911287,0.009538265],"study_design_scores_gemma":[0.000011414701,0.000017409655,0.00052750215,0.000030064295,0.0000054469706,0.00013285752,0.00017433157,0.004666363,0.00033349992,0.98649746,0.007584728,0.000018946654],"about_ca_topic_score_codex":0.0029378696,"about_ca_topic_score_gemma":0.00230811,"teacher_disagreement_score":0.00920175,"about_ca_system_score_codex":0.0019887602,"about_ca_system_score_gemma":0.0010031769,"threshold_uncertainty_score":0.030782878},"labels":[],"label_agreement":null},{"id":"W7128185158","doi":"10.55016/ojs/cdm.v8i2.62050","title":"Colouring stability two unit disk graphs","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Unit disk; Graph; Clique number; Clique; Unit disk graph; Stability (learning theory)","score_opus":0.03198840706107389,"score_gpt":0.3446661638066141,"score_spread":0.3126777567455402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128185158","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.8521401,0.00038130145,0.10602736,0.0011943823,0.00013638602,0.00007301067,0.0002760225,0.00039852096,0.03937283],"genre_scores_gemma":[0.9745043,0.00013275328,0.017250944,0.00018080654,0.000042071282,0.000044645076,0.00023001432,0.0000720143,0.0075425883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994598,0.00014743498,0.000017605273,0.00012269751,0.0001280344,0.00012430863],"domain_scores_gemma":[0.99596184,0.0021626165,0.00041568195,0.00047445393,0.00047234463,0.00051316357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710063,0.00046844684,0.0003529433,0.00074142497,0.0014543649,0.0013488734,0.0011426547,0.0009717432,0.0074808532],"category_scores_gemma":[0.0036433737,0.00030178798,0.00033072953,0.0007708818,0.0014019682,0.0017687811,0.0015343269,0.0014590202,0.00083233323],"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.0010444805,0.00026463284,0.0068455767,0.0004137906,0.00007735476,0.0006690236,0.0013864302,0.046446618,0.0772555,0.7994206,0.015063355,0.05111268],"study_design_scores_gemma":[0.0001699712,0.00026321935,0.0052215047,0.000051897492,0.000080513746,0.00071615505,0.0007406809,0.32355565,0.03806212,0.6132219,0.017844627,0.000071731665],"about_ca_topic_score_codex":0.0027026937,"about_ca_topic_score_gemma":0.002516117,"teacher_disagreement_score":0.0074808532,"about_ca_system_score_codex":0.0009484921,"about_ca_system_score_gemma":0.00042956317,"threshold_uncertainty_score":0.025025964},"labels":[],"label_agreement":null},{"id":"W7128185748","doi":"10.55016/ojs/cdm.v8i2.62187","title":"The exact maximal energy of integral circulant graphs with prime power order","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Circulant graph; Vertex (graph theory); Eigenvalues and eigenvectors; Adjacency list; Prime power; Graph energy; Prime (order theory)","score_opus":0.00858835654803806,"score_gpt":0.2641424108237592,"score_spread":0.25555405427572114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128185748","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.90561306,0.00069995254,0.0747537,0.00030482086,0.000035187717,0.000011672526,0.00017458976,0.00010844454,0.018298464],"genre_scores_gemma":[0.98980254,0.00027002348,0.007871733,0.0000389916,0.000044393106,0.000013542981,0.00012298134,0.000045037184,0.00179085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998554,0.000029949491,0.00000496545,0.000033103264,0.000035925957,0.000040613195],"domain_scores_gemma":[0.9992773,0.00044398787,0.00008682855,0.000068797504,0.00005543106,0.0000677048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024373383,0.0003891217,0.00039374764,0.0013521146,0.00047701393,0.0008558085,0.00046344593,0.00048080957,0.0020918886],"category_scores_gemma":[0.0023504961,0.00021377216,0.00021173066,0.0007719977,0.0013873602,0.0012606268,0.0005491224,0.0004426634,0.00018473295],"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.00013914035,0.000043980563,0.0035301177,0.00015689121,0.00003002883,0.00035998377,0.0003049068,0.09256969,0.0122527145,0.8576851,0.002465334,0.03046211],"study_design_scores_gemma":[0.000010243504,0.00003003598,0.0022580803,0.000026430827,0.000012359361,0.0002478297,0.00013848158,0.13825297,0.0040547517,0.85304004,0.0019096894,0.000019096364],"about_ca_topic_score_codex":0.00046636857,"about_ca_topic_score_gemma":0.00063275924,"teacher_disagreement_score":0.0020918886,"about_ca_system_score_codex":0.00050693034,"about_ca_system_score_gemma":0.00020933448,"threshold_uncertainty_score":0.006998062},"labels":[],"label_agreement":null},{"id":"W7128204003","doi":"10.55016/ojs/cdm.v8i2.62114","title":"Translation planes of order 23^2","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Complement (music); Translation (biology); Quotient; Order (exchange); Group (periodic table)","score_opus":0.04147051683289361,"score_gpt":0.3536022883380102,"score_spread":0.3121317715051166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128204003","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.5388723,0.0049700867,0.105221435,0.0030380455,0.0015665573,0.00017947149,0.0013730454,0.00088387844,0.3438952],"genre_scores_gemma":[0.90335894,0.0018418548,0.042461913,0.0004524351,0.00036183384,0.000084698644,0.0010662866,0.00021548982,0.050156586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965584,0.00004445321,0.000023054676,0.00005094151,0.000118150594,0.00010769405],"domain_scores_gemma":[0.9998393,0.000021974822,0.00003649307,0.000033771114,0.000043904336,0.000024550014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020106148,0.0007826239,0.0003781338,0.00081183505,0.0011698573,0.0013192545,0.00041798025,0.00041289258,0.008939433],"category_scores_gemma":[0.0004945766,0.00021364256,0.0006357766,0.0008101267,0.0012557445,0.0015374705,0.0014024483,0.0015886198,0.0014069363],"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.00021207464,0.000026909502,0.00063292176,0.00010822171,0.000026845573,0.0009968636,0.00066744216,0.0013965307,0.013467685,0.9255213,0.008800953,0.048142154],"study_design_scores_gemma":[0.000119487486,0.00023525397,0.0025660165,0.00006698219,0.00005624362,0.0029326468,0.0008120164,0.004235733,0.025551964,0.68296534,0.28035915,0.00009901676],"about_ca_topic_score_codex":0.0011149293,"about_ca_topic_score_gemma":0.000998032,"teacher_disagreement_score":0.008939433,"about_ca_system_score_codex":0.00084417657,"about_ca_system_score_gemma":0.00039487047,"threshold_uncertainty_score":0.029905438},"labels":[],"label_agreement":null},{"id":"W7128239256","doi":"10.55016/ojs/cdm.v8i2.62202","title":"Cycles, wheels, and gears in finite planes","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Finite element method; Projective plane; Element (criminal law); Finite geometry; Finite set; Projective test","score_opus":0.02631088053400683,"score_gpt":0.3341054009846059,"score_spread":0.3077945204505991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128239256","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.92731005,0.000489787,0.04224321,0.0002834666,0.000047232763,0.000020196472,0.00009459385,0.00010782948,0.029403742],"genre_scores_gemma":[0.98380697,0.00035902136,0.008867706,0.00003647525,0.000032422246,0.000017535249,0.00007675381,0.000028646251,0.006774553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981767,0.00003697149,0.000010609574,0.000039821378,0.00004017958,0.000054798016],"domain_scores_gemma":[0.9996402,0.00012591979,0.00008973911,0.00006738626,0.000028723704,0.000048046848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012671818,0.00028825365,0.00019740812,0.00069596234,0.000875072,0.001130332,0.00031328265,0.00047260456,0.0037815303],"category_scores_gemma":[0.0010190513,0.00029041435,0.0003030832,0.0006220351,0.0020266878,0.00228455,0.0012237774,0.00068235816,0.00038313813],"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.00011089795,0.000019811228,0.0014421027,0.00005735938,0.000008960254,0.00033765633,0.0009079987,0.007263287,0.0067374203,0.96164495,0.00068374554,0.020785796],"study_design_scores_gemma":[0.000025624828,0.00009037798,0.0016689843,0.00004190711,0.000017923201,0.00042133045,0.00070487073,0.01257094,0.0075259455,0.963492,0.013414171,0.000026094272],"about_ca_topic_score_codex":0.0016482224,"about_ca_topic_score_gemma":0.0016526908,"teacher_disagreement_score":0.0037815303,"about_ca_system_score_codex":0.00047519617,"about_ca_system_score_gemma":0.00017239952,"threshold_uncertainty_score":0.01265049},"labels":[],"label_agreement":null}]}