{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"957631600843","filters":{"venue":"Australas. J Comb."}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"J. A. Bate","is_ca":true},{"name":"Glynda Rees","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01791310546395555,"gpt":0.2411526119860299,"spread":0.2232395065220743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003486135,0.0003140757,0.0003781233,0.001358727,0.001385099,0.001440793,0.000461778,0.0006608907,0.002525976],"category_scores_gemma":[0.003006506,0.0004182746,0.0003105148,0.0005407198,0.001757558,0.001484608,0.001217712,0.0005541571,0.0002644478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007595996,"about_ca_system_score_gemma":0.0004218698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001128276,"about_ca_topic_score_gemma":0.001290159,"domain_scores_codex":[0.9995914,0.00007841079,0.00002750111,0.0001003622,0.0001006626,0.0001016175],"domain_scores_gemma":[0.9978052,0.001075214,0.0004411537,0.0001721955,0.0002100168,0.000296191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001097328,0.0001646895,0.01406369,0.0003484006,0.00006943988,0.00235464,0.002583095,0.0573595,0.079206,0.8054025,0.004383959,0.03296677],"study_design_scores_gemma":[0.000187257,0.0002324335,0.006650364,0.0001094233,0.00005762276,0.001995909,0.002190756,0.1124747,0.03657589,0.8281441,0.01130166,0.00007992776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9484305,0.0003010038,0.03471967,0.0002299468,0.00002383527,0.0000436207,0.0001723386,0.00008967063,0.01598942],"genre_scores_gemma":[0.9856166,0.0001061576,0.01129021,0.00005153945,0.0000241901,0.00005177119,0.0001906952,0.00002061732,0.002648292],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002525976,"threshold_uncertainty_score":0.00845027,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Christina M. Mynhardt","is_ca":true},{"name":"Jane Wodlinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01560847507420745,"gpt":0.2673208201156543,"spread":0.2517123450414468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006281267,0.0003161453,0.0006875271,0.001565377,0.001795418,0.002858397,0.0007811122,0.0009552498,0.003777281],"category_scores_gemma":[0.00476353,0.0003066039,0.0005658937,0.001250401,0.001278343,0.002280333,0.001220825,0.0009904475,0.0005001492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00178461,"about_ca_system_score_gemma":0.0007855023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003182803,"about_ca_topic_score_gemma":0.002536574,"domain_scores_codex":[0.9988443,0.0001371692,0.00004671997,0.0002796328,0.0003133618,0.0003788765],"domain_scores_gemma":[0.9956776,0.002246459,0.0006648395,0.0003621363,0.0003859726,0.0006629245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006064185,0.0001293389,0.008335337,0.0002257217,0.00007666103,0.0007365388,0.001447861,0.03876133,0.01547958,0.8700979,0.01148324,0.05261998],"study_design_scores_gemma":[0.0002447777,0.0003092061,0.00940411,0.00008195728,0.0001025431,0.002951453,0.0009947398,0.2098925,0.004961418,0.7317642,0.0392005,0.00009261637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7998307,0.0013926,0.1363847,0.0008558284,0.0001139486,0.0001139176,0.001214658,0.0004828348,0.05961085],"genre_scores_gemma":[0.9734202,0.0005925,0.01393011,0.0002427492,0.0001860504,0.0001009066,0.000748707,0.00007936924,0.01069952],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003777281,"threshold_uncertainty_score":0.01294827,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David J. Anick","is_ca":true},{"name":"Mark Ramras","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009294119659840214,"gpt":0.2171559273545094,"spread":0.2078618076946692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001847994,0.0002739755,0.0002467911,0.0008973739,0.0005529578,0.001001758,0.0002973872,0.0002746793,0.005307496],"category_scores_gemma":[0.0005353349,0.0002705702,0.0003280384,0.0007003706,0.0005053462,0.001280056,0.0009189331,0.0004569187,0.0007304146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003734864,"about_ca_system_score_gemma":0.0002021855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007312117,"about_ca_topic_score_gemma":0.001102871,"domain_scores_codex":[0.9997342,0.00005548133,0.00002047411,0.00005442493,0.00006030625,0.0000750575],"domain_scores_gemma":[0.9997184,0.00006090976,0.00005450739,0.00004800965,0.00006084456,0.00005729893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000631474,0.00009794934,0.00376592,0.0003432932,0.00007307695,0.0007992151,0.0009597334,0.0633615,0.04632835,0.7269322,0.009752571,0.1469548],"study_design_scores_gemma":[0.00008298585,0.0001530702,0.00313913,0.0001208774,0.00003720454,0.0008897043,0.0008422074,0.1440755,0.01403889,0.7865018,0.05007655,0.00004210767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6134397,0.002171946,0.3254965,0.0004414622,0.0002260521,0.0001678008,0.001079681,0.0005170889,0.05645982],"genre_scores_gemma":[0.8303292,0.00146994,0.1428919,0.0002361788,0.0001042907,0.0001909271,0.001529135,0.000181712,0.02306658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005307496,"threshold_uncertainty_score":0.01775533,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stephen Finbow","is_ca":true},{"name":"Margaret-Ellen Messinger","is_ca":true},{"name":"Martin F. van Bommel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06277409480743021,"gpt":0.3289039625214548,"spread":0.2661298677140246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005877595,0.0003285859,0.0004254879,0.0005202207,0.0006133836,0.0007841499,0.0008003124,0.000368591,0.002198271],"category_scores_gemma":[0.003511517,0.0002104177,0.0003049588,0.0005494381,0.0008751408,0.001382874,0.0009225418,0.0004612349,0.0002068194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000788524,"about_ca_system_score_gemma":0.0003409495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003257047,"about_ca_topic_score_gemma":0.004042448,"domain_scores_codex":[0.99941,0.0002088401,0.00003713695,0.0001217527,0.00007568839,0.0001466169],"domain_scores_gemma":[0.9969541,0.001800245,0.0004952555,0.0003228298,0.000161258,0.0002663007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001167642,0.0001375693,0.01220807,0.0003260167,0.0001389329,0.0007715782,0.0005229557,0.7576421,0.01782497,0.1341488,0.006411042,0.0687004],"study_design_scores_gemma":[0.00008341055,0.0001426861,0.003369216,0.00002570376,0.00002986609,0.0004658123,0.0002262634,0.8427219,0.003916975,0.1435022,0.005490728,0.00002508996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7587713,0.0008430365,0.2241467,0.0007987309,0.00004569567,0.0000947026,0.0007821673,0.0003399798,0.01417774],"genre_scores_gemma":[0.9666918,0.0003239403,0.028871,0.0001061901,0.0000212817,0.00004951911,0.0003324939,0.00003499115,0.003568747],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003257047,"threshold_uncertainty_score":0.007353961,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nancy E. Clarke","is_ca":true},{"name":"Stephen Finbow","is_ca":true},{"name":"Shannon L. Fitzpatrick","is_ca":true},{"name":"Margaret-Ellen Messinger","is_ca":true},{"name":"Richard J. Nowakowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02779325769111972,"gpt":0.2917460034780117,"spread":0.263952745786892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722541,0.001984331,0.001641533,0.001996624,0.001777858,0.003505223,0.002900815,0.002527277,0.01516068],"category_scores_gemma":[0.02465765,0.0014027,0.001723041,0.003165445,0.002828122,0.01373961,0.003645958,0.003344016,0.002650874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002321534,"about_ca_system_score_gemma":0.001888172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003778164,"about_ca_topic_score_gemma":0.005717408,"domain_scores_codex":[0.9963198,0.001361577,0.0001828919,0.0008659457,0.000778331,0.0004915379],"domain_scores_gemma":[0.9683393,0.0229282,0.00316743,0.002607652,0.001460055,0.001497414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004162021,0.0002220979,0.002534029,0.0008399365,0.0001364763,0.0005159089,0.0006704965,0.160796,0.002199763,0.748408,0.01503385,0.06822726],"study_design_scores_gemma":[0.00007132802,0.000200679,0.0004766555,0.0001262799,0.00009140689,0.0006980271,0.0001776514,0.2330483,0.001374719,0.7376227,0.02607645,0.0000358373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06652655,0.003220007,0.8570561,0.003626924,0.0002245333,0.0005596008,0.001972249,0.00144838,0.06536568],"genre_scores_gemma":[0.5953389,0.005162904,0.3573407,0.001563235,0.0003578886,0.0009189626,0.003416745,0.0009165793,0.0349841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01516068,"threshold_uncertainty_score":0.05071753,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Domination analysis; Graph; Induced subgraph; Discrete mathematics; Vertex (graph theory)","authors":[{"name":"Michelle Edwards","is_ca":false},{"name":"Richard G. Gibson","is_ca":false},{"name":"Michael A. Henning","is_ca":false},{"name":"Christina M. Mynhardt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04648292806852639,"gpt":0.3112554828396604,"spread":0.264772554771134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005098104,0.0003932943,0.0005574641,0.001405202,0.0007503518,0.001458245,0.0008562065,0.000621169,0.001448804],"category_scores_gemma":[0.003188461,0.0004935822,0.0002891518,0.0007017644,0.0009649581,0.001640411,0.001208603,0.0004754268,0.0002383755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008746443,"about_ca_system_score_gemma":0.0002698147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003851879,"about_ca_topic_score_gemma":0.0003014691,"domain_scores_codex":[0.9994436,0.00009694367,0.0000352795,0.0001920225,0.0001107278,0.0001215074],"domain_scores_gemma":[0.9960765,0.002101666,0.0007193306,0.0001825406,0.0003118151,0.0006081453],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003440891,0.0002984191,0.07102983,0.001538598,0.0003840579,0.003694726,0.003659619,0.1949707,0.1874447,0.4327489,0.01934148,0.08144806],"study_design_scores_gemma":[0.0002387242,0.000681814,0.04260397,0.0002240821,0.000288742,0.01162196,0.002205457,0.3497661,0.05859485,0.4985322,0.03511654,0.0001255731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9351053,0.001326127,0.04801005,0.0005911235,0.00004034895,0.00005914531,0.001048781,0.0001638435,0.01365525],"genre_scores_gemma":[0.9869552,0.0005702772,0.01043687,0.00007828751,0.00006341839,0.00006180839,0.0006035495,0.00003665739,0.001193992],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001458245,"threshold_uncertainty_score":0.006345987,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Charles C. Lindner","is_ca":false},{"name":"Mariusz Meszka","is_ca":false},{"name":"Alexander Rosa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01062394338070529,"gpt":0.1830472357789416,"spread":0.1724232923982363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433848,0.0007782799,0.0007953417,0.001140255,0.001296493,0.001935428,0.0008320069,0.001152723,0.01154335],"category_scores_gemma":[0.006713819,0.0008853484,0.001063742,0.001062586,0.001935164,0.003604895,0.001693651,0.001668547,0.001589873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008496699,"about_ca_system_score_gemma":0.0004247392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005177959,"about_ca_topic_score_gemma":0.001278433,"domain_scores_codex":[0.9982552,0.0005787838,0.0001350215,0.0003535906,0.0004263181,0.0002510556],"domain_scores_gemma":[0.9947639,0.003112052,0.0005063862,0.001010719,0.0003200762,0.0002869542],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001125507,0.0001056439,0.002281571,0.0005169777,0.00007600515,0.0004510202,0.0008163036,0.03796995,0.03947135,0.822519,0.003940024,0.09072662],"study_design_scores_gemma":[0.0001022335,0.0004774338,0.001291111,0.0001592871,0.00005265852,0.0006502233,0.0002035045,0.07084037,0.01681584,0.8887369,0.02061078,0.00005968984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3635848,0.00151607,0.5712233,0.0004482068,0.0002587548,0.0002936783,0.0009285614,0.0007000465,0.06104666],"genre_scores_gemma":[0.7205595,0.0009291589,0.2557106,0.0001669994,0.000108549,0.0004795956,0.00070752,0.0002097,0.02112835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01154335,"threshold_uncertainty_score":0.0386163,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ben Babcock","is_ca":true},{"name":"Adam Van Tuyl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03780943260618011,"gpt":0.3039053561575414,"spread":0.2660959235513612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003651992,0.001626808,0.001439332,0.00328566,0.001613277,0.00595705,0.002884637,0.002255064,0.008566495],"category_scores_gemma":[0.03374671,0.0009035527,0.001388355,0.00407469,0.004446716,0.01783101,0.005225645,0.005709092,0.002881964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001891046,"about_ca_system_score_gemma":0.001601054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002221459,"about_ca_topic_score_gemma":0.002526383,"domain_scores_codex":[0.9952562,0.001160326,0.0002877371,0.00120816,0.001587797,0.0004997358],"domain_scores_gemma":[0.9849619,0.00889787,0.001022119,0.003125535,0.001506769,0.0004858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002278852,0.00008696857,0.002309615,0.0003826105,0.00005700808,0.0002326321,0.0003950468,0.05913511,0.006698071,0.7602076,0.00997794,0.1602895],"study_design_scores_gemma":[0.00001825353,0.00006857911,0.0005600508,0.0001135311,0.00002188649,0.000277828,0.00008729776,0.112234,0.00501853,0.8633077,0.0182429,0.00004947408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05614219,0.003896742,0.8938448,0.003234307,0.001227866,0.0001123884,0.0006312438,0.001140112,0.03977032],"genre_scores_gemma":[0.4671559,0.00373097,0.5107511,0.00138792,0.001961281,0.0002312267,0.001121676,0.0008829954,0.01277684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008566495,"threshold_uncertainty_score":0.02865779,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Christina M. Mynhardt","is_ca":true},{"name":"Mark Schurch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0195083054851547,"gpt":0.2614906472667648,"spread":0.2419823417816101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003601046,0.000518984,0.0004589216,0.001610281,0.001739552,0.001190272,0.0009236861,0.0006903602,0.004209511],"category_scores_gemma":[0.001202439,0.0004409065,0.0006442435,0.0008640746,0.001601895,0.001206593,0.001959488,0.00225246,0.0008206485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001186667,"about_ca_system_score_gemma":0.0004702328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00166475,"about_ca_topic_score_gemma":0.001682702,"domain_scores_codex":[0.9997091,0.00003719607,0.00001031331,0.00009281274,0.000081257,0.00006922345],"domain_scores_gemma":[0.9990927,0.000167689,0.0001306098,0.0001578267,0.0001126925,0.0003385018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007880542,0.00007771348,0.001649539,0.00007686546,0.00001328317,0.0005761579,0.0007303382,0.002172338,0.01461387,0.9523073,0.00502229,0.02268159],"study_design_scores_gemma":[0.0001440261,0.0001326127,0.003865407,0.0000770952,0.00004533417,0.002113277,0.0005269657,0.02484445,0.007219096,0.8817701,0.07919802,0.00006362644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4932746,0.001257915,0.3614898,0.002435829,0.0004034768,0.0005024837,0.001193778,0.001371123,0.1380709],"genre_scores_gemma":[0.8770913,0.0005990927,0.1029872,0.0007077146,0.0001689253,0.0002982012,0.0009650998,0.0001984783,0.01698382],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004209511,"threshold_uncertainty_score":0.01408225,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pak Ching Li","is_ca":false},{"name":"Glynda Rees","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01392492239175733,"gpt":0.2137628931770847,"spread":0.1998379707853273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003048278,0.001427533,0.002180139,0.002173648,0.003016803,0.004643787,0.004004795,0.002306515,0.01864685],"category_scores_gemma":[0.02286799,0.00125473,0.001979963,0.002271712,0.002795609,0.01204676,0.00451754,0.004571638,0.00273076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00266158,"about_ca_system_score_gemma":0.001194396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001455203,"about_ca_topic_score_gemma":0.002693321,"domain_scores_codex":[0.99536,0.001059125,0.0003074943,0.001218062,0.0009826819,0.001072703],"domain_scores_gemma":[0.963699,0.02808151,0.001680943,0.002978967,0.001154128,0.002405395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00272611,0.0007882188,0.02169474,0.002181932,0.0005619169,0.002137201,0.002120132,0.05612066,0.04112732,0.6888491,0.04014882,0.1415438],"study_design_scores_gemma":[0.0003657121,0.0006188915,0.01038658,0.0004079016,0.0005213565,0.00637987,0.001092994,0.2297408,0.02176267,0.6758837,0.05261094,0.0002285846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.365726,0.006816492,0.4938993,0.01012085,0.0006722493,0.0005461721,0.006397648,0.00151708,0.1143041],"genre_scores_gemma":[0.7847787,0.003206018,0.1858122,0.001307727,0.0006775444,0.0007064017,0.003206134,0.0004318551,0.01987341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01864685,"threshold_uncertainty_score":0.0623799,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Goldwyn Millar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02350954934128016,"gpt":0.250974437196984,"spread":0.2274648878557038,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004756781,0.0006287178,0.0003350466,0.001358932,0.001080715,0.001348859,0.0004947461,0.0008958858,0.006388638],"category_scores_gemma":[0.003853247,0.0002940889,0.0003098324,0.0008419782,0.0009349684,0.001220348,0.001016339,0.0008204455,0.0009918644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004419734,"about_ca_system_score_gemma":0.0005184871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004030546,"about_ca_topic_score_gemma":0.0004374983,"domain_scores_codex":[0.9990962,0.000146758,0.00005377407,0.000179069,0.0003245358,0.0001998],"domain_scores_gemma":[0.9986472,0.0004616882,0.0002906892,0.0002115943,0.0002232657,0.0001656934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001114725,0.00005415505,0.001106061,0.00005667687,0.00001648704,0.0003607229,0.0001639721,0.00302895,0.01586972,0.9430742,0.002519934,0.03363768],"study_design_scores_gemma":[0.00007731358,0.0001810079,0.001663489,0.00004471342,0.00002692384,0.00175736,0.0001347677,0.04950724,0.01508566,0.904134,0.02731209,0.00007544443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5639816,0.001429019,0.3006935,0.000769755,0.0005042314,0.0002475522,0.0007189108,0.0006117616,0.1310436],"genre_scores_gemma":[0.9489744,0.0003564694,0.03670654,0.0003500473,0.0002127279,0.0001457978,0.0004589791,0.00006289731,0.01273229],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006388638,"threshold_uncertainty_score":0.02137214,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Peter J. Dukes","is_ca":true},{"name":"Jesse Short-Gershman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03703849411421287,"gpt":0.2366758353244877,"spread":0.1996373412102749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00163438,0.0007659661,0.0009645803,0.002098173,0.002254426,0.003049052,0.0009917865,0.001998702,0.009893233],"category_scores_gemma":[0.003384848,0.0009504147,0.001101675,0.001562764,0.002061095,0.006264073,0.002522956,0.003209824,0.001769928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001501869,"about_ca_system_score_gemma":0.0007688115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005637562,"about_ca_topic_score_gemma":0.0006482481,"domain_scores_codex":[0.9989865,0.0002805309,0.00006096079,0.0001984109,0.0003059675,0.0001676186],"domain_scores_gemma":[0.99712,0.001698154,0.0002096504,0.0002285819,0.0005917949,0.0001517688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001049255,0.000009472106,0.00006054149,0.00005510736,0.000007539502,0.00002736295,0.0001375568,0.001743267,0.0003016087,0.9914334,0.001787377,0.004426228],"study_design_scores_gemma":[0.00001131043,0.00003270042,0.0001194842,0.00004685919,0.00001174465,0.00009777589,0.0001096435,0.02468149,0.000500676,0.9654698,0.008900883,0.00001758177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07511942,0.002743084,0.8231284,0.002102237,0.0002350084,0.00009163832,0.0006585444,0.000305055,0.09561659],"genre_scores_gemma":[0.7960193,0.003323313,0.1472229,0.0009545395,0.0005528171,0.0005090993,0.001301431,0.0001985954,0.04991801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009893233,"threshold_uncertainty_score":0.03309619,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ebrahim Ghaderpour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06524877658368881,"gpt":0.2505437535545527,"spread":0.1852949769708638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624545,0.001038056,0.000648584,0.00141844,0.001059817,0.001134831,0.0007304968,0.001071755,0.005435495],"category_scores_gemma":[0.004898137,0.0006968862,0.001536949,0.001310982,0.001450076,0.001578968,0.001867937,0.002383952,0.001145022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008352781,"about_ca_system_score_gemma":0.0007978354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002616507,"about_ca_topic_score_gemma":0.0002761969,"domain_scores_codex":[0.9974328,0.0007977143,0.0002276523,0.0004966612,0.0007475631,0.0002975887],"domain_scores_gemma":[0.9967361,0.001315406,0.0005921585,0.0006420009,0.0005196997,0.0001945018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001707054,0.00005457667,0.0005096644,0.0001805299,0.00004091972,0.0001803449,0.0002776907,0.008555928,0.01633621,0.9078109,0.002103118,0.06377959],"study_design_scores_gemma":[0.0001170448,0.0006593215,0.0007544336,0.0001715036,0.00008060564,0.00143832,0.0001467958,0.0545711,0.0273576,0.8675628,0.04698003,0.0001604705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06903417,0.001230063,0.8974137,0.0003965212,0.0002265697,0.0001460268,0.0004254713,0.0003161487,0.03081134],"genre_scores_gemma":[0.4581096,0.001533835,0.5209451,0.0007000625,0.0003577234,0.0007049068,0.000831698,0.0001590757,0.016658],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005435495,"threshold_uncertainty_score":0.01818353,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Arithmetic; Set (abstract data type); Computer science; Programming language","authors":[{"name":"Tom C. Brown","is_ca":true},{"name":"Allen R. Freedman","is_ca":false},{"name":"Peter J.-S. Shiue","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1110781591414376,"gpt":0.3863829455289312,"spread":0.2753047863874936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007028345,0.000766521,0.0004760957,0.002211606,0.002053967,0.003493483,0.0007039922,0.0005994564,0.01729936],"category_scores_gemma":[0.003569145,0.0003807865,0.0007224097,0.001838456,0.002434068,0.005816909,0.002038028,0.002063275,0.003927443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007936444,"about_ca_system_score_gemma":0.0005497105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006616814,"about_ca_topic_score_gemma":0.0006657112,"domain_scores_codex":[0.9990325,0.0001761613,0.00008817009,0.000282508,0.000313218,0.0001075411],"domain_scores_gemma":[0.998606,0.0004355629,0.0002427456,0.0002039944,0.000342347,0.0001693495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002137295,0.00000595866,0.0001432583,0.00005716286,0.000003740541,0.00006533752,0.0002334671,0.0001887136,0.0005978249,0.9832911,0.003333338,0.01205874],"study_design_scores_gemma":[0.00001032392,0.00003553837,0.0003869629,0.00005223618,0.00000690183,0.000642717,0.0002369413,0.001152299,0.0009679831,0.8930139,0.1034782,0.00001609443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1031502,0.01392733,0.2753458,0.003584968,0.003172541,0.0002427716,0.003643589,0.0008872056,0.5960456],"genre_scores_gemma":[0.7028073,0.005881024,0.1207484,0.001315474,0.00245859,0.0003392768,0.002969236,0.0003547761,0.163126],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01729936,"threshold_uncertainty_score":0.05787212,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Iain Beaton","is_ca":false},{"name":"Rory Begin","is_ca":true},{"name":"Stephen Finbow","is_ca":false},{"name":"Christopher M. van Bommel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0222203577737518,"gpt":0.2657821603464315,"spread":0.2435618025726797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011073,0.0005767895,0.0006496313,0.0005364824,0.001090675,0.001723507,0.001126306,0.0009993779,0.009295466],"category_scores_gemma":[0.01012294,0.000377852,0.0005630685,0.0005937964,0.001722024,0.003670172,0.001408936,0.001698802,0.0008482173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008510399,"about_ca_system_score_gemma":0.001042816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003468059,"about_ca_topic_score_gemma":0.005905793,"domain_scores_codex":[0.9990692,0.0002306094,0.00006073857,0.0002219753,0.0001421086,0.0002754525],"domain_scores_gemma":[0.9923287,0.004715147,0.0007888167,0.0007705837,0.0003659576,0.001030801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003063777,0.0000379333,0.001202534,0.0001124261,0.00002613585,0.0004902445,0.0003388995,0.03277698,0.004932823,0.9476948,0.002421483,0.009659361],"study_design_scores_gemma":[0.0001103727,0.0001171578,0.0006713636,0.00004834304,0.00002763226,0.0002421224,0.0001872198,0.1295302,0.001813542,0.855599,0.01162359,0.00002938186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2929138,0.001052506,0.6495919,0.002129142,0.0004314156,0.0002358053,0.001456908,0.0004184763,0.05176995],"genre_scores_gemma":[0.9323432,0.0007626225,0.05069318,0.0003462014,0.000129609,0.0002667614,0.0006877595,0.0001265386,0.0146441],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009295466,"threshold_uncertainty_score":0.0310964,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jordan R. Bell","is_ca":false},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1333185702782889,"gpt":0.3352737528894795,"spread":0.2019551826111906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002155695,0.001739366,0.001456557,0.001565645,0.002368232,0.002455728,0.003137967,0.002193194,0.02093257],"category_scores_gemma":[0.01617737,0.000721593,0.002322211,0.001623702,0.002774599,0.007356666,0.003151476,0.003765281,0.001839696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001528853,"about_ca_system_score_gemma":0.001142212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001936654,"about_ca_topic_score_gemma":0.002383719,"domain_scores_codex":[0.99814,0.0005639858,0.00008712724,0.0004204392,0.0004300828,0.0003583711],"domain_scores_gemma":[0.9906859,0.007128629,0.0005469315,0.0007253817,0.0003774776,0.0005357527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007716047,0.0007944583,0.005905439,0.002323399,0.0004416782,0.000551786,0.001242123,0.1460533,0.004431244,0.7391433,0.03334508,0.06499651],"study_design_scores_gemma":[0.0002472905,0.0003677484,0.002498138,0.0003450488,0.0002388347,0.0006828925,0.000670948,0.1853362,0.003850295,0.7568616,0.0488244,0.0000765183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2994426,0.01109419,0.3859496,0.009151447,0.001327531,0.0006366532,0.001487425,0.0005388545,0.2903716],"genre_scores_gemma":[0.7466722,0.007983878,0.1809678,0.003180346,0.001557516,0.0008472372,0.003161587,0.0004843164,0.05514515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02093257,"threshold_uncertainty_score":0.0700264,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David A. Pike","is_ca":true},{"name":"Asiyeh Sanaei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02529625595293694,"gpt":0.2895275652778337,"spread":0.2642313093248968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001218103,0.0004487675,0.0004047833,0.0005315905,0.001017055,0.001095371,0.0006424993,0.0004484759,0.003293275],"category_scores_gemma":[0.002538566,0.0002659347,0.0009856104,0.00035941,0.003947468,0.003132237,0.002584714,0.001518502,0.0002990364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006800016,"about_ca_system_score_gemma":0.0003779446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004605925,"about_ca_topic_score_gemma":0.0002829584,"domain_scores_codex":[0.9991149,0.0001730563,0.00004620633,0.0002927465,0.0001820473,0.0001910165],"domain_scores_gemma":[0.9984428,0.0005284125,0.0002101064,0.000372391,0.0001891366,0.0002572297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008351634,0.00003259483,0.001029392,0.00006616662,0.00001519007,0.0002705457,0.0005448313,0.00288158,0.01049007,0.9708202,0.000735964,0.01302976],"study_design_scores_gemma":[0.00002387135,0.0002303311,0.001423353,0.00003481084,0.00003437802,0.0007893256,0.0003172014,0.01345693,0.01639998,0.9524987,0.01475544,0.00003565417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6643472,0.000765729,0.2724119,0.0006808944,0.0001943692,0.00006145865,0.00020148,0.0003104996,0.06102648],"genre_scores_gemma":[0.9676574,0.0001936405,0.02542885,0.0001722303,0.00008333378,0.0000404773,0.0001469272,0.0001077849,0.006169374],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003293275,"threshold_uncertainty_score":0.01101708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Counterexample; Mathematics; Discrete mathematics; Combinatorics","authors":[{"name":"J. A. Bate","is_ca":true},{"name":"Glynda Rees","is_ca":true},{"name":"Manitoba Canada R","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06425381317664465,"gpt":0.3700930344539061,"spread":0.3058392212772614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001283098,0.0006690851,0.0006820156,0.002623374,0.003685037,0.002545598,0.001081752,0.001089029,0.01376493],"category_scores_gemma":[0.006225229,0.0004697834,0.0006143847,0.002645212,0.002804311,0.004458244,0.00279909,0.004760669,0.001625777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002484044,"about_ca_system_score_gemma":0.001371549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006365597,"about_ca_topic_score_gemma":0.007503049,"domain_scores_codex":[0.9988884,0.000278065,0.00005523892,0.0002547702,0.000388185,0.0001353085],"domain_scores_gemma":[0.9956519,0.002944767,0.00008780866,0.000331602,0.000718858,0.0002649926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003975819,0.00001915573,0.0005161116,0.0001541005,0.00001004237,0.0003146537,0.0004468372,0.001051193,0.00116159,0.8932604,0.06053744,0.04248876],"study_design_scores_gemma":[0.00001242532,0.00003042781,0.0004343762,0.000107571,0.00001169827,0.0002888937,0.0002342504,0.002112144,0.001340088,0.7235864,0.2718212,0.00002059988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.07675177,0.07920053,0.308827,0.08842558,0.02267602,0.0001984868,0.001432902,0.001148326,0.4213393],"genre_scores_gemma":[0.6363102,0.04124628,0.1469409,0.01587755,0.01327872,0.0003608428,0.001493159,0.0007705523,0.1437218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01376493,"threshold_uncertainty_score":0.04604834,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ben Cameron","is_ca":false},{"name":"Shannon L. Fitzpatrick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06036837910370964,"gpt":0.3518680294802476,"spread":0.291499650376538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008133895,0.000876109,0.0009071956,0.00172819,0.001678434,0.001488738,0.001249454,0.001082271,0.005970448],"category_scores_gemma":[0.005379256,0.0005217601,0.0006661078,0.001006878,0.002525607,0.002771582,0.001574361,0.00181309,0.0006008624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001236291,"about_ca_system_score_gemma":0.0008723884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001911972,"about_ca_topic_score_gemma":0.001629404,"domain_scores_codex":[0.9990976,0.000202101,0.00003523522,0.0002906764,0.0001844156,0.0001900566],"domain_scores_gemma":[0.9957349,0.002216003,0.0006139358,0.0003481443,0.0003946309,0.0006924171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004949092,0.0001612601,0.007097399,0.0003978428,0.00006252791,0.0006885806,0.000728578,0.0453468,0.008654942,0.8862246,0.008371394,0.04177113],"study_design_scores_gemma":[0.00007962788,0.0001890205,0.003226886,0.00007592177,0.00005467293,0.001206168,0.000892075,0.1455082,0.005403056,0.8263205,0.0169932,0.00005056004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6752552,0.0009597103,0.2794763,0.001222067,0.0001209563,0.0004379328,0.001081373,0.0003118354,0.04113458],"genre_scores_gemma":[0.9145024,0.0005871803,0.07264852,0.0003297891,0.00009566441,0.0002580967,0.001856914,0.0001406987,0.009580762],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005970448,"threshold_uncertainty_score":0.01997316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}