{"meta":{"query_hash":"166d19718669","filters":{"venue":"Journal of Computational Geometry (Carleton University)"},"cohort_total":106,"direct_labels_cover":0,"predictions_cover":106,"exported":106,"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/166d19718669","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Computational+Geometry+%28Carleton+University%29"},"results":[{"id":"W1517258173","doi":"10.20382/jocg.v5i1a14","title":"Incidences with $k$-non-degenerate sets and their applications","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israeli Centers for Research Excellence; National Science Foundation","keywords":"Combinatorics; Mathematics; Degenerate energy levels; Upper and lower bounds; Plane (geometry); Polynomial; Degree (music); Space (punctuation); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis; Physics","score_opus":0.006298468167368431,"score_gpt":0.18590014177228512,"score_spread":0.1796016736049167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517258173","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.34865782,0.000854715,0.59521335,0.0011984125,0.00027264794,0.00019636616,0.00031563113,0.00045653974,0.05283452],"genre_scores_gemma":[0.83943903,0.0011902114,0.14431763,0.00036571067,0.0005257422,0.00024926412,0.0006589312,0.00028042257,0.012973071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962327,0.00070381473,0.00023136607,0.00067695754,0.0013637372,0.00079143146],"domain_scores_gemma":[0.99063385,0.0048940736,0.0012938086,0.0013652913,0.0008577542,0.00095529325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052198,0.0012923958,0.0016366459,0.0031163427,0.0029121577,0.0032540113,0.003729317,0.0014679576,0.008058873],"category_scores_gemma":[0.015209826,0.0013604182,0.0027846524,0.004189805,0.0045063,0.005762022,0.008831656,0.0066523524,0.00165555],"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.00016645386,0.00017645583,0.0030829578,0.00015708442,0.000040360315,0.0003444809,0.0008457901,0.020676121,0.0032561298,0.93642455,0.0021960072,0.03263353],"study_design_scores_gemma":[0.00004150272,0.0000923544,0.0013178837,0.0000599148,0.000049494647,0.00066610076,0.00038217532,0.13975827,0.004566904,0.8467404,0.0062672235,0.000057775163],"about_ca_topic_score_codex":0.0026085095,"about_ca_topic_score_gemma":0.0017586254,"teacher_disagreement_score":0.008058873,"about_ca_system_score_codex":0.0034856664,"about_ca_system_score_gemma":0.0009706712,"threshold_uncertainty_score":0.026959598},"labels":[],"label_agreement":null},{"id":"W1599115183","doi":"10.20382/jocg.v7i1a1","title":"Density of Range Capturing Hypergraphs","year":2014,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; General position; Vertex (graph theory); Regular polygon; Upper and lower bounds; Homothetic transformation; Convex hull; Element (criminal law); Integer (computer science); Discrete mathematics; Geometry; Graph; Mathematical analysis; Computer science","score_opus":0.011950627074551457,"score_gpt":0.20808191159341108,"score_spread":0.1961312845188596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599115183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62623507,0.00086882483,0.33688712,0.0009894171,0.000043879478,0.00022582232,0.001046326,0.0008619625,0.03284151],"genre_scores_gemma":[0.9403432,0.00069412333,0.046481267,0.00033529763,0.000094491596,0.00027048078,0.0013912334,0.00017771343,0.01021222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984358,0.00032255417,0.00007087872,0.00041169918,0.00047357127,0.00028537362],"domain_scores_gemma":[0.9942855,0.003185698,0.00079155905,0.00063102663,0.0005197329,0.0005864983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005980702,0.00058182876,0.00071560265,0.0017450824,0.0011600825,0.0023851197,0.0017221252,0.001078071,0.0077283126],"category_scores_gemma":[0.008794442,0.0009373044,0.0006791258,0.0015693202,0.0014099926,0.004129828,0.0026605495,0.0015047572,0.00089508365],"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.00037630397,0.0001732008,0.014426658,0.00030698674,0.00010817604,0.0010130322,0.0019154258,0.097263046,0.01617792,0.8032495,0.008183565,0.05680623],"study_design_scores_gemma":[0.00007855093,0.00014688533,0.00603771,0.00008795802,0.000085775886,0.0021487824,0.0009673293,0.6119701,0.009882359,0.35689178,0.011629329,0.00007345461],"about_ca_topic_score_codex":0.0034985093,"about_ca_topic_score_gemma":0.0026409382,"teacher_disagreement_score":0.0077283126,"about_ca_system_score_codex":0.0015719052,"about_ca_system_score_gemma":0.000531167,"threshold_uncertainty_score":0.025853753},"labels":[],"label_agreement":null},{"id":"W1706661728","doi":"10.20382/jocg.v2i1a5","title":"Good quality virtual realization of unit disk graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Realization (probability); Mathematics; Unit disk; Quality (philosophy); Unit (ring theory); Combinatorics; Statistics; Physics; Mathematics education","score_opus":0.01540619575692122,"score_gpt":0.24849300508462382,"score_spread":0.2330868093277026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1706661728","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.29345268,0.0002505044,0.69752234,0.00047218977,0.000032164557,0.00009662918,0.000370219,0.0007491429,0.0070541636],"genre_scores_gemma":[0.78625983,0.0001700658,0.20982203,0.0000630131,0.000019950068,0.00010751908,0.0007120091,0.00012683243,0.002718708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991326,0.0002745038,0.00004592475,0.00019411718,0.00020205812,0.00015082739],"domain_scores_gemma":[0.99861526,0.00056892727,0.00017001017,0.00039229577,0.00013706584,0.00011653657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591603,0.00058320037,0.0008040817,0.00047806822,0.000613893,0.0014755243,0.001086248,0.00084465084,0.0037621204],"category_scores_gemma":[0.0035019226,0.0004652796,0.0005967066,0.00066365843,0.00095587346,0.0023269365,0.0014006017,0.00093226513,0.0005849303],"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.0006519315,0.0001636637,0.0020214405,0.00024648107,0.000067608824,0.0004384515,0.00048572026,0.56987,0.02334653,0.30004174,0.004864255,0.09780219],"study_design_scores_gemma":[0.000066404,0.00020611107,0.00048188303,0.000018711486,0.000022795919,0.00021496027,0.00019681292,0.8128141,0.008083116,0.17286424,0.0050003766,0.00003055124],"about_ca_topic_score_codex":0.001230203,"about_ca_topic_score_gemma":0.0015521825,"teacher_disagreement_score":0.0037621204,"about_ca_system_score_codex":0.000826497,"about_ca_system_score_gemma":0.0005054477,"threshold_uncertainty_score":0.01258558},"labels":[],"label_agreement":null},{"id":"W1719651336","doi":"10.20382/jocg.v6i1a10","title":"Forcing subarrangements in complete arrangements of pseudocircles","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Forcing (mathematics); Mathematics; Mathematical analysis","score_opus":0.0376082411431994,"score_gpt":0.2785174577325209,"score_spread":0.24090921658932152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1719651336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8441804,0.00027105532,0.12463852,0.00040851315,0.00007593562,0.00006845108,0.00022441658,0.00017795783,0.02995481],"genre_scores_gemma":[0.9568097,0.00028546457,0.031713247,0.000106161155,0.00006558488,0.00015691099,0.0003975942,0.00008346459,0.01038194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974595,0.00041103878,0.00013176964,0.00058366265,0.0007626638,0.00065139757],"domain_scores_gemma":[0.99174047,0.0035610227,0.001559894,0.0014698958,0.0006377606,0.0010310195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151105,0.00074669434,0.0010461131,0.0013428964,0.0026339605,0.0026598196,0.0017607177,0.0013184187,0.011819896],"category_scores_gemma":[0.009111815,0.0008990455,0.0012302503,0.001298523,0.0034982485,0.0050940053,0.0046982183,0.0021409602,0.0012007899],"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.00037564323,0.000095969466,0.0029457635,0.0001202138,0.000046960533,0.00027964063,0.00067667064,0.030394215,0.0075817527,0.93538904,0.0013937738,0.020700283],"study_design_scores_gemma":[0.00009481703,0.00024119798,0.0028013645,0.000052902622,0.00004961781,0.0003842973,0.0007196201,0.06648697,0.01167944,0.9083939,0.009030703,0.000065239976],"about_ca_topic_score_codex":0.0011431648,"about_ca_topic_score_gemma":0.0017212033,"teacher_disagreement_score":0.011819896,"about_ca_system_score_codex":0.001059247,"about_ca_system_score_gemma":0.0005323305,"threshold_uncertainty_score":0.039541483},"labels":[],"label_agreement":null},{"id":"W1831059542","doi":"10.20382/jocg.v3i1a8","title":"Minimum area polyomino Venn diagrams","year":2012,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Venn diagram; Polyomino; Computer science; Diagram; Mathematics; Geometry; Mathematics education; Database","score_opus":0.037976730295315834,"score_gpt":0.2699739155014311,"score_spread":0.2319971852061153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831059542","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.14174768,0.0008738821,0.7032413,0.00038344125,0.00033890438,0.00014378854,0.0008539582,0.0010863842,0.15133075],"genre_scores_gemma":[0.6433478,0.00072989013,0.32138816,0.0002853756,0.00011917231,0.00029167483,0.0013236741,0.00049300725,0.032021295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990746,0.00024530734,0.000056906003,0.00019352182,0.0002662712,0.00016338404],"domain_scores_gemma":[0.99883217,0.00038672137,0.00013352903,0.00021321322,0.0002928072,0.00014164578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004207761,0.00035420395,0.00043882214,0.0010521755,0.000969593,0.0014961852,0.00075341243,0.00047528764,0.008440094],"category_scores_gemma":[0.0023562596,0.00030880643,0.00043812033,0.00091261935,0.0010548211,0.0023125284,0.0017124392,0.0009477689,0.0016696515],"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.00012597317,0.000031295895,0.0009190602,0.00016270437,0.000013443236,0.00018556027,0.000276718,0.0061139287,0.008481529,0.9086583,0.0051262863,0.06990513],"study_design_scores_gemma":[0.000048887636,0.00007063707,0.0011312651,0.00010865515,0.000030998093,0.0006466108,0.00022287232,0.024634877,0.013660062,0.82025206,0.13914211,0.000050932635],"about_ca_topic_score_codex":0.0007916009,"about_ca_topic_score_gemma":0.0014858237,"teacher_disagreement_score":0.008440094,"about_ca_system_score_codex":0.0005859726,"about_ca_system_score_gemma":0.00045487387,"threshold_uncertainty_score":0.028234959},"labels":[],"label_agreement":null},{"id":"W1855377430","doi":"10.20382/jocg.v2i1a1","title":"Connected rectilinear graphs on point sets","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Orientation (vector space); Vertex (graph theory); Graph; Perpendicular; Pairwise comparison; Point (geometry); Line segment; Geometry","score_opus":0.009102678068484239,"score_gpt":0.21809906452068029,"score_spread":0.20899638645219604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855377430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5090694,0.0015219606,0.45278257,0.0014451257,0.00010705006,0.0002460629,0.0024086277,0.0007211736,0.03169808],"genre_scores_gemma":[0.73421717,0.0017243607,0.24354358,0.00031929603,0.00008252426,0.00027778462,0.0041337027,0.00020239869,0.015499194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929905,0.00018390508,0.00004271126,0.00019478805,0.00016980435,0.000109669476],"domain_scores_gemma":[0.9979874,0.001091363,0.00038562436,0.00021559032,0.00017594105,0.00014414814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003889867,0.00061942055,0.000627325,0.0013904043,0.0006529929,0.0012640251,0.0009872731,0.00087060465,0.005657987],"category_scores_gemma":[0.0037617774,0.0006677254,0.00051232136,0.002216396,0.0009469512,0.002062238,0.0016070503,0.0008765566,0.000773623],"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.00050404714,0.00010286294,0.0042925645,0.00037677353,0.00008418856,0.0012278188,0.00077306555,0.34274393,0.011560435,0.5532786,0.009248951,0.07580667],"study_design_scores_gemma":[0.00010898445,0.0000794879,0.002906093,0.00009990471,0.000033619533,0.0005124513,0.00042853813,0.47403446,0.0030599032,0.49752897,0.021172147,0.000035419274],"about_ca_topic_score_codex":0.0030066434,"about_ca_topic_score_gemma":0.0035522373,"teacher_disagreement_score":0.005657987,"about_ca_system_score_codex":0.00095811195,"about_ca_system_score_gemma":0.0003161875,"threshold_uncertainty_score":0.018927872},"labels":[],"label_agreement":null},{"id":"W1857045085","doi":"10.20382/jocg.v3i1a1","title":"The emergence of sparse spanners and well-separated pair decomposition under anarchy","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spanner; Euclidean geometry; Combinatorics; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Mathematics; Constant (computer programming); Euclidean distance; Graph; Network topology; Computer science; Discrete mathematics; Theoretical computer science; Algorithm; Computer network; Distributed computing; Artificial intelligence; Geometry","score_opus":0.02514194668334845,"score_gpt":0.26345494322076585,"score_spread":0.2383129965374174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857045085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5230101,0.00033419355,0.46233353,0.00047928205,0.000048079943,0.00007237464,0.0001529412,0.00024406929,0.013325474],"genre_scores_gemma":[0.8812432,0.0002834989,0.11017506,0.00013472357,0.000080537844,0.0001209511,0.00031629123,0.000090050795,0.007555624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990207,0.00027893184,0.00004439007,0.00024177876,0.0002599611,0.00015416188],"domain_scores_gemma":[0.9964947,0.001274356,0.00065120426,0.0005400316,0.0003909091,0.00064872234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079975545,0.00040796338,0.0006113336,0.0010708552,0.0009687814,0.001395582,0.00067974534,0.0009221138,0.0024627575],"category_scores_gemma":[0.004322383,0.00053425704,0.00067652954,0.00069661264,0.0021399069,0.0033938452,0.0021736843,0.0015617127,0.00058130966],"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.00016181199,0.000057999707,0.0015742292,0.000086224536,0.000031181797,0.00035192023,0.0007022672,0.035987236,0.012196442,0.9274536,0.0016415206,0.019755589],"study_design_scores_gemma":[0.000048520855,0.00013917568,0.00096911733,0.000022171607,0.000017288932,0.0005279454,0.00033016672,0.1295165,0.004085383,0.8595425,0.004771789,0.000029486444],"about_ca_topic_score_codex":0.0004920383,"about_ca_topic_score_gemma":0.00058267475,"teacher_disagreement_score":0.0024627575,"about_ca_system_score_codex":0.00053713506,"about_ca_system_score_gemma":0.00031043848,"threshold_uncertainty_score":0.008238673},"labels":[],"label_agreement":null},{"id":"W1922419250","doi":"10.20382/jocg.v6i1a5","title":"On characterizing terrain visibility graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Terrain; Visibility graph; Visibility; Vertex (graph theory); Combinatorics; Graph; Mathematics; Monotone polygon; Geometry; Geography; Regular polygon; Cartography","score_opus":0.009044944806347294,"score_gpt":0.2073174917531666,"score_spread":0.1982725469468193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922419250","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.1190754,0.0008615629,0.85344297,0.000949065,0.000087127526,0.00026610092,0.00095380546,0.0003736191,0.023990363],"genre_scores_gemma":[0.650826,0.0020881963,0.3327371,0.0006112617,0.0003726095,0.00042570068,0.0037528258,0.0005046751,0.008681614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980823,0.0003965822,0.00013589134,0.000540599,0.0005322464,0.00031251804],"domain_scores_gemma":[0.99366885,0.002665961,0.0011390507,0.0011821436,0.0009905148,0.0003534965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417744,0.0010663916,0.00072054926,0.0024846392,0.0021206916,0.003079119,0.0015341458,0.0017523776,0.0043361993],"category_scores_gemma":[0.0088700345,0.0007848761,0.0013254219,0.004401943,0.0036576025,0.0075761657,0.002593276,0.002191055,0.000850894],"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.00006998379,0.00008781919,0.005161647,0.0003131563,0.000040241233,0.0006131461,0.0014400679,0.039979495,0.009579943,0.90115696,0.0030797995,0.038477737],"study_design_scores_gemma":[0.000021511718,0.00007441823,0.0020665375,0.000104944724,0.000045615114,0.00084378914,0.00092581566,0.05558443,0.005098196,0.91001755,0.025174934,0.00004237369],"about_ca_topic_score_codex":0.004793813,"about_ca_topic_score_gemma":0.004312951,"teacher_disagreement_score":0.004793813,"about_ca_system_score_codex":0.001618552,"about_ca_system_score_gemma":0.0008360652,"threshold_uncertainty_score":0.014506042},"labels":[],"label_agreement":null},{"id":"W1932504660","doi":"10.20382/jocg.v5i1a6","title":"Partial covering of a circle by equal circles. Part I: The mechanical models","year":2012,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Magyar Tudományos Akadémia; Hungarian Scientific Research Fund","keywords":"Tensegrity; Mathematics; Cover (algebra); Stiffness; Unit circle; RADIUS; Relaxation (psychology); Stability (learning theory); Combinatorics; Geometry; Computer science; Structural engineering; Engineering; Mechanical engineering","score_opus":0.011002743138707307,"score_gpt":0.18125113418905628,"score_spread":0.17024839105034897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1932504660","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.11764137,0.0017085832,0.83485514,0.00068393856,0.000111281886,0.00006891006,0.00020525673,0.00014127484,0.044584263],"genre_scores_gemma":[0.8969,0.0011224637,0.085307784,0.00013687376,0.00009126675,0.00016881531,0.00021296139,0.00006514906,0.015994664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961793,0.00013025243,0.000013930796,0.000095788295,0.00009935153,0.000042717846],"domain_scores_gemma":[0.9995365,0.00013812716,0.00010390897,0.00011403975,0.00005470372,0.00005276759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003665805,0.00051947345,0.00043373424,0.0005220036,0.00052858517,0.0009015021,0.00094680686,0.0008019838,0.0036400522],"category_scores_gemma":[0.0014775596,0.0003624323,0.00058365136,0.0005639247,0.001719477,0.001552614,0.0011396728,0.00045124374,0.00052721705],"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.00006119713,0.000014864663,0.00036825097,0.00012667444,0.000017587734,0.00016269617,0.00017560959,0.38990465,0.005580207,0.58345515,0.0023637866,0.017769337],"study_design_scores_gemma":[0.000020134867,0.00012518564,0.00056347996,0.000039592604,0.000023504597,0.00042873406,0.00016397913,0.72785854,0.003913516,0.2442653,0.02256328,0.00003486725],"about_ca_topic_score_codex":0.0014216589,"about_ca_topic_score_gemma":0.0010579535,"teacher_disagreement_score":0.0036400522,"about_ca_system_score_codex":0.00069046125,"about_ca_system_score_gemma":0.00035251875,"threshold_uncertainty_score":0.012177229},"labels":[],"label_agreement":null},{"id":"W2096242358","doi":"10.20382/jocg.v6i1a12","title":"The Lebesgue universal covering problem","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Covering space; Lebesgue integration; Regular polygon; Combinatorics; Reduction (mathematics); Pure mathematics; Geometry","score_opus":0.050838057682007484,"score_gpt":0.2701838847343962,"score_spread":0.2193458270523887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096242358","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.35098085,0.010095505,0.47124147,0.011831158,0.00047973948,0.00013177753,0.0020976164,0.00061448506,0.15252745],"genre_scores_gemma":[0.925607,0.004314306,0.04454325,0.00074316567,0.00070244115,0.00020508359,0.0017140353,0.0001828081,0.021987934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986749,0.00033196204,0.000058244957,0.00028790443,0.0003278231,0.00031912638],"domain_scores_gemma":[0.9977596,0.0014637623,0.00012711785,0.00025735438,0.00017756985,0.00021459618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014522728,0.00066331826,0.0013675166,0.001205062,0.001747641,0.002815882,0.0012751318,0.0019556521,0.00926214],"category_scores_gemma":[0.006300264,0.00047383853,0.001250858,0.0013444211,0.0026427086,0.0047480427,0.003235897,0.001977743,0.001107495],"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.000070155605,0.000021705851,0.00046330088,0.000095989155,0.000035045956,0.00013037093,0.00019914203,0.008470222,0.00051177735,0.96709836,0.0060947137,0.016809238],"study_design_scores_gemma":[0.000026100932,0.000023607025,0.00048280513,0.000029737897,0.000014237815,0.00015242473,0.00013854507,0.030202983,0.0005967371,0.95356786,0.014750368,0.000014546932],"about_ca_topic_score_codex":0.0017724617,"about_ca_topic_score_gemma":0.0006420825,"teacher_disagreement_score":0.00926214,"about_ca_system_score_codex":0.0018663432,"about_ca_system_score_gemma":0.00066675985,"threshold_uncertainty_score":0.030984938},"labels":[],"label_agreement":null},{"id":"W2102170762","doi":"10.20382/jocg.v2i1a3","title":"Delaunay triangulation of imprecise points, preprocess and actually get a fast query time","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Delaunay triangulation; Computer science; Constrained Delaunay triangulation; Triangulation; Bowyer–Watson algorithm; Pitteway triangulation; Point set triangulation; Artificial intelligence; Algorithm; Mathematics; Geometry","score_opus":0.0047364920417147,"score_gpt":0.1985808638164776,"score_spread":0.1938443717747629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102170762","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.015105638,0.00027943592,0.9816828,0.00012906398,0.000059040958,0.00008320125,0.000100871686,0.0017377133,0.0008222365],"genre_scores_gemma":[0.07447015,0.000247753,0.9226873,0.000082952116,0.00005804936,0.00012517431,0.00042630982,0.00039332762,0.0015089483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824464,0.00022412592,0.0001404958,0.00038824056,0.0008666462,0.00013576007],"domain_scores_gemma":[0.9969694,0.0008684515,0.00024118133,0.0012066297,0.00062281935,0.000091692826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079622486,0.0011322907,0.0018094382,0.0014632333,0.0009186495,0.0017387411,0.0018376347,0.0011896794,0.007105445],"category_scores_gemma":[0.0058335,0.0009935478,0.00095577876,0.002215229,0.0008897125,0.003517248,0.0025571417,0.0012774257,0.0043440377],"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.0005951506,0.00011764641,0.0019364757,0.0005241935,0.00010207426,0.00048127913,0.0006871937,0.076829314,0.08948958,0.0133147845,0.010696893,0.80522543],"study_design_scores_gemma":[0.00022393832,0.0005896192,0.0031199364,0.00011041793,0.00012521696,0.0021534818,0.0008613249,0.74828476,0.14476703,0.043543328,0.05602371,0.00019725655],"about_ca_topic_score_codex":0.0033978166,"about_ca_topic_score_gemma":0.0036277147,"teacher_disagreement_score":0.007105445,"about_ca_system_score_codex":0.00059126125,"about_ca_system_score_gemma":0.000906783,"threshold_uncertainty_score":0.023770094},"labels":[],"label_agreement":null},{"id":"W2105256528","doi":"10.20382/jocg.v6i1a8","title":"Quasi-parallel segments and characterization of unique bichromatic matchings","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matching (statistics); Combinatorics; Characterization (materials science); Plane (geometry); Point (geometry); Set (abstract data type); Property (philosophy); Mathematics; Line segment; Line (geometry); General position; Position (finance); Algorithm; Computer science; Geometry; Physics; Optics","score_opus":0.00647455589633572,"score_gpt":0.18985622678958583,"score_spread":0.1833816708932501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105256528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7440307,0.00021259185,0.240655,0.0001228809,0.000019864168,0.00010028356,0.0006240511,0.00043095718,0.013803581],"genre_scores_gemma":[0.906283,0.0000992748,0.09027557,0.000038299335,0.000013702804,0.0000548361,0.0008994998,0.00006413619,0.0022716247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991805,0.000097036354,0.00007594399,0.00024905326,0.00027431393,0.00012309388],"domain_scores_gemma":[0.9980677,0.00049489265,0.00061611633,0.0003970752,0.0002698861,0.00015449646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046496105,0.00031448863,0.0005474855,0.0015809617,0.00066273217,0.0012636182,0.0008199262,0.0006735374,0.004982608],"category_scores_gemma":[0.0038225455,0.00042676282,0.00033216443,0.0017234071,0.00078572996,0.0017896718,0.0013847497,0.0005616211,0.0005879634],"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.0016582493,0.00029857812,0.026928125,0.0004989082,0.00011982427,0.0010592194,0.0013613973,0.062052667,0.15908632,0.5065596,0.004231507,0.2361456],"study_design_scores_gemma":[0.00015302135,0.0007409318,0.022353813,0.00014308363,0.00009775823,0.0034990276,0.0013649211,0.4038867,0.13197005,0.4147046,0.020962413,0.00012363681],"about_ca_topic_score_codex":0.0006571972,"about_ca_topic_score_gemma":0.0005793897,"teacher_disagreement_score":0.004982608,"about_ca_system_score_codex":0.0005277432,"about_ca_system_score_gemma":0.0002950426,"threshold_uncertainty_score":0.016668499},"labels":[],"label_agreement":null},{"id":"W2150278422","doi":"10.20382/jocg.v3i1a5","title":"Colouring the triangles determined by a point set","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Australian Government","keywords":"Mathematics; Set (abstract data type); Combinatorics; Point (geometry); Geometry; Computer science","score_opus":0.02403805481280369,"score_gpt":0.20679438843507247,"score_spread":0.18275633362226879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150278422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7332304,0.0002165977,0.22487879,0.00040585667,0.000098604825,0.00010136996,0.00042252027,0.00026192982,0.040383898],"genre_scores_gemma":[0.8818143,0.00028839355,0.10615853,0.00009966795,0.000043332835,0.00008384147,0.00077649654,0.00020173764,0.010533713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992446,0.0001387672,0.000024397978,0.00015319911,0.00022767163,0.0002114176],"domain_scores_gemma":[0.9982912,0.0006745855,0.000212933,0.00035311305,0.00029824817,0.00016993296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005214334,0.00044842798,0.00046451643,0.0010880642,0.001413373,0.0016401417,0.0012939718,0.00081518653,0.0074628685],"category_scores_gemma":[0.0031261218,0.0005191977,0.0005724383,0.0012672191,0.001785501,0.0020479087,0.001907928,0.0012509277,0.00076283346],"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.0014873846,0.000174622,0.015801998,0.00030126818,0.00010439504,0.000987027,0.0021296851,0.12557714,0.10625392,0.64661133,0.0076188915,0.09295231],"study_design_scores_gemma":[0.00016289004,0.00038396617,0.010831855,0.00009568801,0.000077238394,0.0011398593,0.0015396556,0.3655807,0.0489927,0.544037,0.027047724,0.00011072356],"about_ca_topic_score_codex":0.006788086,"about_ca_topic_score_gemma":0.006521893,"teacher_disagreement_score":0.0074628685,"about_ca_system_score_codex":0.0013490424,"about_ca_system_score_gemma":0.00057282305,"threshold_uncertainty_score":0.024965763},"labels":[],"label_agreement":null},{"id":"W2197147576","doi":"10.20382/jocg.v7i1a10","title":"Recursively-Regular Subdivisions and Applications","year":2013,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst","keywords":"Subdivision; Mathematics; Embedding; Combinatorics; Projection (relational algebra); Cone (formal languages); Polyhedron; Class (philosophy); Graph; Tree (set theory); Discrete mathematics; Computer science; Algorithm","score_opus":0.011312073626481756,"score_gpt":0.21660931250940735,"score_spread":0.2052972388829256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197147576","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.08903083,0.0013068656,0.8563355,0.0004950068,0.00010806897,0.00008926772,0.00014505192,0.00054424745,0.051945113],"genre_scores_gemma":[0.71332955,0.001554231,0.26441374,0.00020411861,0.00015910665,0.000119065066,0.00037998706,0.00036314892,0.019477045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.000118349344,0.000038356724,0.0001640608,0.00023022685,0.00007969527],"domain_scores_gemma":[0.9988753,0.0004415736,0.0000874535,0.00032056222,0.00016388105,0.00011132571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049635593,0.00051221513,0.00057999743,0.0009373794,0.00080361863,0.0015419973,0.00094971637,0.0006683589,0.0061457967],"category_scores_gemma":[0.0029647495,0.0004121391,0.00077343575,0.0008958238,0.0027883733,0.0024011654,0.0027148938,0.0019095823,0.00095268135],"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.000017406966,0.000017216922,0.0003277195,0.000043611875,0.000003510067,0.00007199625,0.00019291154,0.018905107,0.0018321169,0.94879043,0.0007671863,0.029030787],"study_design_scores_gemma":[0.000011425052,0.00003800496,0.00025162267,0.000035055913,0.0000067729684,0.00020209872,0.00011341025,0.08618142,0.002565499,0.8883704,0.022209086,0.000015154034],"about_ca_topic_score_codex":0.0018284094,"about_ca_topic_score_gemma":0.0018160613,"teacher_disagreement_score":0.0061457967,"about_ca_system_score_codex":0.0010534553,"about_ca_system_score_gemma":0.00036402448,"threshold_uncertainty_score":0.020559788},"labels":[],"label_agreement":null},{"id":"W2227225096","doi":"10.20382/jocg.v13i1a2","title":"A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons","year":2015,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Beacon; Routing (electronic design automation); Robot; Computer science; Combinatorics; Obstacle; Electric beacon; Set (abstract data type); Mathematics; Computer network; Geography; Real-time computing; Artificial intelligence","score_opus":0.025251074845990165,"score_gpt":0.25554177658106697,"score_spread":0.23029070173507682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227225096","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.04602044,0.0017237775,0.81347495,0.002648212,0.0005224056,0.00019711931,0.00094750186,0.0009458632,0.13351966],"genre_scores_gemma":[0.54589117,0.0043808524,0.382245,0.001879005,0.001450537,0.0010826217,0.002920081,0.0010867149,0.059063993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840385,0.00035765328,0.00009309287,0.0003315066,0.0005216368,0.00029227356],"domain_scores_gemma":[0.9946209,0.0036307229,0.00047369904,0.00042336414,0.0004271502,0.0004241091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010936117,0.0015271425,0.0011300558,0.0020483658,0.0017234054,0.0051227156,0.002331138,0.0013242624,0.017249485],"category_scores_gemma":[0.00930919,0.000836431,0.0016509993,0.0029219908,0.002764025,0.006696212,0.004019543,0.0040955273,0.0030877215],"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.00010681959,0.00006544264,0.000689588,0.00028576265,0.000024539468,0.00017065163,0.0002301192,0.04940468,0.0013202396,0.8963395,0.01260184,0.03876092],"study_design_scores_gemma":[0.00003505376,0.000074408934,0.00038335216,0.00009390423,0.00003508426,0.00028587558,0.00015155323,0.17052917,0.00089854555,0.80245453,0.025017384,0.00004109675],"about_ca_topic_score_codex":0.0023677025,"about_ca_topic_score_gemma":0.002321461,"teacher_disagreement_score":0.017249485,"about_ca_system_score_codex":0.0021620544,"about_ca_system_score_gemma":0.0007934202,"threshold_uncertainty_score":0.057705283},"labels":[],"label_agreement":null},{"id":"W2235983888","doi":"10.20382/jocg.v7i2a6","title":"Smoothed complexity of convex hulls by witnesses and collectors","year":2016,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut Universitaire de France; Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Convex hull; Hull; Combinatorics; Mathematics; Simple (philosophy); Regular polygon; Euclidean geometry; Point (geometry); Convex body; Gaussian; Convex polytope; Convex set; Geometry; Convex optimization; Physics; Engineering","score_opus":0.020225246466812365,"score_gpt":0.22677454725590304,"score_spread":0.20654930078909067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235983888","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.47071907,0.00045076336,0.52118886,0.00091520126,0.00006154712,0.0001044144,0.000972756,0.0007049771,0.004882325],"genre_scores_gemma":[0.93117726,0.0004501691,0.062823825,0.00011792935,0.00013273663,0.00021736704,0.0011379307,0.00025800572,0.003684832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972811,0.0004747137,0.00017060302,0.0006207782,0.0010411396,0.00041164193],"domain_scores_gemma":[0.9664656,0.022182971,0.0032350316,0.0049576815,0.0015449428,0.0016138094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002859824,0.00072924164,0.0015103631,0.002812078,0.0012900935,0.004359883,0.002836476,0.0015724383,0.0056750854],"category_scores_gemma":[0.033065658,0.001199785,0.0017140695,0.0018735372,0.0035855987,0.010088444,0.0045260526,0.0026025886,0.00043950407],"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.0006027321,0.00008510028,0.010036152,0.00031533596,0.0001277872,0.00044496584,0.0011142881,0.22753248,0.011187598,0.7206874,0.0028992752,0.02496684],"study_design_scores_gemma":[0.00003301511,0.00006023475,0.0018073209,0.000035143465,0.00004232833,0.00022841686,0.00021786931,0.479209,0.0044352715,0.51259905,0.0012895219,0.000042792213],"about_ca_topic_score_codex":0.0016305519,"about_ca_topic_score_gemma":0.0011945894,"teacher_disagreement_score":0.0056750854,"about_ca_system_score_codex":0.0022457594,"about_ca_system_score_gemma":0.0010823393,"threshold_uncertainty_score":0.018985033},"labels":[],"label_agreement":null},{"id":"W2252238546","doi":"10.20382/jocg.v6i1a14","title":"A new algorithm for computing visibility graphs of polygonal obstacles in the plane","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Visibility; Visibility graph; Computer science; Plane (geometry); Algorithm; Planar graph; Mathematics; Graph; Theoretical computer science; Geometry; Physics; Regular polygon; Optics","score_opus":0.025050121115095053,"score_gpt":0.24938825684958482,"score_spread":0.22433813573448977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252238546","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.010851841,0.00009814954,0.9854996,0.00009489357,0.00004062953,0.000083131374,0.0001674148,0.001798733,0.0013655842],"genre_scores_gemma":[0.083198845,0.0001308448,0.9138885,0.000047613266,0.000029064633,0.00013513221,0.00086579646,0.00026113627,0.0014431442],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993449,0.000076845754,0.00005647046,0.00019410028,0.0002279987,0.000099717225],"domain_scores_gemma":[0.9990262,0.00035270976,0.00009255371,0.00024180753,0.00022747865,0.000059274385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039909515,0.0010334728,0.00088435225,0.0017247078,0.000764205,0.0011807386,0.0020088628,0.00090860954,0.004142713],"category_scores_gemma":[0.0031960038,0.0007478794,0.0013800681,0.0017980343,0.000775042,0.003297927,0.0026895225,0.0015153872,0.0008701962],"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.00047172306,0.0001887975,0.002485027,0.0003873915,0.00017427291,0.00031684275,0.00039114227,0.21617328,0.02404537,0.05569896,0.011474672,0.68819255],"study_design_scores_gemma":[0.00017451483,0.00015321713,0.00088600256,0.000039318915,0.00007431423,0.00029049476,0.00012801198,0.9164148,0.012425854,0.05545376,0.013894541,0.00006525554],"about_ca_topic_score_codex":0.006491593,"about_ca_topic_score_gemma":0.0099097015,"teacher_disagreement_score":0.006491593,"about_ca_system_score_codex":0.00080775673,"about_ca_system_score_gemma":0.0014345865,"threshold_uncertainty_score":0.013858736},"labels":[],"label_agreement":null},{"id":"W2256871140","doi":"10.20382/jocg.v7i2a4","title":"Approximability of the discrete Fréchet distance","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Eidgenössische Technische Hochschule Zürich; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Measure (data warehouse); Approximation algorithm; Binary logarithm; Discrete mathematics; Simple (philosophy); Mathematical analysis","score_opus":0.016834781048207712,"score_gpt":0.21770333013737017,"score_spread":0.20086854908916246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256871140","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.115177676,0.0012704498,0.8690884,0.0015841393,0.00016366706,0.00007588155,0.0003780083,0.0012628462,0.010998843],"genre_scores_gemma":[0.7302208,0.0008935719,0.2557303,0.00065987086,0.0002718455,0.00026360533,0.0010339367,0.00046671653,0.010459399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646413,0.00066287426,0.00020657395,0.0010431858,0.0011654439,0.000457726],"domain_scores_gemma":[0.98716146,0.009166335,0.0006109619,0.0018455128,0.00084472465,0.00037096458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026794523,0.001457614,0.0016799187,0.0014487995,0.0009807238,0.0029698166,0.0027581025,0.0020844936,0.005011925],"category_scores_gemma":[0.026556255,0.0006592727,0.0018317638,0.0012834185,0.0027401848,0.0072466405,0.0031971298,0.005221624,0.0014471676],"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.0013579793,0.0002103916,0.006439144,0.00064696005,0.00012948927,0.0002733996,0.00079092506,0.41273257,0.011330566,0.457841,0.008343277,0.099904284],"study_design_scores_gemma":[0.000028976687,0.00009586846,0.0006443002,0.000048744725,0.000023713545,0.00013876044,0.00005908854,0.81279856,0.0024580462,0.18094248,0.0027338671,0.000027572172],"about_ca_topic_score_codex":0.0040973853,"about_ca_topic_score_gemma":0.0027502875,"teacher_disagreement_score":0.005011925,"about_ca_system_score_codex":0.0036581252,"about_ca_system_score_gemma":0.0016865901,"threshold_uncertainty_score":0.02654171},"labels":[],"label_agreement":null},{"id":"W2261811080","doi":"10.20382/jocg.v7i1a13","title":"The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Discretization; Terrain; Mathematics; Mathematical optimization; Geography; Mathematical analysis; Cartography","score_opus":0.018817839104994145,"score_gpt":0.21448614739666144,"score_spread":0.1956683082916673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261811080","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.07490221,0.00079561427,0.91204554,0.0016152012,0.00009624707,0.00019586505,0.0010050253,0.00074350537,0.008600788],"genre_scores_gemma":[0.47121742,0.000600629,0.5229633,0.0003190589,0.00007668214,0.00033652122,0.0014021894,0.00014846973,0.002935731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991923,0.0001985515,0.000047308313,0.00023435077,0.0001873948,0.00014013448],"domain_scores_gemma":[0.997663,0.0016953136,0.00017474263,0.00023712926,0.000103601415,0.00012627718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009862286,0.00089585077,0.0011316867,0.0005005882,0.0005597555,0.001340759,0.0015785106,0.0017332871,0.0040722084],"category_scores_gemma":[0.005178499,0.0005790642,0.0009682687,0.0010704201,0.0012941381,0.0026161578,0.0015149234,0.002173584,0.00034274752],"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.00016811247,0.000099332705,0.0010338561,0.00022681196,0.000022892671,0.00010795695,0.00011329155,0.92954475,0.0016623782,0.030459693,0.0036830194,0.032877855],"study_design_scores_gemma":[0.000038539612,0.00003753417,0.00013771049,0.000019168094,0.000007771206,0.00005296125,0.00006128211,0.97083664,0.00061174703,0.0270525,0.0011375297,0.000006650077],"about_ca_topic_score_codex":0.005266465,"about_ca_topic_score_gemma":0.0056693465,"teacher_disagreement_score":0.005266465,"about_ca_system_score_codex":0.0014564007,"about_ca_system_score_gemma":0.0015182955,"threshold_uncertainty_score":0.01362294},"labels":[],"label_agreement":null},{"id":"W2293635260","doi":"10.20382/jocg.v2i1a7","title":"Points with large quadrant depth","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadrant (abdomen); Mathematics; Geodesy; Geography; Medicine; Surgery","score_opus":0.018319679801177376,"score_gpt":0.2011631225846567,"score_spread":0.18284344278347933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293635260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87555075,0.0011166454,0.10450481,0.0007981724,0.000054024815,0.000054298627,0.0005944685,0.00022549123,0.017101308],"genre_scores_gemma":[0.9705245,0.00029884448,0.024629796,0.00010389868,0.000031519667,0.00005245121,0.0005698368,0.00006310265,0.0037261166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985966,0.00026314027,0.00009518265,0.0002502585,0.00036675314,0.00042796368],"domain_scores_gemma":[0.9973103,0.001083747,0.0004756521,0.00047416473,0.00033084612,0.00032529992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016117156,0.00063409406,0.0013087502,0.0017570835,0.0010772183,0.002541435,0.0010375442,0.0014917623,0.005868542],"category_scores_gemma":[0.00794163,0.00076516025,0.000700135,0.0019036097,0.00205597,0.003327559,0.00479615,0.0012721634,0.0007804757],"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.0018044797,0.000184787,0.038449228,0.00072271447,0.00013242301,0.0026894212,0.0016531651,0.14974551,0.033965904,0.63179564,0.006655153,0.13220157],"study_design_scores_gemma":[0.00026906576,0.00041377498,0.017610153,0.0003503026,0.00010780304,0.0028667902,0.0021957962,0.22090878,0.016058238,0.7176344,0.021429144,0.00015574782],"about_ca_topic_score_codex":0.0009595504,"about_ca_topic_score_gemma":0.00090569584,"teacher_disagreement_score":0.005868542,"about_ca_system_score_codex":0.0009368218,"about_ca_system_score_gemma":0.00043524618,"threshold_uncertainty_score":0.01963228},"labels":[],"label_agreement":null},{"id":"W2295197591","doi":"10.20382/jocg.v6i2a2","title":"Finding the largest disk containing a query point in logarithmic time with linear storage","year":2014,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israeli Centers for Research Excellence; Tel Aviv University","keywords":"Logarithm; Point (geometry); Computer science; Mathematics; Geometry; Mathematical analysis","score_opus":0.0075280229826029995,"score_gpt":0.19768910673146448,"score_spread":0.19016108374886148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295197591","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.32880205,0.003755467,0.5951257,0.0076302104,0.00036827172,0.0007319224,0.008907907,0.022669682,0.032008708],"genre_scores_gemma":[0.58324564,0.00084272417,0.39727464,0.0004442884,0.00025579776,0.00034615144,0.0078806365,0.00084924954,0.008860852],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979873,0.0002069872,0.00018391537,0.0005711237,0.0007335926,0.00031707497],"domain_scores_gemma":[0.9912259,0.0038797061,0.00083993125,0.0030627367,0.0006071058,0.00038457458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083626603,0.0012979117,0.0018259196,0.0017009897,0.0013923025,0.00345133,0.0038661538,0.0019587863,0.013469835],"category_scores_gemma":[0.008688425,0.0007681092,0.0014245762,0.004585313,0.0012920506,0.00831189,0.0034672685,0.0014741613,0.0051535885],"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.00670724,0.0012230983,0.015953273,0.0023530684,0.00035153996,0.00073353486,0.0010212723,0.13282365,0.08989025,0.03153685,0.07827648,0.6391298],"study_design_scores_gemma":[0.002631838,0.0010404224,0.008371202,0.00022572969,0.00040341783,0.0015624264,0.0014135857,0.7402392,0.0848251,0.128422,0.030674685,0.00019044492],"about_ca_topic_score_codex":0.0056439503,"about_ca_topic_score_gemma":0.010533374,"teacher_disagreement_score":0.013469835,"about_ca_system_score_codex":0.0021220804,"about_ca_system_score_gemma":0.0038092483,"threshold_uncertainty_score":0.04506111},"labels":[],"label_agreement":null},{"id":"W2295922106","doi":"10.20382/jocg.v6i1a2","title":"The maximum number of faces of the Minkowski sum of three convex polytopes","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"FP7 Research Potential of Convergence Regions; European Social Fund; European Commission","keywords":"Polytope; Minkowski addition; Combinatorics; Regular polygon; Minkowski space; Mathematics; Geometry","score_opus":0.02474012601281481,"score_gpt":0.2525215576842991,"score_spread":0.22778143167148432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295922106","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.27568373,0.0019958413,0.6387482,0.0008752456,0.00034503732,0.00009623328,0.00081128255,0.00037623316,0.08106824],"genre_scores_gemma":[0.82640076,0.0017259324,0.1572936,0.00025919333,0.00028485776,0.0004161902,0.0007250653,0.00042606526,0.012468339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880385,0.00023431797,0.00008289261,0.0002345856,0.00038574482,0.00025857802],"domain_scores_gemma":[0.9977913,0.001115292,0.0002608665,0.00026795437,0.0002926857,0.0002718539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001084198,0.0015781989,0.0010368313,0.0019416728,0.0010936997,0.0026954366,0.0023805879,0.00069912756,0.007522857],"category_scores_gemma":[0.005997026,0.00071661366,0.0013058722,0.0010665699,0.0022849492,0.0050993776,0.0023261362,0.0024202506,0.0013090644],"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.0002146043,0.000057707217,0.0022273029,0.00030673045,0.000053388478,0.00037770355,0.00034278072,0.09483386,0.008960067,0.84923935,0.0039713955,0.039415088],"study_design_scores_gemma":[0.000018267143,0.000061908904,0.0021695253,0.00012670737,0.000045122277,0.0005064651,0.00029478458,0.39571008,0.013329365,0.57805705,0.00956508,0.00011577109],"about_ca_topic_score_codex":0.0011486012,"about_ca_topic_score_gemma":0.0013926625,"teacher_disagreement_score":0.007522857,"about_ca_system_score_codex":0.0016182084,"about_ca_system_score_gemma":0.0006248564,"threshold_uncertainty_score":0.025166452},"labels":[],"label_agreement":null},{"id":"W2296706642","doi":"10.20382/jocg.v5i1a4","title":"Hyperbolic Delaunay complexes and Voronoi diagrams made practical","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Voronoi diagram; Delaunay triangulation; Bowyer–Watson algorithm; Computer science; Geology; Geometry; Mathematics; Algorithm","score_opus":0.02859963742090648,"score_gpt":0.26730071844677533,"score_spread":0.23870108102586884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296706642","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.19171986,0.0020830191,0.7082026,0.0014575528,0.0003106963,0.00009911405,0.0003349147,0.00024206907,0.09555016],"genre_scores_gemma":[0.84917676,0.001256797,0.12639458,0.00013131248,0.00018473684,0.000080342084,0.00034348518,0.00015405224,0.022277849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889463,0.000258108,0.000044595767,0.00021406478,0.00044344043,0.00014509108],"domain_scores_gemma":[0.9982064,0.00072845264,0.00019467919,0.0003022866,0.00029489913,0.00027335685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073376374,0.00047313914,0.0005591228,0.0014320327,0.0014926483,0.0040443707,0.0010490993,0.00088048965,0.0053865346],"category_scores_gemma":[0.006455169,0.00050624803,0.0004824221,0.0012432247,0.0034735783,0.004976075,0.0027379408,0.0013155155,0.0006845594],"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.0000069751704,0.0000027208412,0.00019998156,0.000014710873,0.0000028500901,0.000032822787,0.0001186008,0.005529414,0.00023428893,0.9900232,0.0003417549,0.0034926883],"study_design_scores_gemma":[0.000008052036,0.000009342566,0.00017680658,0.0000217606,0.0000053933477,0.00007621338,0.00018671737,0.04714872,0.00090756203,0.9376062,0.0138419885,0.000011281673],"about_ca_topic_score_codex":0.0036431954,"about_ca_topic_score_gemma":0.0028808329,"teacher_disagreement_score":0.0053865346,"about_ca_system_score_codex":0.001674063,"about_ca_system_score_gemma":0.00075584376,"threshold_uncertainty_score":0.018019736},"labels":[],"label_agreement":null},{"id":"W2347186258","doi":"10.20382/jocg.v10i1a3","title":"Minimax Rates for Estimating the Dimension of a Manifold","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Samsung; National Science Foundation","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Minimax; Dimension (graph theory); Bounding overwatch; Embedding; Lemma (botany); Manifold (fluid mechanics); Probability distribution; Distribution (mathematics); Omega; Order (exchange); Discrete mathematics; Mathematical analysis; Statistics; Mathematical optimization; Computer science","score_opus":0.015565488803360757,"score_gpt":0.2464128874285505,"score_spread":0.23084739862518974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2347186258","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.029660765,0.0028354342,0.9601597,0.0024305107,0.00015013028,0.00011468875,0.00035779466,0.0002859547,0.0040050396],"genre_scores_gemma":[0.5771063,0.0054996223,0.40461877,0.0013158227,0.0013184347,0.0015170402,0.0016666371,0.000805993,0.0061513656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98907894,0.005967241,0.0006269505,0.0019538635,0.001932401,0.00044068083],"domain_scores_gemma":[0.88740224,0.097005665,0.0038413866,0.0066063525,0.003923782,0.0012206092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024416834,0.0024426489,0.004396271,0.0038112665,0.001597631,0.0046531768,0.003979999,0.0042834445,0.003753698],"category_scores_gemma":[0.13610783,0.0014082058,0.0017526054,0.0025651008,0.007862831,0.0124205025,0.006897345,0.007941014,0.0009970384],"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.0005738529,0.00011620002,0.0037204667,0.0006531575,0.00026406726,0.00024400043,0.00045787383,0.2991029,0.0026366643,0.6491333,0.0044188756,0.03867857],"study_design_scores_gemma":[0.000036066376,0.000113780654,0.00072186784,0.00013470177,0.000025639461,0.000111860354,0.000058875314,0.51333266,0.00135849,0.4826646,0.0013790885,0.00006243204],"about_ca_topic_score_codex":0.00089841516,"about_ca_topic_score_gemma":0.00050195784,"teacher_disagreement_score":0.024416834,"about_ca_system_score_codex":0.0025356612,"about_ca_system_score_gemma":0.0015467191,"threshold_uncertainty_score":0.12913013},"labels":[],"label_agreement":null},{"id":"W2490727251","doi":"10.20382/jocg.v9i1a5","title":"On the Geodesic Centers of Polygonal Domains","year":2016,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Geodesic; Combinatorics; Mathematics; Shortest path problem; Bounded function; Center (category theory); Euclidean geometry; Equivalence (formal languages); Path (computing); Domain (mathematical analysis); Discrete mathematics; Geometry; Computer science; Mathematical analysis; Crystallography","score_opus":0.014365061261561854,"score_gpt":0.2163739961313764,"score_spread":0.20200893486981453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490727251","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.26536947,0.00084840856,0.72478855,0.0005046762,0.0000478638,0.00019198399,0.00060488266,0.0014473433,0.006196739],"genre_scores_gemma":[0.5644304,0.0004178968,0.43057492,0.00007468578,0.000054079683,0.00017100979,0.0013863008,0.00034882102,0.0025418387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992137,0.00018098787,0.00004140347,0.00023909521,0.00021980194,0.000104964834],"domain_scores_gemma":[0.9978278,0.0012864053,0.00024537253,0.00025545215,0.00024640904,0.00013846769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007293521,0.0008632158,0.0011386051,0.0019227891,0.0010029682,0.0014514724,0.0016709189,0.0010656528,0.0035184447],"category_scores_gemma":[0.0067945323,0.0004876565,0.00070694165,0.0019327125,0.0017248391,0.0030284266,0.0022212458,0.0011503164,0.00077351317],"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.0007737678,0.00016631206,0.0048982934,0.0004922748,0.00009515814,0.0004357511,0.0009333573,0.54670745,0.012922536,0.21908416,0.0063838805,0.20710702],"study_design_scores_gemma":[0.00008376247,0.000096513766,0.0006806363,0.000037107737,0.00002143269,0.00015540737,0.0002992202,0.81216043,0.008943724,0.17183849,0.0056505627,0.000032719305],"about_ca_topic_score_codex":0.0028006874,"about_ca_topic_score_gemma":0.0019804856,"teacher_disagreement_score":0.0035184447,"about_ca_system_score_codex":0.0010268253,"about_ca_system_score_gemma":0.0006500017,"threshold_uncertainty_score":0.011770308},"labels":[],"label_agreement":null},{"id":"W2527987597","doi":"10.20382/jocg.v8i1a10","title":"How many three-dimensional Hilbert curves are there?","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hilbert curve; Hilbert R-tree; Octant (instrument); Mathematics; Hilbert space; Locality; Point (geometry); Software; Pure mathematics; Geometry; Computer science; Rigged Hilbert space; Unitary operator; Physics","score_opus":0.02297092673404886,"score_gpt":0.2294830516176812,"score_spread":0.20651212488363235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527987597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4527008,0.005385237,0.3555125,0.011040382,0.0005966137,0.00013707962,0.0010276169,0.0013713265,0.17222854],"genre_scores_gemma":[0.8819488,0.0019568128,0.098847404,0.0005015669,0.0001561385,0.00012090938,0.0005105206,0.0003379056,0.015619822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893266,0.00028546227,0.00007009398,0.00017244458,0.00026611536,0.00027313997],"domain_scores_gemma":[0.99738103,0.000880956,0.00032799557,0.00051226077,0.00045350022,0.00044423318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013066859,0.00049996737,0.00065136846,0.0015728058,0.0031040038,0.0045089857,0.00076410343,0.0016261804,0.010881435],"category_scores_gemma":[0.0061090076,0.0004012377,0.0008897438,0.002303849,0.004465732,0.00944229,0.002427944,0.0017924273,0.001939026],"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.00007592851,0.000021180636,0.0013968208,0.00008891973,0.000014256181,0.00020142735,0.00088490796,0.0014212789,0.0012619814,0.9427369,0.0032574132,0.048639074],"study_design_scores_gemma":[0.000018537545,0.000035864414,0.0007953185,0.000104876315,0.000016368238,0.0006002709,0.0020366516,0.005221677,0.002342407,0.93048656,0.058267213,0.00007427014],"about_ca_topic_score_codex":0.001315317,"about_ca_topic_score_gemma":0.0008803621,"teacher_disagreement_score":0.010881435,"about_ca_system_score_codex":0.0013585985,"about_ca_system_score_gemma":0.0008060318,"threshold_uncertainty_score":0.036401987},"labels":[],"label_agreement":null},{"id":"W2549157564","doi":"10.20382/jocg.v7i1a18","title":"Recognizing shrinkable complexes is NP-complete","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Chemistry; Computer science","score_opus":0.023638570692363654,"score_gpt":0.21859456848658648,"score_spread":0.19495599779422282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549157564","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.44469482,0.0013514656,0.49308544,0.010081635,0.00031487507,0.0010945359,0.012903316,0.0064893244,0.029984541],"genre_scores_gemma":[0.60691077,0.0008896222,0.35760272,0.0013023315,0.00021497489,0.00068538537,0.021430032,0.0009218199,0.010042397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974275,0.0002883359,0.000293663,0.000989109,0.0006560915,0.0003452134],"domain_scores_gemma":[0.979226,0.016069222,0.0009886313,0.0020216217,0.0010649764,0.0006295664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010061,0.0011226604,0.0018918891,0.00066941587,0.0022290589,0.0056823418,0.0027639712,0.002498827,0.0110140955],"category_scores_gemma":[0.00943801,0.0013741283,0.003131866,0.0016870832,0.0022399705,0.009712851,0.0035892122,0.0040168064,0.0018017602],"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.0018639592,0.0010515032,0.015669858,0.004416839,0.0006714817,0.003250744,0.0028401471,0.250739,0.069578074,0.2302473,0.07874491,0.34092614],"study_design_scores_gemma":[0.0002894736,0.00017676935,0.0028146096,0.00016660923,0.00023653348,0.001556791,0.0023029326,0.31053227,0.028492449,0.61978316,0.03350829,0.00014011347],"about_ca_topic_score_codex":0.0044145035,"about_ca_topic_score_gemma":0.007593211,"teacher_disagreement_score":0.0110140955,"about_ca_system_score_codex":0.001608288,"about_ca_system_score_gemma":0.0018217751,"threshold_uncertainty_score":0.036845863},"labels":[],"label_agreement":null},{"id":"W2560760141","doi":"10.20382/jocg.v7i1a17","title":"Near-linear time medial axis approximation of smooth curves in $\\mathbb{R}^3$","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Medial axis; Mathematics; Combinatorics; Geometry","score_opus":0.049667041797638936,"score_gpt":0.27971511019496265,"score_spread":0.23004806839732372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560760141","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.016907562,0.00020239918,0.9797931,0.00011977239,0.000042617467,0.00006988001,0.00011340287,0.0012059597,0.0015453437],"genre_scores_gemma":[0.1623112,0.00019188698,0.8339282,0.000078397614,0.00004305814,0.00011949159,0.00065632444,0.00033220008,0.002339302],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929833,0.00009355345,0.000051147472,0.0001409302,0.00032377784,0.000092305105],"domain_scores_gemma":[0.9982381,0.0007563559,0.00021476524,0.00036814134,0.00030589837,0.000116657095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008977991,0.0014614001,0.0013564283,0.001629872,0.00059231324,0.0018882144,0.0017515086,0.0010894109,0.005364199],"category_scores_gemma":[0.0057345787,0.00054258975,0.0012228185,0.0010228885,0.0011730073,0.0017527547,0.0031087734,0.0025339636,0.0020115364],"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.0011450645,0.00016901054,0.004301454,0.00067390216,0.00014879084,0.00038396486,0.0006433097,0.36241543,0.03416483,0.11692699,0.0071940706,0.47183317],"study_design_scores_gemma":[0.000027205375,0.000102596554,0.00025109167,0.000041397445,0.000013435528,0.000118933174,0.000066719476,0.95942384,0.0077408245,0.02852903,0.0036687737,0.000016168919],"about_ca_topic_score_codex":0.004082802,"about_ca_topic_score_gemma":0.005694878,"teacher_disagreement_score":0.005364199,"about_ca_system_score_codex":0.0012162316,"about_ca_system_score_gemma":0.001070361,"threshold_uncertainty_score":0.017945051},"labels":[],"label_agreement":null},{"id":"W2570381751","doi":"10.20382/jocg.v7i1a15","title":"Consistent labeling of rotating maps","year":2014,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.010345783404801747,"score_gpt":0.20170838760784748,"score_spread":0.19136260420304574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570381751","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.07696765,0.00021297118,0.91306305,0.000651725,0.00006728979,0.00020325922,0.00087444094,0.001735176,0.0062244786],"genre_scores_gemma":[0.38646996,0.00025824495,0.6028828,0.00025893262,0.00006712551,0.0004044827,0.0024321754,0.0006495857,0.006576714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721694,0.000798254,0.00015961699,0.00083596405,0.0005423306,0.0004468135],"domain_scores_gemma":[0.99415755,0.0024909389,0.0006314625,0.0017231322,0.0006582096,0.00033866832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015835922,0.0012748478,0.0015970719,0.000850907,0.001489777,0.0022976354,0.0025038633,0.0017189174,0.00783741],"category_scores_gemma":[0.010875176,0.00088659226,0.0012283571,0.0024507816,0.0014961539,0.004900567,0.0027246885,0.0017393123,0.001690899],"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.0011438963,0.0003359119,0.0035032046,0.00065339776,0.00010498804,0.00047204286,0.0011000916,0.47064388,0.02097104,0.20831989,0.019835996,0.2729156],"study_design_scores_gemma":[0.00012206735,0.0002393916,0.0006280988,0.0000453487,0.00006231137,0.00025687355,0.0005168504,0.7561496,0.013660111,0.21373343,0.014537702,0.000048101014],"about_ca_topic_score_codex":0.0023416067,"about_ca_topic_score_gemma":0.0025807605,"teacher_disagreement_score":0.00783741,"about_ca_system_score_codex":0.0014650848,"about_ca_system_score_gemma":0.001657422,"threshold_uncertainty_score":0.026218772},"labels":[],"label_agreement":null},{"id":"W2571441785","doi":"10.20382/jocg.v7i1a2","title":"Strict Confluent Drawing","year":2013,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Multidisciplinary University Research Initiative; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Graph; Path (computing); Enhanced Data Rates for GSM Evolution; Graph drawing; Boundary (topology); Order (exchange); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.0162556366757558,"score_gpt":0.2238675157719984,"score_spread":0.2076118790962426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571441785","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.06645317,0.0003328308,0.88955766,0.0006148096,0.000127961,0.00044611454,0.0010746748,0.0017326047,0.03966017],"genre_scores_gemma":[0.5317249,0.0009984793,0.44286978,0.0007329685,0.00012575672,0.00047253582,0.00378952,0.000581694,0.01870444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983163,0.00034786548,0.00014095333,0.00043750444,0.00051577424,0.00024167927],"domain_scores_gemma":[0.9962824,0.0013687552,0.00031896358,0.00096795283,0.00074485596,0.00031699278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010287082,0.0008808304,0.00066654506,0.00094948756,0.0012480316,0.0020759148,0.0016872438,0.0011088395,0.008715173],"category_scores_gemma":[0.0073345136,0.0005497115,0.0007400633,0.0016900315,0.0021416356,0.003848844,0.0030184113,0.0017136274,0.0018441771],"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.0003775736,0.0001649547,0.0037615465,0.00070275605,0.000079036006,0.0015069607,0.0018330556,0.05254388,0.036392428,0.6685744,0.019389257,0.21467419],"study_design_scores_gemma":[0.000088388835,0.00028205852,0.0013579684,0.000117718046,0.00014170706,0.0013290917,0.0011387758,0.16557305,0.030791514,0.66547257,0.13362306,0.0000840616],"about_ca_topic_score_codex":0.0027694546,"about_ca_topic_score_gemma":0.003208889,"teacher_disagreement_score":0.008715173,"about_ca_system_score_codex":0.00074569526,"about_ca_system_score_gemma":0.00097411853,"threshold_uncertainty_score":0.029155195},"labels":[],"label_agreement":null},{"id":"W2604480575","doi":"10.20382/jocg.v8i2a3","title":"Hyperplane separability and convexity of probabilistic point sets","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Mathematics; Convex hull; Combinatorics; Hyperplane; Probabilistic logic; Convexity; Separable space; Reduction (mathematics); Orthogonal convex hull; Regular polygon; Subspace topology; Point (geometry); Convex combination; Hull; Discrete mathematics; Convex body; Convex optimization; Mathematical analysis; Statistics; Geometry","score_opus":0.02299352665663522,"score_gpt":0.23011672739409167,"score_spread":0.20712320073745644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604480575","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.053137526,0.00031067984,0.9381886,0.0006974981,0.00003698586,0.00022391604,0.0012109648,0.0014059981,0.004787794],"genre_scores_gemma":[0.6240008,0.0003889118,0.3640352,0.0002334821,0.0001607568,0.0005274225,0.0049809106,0.00045630557,0.0052161952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99488527,0.00086549827,0.00034627723,0.0011928771,0.0020678027,0.0006422101],"domain_scores_gemma":[0.9858131,0.008543126,0.0014645467,0.002498213,0.0011482725,0.00053282577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002426211,0.0013333414,0.0025367904,0.0022901043,0.0017390322,0.004379223,0.0034778703,0.0014082065,0.008779068],"category_scores_gemma":[0.020886878,0.001169854,0.0026785159,0.0036517752,0.0024327997,0.0071379817,0.006531646,0.0046680016,0.0021633324],"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.0010996286,0.00031185552,0.011599825,0.00045186005,0.00026977822,0.00042581983,0.0008940565,0.55508184,0.0057346765,0.16915856,0.012435453,0.24253671],"study_design_scores_gemma":[0.000045006662,0.00005293041,0.0012219568,0.000028172937,0.000024759272,0.00019021133,0.0001406746,0.846934,0.004047681,0.1448089,0.0024720451,0.000033637432],"about_ca_topic_score_codex":0.0047753695,"about_ca_topic_score_gemma":0.004103174,"teacher_disagreement_score":0.008779068,"about_ca_system_score_codex":0.0028945794,"about_ca_system_score_gemma":0.0021615361,"threshold_uncertainty_score":0.029368937},"labels":[],"label_agreement":null},{"id":"W2618186495","doi":"10.20382/jocg.v8i1a8","title":"A new drawing for simple Venn diagrams based on algebraic construction","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Venn diagram; Simple (philosophy); Readability; Mathematics; Diagram; Domain (mathematical analysis); Algebraic number; Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Mathematics education; Programming language; Statistics; Epistemology","score_opus":0.013859262011055636,"score_gpt":0.2423047760116783,"score_spread":0.22844551400062266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618186495","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.0017856371,0.000102618185,0.99318707,0.00010293066,0.00010991553,0.000056665256,0.00014090154,0.0012192314,0.0032949687],"genre_scores_gemma":[0.026442967,0.00019508004,0.96998996,0.00007579538,0.00007634506,0.00014109795,0.00032507526,0.000669268,0.0020844585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998161,0.0005534169,0.00016634974,0.0004666809,0.000557166,0.00009542974],"domain_scores_gemma":[0.9959394,0.0018569375,0.00026076302,0.0007488163,0.00087609136,0.00031814148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016115346,0.0009229577,0.00076409394,0.0041317972,0.0013539058,0.002915696,0.0020366674,0.0011179898,0.012307144],"category_scores_gemma":[0.009819311,0.00082443585,0.0013018802,0.0025591152,0.0018009886,0.0056974106,0.0032211628,0.0020539558,0.0026718837],"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.000118761076,0.000055544268,0.0010785084,0.0005672451,0.00005000703,0.00049154216,0.0017121489,0.011481004,0.022594398,0.75034386,0.015728323,0.19577868],"study_design_scores_gemma":[0.000077979676,0.00013661826,0.00082949706,0.00025507872,0.000064351,0.0019687302,0.00041727035,0.12941125,0.019778853,0.54416955,0.30270803,0.00018277238],"about_ca_topic_score_codex":0.0012421517,"about_ca_topic_score_gemma":0.0017248482,"teacher_disagreement_score":0.012307144,"about_ca_system_score_codex":0.0007482204,"about_ca_system_score_gemma":0.00092318276,"threshold_uncertainty_score":0.04117149},"labels":[],"label_agreement":null},{"id":"W2768380610","doi":"10.20382/jocg.v8i1a2","title":"Towards plane spanners of degree 3","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Degree (music); Mathematics; Vertex (graph theory); Spanner; General position; Plane (geometry); Regular polygon; Lattice (music); Position (finance); Geometry; Graph; Physics; Computer science","score_opus":0.011770719910364423,"score_gpt":0.20626728073711498,"score_spread":0.19449656082675054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768380610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.587217,0.00031845705,0.39857966,0.00020197914,0.00004262042,0.00007087701,0.00044627432,0.0010883781,0.012034778],"genre_scores_gemma":[0.68093836,0.00022714786,0.31310156,0.00008544757,0.000032789292,0.00005089618,0.0011192756,0.00025015927,0.004194235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995678,0.00006252486,0.000025834437,0.00010175904,0.00013079535,0.00011126051],"domain_scores_gemma":[0.9994698,0.00016944653,0.00009483051,0.00011453491,0.00009051,0.00006086245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032073737,0.0006081811,0.00061642966,0.00084412465,0.00045655086,0.0008926828,0.0006439875,0.00044232956,0.004586258],"category_scores_gemma":[0.0018460784,0.00030355772,0.00067106134,0.00094460195,0.00077968586,0.0018737343,0.001973546,0.0008430029,0.0012900708],"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.0009707393,0.00028637165,0.012356326,0.00043394012,0.00013185646,0.00068558136,0.001407749,0.37883982,0.050940853,0.17940864,0.008507705,0.36603037],"study_design_scores_gemma":[0.000080392776,0.00040781155,0.0019064127,0.00007432238,0.000028647875,0.00046557334,0.0007948012,0.71169615,0.03340695,0.23586635,0.015221789,0.00005081733],"about_ca_topic_score_codex":0.0018720637,"about_ca_topic_score_gemma":0.0034240203,"teacher_disagreement_score":0.004586258,"about_ca_system_score_codex":0.0003913204,"about_ca_system_score_gemma":0.00043385001,"threshold_uncertainty_score":0.015342534},"labels":[],"label_agreement":null},{"id":"W2769340683","doi":"10.20382/jocg.v9i1a14","title":"Canonical ordering for graphs on the cylinder, with applications to periodic straight-line drawings on the flat cyclinder and torus","year":2017,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Torus; Cylinder; Geometry; Mathematics; Line (geometry); Line drawings; Combinatorics; Engineering drawing; Engineering","score_opus":0.03362954508143733,"score_gpt":0.26345186032960455,"score_spread":0.2298223152481672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769340683","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.066762395,0.0006030611,0.8968622,0.0005880764,0.00021256488,0.00010233406,0.00044282386,0.002420889,0.032005712],"genre_scores_gemma":[0.3925736,0.0016159124,0.5871161,0.0002348754,0.00024139536,0.00016706504,0.0019046856,0.0010569585,0.015089406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994025,0.00009516649,0.000041539013,0.00016231835,0.00019231622,0.00010608108],"domain_scores_gemma":[0.9990409,0.00026258937,0.00009949247,0.00025822088,0.0002019317,0.00013686466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003419482,0.0006666817,0.0005122913,0.0012317231,0.0010642856,0.0023869413,0.00091791456,0.0005474109,0.006861838],"category_scores_gemma":[0.002326539,0.00042376353,0.0009705501,0.0025132238,0.0011865862,0.0025377076,0.0013359918,0.0016560922,0.0018991767],"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.00011070705,0.00007252671,0.0010270096,0.00018112693,0.000015628546,0.00026325567,0.00056645344,0.060052432,0.007783619,0.7613983,0.009655563,0.15887333],"study_design_scores_gemma":[0.000053334326,0.00012356261,0.0008730253,0.00004955779,0.00003704274,0.0003655872,0.00037191,0.2610933,0.008721989,0.67905134,0.049194325,0.00006513137],"about_ca_topic_score_codex":0.0074793454,"about_ca_topic_score_gemma":0.011428694,"teacher_disagreement_score":0.0074793454,"about_ca_system_score_codex":0.0016541233,"about_ca_system_score_gemma":0.0010870224,"threshold_uncertainty_score":0.02295512},"labels":[],"label_agreement":null},{"id":"W2773875520","doi":"10.20382/jocg.v9i1a8","title":"Array-based compact data structures for triangulations: Practical solutions with theoretical guarantees","year":2017,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Distributed computing; Mathematical optimization; Theoretical computer science; Algorithm; Computational science; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.07517421534455519,"score_gpt":0.32012790615535913,"score_spread":0.24495369081080393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773875520","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.02790173,0.00048404362,0.9631396,0.00084258086,0.00006458804,0.000087250875,0.0004254911,0.0021266118,0.0049281046],"genre_scores_gemma":[0.2119935,0.0006970393,0.77977544,0.00022211802,0.00010192529,0.0004982066,0.001501544,0.0007417164,0.0044684983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981273,0.0003632825,0.00019329831,0.00024378822,0.00085854053,0.00021376715],"domain_scores_gemma":[0.991355,0.0035702866,0.00076781097,0.0032630533,0.0008832285,0.00016056602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012554515,0.0008776928,0.0009970218,0.0012558606,0.0009985551,0.00285043,0.0025210956,0.0018820005,0.0074818237],"category_scores_gemma":[0.015260419,0.00071871886,0.00093799137,0.0035460924,0.0014822036,0.007323246,0.0039127306,0.0021705083,0.0027622012],"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.0006845148,0.00020972115,0.0016380078,0.000941753,0.000052144962,0.00021775566,0.0009871495,0.20459259,0.02034439,0.3444336,0.017261878,0.4086365],"study_design_scores_gemma":[0.00018511555,0.00025889,0.00025556888,0.00015419515,0.00004199503,0.0003350527,0.00058423885,0.6347905,0.025273712,0.3151156,0.022948097,0.000056996632],"about_ca_topic_score_codex":0.0011482434,"about_ca_topic_score_gemma":0.0017429796,"teacher_disagreement_score":0.0074818237,"about_ca_system_score_codex":0.0012800669,"about_ca_system_score_gemma":0.0014098785,"threshold_uncertainty_score":0.025029182},"labels":[],"label_agreement":null},{"id":"W2788091414","doi":"10.20382/jocg.v9i1a2","title":"Scalable exact visualization of isocontours in road networks via minimum-link paths","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Heuristics; Scalability; Simple (philosophy); Time complexity; Computer science; Key (lock); Link (geometry); Mathematical optimization; Limit (mathematics); Linear programming; Mathematics; Algorithm; Computer network","score_opus":0.01160676713131791,"score_gpt":0.24497944753088502,"score_spread":0.2333726803995671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788091414","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.12371364,0.0005148127,0.8648234,0.00062336464,0.000061225925,0.00011171,0.0010048969,0.0044151354,0.0047318162],"genre_scores_gemma":[0.55921394,0.0004360504,0.43667543,0.000062773324,0.00002640217,0.00012873374,0.0011614833,0.0006380964,0.0016570279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996049,0.00010510772,0.00001681523,0.00007127506,0.00015371955,0.000048257578],"domain_scores_gemma":[0.9989261,0.00056808814,0.00008953904,0.00017181686,0.0001746701,0.00006977279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043578033,0.0012042926,0.0010179703,0.0011627243,0.00060646026,0.0018597222,0.0012008934,0.00089829444,0.0033454723],"category_scores_gemma":[0.0040593436,0.00056898355,0.00062209385,0.0012660144,0.000578227,0.0021787777,0.001856814,0.0011108943,0.0006227749],"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.00023549747,0.000074962845,0.0019432157,0.00022994807,0.000051726503,0.00022599434,0.00046431037,0.8827259,0.0067796083,0.01492907,0.0052972436,0.087042496],"study_design_scores_gemma":[0.00001528898,0.0000098248565,0.00014926375,0.000008073071,0.00000304806,0.000028872424,0.000057568206,0.9879848,0.0012632231,0.009396368,0.0010764941,0.0000072002986],"about_ca_topic_score_codex":0.0065824464,"about_ca_topic_score_gemma":0.010947835,"teacher_disagreement_score":0.0065824464,"about_ca_system_score_codex":0.0010148692,"about_ca_system_score_gemma":0.0010277285,"threshold_uncertainty_score":0.013088226},"labels":[],"label_agreement":null},{"id":"W2788294399","doi":"10.20382/jocg.v9i1a1","title":"Computing maxmin edge length triangulations","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cutting-plane method; Combinatorics; Minimax; Point (geometry); Integer programming; Integer (computer science); Triangulation; Set (abstract data type); Polynomial; Discrete mathematics; Algorithm; Computer science; Mathematical optimization; Geometry","score_opus":0.02080231691856677,"score_gpt":0.24996725564721475,"score_spread":0.229164938728648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788294399","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.06937518,0.0003839933,0.9159344,0.00029652563,0.00006500424,0.00007663507,0.0007944724,0.0012017548,0.0118720755],"genre_scores_gemma":[0.28177223,0.0003782445,0.70858836,0.000119835066,0.000042219992,0.00014998652,0.002309866,0.00051051204,0.0061287247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993304,0.00011986828,0.00005010496,0.00017067892,0.00021783188,0.00011103811],"domain_scores_gemma":[0.99875665,0.00052409887,0.00016030372,0.00026532708,0.0002244878,0.00006929151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000653015,0.00086693995,0.00107717,0.0013075342,0.0008266797,0.0012513328,0.0012845001,0.0011695096,0.008166149],"category_scores_gemma":[0.0037907967,0.0008176164,0.0011102516,0.001471973,0.00091564556,0.003139545,0.002105038,0.0014837232,0.00206386],"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.0004686871,0.000116079136,0.0055259536,0.0007322133,0.00012728316,0.0003292028,0.0006965705,0.3558238,0.029326035,0.17644602,0.016042802,0.41436535],"study_design_scores_gemma":[0.00007239231,0.0001672191,0.0013622078,0.00009387148,0.000030640436,0.00021356993,0.0005418346,0.6835168,0.017496808,0.2735905,0.022867301,0.000046858433],"about_ca_topic_score_codex":0.0013118908,"about_ca_topic_score_gemma":0.0036034728,"teacher_disagreement_score":0.008166149,"about_ca_system_score_codex":0.0009545607,"about_ca_system_score_gemma":0.00072370697,"threshold_uncertainty_score":0.027318537},"labels":[],"label_agreement":null},{"id":"W2788434477","doi":"10.20382/jocg.v9i1a3","title":"Flat foldings of plane graphs with prescribed angles and edge lengths","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Emerging Frontiers in Research and Innovation; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Conjecture; Vertex (graph theory); Plane (geometry); Geometry; Enhanced Data Rates for GSM Evolution; Infinitesimal; Graph; Mathematical analysis; Computer science; Telecommunications","score_opus":0.00990543431285126,"score_gpt":0.17858412648300845,"score_spread":0.16867869217015719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788434477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91903937,0.00007706929,0.07647333,0.00014521056,0.000013656885,0.00004322437,0.00033256473,0.00032143857,0.0035541686],"genre_scores_gemma":[0.97661066,0.00006483641,0.021638399,0.00004635695,0.000006659082,0.000031595966,0.00061720563,0.000059734073,0.0009244621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948114,0.00010836709,0.000048287144,0.00016647478,0.00007811726,0.00011767704],"domain_scores_gemma":[0.9965789,0.001770714,0.0004950443,0.00063478446,0.00025484664,0.0002657376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005117179,0.00042710468,0.00043972197,0.0004927323,0.0007304247,0.0011640093,0.0006081348,0.0007137365,0.0024856392],"category_scores_gemma":[0.0048034824,0.0004268727,0.0006208988,0.0005148432,0.0010753492,0.0028313661,0.00072473014,0.0005230575,0.00031918474],"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.0023773175,0.0003332924,0.05382273,0.00044277028,0.00014083153,0.0028860911,0.0018068792,0.4086489,0.08912164,0.28934792,0.0049199094,0.14615183],"study_design_scores_gemma":[0.000079945174,0.00033047804,0.010160636,0.00006848581,0.000058032758,0.00082643976,0.0017232625,0.51815456,0.048203208,0.41696525,0.003367425,0.00006227514],"about_ca_topic_score_codex":0.0015529379,"about_ca_topic_score_gemma":0.0018646404,"teacher_disagreement_score":0.0024856392,"about_ca_system_score_codex":0.0005436049,"about_ca_system_score_gemma":0.00031975063,"threshold_uncertainty_score":0.008315265},"labels":[],"label_agreement":null},{"id":"W2888306059","doi":"10.20382/jocg.v9i1a9","title":"Drawing planar graphs with prescribed face areas","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Planar graph; Bipartite graph; Combinatorics; Mathematics; Eulerian path; Universality (dynamical systems); Plane (geometry); Graph; Geometry; Discrete mathematics; Pure mathematics; Physics; Lagrangian","score_opus":0.014040307801698399,"score_gpt":0.21825494128515086,"score_spread":0.20421463348345245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888306059","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.24478057,0.0003580581,0.7307337,0.0002484282,0.000046389152,0.00006637092,0.00019816906,0.00076405035,0.022804288],"genre_scores_gemma":[0.7314567,0.00063962804,0.26044065,0.00010844829,0.000042444302,0.000110509965,0.0003755071,0.00024171387,0.006584349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995968,0.00008692243,0.000021793576,0.000115159884,0.00011404184,0.00006536805],"domain_scores_gemma":[0.9989899,0.00043287454,0.00018520144,0.00022947889,0.000087170665,0.000075443444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024460405,0.0005625391,0.00040709862,0.0004948961,0.0004373509,0.0006685682,0.00071111036,0.00060811883,0.0037318922],"category_scores_gemma":[0.0024921454,0.00043999054,0.0004579546,0.0008103475,0.00076089136,0.0016316655,0.001039115,0.0007531095,0.00058153627],"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.00020042568,0.00011658756,0.0024974085,0.00034590316,0.000061531435,0.0006411081,0.0006055943,0.34687293,0.0429917,0.38207313,0.0039294064,0.21966434],"study_design_scores_gemma":[0.0000774438,0.00020482314,0.0018698814,0.00007637057,0.000048541402,0.00087876304,0.00045963933,0.5320692,0.02982965,0.40606266,0.028371533,0.000051489063],"about_ca_topic_score_codex":0.0012671998,"about_ca_topic_score_gemma":0.0017712379,"teacher_disagreement_score":0.0037318922,"about_ca_system_score_codex":0.00054688967,"about_ca_system_score_gemma":0.0002090678,"threshold_uncertainty_score":0.012484491},"labels":[],"label_agreement":null},{"id":"W2890636645","doi":"10.20382/jocg.v9i1a11","title":"Planar and Poly-Arc Lombardi Drawings","year":2011,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Planarity testing; Planar graph; Planar; Graph; Book embedding; Combinatorics; Mathematics; Computer science; Line graph; 1-planar graph; Computer graphics (images)","score_opus":0.016700989118549496,"score_gpt":0.21151987308479653,"score_spread":0.19481888396624703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890636645","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.100160204,0.0013300116,0.80934495,0.0008832433,0.000160083,0.00010963788,0.00063135405,0.0012228057,0.0861577],"genre_scores_gemma":[0.573079,0.0019117546,0.3815256,0.00042173715,0.00012419358,0.00018307139,0.0014155285,0.0005245381,0.04081465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949527,0.00009365411,0.000020337602,0.00012821109,0.00018256216,0.00007996426],"domain_scores_gemma":[0.99932194,0.00019819697,0.00011409783,0.00015661171,0.00013958378,0.00006954397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022883786,0.00055310724,0.00031299875,0.0008551592,0.0005504049,0.001633221,0.0006688661,0.0010633675,0.011125276],"category_scores_gemma":[0.0026082748,0.0004953145,0.00048166967,0.0012820527,0.0011745996,0.001691337,0.0011836721,0.0014006317,0.0017143193],"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.000117908115,0.000029975938,0.0010131174,0.00015838907,0.000019155641,0.00037441295,0.00035649881,0.047613073,0.008036223,0.8180276,0.010541909,0.113711834],"study_design_scores_gemma":[0.00004275177,0.00007751592,0.0018521275,0.00009014096,0.000033283843,0.0010079133,0.00031322177,0.16944358,0.008207092,0.69845396,0.12041244,0.00006597344],"about_ca_topic_score_codex":0.001684124,"about_ca_topic_score_gemma":0.0024108032,"teacher_disagreement_score":0.011125276,"about_ca_system_score_codex":0.0005894933,"about_ca_system_score_gemma":0.00031871523,"threshold_uncertainty_score":0.037217736},"labels":[],"label_agreement":null},{"id":"W2890802049","doi":"10.20382/jocg.v11i1a3","title":"New lower bounds for the number of pseudoline arrangements","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Sorting network; Graph; Sorting; Constant (computer programming); Sorting algorithm; Algorithm; Computer science; Mathematical analysis","score_opus":0.010241576557437881,"score_gpt":0.23630385694285558,"score_spread":0.2260622803854177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890802049","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.06677341,0.025732525,0.6885223,0.012916017,0.0024508492,0.0003782169,0.0049679205,0.003526582,0.19473214],"genre_scores_gemma":[0.473791,0.023991369,0.40876073,0.005452388,0.006537713,0.0018119331,0.011268116,0.0040396564,0.06434707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99058795,0.0015677373,0.00052430655,0.002646604,0.0030959086,0.0015774858],"domain_scores_gemma":[0.9513668,0.0308543,0.0032168867,0.007793509,0.004076948,0.0026916007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045724683,0.004119046,0.0036473244,0.0073002516,0.0041846638,0.008438654,0.0095224045,0.005000692,0.0355801],"category_scores_gemma":[0.050460376,0.002828278,0.0036433772,0.008697818,0.006251995,0.036771186,0.008963541,0.017270643,0.012297288],"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.0011551364,0.0006613161,0.011023287,0.0022750562,0.00031616646,0.00056871085,0.0008572701,0.07933732,0.0146171795,0.61525404,0.08999324,0.18394117],"study_design_scores_gemma":[0.00012981503,0.00029419153,0.004073555,0.0005159194,0.0002683097,0.0014630755,0.00031999202,0.20924434,0.009256508,0.6841941,0.089933306,0.0003068812],"about_ca_topic_score_codex":0.0026676445,"about_ca_topic_score_gemma":0.0034201662,"teacher_disagreement_score":0.0355801,"about_ca_system_score_codex":0.005379082,"about_ca_system_score_gemma":0.002188568,"threshold_uncertainty_score":0.11902732},"labels":[],"label_agreement":null},{"id":"W2962836387","doi":"10.20382/jocg.v4i1a8","title":"Network farthest-point diagrams","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Point (geometry); Combinatorics; Geometry","score_opus":0.012509513563585475,"score_gpt":0.22090020614609818,"score_spread":0.2083906925825127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962836387","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.046661448,0.00067240617,0.9325102,0.0005547431,0.00007382659,0.0001558423,0.003523175,0.0009848559,0.014863368],"genre_scores_gemma":[0.42041385,0.0015524625,0.55567837,0.00025215166,0.00010274746,0.0005370265,0.007925543,0.0004054901,0.013132421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985796,0.0002902665,0.00009217048,0.00042936287,0.00048792976,0.00012073067],"domain_scores_gemma":[0.9966397,0.0015165774,0.0004535912,0.00043690216,0.00068962324,0.0002636193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008702003,0.00065828324,0.0006225725,0.0028884576,0.000728405,0.0022069213,0.0012016721,0.0011243809,0.008474747],"category_scores_gemma":[0.008172783,0.00035077502,0.0005351056,0.0024824715,0.00090249773,0.0052929805,0.0019173083,0.001056328,0.0012534173],"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.00021112851,0.00007701603,0.003932544,0.00043898216,0.000052382813,0.00034595485,0.00060535327,0.19696787,0.0069243186,0.6763034,0.010795924,0.10334519],"study_design_scores_gemma":[0.000051519073,0.000091760376,0.0014030619,0.000119694996,0.00003853753,0.0003798831,0.00023174344,0.35607296,0.0049776295,0.55543935,0.08114259,0.000051256447],"about_ca_topic_score_codex":0.002388818,"about_ca_topic_score_gemma":0.0031099957,"teacher_disagreement_score":0.008474747,"about_ca_system_score_codex":0.0012409082,"about_ca_system_score_gemma":0.0007085699,"threshold_uncertainty_score":0.02835083},"labels":[],"label_agreement":null},{"id":"W2963119423","doi":"10.20382/jocg.v8i2a4","title":"Minimum cycle and homology bases of surface-embedded graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; National Science Foundation","keywords":"Cycle basis; Mathematics; Combinatorics; Homology (biology); Basis (linear algebra); Minimum weight; Graph; Discrete mathematics; Line graph; Graph power; Geometry","score_opus":0.012965189556991682,"score_gpt":0.23298692041010693,"score_spread":0.22002173085311524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963119423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5055053,0.0004917519,0.48320532,0.0006213189,0.000036718287,0.00016442787,0.0006300844,0.0010254796,0.0083195465],"genre_scores_gemma":[0.6918324,0.00037384694,0.29954585,0.000092882925,0.000043454544,0.00022239656,0.0020191094,0.00028919417,0.005580832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995989,0.00007782908,0.000017075467,0.000111498084,0.00010972666,0.000084985135],"domain_scores_gemma":[0.99873513,0.00064157794,0.00014619746,0.00017946429,0.0001582728,0.00013936404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037200857,0.00061971194,0.0008053485,0.0012584949,0.000690473,0.0012436191,0.0016495389,0.000994314,0.00398461],"category_scores_gemma":[0.0031263283,0.0004948272,0.0005652854,0.0012022377,0.0008831624,0.00285136,0.0016139445,0.0011422884,0.0007371162],"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.00046573722,0.00028902086,0.004213291,0.00043657454,0.00007385757,0.00027770063,0.000885281,0.3693293,0.02647547,0.32952258,0.0073987534,0.2606325],"study_design_scores_gemma":[0.00005546597,0.00007393822,0.00056797906,0.000030429239,0.000013486022,0.000083039,0.00020573821,0.6315353,0.006915691,0.35744682,0.003048824,0.000023218992],"about_ca_topic_score_codex":0.002231923,"about_ca_topic_score_gemma":0.0024930146,"teacher_disagreement_score":0.00398461,"about_ca_system_score_codex":0.0009874259,"about_ca_system_score_gemma":0.0007644155,"threshold_uncertainty_score":0.013329804},"labels":[],"label_agreement":null},{"id":"W2963492452","doi":"10.20382/jocg.v11i2a2","title":"Exact computation of the matching distance on 2-parameter persistence modules","year":2020,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Persistence (discontinuity); Computation; Computer science; Matching (statistics); Algorithm; Mathematics; Statistics; Engineering","score_opus":0.024910838561059138,"score_gpt":0.2164718685251791,"score_spread":0.19156102996411997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963492452","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.40184548,0.00029271905,0.5909354,0.00013761623,0.000026805994,0.00004676609,0.0003332427,0.00062969775,0.0057522403],"genre_scores_gemma":[0.9209528,0.000108152926,0.07615606,0.000031444295,0.000026612825,0.00005589382,0.0003526425,0.00014103299,0.0021754005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945897,0.00009861769,0.000036086734,0.00014271274,0.00017631697,0.00008723522],"domain_scores_gemma":[0.99859077,0.0005876166,0.00020554569,0.00030837968,0.00017509288,0.00013253382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007769957,0.00044212176,0.00066776265,0.001592995,0.0004273822,0.0015587586,0.0009310113,0.0006383647,0.004309189],"category_scores_gemma":[0.0050405716,0.00025552238,0.00033253865,0.0010726466,0.00094944553,0.0050472314,0.0022279953,0.00086224044,0.00069690845],"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.00030437871,0.00010974529,0.0054853577,0.00030185786,0.00005727013,0.0002930522,0.00040555277,0.11539662,0.01675232,0.7470638,0.0024839223,0.11134612],"study_design_scores_gemma":[0.000024287425,0.00009769535,0.0015319275,0.000020916194,0.000011701075,0.00016317185,0.00010422751,0.47612014,0.006809817,0.5122952,0.0027862207,0.000034637447],"about_ca_topic_score_codex":0.00040959168,"about_ca_topic_score_gemma":0.00052867434,"teacher_disagreement_score":0.004309189,"about_ca_system_score_codex":0.00086366467,"about_ca_system_score_gemma":0.00044524198,"threshold_uncertainty_score":0.014415622},"labels":[],"label_agreement":null},{"id":"W2963712264","doi":"10.20382/jocg.v4i1a6","title":"Simplicial flat norm with scale","year":2012,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Simplicial approximation theorem; Simplicial homology; Simplicial complex; Mathematics; Abstract simplicial complex; Simplicial manifold; h-vector; Simplicial set; Betti number; Norm (philosophy); Combinatorics; Bounding overwatch; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.009232245547067383,"score_gpt":0.20229480824700038,"score_spread":0.193062562699933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963712264","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.1942846,0.0003549282,0.7986446,0.00053154863,0.000065372835,0.000058125064,0.00028972482,0.00084769906,0.004923359],"genre_scores_gemma":[0.7362458,0.0002121147,0.2586857,0.00018838848,0.00008506921,0.000093866176,0.0007908211,0.00037299856,0.003325283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925286,0.00012706792,0.000038914182,0.00020684351,0.000267882,0.00010638876],"domain_scores_gemma":[0.99761534,0.001209559,0.00023804075,0.00044688565,0.0002777315,0.00021247249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132801,0.0005952612,0.00092772476,0.0012790541,0.0006632159,0.002042616,0.0011383579,0.0008569525,0.0031296231],"category_scores_gemma":[0.007585435,0.00038571577,0.000793382,0.0011543564,0.0017586456,0.00529168,0.0023335668,0.0014555341,0.00039063662],"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.00022534795,0.00010279536,0.005072513,0.0002241932,0.000054209653,0.00021229038,0.00048234776,0.3230723,0.007862638,0.5672138,0.0038003176,0.09167722],"study_design_scores_gemma":[0.000009563614,0.000034616067,0.00047043356,0.0000123341715,0.000007403959,0.000063690975,0.00010688929,0.7060736,0.0024259926,0.289065,0.0017145122,0.000016048178],"about_ca_topic_score_codex":0.0028861128,"about_ca_topic_score_gemma":0.0034583483,"teacher_disagreement_score":0.0031296231,"about_ca_system_score_codex":0.0012727876,"about_ca_system_score_gemma":0.00058276864,"threshold_uncertainty_score":0.010469675},"labels":[],"label_agreement":null},{"id":"W2963964459","doi":"10.20382/jocg.v7i2a3","title":"Shortest path in a polygon using sublinear space","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Sublinear function; Mathematics; Polygon (computer graphics); Simple polygon; Shortest path problem; Combinatorics; Path (computing); Space (punctuation); Constant (computer programming); K shortest path routing; Time complexity; Discrete mathematics; Algorithm; Monotone polygon; Computer science; Graph; Geometry","score_opus":0.03357880101853126,"score_gpt":0.24181612233605343,"score_spread":0.20823732131752218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963964459","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.06458521,0.00031041424,0.92074394,0.00096111983,0.00009791466,0.000065622975,0.00030673872,0.0024188163,0.010510176],"genre_scores_gemma":[0.40991765,0.00034553904,0.5789321,0.000273802,0.00008223262,0.00024124846,0.0008669888,0.00068242906,0.008658073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901175,0.00021205866,0.00004772938,0.00026339106,0.00032892436,0.0001360873],"domain_scores_gemma":[0.99798834,0.0012643661,0.00014532224,0.00034898912,0.0001753516,0.000077570854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064497546,0.0007426091,0.00086466054,0.0006049451,0.000606981,0.0015566872,0.0012526851,0.00074903195,0.0064947824],"category_scores_gemma":[0.005282702,0.0003713557,0.000903687,0.0011416461,0.0010473591,0.0037976294,0.0021139826,0.001803314,0.001177312],"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.0009093066,0.0001949311,0.0018525935,0.0005500144,0.00009651032,0.00027679626,0.0004708784,0.49944624,0.016240105,0.19698459,0.01737732,0.2656008],"study_design_scores_gemma":[0.000055729302,0.00006008158,0.00017438251,0.000011970222,0.0000135671435,0.000050795315,0.000055795885,0.9093714,0.0044117705,0.08188692,0.0038981847,0.000009379062],"about_ca_topic_score_codex":0.00330192,"about_ca_topic_score_gemma":0.004380537,"teacher_disagreement_score":0.0064947824,"about_ca_system_score_codex":0.0012590584,"about_ca_system_score_gemma":0.0012428133,"threshold_uncertainty_score":0.021727264},"labels":[],"label_agreement":null},{"id":"W2964027251","doi":"10.20382/jocg.v7i1a12","title":"An algorithm for the Euclidean cell decomposition of a non-compact strictly convex projective surface","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council","keywords":"Mathematics; Euclidean geometry; Regular polygon; Convex body; Projective test; Decomposition; Surface (topology); Algorithm; Combinatorics; Computer science; Pure mathematics; Convex optimization; Geometry; Chemistry","score_opus":0.018727385570210524,"score_gpt":0.26946614948031444,"score_spread":0.2507387639101039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964027251","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.015600761,0.000046253936,0.9813742,0.000052782256,0.000028667946,0.000044198063,0.000088023,0.0008601335,0.0019049821],"genre_scores_gemma":[0.15415326,0.00008733769,0.8394845,0.00004748649,0.000012722795,0.00010966873,0.0007413395,0.00048610187,0.004877483],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977094,0.000025726877,0.000019495967,0.00004711795,0.00009731497,0.00003935309],"domain_scores_gemma":[0.9996767,0.00008683451,0.000016757076,0.00008938697,0.000101516256,0.000028718916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034983773,0.00043517942,0.00056978076,0.0008044354,0.0003225278,0.0010136965,0.0013427646,0.0005618433,0.0063303313],"category_scores_gemma":[0.0015272108,0.00035880486,0.00057610933,0.0007213847,0.00045409403,0.0011276095,0.0017981105,0.0012110809,0.0022687064],"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.0002577243,0.00010034116,0.0019533986,0.00021179233,0.000050393144,0.0003315608,0.0005736505,0.112407476,0.04455973,0.14507759,0.010490217,0.6839862],"study_design_scores_gemma":[0.000073428724,0.00010202468,0.00053886214,0.000024923042,0.000017896285,0.00020575478,0.00018850695,0.8911984,0.020940794,0.06362153,0.02305478,0.000033107655],"about_ca_topic_score_codex":0.001995682,"about_ca_topic_score_gemma":0.0033512819,"teacher_disagreement_score":0.0063303313,"about_ca_system_score_codex":0.0004772732,"about_ca_system_score_gemma":0.0005753072,"threshold_uncertainty_score":0.021177113},"labels":[],"label_agreement":null},{"id":"W2964178647","doi":"10.20382/jocg.v7i2a8","title":"$1$-string $B_2$-VPG representation of planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Planar; Planar graph; String (physics); Enhanced Data Rates for GSM Evolution; Graph; Representation (politics); Grid; Geometry; Computer science; Telecommunications","score_opus":0.015875335257328694,"score_gpt":0.22345510327284096,"score_spread":0.20757976801551226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964178647","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.07979106,0.00016779278,0.885737,0.000524844,0.00012682792,0.00013351021,0.0010582311,0.0018574129,0.030603332],"genre_scores_gemma":[0.5124783,0.00043729425,0.4706565,0.00031543223,0.0000750819,0.0003502191,0.002964625,0.00050463283,0.012217885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999595,0.00007568247,0.000023920093,0.000091959206,0.0001360602,0.00007731301],"domain_scores_gemma":[0.99950683,0.00012344038,0.00006269516,0.00016515894,0.000110561676,0.000031282754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022778993,0.0005369326,0.00046335382,0.0006994032,0.000534857,0.0015058181,0.00090924173,0.0008736411,0.011283222],"category_scores_gemma":[0.0018051827,0.00031753816,0.00053449697,0.0010710291,0.0007520581,0.0023624112,0.0014403139,0.001251954,0.0025219193],"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.00027526074,0.000109162735,0.0009865563,0.0002856788,0.00002692976,0.0005609244,0.0004970638,0.07611959,0.020658795,0.68798596,0.015387191,0.19710694],"study_design_scores_gemma":[0.00005904234,0.00013105063,0.0005621108,0.000085758096,0.000037086065,0.000671313,0.00035953702,0.28029168,0.013457674,0.6492058,0.055095207,0.000043769804],"about_ca_topic_score_codex":0.0008991623,"about_ca_topic_score_gemma":0.0007895266,"teacher_disagreement_score":0.011283222,"about_ca_system_score_codex":0.00046751692,"about_ca_system_score_gemma":0.00039428665,"threshold_uncertainty_score":0.03774613},"labels":[],"label_agreement":null},{"id":"W2964200445","doi":"10.20382/jocg.v8i2a2","title":"Degree four plane spanners: Simpler and better","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spanner; Combinatorics; Degree (music); Mathematics; Upper and lower bounds; Equilateral triangle; Bounded function; Euclidean geometry; Delaunay triangulation; Plane (geometry); General position; Geometry; Physics; Mathematical analysis","score_opus":0.036005960153360064,"score_gpt":0.2348440229917289,"score_spread":0.19883806283836886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964200445","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.3393907,0.0009932768,0.61959743,0.00072786974,0.00022821085,0.00026225034,0.00046958824,0.0021071895,0.036223445],"genre_scores_gemma":[0.61695814,0.0008436963,0.3569898,0.00044224632,0.00013986882,0.00024760183,0.0018823157,0.0009271061,0.021569133],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889225,0.00014466036,0.00007576853,0.0003466163,0.00035510896,0.0001856321],"domain_scores_gemma":[0.9981614,0.000323374,0.0001882908,0.00091419305,0.00017912204,0.00023374913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051299843,0.0009911116,0.0009846039,0.00069041515,0.0006500822,0.0016392564,0.0013575708,0.0010804964,0.011470933],"category_scores_gemma":[0.0026030787,0.00053629326,0.0010381276,0.0010249682,0.0012330408,0.005407849,0.003517477,0.002131517,0.0027556182],"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.0009385064,0.0006307573,0.0054491092,0.001202916,0.00015792441,0.0009922828,0.001523605,0.15263024,0.122163944,0.32900143,0.009580761,0.37572855],"study_design_scores_gemma":[0.0003804503,0.0023966983,0.0045922915,0.0004170805,0.00022438265,0.0023767466,0.0015504003,0.35841164,0.10926115,0.39568937,0.12445281,0.00024700694],"about_ca_topic_score_codex":0.0008619645,"about_ca_topic_score_gemma":0.0018821259,"teacher_disagreement_score":0.011470933,"about_ca_system_score_codex":0.0006661917,"about_ca_system_score_gemma":0.00050095696,"threshold_uncertainty_score":0.038374126},"labels":[],"label_agreement":null},{"id":"W2970343152","doi":"10.20382/jocg.v10i2a3","title":"Orthogonal Terrain Guarding is NP-complete","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Terrain; Combinatorics; Vertex (graph theory); Mathematics; Order (exchange); Monotone polygon; Algorithm; Geometry; Graph; Geography; Cartography","score_opus":0.010550889057796328,"score_gpt":0.20784771048753956,"score_spread":0.19729682142974322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970343152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3881881,0.009362159,0.37635168,0.032909106,0.0012392253,0.00115221,0.045251876,0.008960765,0.13658494],"genre_scores_gemma":[0.7873183,0.0057745255,0.13531955,0.0043358663,0.0009873755,0.00077625446,0.029718624,0.0012163263,0.034553126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815065,0.0001876744,0.0000917542,0.00071785727,0.00038102505,0.0004710612],"domain_scores_gemma":[0.99511564,0.0035088146,0.00035369044,0.00045429045,0.0003098435,0.00025762882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067781634,0.001620097,0.002290454,0.00058458163,0.0019397921,0.0041930513,0.0023448607,0.0018407537,0.013343624],"category_scores_gemma":[0.0037134644,0.0009998274,0.0020875193,0.0022210872,0.0019055652,0.006072167,0.0024796652,0.004324261,0.002228677],"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.002457108,0.0012833051,0.007078646,0.0052540195,0.000670401,0.0020384523,0.0011166659,0.33582416,0.019069692,0.16359964,0.2239489,0.23765902],"study_design_scores_gemma":[0.0007170196,0.0002528671,0.002875067,0.00021231301,0.00025783823,0.0020389087,0.0010097807,0.4161102,0.008551676,0.5054498,0.062429696,0.00009488939],"about_ca_topic_score_codex":0.00825574,"about_ca_topic_score_gemma":0.009075311,"teacher_disagreement_score":0.013343624,"about_ca_system_score_codex":0.0026233143,"about_ca_system_score_gemma":0.0026260442,"threshold_uncertainty_score":0.044638872},"labels":[],"label_agreement":null},{"id":"W2971946515","doi":"10.20382/jocg.v6i1a1","title":"On a Conjecture of Lovász on Circle-Representations of Simple 4-Regular Planar Graphs","year":2012,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund","keywords":"Combinatorics; Planar graph; Mathematics; Conjecture; Simple (philosophy); Discrete mathematics; Realization (probability); Intersection (aeronautics); Graph","score_opus":0.018798535108596904,"score_gpt":0.2717825177839632,"score_spread":0.25298398267536626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971946515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82372135,0.0012997899,0.10891415,0.013595439,0.0002542501,0.0001120826,0.001253078,0.0009579243,0.049891915],"genre_scores_gemma":[0.9771788,0.00058049697,0.016824404,0.00068976235,0.00019546972,0.000086581975,0.0007303665,0.000078885605,0.0036352098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762076,0.0004865166,0.00014820368,0.0008342792,0.00038898544,0.0005211886],"domain_scores_gemma":[0.98748404,0.007836817,0.0010959258,0.0019432753,0.0007153111,0.00092456094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558092,0.0007358277,0.0013867016,0.0011352752,0.0027647847,0.004000753,0.002025026,0.002809294,0.009350071],"category_scores_gemma":[0.015426842,0.000899228,0.0011771881,0.001928407,0.0065435446,0.00792038,0.0038682865,0.0032531328,0.0013046253],"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.0009514394,0.0001306797,0.0039895982,0.00025258333,0.00003680637,0.00035380546,0.001597393,0.022700658,0.005441183,0.93040204,0.013757164,0.020386772],"study_design_scores_gemma":[0.00018975911,0.00012429501,0.0016712432,0.000059406146,0.000043066,0.00037265415,0.0007692306,0.031982943,0.0041494826,0.94713914,0.013410792,0.00008797327],"about_ca_topic_score_codex":0.003294327,"about_ca_topic_score_gemma":0.0020352858,"teacher_disagreement_score":0.009350071,"about_ca_system_score_codex":0.0022665316,"about_ca_system_score_gemma":0.0008418936,"threshold_uncertainty_score":0.031279087},"labels":[],"label_agreement":null},{"id":"W3023761765","doi":"10.20382/jocg.v11i1a1","title":"On optimal polyline simplification using the Hausdorff and Fréchet distance","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hausdorff distance; Subsequence; Combinatorics; Hausdorff space; Line segment; Line (geometry); Time complexity; Algorithm; Geometry; Mathematical analysis","score_opus":0.015877394298005575,"score_gpt":0.2400329222241248,"score_spread":0.22415552792611923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023761765","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.03623426,0.0005066727,0.95620245,0.00025341442,0.000044522356,0.00007270491,0.0001492067,0.0007815695,0.0057551577],"genre_scores_gemma":[0.3015755,0.00074943627,0.69254684,0.00011933427,0.0000940387,0.0001204348,0.00081484555,0.00048676843,0.0034927842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832016,0.00026718923,0.00010458173,0.00036833156,0.0007111609,0.00022850987],"domain_scores_gemma":[0.99726534,0.0015409156,0.0002516728,0.0005494314,0.00028199056,0.00011069079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009312194,0.00090975955,0.0016209664,0.0013812996,0.000987703,0.0016171687,0.001477307,0.0010776094,0.004811593],"category_scores_gemma":[0.006183542,0.0005348593,0.001282046,0.0024027205,0.0016121906,0.0036004917,0.0018347026,0.0015296405,0.00096173276],"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.00023317918,0.00013758046,0.0011256099,0.0003578489,0.00007501951,0.00019339072,0.0002828794,0.66769135,0.012390227,0.09361497,0.004916952,0.218981],"study_design_scores_gemma":[0.00003562157,0.000089732486,0.0004850351,0.000030158093,0.000022193432,0.00010573465,0.0000843159,0.93119305,0.008694714,0.053999387,0.0052341353,0.000025852942],"about_ca_topic_score_codex":0.0032383034,"about_ca_topic_score_gemma":0.0036835647,"teacher_disagreement_score":0.004811593,"about_ca_system_score_codex":0.0015193318,"about_ca_system_score_gemma":0.0009400912,"threshold_uncertainty_score":0.016096354},"labels":[],"label_agreement":null},{"id":"W3037345875","doi":"10.20382/jocg.v13i1a8","title":"A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Euclidean space; Combinatorics; Mathematics; Approximation algorithm; Transportation theory; Linear space; Euclidean distance; Euclidean geometry; Point (geometry); Function (biology); Facility location problem; Space (punctuation); Mathematical optimization; Discrete mathematics; Computer science; Geometry","score_opus":0.010761878942917812,"score_gpt":0.18444697886091282,"score_spread":0.17368509991799502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037345875","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.019226562,0.00029414785,0.96912587,0.00046328545,0.00010333797,0.00014900348,0.00041276668,0.0035395618,0.006685453],"genre_scores_gemma":[0.19416852,0.00025322867,0.79174745,0.00025947177,0.00010132978,0.0004146525,0.0016447832,0.00067365426,0.0107367905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853027,0.00022315656,0.00009032399,0.00039411246,0.00046249235,0.00029960918],"domain_scores_gemma":[0.9980895,0.00079381943,0.00013878444,0.00057934766,0.0002404612,0.00015814319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001703753,0.0017588616,0.0019340713,0.0010577333,0.001397484,0.0026823694,0.004889016,0.00227931,0.015100408],"category_scores_gemma":[0.0054537165,0.00069064717,0.0019751536,0.0025168865,0.0013134029,0.0049991077,0.0038588613,0.0033306407,0.0039751194],"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.00093449315,0.00029500775,0.0008189129,0.00028530223,0.00007531903,0.00012774512,0.00028146827,0.6802368,0.004039225,0.111072995,0.014550913,0.18728182],"study_design_scores_gemma":[0.00006189605,0.000038678296,0.000053597476,0.000011121272,0.000012850397,0.00002396705,0.000027392252,0.96958894,0.00059637637,0.027304824,0.0022717665,0.000008538531],"about_ca_topic_score_codex":0.013627513,"about_ca_topic_score_gemma":0.01630013,"teacher_disagreement_score":0.015100408,"about_ca_system_score_codex":0.004286787,"about_ca_system_score_gemma":0.0035948185,"threshold_uncertainty_score":0.05051595},"labels":[],"label_agreement":null},{"id":"W3037925904","doi":"10.20382/jocg.v8i1a14","title":"Central Trajectories","year":2015,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Danmarks Grundforskningsfond; National Research Foundation","keywords":"Trajectory; Centrality; Combinatorics; RADIUS; Cluster (spacecraft); Cluster analysis; Set (abstract data type); Physics; Mathematics; Computer science","score_opus":0.021899771686030044,"score_gpt":0.22805388347335698,"score_spread":0.20615411178732693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037925904","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.06365273,0.0008794587,0.8784262,0.00107769,0.00034885583,0.00048379877,0.0059983255,0.006632131,0.042500794],"genre_scores_gemma":[0.38531926,0.00081642607,0.54398525,0.0004735169,0.0001485716,0.0006238278,0.016397597,0.0028866737,0.04934888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983234,0.0001849399,0.00010118159,0.00077834027,0.00034834453,0.00026383757],"domain_scores_gemma":[0.9972452,0.0004985393,0.0002736179,0.00108554,0.0006486112,0.0002484936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082643755,0.0012967279,0.001199104,0.0014269209,0.002269135,0.0033572628,0.0024360814,0.0018079791,0.04518461],"category_scores_gemma":[0.005439025,0.00068035943,0.0014400759,0.0018094471,0.0011722099,0.0045066644,0.004078055,0.0017938825,0.011341427],"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.0014647268,0.00025115008,0.0066240006,0.0008789488,0.00016293378,0.0008084713,0.0009871192,0.17933042,0.02237947,0.4365925,0.075555906,0.27496433],"study_design_scores_gemma":[0.00013018347,0.00021813693,0.0021308511,0.00017782894,0.000083200066,0.0009213322,0.0008058692,0.5452171,0.021061527,0.3160244,0.11312423,0.00010528552],"about_ca_topic_score_codex":0.0046465145,"about_ca_topic_score_gemma":0.006685174,"teacher_disagreement_score":0.04518461,"about_ca_system_score_codex":0.0022871231,"about_ca_system_score_gemma":0.0024906998,"threshold_uncertainty_score":0.15115756},"labels":[],"label_agreement":null},{"id":"W3046659318","doi":"10.20382/jocg.v10i1a17","title":"Interesting paths in the mapper complex","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Path (computing); Graph; Enhanced Data Rates for GSM Evolution; Data point; Binary number; Function (biology); Variable (mathematics); Algorithm; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.028764422130967734,"score_gpt":0.24245818655587084,"score_spread":0.21369376442490312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046659318","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.32668382,0.00041444416,0.6643578,0.0007746545,0.000039987237,0.00013913169,0.0017393859,0.0013365734,0.0045141308],"genre_scores_gemma":[0.63051826,0.00036439113,0.36113015,0.0001962316,0.000037196205,0.00027687213,0.0024197884,0.0004953916,0.0045616664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891126,0.00022429976,0.000059796585,0.00034517955,0.0003578917,0.00010169288],"domain_scores_gemma":[0.9959306,0.0021858346,0.0005594666,0.00047864649,0.0005385708,0.00030695926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012548801,0.00066248555,0.0008004405,0.0032566213,0.0009472598,0.0024293198,0.0008248888,0.0010543775,0.003932001],"category_scores_gemma":[0.010187442,0.00061157777,0.0008205496,0.0016807042,0.0013024316,0.003642294,0.002246684,0.001052762,0.0005736601],"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.00036724994,0.0001559822,0.030836845,0.00051897834,0.00015829282,0.0015589856,0.0020982015,0.40567628,0.022677407,0.37978506,0.007903479,0.14826325],"study_design_scores_gemma":[0.000025648185,0.00007172387,0.005179251,0.000048522932,0.00003065871,0.00047997612,0.00036883054,0.670081,0.004572223,0.30775648,0.011343551,0.000042052812],"about_ca_topic_score_codex":0.0021637978,"about_ca_topic_score_gemma":0.0026142334,"teacher_disagreement_score":0.003932001,"about_ca_system_score_codex":0.0010615106,"about_ca_system_score_gemma":0.0006725095,"threshold_uncertainty_score":0.013153851},"labels":[],"label_agreement":null},{"id":"W3046875671","doi":"10.20382/jocg.v10i1a9","title":"Simplices modelled on spaces of constant curvature","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission","keywords":"Mathematics; Sectional curvature; Constant curvature; Constant (computer programming); Degeneracy (biology); Curvature; Manifold (fluid mechanics); Euclidean geometry; Riemannian manifold; Pure mathematics; Mathematical analysis; Geometry; Scalar curvature; Computer science","score_opus":0.05500991867050343,"score_gpt":0.3049519675806311,"score_spread":0.24994204891012767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046875671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48905256,0.0009122837,0.48332393,0.00095387665,0.000089374866,0.00008042653,0.0006513123,0.00020073955,0.02473552],"genre_scores_gemma":[0.9484304,0.00037183432,0.045058988,0.00010153283,0.00005088175,0.000058689664,0.00048752964,0.00012542521,0.0053147506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975389,0.0006584924,0.00018202749,0.00042210764,0.00083775696,0.0003606443],"domain_scores_gemma":[0.9888531,0.00464854,0.00182281,0.0016297218,0.0017298256,0.0013160366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029952032,0.00092354964,0.0011719039,0.0035309484,0.0011972067,0.004283436,0.0017897306,0.00194036,0.0042081005],"category_scores_gemma":[0.014890659,0.00065750704,0.0012245879,0.0011008034,0.003866589,0.0061303796,0.0042953338,0.002451128,0.0005582548],"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.000044327673,0.000018013669,0.0013713255,0.00004624204,0.000021334774,0.00014851811,0.00023639768,0.02326243,0.0012521906,0.9708759,0.00029049278,0.0024327186],"study_design_scores_gemma":[0.000013490051,0.000054909142,0.0014811925,0.00006162037,0.000018711851,0.00018697644,0.00024354835,0.26822978,0.0013457965,0.7260254,0.002294095,0.00004447624],"about_ca_topic_score_codex":0.0023583667,"about_ca_topic_score_gemma":0.0021448652,"teacher_disagreement_score":0.004283436,"about_ca_system_score_codex":0.002496887,"about_ca_system_score_gemma":0.00048156315,"threshold_uncertainty_score":0.018116236},"labels":[],"label_agreement":null},{"id":"W3081710876","doi":"10.20382/jocg.v11i1a4","title":"Rigid foldability is NP-hard","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Emerging Frontiers in Research and Innovation; Japan Society for the Promotion of Science; National Science Foundation","keywords":"Intersection (aeronautics); Combinatorics; Vertex (graph theory); Partition (number theory); Mathematics; Folding (DSP implementation); Planar; Reduction (mathematics); Kinematics; Flexibility (engineering); Plane (geometry); Algorithm; Computer science; Geometry; Graph; Physics; Structural engineering; Engineering; Classical mechanics","score_opus":0.008976801698028948,"score_gpt":0.19852883926875958,"score_spread":0.18955203757073064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081710876","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.39970425,0.0029133519,0.4492346,0.02406368,0.0008461968,0.00074404164,0.012231117,0.003335813,0.10692699],"genre_scores_gemma":[0.8516693,0.001742766,0.095559016,0.0035698311,0.00064839446,0.0007952458,0.013594535,0.0008665677,0.03155439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837554,0.00028004692,0.00008525219,0.00056071195,0.00033094693,0.00036747707],"domain_scores_gemma":[0.98910135,0.009266809,0.00039644193,0.00054359075,0.0003959715,0.00029585313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069581275,0.001263871,0.0016009094,0.0006295323,0.0018841522,0.00430327,0.002389551,0.0024374977,0.01399536],"category_scores_gemma":[0.006135937,0.0008273133,0.0023044136,0.0011679066,0.0022710164,0.0055869785,0.0026098173,0.0051344596,0.0018641709],"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.0017499757,0.0013258645,0.0062258816,0.0031902073,0.0006935829,0.0025845584,0.0012366939,0.41172495,0.02719458,0.3105537,0.09404328,0.13947673],"study_design_scores_gemma":[0.00023936591,0.00013703154,0.0012556514,0.00010755945,0.00013129998,0.00082512706,0.00054381863,0.23633458,0.008045677,0.73434997,0.017965687,0.00006426682],"about_ca_topic_score_codex":0.0024093988,"about_ca_topic_score_gemma":0.0027454293,"teacher_disagreement_score":0.01399536,"about_ca_system_score_codex":0.0014371736,"about_ca_system_score_gemma":0.0014082132,"threshold_uncertainty_score":0.04681909},"labels":[],"label_agreement":null},{"id":"W3082140337","doi":"10.20382/jocg.v11i1a6","title":"On the planar edge-length ratio of planar graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020 Framework Programme; Ministero dell’Istruzione, dell’Università e della Ricerca; Università degli Studi Roma Tre","keywords":"Combinatorics; Mathematics; Planar graph; Planar; Bipartite graph; Outerplanar graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Book embedding; Pathwidth; Graph; Line graph; Computer science","score_opus":0.010286293005946646,"score_gpt":0.19753086276732693,"score_spread":0.1872445697613803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082140337","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.34861603,0.008622094,0.50249356,0.003279331,0.00022330412,0.00018128908,0.0012023038,0.0018620305,0.13352011],"genre_scores_gemma":[0.8913186,0.006578181,0.09296483,0.00069359964,0.00039274435,0.00022816945,0.0010097958,0.0009709916,0.0058430796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969277,0.00081905955,0.000121975914,0.00063453714,0.00093982054,0.00055701914],"domain_scores_gemma":[0.98211354,0.013559098,0.0014859134,0.0011735004,0.0011125868,0.00055527204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018576204,0.0016124647,0.0010400286,0.0039843265,0.001216279,0.0024279314,0.0020791187,0.0011400073,0.009166573],"category_scores_gemma":[0.02429942,0.0007575351,0.0007756131,0.003472941,0.0025173558,0.006225539,0.0028238788,0.0024482997,0.0022150574],"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.0012103085,0.00031631233,0.007568173,0.0007113255,0.00017217443,0.00072132796,0.0006537367,0.25103536,0.046513792,0.49052784,0.017301654,0.18326792],"study_design_scores_gemma":[0.00010075703,0.0003407741,0.0051178453,0.00021010537,0.0001946685,0.0019098357,0.00059703714,0.43852472,0.034208216,0.49508047,0.023572413,0.00014318332],"about_ca_topic_score_codex":0.0014469492,"about_ca_topic_score_gemma":0.0009102763,"teacher_disagreement_score":0.009166573,"about_ca_system_score_codex":0.0017984991,"about_ca_system_score_gemma":0.00060026656,"threshold_uncertainty_score":0.030665219},"labels":[],"label_agreement":null},{"id":"W3090078726","doi":"10.20382/jocg.v11i1a11","title":"An improved cost function for hierarchical cluster trees","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ohio State University; National Science Foundation","keywords":"Hierarchical clustering; Cluster analysis; Granularity; Tree (set theory); Function (biology); Mathematics; Graph; Similarity (geometry); Tree structure; Computer science; Set (abstract data type); Hierarchical clustering of networks; Data mining; Algorithm; Correlation clustering; Combinatorics; CURE data clustering algorithm; Artificial intelligence; Statistics","score_opus":0.012001304747632493,"score_gpt":0.26031672254219884,"score_spread":0.24831541779456634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090078726","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.011429044,0.0005326101,0.98368734,0.00052462687,0.00009368736,0.0001477529,0.00024932457,0.00038500974,0.0029506392],"genre_scores_gemma":[0.25271446,0.0007181219,0.734918,0.0004585945,0.00020470629,0.00062747265,0.001367736,0.0006242662,0.008366722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703705,0.000917497,0.00015496789,0.0003522382,0.0011908896,0.00034728524],"domain_scores_gemma":[0.99499476,0.0021459726,0.00030797473,0.000537781,0.0017193169,0.0002942886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036450154,0.0014091992,0.001864888,0.0024410426,0.0011098007,0.001913223,0.0036006456,0.003036758,0.0056217476],"category_scores_gemma":[0.011810967,0.0005466718,0.0015149782,0.0033943276,0.0009888894,0.0051978584,0.002322358,0.002611193,0.0011465187],"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.00023335218,0.00016653979,0.0014301876,0.00025976988,0.00006737715,0.0001610842,0.00013900224,0.703162,0.0043088556,0.11484453,0.014141619,0.16108571],"study_design_scores_gemma":[0.0000122640895,0.000046970123,0.00025340382,0.000016695663,0.00001077916,0.00006745964,0.000018812281,0.97824734,0.0007039233,0.017823065,0.0027854622,0.000013695365],"about_ca_topic_score_codex":0.005589978,"about_ca_topic_score_gemma":0.0046326965,"teacher_disagreement_score":0.0056217476,"about_ca_system_score_codex":0.0033516975,"about_ca_system_score_gemma":0.0025431484,"threshold_uncertainty_score":0.024318397},"labels":[],"label_agreement":null},{"id":"W3105922857","doi":"10.20382/jocg.v5i1a10","title":"Steinitz theorems for simple orthogonal polyhedra","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; National Science Foundation","keywords":"Polyhedron; Combinatorics; Polyhedral graph; Vertex (graph theory); Mathematics; Bipartite graph; Dual polyhedron; Regular polygon; Graph; 1-planar graph; Line graph; Geometry","score_opus":0.010062048692386947,"score_gpt":0.2102579755694352,"score_spread":0.20019592687704826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105922857","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.099774726,0.00033739643,0.832544,0.00037687208,0.00013318892,0.0001286958,0.00046877915,0.00041345513,0.06582282],"genre_scores_gemma":[0.7434509,0.0008642524,0.22564049,0.0004221695,0.00018356572,0.00030944988,0.0011338757,0.00027431248,0.027721059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940443,0.00008279839,0.000034091987,0.00011610862,0.00025285326,0.00010982569],"domain_scores_gemma":[0.9987186,0.00048437095,0.00016218238,0.00019640826,0.00031172787,0.00012682303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448526,0.0006198437,0.0004854625,0.0017903834,0.0009719788,0.0016817285,0.00087613566,0.000610409,0.0087849405],"category_scores_gemma":[0.0035609403,0.00035427877,0.0008005034,0.001167737,0.0017699391,0.002582741,0.0018703421,0.0014098214,0.0014960057],"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.000012922422,0.000009638986,0.00016665693,0.000027248216,0.0000033793874,0.00003670906,0.00007059303,0.0048408024,0.0006992508,0.98220956,0.001107693,0.010815453],"study_design_scores_gemma":[0.0000132033465,0.000017665941,0.00017826966,0.00001111899,0.000004086997,0.00006913448,0.00008721834,0.031315655,0.0011190905,0.9609293,0.00624445,0.000010809329],"about_ca_topic_score_codex":0.0014957715,"about_ca_topic_score_gemma":0.0015273084,"teacher_disagreement_score":0.0087849405,"about_ca_system_score_codex":0.0009038803,"about_ca_system_score_gemma":0.00056793465,"threshold_uncertainty_score":0.029388607},"labels":[],"label_agreement":null},{"id":"W3112638984","doi":"10.20382/jocg.v13i1a3","title":"Improved polytope volume calculations based on Hamiltonian Monte Carlo with boundary reflections and sweet arithmetics","year":2021,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Monte Carlo method; Polytope; Mathematics; Hamiltonian (control theory); Arithmetic; Geometry; Mathematical optimization; Statistics","score_opus":0.03433791763792107,"score_gpt":0.29557554371501976,"score_spread":0.26123762607709866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112638984","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.092963986,0.00028272084,0.89420044,0.00024933473,0.000112719936,0.00005362135,0.00009449863,0.00091158244,0.011131008],"genre_scores_gemma":[0.64645606,0.00015527234,0.34940216,0.00014985622,0.000058676367,0.00014846261,0.00019122665,0.0005790338,0.0028591983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992718,0.00024080848,0.000024089311,0.000066949804,0.0003040327,0.00009239178],"domain_scores_gemma":[0.99803084,0.0010737508,0.00010058199,0.00048351742,0.00019956511,0.00011183938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291655,0.00041793103,0.0010160034,0.0007457329,0.0006721923,0.0011402549,0.0014335314,0.00079138635,0.0040719453],"category_scores_gemma":[0.0052741393,0.00031531273,0.0005643113,0.00072578795,0.0015630465,0.0015731496,0.0015889284,0.0015004978,0.00055746944],"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.00010995691,0.00007459886,0.00080643257,0.00007503374,0.000030946194,0.00009597758,0.00013444708,0.63264287,0.0029270966,0.33211464,0.0013939887,0.029594002],"study_design_scores_gemma":[0.000008764917,0.000014530851,0.000052763175,0.00000554182,0.0000028038974,0.000008912,0.0000088652505,0.959935,0.00077108474,0.038646307,0.000539072,0.000006408387],"about_ca_topic_score_codex":0.002423339,"about_ca_topic_score_gemma":0.0032081415,"teacher_disagreement_score":0.0040719453,"about_ca_system_score_codex":0.0007579319,"about_ca_system_score_gemma":0.0009339787,"threshold_uncertainty_score":0.0136220455},"labels":[],"label_agreement":null},{"id":"W3135217630","doi":"10.20382/jocg.v11i2a7","title":"Topological data analysis in information space","year":2020,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Austrian Science Fund; Deutsche Forschungsgemeinschaft","keywords":"Simplex; Histogram; Context (archaeology); Euclidean space; Mathematics; Euclidean geometry; Point (geometry); Topological data analysis; Dimension (graph theory); Topology (electrical circuits); Euclidean distance; Probability distribution; Computer science; Theoretical computer science; Algorithm; Combinatorics; Artificial intelligence; Image (mathematics); Geography; Statistics; Geometry","score_opus":0.03036330825642656,"score_gpt":0.2336477017209446,"score_spread":0.20328439346451804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135217630","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.004679136,0.0015270911,0.9871061,0.0014363347,0.00011873987,0.000056177392,0.00045492212,0.0002848215,0.0043366314],"genre_scores_gemma":[0.23804665,0.0038726104,0.7493458,0.0007331751,0.0009169348,0.0006145657,0.0023679158,0.0002871344,0.0038152302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931457,0.0032932512,0.00056187826,0.0010005836,0.0017702277,0.00022836389],"domain_scores_gemma":[0.9858849,0.008776911,0.001195112,0.0021091332,0.0016001489,0.0004338282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006583541,0.0013502582,0.0015303959,0.010325984,0.0019587434,0.008996645,0.0017474906,0.0015941731,0.0046209935],"category_scores_gemma":[0.02463559,0.0006712625,0.0022534248,0.010089325,0.006640764,0.009787669,0.005496086,0.0036681078,0.0012283039],"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.000013309428,0.000012738883,0.00039702305,0.00012650125,0.000041786403,0.00006551992,0.00025077147,0.010532607,0.00020378015,0.96919405,0.0018307143,0.017331252],"study_design_scores_gemma":[0.000004626919,0.00001508783,0.00018997006,0.00004295754,0.000013224858,0.000073670024,0.000109739245,0.038359612,0.00021517479,0.9518196,0.009141433,0.000014945736],"about_ca_topic_score_codex":0.0022914577,"about_ca_topic_score_gemma":0.0011645228,"teacher_disagreement_score":0.010325984,"about_ca_system_score_codex":0.0031838317,"about_ca_system_score_gemma":0.0017485721,"threshold_uncertainty_score":0.034817517},"labels":[],"label_agreement":null},{"id":"W3155566642","doi":"10.20382/jocg.v13i2a5","title":"Orientation preserving maps of the n × n grid","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Orientation (vector space); Grid; Computer science; Geometry; Mathematics","score_opus":0.00947932411795094,"score_gpt":0.196966089331903,"score_spread":0.18748676521395205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155566642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45527738,0.00041467702,0.35954332,0.0004549876,0.0004055521,0.00013514054,0.00059940264,0.0009689883,0.18220045],"genre_scores_gemma":[0.878961,0.00029606427,0.074919656,0.00020866632,0.0000964503,0.00017610537,0.0005366238,0.0003173835,0.044487894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996971,0.000036441244,0.000013809933,0.000079506615,0.00008082253,0.00009235973],"domain_scores_gemma":[0.99973255,0.000058429767,0.00004002495,0.00006043039,0.000047225134,0.00006132165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016079063,0.00028924,0.00025253007,0.00046999307,0.0007851375,0.0010936825,0.00054537796,0.00030071582,0.0062547154],"category_scores_gemma":[0.00074679434,0.00020464073,0.0005060534,0.00030975675,0.0008668086,0.00086558424,0.0016932028,0.0007245178,0.0015886364],"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.00015889277,0.00006581266,0.0009515327,0.000049362116,0.000012012909,0.00033227136,0.0005082581,0.007157984,0.010587368,0.93090963,0.004313948,0.044953015],"study_design_scores_gemma":[0.00007725886,0.00013513445,0.002104727,0.000030730745,0.00001768595,0.0005288004,0.00041403467,0.056029465,0.014701494,0.86123264,0.0646819,0.000046150442],"about_ca_topic_score_codex":0.0030479233,"about_ca_topic_score_gemma":0.0023753638,"teacher_disagreement_score":0.0062547154,"about_ca_system_score_codex":0.00067467446,"about_ca_system_score_gemma":0.00042215097,"threshold_uncertainty_score":0.020924091},"labels":[],"label_agreement":null},{"id":"W3207367190","doi":"10.20382/jocg.v12i1a4","title":"Walking the dog fast in practice: Algorithm engineering of the Fréchet distance","year":2021,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; Mathematics; Similarity (geometry); Bottleneck; Distance measures; Data structure; Measure (data warehouse); Benchmark (surveying); Computer science; Quadratic equation; Data mining; Artificial intelligence; Image (mathematics)","score_opus":0.0057959754496999015,"score_gpt":0.20680898383789056,"score_spread":0.20101300838819067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207367190","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.011055463,0.00054580305,0.9816828,0.0006746269,0.00010689061,0.00006740999,0.00008826852,0.002285677,0.0034931675],"genre_scores_gemma":[0.15800469,0.00051460136,0.83664346,0.00029354155,0.00015126179,0.00025040805,0.00055750454,0.00091991585,0.0026646117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993036,0.0019673973,0.0005085859,0.0019082732,0.0020549977,0.00052478665],"domain_scores_gemma":[0.9877659,0.0066089337,0.00047712034,0.0033466758,0.0015207006,0.0002806269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039545037,0.0013088264,0.0013873251,0.0014898991,0.0012126068,0.004231401,0.0033379951,0.002355745,0.007356411],"category_scores_gemma":[0.035423446,0.0010467811,0.0012812781,0.002155169,0.0025698377,0.008975867,0.0047950805,0.0048526577,0.0036963022],"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.00038333642,0.00018686496,0.0029021492,0.00048441422,0.00009575681,0.00020640357,0.00063249544,0.1779849,0.008073574,0.24891423,0.020125264,0.54001063],"study_design_scores_gemma":[0.000082781684,0.0001171111,0.0003205038,0.000092666625,0.00002102251,0.00023308877,0.00014761653,0.6752516,0.005991024,0.30322155,0.014473391,0.00004762855],"about_ca_topic_score_codex":0.0045054215,"about_ca_topic_score_gemma":0.0035823376,"teacher_disagreement_score":0.007356411,"about_ca_system_score_codex":0.0022852067,"about_ca_system_score_gemma":0.003102604,"threshold_uncertainty_score":0.024609625},"labels":[],"label_agreement":null},{"id":"W4301413600","doi":"10.20382/jocg.v5i1a1","title":"Unions of onions: preprocessing imprecise points for fast onion decomposition","year":2014,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Decomposition; Combinatorics; Mathematics; Matching (statistics); Disjoint union (topology); Binary logarithm; Time complexity; Regular polygon; Set (abstract data type); Point (geometry); Data structure; Discrete mathematics; Unit disk; Computer science; Chemistry; Statistics; Geometry","score_opus":0.015156682061775414,"score_gpt":0.2662926280989182,"score_spread":0.2511359460371428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301413600","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.036475603,0.00033264872,0.9482235,0.00027768168,0.00010172796,0.00017934822,0.0015561274,0.008777685,0.004075661],"genre_scores_gemma":[0.19835006,0.0002864202,0.7860416,0.0001421045,0.00006857257,0.0003425225,0.0077656684,0.0023091028,0.0046939324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981608,0.00017876938,0.00021605592,0.0003628508,0.0007727482,0.00030880066],"domain_scores_gemma":[0.99653447,0.0009196921,0.0002345281,0.0016047497,0.00057146716,0.00013520796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087970466,0.0017629705,0.0017971676,0.0024805323,0.001181592,0.0030419682,0.002890194,0.0014582236,0.011025086],"category_scores_gemma":[0.007149363,0.0011037457,0.0020934888,0.003918825,0.0011412036,0.0053657563,0.0057578273,0.0025809777,0.004614145],"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.0020297,0.0002686282,0.0058640544,0.00078576466,0.00017126862,0.0006353875,0.0017299473,0.10237136,0.03621034,0.05915628,0.043273125,0.7475041],"study_design_scores_gemma":[0.00016832858,0.00022009741,0.0014782934,0.00012698634,0.000061804974,0.000366804,0.0009981279,0.8121123,0.04216183,0.10469644,0.037530042,0.00007899114],"about_ca_topic_score_codex":0.003990701,"about_ca_topic_score_gemma":0.0065309806,"teacher_disagreement_score":0.011025086,"about_ca_system_score_codex":0.0010225669,"about_ca_system_score_gemma":0.0010974957,"threshold_uncertainty_score":0.03688264},"labels":[],"label_agreement":null},{"id":"W4392970340","doi":"10.20382/jocg.v16i2a8","title":"Computing Shortest Closed Curves on Non-Orientable Surfaces","year":2024,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Centre National de la Recherche Scientifique; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.008206478363680299,"score_gpt":0.23055012333275918,"score_spread":0.22234364496907888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392970340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7866631,0.00029916005,0.2059939,0.00027304897,0.000031017327,0.000063823994,0.00054680795,0.0012546544,0.00487452],"genre_scores_gemma":[0.89226717,0.00018035671,0.10321351,0.00005155134,0.000033892742,0.000050973056,0.001744099,0.0002839285,0.0021744624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995491,0.000047393634,0.00003116503,0.00015578516,0.00013351609,0.000082970604],"domain_scores_gemma":[0.99876106,0.00056324666,0.00013447001,0.0002677458,0.00016316556,0.000110462744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031173724,0.00077555096,0.0008146007,0.00092702714,0.0006189012,0.0014291343,0.0012400859,0.0008024887,0.003481766],"category_scores_gemma":[0.003932442,0.00030766267,0.00055205886,0.0014056701,0.0012731544,0.0034396597,0.0015214983,0.0008045301,0.00053462427],"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.00063099794,0.0002461911,0.019867113,0.001006231,0.00011662163,0.00073018135,0.0015529996,0.42826837,0.04878691,0.28408062,0.0058880383,0.2088257],"study_design_scores_gemma":[0.000043815417,0.0001200432,0.0020034474,0.000034314486,0.000030846557,0.00013549515,0.0003218676,0.6379322,0.017364146,0.33746123,0.0045248135,0.000027786387],"about_ca_topic_score_codex":0.0021843142,"about_ca_topic_score_gemma":0.003176961,"teacher_disagreement_score":0.003481766,"about_ca_system_score_codex":0.0011934033,"about_ca_system_score_gemma":0.0006250184,"threshold_uncertainty_score":0.011647701},"labels":[],"label_agreement":null},{"id":"W4412216168","doi":"10.20382/jocg.v15i1a6","title":"Sorting under partial (interval order) information","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Interval (graph theory); Sorting; Order (exchange); Mathematics; Computer science; Combinatorics; Algorithm; Economics","score_opus":0.011488732816971027,"score_gpt":0.21010318980686277,"score_spread":0.19861445698989175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412216168","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.06619378,0.0005573259,0.9266523,0.00055203604,0.00007202624,0.00010913176,0.00094593724,0.0017085037,0.0032090216],"genre_scores_gemma":[0.42254552,0.00075003825,0.56892097,0.0002798579,0.00019576642,0.00016055623,0.0024182736,0.00042849427,0.004300559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516547,0.0006667885,0.0004210523,0.0009375216,0.0022569105,0.0005522791],"domain_scores_gemma":[0.9895663,0.00500163,0.0010618034,0.002774959,0.0012539005,0.0003414851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025081567,0.0011066619,0.0018048949,0.0020854382,0.0009022252,0.004427653,0.0023608082,0.0012410654,0.0040678713],"category_scores_gemma":[0.014664012,0.00084897666,0.0018954661,0.0050640283,0.0018373147,0.009642463,0.0025728974,0.0024380463,0.000983791],"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.0012414402,0.00017856613,0.0040501957,0.00061721756,0.00018340454,0.00034180618,0.00097500585,0.48581043,0.011833357,0.25590503,0.0048663574,0.23399726],"study_design_scores_gemma":[0.00008331273,0.00036949303,0.0011500644,0.00006188478,0.00009789237,0.00027687583,0.00025745912,0.6621154,0.012740838,0.31426558,0.008502754,0.00007846768],"about_ca_topic_score_codex":0.004948899,"about_ca_topic_score_gemma":0.0045629377,"teacher_disagreement_score":0.004948899,"about_ca_system_score_codex":0.002152408,"about_ca_system_score_gemma":0.0023817273,"threshold_uncertainty_score":0.015616894},"labels":[],"label_agreement":null},{"id":"W4415966265","doi":"10.20382/jocg.v16i1a12","title":"Who needs crossings?: Noncrossing linkages are universal, and deciding (global) rigidity is hard","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Rigidity (electromagnetism); Multigraph; Graph; Existential quantification; Complement graph; Complement (music)","score_opus":0.006575591961191947,"score_gpt":0.20325244946375634,"score_spread":0.1966768575025644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415966265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5086811,0.0024016364,0.39798656,0.041107282,0.000531567,0.00032288654,0.0047166436,0.0017741891,0.042478126],"genre_scores_gemma":[0.90024686,0.0013198741,0.08185052,0.0025190008,0.0005494914,0.00022466913,0.0033726976,0.00040743905,0.009509543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99583364,0.0009321171,0.00023329009,0.0019163833,0.0005162981,0.00056828634],"domain_scores_gemma":[0.9727634,0.020427816,0.001956033,0.0028685285,0.0007299726,0.0012542027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023626247,0.0012008654,0.0018759114,0.0008908445,0.0028535204,0.005790345,0.0024765686,0.0051643737,0.013794808],"category_scores_gemma":[0.020024186,0.0013958586,0.0028812715,0.001918896,0.0051709507,0.019572197,0.0040231943,0.006645216,0.0016222106],"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.00084012235,0.00034594964,0.008090543,0.0012818921,0.00022134423,0.0011904906,0.0018021392,0.07331588,0.00527346,0.7959454,0.034490764,0.07720201],"study_design_scores_gemma":[0.000061002174,0.000051802093,0.00097566063,0.00006516937,0.00005395599,0.0005819816,0.0007684421,0.047697295,0.0019819348,0.9418901,0.005821068,0.00005158887],"about_ca_topic_score_codex":0.0034002026,"about_ca_topic_score_gemma":0.0031261928,"teacher_disagreement_score":0.013794808,"about_ca_system_score_codex":0.0020661063,"about_ca_system_score_gemma":0.0017291658,"threshold_uncertainty_score":0.04614824},"labels":[],"label_agreement":null},{"id":"W6888425079","doi":"10.20382/jocg.v13i1a14","title":"Algorithms for approximate sparse regression and nearest induced hulls","year":2021,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degeneracy (biology); Set (abstract data type); Affine transformation; Regular polygon; Approximation algorithm; Convex hull; Conjecture; k-nearest neighbors algorithm; Randomized algorithm; Simple (philosophy)","score_opus":0.03918475331428511,"score_gpt":0.25983895760885284,"score_spread":0.22065420429456772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888425079","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.010350219,0.0005089263,0.98013353,0.0006054076,0.00008591981,0.0001499433,0.00075450283,0.003683466,0.0037279874],"genre_scores_gemma":[0.17126878,0.0005840922,0.81163704,0.00045069418,0.00024132343,0.0006658041,0.0059521687,0.00092296884,0.008277117],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611,0.00071889046,0.00025567887,0.0010776464,0.0013202145,0.00051756826],"domain_scores_gemma":[0.99495196,0.002268811,0.0004550612,0.0015694882,0.0006017346,0.0001529652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014914442,0.0021682305,0.0031776724,0.0024607866,0.0013445998,0.0027808049,0.0045604343,0.0023813015,0.013840662],"category_scores_gemma":[0.012790061,0.0012160161,0.00223643,0.0058529484,0.0014918034,0.0065859337,0.004522557,0.0040631816,0.0055241906],"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.00067025184,0.00046034378,0.001579238,0.00053715653,0.00015220189,0.00017992352,0.0004081122,0.37795153,0.0037153512,0.101852424,0.04037794,0.47211552],"study_design_scores_gemma":[0.00010868105,0.000055804434,0.00022488312,0.0000250435,0.000023751538,0.000100412646,0.00009284003,0.90880764,0.0014554294,0.084672116,0.0044122976,0.000021125155],"about_ca_topic_score_codex":0.007293077,"about_ca_topic_score_gemma":0.010378598,"teacher_disagreement_score":0.013840662,"about_ca_system_score_codex":0.0023796174,"about_ca_system_score_gemma":0.0021040456,"threshold_uncertainty_score":0.046301663},"labels":[],"label_agreement":null},{"id":"W6888428011","doi":"10.20382/jocg.v16i1a7","title":"Simplification of polyline bundles of graphs and trees","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bundle; Line segment; Vertex (graph theory); Generalization; Path (computing); Set (abstract data type); Hausdorff distance","score_opus":0.014307294734958093,"score_gpt":0.22466723407896474,"score_spread":0.21035993934400665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888428011","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.25955516,0.0013827276,0.7122508,0.0013862114,0.00009690351,0.00053734105,0.0031724053,0.0033363518,0.018282128],"genre_scores_gemma":[0.5742778,0.0010456784,0.40172046,0.00029245246,0.0001310624,0.00032499974,0.008002954,0.0009481354,0.0132565275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984686,0.00031712986,0.00009572406,0.00047874037,0.00040278398,0.00023701062],"domain_scores_gemma":[0.99676526,0.001739915,0.0004243475,0.00068601756,0.00021043078,0.00017408245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006488072,0.0011467022,0.0013808728,0.0008435915,0.001104645,0.002033635,0.0017943068,0.001671125,0.008261763],"category_scores_gemma":[0.0050590793,0.0007187613,0.0018310664,0.0021593415,0.0011095046,0.0044476786,0.0014800782,0.0020576036,0.0013326089],"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.00034709505,0.00024225768,0.0027637412,0.00084948936,0.0001367451,0.00076646847,0.00047906628,0.76272243,0.011716341,0.056411378,0.013936615,0.14962842],"study_design_scores_gemma":[0.00006079724,0.0001424525,0.0012546704,0.00006882952,0.00006180745,0.00047584463,0.00023665711,0.88022053,0.008621345,0.093604505,0.0152244,0.0000281043],"about_ca_topic_score_codex":0.0033193517,"about_ca_topic_score_gemma":0.004776811,"teacher_disagreement_score":0.008261763,"about_ca_system_score_codex":0.0015546253,"about_ca_system_score_gemma":0.00075533724,"threshold_uncertainty_score":0.027638376},"labels":[],"label_agreement":null},{"id":"W6888440185","doi":"10.20382/v16i1a5","title":"Density approximation for moving groups","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kernel density estimation; Track (disk drive); Group (periodic table); Kernel (algebra); Tracking (education); Density estimation; Maxima","score_opus":0.01758062281630666,"score_gpt":0.2240018861337144,"score_spread":0.20642126331740776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888440185","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.0144692045,0.0002819122,0.9834567,0.00026615133,0.000036902275,0.000036220183,0.00019986353,0.00025009568,0.0010029128],"genre_scores_gemma":[0.5774754,0.0012255065,0.4080693,0.0003084752,0.00021802752,0.00040550396,0.0027351123,0.0003347563,0.009227919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987804,0.00035463873,0.00008068877,0.00028841657,0.00032113792,0.0001746846],"domain_scores_gemma":[0.99180675,0.00491622,0.000700029,0.0012488171,0.0010243937,0.0003037806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028124847,0.00072629406,0.0014917807,0.0025619185,0.00086520985,0.0018134295,0.0033404836,0.0017261393,0.0030870314],"category_scores_gemma":[0.022008665,0.0006599095,0.0014383984,0.0025782483,0.0017433033,0.004680554,0.0024994118,0.0033078825,0.0010554609],"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.00018128913,0.00008475282,0.004368216,0.00015786538,0.000067642795,0.00014342928,0.0004150521,0.6593317,0.0012770188,0.27331147,0.005890044,0.05477154],"study_design_scores_gemma":[0.0000043878817,0.000009853452,0.00020511588,0.000008470181,0.0000046670557,0.000024835183,0.00002718973,0.9560579,0.00015752086,0.04254431,0.0009498303,0.0000059000035],"about_ca_topic_score_codex":0.010918449,"about_ca_topic_score_gemma":0.005554174,"teacher_disagreement_score":0.010918449,"about_ca_system_score_codex":0.002245049,"about_ca_system_score_gemma":0.00102931,"threshold_uncertainty_score":0.0217098},"labels":[],"label_agreement":null},{"id":"W6888461022","doi":"10.20382/jocg.v12i2a5","title":"The Stretch Factor of Hexagon-Delaunay Triangulations","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Delaunay triangulation; Equilateral triangle; Upper and lower bounds; Voronoi diagram; Polygon (computer graphics); Square (algebra); Triangulation; Pitteway triangulation","score_opus":0.011484366665485916,"score_gpt":0.21031590607306858,"score_spread":0.19883153940758266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888461022","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.15679331,0.0014088142,0.82276857,0.0002912031,0.0001160513,0.00011228089,0.00065851514,0.0005325878,0.017318634],"genre_scores_gemma":[0.6894728,0.0012576832,0.3031503,0.00008553484,0.00006147644,0.00014411166,0.00088031346,0.00044504093,0.004502685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807477,0.00022477804,0.00012690722,0.00035809295,0.0010305158,0.00018490867],"domain_scores_gemma":[0.9966382,0.0015024601,0.00045448507,0.0006651845,0.00055426545,0.00018547375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011127335,0.0005835195,0.00062662584,0.0009991195,0.0005288185,0.0012514764,0.00093186455,0.000745583,0.0060265805],"category_scores_gemma":[0.011318619,0.000552746,0.00047814773,0.0011321029,0.0012463814,0.0030411961,0.0021108396,0.0010707332,0.0011507268],"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.0006812233,0.00008952782,0.010468685,0.00077133474,0.00011028074,0.0005663772,0.0010001867,0.57910174,0.039534356,0.12563583,0.004995426,0.23704502],"study_design_scores_gemma":[0.000036977675,0.00017808235,0.004063617,0.00017008692,0.00002970656,0.00074995996,0.00069194037,0.8307309,0.020728769,0.12968461,0.012874263,0.00006105944],"about_ca_topic_score_codex":0.0022105228,"about_ca_topic_score_gemma":0.0024978598,"teacher_disagreement_score":0.0060265805,"about_ca_system_score_codex":0.00081603247,"about_ca_system_score_gemma":0.00046649552,"threshold_uncertainty_score":0.020160854},"labels":[],"label_agreement":null},{"id":"W6888484399","doi":"10.20382/jocg.v15i2a4","title":"On the geometric thickness of 2-degenerate graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geometric graph theory; Vertex (graph theory); Spatial network; Geometric shape; Geometric modeling; Geometric networks; Graph; Geometric data analysis; Plane (geometry); Geometric design","score_opus":0.010248179830771975,"score_gpt":0.21364375133575592,"score_spread":0.20339557150498394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888484399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69377166,0.002263547,0.24615905,0.0016683221,0.00019073141,0.00004792868,0.00038522523,0.00033688065,0.05517672],"genre_scores_gemma":[0.95498854,0.0013644703,0.036911577,0.00027070066,0.000209721,0.00005895476,0.0003243121,0.0002071425,0.0056645437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990707,0.00022969671,0.00005091344,0.00019024973,0.000257374,0.00020114105],"domain_scores_gemma":[0.9953002,0.0024643722,0.00078468747,0.0006508412,0.0003597637,0.0004401469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010046441,0.0006800843,0.00059216534,0.0016547006,0.0010938346,0.0019174288,0.0012432152,0.0011037902,0.0049910024],"category_scores_gemma":[0.0069424044,0.0009592715,0.0006356242,0.00129197,0.003988687,0.0063327793,0.0031292185,0.0022478022,0.0007942205],"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.00031988745,0.000051232975,0.0060051586,0.00022201044,0.000039186758,0.00055203406,0.0012871919,0.044537555,0.011885539,0.8925593,0.0038436535,0.038697205],"study_design_scores_gemma":[0.000028924145,0.00008055177,0.0033016696,0.00008054193,0.00004296332,0.0010269292,0.0006529757,0.0480432,0.00463751,0.93291223,0.009146756,0.000045770033],"about_ca_topic_score_codex":0.0006107195,"about_ca_topic_score_gemma":0.00048505364,"teacher_disagreement_score":0.0049910024,"about_ca_system_score_codex":0.00095997687,"about_ca_system_score_gemma":0.0002337642,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W6888493691","doi":"10.20382/jocg.v16i1a4","title":"Geometric hitting set for line-constrained disks and related problems","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Point (geometry); Plane (geometry); Quadratic equation; Running time; Hitting time; Computational geometry; Square (algebra)","score_opus":0.024080537216046093,"score_gpt":0.24109867560120543,"score_spread":0.21701813838515935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888493691","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.17882109,0.0029106585,0.8036491,0.0012649765,0.00013612286,0.00038033602,0.0016359384,0.0015900206,0.009611666],"genre_scores_gemma":[0.5535705,0.002155148,0.42814168,0.00041809582,0.00024358074,0.00070006156,0.005230416,0.00043753182,0.009102889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983222,0.00040114415,0.000119801836,0.00049255067,0.00043076146,0.00023338781],"domain_scores_gemma":[0.9966162,0.0022565662,0.0003375749,0.00031217685,0.00026307462,0.00021449135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010312167,0.0020262375,0.0025803593,0.0019827255,0.0015831408,0.0025559391,0.0036510087,0.0026738872,0.009197839],"category_scores_gemma":[0.008074776,0.00095286017,0.0017446853,0.005772231,0.0014816385,0.0055010556,0.0024953685,0.0019804933,0.0011521232],"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.00046111533,0.00032462747,0.0024806191,0.0008850775,0.0002004791,0.0005553579,0.0005070204,0.7638893,0.00381713,0.10983181,0.011786425,0.10526105],"study_design_scores_gemma":[0.000078967554,0.00011760387,0.0005027541,0.00004432404,0.00003392626,0.00026061616,0.00018264192,0.87510806,0.0014051876,0.11892842,0.0033031346,0.000034390494],"about_ca_topic_score_codex":0.006262681,"about_ca_topic_score_gemma":0.0038742812,"teacher_disagreement_score":0.009197839,"about_ca_system_score_codex":0.002162746,"about_ca_system_score_gemma":0.0010958309,"threshold_uncertainty_score":0.030769825},"labels":[],"label_agreement":null},{"id":"W6888518616","doi":"10.20382/jocg.v8i1a10-sup-a","title":"Source Code","year":2017,"lang":"en","type":"other","venue":"Journal of Computational Geometry (Carleton University)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Source code; Code (set theory); Set (abstract data type); Software; Key (lock)","score_opus":0.015221486896852831,"score_gpt":0.2373882821004757,"score_spread":0.22216679520362287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888518616","genre_codex":"dataset","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015211168,0.00065004645,0.06706387,0.0011752566,0.0011558403,0.0005307288,0.40930924,0.21141686,0.30717704],"genre_scores_gemma":[0.012288706,0.0009202332,0.07387333,0.0008788915,0.00037224175,0.0013299893,0.47306466,0.16164239,0.27562955],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991659,0.0001108753,0.000052754865,0.00015617117,0.00037604012,0.0001383233],"domain_scores_gemma":[0.99809104,0.00046185948,0.000055107826,0.0005240293,0.0006428969,0.00022513032],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008610911,0.0026991602,0.0015769476,0.004016553,0.0010224326,0.00409368,0.0034605148,0.0015009,0.6635492],"category_scores_gemma":[0.006557319,0.0010836434,0.0016870592,0.0027461643,0.000731388,0.0029983846,0.0036902942,0.0023296324,0.62888074],"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.000057015877,0.000034002776,0.00015553486,0.00027846388,0.000016546095,0.00002071748,0.000029850507,0.0011788261,0.00028967785,0.005261278,0.96576023,0.026917845],"study_design_scores_gemma":[0.00016630157,0.000015355281,0.00030285865,0.00012491837,0.000021197302,0.000071664086,0.000040571453,0.0043153013,0.0017501531,0.021419095,0.97172856,0.000044100714],"about_ca_topic_score_codex":0.006585166,"about_ca_topic_score_gemma":0.010212751,"teacher_disagreement_score":0.6635492,"about_ca_system_score_codex":0.0012399099,"about_ca_system_score_gemma":0.0020779357,"threshold_uncertainty_score":0.47990626},"labels":[],"label_agreement":null},{"id":"W6888536549","doi":"10.20382/jocg.v13i1a15","title":"Orthogonal point location and rectangle stabbing queries in 3-d","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rectangle; Disjoint sets; Data structure; Point (geometry); Pointer (user interface); Point location; Upper and lower bounds","score_opus":0.007822135440358806,"score_gpt":0.19238386639733573,"score_spread":0.18456173095697692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888536549","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.13488439,0.0025220844,0.82647884,0.0025486741,0.00036258125,0.00030257006,0.0037805843,0.011916228,0.01720409],"genre_scores_gemma":[0.4880384,0.0011653866,0.48781732,0.0011139176,0.00032508888,0.00056278787,0.007684466,0.0014956292,0.011796927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941711,0.00079024426,0.0006395944,0.0013731044,0.002013945,0.0010120142],"domain_scores_gemma":[0.9904032,0.0029908011,0.00080207764,0.0046109683,0.0007863117,0.00040665464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017015346,0.0016026306,0.0028673522,0.0017767198,0.0022466488,0.0042269547,0.0055886847,0.00268507,0.013229094],"category_scores_gemma":[0.011137095,0.0011265153,0.0018413424,0.008503813,0.002900895,0.0175054,0.00956014,0.003132147,0.005214325],"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.0038758244,0.0007660276,0.007859503,0.0012360901,0.00020990288,0.00055456546,0.0018767661,0.17694901,0.034994457,0.29351166,0.06974356,0.40842268],"study_design_scores_gemma":[0.0004546297,0.0006513488,0.0018905818,0.000117742005,0.00013972998,0.0008118451,0.00130415,0.6165327,0.0365602,0.28739423,0.053941153,0.00020162648],"about_ca_topic_score_codex":0.008172366,"about_ca_topic_score_gemma":0.007941513,"teacher_disagreement_score":0.013229094,"about_ca_system_score_codex":0.0026471561,"about_ca_system_score_gemma":0.0026326291,"threshold_uncertainty_score":0.044255733},"labels":[],"label_agreement":null},{"id":"W6888537253","doi":"10.20382/jocg.v7i2","title":"Journal of Computational Geometry, Vol. 7 No. 2 (2016): Special Issue of Selected Papers from SoCG 2015","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Special section; Key (lock)","score_opus":0.012001306892397479,"score_gpt":0.2206147639986438,"score_spread":0.20861345710624632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888537253","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007904094,0.2315294,0.051957805,0.049211722,0.41710293,0.0002992788,0.006521349,0.0022909208,0.23318258],"genre_scores_gemma":[0.046342235,0.20176232,0.033850197,0.006183244,0.21806896,0.0002140642,0.015646016,0.005977742,0.47195524],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727386,0.00024730168,0.00019148666,0.000498786,0.0016555797,0.00013291651],"domain_scores_gemma":[0.99294126,0.0015350581,0.00025373444,0.0009909484,0.0031319817,0.0011469431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024795,0.0016561057,0.0020129038,0.0050829663,0.0015955794,0.0064338488,0.0015349911,0.0013852887,0.07732012],"category_scores_gemma":[0.008925748,0.00084231765,0.0011936027,0.0048982026,0.0014565804,0.003672645,0.0029736084,0.0035571067,0.029930687],"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.00005400223,0.00003001678,0.00057866174,0.0006783375,0.00004483723,0.00006320536,0.000041450698,0.0009042421,0.0007473488,0.012159603,0.8834683,0.10122999],"study_design_scores_gemma":[0.000017925031,0.000045051103,0.001647069,0.00045873006,0.000033337776,0.00039038394,0.00006605023,0.0015943127,0.0007166844,0.01926921,0.9757386,0.000022652903],"about_ca_topic_score_codex":0.0023487816,"about_ca_topic_score_gemma":0.0061078956,"teacher_disagreement_score":0.07732012,"about_ca_system_score_codex":0.0030995363,"about_ca_system_score_gemma":0.003983435,"threshold_uncertainty_score":0.25866163},"labels":[],"label_agreement":null},{"id":"W6907340915","doi":"10.20382/jocg.v15i2a1","title":"Extending orthogonal planar graph drawings is fixed-parameter tractable","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Parasite Biology and Host Interactions","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vienna Science and Technology Fund; Austrian Science Fund; European Commission","keywords":"Planar graph; Parameterized complexity; Bounded function; Graph drawing; Graph; Book embedding; Vertex (graph theory); Treewidth; Planar","score_opus":0.00850334009077879,"score_gpt":0.266609281395087,"score_spread":0.2581059413043082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907340915","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.127898,0.0002195695,0.85366315,0.0009711328,0.000034727953,0.00031511174,0.0010240058,0.0020111492,0.0138631845],"genre_scores_gemma":[0.4779552,0.00046548998,0.50911534,0.0003246809,0.000075231444,0.0005031817,0.0031622855,0.0006282997,0.0077703693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983944,0.00040910003,0.00009257532,0.00055287447,0.00034103377,0.0002099836],"domain_scores_gemma":[0.9942129,0.0036438117,0.0005066074,0.0012251678,0.00025718167,0.00015429714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015936284,0.0012712077,0.0013542398,0.0006073684,0.0007823939,0.0023135098,0.0024155981,0.0017766487,0.0076623065],"category_scores_gemma":[0.009103716,0.00091770507,0.001686603,0.0020358213,0.0011096622,0.00506596,0.0030693684,0.0028045345,0.0012285812],"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.00032040194,0.00028778115,0.0020270238,0.00046210978,0.00006477475,0.00048260408,0.0005066443,0.675115,0.0074336296,0.13024382,0.009265522,0.17379072],"study_design_scores_gemma":[0.00009549777,0.00009793676,0.00034752802,0.00004103103,0.00003445571,0.00030859298,0.00018864917,0.7362107,0.002782074,0.2520483,0.007823678,0.000021519349],"about_ca_topic_score_codex":0.0017954482,"about_ca_topic_score_gemma":0.0030174574,"teacher_disagreement_score":0.0076623065,"about_ca_system_score_codex":0.001167827,"about_ca_system_score_gemma":0.0008792991,"threshold_uncertainty_score":0.025632918},"labels":[],"label_agreement":null},{"id":"W6907382603","doi":"10.20382/jocg.v3i1","title":"Journal of Computational Geometry, Vol. 3 No. 1 (2012)","year":2012,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key (lock); Feature (linguistics); Field (mathematics); Set (abstract data type)","score_opus":0.013373719029095756,"score_gpt":0.22047722181624024,"score_spread":0.20710350278714448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907382603","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.025334869,0.15460934,0.3342506,0.021518711,0.023156809,0.00017818614,0.002278928,0.0022619383,0.43641067],"genre_scores_gemma":[0.27452123,0.1303793,0.24101101,0.0036807377,0.010599322,0.0002162221,0.0046903566,0.0029671188,0.3319348],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839586,0.0002299412,0.000115109324,0.00031467865,0.00088566024,0.0000588217],"domain_scores_gemma":[0.998061,0.0003620581,0.0001058593,0.00064263423,0.00063477916,0.0001936074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001269289,0.0010226731,0.0012942385,0.0022331083,0.0012435977,0.0075292257,0.0010072375,0.0009885795,0.051193554],"category_scores_gemma":[0.004417791,0.0007828973,0.0010161225,0.0023872764,0.0030269942,0.0027202195,0.0028370896,0.0034562538,0.013045707],"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.00010599496,0.00008877604,0.003595365,0.0009181344,0.00019204101,0.0002478275,0.00029169873,0.008775874,0.0060218554,0.30351898,0.29183924,0.3844042],"study_design_scores_gemma":[0.000031203585,0.000074324846,0.0051732063,0.00029024438,0.00012470642,0.0018827514,0.00026200348,0.017182484,0.002175537,0.3045389,0.66820997,0.000054624572],"about_ca_topic_score_codex":0.0031459553,"about_ca_topic_score_gemma":0.005977496,"teacher_disagreement_score":0.051193554,"about_ca_system_score_codex":0.001314868,"about_ca_system_score_gemma":0.002295627,"threshold_uncertainty_score":0.17125946},"labels":[],"label_agreement":null},{"id":"W6907494475","doi":"10.20382/jocg.v16i2a1","title":"Discrete Fréchet distance oracles","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Oracle; Sublinear function; Path (computing); Constant (computer programming); Focus (optics); Construct (python library); Graph; Computational geometry","score_opus":0.006357200739715545,"score_gpt":0.22265187343626697,"score_spread":0.21629467269655142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907494475","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.1857975,0.0016347705,0.770665,0.0043818,0.00033086713,0.00028825464,0.004849549,0.012256326,0.01979596],"genre_scores_gemma":[0.78246826,0.000500223,0.19958065,0.00094386237,0.00032503385,0.0003351827,0.0055824565,0.0008628708,0.009401391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99382246,0.00074775395,0.00066135783,0.002150214,0.001767524,0.0008507599],"domain_scores_gemma":[0.97602844,0.010312379,0.001299507,0.010037039,0.0014731096,0.00084950164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028244911,0.0010003534,0.0020936232,0.0010254806,0.0011513941,0.0043991352,0.0046359017,0.0033530584,0.013767522],"category_scores_gemma":[0.023865946,0.00079465995,0.0016504343,0.0023112053,0.0023246685,0.019203322,0.005462649,0.0056322166,0.0034634992],"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.002644366,0.00053202454,0.008224177,0.0009747888,0.00014038516,0.00042170275,0.00076836493,0.11920712,0.027046427,0.5756015,0.027825268,0.23661382],"study_design_scores_gemma":[0.00019732564,0.00037068737,0.0013491313,0.00010001923,0.00006254115,0.00060348026,0.0003202006,0.43146682,0.022584168,0.5216448,0.021176344,0.00012449968],"about_ca_topic_score_codex":0.0017323088,"about_ca_topic_score_gemma":0.0017598665,"teacher_disagreement_score":0.013767522,"about_ca_system_score_codex":0.003024831,"about_ca_system_score_gemma":0.002041957,"threshold_uncertainty_score":0.046056926},"labels":[],"label_agreement":null},{"id":"W6925877189","doi":"10.20382/jocg.v13i1a12","title":"Realizations of indecomposable persistence modules of arbitrarily large dimensions","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Digital Radiography and Breast Imaging","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Core Research for Evolutional Science and Technology","keywords":"Indecomposable module; Persistent homology; Topological data analysis; Simple (philosophy); Algebraic number; Persistence (discontinuity); Algebra over a field; Representation (politics)","score_opus":0.013197855014360806,"score_gpt":0.2191340072214817,"score_spread":0.20593615220712091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925877189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86164266,0.00033152357,0.12233292,0.00035463474,0.000038108614,0.000028134202,0.00018872989,0.0002708902,0.014812427],"genre_scores_gemma":[0.98697007,0.00011783026,0.009601685,0.000041132396,0.000028972423,0.000033939516,0.00014062255,0.000038329257,0.0030275274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.00009159842,0.000037953545,0.000119624296,0.00015431349,0.00013221128],"domain_scores_gemma":[0.9982784,0.0007002028,0.00028198803,0.0002679121,0.00016373688,0.0003077618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005998394,0.0002827071,0.00036038004,0.0015893528,0.0008118714,0.0020812715,0.0005503608,0.00047221663,0.0039346837],"category_scores_gemma":[0.0024594553,0.0003959353,0.0005060881,0.0005353701,0.0018690126,0.0032669166,0.0024260622,0.0010043838,0.00030296014],"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.000041115698,0.000022997618,0.0016307535,0.000040843694,0.000010487107,0.0003255404,0.00039719118,0.0031911298,0.003837746,0.98531795,0.0003005011,0.0048835995],"study_design_scores_gemma":[0.00003427145,0.00008914543,0.0020788945,0.000032890894,0.000018873716,0.0006203601,0.00043326334,0.029896228,0.005365458,0.9566674,0.00473177,0.00003142143],"about_ca_topic_score_codex":0.00025377117,"about_ca_topic_score_gemma":0.00021218517,"teacher_disagreement_score":0.0039346837,"about_ca_system_score_codex":0.00067283394,"about_ca_system_score_gemma":0.0002907224,"threshold_uncertainty_score":0.013162792},"labels":[],"label_agreement":null},{"id":"W6925887548","doi":"10.20382/jocg.v16i1a13","title":"Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Prenatal Screening and Diagnostics","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"","keywords":"Geodesic; Simple polygon; Voronoi diagram; Polygon (computer graphics); Simple (philosophy); Set (abstract data type); RADIUS; SIMPLE algorithm; Point (geometry)","score_opus":0.015568999501474518,"score_gpt":0.24787197042018538,"score_spread":0.23230297091871085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925887548","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.18139,0.00057396997,0.8103192,0.00049560406,0.000056382927,0.00014645777,0.00067802944,0.0011366893,0.0052037034],"genre_scores_gemma":[0.47613043,0.00031434128,0.51958257,0.000063572246,0.000030484322,0.00012436009,0.0012582066,0.00023821488,0.0022577664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994479,0.000119678814,0.000045382218,0.00012553456,0.00017743354,0.00008406751],"domain_scores_gemma":[0.9983553,0.0009602626,0.00020679002,0.00021964745,0.00016751316,0.00009027304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005598766,0.0006897197,0.0011375227,0.0010346822,0.00050080253,0.0010138733,0.0013658571,0.0010256461,0.0021679632],"category_scores_gemma":[0.0059779524,0.0005372779,0.00085431145,0.0011192503,0.0008105433,0.0013634305,0.0016067626,0.0007020727,0.0007535855],"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.00069609354,0.00009277959,0.0065710857,0.0004864252,0.00007740109,0.0005889721,0.0004240094,0.81772995,0.0107424455,0.029357512,0.0050631887,0.12817013],"study_design_scores_gemma":[0.000032581956,0.000052195326,0.00051027816,0.000015731823,0.00000883307,0.00019508574,0.000075811186,0.97912097,0.0031001572,0.014893518,0.0019823888,0.000012400255],"about_ca_topic_score_codex":0.004702566,"about_ca_topic_score_gemma":0.004107013,"teacher_disagreement_score":0.004702566,"about_ca_system_score_codex":0.00085454626,"about_ca_system_score_gemma":0.0007960219,"threshold_uncertainty_score":0.009350419},"labels":[],"label_agreement":null},{"id":"W6925964192","doi":"10.20382/jocg.v13i1a4","title":"FPT-Algorithms for computing Gromov-Hausdorff and interleaving distances between trees","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"COVID-19 Pandemic Impacts","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Metric space; Intrinsic metric; Shortest path problem; Metric (unit); Interleaving; Edit distance; Shortest-path tree; Distance; Merge (version control)","score_opus":0.041266992345401654,"score_gpt":0.24950594281661623,"score_spread":0.20823895047121457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925964192","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.017821228,0.001810342,0.96501046,0.0010726781,0.00022837838,0.00028516472,0.001315866,0.0055469684,0.0069089085],"genre_scores_gemma":[0.14386752,0.0007842378,0.8428084,0.00059060147,0.00025526615,0.00073040917,0.0043550944,0.001049783,0.0055585923],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953106,0.0007144355,0.0003738365,0.0015446831,0.0014438388,0.00061255175],"domain_scores_gemma":[0.9891128,0.0061299335,0.0006257259,0.0027398644,0.0010356687,0.00035603557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028365366,0.00350946,0.002967722,0.0023840475,0.0021976305,0.004925361,0.0058164573,0.0038949617,0.012461396],"category_scores_gemma":[0.02016355,0.0011553697,0.0034538438,0.004746445,0.0024362437,0.011472247,0.0042851367,0.0061344886,0.0056067253],"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.0008991568,0.00044769264,0.0024972768,0.0011707024,0.00024807415,0.00036539085,0.00067012006,0.24219239,0.00645215,0.19382764,0.044648636,0.50658077],"study_design_scores_gemma":[0.00014757241,0.00012098121,0.00041345734,0.00008873183,0.000074583215,0.00033082455,0.00015780731,0.61351603,0.0029160674,0.37312388,0.009061753,0.000048282793],"about_ca_topic_score_codex":0.006564436,"about_ca_topic_score_gemma":0.0081514595,"teacher_disagreement_score":0.012461396,"about_ca_system_score_codex":0.0060007763,"about_ca_system_score_gemma":0.0041860687,"threshold_uncertainty_score":0.04353887},"labels":[],"label_agreement":null},{"id":"W6925997529","doi":"10.20382/jocg.v16i2a4","title":"Practical software for triangulating and simplifying 4-manifolds","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Diatoms and Algae Research","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Software; Dimension (graph theory); Triangulation; Heuristic; Manifold (fluid mechanics); Deformation (meteorology)","score_opus":0.028813107852701067,"score_gpt":0.3155088031152552,"score_spread":0.2866956952625541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925997529","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037147538,0.00007822866,0.94967926,0.00008618836,0.000053121898,0.00008530821,0.00058705325,0.042134233,0.0035818305],"genre_scores_gemma":[0.04880268,0.00028740554,0.925432,0.000112027454,0.000027398451,0.00038800557,0.0033085188,0.016623931,0.0050180443],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986004,0.0001833074,0.00018652786,0.00023830534,0.0006586577,0.00013274382],"domain_scores_gemma":[0.99602014,0.0020728977,0.00020554985,0.00095664704,0.0006152336,0.00012945976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021305345,0.0014513957,0.0012145351,0.0016257385,0.0011785991,0.0024305012,0.0035127418,0.0014260991,0.033932973],"category_scores_gemma":[0.009153287,0.0013851732,0.002434755,0.001987083,0.0013857669,0.0038464332,0.004408196,0.0022103586,0.011014823],"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.00045332915,0.00017787638,0.0045373095,0.0015555031,0.00024693747,0.0006751493,0.00266652,0.057963938,0.020788703,0.15496607,0.08397875,0.67199],"study_design_scores_gemma":[0.00036735696,0.00012512825,0.001640723,0.00031977,0.00008922604,0.0008497165,0.000854331,0.49445105,0.038180772,0.20674486,0.2561825,0.00019454648],"about_ca_topic_score_codex":0.0026379405,"about_ca_topic_score_gemma":0.005159758,"teacher_disagreement_score":0.033932973,"about_ca_system_score_codex":0.0010786138,"about_ca_system_score_gemma":0.0015762646,"threshold_uncertainty_score":0.113517165},"labels":[],"label_agreement":null},{"id":"W6926161935","doi":"10.20382/jocg.v14i1","title":"Journal of Computational Geometry, Vol. 14 No. 1 (2023)","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Plant and animal studies","field":"Agricultural and Biological Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key (lock); Feature (linguistics); Field (mathematics); Set (abstract data type); Term (time)","score_opus":0.02753964512012163,"score_gpt":0.204064547552357,"score_spread":0.17652490243223537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926161935","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.028253315,0.06929684,0.19304152,0.03241431,0.029116586,0.00015853887,0.0057172333,0.0019814554,0.6400202],"genre_scores_gemma":[0.29482517,0.06646011,0.1420442,0.0058507184,0.012848323,0.0002484884,0.009315433,0.0032778971,0.4651296],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984042,0.00027069877,0.000105584106,0.0003843897,0.0007592173,0.00007593545],"domain_scores_gemma":[0.99816954,0.00038693097,0.000104858955,0.0004769694,0.00067999004,0.00018165649],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010764658,0.0008137965,0.0011381725,0.0017383925,0.001178685,0.008274669,0.00086459715,0.00095579604,0.07812778],"category_scores_gemma":[0.004737556,0.00073376374,0.0010815215,0.0026719435,0.0026583665,0.0026018498,0.002792314,0.003025826,0.021402558],"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.00008981562,0.000051980256,0.002195578,0.00053189514,0.00015103245,0.00012588121,0.0002245955,0.004648083,0.002634876,0.3414322,0.40626106,0.24165298],"study_design_scores_gemma":[0.000027065556,0.000044468416,0.0041039777,0.00016880067,0.00007075311,0.00079764734,0.00015933819,0.0069225933,0.0008319056,0.37357295,0.61326987,0.00003068278],"about_ca_topic_score_codex":0.0076020877,"about_ca_topic_score_gemma":0.008809901,"teacher_disagreement_score":0.9218722,"about_ca_system_score_codex":0.0021071876,"about_ca_system_score_gemma":0.0025241973,"threshold_uncertainty_score":0.26136345},"labels":[],"label_agreement":null},{"id":"W6926255130","doi":"10.20382/jocg.v16i2a6","title":"Robustly guarding polygons","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Marine Invertebrate Physiology and Ecology","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Robustness (evolution); Guard (computer science); Approximation algorithm; Polygon (computer graphics); Constant (computer programming); Visibility; Domain (mathematical analysis)","score_opus":0.006569673843731423,"score_gpt":0.1890649422360971,"score_spread":0.18249526839236568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926255130","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.04306681,0.00016673045,0.9542011,0.00022883454,0.00002874785,0.000038982555,0.00017468119,0.00049311406,0.0016009771],"genre_scores_gemma":[0.6516323,0.00039454518,0.3454003,0.000118738004,0.00006391936,0.00008927302,0.0004740836,0.00027398122,0.0015528296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974239,0.00047590595,0.00019315786,0.0006591471,0.0007531854,0.0004947683],"domain_scores_gemma":[0.9920155,0.0037207885,0.0012632681,0.0021981655,0.00045096464,0.00035137913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017907958,0.0009858537,0.0012430239,0.0007805121,0.0005758077,0.0022813547,0.0022649835,0.0014608636,0.0021600432],"category_scores_gemma":[0.016474394,0.0008728952,0.0017466198,0.0009422389,0.0026165545,0.005382806,0.00434313,0.0025483707,0.00045528382],"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.00017487971,0.000040443116,0.00091586035,0.00011206795,0.00003682184,0.000120516284,0.00017454597,0.8826786,0.007843906,0.07638404,0.0009287663,0.030589517],"study_design_scores_gemma":[0.000015924537,0.000098786695,0.00020213325,0.0000327262,0.000017213883,0.00012993936,0.00007744478,0.8902237,0.006158996,0.1013118,0.0017127586,0.000018552497],"about_ca_topic_score_codex":0.0018560129,"about_ca_topic_score_gemma":0.0015100159,"teacher_disagreement_score":0.0022813547,"about_ca_system_score_codex":0.0009397101,"about_ca_system_score_gemma":0.0010371394,"threshold_uncertainty_score":0.009470701},"labels":[],"label_agreement":null},{"id":"W6926285796","doi":"10.20382/jocg.v13i1a13","title":"Recognizing weighted and seeded disk graphs","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unit disk graph; Intersection graph; Vertex (graph theory); Planar graph; Intersection (aeronautics); Graph; Stars","score_opus":0.008482291990980738,"score_gpt":0.18264390229779687,"score_spread":0.17416161030681612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926285796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5637084,0.00016097595,0.4278909,0.00024537696,0.000021499452,0.00008362543,0.000627244,0.0010896774,0.0061722538],"genre_scores_gemma":[0.90300864,0.00009901145,0.09251265,0.00004586824,0.000013400062,0.00006456712,0.0013673442,0.00009051778,0.0027979247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999395,0.00009100843,0.000043129694,0.000206727,0.00016325201,0.000100909834],"domain_scores_gemma":[0.99852115,0.0005813949,0.0002581779,0.0003600563,0.00018311114,0.0000961874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002158568,0.00045189352,0.00045386096,0.0006188691,0.00039845932,0.0012684634,0.0011210655,0.00096012326,0.001990526],"category_scores_gemma":[0.0029168872,0.0003386947,0.00044811645,0.0008364246,0.0006476951,0.0026032324,0.0011848548,0.0006768368,0.0004621291],"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.0007044113,0.00022724527,0.00891388,0.00035629564,0.00009514028,0.0012982036,0.0009667389,0.395217,0.07565568,0.2607702,0.007651072,0.24814418],"study_design_scores_gemma":[0.00003372822,0.00009941991,0.0026704986,0.000024155124,0.00002941999,0.0006526572,0.00046840735,0.7620349,0.030731607,0.1976576,0.0055618756,0.000035728932],"about_ca_topic_score_codex":0.0015034655,"about_ca_topic_score_gemma":0.0023762567,"teacher_disagreement_score":0.001990526,"about_ca_system_score_codex":0.00066746207,"about_ca_system_score_gemma":0.0003340218,"threshold_uncertainty_score":0.0066589713},"labels":[],"label_agreement":null},{"id":"W6944628196","doi":"10.20382/jocg.v16i2a2","title":"Constrained and ordered level planarity parameterized by the number of levels","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Planarity testing; Parameterized complexity; Disjoint sets; Time complexity; Graph; Crossing number (knot theory); Twist; Order (exchange)","score_opus":0.02604492658022801,"score_gpt":0.28367366597794924,"score_spread":0.25762873939772124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6944628196","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.42475507,0.001496148,0.53142554,0.0044489615,0.00010590763,0.00026156628,0.009762403,0.0024938902,0.02525045],"genre_scores_gemma":[0.8062201,0.0013188387,0.16512579,0.0007878858,0.00029305657,0.00050951366,0.011242746,0.0013257499,0.013176358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974527,0.00042153735,0.0001429571,0.0009986984,0.0005519412,0.0004321631],"domain_scores_gemma":[0.9897962,0.0062645213,0.001313767,0.0016217869,0.0004276194,0.00057616556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097448146,0.0016389808,0.0017165085,0.00085742056,0.0010941187,0.004880894,0.0032843717,0.0023517858,0.013169385],"category_scores_gemma":[0.010789066,0.001173479,0.0023499494,0.0026554326,0.0018106702,0.010349209,0.0026672196,0.004067962,0.0012890521],"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.0009020622,0.00043212564,0.00851758,0.001151375,0.0002998577,0.0006732118,0.00083455053,0.58751667,0.010734693,0.30719757,0.020839883,0.06090039],"study_design_scores_gemma":[0.00016789766,0.000125085,0.002426814,0.00008074139,0.00013230914,0.0006911412,0.00027995877,0.5751538,0.003910426,0.4075817,0.009385559,0.00006457395],"about_ca_topic_score_codex":0.0039595347,"about_ca_topic_score_gemma":0.004435538,"teacher_disagreement_score":0.013169385,"about_ca_system_score_codex":0.0028758736,"about_ca_system_score_gemma":0.0018827906,"threshold_uncertainty_score":0.04405594},"labels":[],"label_agreement":null},{"id":"W6944787213","doi":"10.20382/jocg.v14i1a5","title":"On the independence number of intersection graphs of axis-parallel segments","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Corporate Governance and Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hausdorff Research Institute for Mathematics; European Commission","keywords":"Intersection graph; Conjecture; Independence number; Bounded function; Graph; Treewidth; Constant (computer programming); Block graph; Intersection (aeronautics)","score_opus":0.01289508226664382,"score_gpt":0.19978062925456713,"score_spread":0.1868855469879233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6944787213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7900641,0.00050813844,0.12818405,0.0021333843,0.00006908484,0.00010941078,0.001217152,0.00058444275,0.07713016],"genre_scores_gemma":[0.9687433,0.0005197817,0.022650413,0.00032862934,0.00015546099,0.0001622454,0.0016062823,0.00022939214,0.005604517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975739,0.0005153384,0.0000784121,0.0007632418,0.00058134797,0.00048768573],"domain_scores_gemma":[0.97216123,0.02083649,0.0024453076,0.0020052316,0.00082267344,0.0017290108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014873672,0.001095737,0.00090988394,0.0018699088,0.0024708395,0.0024476477,0.0024470482,0.0011550934,0.011629134],"category_scores_gemma":[0.013403376,0.0014390567,0.001288523,0.002247627,0.0035177679,0.005649104,0.00245802,0.0037939728,0.0012300793],"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.0020671096,0.00073556474,0.03516934,0.0007340437,0.0003009351,0.00095946074,0.0021807256,0.14544603,0.043892946,0.6817684,0.017123412,0.069622025],"study_design_scores_gemma":[0.00024709845,0.00030644052,0.02250081,0.000118829674,0.0003484527,0.0014660835,0.00045071897,0.44618982,0.03769156,0.475436,0.015104745,0.00013948367],"about_ca_topic_score_codex":0.003017278,"about_ca_topic_score_gemma":0.00347058,"teacher_disagreement_score":0.011629134,"about_ca_system_score_codex":0.0022915353,"about_ca_system_score_gemma":0.0008609696,"threshold_uncertainty_score":0.038903356},"labels":[],"label_agreement":null},{"id":"W6945050253","doi":"10.20382/jocg.v16i1a8","title":"Reconfiguration of colorings in triangulations of the sphere","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Triangulation; Vertex (graph theory); Sequence (biology); Characterization (materials science); Generalization; Point set triangulation","score_opus":0.009465094711338476,"score_gpt":0.20897086399816722,"score_spread":0.19950576928682875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945050253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64768547,0.0007327271,0.3110776,0.0005470406,0.00025988332,0.00032863737,0.0014196301,0.0035025897,0.03444637],"genre_scores_gemma":[0.8517231,0.00041785004,0.13493563,0.00015656829,0.00006357683,0.00019693653,0.0020913642,0.00037618895,0.010038798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982888,0.00023929983,0.00012280505,0.0004447334,0.0004391871,0.00046519507],"domain_scores_gemma":[0.99737096,0.0008256206,0.0004433357,0.0007362582,0.000362004,0.00026180316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004132214,0.00061108253,0.0007380522,0.00074825686,0.0012693361,0.0014196377,0.0011146229,0.000645425,0.0058232383],"category_scores_gemma":[0.0038353775,0.00065627747,0.0011439343,0.0015554826,0.0014991538,0.0016536484,0.0017000093,0.0011465444,0.0011068254],"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.0018671671,0.00023204405,0.010508902,0.0007097501,0.00014765197,0.0018491143,0.0018675615,0.48235267,0.11068704,0.19861637,0.012517403,0.17864434],"study_design_scores_gemma":[0.00026937944,0.00053104217,0.00744131,0.0000954621,0.000086059525,0.00085503026,0.0010842454,0.5971321,0.057644002,0.29781973,0.036866575,0.00017506252],"about_ca_topic_score_codex":0.011766005,"about_ca_topic_score_gemma":0.012251334,"teacher_disagreement_score":0.011766005,"about_ca_system_score_codex":0.0020804943,"about_ca_system_score_gemma":0.0010354123,"threshold_uncertainty_score":0.023395061},"labels":[],"label_agreement":null},{"id":"W6962973369","doi":"10.20382/jocg.v9i2","title":"Journal of Computational Geometry, Vol. 9 No. 2 (2018): Special Issue of Selected Papers from SoCG 2017","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Special section; Key (lock); Field (mathematics)","score_opus":0.010448174499178491,"score_gpt":0.21760109500716734,"score_spread":0.20715292050798886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6962973369","genre_codex":"editorial","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.006902927,0.2169567,0.043474358,0.046477687,0.46974906,0.00028240634,0.0066237836,0.0023838936,0.20714912],"genre_scores_gemma":[0.038088568,0.19187471,0.029706713,0.0066380827,0.2763037,0.00023306451,0.017469931,0.00654409,0.43314108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970298,0.00026244993,0.00020844028,0.00058870146,0.0017543755,0.00015610443],"domain_scores_gemma":[0.992097,0.0018854459,0.0002953378,0.0010492916,0.0033749084,0.0012979995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023636837,0.0017034684,0.0022611248,0.0055058687,0.0017229739,0.00690258,0.0016033112,0.0014935462,0.089414604],"category_scores_gemma":[0.009267996,0.0008657649,0.0012292824,0.0052642445,0.0014803128,0.0041896896,0.0032784974,0.003803522,0.037086237],"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.000047890207,0.000030200117,0.0004950007,0.0006673354,0.00003984945,0.00006373652,0.00003707635,0.0006645398,0.00063238025,0.01053411,0.8969283,0.08985954],"study_design_scores_gemma":[0.000017891292,0.00004165376,0.0013474906,0.0004478329,0.00003148091,0.0004306878,0.00006424556,0.0012943271,0.0006114916,0.017678006,0.9780131,0.000021762604],"about_ca_topic_score_codex":0.0018137314,"about_ca_topic_score_gemma":0.0046193292,"teacher_disagreement_score":0.089414604,"about_ca_system_score_codex":0.0030556165,"about_ca_system_score_gemma":0.0038165818,"threshold_uncertainty_score":0.29912162},"labels":[],"label_agreement":null},{"id":"W6963147319","doi":"10.20382/jocg.v15i2a7","title":"Worst-case deterministic fully-dynamic biconnectivity in changeable planar embeddings","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission","keywords":"Embedding; Vertex (graph theory); Planar; Enhanced Data Rates for GSM Evolution; Planar straight-line graph; Planar graph; Book embedding","score_opus":0.010769732400275622,"score_gpt":0.2355317721607354,"score_spread":0.22476203976045978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6963147319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81123525,0.0010214188,0.17212391,0.001629299,0.00008868161,0.00026493703,0.0020227102,0.003631831,0.00798186],"genre_scores_gemma":[0.9556412,0.0001344017,0.04137643,0.00015144993,0.000025356234,0.00009321087,0.0010668107,0.00031954472,0.0011916107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584645,0.00087055255,0.00026566844,0.00095690676,0.0010413458,0.0010190367],"domain_scores_gemma":[0.982614,0.010298765,0.0013475238,0.00389773,0.0010773571,0.00076466077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023978893,0.0010969924,0.0012898498,0.0007246766,0.0013286177,0.0026517804,0.0041978084,0.0020076383,0.0036891778],"category_scores_gemma":[0.02174983,0.0011102421,0.00073263596,0.0015497338,0.002043883,0.0067509026,0.003207291,0.0012461012,0.00049660035],"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.0017952975,0.00028994065,0.0072624693,0.00039197103,0.00014130145,0.0004940393,0.00037836653,0.9128907,0.012659015,0.015337209,0.0066530495,0.041706663],"study_design_scores_gemma":[0.00008654075,0.00014478467,0.0006374755,0.0000099518675,0.000050607807,0.00021118102,0.00018657715,0.9753982,0.0040581087,0.018042522,0.0011519925,0.000022147025],"about_ca_topic_score_codex":0.005789129,"about_ca_topic_score_gemma":0.009525684,"teacher_disagreement_score":0.005789129,"about_ca_system_score_codex":0.0019755927,"about_ca_system_score_gemma":0.00167656,"threshold_uncertainty_score":0.014334023},"labels":[],"label_agreement":null},{"id":"W6963357116","doi":"10.20382/jocg.v14i1a3","title":"SPQR-tree-like embedding representation for level planarity","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Planarity testing; Embedding; Book embedding; Representation (politics); Planar; Graph; Graph embedding; Planar graph","score_opus":0.05386085989245618,"score_gpt":0.2875350460733845,"score_spread":0.2336741861809283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6963357116","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.007970592,0.00009584981,0.9817114,0.00014792949,0.00006320392,0.00007030515,0.0022999304,0.0042504123,0.003390334],"genre_scores_gemma":[0.16257302,0.0002894598,0.81904197,0.00017822527,0.00005833522,0.00047427826,0.010678755,0.0017325949,0.0049733073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926084,0.00008226273,0.00009260459,0.0001679945,0.00031048444,0.000085904074],"domain_scores_gemma":[0.9980276,0.00038463186,0.00017511017,0.00076332607,0.0005713399,0.00007791169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006238635,0.00080927456,0.00083917764,0.0017725081,0.0006450754,0.002229168,0.0021398694,0.0011816572,0.014308555],"category_scores_gemma":[0.004789654,0.0005406435,0.0010654929,0.0030582673,0.00096058525,0.0051410547,0.0027934187,0.002198354,0.0051024393],"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.00038013136,0.00014971524,0.0019799282,0.0006868621,0.00005510863,0.0002938618,0.00065940263,0.11511914,0.020599639,0.38424867,0.046803523,0.42902407],"study_design_scores_gemma":[0.0000672747,0.00021788139,0.00054808374,0.00012524119,0.000040565083,0.00042547233,0.00033426084,0.5976528,0.020536918,0.2859372,0.09402271,0.000091647635],"about_ca_topic_score_codex":0.0020286911,"about_ca_topic_score_gemma":0.0032897901,"teacher_disagreement_score":0.014308555,"about_ca_system_score_codex":0.000780231,"about_ca_system_score_gemma":0.0009040035,"threshold_uncertainty_score":0.04786682},"labels":[],"label_agreement":null},{"id":"W6963620429","doi":"10.20382/jocg.v6i1","title":"Journal of Computational Geometry, Vol. 6 No. 1 (2015)","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key (lock); Feature (linguistics); Field (mathematics); Set (abstract data type)","score_opus":0.019324206576099366,"score_gpt":0.23472078616059794,"score_spread":0.21539657958449857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6963620429","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.029241458,0.14297363,0.34989625,0.021046126,0.021973884,0.00017814519,0.0023533762,0.0022287567,0.4301084],"genre_scores_gemma":[0.30126095,0.12102366,0.24143769,0.0036717127,0.009911295,0.00020253408,0.004487193,0.002862429,0.31514257],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841464,0.00023903689,0.00011795563,0.0003054271,0.0008662161,0.00005672336],"domain_scores_gemma":[0.9980254,0.0003726214,0.00011407897,0.00061426737,0.0006760848,0.00019747618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013185613,0.0009448315,0.0011104345,0.0021646298,0.0012774068,0.0073130345,0.0009686231,0.00094407966,0.04826329],"category_scores_gemma":[0.0045066704,0.0007355374,0.0009444994,0.0022554111,0.0030714,0.0026330687,0.003062281,0.0033839955,0.012074415],"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.000104404215,0.000078270125,0.0035894602,0.0009190476,0.00017722769,0.0002416778,0.00031330838,0.008338402,0.0056922236,0.34763396,0.25730255,0.37560943],"study_design_scores_gemma":[0.000028174776,0.00007172204,0.005197098,0.00032360782,0.0001115743,0.0018581818,0.0002799057,0.016090738,0.0021475367,0.31611684,0.6577212,0.000053455056],"about_ca_topic_score_codex":0.0029385933,"about_ca_topic_score_gemma":0.005426053,"teacher_disagreement_score":0.04826329,"about_ca_system_score_codex":0.0013110221,"about_ca_system_score_gemma":0.0022810302,"threshold_uncertainty_score":0.16145676},"labels":[],"label_agreement":null},{"id":"W7080542863","doi":"10.20382/jocg.v16i2a7","title":"Effective computation of the Heegaard genus of 3-manifolds","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computation; Heuristics; Triangulation; Normal surface; Invariant (physics); Surface (topology); Genus","score_opus":0.0054527288747362275,"score_gpt":0.20349819939743846,"score_spread":0.19804547052270224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7080542863","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.23647179,0.0009681768,0.73518914,0.0006076814,0.00012421866,0.00011219256,0.0011065861,0.0049862815,0.020433962],"genre_scores_gemma":[0.6298369,0.00043653013,0.36345354,0.00010225981,0.00005376004,0.00009998751,0.0019786977,0.0008143713,0.0032238602],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988978,0.00014841887,0.000073791045,0.00020430029,0.0005302004,0.00014535328],"domain_scores_gemma":[0.9975465,0.000784123,0.00017149809,0.0009457021,0.0004205999,0.0001316284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076529116,0.0010235665,0.0011722072,0.0036555526,0.0013407225,0.0025958994,0.0015239451,0.000881169,0.004295446],"category_scores_gemma":[0.008298368,0.00054975215,0.0010372131,0.0019690092,0.0016468655,0.005502501,0.0034353503,0.0014728416,0.0013099662],"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.0003829379,0.0001208956,0.01896976,0.000563901,0.00019331778,0.00033072376,0.0013147099,0.25864783,0.020680318,0.2619022,0.016075367,0.420818],"study_design_scores_gemma":[0.000044881628,0.00006674008,0.0045816037,0.00009751039,0.000035946927,0.00020523934,0.00045796944,0.6953128,0.014608574,0.27080122,0.013715539,0.00007200553],"about_ca_topic_score_codex":0.0040593334,"about_ca_topic_score_gemma":0.008040106,"teacher_disagreement_score":0.004295446,"about_ca_system_score_codex":0.0013353461,"about_ca_system_score_gemma":0.0013155951,"threshold_uncertainty_score":0.014369667},"labels":[],"label_agreement":null},{"id":"W7092295236","doi":"10.20382/jocg.v16i2a9","title":"Faster Fréchet distance approximation through truncated smoothing","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Medieval European History and Architecture","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Dimension (graph theory); Quadratic equation; Approximation algorithm; Measure (data warehouse); Smoothing; Constant (computer programming); Approximation theory; Time complexity","score_opus":0.015945536630000652,"score_gpt":0.20464051622226503,"score_spread":0.1886949795922644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092295236","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.021954067,0.0005221507,0.9684322,0.00025890546,0.00016450333,0.00005212216,0.00014716592,0.0037039698,0.0047648945],"genre_scores_gemma":[0.24356203,0.00044233337,0.73802686,0.00034695794,0.00015582421,0.00015204682,0.0011866628,0.0012108492,0.014916426],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983681,0.0001887561,0.00009470223,0.00039498287,0.000732391,0.0002210498],"domain_scores_gemma":[0.99724776,0.000893586,0.00015222606,0.0010183494,0.0005466212,0.00014147397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012388037,0.0013337942,0.0019710774,0.0018522957,0.00076913787,0.0019090916,0.0025558467,0.0019580799,0.009111183],"category_scores_gemma":[0.009349435,0.00055069954,0.0018569432,0.0020489213,0.0012104673,0.004042489,0.0031871884,0.0027610417,0.004072009],"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.000718433,0.0002312522,0.0021481118,0.0003362371,0.00012945775,0.00024196225,0.00060539594,0.3251897,0.022911184,0.15139163,0.019556044,0.47654065],"study_design_scores_gemma":[0.000024376477,0.000029402296,0.00016412254,0.000017890392,0.000012248299,0.000049294882,0.000027071894,0.95728934,0.0021341988,0.035603765,0.0046295677,0.000018769597],"about_ca_topic_score_codex":0.012795397,"about_ca_topic_score_gemma":0.011786088,"teacher_disagreement_score":0.012795397,"about_ca_system_score_codex":0.0020312413,"about_ca_system_score_gemma":0.0019106442,"threshold_uncertainty_score":0.030479968},"labels":[],"label_agreement":null},{"id":"W7104289419","doi":"10.20382/jocg.v16i1a16","title":"Dynamic unit-disk range reporting","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Amortized analysis; Data structure; Set (abstract data type); Range (aeronautics); Point (geometry); Range query (database); Constant (computer programming); Space (punctuation)","score_opus":0.014139266720189333,"score_gpt":0.25532853712106013,"score_spread":0.2411892704008708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104289419","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.08413739,0.0032557647,0.8732632,0.0011830012,0.0002451627,0.00029276003,0.0030605663,0.015652452,0.018909793],"genre_scores_gemma":[0.52182364,0.001618611,0.45592365,0.0006091424,0.00017238686,0.00036706278,0.006568768,0.0011991324,0.011717579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960639,0.0004909722,0.00041332276,0.0009919108,0.0014819927,0.00055795757],"domain_scores_gemma":[0.9868527,0.0019599972,0.00092785596,0.008459306,0.0013983271,0.00040189407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558284,0.00093382434,0.001527896,0.0019833313,0.0011113457,0.003609465,0.007981242,0.0013785536,0.008380121],"category_scores_gemma":[0.011867522,0.00090609293,0.0009813379,0.005602256,0.0009956022,0.01120498,0.0069035995,0.002012922,0.0039073965],"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.0021390778,0.0005478687,0.00945056,0.0009044168,0.00024002741,0.0005461188,0.0013929557,0.072823346,0.03683689,0.077836044,0.05758813,0.73969454],"study_design_scores_gemma":[0.000261862,0.0006192191,0.0038446353,0.00023057882,0.00024187416,0.0025968484,0.0014157733,0.6707195,0.097269975,0.10783931,0.11464642,0.00031400583],"about_ca_topic_score_codex":0.0032632933,"about_ca_topic_score_gemma":0.0025041145,"teacher_disagreement_score":0.008380121,"about_ca_system_score_codex":0.0011792324,"about_ca_system_score_gemma":0.0014461234,"threshold_uncertainty_score":0.02803427},"labels":[],"label_agreement":null},{"id":"W7105854729","doi":"10.20382/jocg.v16i1a17","title":"Folding polyominoes into cubes","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyomino; Cube (algebra); Simple (philosophy); Unit cube; Folding (DSP implementation); Square (algebra)","score_opus":0.005011217730162019,"score_gpt":0.19439734239453516,"score_spread":0.18938612466437313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105854729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7395115,0.00045962277,0.23596182,0.00018824117,0.00016340085,0.00010355887,0.0005149981,0.0007452677,0.022351492],"genre_scores_gemma":[0.8149391,0.00051734096,0.17192158,0.00016390096,0.00004615092,0.000120963,0.0013446666,0.00020921291,0.010737142],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955386,0.000048448277,0.000051223087,0.00018110024,0.000084348125,0.000080981146],"domain_scores_gemma":[0.9988794,0.00027878548,0.0002243923,0.00038260216,0.00012597848,0.00010896593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023049835,0.00040564977,0.00046534455,0.00032091726,0.00060730014,0.0009286693,0.00044618346,0.0004988836,0.0041109775],"category_scores_gemma":[0.0017477045,0.0002780172,0.0007373622,0.0005604375,0.0010399781,0.0023723792,0.0011129519,0.00065861526,0.00086372346],"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.0016641514,0.00020297976,0.022701709,0.00082113413,0.00010454164,0.0020035708,0.0016271843,0.12169761,0.1993146,0.27346757,0.007127119,0.36926788],"study_design_scores_gemma":[0.00009891772,0.00132945,0.021177834,0.00044618058,0.000121759076,0.0041373638,0.003298256,0.2634884,0.1509645,0.47832263,0.07639645,0.00021837938],"about_ca_topic_score_codex":0.0005344559,"about_ca_topic_score_gemma":0.000758257,"teacher_disagreement_score":0.0041109775,"about_ca_system_score_codex":0.0002674984,"about_ca_system_score_gemma":0.00027323852,"threshold_uncertainty_score":0.013752639},"labels":[],"label_agreement":null},{"id":"W7106146625","doi":"10.20382/jocg.v16i1a18","title":"An algorithm to construct one-vertex triangulations of Heegaard splittings","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Triangulation; Construct (python library); Boundary (topology); Heegaard splitting; Diagram; Bounded function","score_opus":0.02602626743368361,"score_gpt":0.29063889604352605,"score_spread":0.26461262860984247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106146625","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.040772565,0.00007457158,0.94644594,0.00009942399,0.000057726873,0.00016302572,0.00023083681,0.0024692258,0.009686619],"genre_scores_gemma":[0.13558026,0.000069603215,0.85908276,0.00003690494,0.000009538346,0.00009120813,0.0005008803,0.00049173523,0.0041370816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946386,0.0000759194,0.000039190203,0.00012864787,0.00019637232,0.00009605562],"domain_scores_gemma":[0.9990723,0.00026591864,0.000056976358,0.00034027934,0.00018846263,0.000076088945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000555342,0.0005183561,0.00073649734,0.0012658607,0.00092627225,0.0011286314,0.0013487232,0.0008069571,0.009639532],"category_scores_gemma":[0.0022572447,0.000575064,0.0011817433,0.0008684844,0.00086797314,0.0016737856,0.0029666922,0.0012974828,0.0029227159],"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.00029690735,0.0001525432,0.002811832,0.00047548936,0.00007176074,0.00042509031,0.0023331076,0.04001562,0.06078439,0.29078117,0.011467435,0.5903847],"study_design_scores_gemma":[0.00019570805,0.00045174244,0.0017014676,0.00020597865,0.00009493319,0.0011852676,0.0018516874,0.33830225,0.07704917,0.4582058,0.12057265,0.00018343457],"about_ca_topic_score_codex":0.0013976655,"about_ca_topic_score_gemma":0.0024645422,"teacher_disagreement_score":0.009639532,"about_ca_system_score_codex":0.0005306716,"about_ca_system_score_gemma":0.0006819928,"threshold_uncertainty_score":0.032247424},"labels":[],"label_agreement":null},{"id":"W7106834220","doi":"10.20382/jocg.v16i1a20","title":"Metric and geometric spanners that are resilient to degree-bounded edge faults","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of Windsor","funders":"","keywords":"Vertex (graph theory); Bounded function; Metric dimension; Graph; Metric space; Degree (music); Matching (statistics); Metric (unit)","score_opus":0.02504757245345905,"score_gpt":0.23151972834366497,"score_spread":0.20647215589020593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106834220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5790624,0.00097081607,0.38628456,0.0006599963,0.00022186973,0.00020675486,0.0007227715,0.0017471507,0.030123753],"genre_scores_gemma":[0.91293925,0.00068198645,0.074310735,0.0002848184,0.00013133603,0.0001571134,0.0013704532,0.00016533888,0.009959017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994836,0.000060840426,0.00003687059,0.00018374478,0.00013718723,0.00009782186],"domain_scores_gemma":[0.99866986,0.00025337777,0.00033663792,0.00036768639,0.00014959631,0.00022275928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034806295,0.0008509795,0.00067504303,0.00086059305,0.0005879026,0.0009573856,0.0007768606,0.00095497776,0.003844296],"category_scores_gemma":[0.003479264,0.000455877,0.000677859,0.0010428926,0.0010332867,0.0033724622,0.001795097,0.0009943135,0.0009257195],"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.000525108,0.00023329222,0.0047350987,0.0005033255,0.00014680346,0.00091457536,0.0009852097,0.18578441,0.05723265,0.5756346,0.009272594,0.16403225],"study_design_scores_gemma":[0.00008060263,0.0011971763,0.0051508793,0.00011716524,0.000119528195,0.0024182773,0.0007956021,0.18614705,0.029092344,0.7353267,0.039407864,0.00014674889],"about_ca_topic_score_codex":0.00034011598,"about_ca_topic_score_gemma":0.0005091053,"teacher_disagreement_score":0.003844296,"about_ca_system_score_codex":0.00044627176,"about_ca_system_score_gemma":0.00030322364,"threshold_uncertainty_score":0.012860417},"labels":[],"label_agreement":null},{"id":"W7111411162","doi":"10.20382/jocg.v16i2a10","title":"Fine-Grained Complexity of Earth Mover’s Distance Under Translation","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Translation (biology); Earth (classical element); Algebra over a field; Context (archaeology)","score_opus":0.0288278873048255,"score_gpt":0.24364669503923286,"score_spread":0.21481880773440737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111411162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.698425,0.0014983139,0.1761106,0.0048727375,0.0004252635,0.00009023062,0.0020474482,0.0008282259,0.11570225],"genre_scores_gemma":[0.9665127,0.00045468783,0.016286157,0.0002217485,0.0003054534,0.000053922002,0.0008599497,0.00023970648,0.015065804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885476,0.0001695381,0.00007715178,0.0002698448,0.00039250136,0.00023626062],"domain_scores_gemma":[0.9940102,0.0033829568,0.0005092804,0.0010047315,0.00061011896,0.00048264588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010054642,0.00042528295,0.0010295288,0.002517762,0.0013761865,0.0037253525,0.0014629142,0.0012945007,0.01589355],"category_scores_gemma":[0.009404964,0.00039594172,0.0006799981,0.0018403542,0.002617182,0.0068158777,0.002412967,0.0020516748,0.0018304957],"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.000091330585,0.000025913003,0.0013369647,0.00007725849,0.000013928608,0.00015657226,0.0002606266,0.02236066,0.0009736959,0.95579016,0.0067153824,0.012197653],"study_design_scores_gemma":[0.000012620431,0.000018351064,0.00081291684,0.000011299544,0.000006589564,0.00013635748,0.00007292846,0.043898277,0.00047135592,0.95098877,0.0035547747,0.000015745043],"about_ca_topic_score_codex":0.002735469,"about_ca_topic_score_gemma":0.0018908422,"teacher_disagreement_score":0.01589355,"about_ca_system_score_codex":0.0019438927,"about_ca_system_score_gemma":0.0006459302,"threshold_uncertainty_score":0.05316919},"labels":[],"label_agreement":null},{"id":"W7111415984","doi":"10.20382/jocg.v16i1a19","title":"Excluding cosmetic surgeries on hyperbolic 3-manifolds","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knot (papermaking); Conjecture; Knot theory; Knot invariant; Tricolorability","score_opus":0.028274327781274325,"score_gpt":0.27788765871319915,"score_spread":0.24961333093192484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111415984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9272839,0.000089710484,0.05097998,0.000161667,0.00005893274,0.000041930572,0.00066403626,0.0009591201,0.019760769],"genre_scores_gemma":[0.9846481,0.00006851803,0.012090754,0.000054782275,0.000018957073,0.000015716594,0.00085668155,0.00012609462,0.0021203444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989059,0.00011539317,0.00007838527,0.00021989144,0.00044061305,0.00023991955],"domain_scores_gemma":[0.99629444,0.0013968922,0.00044293003,0.0010825614,0.0004713797,0.0003117679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072135177,0.00054718717,0.0007127105,0.0010775734,0.0013441029,0.0013072161,0.0009791818,0.00055504014,0.0099194795],"category_scores_gemma":[0.005969475,0.00040132552,0.00076318503,0.00056372426,0.001987852,0.0030925074,0.00280629,0.0008984071,0.0012657407],"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.000999422,0.00022386824,0.086434186,0.00075819535,0.000082023005,0.003572602,0.0019621982,0.062058136,0.04130465,0.67936015,0.008714325,0.114530265],"study_design_scores_gemma":[0.000074464246,0.00045292047,0.01895145,0.00017943874,0.000090762886,0.0023117014,0.002338882,0.1626353,0.06600633,0.72739923,0.019413067,0.0001464838],"about_ca_topic_score_codex":0.0016248425,"about_ca_topic_score_gemma":0.0020330371,"teacher_disagreement_score":0.0099194795,"about_ca_system_score_codex":0.00047279178,"about_ca_system_score_gemma":0.0007348186,"threshold_uncertainty_score":0.033183992},"labels":[],"label_agreement":null},{"id":"W7116395976","doi":"10.20382/jocg.v16i2a11","title":"A universal in-place reconfiguration algorithm for sliding cube-shaped robots in a quadratic number of moves","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Control reconfiguration; Modular design; Bounding overwatch; Robot; Self-reconfiguring modular robot; Quadratic equation; Dimension (graph theory)","score_opus":0.009690633517852007,"score_gpt":0.23696810727055426,"score_spread":0.22727747375270224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116395976","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.07142078,0.00045140658,0.9151269,0.00022021483,0.00008980575,0.00015936868,0.00013533793,0.004107212,0.008288845],"genre_scores_gemma":[0.58828795,0.00020643648,0.4048326,0.0002078533,0.000034336423,0.00025362257,0.0004689987,0.00030536987,0.005402829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993554,0.00009934125,0.00003939917,0.00021930037,0.00012053512,0.00016601785],"domain_scores_gemma":[0.9992618,0.00027864843,0.000102489474,0.00019685383,0.00007154011,0.00008860399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055900717,0.0010952277,0.0013072902,0.00049143017,0.0008318658,0.0008612346,0.002007541,0.0009266223,0.004001648],"category_scores_gemma":[0.0020895656,0.0004727803,0.0006505433,0.00073914847,0.0010866942,0.0015350365,0.001956488,0.0009823405,0.0009301056],"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.00048651962,0.00014386087,0.0010255338,0.00026594728,0.000060527876,0.0002376998,0.0002660982,0.72841567,0.014459948,0.0404789,0.007159803,0.20699954],"study_design_scores_gemma":[0.00008850119,0.00014802825,0.000215776,0.000017655106,0.000021722406,0.00012327736,0.000060151684,0.9754361,0.0040325434,0.017384399,0.0024504198,0.00002158846],"about_ca_topic_score_codex":0.0031150898,"about_ca_topic_score_gemma":0.003798699,"teacher_disagreement_score":0.004001648,"about_ca_system_score_codex":0.001170316,"about_ca_system_score_gemma":0.0011689411,"threshold_uncertainty_score":0.013386846},"labels":[],"label_agreement":null},{"id":"W7124446922","doi":"10.20382/jocgv16i1a22","title":"Optimal in-place compaction of sliding cubes","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Focus (optics); Control reconfiguration; Modular design; Robot; Control theory (sociology); Ideal (ethics); Topology (electrical circuits)","score_opus":0.010272908179110432,"score_gpt":0.2132085274568037,"score_spread":0.20293561927769327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124446922","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.14396508,0.00028016666,0.84333843,0.00023039727,0.00007976978,0.00009338082,0.00017859772,0.0018957686,0.009938541],"genre_scores_gemma":[0.7925854,0.00016383092,0.20286207,0.00007820025,0.000025613661,0.00012068527,0.00034605726,0.00018727215,0.0036309073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951017,0.00010275505,0.000033552456,0.00010165851,0.0001414616,0.00011036673],"domain_scores_gemma":[0.99894637,0.0003483773,0.000112533045,0.00039145848,0.00012669008,0.000074580246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004023224,0.0006041385,0.00085794774,0.0004713237,0.0005069427,0.00087977055,0.0012138439,0.00064023153,0.004208448],"category_scores_gemma":[0.0028794403,0.00031264473,0.00039578282,0.00084888045,0.00076927576,0.0015051443,0.0016002305,0.0005424566,0.00070327544],"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.0004989521,0.00011903539,0.0014194079,0.00018783972,0.00004106827,0.0002797423,0.0002674395,0.69099355,0.026697041,0.05962624,0.0058978214,0.21397188],"study_design_scores_gemma":[0.000034227054,0.0001213053,0.0002975714,0.000013637479,0.000011574055,0.00010733933,0.000092461356,0.9552114,0.016789824,0.024389522,0.0029160234,0.000015211342],"about_ca_topic_score_codex":0.0012029542,"about_ca_topic_score_gemma":0.0018854118,"teacher_disagreement_score":0.004208448,"about_ca_system_score_codex":0.0005723365,"about_ca_system_score_gemma":0.0006103602,"threshold_uncertainty_score":0.014078677},"labels":[],"label_agreement":null},{"id":"W7127190243","doi":"10.20382/jocg.v16i2a5","title":"A quadtree, a Steiner spanner, and approximate nearest neighbours in hyperbolic space","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Euclidean geometry; Euclidean space; Point (geometry); Hyperbolic geometry; Simple (philosophy); Spanner; Hyperbolic tree; Space (punctuation)","score_opus":0.006018767731506937,"score_gpt":0.20835488728107207,"score_spread":0.20233611954956512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127190243","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.11617209,0.00062016706,0.872998,0.00038854612,0.000091079535,0.00009770484,0.0010040279,0.0010877905,0.00754063],"genre_scores_gemma":[0.31862408,0.0006296534,0.67280674,0.0001421593,0.00004981626,0.0001522409,0.0019183767,0.00021063628,0.0054663904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994005,0.000076911696,0.00007073439,0.00014496934,0.00024276409,0.000064033266],"domain_scores_gemma":[0.9992567,0.00013384031,0.000100351856,0.00030941045,0.00012022498,0.00007955781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041474568,0.0003699855,0.00071886403,0.0011890613,0.00061562035,0.00103547,0.0011686789,0.00069990894,0.0029290484],"category_scores_gemma":[0.0019934808,0.0003568206,0.00058356486,0.0021679106,0.00092504773,0.0040685837,0.0024387504,0.0009493075,0.0013014866],"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.00045631084,0.00017202017,0.003534455,0.00041822952,0.000058015274,0.00039895411,0.0008087894,0.16239847,0.0302424,0.46934423,0.008505435,0.3236626],"study_design_scores_gemma":[0.000074325726,0.0004854952,0.0015690012,0.00008357359,0.00003629013,0.00095593435,0.00047032727,0.5668485,0.028549438,0.35769945,0.043128572,0.00009909241],"about_ca_topic_score_codex":0.0018749258,"about_ca_topic_score_gemma":0.0026645064,"teacher_disagreement_score":0.0029290484,"about_ca_system_score_codex":0.00069395755,"about_ca_system_score_gemma":0.0006034899,"threshold_uncertainty_score":0.009798706},"labels":[],"label_agreement":null},{"id":"W7133355104","doi":"10.20382/jocg.v17i1a1","title":"Relating interleaving and Fréchet distances via ordered merge trees","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interleaving; Merge (version control); Monotone polygon; Topology (electrical circuits); Binary number","score_opus":0.0072092613714521804,"score_gpt":0.21682045112091128,"score_spread":0.2096111897494591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133355104","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.086881526,0.0011103721,0.9046676,0.0004227689,0.000083293235,0.00007397975,0.00038232363,0.00038605457,0.0059920596],"genre_scores_gemma":[0.5750048,0.0014090183,0.41622046,0.000270595,0.000229796,0.00026602607,0.0014597644,0.00033673536,0.0048028002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666363,0.00074051507,0.0003475842,0.00079098926,0.0011825906,0.0002746742],"domain_scores_gemma":[0.98007154,0.012009575,0.0024528136,0.0025851368,0.0021774203,0.00070344075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024884513,0.0010044082,0.0010406323,0.0059643476,0.0017797481,0.003985767,0.0016409695,0.0019069468,0.0031446845],"category_scores_gemma":[0.027378047,0.00069019705,0.0010004663,0.0056478744,0.003602237,0.0138637405,0.004932082,0.0031630925,0.00077259156],"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.00017753683,0.000081729384,0.0058628465,0.00021636118,0.00006934947,0.0002523317,0.000980553,0.080211595,0.003158169,0.7908035,0.0017823587,0.11640362],"study_design_scores_gemma":[0.0000135694745,0.00010107803,0.0014916265,0.00005267778,0.000033136694,0.00028267666,0.00026475234,0.1390239,0.002557584,0.8480965,0.008023411,0.000059100606],"about_ca_topic_score_codex":0.0024760726,"about_ca_topic_score_gemma":0.0023038227,"teacher_disagreement_score":0.0059643476,"about_ca_system_score_codex":0.0022872558,"about_ca_system_score_gemma":0.0010871912,"threshold_uncertainty_score":0.016595244},"labels":[],"label_agreement":null}]}