{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002233696,0.0001904008,0.0002460469,0.00008910106,0.00005372602,0.00007207706,0.00009099209,0.0001366479,0.0003331666],"category_scores_gemma":[0.00006564466,0.0001950331,0.00005118201,0.0001964311,0.0001228066,0.0001183908,0.00001423883,0.0002353316,0.0001290865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002009002,"about_ca_system_score_gemma":0.00001382307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001757915,"about_ca_topic_score_gemma":0.00002234746,"domain_scores_codex":[0.9988786,0.0001005881,0.0002861103,0.0002106518,0.0001240864,0.000399962],"domain_scores_gemma":[0.9994825,0.0001679933,0.00001438828,0.000184296,0.00001542911,0.0001353763],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001531819,0.0005324367,0.5982187,0.001937278,0.0002424815,0.0009893999,0.006340283,0.005464333,0.021208,0.3477651,0.01378135,0.003367456],"study_design_scores_gemma":[0.006071781,0.0008684995,0.8623948,0.0009203847,0.0001369373,0.0009631286,0.003680824,0.02725622,0.01605615,0.01967309,0.05889659,0.003081597],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.989753,0.0002933418,0.00003240782,0.0000519509,0.0002974465,0.0001305071,0.00001323513,0.00008776212,0.009340337],"genre_scores_gemma":[0.9993836,0.000008920022,0.0003761401,0.00002402969,0.00002434592,0.00001451398,0.000004592376,0.00002711992,0.0001367193],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.328092,"threshold_uncertainty_score":0.7953221,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001645059,0.0001096647,0.000148763,0.0001145909,0.00005779029,0.00007889617,0.000410824,0.00004451031,0.00004211541],"category_scores_gemma":[0.00002596134,0.00008771137,0.00002494836,0.0003574144,0.0002454382,0.0007429307,0.0001375836,0.0001322774,0.0000312097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001789661,"about_ca_system_score_gemma":0.00003016552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008296111,"about_ca_topic_score_gemma":0.00004026985,"domain_scores_codex":[0.9989712,0.0000709457,0.0001536644,0.0002574024,0.0002868545,0.0002598864],"domain_scores_gemma":[0.999162,0.0001698665,0.00007768135,0.000355896,0.0001292455,0.0001053155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001075977,0.0003099373,0.04540276,0.00009954098,0.0001139147,0.00003147143,0.002595646,0.0003980095,0.02382556,0.6916757,0.002469339,0.2329705],"study_design_scores_gemma":[0.009571645,0.004370012,0.5324977,0.0003654585,0.0000549612,0.0003429441,0.001914772,0.04997595,0.07544374,0.3180968,0.005514903,0.001851089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9352217,0.00003361072,0.06126436,0.000638965,0.00004552686,0.0003107864,0.000002117751,0.00006298145,0.002419965],"genre_scores_gemma":[0.9867876,0.000007794928,0.01237744,0.00002833863,0.0000105167,0.00002354693,0.000001364435,0.000007712421,0.0007557002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4870949,"threshold_uncertainty_score":0.3576766,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001005086,0.0001075697,0.0001723784,0.00005568971,0.00008597119,0.0001086787,0.0004929026,0.00006887059,0.0002584909],"category_scores_gemma":[0.000006957001,0.00009484725,0.00008323009,0.0001925949,0.00004075838,0.0004083488,0.00008195503,0.0001054341,0.0003075618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001982088,"about_ca_system_score_gemma":0.00001736596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002994992,"about_ca_topic_score_gemma":0.000009006445,"domain_scores_codex":[0.9990787,0.00005963594,0.0002865308,0.0002093889,0.0001435623,0.0002222175],"domain_scores_gemma":[0.9992383,0.00007979481,0.00007840669,0.0003920066,0.0001236661,0.00008782074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002473628,0.0003406887,0.005018118,0.00003889119,0.000078467,0.00000563705,0.0007814818,0.0002609059,0.03673869,0.08598468,0.8567587,0.01399131],"study_design_scores_gemma":[0.004906821,0.003125166,0.1043704,0.0009370457,0.0001174512,0.0008394085,0.001602104,0.3362587,0.1576516,0.042978,0.3432261,0.003987127],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8200601,0.000204171,0.1566257,0.002177178,0.002093003,0.0004823128,0.00001413094,0.0002564499,0.01808695],"genre_scores_gemma":[0.9957156,0.000007755502,0.00206005,0.0001663434,0.00006524411,0.00003071208,0.000005313514,0.000006621022,0.00194233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5135326,"threshold_uncertainty_score":0.3953187,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005608665,0.0001461334,0.0001359929,0.0002400186,0.00008689635,0.0001298607,0.001067358,0.00006339391,0.00002179166],"category_scores_gemma":[0.0001080013,0.0001323568,0.00007050001,0.000533836,0.00009721734,0.0005880342,0.0001915136,0.0002890642,0.0004554518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006965848,"about_ca_system_score_gemma":0.00005962496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001394054,"about_ca_topic_score_gemma":0.000004537314,"domain_scores_codex":[0.9982988,0.000137887,0.0001785978,0.0003704474,0.0006202334,0.0003940205],"domain_scores_gemma":[0.9987368,0.0001346104,0.0000668545,0.0006409417,0.000153275,0.0002675292],"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.00008061827,0.0001900921,0.004032342,0.000008856333,0.00002599397,0.00009680022,0.0004631076,0.0006205572,0.0009083596,0.9433077,0.01529429,0.0349713],"study_design_scores_gemma":[0.003223528,0.00162746,0.02506436,0.00006776199,0.000009386073,0.0001041614,0.00009927668,0.007288916,0.02535114,0.9079676,0.02845544,0.0007409973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8297625,0.00008257868,0.1359447,0.003841758,0.002917491,0.0006342936,0.00001224433,0.0006617466,0.02614264],"genre_scores_gemma":[0.9911352,0.000006121466,0.007035083,0.0002047737,0.00008721003,0.00001940484,0.000004480186,0.0000116748,0.001496018],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1613727,"threshold_uncertainty_score":0.5854063,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002163004,0.0001826252,0.0002120091,0.0002305526,0.00007070114,0.000143217,0.00113705,0.0001024715,0.00005975737],"category_scores_gemma":[0.00007808128,0.0001807244,0.00008103653,0.001039907,0.00006874224,0.0005572108,0.00009929018,0.0002752433,0.0003058159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004843117,"about_ca_system_score_gemma":0.00003611199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001239859,"about_ca_topic_score_gemma":0.0001106824,"domain_scores_codex":[0.9983674,0.00008012557,0.000358665,0.0004359469,0.0002649076,0.0004929136],"domain_scores_gemma":[0.9989907,0.0001074738,0.00007498525,0.0006589566,0.00004800601,0.0001199466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0000325466,0.001087162,0.06498814,0.00001648138,0.00003770344,0.0005760957,0.004653499,0.0009301897,0.01679787,0.3675798,0.01929357,0.5240069],"study_design_scores_gemma":[0.0004284066,0.000475357,0.6076493,0.0001100614,0.00001136114,0.00004868868,0.0001241097,0.03016542,0.06836322,0.280935,0.01063473,0.001054275],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9742477,0.0001058833,0.009205461,0.004268303,0.000597522,0.0003039014,0.00000152383,0.0008941336,0.01037557],"genre_scores_gemma":[0.9928502,0.00002441222,0.005812975,0.0005792743,0.00003329282,0.000007762414,0.000001885075,0.000007255132,0.0006829159],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5426612,"threshold_uncertainty_score":0.7369727,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003229542,0.0001344925,0.0002097735,0.0002374937,0.0001284597,0.00002515862,0.0008140093,0.00007679323,0.00005360121],"category_scores_gemma":[0.0003015019,0.0001274722,0.0001217992,0.000683923,0.0005194671,0.0005762408,0.0001924795,0.000206537,0.00006152481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002369763,"about_ca_system_score_gemma":0.00005133101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008535648,"about_ca_topic_score_gemma":0.000001801225,"domain_scores_codex":[0.9983785,0.0001628788,0.0002758951,0.0003426444,0.0004497796,0.0003902585],"domain_scores_gemma":[0.9983885,0.0005640938,0.00005664027,0.0006481709,0.00019954,0.0001430073],"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.00004895631,0.000449708,0.01632769,0.00006236154,0.0000430876,0.0001382173,0.0009340825,0.00004628153,0.0128567,0.9429696,0.003809112,0.02231422],"study_design_scores_gemma":[0.002331273,0.001064857,0.1672144,0.0001022829,0.00002276741,0.0002789854,0.00008632693,0.006285269,0.1430014,0.6761329,0.00260279,0.0008767321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5777647,0.000127878,0.4163841,0.001563462,0.0005604686,0.0003698031,0.000008708346,0.0002522641,0.002968556],"genre_scores_gemma":[0.9655909,0.0000216449,0.03380845,0.00006045542,0.00002081439,0.00001786619,0.000002335416,0.00001042361,0.0004670914],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3878262,"threshold_uncertainty_score":0.5198165,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001086771,0.0001094603,0.0001820684,0.00008886486,0.00001179743,0.00001437415,0.0001440581,0.00007718766,0.0001558647],"category_scores_gemma":[0.000007779501,0.0001083259,0.00004502489,0.0001665098,0.00003821898,0.00009639689,0.00001223366,0.000124245,0.0001528579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001387054,"about_ca_system_score_gemma":0.000003918674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006225003,"about_ca_topic_score_gemma":0.00000977952,"domain_scores_codex":[0.9993427,0.0000298439,0.0002388845,0.00009108741,0.000080854,0.0002166005],"domain_scores_gemma":[0.9996765,0.00006127443,0.00002687049,0.0001680804,0.00001880912,0.00004841571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00003390167,0.0003899369,0.3223766,0.001446618,0.0003373691,0.0001076345,0.003301273,0.03487237,0.5326892,0.0234575,0.0770735,0.003914106],"study_design_scores_gemma":[0.00235804,0.000320495,0.615798,0.0005831752,0.000047918,0.00005788871,0.001010782,0.005773713,0.3494808,0.01616847,0.007172739,0.001228034],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9947377,0.00008544404,0.0000197862,0.00004243345,0.0001455764,0.0001998088,0.0000017808,0.00009335053,0.004674149],"genre_scores_gemma":[0.9995084,0.000006812246,0.00009373511,0.00002364769,0.000021106,0.00002873563,0.000001323348,0.00001622986,0.0002999851],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2934214,"threshold_uncertainty_score":0.4417401,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002473292,0.0001889735,0.0002569873,0.00002398884,0.0001689633,0.0001269231,0.0002514017,0.00007444007,0.0001909119],"category_scores_gemma":[0.0006120261,0.0001372565,0.00005386239,0.0001235398,0.00009391346,0.0002560249,0.0001679446,0.000260505,0.0001587752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003703446,"about_ca_system_score_gemma":0.00001257296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003996018,"about_ca_topic_score_gemma":0.000001800781,"domain_scores_codex":[0.9988864,0.0000514619,0.0003235616,0.0001991411,0.0002208814,0.0003185493],"domain_scores_gemma":[0.9982156,0.0009778443,0.000168665,0.0004772522,0.00007406762,0.00008654568],"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.000005236508,0.00005387424,0.002956818,0.0004002328,0.00008326945,0.0000108324,0.001287868,0.00001082306,0.001478441,0.9752167,0.00786448,0.01063139],"study_design_scores_gemma":[0.0004108695,0.00002744755,0.001432061,0.0001827815,0.00004753734,0.00004703209,0.0005308167,0.000316153,0.001147054,0.9925339,0.003069072,0.0002552988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9827165,0.00007470818,0.001999597,0.001645784,0.0003696406,0.000683516,0.000002194748,0.0002181533,0.01228993],"genre_scores_gemma":[0.9861513,0.00002033615,0.01203609,0.0000873684,0.0002490744,0.00004742031,8.550945e-7,0.00004069156,0.001366848],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01731714,"threshold_uncertainty_score":0.5597159,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002151217,0.0001399006,0.0003213625,0.0001030117,0.00006612621,0.000005559133,0.000180572,0.0001106232,0.00007130703],"category_scores_gemma":[0.00008105615,0.00009583132,0.00009173649,0.0001704779,0.0003714523,0.00006468023,0.00005306916,0.0001428882,6.640385e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006026687,"about_ca_system_score_gemma":0.0000151777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002146018,"about_ca_topic_score_gemma":0.00003075064,"domain_scores_codex":[0.9990476,0.00006502291,0.000317996,0.0001663047,0.000243195,0.0001599179],"domain_scores_gemma":[0.9988572,0.0002582767,0.0003000586,0.0004277599,0.0001062405,0.00005044663],"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.0001156823,0.00006065033,0.09939224,0.0001855344,0.00007901951,8.698871e-7,0.0002329594,0.00001071079,0.001485904,0.8941743,0.0002340446,0.004028126],"study_design_scores_gemma":[0.0009141134,0.0002837489,0.02904961,0.0001856672,0.0001024204,0.00003673128,0.0001100326,0.0001169245,0.02266698,0.9461534,0.0002279832,0.0001523595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9917773,0.00001689498,0.002483148,0.00002370345,0.00014294,0.0001608191,0.000007269194,0.00003616749,0.005351772],"genre_scores_gemma":[0.9852974,0.000004182882,0.01459346,0.00001110557,0.00002123155,0.000005328475,0.000002020181,0.00001659987,0.00004868437],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07034262,"threshold_uncertainty_score":0.3907888,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001744578,0.0001654813,0.0002078527,0.0000713922,0.00003494788,0.00003777271,0.0002534394,0.00009937615,0.001178761],"category_scores_gemma":[0.00001967449,0.0001192937,0.00009505569,0.0002934437,0.00008207052,0.0001095656,0.0000178137,0.0002388217,0.0005066036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001680251,"about_ca_system_score_gemma":0.000006464297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001241423,"about_ca_topic_score_gemma":0.00002414649,"domain_scores_codex":[0.9991173,0.00005894436,0.0002591481,0.0001399417,0.0001419938,0.0002827229],"domain_scores_gemma":[0.9993632,0.0001571308,0.00003248892,0.0003644819,0.00002582836,0.00005683363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00009871463,0.0007183132,0.3057665,0.0005107964,0.0004553836,0.00005506059,0.003409377,0.003028214,0.03060218,0.6115158,0.04033191,0.003507759],"study_design_scores_gemma":[0.003152326,0.0004379521,0.779898,0.001177374,0.00009192668,0.0001203004,0.003910797,0.003370779,0.03576925,0.1417636,0.02833463,0.001973023],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9632745,0.00005526442,0.00000340589,0.000167312,0.0003625309,0.0002242537,0.00000761474,0.00007276179,0.03583236],"genre_scores_gemma":[0.9993509,0.000009244558,0.00001230267,0.00005500412,0.00003775705,0.00008137464,0.000002390287,0.00002532224,0.0004256747],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4741315,"threshold_uncertainty_score":0.9997343,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919345,0.0001618021,0.0002209349,0.0001835208,0.00008479506,0.00005933404,0.0009016961,0.00007485114,0.00007020604],"category_scores_gemma":[0.00002343418,0.0001484401,0.0001595481,0.0005757122,0.00006804882,0.000576551,0.0002755143,0.0001788977,0.00006183363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002442985,"about_ca_system_score_gemma":0.00003308771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001740737,"about_ca_topic_score_gemma":0.000001253675,"domain_scores_codex":[0.9985722,0.00009680298,0.0003118814,0.000232673,0.0003125458,0.0004739445],"domain_scores_gemma":[0.9988704,0.0001374737,0.0001576551,0.0006087948,0.00005514337,0.0001705861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001533357,0.0003851352,0.03747822,0.00009424316,0.00009222019,0.00001286084,0.002104169,0.00004407132,0.00655526,0.9361264,0.002206071,0.01488599],"study_design_scores_gemma":[0.006384505,0.002080822,0.5482679,0.001109635,0.0004928318,0.0005769682,0.001267622,0.01077124,0.08517919,0.1537714,0.1853519,0.004745952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9308344,0.0004996554,0.060376,0.0004539908,0.001287996,0.0001906164,0.000005000757,0.0002605049,0.006091825],"genre_scores_gemma":[0.9947397,0.00002447006,0.004889061,0.0001223222,0.0001194661,0.000007718256,0.000001925558,0.000009538278,0.00008586361],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.782355,"threshold_uncertainty_score":0.6053212,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007647242,0.000248147,0.0003433898,0.0000829984,0.0001209374,0.00006049255,0.0002815186,0.0001316015,0.00005989477],"category_scores_gemma":[0.00002776083,0.0002326046,0.0001490438,0.0001761302,0.00006570827,0.0002623316,0.00002152232,0.0001621676,0.0002253631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004713178,"about_ca_system_score_gemma":0.000007848616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001284831,"about_ca_topic_score_gemma":0.000001670668,"domain_scores_codex":[0.9985701,0.00008801636,0.0003613371,0.0001715735,0.0001507582,0.0006582523],"domain_scores_gemma":[0.9990734,0.0002313049,0.00005819235,0.0004015625,0.00004130648,0.0001942292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001485945,0.0001887493,0.006531353,0.001564569,0.00045733,0.000007028955,0.001869425,0.004169644,0.03063126,0.9223651,0.03074023,0.001326689],"study_design_scores_gemma":[0.00540502,0.0005412467,0.01428074,0.0007593159,0.0003912639,0.0003277888,0.004776088,0.01175502,0.01654791,0.02657115,0.915615,0.003029473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9483266,0.003324647,0.01498882,0.00003435745,0.009575681,0.002016173,0.0003207836,0.001309086,0.02010383],"genre_scores_gemma":[0.9967831,0.0000110163,0.0001346044,0.00002720939,0.0003635584,0.0002337875,0.00003872966,0.00005600352,0.002352016],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.895794,"threshold_uncertainty_score":0.9485341,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001709012,0.0001286318,0.0001616715,0.00006470221,0.00006704374,0.00003361579,0.0001236492,0.00008692909,0.00003929704],"category_scores_gemma":[0.0000173541,0.0001312039,0.00007814374,0.0001135424,0.0000635106,0.0001774341,0.00000978658,0.0001068134,0.0001022521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003348311,"about_ca_system_score_gemma":0.00002863251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004978732,"about_ca_topic_score_gemma":0.000005220423,"domain_scores_codex":[0.9992959,0.00002310662,0.0001867063,0.0001246355,0.00009333377,0.0002762898],"domain_scores_gemma":[0.9995328,0.00005884355,0.0000220314,0.0001834164,0.00004757213,0.0001552958],"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.00005586398,0.00009080135,0.00690717,0.0001875724,0.000309816,0.000012653,0.000513714,0.0305321,0.01159204,0.8350605,0.113038,0.00169978],"study_design_scores_gemma":[0.008057394,0.0008179198,0.006204946,0.000224245,0.0003458177,0.0005977571,0.003494659,0.03050193,0.0440803,0.5720643,0.3310325,0.002578133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9813069,0.0002828721,0.008399842,0.00008888742,0.002706774,0.0004959868,0.00008936392,0.0006618376,0.005967536],"genre_scores_gemma":[0.9975741,0.000004941267,0.001025337,0.00002079236,0.0002315003,0.00007466997,0.00002210764,0.0000262775,0.001020271],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2629961,"threshold_uncertainty_score":0.5350342,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001820252,0.00009712775,0.0001814489,0.00003926624,0.00006027272,0.00001152618,0.000145084,0.00005690066,0.0006427845],"category_scores_gemma":[0.0002005331,0.00007990081,0.00007080973,0.0001622463,0.00005953536,0.00003006786,0.00002077619,0.00009070815,0.00004510336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008829494,"about_ca_system_score_gemma":0.00003254781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002589289,"about_ca_topic_score_gemma":0.000002850868,"domain_scores_codex":[0.9992312,0.00002854817,0.0002933849,0.0001197581,0.0001620949,0.0001649968],"domain_scores_gemma":[0.9991115,0.0001973997,0.0001398152,0.0004185383,0.00006413308,0.00006855463],"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":[9.737424e-7,0.0004169962,0.0008926239,0.0001240709,0.0000215444,0.000001060618,0.0002029805,0.00000135951,0.001045786,0.9377987,0.05917989,0.0003139597],"study_design_scores_gemma":[0.0006982699,0.0001019277,0.0007619826,0.0002041729,0.00009957553,0.0000228694,0.0004058457,0.0001174933,0.04653888,0.850966,0.09973792,0.0003451009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8623086,0.00007607519,0.004739255,0.0006358395,0.0001353362,0.001023475,0.00003241013,0.00018641,0.1308627],"genre_scores_gemma":[0.9565061,0.00000502736,0.04035536,0.00001205743,0.00001160386,0.00005840628,0.000002470647,0.00001635253,0.003032628],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.12783,"threshold_uncertainty_score":0.703804,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004476821,0.0001995075,0.0001741102,0.00009051392,0.0002273232,0.0002237653,0.001962094,0.00007553203,0.00252629],"category_scores_gemma":[0.0001077598,0.0001318213,0.0000952624,0.0004128359,0.0004389104,0.0004857722,0.0003464787,0.0004357956,0.01122215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004255783,"about_ca_system_score_gemma":0.00005128444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002082379,"about_ca_topic_score_gemma":0.000001100588,"domain_scores_codex":[0.9980386,0.0002166557,0.0002092607,0.0004266487,0.0004862437,0.0006226134],"domain_scores_gemma":[0.9978244,0.0006559882,0.00006531252,0.001155098,0.0001172312,0.000181935],"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.00001185108,0.0002070277,0.0006052381,0.00001135003,0.00008167388,0.00005032632,0.0005353563,0.0001309417,0.00807544,0.7890052,0.1050077,0.09627794],"study_design_scores_gemma":[0.001665145,0.001017247,0.03995449,0.0001508874,0.00001642611,0.0001307749,0.0002468497,0.01533868,0.02923357,0.8791004,0.03176375,0.001381742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7591302,0.00006804003,0.02653059,0.06167775,0.0009035174,0.003070297,0.00002089652,0.001127318,0.1474713],"genre_scores_gemma":[0.9877369,0.000004898507,0.002050354,0.0008237077,0.00004913274,0.00007773884,0.000002542432,0.00001572584,0.00923902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2286066,"threshold_uncertainty_score":0.9983855,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006196976,0.0002990962,0.0003270847,0.00003756197,0.0006087767,0.00004395535,0.0007238725,0.0001285028,0.00002774646],"category_scores_gemma":[0.001755313,0.00016224,0.000198055,0.0002184186,0.000219119,0.00008370347,0.0001017863,0.0004104338,0.0001132588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007830525,"about_ca_system_score_gemma":0.00006415786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009952558,"about_ca_topic_score_gemma":0.000007321478,"domain_scores_codex":[0.9980924,0.0000856433,0.00055882,0.000313482,0.0004528981,0.0004968045],"domain_scores_gemma":[0.9915976,0.006659442,0.0003075777,0.001192192,0.0001626168,0.0000805542],"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.000109677,0.0002318736,0.00001845136,0.00005514895,0.00008002873,0.000009210943,0.001076633,0.00008854417,0.00005808705,0.8069462,0.1910589,0.0002673037],"study_design_scores_gemma":[0.001735636,0.0004112646,0.000183253,0.0001063277,0.00009644122,0.00003774009,0.0002970303,0.0004939252,0.002468901,0.9224815,0.0713557,0.0003322653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6861153,0.0002966073,0.03177665,0.1125529,0.007625273,0.02476479,0.0004995106,0.0027509,0.1336181],"genre_scores_gemma":[0.9693374,0.00003953923,0.01742483,0.0003663965,0.0003833262,0.0004493338,0.000005668764,0.00008738103,0.01190611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2832222,"threshold_uncertainty_score":0.6615956,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007474927,0.0001343196,0.0001142415,0.00004893035,0.0006507089,0.0001341829,0.0008442804,0.00004077347,0.00001163698],"category_scores_gemma":[0.00007791495,0.00009309121,0.00005116342,0.0003008908,0.0002522074,0.0008305603,0.0006174007,0.0002655323,0.00004066814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001693955,"about_ca_system_score_gemma":0.00002390708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007112335,"about_ca_topic_score_gemma":0.000002250015,"domain_scores_codex":[0.9984451,0.0001353128,0.0001521315,0.0002973999,0.0003402465,0.0006298037],"domain_scores_gemma":[0.9987648,0.0001101002,0.00004880157,0.0008274076,0.00006814209,0.0001808104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002887696,0.0001578891,0.01760345,0.00002147826,0.00006372913,0.00001042987,0.0009707611,0.00005242823,0.004509016,0.9385628,0.004337576,0.03368162],"study_design_scores_gemma":[0.002137254,0.0008208208,0.2028136,0.00005767314,0.00004777826,0.0004365778,0.0002681469,0.003737177,0.0381599,0.2081395,0.5419957,0.00138589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9799583,0.002075799,0.009354964,0.003995957,0.001051479,0.0005021569,0.000002808844,0.0002027356,0.002855821],"genre_scores_gemma":[0.9927462,0.00007011536,0.003289839,0.00004181792,0.0001885925,0.00002137844,0.000001014166,0.0000107141,0.003630268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7304232,"threshold_uncertainty_score":0.5004793,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000437784,0.0004321034,0.0004076159,0.0003153063,0.0003765011,0.0005616196,0.001793376,0.0002582501,0.001512224],"category_scores_gemma":[0.0006436856,0.0004299551,0.0002205173,0.0009540062,0.0007171338,0.00065634,0.0005107869,0.001126203,0.008086297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001116403,"about_ca_system_score_gemma":0.00004509684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001029945,"about_ca_topic_score_gemma":0.00000209971,"domain_scores_codex":[0.9957793,0.0004005092,0.0004261212,0.001009728,0.001031622,0.001352662],"domain_scores_gemma":[0.9961168,0.001477254,0.00007499208,0.001562534,0.0001936132,0.0005748163],"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.00004452033,0.0007745528,0.0009431461,0.0001013002,0.00003755716,0.0006280225,0.0005129736,0.0001529987,0.0005096244,0.9201941,0.01642989,0.05967129],"study_design_scores_gemma":[0.00508998,0.007556669,0.02535657,0.001741293,0.0001382849,0.0006101771,0.0001255074,0.2017181,0.0162152,0.5324306,0.2047433,0.004274317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4184972,0.004614029,0.183994,0.189925,0.01264887,0.00445096,0.000462266,0.003322426,0.1820852],"genre_scores_gemma":[0.9871303,0.0001239649,0.007564445,0.0008461052,0.0001818019,0.00002342998,0.000002310438,0.00004404328,0.004083644],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.568633,"threshold_uncertainty_score":0.9998152,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005415774,0.0001409016,0.0001725973,0.0001411788,0.0001224129,0.0001739914,0.0004796154,0.00008708614,0.00002320272],"category_scores_gemma":[0.0003716998,0.0001344415,0.00004269871,0.0003762452,0.0003339718,0.0008804335,0.0002023065,0.0003182976,0.0001105462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003710325,"about_ca_system_score_gemma":0.00006740377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002033337,"about_ca_topic_score_gemma":0.00000637966,"domain_scores_codex":[0.9984726,0.000150948,0.0001814025,0.000387414,0.0003674272,0.0004402398],"domain_scores_gemma":[0.9985124,0.0003830114,0.00003314677,0.0004626335,0.0001922404,0.0004165043],"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.0000365281,0.0001101126,0.004090589,0.00001526766,0.00001612483,0.00007371356,0.0002572965,0.00001575606,0.001057569,0.9736346,0.007936715,0.0127557],"study_design_scores_gemma":[0.002122657,0.0007174481,0.02392688,0.00004355209,0.00001776467,0.0003084907,0.0002345608,0.005395116,0.005922205,0.9347506,0.02596855,0.0005921292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6136714,0.001108856,0.3492032,0.01398809,0.002683146,0.0009125865,0.0000179869,0.0010159,0.01739885],"genre_scores_gemma":[0.9919303,0.00001770062,0.007239606,0.0001889406,0.00004758476,0.00001626276,0.000001924535,0.00001039954,0.0005472575],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3782589,"threshold_uncertainty_score":0.5482364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}