{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009564248,0.008583628,0.00876105,0.0016376547,0.0017394781,0.000014235459,0.00009871712,0.0001243303,0.96947664],"genre_scores_gemma":[0.103670634,0.008381523,0.0045502023,0.00035888204,0.0015379827,0.000034158526,0.00015631031,0.00014476954,0.88116556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987245,0.000029268042,0.000003832379,0.000017243907,0.00006021516,0.000017024133],"domain_scores_gemma":[0.9998944,0.00003129936,0.000010733616,0.000015952159,0.000028237273,0.000019337711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016600032,0.00048779947,0.00030023168,0.0012101895,0.0009100375,0.0026761694,0.0004404956,0.0004385875,0.030633252],"category_scores_gemma":[0.00052888854,0.00021808772,0.00016361252,0.0013997776,0.0010632408,0.0027330688,0.0007805593,0.0011683712,0.00647045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072892403,0.0000076860315,0.00002992604,0.000027802987,0.000001169659,0.000019176881,0.000117391224,0.00012398475,0.00028778837,0.95403737,0.024438705,0.02090168],"study_design_scores_gemma":[0.000004161051,0.000008977729,0.00017680675,0.000040822913,0.000002915962,0.00018146331,0.000120369754,0.00069873885,0.00032599972,0.577193,0.42124063,0.0000060702214],"about_ca_topic_score_codex":0.00045938714,"about_ca_topic_score_gemma":0.0009978847,"teacher_disagreement_score":0.030633252,"about_ca_system_score_codex":0.0011011275,"about_ca_system_score_gemma":0.0004968397,"threshold_uncertainty_score":0.102478385},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019174738,0.0030348008,0.44355923,0.0025154066,0.0008924008,0.000053764477,0.0002694349,0.0005552542,0.5299449],"genre_scores_gemma":[0.34093416,0.0052836505,0.07324585,0.0012650058,0.0010622317,0.00023421085,0.00042767808,0.0009783377,0.5765688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976724,0.000033595992,0.000010879097,0.000045521967,0.000115999006,0.000026793696],"domain_scores_gemma":[0.99933124,0.0003708768,0.00003942122,0.00008195693,0.00011549759,0.00006099497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004688386,0.0006592363,0.00053869886,0.00079607236,0.0009921835,0.0025075104,0.0009324761,0.00115947,0.016043654],"category_scores_gemma":[0.002090757,0.0004799414,0.0007128097,0.0007367051,0.002159095,0.0042674886,0.0009911365,0.004505956,0.0034828733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020753243,0.0000052670734,0.000013646579,0.000010050923,8.6681695e-7,0.000010464511,0.00004407296,0.0005233881,0.00016696898,0.99359375,0.0023800533,0.003249535],"study_design_scores_gemma":[0.000002190505,0.0000029522153,0.000044056585,0.000011826476,0.000001640268,0.000036744437,0.000014079933,0.006001892,0.00017383604,0.98347294,0.010232625,0.0000053450267],"about_ca_topic_score_codex":0.0011883208,"about_ca_topic_score_gemma":0.0011940945,"teacher_disagreement_score":0.016043654,"about_ca_system_score_codex":0.0019452652,"about_ca_system_score_gemma":0.0009399659,"threshold_uncertainty_score":0.05367142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004716919,0.03645202,0.048149604,0.0020982686,0.0020774503,0.00005041401,0.00070637214,0.000642188,0.9051067],"genre_scores_gemma":[0.059818905,0.054165322,0.05458334,0.0015492318,0.0020077766,0.00013044091,0.0019202018,0.0009340021,0.8248907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99988604,0.000015480915,0.00000366026,0.000030298486,0.00005262349,0.000011855511],"domain_scores_gemma":[0.9997383,0.00010700021,0.000021942742,0.000040167426,0.00006656034,0.000026070325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009921959,0.00066934567,0.0003591089,0.001034176,0.00072962395,0.0021472801,0.0007729524,0.0006093854,0.050336797],"category_scores_gemma":[0.00093316747,0.00045080885,0.00026176768,0.003950171,0.0007155232,0.0029631695,0.00051905,0.001377772,0.013244516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026037098,0.00003340107,0.00009038229,0.0002619639,0.0000055308815,0.00004014034,0.00018107973,0.002187334,0.0012199045,0.5124021,0.27800602,0.20554608],"study_design_scores_gemma":[0.0000063820826,0.000014261016,0.0002886328,0.0001149627,0.000007756035,0.00020501297,0.00015717166,0.0021442934,0.000507209,0.31894004,0.6776045,0.000009838229],"about_ca_topic_score_codex":0.002620162,"about_ca_topic_score_gemma":0.004811211,"teacher_disagreement_score":0.050336797,"about_ca_system_score_codex":0.00097451906,"about_ca_system_score_gemma":0.0006156587,"threshold_uncertainty_score":0.16839337},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022902648,0.006158527,0.0025149058,0.074641496,0.82057416,0.000033409186,0.0011689945,0.0006047456,0.094074726],"genre_scores_gemma":[0.007446737,0.00706337,0.0032888723,0.033681557,0.12050488,0.00008333216,0.00089745456,0.001625336,0.8254084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983311,0.00025431497,0.00015228317,0.00025036122,0.0008705194,0.00014125631],"domain_scores_gemma":[0.9928886,0.0015215094,0.0002788696,0.0006825236,0.0042566536,0.0003718488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014170483,0.0012574352,0.00087736925,0.0023808514,0.0032707525,0.005776976,0.0014940298,0.0030682248,0.100266844],"category_scores_gemma":[0.019899653,0.00054871244,0.0005924993,0.0021665092,0.0030328066,0.0041541304,0.0015788933,0.00738955,0.063364364],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068378545,0.0000018656965,0.000010506435,0.000038372786,0.0000010553476,0.000017456028,0.00002687532,0.00001999411,0.000015782154,0.009428356,0.9845616,0.005871101],"study_design_scores_gemma":[0.0000028741422,0.0000022450542,0.000047701647,0.00004981904,0.0000013799046,0.000050996427,0.00002755525,0.000037753827,0.00004052473,0.0025195058,0.99721515,0.000004468154],"about_ca_topic_score_codex":0.01491121,"about_ca_topic_score_gemma":0.031320076,"teacher_disagreement_score":0.100266844,"about_ca_system_score_codex":0.0031239782,"about_ca_system_score_gemma":0.004292017,"threshold_uncertainty_score":0.33542603},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01079321,0.00027253758,0.98109347,0.0003334224,0.000074266434,0.000027743296,0.00009439087,0.00021672777,0.0070943297],"genre_scores_gemma":[0.57177836,0.0011590883,0.39234155,0.00032196962,0.00025873652,0.00040076015,0.0005337843,0.0009740301,0.032231748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946445,0.00023265203,0.000016036372,0.000082749204,0.00015524979,0.000048877235],"domain_scores_gemma":[0.99712473,0.0023189667,0.00016022185,0.00010819205,0.00017972392,0.00010812738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001268435,0.00073776214,0.001740388,0.00072858314,0.00066793995,0.0016297626,0.0023103226,0.0020629615,0.006237723],"category_scores_gemma":[0.005540876,0.0010868752,0.0010207901,0.0014547977,0.0013925484,0.002062665,0.001429934,0.00239314,0.00075319636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012256304,0.000012938844,0.000070877686,0.000021064841,0.000008029575,0.000014247355,0.00001049806,0.9652089,0.00019701244,0.029516028,0.00073716184,0.004191074],"study_design_scores_gemma":[0.0000010193183,0.0000014391263,0.000009126221,0.0000014316167,9.809105e-7,0.00000207957,0.0000014628575,0.99326974,0.000030283909,0.0065914853,0.00008922753,0.0000017033944],"about_ca_topic_score_codex":0.011270829,"about_ca_topic_score_gemma":0.008273597,"teacher_disagreement_score":0.011270829,"about_ca_system_score_codex":0.0019739885,"about_ca_system_score_gemma":0.0014522342,"threshold_uncertainty_score":0.022410452},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010763145,0.00038638004,0.9808942,0.00020333669,0.000106166386,0.000060449336,0.00023879329,0.0010448953,0.0063026436],"genre_scores_gemma":[0.2244111,0.00064797496,0.7546224,0.00040113664,0.00031305663,0.00042163208,0.0018646896,0.0015955019,0.01572264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839467,0.0008588123,0.00005168687,0.00020508732,0.0003599717,0.00012972571],"domain_scores_gemma":[0.9922123,0.0057097105,0.00016534684,0.0011428049,0.0005052,0.0002646414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026657346,0.0009325129,0.0018702886,0.0015799378,0.0011076459,0.0017497553,0.0029362275,0.0013587142,0.013611307],"category_scores_gemma":[0.014167511,0.0011378158,0.0012756372,0.0021944197,0.0016056532,0.0030471294,0.0026195503,0.0026887883,0.002601674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002322459,0.00015924919,0.0010734499,0.00019715859,0.00008599527,0.000116717114,0.00015583029,0.42628598,0.0011165476,0.4373421,0.012031094,0.12120363],"study_design_scores_gemma":[0.000015571111,0.000013451239,0.00006828067,0.000016349024,0.000005153798,0.000024457646,0.000011148789,0.84811044,0.00030103454,0.14980698,0.0016174865,0.000009505194],"about_ca_topic_score_codex":0.004353893,"about_ca_topic_score_gemma":0.010181511,"teacher_disagreement_score":0.013611307,"about_ca_system_score_codex":0.0011444063,"about_ca_system_score_gemma":0.0014294616,"threshold_uncertainty_score":0.045534372},"labels":[],"label_agreement":null}]}