{"meta":{"query_hash":"2c5d9cac2978","filters":{"venue":"MATRIX book series"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/2c5d9cac2978","api":"https://metacan.xera.ac/api/v1/cohort?venue=MATRIX+book+series"},"results":[{"id":"W2921517549","doi":"10.1007/978-3-030-04161-8_34","title":"Alternate Mirror Families and Hypergeometric Motives","year":2019,"lang":"en","type":"book-chapter","venue":"MATRIX book series","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mirror symmetry; Mathematics; Hypergeometric distribution; Invertible matrix; Hypergeometric function; Pure mathematics; Point (geometry); Symmetry (geometry); Algebra over a field; Algebraic number; Arithmetic; Geometry; Mathematical analysis","score_opus":0.02241795423160652,"score_gpt":0.2627707449619666,"score_spread":0.2403527907303601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921517549","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018771403,0.015511908,0.000046428933,0.000214898,0.0007511794,0.00071077805,0.00018638303,0.00033005708,0.96347696],"genre_scores_gemma":[0.003797404,0.0062942132,0.0014162296,0.00012105537,0.00014270475,0.000011190556,0.000026221614,0.00016776384,0.9880232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980935,0.000035899848,0.0005172499,0.00056974497,0.00040270947,0.00038089213],"domain_scores_gemma":[0.99818546,0.0005630936,0.00036839352,0.0006604311,0.000098686825,0.00012396318],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00030109548,0.0006444076,0.00092499465,0.0006599864,0.00015096078,0.000089081346,0.00032750756,0.00044270203,0.0022124536],"category_scores_gemma":[0.00016969784,0.0005868558,0.00023024128,0.00008965025,0.00034897224,0.0004772529,0.0003329702,0.00045216555,0.0009511773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104377985,0.000019980826,0.0000957346,0.000938805,0.00030865797,0.000045361587,0.00044019023,2.6503298e-7,0.000049186932,0.9949331,0.002162337,0.0009019719],"study_design_scores_gemma":[0.000317648,0.00015037852,0.00005877989,0.00023231059,0.00018998113,0.00013284392,0.00019317103,0.0000014626418,0.00025496914,0.5326255,0.4652203,0.0006226466],"about_ca_topic_score_codex":0.000013246459,"about_ca_topic_score_gemma":0.0000071185937,"teacher_disagreement_score":0.46305797,"about_ca_system_score_codex":0.000048755086,"about_ca_system_score_gemma":0.00006699624,"threshold_uncertainty_score":0.99982667},"labels":[],"label_agreement":null},{"id":"W4399262314","doi":"10.1007/978-3-031-47417-0_25","title":"Entrance Laws for Continuous-State Nonlinear Branching Processes Coming Down from Infinity","year":2024,"lang":"en","type":"book-chapter","venue":"MATRIX book series","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Infinity; Branching (polymer chemistry); Nonlinear system; State (computer science); Law; Mathematics; Physics; Political science; Mathematical analysis; Materials science; Quantum mechanics; Algorithm","score_opus":0.027505834026765933,"score_gpt":0.2965022220606711,"score_spread":0.2689963880339052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399262314","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011234371,0.0220305,0.6809794,0.00074628275,0.0019544717,0.0030753803,0.023667622,0.0012038242,0.2662302],"genre_scores_gemma":[0.00030154578,0.0017642691,0.11539499,0.00029113708,0.0011589765,0.0002009812,0.0004446473,0.000461632,0.8799818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753433,0.000009398347,0.00087451615,0.0006886553,0.0004054534,0.00048762458],"domain_scores_gemma":[0.996617,0.0020601384,0.000410401,0.00041407417,0.00035167782,0.00014669621],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020341379,0.0006864286,0.0011441282,0.000095262294,0.00022887156,0.00029962164,0.00036832914,0.0003594136,0.0004429343],"category_scores_gemma":[0.0010121043,0.0006312246,0.00022698408,0.000049168935,0.0001419507,0.00029351813,0.00016537965,0.0005905393,0.00014819588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025748077,0.000026665994,3.2155646e-7,0.006055499,0.00025211042,0.000055068755,0.0007533266,0.0000030189203,0.00005225614,0.98862326,0.002502126,0.0014188364],"study_design_scores_gemma":[0.0002787151,0.000119948505,7.60636e-8,0.0014357441,0.0003005182,0.000012083319,0.00003303492,0.00044389247,0.00030699314,0.6340508,0.36255386,0.00046431384],"about_ca_topic_score_codex":0.000024264384,"about_ca_topic_score_gemma":0.00017667444,"teacher_disagreement_score":0.61375165,"about_ca_system_score_codex":0.000069067224,"about_ca_system_score_gemma":0.00029020407,"threshold_uncertainty_score":0.9996139},"labels":[],"label_agreement":null},{"id":"W4399262599","doi":"10.1007/978-3-031-47417-0_12","title":"Treewidth, Circle Graphs and Circular Drawings","year":2024,"lang":"en","type":"book-chapter","venue":"MATRIX book series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Treewidth; Mathematics; Partial k-tree; 1-planar graph; Combinatorics; Chordal graph; Pathwidth; Graph; Line graph","score_opus":0.011174332977298888,"score_gpt":0.2525441712170429,"score_spread":0.24136983823974403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399262599","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011314089,0.08343356,0.0069515454,0.0021799135,0.0009492827,0.0009034257,0.00007486202,0.0016640174,0.9037303],"genre_scores_gemma":[0.0013690707,0.003383705,0.0028011808,0.0002186157,0.00009392072,0.00003260911,0.000011580459,0.00012925942,0.99196005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975437,0.000024153866,0.00035057566,0.0010100318,0.0005784168,0.0004931285],"domain_scores_gemma":[0.9983655,0.000104908686,0.000109884364,0.0011111548,0.0001017614,0.00020678042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028917042,0.00046061663,0.0004958513,0.0005548587,0.00024145111,0.0005487491,0.0010116046,0.00029193138,0.0001405725],"category_scores_gemma":[0.000017675813,0.00048776966,0.0002420364,0.00014544105,0.0005662178,0.0013200366,0.0009936902,0.00065818056,0.00051574747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011545386,0.000003940518,0.0000031780849,0.00025805528,0.000087355875,0.0003389386,0.00028845275,0.000002335397,0.00015283244,0.9908773,0.0008208988,0.0071551907],"study_design_scores_gemma":[0.00008040314,0.000076754695,0.000006981104,0.0001317279,0.000021976535,0.00014062545,0.000007923695,0.000033491247,0.0001741614,0.618284,0.38070408,0.00033790324],"about_ca_topic_score_codex":0.000005893883,"about_ca_topic_score_gemma":0.000005868334,"teacher_disagreement_score":0.37988317,"about_ca_system_score_codex":0.00006341105,"about_ca_system_score_gemma":0.00010207932,"threshold_uncertainty_score":0.9997574},"labels":[],"label_agreement":null},{"id":"W4399855894","doi":"10.1007/978-3-030-62497-2_66","title":"Correction to: The Penrose and the Taylor–Socolar tilings, and first steps to beyond","year":2024,"lang":"en","type":"book-chapter","venue":"MATRIX book series","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Genealogy; History","score_opus":0.004033605535139051,"score_gpt":0.19501170533249532,"score_spread":0.19097809979735628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399855894","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032701758,0.18045901,0.008115622,0.013838379,0.05499068,0.014411294,0.0015363905,0.003141383,0.7202371],"genre_scores_gemma":[0.0030660152,0.008565558,0.0005341311,0.0005199428,0.00077753013,0.00020284772,0.0000184081,0.00020931385,0.9861063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924004,0.000005583476,0.00021282339,0.00024179534,0.00012217522,0.00017759639],"domain_scores_gemma":[0.9995274,0.00007996693,0.00003394943,0.00025499525,0.000028685832,0.00007498212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015670153,0.0002970872,0.00029988628,0.000053784035,0.00019085416,0.00021442866,0.0001144885,0.000120835975,0.00008654898],"category_scores_gemma":[0.000021623306,0.00019036033,0.00004995662,0.000025210607,0.000059575712,0.00013281478,0.00018150582,0.0002364034,0.00011774013],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068573625,0.0000064231435,7.2199884e-7,0.0019852845,0.0003626514,0.00006264907,0.008145783,0.004283122,0.0027696164,0.85034776,0.11834952,0.013000759],"study_design_scores_gemma":[0.00013743379,0.000059092854,0.0000011222535,0.00017142916,0.000084021885,0.0000479135,0.000115267554,0.00037038056,0.00085762,0.010829559,0.98708755,0.00023860013],"about_ca_topic_score_codex":0.000013066641,"about_ca_topic_score_gemma":0.00025732533,"teacher_disagreement_score":0.86873806,"about_ca_system_score_codex":0.000042541476,"about_ca_system_score_gemma":0.000008731364,"threshold_uncertainty_score":0.7762669},"labels":[],"label_agreement":null},{"id":"W4411968205","doi":"10.1007/978-3-031-76738-8_6","title":"Optimizing Knot Probabilities for a Lattice Polygon Model using Simultaneous Perturbation Stochastic Approximation","year":2025,"lang":"en","type":"book-chapter","venue":"MATRIX book series","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Knot (papermaking); Polygon (computer graphics); Lattice (music); Mathematics; Perturbation (astronomy); Combinatorics; Statistical physics; Applied mathematics; Computer science; Physics; Materials science; Quantum mechanics; Composite material; Acoustics","score_opus":0.09086331643202987,"score_gpt":0.36962459085767085,"score_spread":0.27876127442564097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411968205","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006768056,0.0008956901,0.9186473,0.0005894958,0.0001276496,0.00260931,0.00035837747,0.00033916926,0.07636534],"genre_scores_gemma":[0.0037683893,0.000036167687,0.19061382,0.00017676978,0.00014405337,0.00023615285,0.000115346855,0.00006412583,0.80484515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970418,0.00002987116,0.0010975471,0.0007762417,0.00078094157,0.00027359131],"domain_scores_gemma":[0.9953002,0.0021427933,0.00066489977,0.0007931482,0.0010255255,0.000073434814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000645343,0.0004216874,0.00057955936,0.00049350515,0.0005236461,0.00045688573,0.00048908405,0.00040548178,0.00016210657],"category_scores_gemma":[0.0012550631,0.00038612008,0.00028784174,0.00013113281,0.0001679402,0.0007737401,0.0001593447,0.00021531145,0.00002551715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008520685,0.000012793016,1.2072125e-7,0.00008866011,0.0000202442,3.3767287e-7,0.00051025895,0.3929458,0.00007304067,0.6021588,0.00063512207,0.0034696376],"study_design_scores_gemma":[0.000105526466,0.00003688663,4.6967394e-8,0.0001050988,0.00007178762,0.0000033394558,0.00008956628,0.5506179,0.00006828147,0.41893983,0.029725088,0.00023669505],"about_ca_topic_score_codex":0.0000081497,"about_ca_topic_score_gemma":0.000007066729,"teacher_disagreement_score":0.72847986,"about_ca_system_score_codex":0.00025719733,"about_ca_system_score_gemma":0.00032305118,"threshold_uncertainty_score":0.9998591},"labels":[],"label_agreement":null},{"id":"W4411968634","doi":"10.1007/978-3-031-76738-8_36","title":"Monte Carlo Sampling of Dense Walks Using PERM and GARM","year":2025,"lang":"en","type":"book-chapter","venue":"MATRIX book series","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Monte Carlo method; Statistical physics; Sampling (signal processing); Rejection sampling; Statistics; Computer science; Mathematics; Markov chain Monte Carlo; Hybrid Monte Carlo; Physics; Telecommunications","score_opus":0.011613159230346629,"score_gpt":0.2487730812874641,"score_spread":0.23715992205711744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411968634","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042895637,0.007907922,0.009494237,0.00022725512,0.00050322677,0.0006933945,0.0010754571,0.00010410265,0.93709874],"genre_scores_gemma":[0.4558774,0.00008263232,0.0030510633,0.000069984664,0.0006584474,0.00000738498,0.00004398321,0.00007106404,0.54013807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929196,0.000007360296,0.0002468709,0.00020633992,0.00012307709,0.00012436925],"domain_scores_gemma":[0.9995134,0.00007621427,0.00013063084,0.00014181071,0.00009408879,0.00004388525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003140181,0.00022233016,0.00035272326,0.000047208367,0.0000863438,0.000035868303,0.00008097787,0.000066372726,0.00021160471],"category_scores_gemma":[0.0000015711291,0.00021664755,0.00013801458,0.000014786045,0.00017907127,0.00009692878,0.0001267092,0.00016001721,0.0000050955355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035355144,0.000007937908,0.00005058061,0.0000979563,0.00011098723,0.0000012525501,0.00010848649,0.0004170019,0.0000696734,0.99666655,0.00008009609,0.0023541015],"study_design_scores_gemma":[0.0002645331,0.000053931257,0.000037450238,0.00056842837,0.00026761656,0.0000030437523,0.00010988402,0.000776571,0.00039319642,0.9544128,0.042671103,0.00044145144],"about_ca_topic_score_codex":0.00003914482,"about_ca_topic_score_gemma":9.693445e-7,"teacher_disagreement_score":0.41298175,"about_ca_system_score_codex":0.000014719169,"about_ca_system_score_gemma":0.00007908752,"threshold_uncertainty_score":0.8834631},"labels":[],"label_agreement":null}]}