{"meta":{"query_hash":"957631600843","filters":{"venue":"Australas. J Comb."},"cohort_total":19,"direct_labels_cover":0,"predictions_cover":19,"exported":19,"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/957631600843","api":"https://metacan.xera.ac/api/v1/cohort?venue=Australas.+J+Comb."},"results":[{"id":"W206221419","doi":"","title":"A note on critical sets","year":2002,"lang":"es","type":"article","venue":"Australas. J Comb.","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":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Counterexample; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.06425381317664465,"score_gpt":0.37009303445390607,"score_spread":0.30583922127726143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206221419","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.07675177,0.07920053,0.30882698,0.088425584,0.022676017,0.00019848683,0.0014329018,0.001148326,0.42133933],"genre_scores_gemma":[0.6363102,0.041246276,0.14694089,0.015877554,0.013278721,0.00036084282,0.0014931591,0.00077055226,0.14372177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888843,0.00027806498,0.000055238917,0.0002547702,0.000388185,0.00013530845],"domain_scores_gemma":[0.9956519,0.0029447665,0.00008780866,0.00033160197,0.00071885803,0.00026499256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012830977,0.00066908513,0.00068201555,0.002623374,0.003685037,0.0025455977,0.0010817524,0.001089029,0.013764933],"category_scores_gemma":[0.0062252292,0.00046978344,0.00061438465,0.0026452118,0.0028043105,0.004458244,0.0027990898,0.0047606686,0.0016257765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039758193,0.000019155728,0.0005161116,0.00015410046,0.000010042366,0.00031465373,0.0004468372,0.0010511931,0.0011615895,0.89326036,0.060537435,0.04248876],"study_design_scores_gemma":[0.000012425323,0.000030427807,0.0004343762,0.000107571046,0.000011698275,0.0002888937,0.0002342504,0.002112144,0.0013400883,0.7235864,0.27182117,0.000020599877],"about_ca_topic_score_codex":0.006365597,"about_ca_topic_score_gemma":0.0075030494,"teacher_disagreement_score":0.013764933,"about_ca_system_score_codex":0.0024840438,"about_ca_system_score_gemma":0.0013715489,"threshold_uncertainty_score":0.046048343},"labels":[],"label_agreement":null},{"id":"W2184053848","doi":"","title":"A complete existence theory for Sarvate-Beam triple systems ∗","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cover (algebra); Block (permutation group theory); Combinatorics; Constant (computer programming); Variation (astronomy); Discrete mathematics; Computer science; Physics; Engineering","score_opus":0.037038494114212867,"score_gpt":0.23667583532448774,"score_spread":0.19963734121027488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184053848","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.07511942,0.0027430844,0.8231284,0.0021022372,0.00023500835,0.00009163832,0.00065854436,0.00030505497,0.095616594],"genre_scores_gemma":[0.79601926,0.0033233133,0.14722288,0.00095453946,0.00055281713,0.00050909934,0.0013014306,0.00019859537,0.049918015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898654,0.0002805309,0.000060960792,0.00019841085,0.00030596746,0.0001676186],"domain_scores_gemma":[0.99712,0.0016981544,0.00020965037,0.00022858194,0.0005917949,0.00015176882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016343801,0.0007659661,0.0009645803,0.002098173,0.0022544265,0.0030490523,0.0009917865,0.0019987016,0.009893233],"category_scores_gemma":[0.0033848477,0.00095041475,0.0011016751,0.0015627637,0.002061095,0.0062640733,0.002522956,0.0032098237,0.0017699281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010492549,0.000009472106,0.000060541493,0.000055107357,0.000007539502,0.000027362954,0.00013755684,0.0017432674,0.00030160873,0.9914334,0.0017873774,0.004426228],"study_design_scores_gemma":[0.000011310429,0.00003270042,0.00011948422,0.000046859193,0.000011744654,0.00009777589,0.000109643515,0.024681488,0.00050067605,0.9654698,0.008900883,0.00001758177],"about_ca_topic_score_codex":0.0005637562,"about_ca_topic_score_gemma":0.00064824807,"teacher_disagreement_score":0.009893233,"about_ca_system_score_codex":0.0015018693,"about_ca_system_score_gemma":0.0007688115,"threshold_uncertainty_score":0.033096194},"labels":[],"label_agreement":null},{"id":"W2184414793","doi":"","title":"Diameter of paired domination edge-critical graphs","year":2008,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Domination analysis; Graph; Induced subgraph; Discrete mathematics; Vertex (graph theory)","score_opus":0.04648292806852639,"score_gpt":0.31125548283966037,"score_spread":0.264772554771134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184414793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9351053,0.0013261271,0.048010048,0.00059112353,0.000040348954,0.00005914531,0.0010487809,0.00016384348,0.013655253],"genre_scores_gemma":[0.9869552,0.00057027716,0.010436866,0.00007828751,0.00006341839,0.00006180839,0.0006035495,0.000036657395,0.0011939919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994436,0.00009694367,0.0000352795,0.00019202246,0.00011072783,0.00012150744],"domain_scores_gemma":[0.9960765,0.0021016658,0.00071933056,0.0001825406,0.00031181506,0.0006081453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005098104,0.0003932943,0.00055746414,0.0014052016,0.0007503518,0.0014582451,0.0008562065,0.000621169,0.0014488036],"category_scores_gemma":[0.003188461,0.00049358216,0.00028915177,0.00070176437,0.0009649581,0.0016404111,0.0012086027,0.0004754268,0.0002383755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034408907,0.00029841907,0.071029834,0.001538598,0.0003840579,0.003694726,0.0036596193,0.19497068,0.18744466,0.43274894,0.01934148,0.08144806],"study_design_scores_gemma":[0.0002387242,0.00068181404,0.042603966,0.00022408212,0.00028874198,0.011621963,0.0022054568,0.3497661,0.058594853,0.4985322,0.035116542,0.0001255731],"about_ca_topic_score_codex":0.00038518792,"about_ca_topic_score_gemma":0.00030146906,"teacher_disagreement_score":0.0014582451,"about_ca_system_score_codex":0.0008746443,"about_ca_system_score_gemma":0.00026981466,"threshold_uncertainty_score":0.0063459873},"labels":[],"label_agreement":null},{"id":"W2184743223","doi":"","title":"Eternal domination on 3 × n grid graphs","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; St. Francis Xavier University","funders":"","keywords":"Dominating set; Vertex (graph theory); Domination analysis; Combinatorics; Mathematics; Grid; Graph; Computer science; Discrete mathematics","score_opus":0.06277409480743021,"score_gpt":0.32890396252145476,"score_spread":0.2661298677140246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184743223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7587713,0.0008430365,0.22414674,0.0007987309,0.00004569567,0.0000947026,0.0007821673,0.0003399798,0.014177741],"genre_scores_gemma":[0.9666918,0.00032394027,0.028870996,0.00010619015,0.0000212817,0.00004951911,0.00033249392,0.000034991153,0.003568747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941003,0.0002088401,0.000037136953,0.000121752746,0.00007568839,0.00014661695],"domain_scores_gemma":[0.9969541,0.0018002447,0.0004952555,0.00032282982,0.00016125804,0.00026630072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005877595,0.00032858585,0.00042548793,0.00052022067,0.0006133836,0.00078414986,0.0008003124,0.00036859105,0.0021982715],"category_scores_gemma":[0.0035115168,0.0002104177,0.0003049588,0.0005494381,0.00087514083,0.0013828739,0.00092254183,0.0004612349,0.00020681944],"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.0011676422,0.00013756934,0.012208072,0.00032601674,0.00013893288,0.00077157817,0.00052295567,0.7576421,0.017824966,0.13414879,0.006411042,0.0687004],"study_design_scores_gemma":[0.00008341055,0.00014268605,0.0033692159,0.000025703765,0.000029866094,0.00046581234,0.00022626338,0.8427219,0.0039169746,0.14350224,0.005490728,0.000025089956],"about_ca_topic_score_codex":0.003257047,"about_ca_topic_score_gemma":0.0040424485,"teacher_disagreement_score":0.003257047,"about_ca_system_score_codex":0.000788524,"about_ca_system_score_gemma":0.0003409495,"threshold_uncertainty_score":0.0073539615},"labels":[],"label_agreement":null},{"id":"W2188243551","doi":"","title":"A class of trees with equal broadcast and domination numbers","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Graph; Class (philosophy); Domination analysis; Dominating set; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.01560847507420745,"score_gpt":0.2673208201156543,"score_spread":0.25171234504144685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188243551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79983073,0.0013925999,0.13638468,0.0008558284,0.00011394857,0.000113917595,0.0012146577,0.00048283476,0.05961085],"genre_scores_gemma":[0.9734202,0.00059250003,0.0139301075,0.00024274921,0.0001860504,0.000100906625,0.00074870704,0.00007936924,0.01069952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884427,0.00013716919,0.000046719968,0.00027963283,0.00031336182,0.00037887646],"domain_scores_gemma":[0.99567765,0.0022464595,0.00066483946,0.00036213634,0.00038597255,0.00066292455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062812667,0.00031614534,0.00068752706,0.0015653775,0.0017954175,0.0028583969,0.0007811122,0.0009552498,0.0037772811],"category_scores_gemma":[0.0047635296,0.00030660388,0.0005658937,0.0012504006,0.0012783435,0.0022803326,0.0012208248,0.0009904475,0.0005001492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060641847,0.0001293389,0.008335337,0.00022572171,0.00007666103,0.00073653884,0.0014478607,0.038761325,0.015479576,0.87009794,0.011483244,0.05261998],"study_design_scores_gemma":[0.00024477774,0.00030920608,0.00940411,0.00008195728,0.000102543076,0.002951453,0.0009947398,0.20989245,0.0049614175,0.7317642,0.0392005,0.00009261637],"about_ca_topic_score_codex":0.0031828028,"about_ca_topic_score_gemma":0.0025365744,"teacher_disagreement_score":0.0037772811,"about_ca_system_score_codex":0.0017846104,"about_ca_system_score_gemma":0.0007855023,"threshold_uncertainty_score":0.012948275},"labels":[],"label_agreement":null},{"id":"W2188854178","doi":"","title":"The modular product and existential closure II","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","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":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Graph; Adjacency list; Adjacency matrix; Modular design; Closure (psychology); Discrete mathematics; Computer science","score_opus":0.025296255952936945,"score_gpt":0.28952756527783374,"score_spread":0.2642313093248968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188854178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66434723,0.000765729,0.27241185,0.00068089436,0.00019436918,0.000061458646,0.00020147997,0.00031049963,0.061026484],"genre_scores_gemma":[0.96765745,0.00019364046,0.025428848,0.00017223034,0.00008333378,0.0000404773,0.00014692721,0.00010778486,0.006169374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911493,0.00017305632,0.00004620633,0.00029274652,0.00018204734,0.00019101646],"domain_scores_gemma":[0.9984428,0.00052841246,0.00021010637,0.00037239102,0.00018913657,0.00025722967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012181035,0.00044876753,0.00040478332,0.0005315905,0.0010170552,0.0010953711,0.0006424993,0.00044847585,0.0032932754],"category_scores_gemma":[0.0025385658,0.00026593474,0.0009856104,0.00035940998,0.0039474685,0.0031322367,0.0025847135,0.0015185016,0.00029903644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008351634,0.000032594835,0.0010293922,0.00006616662,0.000015190075,0.00027054572,0.00054483133,0.0028815805,0.010490067,0.9708202,0.000735964,0.013029757],"study_design_scores_gemma":[0.000023871351,0.00023033115,0.0014233534,0.000034810837,0.00003437802,0.00078932557,0.0003172014,0.0134569295,0.016399978,0.9524987,0.014755442,0.000035654168],"about_ca_topic_score_codex":0.0004605925,"about_ca_topic_score_gemma":0.0002829584,"teacher_disagreement_score":0.0032932754,"about_ca_system_score_codex":0.0006800016,"about_ca_system_score_gemma":0.00037794458,"threshold_uncertainty_score":0.011017084},"labels":[],"label_agreement":null},{"id":"W2739569002","doi":"","title":"Even time constraints on the watchman's walk.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","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":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Neighbourhood (mathematics); Traverse; Combinatorics; Vertex (graph theory); Mathematics; Conjecture; Tree (set theory); Interval (graph theory); Computer science; Discrete mathematics; Graph; Geography; Cartography","score_opus":0.0222203577737518,"score_gpt":0.26578216034643154,"score_spread":0.24356180257267973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739569002","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.2929138,0.0010525064,0.6495919,0.0021291424,0.00043141562,0.00023580533,0.0014569078,0.00041847627,0.051769953],"genre_scores_gemma":[0.93234324,0.00076262245,0.050693177,0.00034620138,0.00012960903,0.0002667614,0.0006877595,0.00012653855,0.014644096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906915,0.00023060944,0.000060738574,0.00022197531,0.00014210862,0.00027545248],"domain_scores_gemma":[0.9923287,0.0047151474,0.00078881666,0.00077058375,0.00036595765,0.0010308005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011072999,0.00057678955,0.0006496313,0.00053648243,0.0010906751,0.0017235071,0.0011263057,0.0009993779,0.009295466],"category_scores_gemma":[0.010122936,0.000377852,0.00056306855,0.00059379643,0.0017220244,0.003670172,0.0014089362,0.0016988025,0.00084821734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030637765,0.0000379333,0.001202534,0.0001124261,0.00002613585,0.0004902445,0.00033889947,0.03277698,0.004932823,0.94769484,0.0024214834,0.009659361],"study_design_scores_gemma":[0.000110372705,0.00011715781,0.0006713636,0.00004834304,0.000027632255,0.0002421224,0.00018721979,0.12953019,0.001813542,0.85559905,0.011623589,0.00002938186],"about_ca_topic_score_codex":0.0034680592,"about_ca_topic_score_gemma":0.0059057926,"teacher_disagreement_score":0.009295466,"about_ca_system_score_codex":0.00085103995,"about_ca_system_score_gemma":0.0010428156,"threshold_uncertainty_score":0.031096399},"labels":[],"label_agreement":null},{"id":"W2739627166","doi":"","title":"A class of mutually inequivalent circulant weighing matrices.","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Order (exchange); Prime (order theory); Matrix (chemical analysis); Weight function; Prime power; Euler's totient function; Ternary operation; Discrete mathematics; Class (philosophy); Euler's formula; Mathematical analysis","score_opus":0.023509549341280165,"score_gpt":0.250974437196984,"score_spread":0.22746488785570382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739627166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5639816,0.0014290194,0.30069354,0.000769755,0.0005042314,0.00024755218,0.0007189108,0.0006117616,0.13104357],"genre_scores_gemma":[0.9489744,0.00035646942,0.036706537,0.00035004725,0.00021272794,0.0001457978,0.00045897908,0.000062897314,0.012732287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909616,0.00014675804,0.000053774067,0.00017906903,0.0003245358,0.00019980004],"domain_scores_gemma":[0.99864715,0.00046168818,0.0002906892,0.00021159428,0.0002232657,0.00016569339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004756781,0.0006287178,0.00033504656,0.0013589322,0.0010807146,0.0013488593,0.0004947461,0.00089588575,0.006388638],"category_scores_gemma":[0.0038532473,0.00029408888,0.00030983237,0.0008419782,0.00093496835,0.0012203476,0.0010163394,0.00082044554,0.0009918644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011147249,0.000054155047,0.0011060612,0.000056676872,0.000016487036,0.00036072286,0.00016397212,0.0030289502,0.015869724,0.94307417,0.0025199344,0.03363768],"study_design_scores_gemma":[0.000077313576,0.00018100785,0.0016634889,0.000044713415,0.000026923843,0.0017573596,0.00013476772,0.04950724,0.015085663,0.90413404,0.02731209,0.000075444426],"about_ca_topic_score_codex":0.00040305464,"about_ca_topic_score_gemma":0.00043749827,"teacher_disagreement_score":0.006388638,"about_ca_system_score_codex":0.0004419734,"about_ca_system_score_gemma":0.00051848707,"threshold_uncertainty_score":0.02137214},"labels":[],"label_agreement":null},{"id":"W2739728626","doi":"","title":"Seepage in directed acyclic graphs.","year":2009,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; Dalhousie University; St. Francis Xavier University; Acadia University","funders":"","keywords":"Cartesian product; Directed acyclic graph; Combinatorics; Directed graph; Vertex (graph theory); Sink (geography); Graph; Mathematics; Cartesian coordinate system; Computer science; Discrete mathematics; Geography; Geometry; Cartography","score_opus":0.027793257691119722,"score_gpt":0.2917460034780117,"score_spread":0.263952745786892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739728626","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.066526555,0.003220007,0.8570561,0.0036269238,0.00022453335,0.00055960077,0.0019722495,0.00144838,0.06536568],"genre_scores_gemma":[0.5953389,0.0051629036,0.3573407,0.001563235,0.00035788864,0.00091896264,0.003416745,0.00091657933,0.034984104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963198,0.001361577,0.0001828919,0.0008659457,0.00077833096,0.00049153785],"domain_scores_gemma":[0.96833926,0.022928195,0.00316743,0.0026076515,0.0014600548,0.0014974141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037225415,0.001984331,0.0016415329,0.0019966243,0.0017778584,0.0035052234,0.0029008149,0.0025272775,0.015160679],"category_scores_gemma":[0.024657646,0.0014027,0.0017230412,0.0031654448,0.0028281221,0.013739614,0.0036459577,0.0033440161,0.0026508737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041620206,0.00022209788,0.002534029,0.00083993655,0.00013647632,0.0005159089,0.00067049655,0.16079599,0.002199763,0.74840796,0.01503385,0.06822726],"study_design_scores_gemma":[0.000071328024,0.00020067896,0.0004766555,0.00012627993,0.00009140689,0.00069802714,0.00017765137,0.2330483,0.0013747186,0.73762274,0.026076455,0.000035837296],"about_ca_topic_score_codex":0.0037781638,"about_ca_topic_score_gemma":0.005717408,"teacher_disagreement_score":0.015160679,"about_ca_system_score_codex":0.0023215339,"about_ca_system_score_gemma":0.0018881721,"threshold_uncertainty_score":0.050717533},"labels":[],"label_agreement":null},{"id":"W2740078596","doi":"","title":"Edge contraction and cop-win critical graphs.","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","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":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Edge contraction; Combinatorics; Graph; Mathematics; Vertex (graph theory); Computer science; Discrete mathematics; Line graph; Voltage graph","score_opus":0.06036837910370964,"score_gpt":0.35186802948024765,"score_spread":0.291499650376538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740078596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6752552,0.00095971033,0.27947628,0.0012220668,0.00012095629,0.00043793285,0.0010813728,0.0003118354,0.041134585],"genre_scores_gemma":[0.9145024,0.00058718026,0.07264852,0.0003297891,0.000095664414,0.00025809667,0.0018569143,0.00014069873,0.009580762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990976,0.00020210096,0.000035235218,0.00029067643,0.00018441556,0.00019005663],"domain_scores_gemma":[0.9957349,0.0022160031,0.00061393576,0.00034814433,0.0003946309,0.00069241715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008133895,0.000876109,0.0009071956,0.0017281899,0.0016784342,0.0014887382,0.0012494535,0.0010822708,0.0059704483],"category_scores_gemma":[0.0053792563,0.0005217601,0.0006661078,0.0010068782,0.0025256071,0.0027715825,0.0015743611,0.0018130902,0.00060086243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049490924,0.00016126015,0.007097399,0.00039784278,0.00006252791,0.00068858056,0.00072857796,0.045346804,0.008654942,0.8862246,0.008371394,0.041771132],"study_design_scores_gemma":[0.000079627884,0.00018902055,0.003226886,0.000075921766,0.000054672928,0.0012061679,0.00089207495,0.14550824,0.0054030563,0.82632047,0.016993202,0.000050560044],"about_ca_topic_score_codex":0.0019119723,"about_ca_topic_score_gemma":0.0016294043,"teacher_disagreement_score":0.0059704483,"about_ca_system_score_codex":0.0012362907,"about_ca_system_score_gemma":0.00087238837,"threshold_uncertainty_score":0.019973159},"labels":[],"label_agreement":null},{"id":"W2740418798","doi":"","title":"Results for the n-queens problem on the Möbius board.","year":2008,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Impossibility; Combinatorics; Extension (predicate logic); Mathematics; Möbius strip; Set (abstract data type); Discrete mathematics; Computer science; Geometry","score_opus":0.13331857027828892,"score_gpt":0.33527375288947947,"score_spread":0.20195518261119055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740418798","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.29944265,0.0110941855,0.38594964,0.009151447,0.0013275307,0.00063665316,0.0014874248,0.00053885445,0.2903716],"genre_scores_gemma":[0.74667215,0.007983878,0.18096782,0.0031803455,0.0015575159,0.0008472372,0.0031615873,0.0004843164,0.055145152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814,0.0005639858,0.000087127235,0.0004204392,0.0004300828,0.00035837106],"domain_scores_gemma":[0.9906859,0.007128629,0.0005469315,0.0007253817,0.00037747758,0.0005357527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002155695,0.001739366,0.0014565567,0.001565645,0.002368232,0.0024557281,0.0031379666,0.0021931943,0.020932568],"category_scores_gemma":[0.016177375,0.00072159304,0.0023222112,0.0016237019,0.0027745995,0.0073566656,0.0031514764,0.0037652813,0.0018396956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077160465,0.00079445826,0.005905439,0.0023233986,0.00044167816,0.00055178604,0.0012421227,0.14605334,0.004431244,0.7391433,0.033345085,0.06499651],"study_design_scores_gemma":[0.00024729047,0.0003677484,0.0024981385,0.00034504881,0.0002388347,0.0006828925,0.000670948,0.18533616,0.0038502945,0.7568616,0.0488244,0.0000765183],"about_ca_topic_score_codex":0.001936654,"about_ca_topic_score_gemma":0.0023837187,"teacher_disagreement_score":0.020932568,"about_ca_system_score_codex":0.0015288529,"about_ca_system_score_gemma":0.0011422117,"threshold_uncertainty_score":0.0700264},"labels":[],"label_agreement":null},{"id":"W2741239897","doi":"","title":"Palettes in block colourings of designs.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Block (permutation group theory); Palette (painting); Combinatorics; Set (abstract data type); Steiner system; Computer science; Mathematics; Programming language; Operating system","score_opus":0.010623943380705287,"score_gpt":0.1830472357789416,"score_spread":0.1724232923982363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741239897","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.36358482,0.0015160698,0.57122326,0.00044820685,0.00025875476,0.00029367825,0.0009285614,0.0007000465,0.061046664],"genre_scores_gemma":[0.7205595,0.0009291589,0.25571063,0.00016699941,0.000108549044,0.00047959562,0.00070752,0.00020970001,0.021128353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982552,0.0005787838,0.00013502152,0.0003535906,0.00042631812,0.0002510556],"domain_scores_gemma":[0.99476385,0.003112052,0.00050638616,0.0010107185,0.00032007624,0.0002869542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014338476,0.0007782799,0.00079534174,0.0011402555,0.0012964933,0.0019354278,0.0008320069,0.0011527231,0.011543347],"category_scores_gemma":[0.0067138188,0.00088534836,0.0010637423,0.0010625856,0.0019351642,0.0036048945,0.0016936507,0.0016685472,0.0015898728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011255067,0.00010564393,0.0022815706,0.0005169777,0.00007600515,0.00045102023,0.0008163036,0.037969947,0.039471354,0.822519,0.0039400244,0.09072662],"study_design_scores_gemma":[0.000102233476,0.0004774338,0.0012911105,0.00015928708,0.000052658517,0.0006502233,0.00020350449,0.07084037,0.016815843,0.8887369,0.020610781,0.00005968984],"about_ca_topic_score_codex":0.00051779585,"about_ca_topic_score_gemma":0.0012784335,"teacher_disagreement_score":0.011543347,"about_ca_system_score_codex":0.00084966986,"about_ca_system_score_gemma":0.00042473924,"threshold_uncertainty_score":0.0386163},"labels":[],"label_agreement":null},{"id":"W2741373429","doi":"","title":"A construction of a class of graphs with depression three.","year":2014,"lang":"en","type":"article","venue":"Australas. J Comb.","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":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Class (philosophy); Graph; Path (computing); Discrete mathematics; Set (abstract data type); Computer science; Artificial intelligence","score_opus":0.019508305485154705,"score_gpt":0.2614906472667648,"score_spread":0.2419823417816101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741373429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4932746,0.0012579154,0.36148983,0.0024358293,0.0004034768,0.00050248374,0.0011937779,0.0013711227,0.13807094],"genre_scores_gemma":[0.87709135,0.00059909275,0.102987245,0.00070771464,0.0001689253,0.00029820116,0.00096509984,0.00019847834,0.016983818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970907,0.000037196067,0.000010313313,0.00009281274,0.000081257,0.000069223446],"domain_scores_gemma":[0.9990927,0.00016768902,0.0001306098,0.0001578267,0.00011269248,0.00033850185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036010463,0.000518984,0.00045892163,0.0016102806,0.0017395521,0.001190272,0.0009236861,0.0006903602,0.0042095114],"category_scores_gemma":[0.0012024392,0.00044090647,0.0006442435,0.00086407457,0.0016018952,0.0012065931,0.0019594876,0.0022524602,0.0008206485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078805424,0.00007771348,0.001649539,0.00007686546,0.000013283168,0.00057615794,0.00073033816,0.0021723378,0.01461387,0.9523073,0.0050222897,0.022681586],"study_design_scores_gemma":[0.00014402607,0.00013261271,0.0038654066,0.0000770952,0.000045334167,0.0021132773,0.0005269657,0.024844447,0.007219096,0.88177013,0.07919802,0.000063626445],"about_ca_topic_score_codex":0.0016647498,"about_ca_topic_score_gemma":0.0016827015,"teacher_disagreement_score":0.0042095114,"about_ca_system_score_codex":0.0011866671,"about_ca_system_score_gemma":0.0004702328,"threshold_uncertainty_score":0.014082253},"labels":[],"label_agreement":null},{"id":"W2741567607","doi":"","title":"A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Hypergraph; Combinatorics; Element (criminal law); Friendship; Mathematics; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis; Law; Social psychology","score_opus":0.013924922391757334,"score_gpt":0.21376289317708466,"score_spread":0.19983797078532733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741567607","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.365726,0.006816492,0.49389935,0.010120847,0.0006722493,0.00054617214,0.0063976482,0.0015170797,0.114304096],"genre_scores_gemma":[0.78477865,0.003206018,0.18581225,0.0013077273,0.00067754445,0.0007064017,0.003206134,0.00043185506,0.01987341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535996,0.0010591251,0.00030749425,0.0012180624,0.0009826819,0.0010727027],"domain_scores_gemma":[0.96369904,0.028081508,0.0016809427,0.0029789666,0.0011541276,0.0024053948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030482782,0.0014275326,0.0021801393,0.0021736482,0.0030168032,0.004643787,0.0040047946,0.0023065151,0.018646846],"category_scores_gemma":[0.022867987,0.00125473,0.0019799627,0.0022717123,0.0027956087,0.012046763,0.0045175403,0.0045716376,0.0027307605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027261102,0.0007882188,0.021694737,0.0021819323,0.0005619169,0.002137201,0.0021201323,0.056120664,0.041127317,0.6888491,0.040148817,0.14154384],"study_design_scores_gemma":[0.00036571213,0.0006188915,0.010386582,0.0004079016,0.00052135653,0.0063798698,0.001092994,0.22974081,0.02176267,0.6758837,0.052610945,0.00022858458],"about_ca_topic_score_codex":0.0014552029,"about_ca_topic_score_gemma":0.002693321,"teacher_disagreement_score":0.018646846,"about_ca_system_score_codex":0.0026615795,"about_ca_system_score_gemma":0.001194396,"threshold_uncertainty_score":0.062379897},"labels":[],"label_agreement":null},{"id":"W2753131102","doi":"","title":"Progressions of squares.","year":2003,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Arithmetic; Set (abstract data type); Computer science; Programming language","score_opus":0.11107815914143758,"score_gpt":0.3863829455289312,"score_spread":0.2753047863874936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753131102","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.10315022,0.013927327,0.27534583,0.0035849684,0.0031725413,0.00024277162,0.0036435893,0.00088720565,0.59604555],"genre_scores_gemma":[0.7028073,0.0058810236,0.120748445,0.0013154738,0.0024585898,0.0003392768,0.0029692363,0.0003547761,0.16312598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990325,0.00017616125,0.00008817009,0.00028250803,0.00031321796,0.00010754113],"domain_scores_gemma":[0.998606,0.0004355629,0.00024274558,0.00020399435,0.00034234705,0.00016934951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007028345,0.00076652097,0.00047609565,0.0022116064,0.0020539674,0.003493483,0.0007039922,0.0005994564,0.017299356],"category_scores_gemma":[0.0035691455,0.00038078646,0.00072240975,0.0018384563,0.0024340684,0.005816909,0.0020380283,0.0020632746,0.003927443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021372955,0.0000059586596,0.00014325831,0.00005716286,0.000003740541,0.000065337525,0.00023346712,0.00018871363,0.0005978249,0.98329115,0.0033333376,0.0120587405],"study_design_scores_gemma":[0.000010323916,0.00003553837,0.00038696287,0.000052236177,0.0000069018297,0.000642717,0.00023694134,0.0011522985,0.0009679831,0.8930139,0.10347816,0.000016094426],"about_ca_topic_score_codex":0.0006616814,"about_ca_topic_score_gemma":0.00066571124,"teacher_disagreement_score":0.017299356,"about_ca_system_score_codex":0.0007936444,"about_ca_system_score_gemma":0.0005497105,"threshold_uncertainty_score":0.057872117},"labels":[],"label_agreement":null},{"id":"W2962842387","doi":"","title":"Edge Decompositions of Hypercubes by Paths","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Canadian Navy","funders":"","keywords":"Hypercube; Combinatorics; Path (computing); Disjoint sets; Enhanced Data Rates for GSM Evolution; Mathematics; Disjoint union (topology); Discrete mathematics; Computer science; Telecommunications; Computer network","score_opus":0.009294119659840214,"score_gpt":0.21715592735450945,"score_spread":0.20786180769466922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962842387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61343974,0.002171946,0.3254965,0.00044146215,0.00022605213,0.00016780081,0.001079681,0.0005170889,0.05645982],"genre_scores_gemma":[0.83032924,0.0014699398,0.14289194,0.00023617878,0.00010429072,0.00019092714,0.0015291348,0.00018171199,0.023066578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997342,0.000055481327,0.000020474112,0.00005442493,0.00006030625,0.0000750575],"domain_scores_gemma":[0.99971837,0.00006090976,0.000054507385,0.000048009653,0.000060844563,0.000057298934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018479937,0.00027397546,0.00024679105,0.00089737395,0.0005529578,0.0010017582,0.00029738716,0.00027467927,0.0053074956],"category_scores_gemma":[0.00053533487,0.0002705702,0.0003280384,0.00070037064,0.0005053462,0.0012800558,0.0009189331,0.00045691873,0.0007304146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000631474,0.00009794934,0.0037659204,0.00034329324,0.00007307695,0.0007992151,0.0009597334,0.063361496,0.04632835,0.72693217,0.009752571,0.14695477],"study_design_scores_gemma":[0.00008298585,0.00015307018,0.00313913,0.00012087736,0.000037204536,0.00088970433,0.0008422074,0.1440755,0.014038891,0.7865018,0.050076548,0.000042107673],"about_ca_topic_score_codex":0.0007312117,"about_ca_topic_score_gemma":0.0011028711,"teacher_disagreement_score":0.0053074956,"about_ca_system_score_codex":0.00037348643,"about_ca_system_score_gemma":0.00020218553,"threshold_uncertainty_score":0.01775533},"labels":[],"label_agreement":null},{"id":"W2963701486","doi":"","title":"Some Constructions for Amicable Orthogonal Designs","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Disjoint sets; Orthogonal array; Mathematics; Combinatorial design; Construct (python library); Combinatorics; Kronecker product; Notation; Product (mathematics); Discrete mathematics; Arithmetic; Computer science; Computer network","score_opus":0.06524877658368881,"score_gpt":0.25054375355455266,"score_spread":0.18529497697086383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963701486","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.069034174,0.0012300629,0.89741373,0.00039652124,0.00022656965,0.00014602678,0.0004254713,0.00031614874,0.030811341],"genre_scores_gemma":[0.4581096,0.0015338353,0.52094513,0.0007000625,0.0003577234,0.0007049068,0.000831698,0.00015907567,0.016657995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743277,0.00079771434,0.00022765232,0.0004966612,0.0007475631,0.0002975887],"domain_scores_gemma":[0.9967361,0.001315406,0.0005921585,0.00064200093,0.0005196997,0.00019450184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016245447,0.0010380558,0.000648584,0.0014184396,0.0010598172,0.0011348315,0.0007304968,0.0010717553,0.0054354947],"category_scores_gemma":[0.0048981374,0.0006968862,0.0015369493,0.0013109816,0.0014500762,0.0015789677,0.0018679367,0.0023839525,0.0011450219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017070545,0.000054576667,0.00050966436,0.0001805299,0.000040919716,0.00018034491,0.00027769073,0.008555928,0.016336214,0.90781087,0.002103118,0.06377959],"study_design_scores_gemma":[0.00011704475,0.0006593215,0.0007544336,0.00017150356,0.00008060564,0.0014383205,0.0001467958,0.054571103,0.027357595,0.86756283,0.046980027,0.00016047047],"about_ca_topic_score_codex":0.00026165068,"about_ca_topic_score_gemma":0.0002761969,"teacher_disagreement_score":0.0054354947,"about_ca_system_score_codex":0.00083527813,"about_ca_system_score_gemma":0.0007978354,"threshold_uncertainty_score":0.01818353},"labels":[],"label_agreement":null},{"id":"W2963962749","doi":"","title":"Revisiting the spread and covering numbers.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Integer (computer science); Combinatorics; Connection (principal bundle); Mathematics; Construct (python library); Upper and lower bounds; Discrete mathematics; Computer science","score_opus":0.03780943260618011,"score_gpt":0.3039053561575414,"score_spread":0.26609592355136125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963962749","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.056142192,0.0038967417,0.89384484,0.003234307,0.0012278656,0.000112388356,0.0006312438,0.0011401117,0.039770324],"genre_scores_gemma":[0.4671559,0.0037309695,0.5107511,0.0013879199,0.001961281,0.00023122666,0.0011216758,0.0008829954,0.0127768405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525625,0.001160326,0.00028773706,0.0012081602,0.0015877966,0.0004997358],"domain_scores_gemma":[0.98496187,0.00889787,0.0010221193,0.0031255349,0.0015067692,0.00048579997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036519922,0.0016268077,0.0014393316,0.0032856602,0.0016132771,0.00595705,0.0028846366,0.0022550635,0.008566495],"category_scores_gemma":[0.033746712,0.0009035527,0.0013883547,0.0040746904,0.0044467156,0.017831009,0.0052256454,0.005709092,0.0028819644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022788516,0.00008696857,0.0023096148,0.00038261048,0.000057008085,0.00023263211,0.00039504675,0.059135105,0.0066980706,0.7602076,0.0099779405,0.16028951],"study_design_scores_gemma":[0.000018253531,0.00006857911,0.0005600508,0.00011353105,0.00002188649,0.00027782805,0.00008729776,0.11223399,0.00501853,0.8633077,0.018242896,0.00004947408],"about_ca_topic_score_codex":0.002221459,"about_ca_topic_score_gemma":0.0025263834,"teacher_disagreement_score":0.008566495,"about_ca_system_score_codex":0.0018910456,"about_ca_system_score_gemma":0.0016010543,"threshold_uncertainty_score":0.028657794},"labels":[],"label_agreement":null},{"id":"W71863754","doi":"","title":"Minimal and near-minimal critical sets in back-circulant latin squares","year":2003,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Latin square; Circulant matrix; Mathematics; Combinatorics; Square (algebra); Conjecture; Cardinality (data modeling); Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.017913105463955546,"score_gpt":0.24115261198602986,"score_spread":0.2232395065220743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71863754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94843054,0.00030100378,0.034719672,0.00022994685,0.000023835271,0.000043620697,0.00017233855,0.00008967063,0.015989425],"genre_scores_gemma":[0.98561656,0.00010615759,0.01129021,0.00005153945,0.000024190103,0.000051771185,0.00019069518,0.000020617324,0.0026482916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995914,0.00007841079,0.00002750111,0.00010036222,0.00010066263,0.00010161752],"domain_scores_gemma":[0.9978052,0.0010752139,0.00044115374,0.00017219555,0.00021001685,0.000296191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034861354,0.00031407573,0.00037812334,0.0013587271,0.0013850987,0.0014407933,0.00046177796,0.0006608907,0.002525976],"category_scores_gemma":[0.003006506,0.00041827463,0.00031051485,0.0005407198,0.0017575584,0.0014846079,0.0012177118,0.0005541571,0.0002644478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010973279,0.00016468953,0.014063691,0.00034840062,0.00006943988,0.0023546396,0.0025830946,0.057359498,0.079206,0.80540246,0.004383959,0.032966774],"study_design_scores_gemma":[0.00018725696,0.00023243354,0.0066503645,0.00010942327,0.00005762276,0.0019959088,0.0021907561,0.1124747,0.03657589,0.82814413,0.011301658,0.00007992776],"about_ca_topic_score_codex":0.0011282756,"about_ca_topic_score_gemma":0.0012901593,"teacher_disagreement_score":0.002525976,"about_ca_system_score_codex":0.0007595996,"about_ca_system_score_gemma":0.0004218698,"threshold_uncertainty_score":0.00845027},"labels":[],"label_agreement":null}]}