{"meta":{"query_hash":"ff566d36509f","filters":{"topic":"Digital Image Processing Techniques"},"cohort_total":246,"direct_labels_cover":0,"predictions_cover":246,"exported":246,"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/ff566d36509f","api":"https://metacan.xera.ac/api/v1/cohort?topic=Digital+Image+Processing+Techniques"},"results":[{"id":"W1024002114","doi":"","title":"Caractérisation des infrastructures à l'aide des diagraphies d'imagerie optique et acoustique","year":2011,"lang":"fr","type":"article","venue":"Knowledge UdeS (Institutional Deposit of the University of Sherbrooke)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Physics","score_opus":0.033215978119406395,"score_gpt":0.22888240726465361,"score_spread":0.19566642914524723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1024002114","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.27945527,0.0007410826,0.70476216,0.0002357803,0.00009283334,0.00015619434,0.0012867122,0.0024457444,0.010824221],"genre_scores_gemma":[0.56042206,0.0009726561,0.42634103,0.00005789201,0.000020350362,0.00013784991,0.0012807009,0.00029070166,0.0104767885],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996512,0.00003649995,0.000016246137,0.00008158649,0.00017783423,0.000036653186],"domain_scores_gemma":[0.99932635,0.0002349045,0.00008765183,0.0000714914,0.00025168931,0.000027855867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042022255,0.000740627,0.00029280057,0.001735897,0.0002628804,0.0010665165,0.00043284724,0.0006698384,0.005704647],"category_scores_gemma":[0.0012913714,0.0004798291,0.00043248243,0.0010788497,0.00031538607,0.0009231472,0.00048501388,0.00047979457,0.0021149495],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00028437312,0.000066595974,0.023337342,0.0011642257,0.00007613808,0.00042061624,0.0013513197,0.04374024,0.57648593,0.003671827,0.0025152352,0.3468862],"study_design_scores_gemma":[0.000043555992,0.00052945595,0.15336387,0.0002724943,0.00016655195,0.0016418981,0.0035551975,0.37570953,0.41342777,0.003847271,0.047140624,0.00030186513],"about_ca_topic_score_codex":0.004679194,"about_ca_topic_score_gemma":0.010504371,"teacher_disagreement_score":0.005704647,"about_ca_system_score_codex":0.00030454824,"about_ca_system_score_gemma":0.00069321593,"threshold_uncertainty_score":0.019083917},"labels":[],"label_agreement":null},{"id":"W102783733","doi":"","title":"Orthogonal Labeling of Constant Weight Gray Codes by Partitions With Blocks Of Size At Most Two.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"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":"Mathematics; Gray (unit); Constant (computer programming); Combinatorics; Computer science","score_opus":0.0070732105087022365,"score_gpt":0.23245894963254163,"score_spread":0.22538573912383938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102783733","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.45241225,0.0006287971,0.44573063,0.00087823084,0.00035963187,0.00016094757,0.0011334021,0.0010874431,0.09760868],"genre_scores_gemma":[0.79673153,0.0007147005,0.15856665,0.00044674575,0.000179476,0.00023387175,0.0017884696,0.0004956758,0.040842783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948597,0.00011918358,0.000028184155,0.00008458162,0.000118213124,0.0001638193],"domain_scores_gemma":[0.99855894,0.00041712972,0.00019906627,0.00044835836,0.00019769276,0.00017883794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031688553,0.0003901956,0.00034087978,0.00096552685,0.00088127353,0.0013948393,0.00048655027,0.00043880643,0.007266409],"category_scores_gemma":[0.0022152185,0.00027084173,0.0003088217,0.0011846968,0.0010001904,0.0013078183,0.0015844739,0.0008035073,0.0016568122],"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.0012026224,0.00017443163,0.001485015,0.00020844105,0.000029283383,0.00027075666,0.00035957934,0.008430957,0.050042886,0.777688,0.01690095,0.14320704],"study_design_scores_gemma":[0.00018079844,0.00026530094,0.0017756061,0.00009388711,0.00006215592,0.0006235467,0.00034933895,0.060578983,0.045625083,0.8395114,0.050868955,0.00006493076],"about_ca_topic_score_codex":0.00091166334,"about_ca_topic_score_gemma":0.0016261643,"teacher_disagreement_score":0.007266409,"about_ca_system_score_codex":0.0006147572,"about_ca_system_score_gemma":0.00061911397,"threshold_uncertainty_score":0.024308562},"labels":[],"label_agreement":null},{"id":"W116373001","doi":"10.22260/isarc2013/0157","title":"Automated Measuring and Tracking the Deformations of Concentrically Braced Frames","year":2013,"lang":"en","type":"article","venue":"Proceedings of the ... ISARC","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Deformation (meteorology); Computer science; Tracking (education); Automation; Reliability (semiconductor); Measure (data warehouse); Frame (networking); Artificial intelligence; Topology (electrical circuits); Structural engineering; Mechanical engineering; Engineering; Data mining; Physics; Electrical engineering","score_opus":0.016386422677017874,"score_gpt":0.22897324652791964,"score_spread":0.21258682385090177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116373001","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.26995686,0.00024017041,0.7262095,0.00004877846,0.0000565969,0.00010354386,0.00014338222,0.0012930233,0.001948118],"genre_scores_gemma":[0.66167617,0.00023949135,0.3365257,0.000022637585,0.000023982378,0.000070536415,0.00019300592,0.00007505255,0.0011733522],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993642,0.00006846495,0.000026317268,0.00018755684,0.00029121104,0.00006235208],"domain_scores_gemma":[0.99909365,0.00016914918,0.00023666443,0.00021350959,0.00025317393,0.000033786244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004597536,0.000715676,0.0005221255,0.0015883241,0.00026823874,0.0005062828,0.0007539942,0.0005996628,0.0006392033],"category_scores_gemma":[0.001297119,0.00029918275,0.00022565697,0.0011258797,0.00044852035,0.0005766524,0.00048092508,0.00037076834,0.00041619502],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00026723306,0.00009828199,0.0070846495,0.0001411508,0.000038605962,0.0002170631,0.00029388923,0.019734856,0.57470423,0.0013635887,0.0008910886,0.3951653],"study_design_scores_gemma":[0.000031109397,0.0003816268,0.0531125,0.000033860968,0.00006141406,0.0010383693,0.0001773862,0.48259938,0.45698744,0.0012254581,0.004241895,0.00010956534],"about_ca_topic_score_codex":0.0013416384,"about_ca_topic_score_gemma":0.00211948,"teacher_disagreement_score":0.0015883241,"about_ca_system_score_codex":0.00031325725,"about_ca_system_score_gemma":0.0004961317,"threshold_uncertainty_score":0.0026676655},"labels":[],"label_agreement":null},{"id":"W122461578","doi":"","title":"On Sets of Orthogonal d-Cubes.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"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":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.018300753752118277,"score_gpt":0.25539563314410674,"score_spread":0.23709487939198845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122461578","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.151291,0.0043257535,0.6607005,0.0016476259,0.0009896609,0.00016205193,0.0021588274,0.00054152345,0.17818302],"genre_scores_gemma":[0.60340476,0.005377249,0.31405172,0.0014319617,0.0009845465,0.0005397087,0.004849302,0.0005813003,0.06877947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844736,0.0003783649,0.00015015967,0.00025990978,0.0005401993,0.00022391247],"domain_scores_gemma":[0.9972933,0.0012243184,0.0003399537,0.00043037088,0.0004178917,0.00029421496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085183466,0.0008845073,0.0009632486,0.0033993267,0.0017972157,0.004005011,0.001177076,0.00072740513,0.011531954],"category_scores_gemma":[0.005112206,0.00057538773,0.0011670503,0.0031789325,0.0023434367,0.004565646,0.0057730605,0.0023530147,0.0030061216],"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.00006197267,0.000020193205,0.00036834722,0.000087168904,0.000021143718,0.000096691496,0.0001302948,0.0019339832,0.0008608585,0.96719736,0.004326836,0.024895186],"study_design_scores_gemma":[0.000014539874,0.00001954413,0.0002892726,0.000058520858,0.000012694342,0.00027763308,0.00014443527,0.01004931,0.00079916517,0.97264534,0.015674576,0.000014890923],"about_ca_topic_score_codex":0.0011666679,"about_ca_topic_score_gemma":0.0017200385,"teacher_disagreement_score":0.011531954,"about_ca_system_score_codex":0.0012665855,"about_ca_system_score_gemma":0.0005251394,"threshold_uncertainty_score":0.038578212},"labels":[],"label_agreement":null},{"id":"W142587239","doi":"","title":"All graphs are set reconstructible if all 2-connected graphs are set reconstructible.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"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":"Mathematics; Set (abstract data type); Computer science; Programming language","score_opus":0.02561773521238148,"score_gpt":0.2717130375520703,"score_spread":0.24609530233968885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142587239","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.42334703,0.0011283054,0.46518847,0.0018046664,0.0005033271,0.0003546577,0.0065854695,0.0032134736,0.09787466],"genre_scores_gemma":[0.8426248,0.0010139885,0.123900294,0.000555697,0.00027257358,0.00026852335,0.00876753,0.00049894897,0.022097634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870527,0.00021321094,0.00011344993,0.00035465683,0.00036173203,0.00025166175],"domain_scores_gemma":[0.99565965,0.0014451055,0.0006543402,0.001412536,0.000520232,0.0003081106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008514422,0.0010848131,0.0007984811,0.0022822677,0.0010964455,0.0036803985,0.001178168,0.001355552,0.01137913],"category_scores_gemma":[0.004165876,0.0006697914,0.0010597288,0.0015953971,0.002126801,0.004612117,0.0016003296,0.0018742871,0.0014818262],"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.0009573763,0.00021165739,0.0037961472,0.00066570815,0.00020160522,0.0016313998,0.00121656,0.017845483,0.015392105,0.84251666,0.016450977,0.09911435],"study_design_scores_gemma":[0.00006622706,0.0001209221,0.0027885016,0.00014995805,0.00012157694,0.002384031,0.00081803225,0.027272163,0.017166011,0.92178714,0.027235191,0.000090161186],"about_ca_topic_score_codex":0.0006578022,"about_ca_topic_score_gemma":0.0010026485,"teacher_disagreement_score":0.01137913,"about_ca_system_score_codex":0.00058740354,"about_ca_system_score_gemma":0.00048391274,"threshold_uncertainty_score":0.038066983},"labels":[],"label_agreement":null},{"id":"W1482008436","doi":"10.1007/978-3-540-79126-3_27","title":"On Minimal Moment of Inertia Polyominoes","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Moment of inertia; Mathematics; Regular polygon; Combinatorics; Roundness (object); Moment (physics); Polyomino; RADIUS; Plane (geometry); Geometry; Physics; Computer science; Classical mechanics","score_opus":0.017560843350735832,"score_gpt":0.2494118414217571,"score_spread":0.23185099807102127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482008436","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.2815342,0.0037710462,0.27037776,0.0025525095,0.0039058996,0.00016358719,0.00084835675,0.0005414291,0.4363052],"genre_scores_gemma":[0.8324879,0.0022553427,0.049382325,0.00093939726,0.0030391414,0.00025804728,0.0009045566,0.0007600811,0.10997331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995493,0.00007443434,0.000026927912,0.000098129916,0.00015330082,0.000097753495],"domain_scores_gemma":[0.99935,0.00022421282,0.000096721655,0.000067053836,0.00008590288,0.00017614146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052866427,0.001151953,0.0012711581,0.0025434834,0.0019262744,0.0021949816,0.0012337716,0.0010667249,0.0167924],"category_scores_gemma":[0.0016528402,0.0005515453,0.0010932877,0.0012817609,0.0030013022,0.003391114,0.00228796,0.0031149564,0.0018505853],"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.000042142805,0.000018544173,0.000066401124,0.000053628333,0.0000068134236,0.000042382624,0.00012841112,0.0005231861,0.0009883917,0.98590416,0.0026847704,0.009541134],"study_design_scores_gemma":[0.0000118939815,0.000027161124,0.00023441958,0.000019738009,0.0000058041815,0.00008967922,0.000045145003,0.0018351753,0.00031049357,0.99157906,0.005824707,0.000016679585],"about_ca_topic_score_codex":0.0004469964,"about_ca_topic_score_gemma":0.00073642045,"teacher_disagreement_score":0.0167924,"about_ca_system_score_codex":0.0009939224,"about_ca_system_score_gemma":0.000442762,"threshold_uncertainty_score":0.056176126},"labels":[],"label_agreement":null},{"id":"W1493438480","doi":"10.1201/b18472","title":"A Sampler of Useful Computational Tools for Applied Geometry, Computer Graphics, and Image Processing","year":2015,"lang":"en","type":"book","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer graphics (images); Computer science; Computer graphics; Graphics; Image processing; Computational science; Engineering drawing; Artificial intelligence; Image (mathematics); Engineering","score_opus":0.04651991246557205,"score_gpt":0.2835398940265273,"score_spread":0.23701998156095525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493438480","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.0029405633,0.10036804,0.25763455,0.009130223,0.010229075,0.00024132698,0.0014339288,0.0032337715,0.61478853],"genre_scores_gemma":[0.017688157,0.06608451,0.11449764,0.0036440792,0.0063882614,0.00035257603,0.0020631219,0.0028300104,0.7864516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991485,0.00010175593,0.000032793334,0.00011869186,0.0005535021,0.000044824625],"domain_scores_gemma":[0.99888617,0.00051394635,0.000035649336,0.00014054426,0.00031348344,0.00011022927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862532,0.001119774,0.0009052968,0.004342774,0.0014229566,0.0059910854,0.0012462515,0.0010752662,0.055775255],"category_scores_gemma":[0.0026109805,0.00076553336,0.0010905545,0.005661672,0.0018821527,0.0068894853,0.001956679,0.0041129594,0.025867648],"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.000024963208,0.00004467109,0.00014416588,0.00042022075,0.000015501102,0.00012561373,0.00032052124,0.0015661526,0.0016334157,0.4056608,0.36413985,0.22590412],"study_design_scores_gemma":[0.0000050700314,0.000016800393,0.00025484824,0.0002078565,0.0000060413913,0.00030041623,0.00006126661,0.002133332,0.00048523393,0.10213494,0.894379,0.000015237819],"about_ca_topic_score_codex":0.0013693933,"about_ca_topic_score_gemma":0.002849633,"teacher_disagreement_score":0.055775255,"about_ca_system_score_codex":0.0018927032,"about_ca_system_score_gemma":0.0012880352,"threshold_uncertainty_score":0.1865868},"labels":[],"label_agreement":null},{"id":"W1502738661","doi":"","title":"On Potentially Ck-graphic Sequences.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"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":"Mathematics","score_opus":0.016563136386097004,"score_gpt":0.23439978222847188,"score_spread":0.2178366458423749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502738661","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.22477609,0.0029973176,0.40463427,0.0015610352,0.0011217641,0.00019957226,0.0014080442,0.0019034146,0.3613986],"genre_scores_gemma":[0.76061165,0.002050202,0.09186827,0.00060449797,0.00041180864,0.00019284063,0.0018237676,0.0007225089,0.14171441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991897,0.00016945899,0.00006219404,0.00016746204,0.00023097424,0.00018027826],"domain_scores_gemma":[0.99810374,0.00088492583,0.00022849606,0.0002907711,0.0002703985,0.00022160436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047834875,0.0010113235,0.00056265655,0.0030257842,0.0016066801,0.0032816527,0.0008057035,0.00091017055,0.02868042],"category_scores_gemma":[0.0050286497,0.00041588646,0.0005410639,0.0025895603,0.001600136,0.0038868224,0.0025231696,0.0016447674,0.006889008],"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.0002605268,0.00005251212,0.0008015925,0.0002412735,0.000016912762,0.0008589251,0.00044222403,0.0023217932,0.0054129977,0.9083534,0.009879198,0.071358606],"study_design_scores_gemma":[0.000025988584,0.000050594877,0.00077997206,0.000114472954,0.000021901156,0.0011539378,0.00023658281,0.011553252,0.0047441144,0.9358172,0.045463327,0.000038602895],"about_ca_topic_score_codex":0.00090228673,"about_ca_topic_score_gemma":0.0021692323,"teacher_disagreement_score":0.02868042,"about_ca_system_score_codex":0.0009935295,"about_ca_system_score_gemma":0.00048458434,"threshold_uncertainty_score":0.09594554},"labels":[],"label_agreement":null},{"id":"W1503933166","doi":"","title":"The L(2, 1)-labeling problem on ditrees","year":2003,"lang":"en","type":"article","venue":"NTUR (臺灣機構典藏)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics","score_opus":0.011665651856836864,"score_gpt":0.2427690775612038,"score_spread":0.23110342570436693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503933166","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.13208386,0.001542697,0.81813157,0.00843117,0.00034577848,0.00037084904,0.007326577,0.0030598463,0.028707696],"genre_scores_gemma":[0.32561404,0.0013270655,0.6243357,0.0017152226,0.00048373913,0.0006634859,0.013868715,0.0018406039,0.030151494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997673,0.00084978755,0.00013495113,0.00067252776,0.0003096011,0.00036011002],"domain_scores_gemma":[0.99120855,0.006072513,0.00047658107,0.0013865061,0.00041512362,0.0004407894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018898515,0.0012559431,0.0027257951,0.0014105735,0.0025205105,0.004176461,0.003852738,0.0047579897,0.017292218],"category_scores_gemma":[0.01006043,0.0013856111,0.0013925378,0.0042451797,0.0019426858,0.009711659,0.0032024651,0.00408131,0.0030812188],"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.0010269666,0.000496426,0.0020857516,0.0013255215,0.00011010532,0.000447043,0.0008584863,0.14457387,0.004904601,0.39078996,0.10277295,0.35060838],"study_design_scores_gemma":[0.00020291394,0.000110509,0.0006056707,0.000121750396,0.000044863682,0.00026616378,0.0004515113,0.27469224,0.0029690773,0.7050071,0.015486292,0.000041898944],"about_ca_topic_score_codex":0.0056778253,"about_ca_topic_score_gemma":0.007211782,"teacher_disagreement_score":0.017292218,"about_ca_system_score_codex":0.0026794078,"about_ca_system_score_gemma":0.0022277047,"threshold_uncertainty_score":0.057848275},"labels":[],"label_agreement":null},{"id":"W1508115086","doi":"10.1007/3-540-45054-8_39","title":"Divergence-Based Medial Surfaces","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Medial axis; Computer science; Voronoi diagram; Computation; Surface (topology); Topology (electrical circuits); Algorithm; Heuristic; Artificial intelligence; Mathematics; Geometry","score_opus":0.01786626978284251,"score_gpt":0.247951898910027,"score_spread":0.2300856291271845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508115086","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.031177625,0.00089253735,0.9300942,0.00024217999,0.0002327934,0.00004822283,0.00011118909,0.0011436659,0.03605753],"genre_scores_gemma":[0.5073044,0.0013476002,0.42552122,0.00015002902,0.00018374877,0.000061873754,0.0005380755,0.0010889262,0.0638042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962676,0.000048940125,0.000019866291,0.0000563986,0.00022610226,0.00002194879],"domain_scores_gemma":[0.99949896,0.00013143978,0.00004065234,0.00010466589,0.00015348414,0.00007083467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004740416,0.00063294685,0.00074347504,0.0017270156,0.00057773787,0.0017475629,0.0010073386,0.0008743673,0.010259162],"category_scores_gemma":[0.0019476783,0.00047186005,0.00047594818,0.0009168128,0.0011207691,0.0021297308,0.0022481917,0.0016785748,0.0035001307],"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.00014696663,0.00004166751,0.00033008982,0.00016926066,0.0000195231,0.00014912919,0.00031465627,0.016336791,0.02356896,0.66296214,0.00600056,0.28996018],"study_design_scores_gemma":[0.000037376944,0.00011106968,0.00037465896,0.000057186968,0.00001807941,0.0012245305,0.00016120952,0.20006658,0.010825754,0.74440634,0.042664163,0.000052997857],"about_ca_topic_score_codex":0.0004395537,"about_ca_topic_score_gemma":0.00068407226,"teacher_disagreement_score":0.010259162,"about_ca_system_score_codex":0.00044805775,"about_ca_system_score_gemma":0.0002752088,"threshold_uncertainty_score":0.034320295},"labels":[],"label_agreement":null},{"id":"W1511887013","doi":"","title":"Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract).","year":2010,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Algorithm; Parallel computing; Cache; CPU cache; Merge (version control); Parallel algorithm; Thread (computing); Maxima; Range (aeronautics)","score_opus":0.03145713320249401,"score_gpt":0.302086021280564,"score_spread":0.27062888807807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511887013","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.008242895,0.0002660943,0.9858035,0.00025348458,0.000048470094,0.00007123025,0.00011916804,0.00083459116,0.0043606036],"genre_scores_gemma":[0.1363559,0.00031062964,0.8548017,0.00012777334,0.00009988211,0.0002654901,0.0006799686,0.0003188732,0.0070397398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914515,0.00020672599,0.000057877212,0.00019718727,0.0002616408,0.00013133512],"domain_scores_gemma":[0.9985447,0.000606917,0.0001388766,0.00043252073,0.00022186532,0.00005514034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009118854,0.0009673703,0.0007344676,0.0011193495,0.0010331932,0.0018951143,0.0017108587,0.0008773976,0.014961963],"category_scores_gemma":[0.004252838,0.00053285895,0.0009733643,0.002036615,0.0012157973,0.0038801061,0.0026237597,0.0014696529,0.0027333081],"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.00021887742,0.00013051415,0.0011049124,0.00037850472,0.000081038306,0.00010142916,0.00018684292,0.29707465,0.0068632904,0.3580651,0.017138993,0.31865588],"study_design_scores_gemma":[0.00006570761,0.00007084321,0.00034164145,0.000021700993,0.000022147753,0.00012636685,0.00006781376,0.6229123,0.004518896,0.35938236,0.01245455,0.000015736745],"about_ca_topic_score_codex":0.0016379099,"about_ca_topic_score_gemma":0.0029792748,"teacher_disagreement_score":0.014961963,"about_ca_system_score_codex":0.001493753,"about_ca_system_score_gemma":0.001130452,"threshold_uncertainty_score":0.050052762},"labels":[],"label_agreement":null},{"id":"W1516339609","doi":"10.1007/978-3-642-04397-0","title":"Discrete geometry for computer imagery : 15th IAPR international conference, DGCI 2009, Montréal, Canada, September 30-October 2, 2009, proceedings","year":2009,"lang":"en","type":"book","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Digital geometry; Discrete geometry; Mathematics; Digital topology; Geometry; Geometry processing; Algorithm; Topology (electrical circuits); Discrete mathematics; Image processing; Artificial intelligence; Digital image; Combinatorics; Computer science; Polygon mesh; Image (mathematics); Topological space","score_opus":0.013319635330527203,"score_gpt":0.24214540361310843,"score_spread":0.22882576828258122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516339609","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060682814,0.1051544,0.6625256,0.007364993,0.010293593,0.0002404652,0.003693625,0.009326455,0.19533268],"genre_scores_gemma":[0.03893264,0.08874558,0.30426002,0.00071476854,0.0030897518,0.00016340282,0.0059518083,0.0033078315,0.5548342],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960476,0.00003556638,0.000013928047,0.000074991185,0.00024737098,0.000023378116],"domain_scores_gemma":[0.99933726,0.0001225266,0.000015711968,0.00014130688,0.0003089138,0.000074268246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713633,0.0011715435,0.0013962834,0.0017158901,0.0006109838,0.0029134178,0.0014040987,0.0006389255,0.035692547],"category_scores_gemma":[0.0011736361,0.00061271054,0.000488277,0.0025502802,0.0011606943,0.0015710853,0.0012698778,0.0015273112,0.012972921],"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.000039408733,0.000034352393,0.0002597094,0.00035793014,0.000026982718,0.00005342946,0.00009313064,0.003513625,0.004057826,0.036598064,0.60133696,0.35362855],"study_design_scores_gemma":[0.00002082153,0.00004799273,0.001998137,0.00017936285,0.000027692402,0.00051527517,0.000118286654,0.026087835,0.0037157917,0.03329486,0.9339577,0.000036289886],"about_ca_topic_score_codex":0.021567065,"about_ca_topic_score_gemma":0.04242965,"teacher_disagreement_score":0.035692547,"about_ca_system_score_codex":0.001812891,"about_ca_system_score_gemma":0.0018032016,"threshold_uncertainty_score":0.11940342},"labels":[],"label_agreement":null},{"id":"W1526028264","doi":"10.3968/6128","title":"Investigation on Fitting Method of Snail Structural Lines","year":2015,"lang":"en","type":"article","venue":"Advances in natural science/Advances in natural sciences","topic":"Digital Image Processing Techniques","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":"Bionics; Spiral (railway); Snail; Engineering; Basis (linear algebra); Structural engineering; Logarithmic spiral; Finite element method; Mechanical engineering; Engineering drawing; Geometry; Mathematics; Computer science; Artificial intelligence; Biology; Ecology","score_opus":0.03244258072978805,"score_gpt":0.3718535334482024,"score_spread":0.3394109527184143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526028264","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.022490306,0.00009535734,0.9738633,0.000060018738,0.000032263295,0.000039465103,0.00004128593,0.0007854575,0.0025925364],"genre_scores_gemma":[0.3970427,0.00040641712,0.588783,0.00007853954,0.000029108698,0.00013791311,0.00041533276,0.00062277104,0.012484226],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916327,0.00012289142,0.000040815412,0.00019166182,0.0004364448,0.000044957193],"domain_scores_gemma":[0.99930656,0.00015955308,0.000053500084,0.000099672034,0.0003493468,0.000031377258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008257889,0.00049136556,0.00032714487,0.00092813105,0.00039210866,0.00069916353,0.0008620368,0.00062210154,0.0063352617],"category_scores_gemma":[0.0032051087,0.00029510426,0.0005909917,0.000934074,0.0003019863,0.0011397614,0.0006601133,0.0005465476,0.00180495],"study_design_candidate":"bench_or_experimental","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.00023422991,0.00007436938,0.0065600746,0.0003183513,0.0000494362,0.00026391743,0.0009285137,0.09543064,0.09010689,0.01845184,0.0043061054,0.78327566],"study_design_scores_gemma":[0.000015705493,0.00015783233,0.0033214635,0.000037425416,0.000027243595,0.00058711885,0.00031950793,0.92486346,0.04541692,0.0035616213,0.021648636,0.000043048793],"about_ca_topic_score_codex":0.0017380534,"about_ca_topic_score_gemma":0.0013763602,"teacher_disagreement_score":0.0063352617,"about_ca_system_score_codex":0.00029961404,"about_ca_system_score_gemma":0.0004839053,"threshold_uncertainty_score":0.021193564},"labels":[],"label_agreement":null},{"id":"W1535506841","doi":"10.1007/11559573_69","title":"Compressing 2-D Shapes Using Concavity Trees","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lossless compression; Lossy compression; Silhouette; Computer science; Set (abstract data type); Representation (politics); Image compression; Data compression; Compression (physics); Algorithm; Binary tree; Binary number; Artificial intelligence; Pattern recognition (psychology); Image (mathematics); Mathematics; Image processing; Arithmetic","score_opus":0.0332014866826259,"score_gpt":0.2870011038123816,"score_spread":0.2537996171297557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535506841","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.07297706,0.0007948282,0.9156758,0.00022161413,0.00017896558,0.000099874924,0.00038447184,0.002138379,0.007528896],"genre_scores_gemma":[0.28367808,0.0014557788,0.6981838,0.0002621088,0.00018323254,0.00015624939,0.0012056457,0.00073650957,0.014138606],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999718,0.000025691385,0.000017130695,0.000036235084,0.00017571682,0.000027249302],"domain_scores_gemma":[0.9992679,0.00030962937,0.00005605186,0.00021466493,0.00011429868,0.00003730979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020213523,0.00084465044,0.0006798633,0.0013738896,0.0003002975,0.0007812488,0.00074439636,0.0005944315,0.0053660134],"category_scores_gemma":[0.0015230058,0.00056131475,0.0005735382,0.0021400056,0.00053253147,0.0013333941,0.0014636563,0.0010787351,0.0015590525],"study_design_candidate":"bench_or_experimental","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.00042599044,0.0001097113,0.00066228776,0.00030547235,0.000048655784,0.0004297879,0.00030454938,0.10608935,0.113207065,0.026250508,0.009462926,0.7427037],"study_design_scores_gemma":[0.00005614041,0.00026524306,0.00084130955,0.000053999698,0.000036210422,0.00090721116,0.0001385289,0.8827952,0.07187423,0.021984102,0.020991776,0.000056059092],"about_ca_topic_score_codex":0.001381495,"about_ca_topic_score_gemma":0.002987146,"teacher_disagreement_score":0.0053660134,"about_ca_system_score_codex":0.00029253605,"about_ca_system_score_gemma":0.000412543,"threshold_uncertainty_score":0.01795113},"labels":[],"label_agreement":null},{"id":"W1536612087","doi":"10.1109/icassp.1985.1168072","title":"A near-neighbor processor for line thinning","year":2005,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"National Research Council Canada; Consiglio Nazionale delle Ricerche","keywords":"Computer science; Synchronism; Pixel; Thinning; Computation; Table (database); Speedup; Line (geometry); Process (computing); Task (project management); Iterated function; Parallel computing; Lookup table; Algorithm; Computer hardware; Artificial intelligence; Mathematics; Programming language; Data mining","score_opus":0.02309869361160254,"score_gpt":0.29895560167465685,"score_spread":0.2758569080630543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536612087","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.066903286,0.00016727512,0.9231215,0.000119323915,0.00008004064,0.0001575588,0.000082678016,0.0034181024,0.0059503536],"genre_scores_gemma":[0.58599395,0.00017780672,0.40413398,0.00017999188,0.00003426796,0.0002000548,0.0002810735,0.0001833068,0.008815572],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977297,0.000045671335,0.000014481654,0.000055674718,0.000091374335,0.000019697736],"domain_scores_gemma":[0.9997365,0.000067974965,0.000021449941,0.00009440188,0.00006110542,0.000018500352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023772026,0.00024468848,0.0003171391,0.00020299916,0.0004226134,0.0005912661,0.0013004991,0.0005246081,0.0057001747],"category_scores_gemma":[0.0008024593,0.00017257716,0.00028908893,0.00026402052,0.0003530281,0.00081507507,0.00042374516,0.00053434895,0.0013832616],"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.0011027956,0.00037293416,0.0032388512,0.0004277049,0.00014368004,0.0008024383,0.00045129276,0.14327218,0.4098812,0.16185312,0.008336068,0.27011773],"study_design_scores_gemma":[0.00017254405,0.00083450857,0.0007750585,0.00003991526,0.000082039,0.00087701227,0.00008915447,0.7341275,0.2063402,0.024597555,0.03200728,0.000057250723],"about_ca_topic_score_codex":0.00034370524,"about_ca_topic_score_gemma":0.00052293716,"teacher_disagreement_score":0.0057001747,"about_ca_system_score_codex":0.00035438468,"about_ca_system_score_gemma":0.0007384972,"threshold_uncertainty_score":0.019068956},"labels":[],"label_agreement":null},{"id":"W1558179332","doi":"10.1023/a:1023948712732","title":"Computing the Euclidean Distance Transform on a Linear Array of Processors","year":2003,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Pixel; Computation; Euclidean distance; Metric (unit); Feature (linguistics); Algorithm; Artificial intelligence","score_opus":0.01907606018143219,"score_gpt":0.26737464587175164,"score_spread":0.24829858569031946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558179332","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.15917318,0.0005021465,0.8309482,0.0004950731,0.00023037246,0.000041693886,0.00018761453,0.0020964304,0.0063253427],"genre_scores_gemma":[0.42833626,0.00034477373,0.56380874,0.000090779184,0.00010197763,0.00007662029,0.00056221127,0.0001358944,0.0065427558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993438,0.00013532717,0.000065389715,0.00013851759,0.00022259436,0.00009433529],"domain_scores_gemma":[0.9987502,0.00058545155,0.00006870733,0.0002176969,0.00031395533,0.00006397104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005706849,0.0006375749,0.0008991346,0.0007488168,0.00058372616,0.001326815,0.001118736,0.00075469655,0.005285955],"category_scores_gemma":[0.0043763323,0.00028448078,0.00037843146,0.001706754,0.00047069628,0.0025520872,0.0010103721,0.0007015494,0.0016668164],"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.0015598628,0.00024856778,0.0044206185,0.00026623165,0.0001962358,0.00038716462,0.00023363215,0.27704737,0.04118204,0.036355503,0.010915087,0.62718767],"study_design_scores_gemma":[0.000108545006,0.00018956294,0.0009857231,0.000010669735,0.000031063926,0.00014507816,0.00012286301,0.96045685,0.017186629,0.017504172,0.003238311,0.000020433043],"about_ca_topic_score_codex":0.0029151372,"about_ca_topic_score_gemma":0.0060681337,"teacher_disagreement_score":0.005285955,"about_ca_system_score_codex":0.00057995954,"about_ca_system_score_gemma":0.0010770587,"threshold_uncertainty_score":0.017683268},"labels":[],"label_agreement":null},{"id":"W155985344","doi":"","title":"Validation and Decomposition of Partially Occluded Images with Holes","year":2009,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Computer vision; Set (abstract data type); Artificial intelligence; Image (mathematics); Computer science; Object (grammar); Range (aeronautics); Decomposition; Alphabet; Pattern recognition (psychology); Mathematics","score_opus":0.01176871308966798,"score_gpt":0.24908942224644115,"score_spread":0.23732070915677317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155985344","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.12893806,0.00032749766,0.8688028,0.00011647258,0.000073704374,0.00006831905,0.0002038582,0.0009402578,0.00052905903],"genre_scores_gemma":[0.6254457,0.00028841125,0.3711016,0.00007089438,0.000050071973,0.00004572621,0.0012807177,0.00033651886,0.0013804084],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982279,0.0003634522,0.00008586832,0.00044007532,0.00059927086,0.00028336263],"domain_scores_gemma":[0.9954164,0.0018410725,0.00043126068,0.000976186,0.0010854863,0.00024956072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002627937,0.0015161118,0.0015387514,0.0017809193,0.00040821746,0.0017141658,0.0009582804,0.0021700065,0.001745065],"category_scores_gemma":[0.008873523,0.0007211067,0.0014595051,0.000791102,0.0012831887,0.001255344,0.0016807826,0.0013435782,0.00066840573],"study_design_candidate":"bench_or_experimental","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.0027548026,0.00029685054,0.005618835,0.00063746603,0.0002795976,0.0007115799,0.00045579893,0.2522297,0.24544346,0.0055518383,0.0032382351,0.48278198],"study_design_scores_gemma":[0.000020626127,0.00009977468,0.0018382841,0.000040858315,0.00003752052,0.00021917035,0.00007684943,0.9711558,0.02338901,0.0022982606,0.00081338215,0.000010456061],"about_ca_topic_score_codex":0.00270773,"about_ca_topic_score_gemma":0.0018750919,"teacher_disagreement_score":0.00270773,"about_ca_system_score_codex":0.0003498264,"about_ca_system_score_gemma":0.000892596,"threshold_uncertainty_score":0.013898015},"labels":[],"label_agreement":null},{"id":"W1565803390","doi":"10.3233/fi-2013-890","title":"Nearness of Sets in Local Admissible Covers. Theory and Application in Micropalaeontology","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.006242084648264107,"score_gpt":0.2526267368455923,"score_spread":0.24638465219732816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565803390","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.2777705,0.014898504,0.675432,0.0011181921,0.00018937356,0.00008506059,0.0007050536,0.00020548954,0.029595824],"genre_scores_gemma":[0.914565,0.0034067149,0.07656008,0.00017720106,0.0002851235,0.00011584039,0.0005385381,0.000059645394,0.0042919014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985281,0.00028468104,0.00017073279,0.00044190386,0.00046910235,0.00010545149],"domain_scores_gemma":[0.99517703,0.002936563,0.00076329894,0.00040232198,0.00043100427,0.00028976065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016545265,0.0004414776,0.0008629711,0.0066046845,0.0016409118,0.0032067937,0.0010764243,0.001089743,0.0017495614],"category_scores_gemma":[0.007305091,0.0005238523,0.0013476477,0.0037043674,0.006375769,0.006844202,0.003346628,0.0014894777,0.00023713576],"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.000027796194,0.000011031453,0.0037809366,0.00019026744,0.000037676742,0.00017271176,0.00086866424,0.00961869,0.0017128382,0.9620545,0.0003933144,0.02113165],"study_design_scores_gemma":[0.0000043785867,0.000046726087,0.004577847,0.00013824599,0.000032470092,0.0006109605,0.00086916063,0.023504406,0.0013132265,0.96032566,0.008539797,0.000037177615],"about_ca_topic_score_codex":0.0019446033,"about_ca_topic_score_gemma":0.0012889643,"teacher_disagreement_score":0.0066046845,"about_ca_system_score_codex":0.0024899822,"about_ca_system_score_gemma":0.00039026033,"threshold_uncertainty_score":0.018066168},"labels":[],"label_agreement":null},{"id":"W1571431008","doi":"10.1007/978-3-540-77129-6_26","title":"Measuring Linearity of Ordered Point Sets","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Linearity; Monotonic function; Mathematics; Measure (data warehouse); Point (geometry); Set (abstract data type); Invariant (physics); Translation (biology); Binary number; Algorithm; Scaling; Statistics; Mathematical analysis; Geometry; Computer science; Data mining; Arithmetic","score_opus":0.05293067006736547,"score_gpt":0.28534508847323603,"score_spread":0.23241441840587057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571431008","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.44084308,0.0007336039,0.5447699,0.0002042352,0.000047325273,0.00009313706,0.00044628512,0.00072066317,0.012141743],"genre_scores_gemma":[0.91769344,0.0003542609,0.07868461,0.000045887442,0.00006434158,0.000089826375,0.0007791943,0.00009736985,0.0021911568],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99566096,0.0009931255,0.0002906351,0.00083940726,0.0018927875,0.00032305284],"domain_scores_gemma":[0.9790492,0.013617006,0.0013989906,0.0026122765,0.0025499305,0.0007726034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021223794,0.00062308245,0.00094456057,0.0034374094,0.0006915557,0.0026893253,0.0015880149,0.0007245271,0.0035011102],"category_scores_gemma":[0.015056213,0.000732666,0.000786292,0.0025286123,0.0032310495,0.005496967,0.003343042,0.0016694162,0.0008655657],"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.0019242212,0.0005525566,0.08791831,0.0011341433,0.0004520538,0.0006538734,0.004247756,0.07523644,0.10718138,0.33192974,0.0030063335,0.3857633],"study_design_scores_gemma":[0.00009146459,0.0018779017,0.053595535,0.00024214279,0.00029900216,0.001784699,0.004759186,0.39516753,0.098355986,0.4361808,0.0073802904,0.00026545735],"about_ca_topic_score_codex":0.00119957,"about_ca_topic_score_gemma":0.0010087447,"teacher_disagreement_score":0.0035011102,"about_ca_system_score_codex":0.0010039241,"about_ca_system_score_gemma":0.0007183689,"threshold_uncertainty_score":0.011712432},"labels":[],"label_agreement":null},{"id":"W1581705760","doi":"10.1109/iai.1998.666881","title":"Connected skeletons from 3D distance transforms","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Voxel; Computer science; Distance transform; Artificial intelligence; Computer vision; Image (mathematics); Transformation (genetics); Skeleton (computer programming); Binary image; Identification (biology); Image processing; Computer graphics (images)","score_opus":0.01732550467077585,"score_gpt":0.21993802870806983,"score_spread":0.202612524037294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581705760","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.00422508,0.00008832988,0.9933547,0.000036281566,0.000026218306,0.000047377882,0.00007111151,0.0007364745,0.001414313],"genre_scores_gemma":[0.06971001,0.00022463426,0.9264858,0.000031517637,0.000037571812,0.00016569432,0.00059816154,0.00044215715,0.002304432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920744,0.00014019849,0.000046360776,0.00017294944,0.00038024626,0.000052917498],"domain_scores_gemma":[0.99909604,0.0002969271,0.000100065685,0.00020964857,0.000248366,0.00004907904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063100917,0.00095146045,0.0008582089,0.0029495936,0.00065648794,0.0015779487,0.0009975495,0.0011357085,0.0061115767],"category_scores_gemma":[0.0030780607,0.00075024745,0.0011974684,0.0015354187,0.0013349411,0.0016261587,0.0022806104,0.0015368601,0.0030906247],"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.0001900191,0.00006712562,0.0005330821,0.0003193004,0.00005799015,0.0004292659,0.00043269043,0.13703929,0.041203357,0.23998366,0.008165204,0.571579],"study_design_scores_gemma":[0.000058733418,0.000113275775,0.00055818533,0.000076507175,0.00003268374,0.000745018,0.000112303926,0.7539824,0.027268356,0.18817759,0.028813783,0.00006111912],"about_ca_topic_score_codex":0.00060590566,"about_ca_topic_score_gemma":0.0009367945,"teacher_disagreement_score":0.0061115767,"about_ca_system_score_codex":0.00053634134,"about_ca_system_score_gemma":0.00064297806,"threshold_uncertainty_score":0.020445228},"labels":[],"label_agreement":null},{"id":"W1582883792","doi":"10.3233/fi-2013-830","title":"Sufficiently Near Neighbourhoods of Points in Flow Graphs. A Near Set Approach","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"H2020 European Research Council","keywords":"Mathematics; Extension (predicate logic); Flow (mathematics); Graph; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Geometry","score_opus":0.016177563522801797,"score_gpt":0.24519658257726382,"score_spread":0.229019019054462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582883792","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.0828482,0.0016770025,0.8902397,0.0005252802,0.00016893359,0.00012573009,0.00033337323,0.0002158317,0.023865974],"genre_scores_gemma":[0.68098795,0.001978501,0.29962233,0.000364716,0.0003676617,0.0003472922,0.0006642641,0.00025753782,0.01540972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989292,0.00032498638,0.000062193605,0.00030074822,0.00028556175,0.000097344746],"domain_scores_gemma":[0.9966863,0.0017827656,0.00043653484,0.00039418458,0.0003549846,0.00034522344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011365663,0.000636624,0.0008618794,0.003486869,0.001621526,0.0022844598,0.0013288213,0.0013294587,0.003843807],"category_scores_gemma":[0.0065224716,0.0006182943,0.0013691409,0.0013457778,0.0033461575,0.005389187,0.0034505972,0.002164053,0.00060821156],"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.00008087229,0.000022243723,0.000809941,0.000120870885,0.000018227174,0.00016237462,0.00048643036,0.013831207,0.0023500675,0.96072876,0.0008650664,0.020523826],"study_design_scores_gemma":[0.000018401242,0.00008324571,0.0007179577,0.00008432126,0.00002547276,0.00034027745,0.00031398647,0.05107947,0.0014402217,0.93303376,0.012826717,0.000036230653],"about_ca_topic_score_codex":0.0019685314,"about_ca_topic_score_gemma":0.0014993715,"teacher_disagreement_score":0.003843807,"about_ca_system_score_codex":0.0012991169,"about_ca_system_score_gemma":0.000377623,"threshold_uncertainty_score":0.012858868},"labels":[],"label_agreement":null},{"id":"W1592672079","doi":"10.1007/978-3-540-39966-7_43","title":"A Representation for Abstract Simplicial Complexes: An Analysis and a Comparison","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada","keywords":"Simplicial manifold; Simplicial approximation theorem; Abstract simplicial complex; Simplicial complex; Representation (politics); Simplicial homology; Decomposition; Manifold (fluid mechanics); Mathematics; Computer science; Theoretical computer science; Pure mathematics; Simplicial set; Engineering; Chemistry","score_opus":0.04157078764983528,"score_gpt":0.3388258945761861,"score_spread":0.2972551069263508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592672079","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.08505416,0.010425464,0.8015031,0.003384761,0.0014430501,0.00012737101,0.0005351913,0.00034560778,0.097181275],"genre_scores_gemma":[0.71683276,0.009143649,0.22482884,0.0009847255,0.0016125283,0.00025496414,0.0010861246,0.0005695547,0.044686925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989649,0.00027333433,0.000095619056,0.00020116022,0.00036505394,0.000099917714],"domain_scores_gemma":[0.99837637,0.00056443526,0.00018980067,0.00029862425,0.0003543543,0.00021639564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015634246,0.0010799159,0.0010485222,0.0035174717,0.0016560678,0.0062120333,0.0019041989,0.0020955617,0.010461299],"category_scores_gemma":[0.004137507,0.00046529176,0.0013182542,0.0049083326,0.0029940559,0.009605069,0.0031969731,0.0027863453,0.0014257216],"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.000011938332,0.000011284977,0.00005109644,0.000037984762,0.0000041995427,0.00001895251,0.00011725039,0.0006702529,0.0002877223,0.98827165,0.0012055985,0.009312105],"study_design_scores_gemma":[0.0000076538945,0.00003459816,0.00011772146,0.00003216659,0.0000116438705,0.0001609221,0.00014904751,0.010735382,0.00020811884,0.97910005,0.009425678,0.000017032842],"about_ca_topic_score_codex":0.0006410653,"about_ca_topic_score_gemma":0.0004509421,"teacher_disagreement_score":0.010461299,"about_ca_system_score_codex":0.0013725922,"about_ca_system_score_gemma":0.00051852904,"threshold_uncertainty_score":0.03499651},"labels":[],"label_agreement":null},{"id":"W1594941289","doi":"10.55016/ojs/cdm.v6i1.62040","title":"2L-convex polyominoes: Geometrical aspects","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","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":"","keywords":"Polyomino; Regular polygon; Mathematics; Combinatorics; Geometry","score_opus":0.029822366137084208,"score_gpt":0.2946020199361581,"score_spread":0.26477965379907387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594941289","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.7140991,0.0014752499,0.19802368,0.0008075801,0.00008841405,0.0000969961,0.0008370024,0.0001304272,0.08444157],"genre_scores_gemma":[0.9253832,0.00079497433,0.06153053,0.00012258912,0.00012835363,0.00011517225,0.0007923744,0.000071688526,0.011060956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994838,0.0000927002,0.000027678638,0.00011824038,0.00019289063,0.00008467256],"domain_scores_gemma":[0.9993901,0.00020477267,0.00014649969,0.000067426794,0.000094651376,0.00009650045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022731435,0.00035292917,0.00031199443,0.0011222594,0.00080996996,0.0018027982,0.00037565466,0.00044176306,0.0045002187],"category_scores_gemma":[0.0010551106,0.00030698703,0.0002833904,0.00078446965,0.002297211,0.0019857963,0.0012993043,0.0009838518,0.00047254463],"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.00009633573,0.000023745371,0.0028725904,0.00009600995,0.00001110258,0.00036600907,0.00044818886,0.011956212,0.009563998,0.944049,0.0014404377,0.029076422],"study_design_scores_gemma":[0.000032767246,0.0001606476,0.01155228,0.00007811461,0.000016595943,0.002934121,0.0011163299,0.11922912,0.010044905,0.81120926,0.0435349,0.0000910539],"about_ca_topic_score_codex":0.0007063898,"about_ca_topic_score_gemma":0.0007170889,"teacher_disagreement_score":0.0045002187,"about_ca_system_score_codex":0.0007616894,"about_ca_system_score_gemma":0.00033939737,"threshold_uncertainty_score":0.015054703},"labels":[],"label_agreement":null},{"id":"W1603323139","doi":"10.1109/icdar.2003.1227854","title":"New approach for the skeletonization of handwritten characters in gray-scale images","year":2005,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Skeletonization; Grayscale; Artificial intelligence; Computer science; Pixel; Computer vision; Binary image; Pattern recognition (psychology); Point (geometry); Image processing; Process (computing); Gray level; Image (mathematics); Mathematics","score_opus":0.013728521534676724,"score_gpt":0.256679693486965,"score_spread":0.2429511719522883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603323139","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.0035161206,0.00022122021,0.9948572,0.000036515627,0.000033056385,0.000030232415,0.000018181872,0.00064570375,0.00064176274],"genre_scores_gemma":[0.026526516,0.0003624585,0.96965784,0.00003575577,0.000044140143,0.00005298414,0.000095186995,0.00012925323,0.0030958222],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994968,0.000048249232,0.000032929172,0.00013186764,0.00026008522,0.000030040914],"domain_scores_gemma":[0.9995425,0.00009196629,0.000051564515,0.00012643101,0.00014986088,0.00003764045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003930546,0.0007533004,0.0006183193,0.0010413161,0.0003457659,0.0007233673,0.0008411911,0.0006719173,0.0032452429],"category_scores_gemma":[0.00077620975,0.00043918993,0.0006517721,0.00064048904,0.00075059757,0.0010684646,0.00078617147,0.0010211188,0.0011876933],"study_design_candidate":"bench_or_experimental","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.00009634983,0.000097203076,0.00044759747,0.00027141947,0.0000654933,0.00015223424,0.00018075487,0.015604143,0.28390473,0.014475662,0.0024284148,0.68227607],"study_design_scores_gemma":[0.000076518445,0.0003905689,0.003051125,0.000059305912,0.00010780163,0.0020083734,0.000083599974,0.64839935,0.27503186,0.013338625,0.05733654,0.00011640894],"about_ca_topic_score_codex":0.0006242584,"about_ca_topic_score_gemma":0.0015151579,"teacher_disagreement_score":0.0032452429,"about_ca_system_score_codex":0.0003276705,"about_ca_system_score_gemma":0.0006298801,"threshold_uncertainty_score":0.01085639},"labels":[],"label_agreement":null},{"id":"W1604897762","doi":"10.1007/978-3-319-48123-4_7","title":"High Resolution Micro CT Imaging and 3D Image Analysis of Paper Products","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Papermaking; Characterization (materials science); Segmentation; Process (computing); Materials science; Fiber; High resolution; Resolution (logic); Microstructure; Computer science; Artificial intelligence; Composite material; Geology; Remote sensing; Nanotechnology","score_opus":0.009630898088908421,"score_gpt":0.22638769184545393,"score_spread":0.2167567937565455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604897762","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.0054610106,0.0782596,0.7256299,0.0009916462,0.0016692271,0.00015751674,0.0009734723,0.0026168902,0.18424067],"genre_scores_gemma":[0.049019847,0.076493725,0.4104825,0.00097235345,0.001063659,0.00016059562,0.0011301048,0.0013370345,0.45934018],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996444,0.000017826407,0.000012055705,0.000054633347,0.00025624642,0.000014948494],"domain_scores_gemma":[0.99958223,0.00021598281,0.00002503714,0.000057335455,0.00010179923,0.000017627795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002372443,0.00091562903,0.00065379345,0.0018400731,0.00029485562,0.0020279526,0.0012080019,0.0010102498,0.032079905],"category_scores_gemma":[0.0006631081,0.00067448,0.00056875206,0.0023241153,0.0006971296,0.001616182,0.0005873257,0.0012208266,0.01158352],"study_design_candidate":"bench_or_experimental","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.000056308872,0.000042442276,0.00034801717,0.0010027001,0.000025101457,0.00040344143,0.00019388,0.004806461,0.0716317,0.039291333,0.05663615,0.8255625],"study_design_scores_gemma":[0.000009617404,0.000090193535,0.0035394279,0.0004594024,0.00004533283,0.005740121,0.00023116998,0.021681655,0.08158397,0.054259013,0.8322541,0.00010605699],"about_ca_topic_score_codex":0.0008263753,"about_ca_topic_score_gemma":0.0017456848,"teacher_disagreement_score":0.032079905,"about_ca_system_score_codex":0.00041824888,"about_ca_system_score_gemma":0.0005143564,"threshold_uncertainty_score":0.107317984},"labels":[],"label_agreement":null},{"id":"W165642075","doi":"10.1007/978-3-642-30092-9_11","title":"Bildkompression: Iterierte Funktionensysteme","year":2012,"lang":"de","type":"book-chapter","venue":"Springer-Lehrbuch","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.03878491453714608,"score_gpt":0.25863873894883416,"score_spread":0.21985382441168808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165642075","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.018181533,0.0028581307,0.925345,0.00030631857,0.0002652218,0.00009429596,0.00025673793,0.0066605834,0.046032134],"genre_scores_gemma":[0.3382875,0.008136147,0.5155017,0.00038022685,0.00039879765,0.00041307058,0.0013879235,0.0020543425,0.13344032],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999699,0.000038759517,0.00002290356,0.000068209425,0.00013797013,0.000033207703],"domain_scores_gemma":[0.99979764,0.00007925206,0.000015261929,0.000058333633,0.000032857824,0.00001661546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043472747,0.001152785,0.00084077235,0.0006655149,0.00052044314,0.0028892555,0.0011370059,0.0010286841,0.024418766],"category_scores_gemma":[0.0006899557,0.00051279116,0.00055825006,0.0007629796,0.0011660258,0.0032829065,0.0023811585,0.0019712623,0.008471417],"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.0003123092,0.00012793025,0.00024683436,0.0006424672,0.00006108419,0.00037946616,0.00059544976,0.021798756,0.11923033,0.24558967,0.012342499,0.5986732],"study_design_scores_gemma":[0.0001361849,0.000410781,0.0008438733,0.0002813135,0.00009139647,0.0017091614,0.0002954304,0.24471019,0.18172166,0.34925517,0.22037446,0.00017038023],"about_ca_topic_score_codex":0.00029434724,"about_ca_topic_score_gemma":0.0002911654,"teacher_disagreement_score":0.024418766,"about_ca_system_score_codex":0.00041144138,"about_ca_system_score_gemma":0.00035331765,"threshold_uncertainty_score":0.08168894},"labels":[],"label_agreement":null},{"id":"W1773677394","doi":"10.1007/978-3-540-74260-9_33","title":"New Algorithm to Extract Centerline of 2D Objects Based on Clustering","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Cluster analysis; Position (finance); Point (geometry); Object (grammar); Set (abstract data type); Algorithm; Computer science; Cluster (spacecraft); Artificial intelligence; Computer vision; Mathematics; Geometry","score_opus":0.024023239073733098,"score_gpt":0.28438462488644545,"score_spread":0.26036138581271234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1773677394","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.0046909605,0.00037791947,0.99052036,0.00006738,0.0001477913,0.000109923996,0.00014701029,0.0027074048,0.0012311832],"genre_scores_gemma":[0.019634124,0.00033305166,0.97567946,0.00005422255,0.000068190864,0.00014420567,0.00067461136,0.00023646784,0.003175629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889153,0.000056031873,0.000054421493,0.00038911522,0.0005225582,0.000086413456],"domain_scores_gemma":[0.9993918,0.00005988974,0.00004812657,0.00010128215,0.00036240867,0.00003644322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046319264,0.0017019169,0.0018095692,0.0041740104,0.0013053617,0.0014758243,0.0029484439,0.0016110007,0.0043948665],"category_scores_gemma":[0.00077813043,0.0009827553,0.0014166186,0.004062693,0.00060994027,0.0019386376,0.0014056856,0.0011254305,0.0031831234],"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.0002343714,0.00013059596,0.001138437,0.00030687376,0.00015628934,0.00017920951,0.00018189351,0.011700776,0.083734505,0.0049129874,0.016920155,0.8804039],"study_design_scores_gemma":[0.0001507176,0.00023297493,0.004481394,0.000063975975,0.00024160912,0.0017347249,0.00023462356,0.74851596,0.1722178,0.007421152,0.06449429,0.00021072156],"about_ca_topic_score_codex":0.0062363045,"about_ca_topic_score_gemma":0.0068182405,"teacher_disagreement_score":0.0062363045,"about_ca_system_score_codex":0.0008765775,"about_ca_system_score_gemma":0.001486384,"threshold_uncertainty_score":0.0147022605},"labels":[],"label_agreement":null},{"id":"W1782154980","doi":"10.1109/iscas.1990.112402","title":"Non-linear pipeline architectures for morphological signal processing","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Structuring element; Pipeline (software); Computer science; Mathematical morphology; Modularity (biology); Structuring; Very-large-scale integration; Signal processing; Computer architecture; Nonlinear system; Dilation (metric space); Computer engineering; Parallel computing; Computer hardware; Digital signal processing; Artificial intelligence; Embedded system; Image processing; Mathematics; Programming language","score_opus":0.041041875149887524,"score_gpt":0.2895171130311445,"score_spread":0.248475237881257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1782154980","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.0120115755,0.0005593602,0.97986937,0.00018418633,0.000094165,0.000092459915,0.00009191387,0.0010883143,0.0060085976],"genre_scores_gemma":[0.19403552,0.0011862224,0.7870175,0.00016793274,0.000108229855,0.0002026003,0.00052429736,0.00012832001,0.016629398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983025,0.00002540209,0.000012825547,0.00003127265,0.00007821478,0.000021955435],"domain_scores_gemma":[0.99979085,0.000051364095,0.000027148462,0.000038832197,0.000079237994,0.000012513895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024405008,0.00051757257,0.0002216502,0.00039790265,0.00037402322,0.0006072738,0.000917654,0.00046796523,0.006581093],"category_scores_gemma":[0.00047898552,0.0002712226,0.0003375008,0.0006204235,0.00032145588,0.0010741752,0.0003982252,0.00047681964,0.0020638453],"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.00031016892,0.00012169998,0.00076102355,0.00078052277,0.00006226535,0.00047156803,0.00015829888,0.029875237,0.35352027,0.10577914,0.012167683,0.49599215],"study_design_scores_gemma":[0.00013048963,0.00087924366,0.0018487283,0.000088871624,0.000106926615,0.001507823,0.00006423197,0.6381539,0.20398948,0.04730762,0.10585134,0.00007137665],"about_ca_topic_score_codex":0.0005146509,"about_ca_topic_score_gemma":0.0016039105,"teacher_disagreement_score":0.006581093,"about_ca_system_score_codex":0.00054038386,"about_ca_system_score_gemma":0.000676164,"threshold_uncertainty_score":0.022015989},"labels":[],"label_agreement":null},{"id":"W1819051592","doi":"10.55016/ojs/cdm.v8i1.62144","title":"2L convex polyominoes: discrete tomographical aspects","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","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":"Polyomino; Regular polygon; Mathematics; Computer science; Geometry","score_opus":0.009520367845906751,"score_gpt":0.28103065848989117,"score_spread":0.2715102906439844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819051592","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.050415624,0.00043674777,0.9160418,0.0003305861,0.0001149822,0.0000461399,0.0002491337,0.0001510375,0.032214023],"genre_scores_gemma":[0.51574916,0.0010162968,0.4630302,0.00018270667,0.00022028503,0.00007630059,0.0006037033,0.00032266424,0.018798651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967396,0.000059988975,0.000016995093,0.00008105122,0.00013247656,0.000035487155],"domain_scores_gemma":[0.99918514,0.0003241833,0.00011368178,0.00020643124,0.00011238382,0.000058176985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027085643,0.0002963326,0.00036253582,0.0009220866,0.00072917005,0.001382902,0.0005885069,0.00039026517,0.007835],"category_scores_gemma":[0.0022891827,0.00032683686,0.0003206585,0.00067554566,0.0014851538,0.0015823118,0.000989123,0.0012605272,0.0010336195],"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.0000995448,0.000036503294,0.0012001344,0.00017624632,0.00001183075,0.00046929097,0.0004017082,0.045153297,0.012265754,0.8343792,0.0029603783,0.102846205],"study_design_scores_gemma":[0.000033525626,0.00009319339,0.00252649,0.00008676519,0.000014643345,0.0019597502,0.00037934794,0.37568757,0.0148832705,0.5456101,0.05864105,0.00008429146],"about_ca_topic_score_codex":0.00087420526,"about_ca_topic_score_gemma":0.0013292193,"teacher_disagreement_score":0.007835,"about_ca_system_score_codex":0.00046153084,"about_ca_system_score_gemma":0.0002810476,"threshold_uncertainty_score":0.026210666},"labels":[],"label_agreement":null},{"id":"W1840383617","doi":"10.1007/11669487_6","title":"Gray-Scale Thinning Algorithm Using Local Min/Max Operations","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Dilation (metric space); Thinning; Salient; Computer science; Grayscale; Scale (ratio); Algorithm; Mathematical morphology; Image (mathematics); Artificial intelligence; Image processing; Mathematics; Geometry; Cartography; Geography; Forestry","score_opus":0.01690705746016663,"score_gpt":0.26297746651711207,"score_spread":0.24607040905694544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840383617","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.015000725,0.00032081266,0.97972053,0.00006922437,0.0000843362,0.00007353738,0.00005029345,0.0014644397,0.003216093],"genre_scores_gemma":[0.073294416,0.00035305618,0.9190702,0.000054514978,0.000053878368,0.00007949505,0.00016233684,0.00028886372,0.0066432636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968934,0.000023120934,0.00002907303,0.000065571214,0.0001652638,0.000027600814],"domain_scores_gemma":[0.9996706,0.00005854769,0.00003659107,0.00008465907,0.00012597021,0.000023648412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062686834,0.00074531947,0.0010158892,0.0011822601,0.0005256848,0.0010198676,0.0011805733,0.00058303005,0.005288413],"category_scores_gemma":[0.00068955106,0.00050955487,0.0007636073,0.0012970997,0.00046333217,0.001030166,0.00079142785,0.0008324447,0.0015384327],"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.00024218291,0.000098423334,0.00052864227,0.0001850619,0.000088941386,0.00015381271,0.00009764295,0.02641771,0.1483654,0.013608617,0.005358926,0.80485463],"study_design_scores_gemma":[0.00010291023,0.00024498272,0.0022730967,0.00004797652,0.00022146109,0.0012471059,0.000057539106,0.7556093,0.20535342,0.011373258,0.023374822,0.000094204566],"about_ca_topic_score_codex":0.00091670227,"about_ca_topic_score_gemma":0.0018657864,"teacher_disagreement_score":0.005288413,"about_ca_system_score_codex":0.00030492563,"about_ca_system_score_gemma":0.00095602474,"threshold_uncertainty_score":0.017691553},"labels":[],"label_agreement":null},{"id":"W1860434137","doi":"10.1109/pacrim.1995.519557","title":"The spatial U-order and some of its mathematical characteristics","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pixel; Mirroring; Translation (biology); Computer science; Order (exchange); Euclidean geometry; Algorithm; Domain (mathematical analysis); Code (set theory); Euclidean space; Artificial intelligence; Mathematics; Computer vision; Theoretical computer science; Topology (electrical circuits); Pure mathematics; Combinatorics; Geometry; Mathematical analysis","score_opus":0.020083377413407176,"score_gpt":0.2423390161229367,"score_spread":0.22225563870952952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860434137","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.097349375,0.011178506,0.6561917,0.0030279423,0.0011470227,0.00011499311,0.0007184309,0.0005014489,0.22977053],"genre_scores_gemma":[0.72336775,0.011400984,0.19964151,0.0009914433,0.0019119228,0.00023300717,0.00063454965,0.00043877878,0.061380025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960774,0.00006770575,0.000028359185,0.00007859039,0.00015227695,0.00006535461],"domain_scores_gemma":[0.9987514,0.00045959052,0.00021281956,0.00018336519,0.0002816512,0.00011118756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005465408,0.00042147364,0.0004427917,0.0018852978,0.0014811814,0.0027206268,0.0005286426,0.0006602373,0.0057697194],"category_scores_gemma":[0.002588467,0.0002893771,0.00066779705,0.0020890476,0.002581632,0.00354332,0.0011915574,0.0016155397,0.0014625151],"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.000008618173,0.000005437518,0.00019140312,0.000029472476,0.000002359538,0.00005521928,0.00008953209,0.0014453785,0.00034247525,0.9860947,0.0014579218,0.010277531],"study_design_scores_gemma":[0.0000036723115,0.000027728644,0.00026698833,0.00003039685,0.000005495748,0.00030738313,0.000101374455,0.01295913,0.0006371399,0.9547276,0.030916313,0.000016701386],"about_ca_topic_score_codex":0.0023413226,"about_ca_topic_score_gemma":0.002068592,"teacher_disagreement_score":0.0057697194,"about_ca_system_score_codex":0.0011814671,"about_ca_system_score_gemma":0.00070832076,"threshold_uncertainty_score":0.019301653},"labels":[],"label_agreement":null},{"id":"W1864149940","doi":"10.1007/978-3-642-19867-0_4","title":"An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Discrete geometry; Coprime integers; Discrete space; Computer science; Digital geometry; Arithmetic function; Simple (philosophy); Euclidean space; Point (geometry); Integer (computer science); Algorithm; Euclidean geometry; Discrete mathematics; Mathematics; Combinatorics; Image processing; Artificial intelligence; Image (mathematics)","score_opus":0.02198518174772196,"score_gpt":0.2553348456603041,"score_spread":0.23334966391258216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864149940","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.025189735,0.004335604,0.736797,0.0020021272,0.0011037465,0.00006153614,0.00031870065,0.00045881383,0.2297328],"genre_scores_gemma":[0.46848798,0.006654772,0.44807544,0.00084936345,0.0016627397,0.0002023386,0.0005035845,0.00032126758,0.0732426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975723,0.0000614304,0.00001535041,0.000040687126,0.00010036355,0.000024878136],"domain_scores_gemma":[0.9997695,0.00009777083,0.000024571606,0.000029863413,0.00005420215,0.000024063713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026528165,0.00074051763,0.0004956899,0.0018160233,0.0010968742,0.0033286186,0.0015654258,0.0007129452,0.009827155],"category_scores_gemma":[0.0009986178,0.00040142593,0.0007211912,0.002127292,0.0029381476,0.0027997897,0.0011382402,0.0029492783,0.0017659393],"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.0000069253892,0.000006779507,0.000023987877,0.000026708221,0.0000022927286,0.000026057798,0.00006960014,0.0017355579,0.000337635,0.98349,0.001523938,0.012750545],"study_design_scores_gemma":[0.0000053224294,0.000008162767,0.00005299806,0.000011384561,0.0000031460186,0.00008375581,0.00004732587,0.007296261,0.00019644896,0.9747791,0.017509038,0.000007124371],"about_ca_topic_score_codex":0.0011314696,"about_ca_topic_score_gemma":0.0010642178,"teacher_disagreement_score":0.009827155,"about_ca_system_score_codex":0.0011433129,"about_ca_system_score_gemma":0.000388456,"threshold_uncertainty_score":0.03287512},"labels":[],"label_agreement":null},{"id":"W186613980","doi":"","title":"The Smallest Degree Sum that Yields Potentially K2s-graphic Sequences.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":5,"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":"Degree (music); Mathematics; Combinatorics; Physics","score_opus":0.02977802091326811,"score_gpt":0.2509795088918668,"score_spread":0.2212014879785987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186613980","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.7186926,0.0013778774,0.09370659,0.0023935314,0.00057192025,0.0001940514,0.0050364053,0.0019077903,0.1761193],"genre_scores_gemma":[0.91607934,0.000839339,0.046107046,0.00038524,0.00012667054,0.00011193978,0.002694321,0.00052972377,0.033126388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935764,0.000112456604,0.0000466453,0.00011984606,0.00014910946,0.0002141779],"domain_scores_gemma":[0.9987418,0.0005342948,0.00011123188,0.00022824889,0.00017564774,0.00020887151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033456204,0.0009162862,0.0005394832,0.0012846091,0.0018148939,0.0025551987,0.0006189313,0.00094075914,0.018634746],"category_scores_gemma":[0.003266156,0.0003433116,0.00056253,0.0011268867,0.000959214,0.0025694354,0.001584271,0.0009592642,0.005816713],"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.0030448413,0.00031865507,0.009010266,0.0020194657,0.00017058541,0.0038448104,0.0021007312,0.023634631,0.14660741,0.4948303,0.059989817,0.25442845],"study_design_scores_gemma":[0.0001895973,0.00031919804,0.0053970674,0.00030993103,0.0001566146,0.0044153123,0.0013763033,0.02588871,0.08616587,0.78448546,0.09116094,0.00013503055],"about_ca_topic_score_codex":0.0005582357,"about_ca_topic_score_gemma":0.0015981969,"teacher_disagreement_score":0.018634746,"about_ca_system_score_codex":0.0006106252,"about_ca_system_score_gemma":0.00063643104,"threshold_uncertainty_score":0.062339425},"labels":[],"label_agreement":null},{"id":"W1874608359","doi":"10.1111/jmi.12308","title":"Automated segmentation of wood fibres in micro‐CT images of paper","year":2015,"lang":"en","type":"article","venue":"Journal of Microscopy","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Mitacs","keywords":"Papermaking; Segmentation; Materials science; Fiber; Artificial intelligence; Computer science; Tracking (education); Composite material; Computer vision","score_opus":0.017429115549577236,"score_gpt":0.31702671825831935,"score_spread":0.29959760270874214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874608359","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.13933603,0.0006256458,0.8562203,0.00009530852,0.000049972798,0.0003236382,0.0002766043,0.0015637961,0.0015086234],"genre_scores_gemma":[0.19426897,0.0004416287,0.8032716,0.000044768436,0.000017172226,0.00013580354,0.0003140108,0.00018372026,0.0013223805],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996197,0.000038130263,0.000029067929,0.000096119446,0.00016898311,0.000047967438],"domain_scores_gemma":[0.999225,0.00028797457,0.00010899095,0.00010413666,0.00024454817,0.000029340477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060790847,0.00052241824,0.0004143114,0.0020689159,0.0004077583,0.0011196363,0.00076598243,0.00095124595,0.0010470144],"category_scores_gemma":[0.0011835785,0.00044262418,0.00039054092,0.0009091828,0.0005825432,0.00069795497,0.00036166157,0.00054650486,0.00059822184],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00015802732,0.000056412617,0.0022788239,0.00024371472,0.00003846999,0.00032479028,0.0002623747,0.014307034,0.8085716,0.0013826749,0.0006032129,0.17177299],"study_design_scores_gemma":[0.00003235869,0.00016832957,0.02635035,0.000089575384,0.000065069056,0.0017022344,0.00026046307,0.26208213,0.6983249,0.002377415,0.008446085,0.00010101128],"about_ca_topic_score_codex":0.001989792,"about_ca_topic_score_gemma":0.005477077,"teacher_disagreement_score":0.0020689159,"about_ca_system_score_codex":0.00042775093,"about_ca_system_score_gemma":0.0009481609,"threshold_uncertainty_score":0.0039563775},"labels":[],"label_agreement":null},{"id":"W191381569","doi":"","title":"Plane Partition Cores.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Mathematics; Partition (number theory); Plane (geometry); Geometry; Combinatorics","score_opus":0.01505691274595231,"score_gpt":0.24603113048557812,"score_spread":0.23097421773962581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191381569","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.11940984,0.0016544228,0.38244638,0.001083306,0.00082874845,0.0007244943,0.0047655627,0.005034543,0.4840527],"genre_scores_gemma":[0.49787575,0.0018093996,0.23531474,0.00088135345,0.00030471978,0.00073788234,0.0099889785,0.0022020023,0.25088513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950933,0.00004181964,0.000029958605,0.0001081358,0.00015470783,0.00015615096],"domain_scores_gemma":[0.9994881,0.000055849097,0.000042573174,0.00021379645,0.00013162162,0.000068009555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021037276,0.00097145117,0.00086156005,0.0014810059,0.001272301,0.003361139,0.0011011043,0.0007444258,0.06392003],"category_scores_gemma":[0.0010712919,0.000397551,0.0006997029,0.0014776256,0.0005990549,0.0030992753,0.0026821957,0.0010658934,0.018787485],"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.0007794972,0.00037988537,0.0015942301,0.00053854723,0.00008574081,0.00035610635,0.00030910803,0.01011689,0.028009076,0.476691,0.10035114,0.38078874],"study_design_scores_gemma":[0.00019844835,0.0002865431,0.0018838842,0.00022137193,0.00011041049,0.0009619104,0.00074509525,0.058243364,0.04554583,0.47792366,0.41382456,0.00005489463],"about_ca_topic_score_codex":0.0012160508,"about_ca_topic_score_gemma":0.0031886613,"teacher_disagreement_score":0.06392003,"about_ca_system_score_codex":0.0008800723,"about_ca_system_score_gemma":0.0007677817,"threshold_uncertainty_score":0.21383375},"labels":[],"label_agreement":null},{"id":"W195844759","doi":"","title":"Degree Sequences of Halin Graphs, and Forcibly Cograph-graphic Sequences.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":6,"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":"Mathematics; Combinatorics; Degree (music)","score_opus":0.02339521022761119,"score_gpt":0.2600380946302295,"score_spread":0.2366428844026183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195844759","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.57029194,0.00207346,0.21306738,0.0021279017,0.00083202013,0.00019348701,0.0019011569,0.0010364839,0.20847626],"genre_scores_gemma":[0.9022789,0.0008333946,0.038139652,0.0006818975,0.00019720626,0.00014814998,0.0014287578,0.00019425795,0.05609784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996574,0.00007819522,0.000020299545,0.000089655965,0.00007997723,0.000074589145],"domain_scores_gemma":[0.99869496,0.00053639733,0.00024177741,0.000120127836,0.00019022716,0.00021644488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027032834,0.00041023255,0.00023718031,0.0017750476,0.00132393,0.0018374368,0.00047643026,0.0006550639,0.008621945],"category_scores_gemma":[0.0034203432,0.000249698,0.00023165107,0.0010293949,0.0013948319,0.0022163284,0.0010077765,0.0011463348,0.0010191236],"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.000094999974,0.00002376991,0.00082218647,0.000068848705,0.000005084887,0.00019314437,0.00036541687,0.0016401897,0.0028475814,0.971545,0.0037400117,0.018653752],"study_design_scores_gemma":[0.000015232566,0.000030676663,0.0012397828,0.000038834045,0.000006431012,0.00043196493,0.00028014721,0.0060854456,0.0030865504,0.9684623,0.020302948,0.000019580186],"about_ca_topic_score_codex":0.001213752,"about_ca_topic_score_gemma":0.002350816,"teacher_disagreement_score":0.008621945,"about_ca_system_score_codex":0.0010573802,"about_ca_system_score_gemma":0.0005869343,"threshold_uncertainty_score":0.028843224},"labels":[],"label_agreement":null},{"id":"W1970535101","doi":"10.1007/s00211-013-0569-x","title":"A spatially continuous max-flow and min-cut framework for binary labeling problems","year":2013,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Flow (mathematics); Binary number; A priori and a posteriori; Mathematical optimization; Maximum flow problem; Regular polygon; Convergence (economics); Cut; Minimum cut; Algorithm; Maximum cut; Segmentation; Applied mathematics; Graph; Combinatorics; Computer science; Image segmentation; Artificial intelligence; Geometry","score_opus":0.017982903384177403,"score_gpt":0.2563476440346922,"score_spread":0.23836474065051477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970535101","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.0026224747,0.00049716444,0.99424464,0.00033793057,0.000038622526,0.000030735115,0.000094749215,0.00009893864,0.00203474],"genre_scores_gemma":[0.14432824,0.0017645902,0.8406357,0.00033696397,0.000416165,0.00038801963,0.00049896265,0.00038188518,0.011249484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874914,0.0005374988,0.000045728804,0.00025644674,0.00030572503,0.00010542093],"domain_scores_gemma":[0.9976266,0.0014117442,0.00019572611,0.00022363199,0.00031958008,0.0002227219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002777411,0.0014010139,0.0021266656,0.0019715417,0.0011721523,0.0031231274,0.0039565535,0.0024789292,0.005816187],"category_scores_gemma":[0.00671725,0.0012324982,0.0014862119,0.0028231228,0.0022106732,0.0043923217,0.003190094,0.0048774234,0.00080303877],"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.00009643904,0.00009980874,0.00024810043,0.00024148237,0.00003707328,0.00009137642,0.00014675723,0.3328704,0.0016644631,0.5998646,0.00578332,0.058856107],"study_design_scores_gemma":[0.000016232976,0.00002962927,0.00009090773,0.000029950183,0.000015407684,0.000033413344,0.0000218855,0.72348976,0.0003887586,0.27193472,0.0039337366,0.00001554502],"about_ca_topic_score_codex":0.00512432,"about_ca_topic_score_gemma":0.0047081267,"teacher_disagreement_score":0.005816187,"about_ca_system_score_codex":0.0028509425,"about_ca_system_score_gemma":0.0022572244,"threshold_uncertainty_score":0.020685196},"labels":[],"label_agreement":null},{"id":"W1976080115","doi":"10.1006/jpdc.2000.1707","title":"A Case Study in Real-Time Parallel Computation: Correcting Algorithms","year":2001,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Speedup; Computation; Algorithm; Measure (data warehouse); Analysis of parallel algorithms; Parallel algorithm; Representation (politics); Class (philosophy); Theoretical computer science; Parallel computing; Artificial intelligence; Data mining","score_opus":0.03567379679215091,"score_gpt":0.3173730342745842,"score_spread":0.2816992374824333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976080115","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.5690624,0.0014986568,0.38595006,0.0056810253,0.00037951095,0.00048204075,0.0003202423,0.0024633221,0.03416277],"genre_scores_gemma":[0.8192135,0.00044949702,0.1668403,0.00023517357,0.00010129624,0.00010222613,0.00013310162,0.00037460975,0.012550345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970299,0.0011959891,0.00016288058,0.00032397182,0.001020097,0.0002671724],"domain_scores_gemma":[0.9752422,0.016736193,0.00094490306,0.0033583355,0.0031095787,0.0006088303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027190954,0.0007508165,0.0006292063,0.00093649956,0.0029635502,0.002508862,0.002359544,0.0061311782,0.0043729716],"category_scores_gemma":[0.021761352,0.0003815237,0.0006598661,0.0021510874,0.001842426,0.002165828,0.0010340648,0.001550779,0.0008900736],"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.0024921114,0.0018890653,0.033931393,0.0016855829,0.00022970463,0.0645581,0.0066761086,0.31337908,0.02152327,0.13401553,0.032309003,0.38731107],"study_design_scores_gemma":[0.00057072006,0.0010680961,0.0069940886,0.00020682978,0.00028050758,0.0505698,0.00387708,0.690829,0.09371672,0.05712243,0.09454038,0.00022425523],"about_ca_topic_score_codex":0.00678619,"about_ca_topic_score_gemma":0.007579106,"teacher_disagreement_score":0.00678619,"about_ca_system_score_codex":0.0011188383,"about_ca_system_score_gemma":0.0015433134,"threshold_uncertainty_score":0.014629066},"labels":[],"label_agreement":null},{"id":"W1978603650","doi":"10.4153/cmb-2011-038-7","title":"An Extension of Craig's Family of Lattices","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Digital Image Processing Techniques","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":"Mathematics; Lattice (music); Extension (predicate logic); Prime (order theory); Integer (computer science); Combinatorics; Physics","score_opus":0.041909248311350955,"score_gpt":0.2518423085294738,"score_spread":0.20993306021812286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978603650","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.55813444,0.0019201995,0.30810288,0.0017680407,0.00055093237,0.00014441629,0.0008682473,0.00075969595,0.12775107],"genre_scores_gemma":[0.9157182,0.0008589963,0.068148665,0.0002671743,0.0003316326,0.00008074881,0.0002735206,0.00009095776,0.014230107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923587,0.000117944284,0.000031011015,0.00012406595,0.00034004336,0.00015111004],"domain_scores_gemma":[0.99771535,0.00064765796,0.0002513097,0.0002803875,0.00070205156,0.00040325042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009416295,0.0003216781,0.00040122276,0.002348805,0.0022645579,0.0012525151,0.0008630723,0.00044000585,0.004941034],"category_scores_gemma":[0.0034064031,0.0004573194,0.000775033,0.0013692994,0.0021626223,0.0020576622,0.0015111566,0.0013208067,0.0005217084],"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.00011709671,0.00002443727,0.0010804788,0.00006920879,0.00001273217,0.00023581412,0.00038377728,0.004273004,0.0027229374,0.96906036,0.003698093,0.018322118],"study_design_scores_gemma":[0.00006813913,0.00019024465,0.0034954157,0.000076452656,0.00003527559,0.0019409413,0.0004042419,0.063207366,0.006031591,0.8525724,0.07185764,0.000120276796],"about_ca_topic_score_codex":0.0035758705,"about_ca_topic_score_gemma":0.0025841848,"teacher_disagreement_score":0.004941034,"about_ca_system_score_codex":0.0014467314,"about_ca_system_score_gemma":0.0010584627,"threshold_uncertainty_score":0.01652944},"labels":[],"label_agreement":null},{"id":"W1981707982","doi":"10.1023/b:numa.0000005350.20098.b1","title":"Characterization of Trimmed NURBS Surface Boundaries Using Topological Criteria","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Trimming; Topology (electrical circuits); Boundary (topology); Surface (topology); Gravitational singularity; Parametric surface; Parametric statistics; Point (geometry); Mathematical analysis; Geometry; Computer science; Combinatorics","score_opus":0.036045262179647666,"score_gpt":0.3065788427422236,"score_spread":0.2705335805625759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981707982","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.14492334,0.00020022999,0.8501072,0.00008981317,0.000029775354,0.00008812435,0.00009269208,0.00076138345,0.0037073987],"genre_scores_gemma":[0.67307967,0.00017101815,0.32419518,0.000051514897,0.000022519916,0.00011297552,0.00027370852,0.0003003965,0.0017930284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884665,0.00018063071,0.00006532472,0.00010917288,0.00071781414,0.00008042921],"domain_scores_gemma":[0.9941855,0.0022610135,0.00066369754,0.00088374974,0.0017668633,0.0002391778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001441866,0.00067316456,0.0009480981,0.0028986824,0.0006991486,0.0023990704,0.0016256534,0.0014935674,0.0032606793],"category_scores_gemma":[0.012281752,0.00051162764,0.00042895632,0.00087048346,0.0014274654,0.0021004765,0.0012660447,0.0008523863,0.00055857364],"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.0010137926,0.00027354315,0.0070467154,0.00067941117,0.000063187246,0.0005727321,0.0013833208,0.39343873,0.13432151,0.103444435,0.0022893813,0.3554732],"study_design_scores_gemma":[0.000018257037,0.00017414731,0.0023018576,0.00007949016,0.000021229247,0.00031487003,0.00029516607,0.93691796,0.03915781,0.017754491,0.002918319,0.00004634763],"about_ca_topic_score_codex":0.000924671,"about_ca_topic_score_gemma":0.0012965074,"teacher_disagreement_score":0.0032606793,"about_ca_system_score_codex":0.00075913215,"about_ca_system_score_gemma":0.0009468989,"threshold_uncertainty_score":0.010908008},"labels":[],"label_agreement":null},{"id":"W1982282944","doi":"10.1016/j.disc.2011.11.029","title":"Chop vectors and the lattice of integer partitions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Lattice (music); Discrete mathematics; Sequence (biology); Order (exchange); Element (criminal law); Computer science; Law","score_opus":0.033542135627341,"score_gpt":0.2555180730623817,"score_spread":0.22197593743504074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982282944","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.45209578,0.003288199,0.35776925,0.0030328948,0.0008487007,0.00008873748,0.0010384822,0.000530842,0.18130715],"genre_scores_gemma":[0.9075221,0.0012621431,0.05800294,0.00042996844,0.00036931795,0.00010015793,0.00079239946,0.00018719157,0.031333793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934214,0.00016982398,0.000036219386,0.00009350403,0.0002108529,0.00014742043],"domain_scores_gemma":[0.99892706,0.00039963267,0.00016602696,0.00012214643,0.00017763967,0.00020747079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054064195,0.00044775993,0.0005831837,0.0020746952,0.0013816337,0.0040008593,0.0008038982,0.0005989752,0.009280793],"category_scores_gemma":[0.0027999764,0.00036143066,0.0003778657,0.0019164891,0.002916392,0.0032055976,0.0017876584,0.001913149,0.0011534836],"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.00006041519,0.0000127391895,0.000110293135,0.000019504616,0.0000030781832,0.0000228472,0.00008252731,0.0018608845,0.00036923288,0.98745537,0.001144362,0.008858796],"study_design_scores_gemma":[0.0000116568235,0.000012105122,0.000070556554,0.000009708018,0.0000018663817,0.000028755929,0.00008886504,0.004700544,0.00021514152,0.9916848,0.0031693003,0.0000067186634],"about_ca_topic_score_codex":0.0009970597,"about_ca_topic_score_gemma":0.0008420612,"teacher_disagreement_score":0.009280793,"about_ca_system_score_codex":0.0008531014,"about_ca_system_score_gemma":0.0005443323,"threshold_uncertainty_score":0.031047344},"labels":[],"label_agreement":null},{"id":"W1982606685","doi":"10.1007/s00031-006-0036-z","title":"Contractible affine surfaces with quotient singularities","year":2007,"lang":"en","type":"article","venue":"Transformation Groups","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Contractible space; Mathematics; Quotient; Affine transformation; Pure mathematics; Gravitational singularity; Algebra over a field; Combinatorics; Mathematical analysis","score_opus":0.009602508499545899,"score_gpt":0.2347684515751386,"score_spread":0.2251659430755927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982606685","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.8448536,0.0005912216,0.09974031,0.0007154103,0.00019965331,0.00008134226,0.0001672939,0.00048616197,0.05316516],"genre_scores_gemma":[0.97716707,0.00024345644,0.008289005,0.000059922666,0.00009571297,0.000021804019,0.0001416371,0.00014245354,0.013838922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939084,0.000089482,0.000030202375,0.00011424976,0.00028628993,0.00008881409],"domain_scores_gemma":[0.9991887,0.00021117627,0.00017012272,0.00018983829,0.000073648705,0.00016661474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005663052,0.0012245831,0.0008246448,0.002132899,0.0012306864,0.002403045,0.00086608337,0.0009099186,0.0064093843],"category_scores_gemma":[0.0024922404,0.0005355227,0.0007111561,0.0011606545,0.0025797053,0.0033786397,0.003206623,0.0023544512,0.0007774405],"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.00019230752,0.000067126886,0.0008327313,0.000035475205,0.000022292676,0.0010299053,0.00061608315,0.0036547282,0.009133484,0.96681535,0.0008884424,0.016712222],"study_design_scores_gemma":[0.00006778233,0.000120795536,0.0012002375,0.000017328932,0.0000303089,0.0015441758,0.00042936622,0.016828189,0.0059012305,0.9659683,0.007862426,0.000029861689],"about_ca_topic_score_codex":0.0004717892,"about_ca_topic_score_gemma":0.00031666146,"teacher_disagreement_score":0.0064093843,"about_ca_system_score_codex":0.0008202493,"about_ca_system_score_gemma":0.0002834163,"threshold_uncertainty_score":0.02144152},"labels":[],"label_agreement":null},{"id":"W1983862473","doi":"10.1016/j.dam.2002.11.004","title":"Computing large planar regions in terrains, with an application to fracture surfaces","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Terrain; Embedding; Combinatorics; Mathematics; Heuristic; Planar; Graph; Unit sphere; RADIUS; Planar graph; Plane (geometry); Geometry; Computer science; Artificial intelligence; Mathematical optimization; Computer graphics (images); Geography","score_opus":0.012354288666288241,"score_gpt":0.26839749681263675,"score_spread":0.2560432081463485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983862473","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.13085397,0.00091063336,0.86461484,0.00051568716,0.00004451487,0.000045535104,0.00030514153,0.0013623751,0.0013472852],"genre_scores_gemma":[0.45493194,0.0008442954,0.5411487,0.00007222312,0.00011241051,0.000073007315,0.0005473544,0.00037010893,0.0018998939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996469,0.00006930574,0.000020474392,0.000090319685,0.00013149396,0.000041542],"domain_scores_gemma":[0.997767,0.0016595639,0.00013393398,0.0001490521,0.00018816182,0.000102347585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064486393,0.0008425897,0.0015549717,0.0015931346,0.00088360347,0.001469105,0.0014816865,0.0013728223,0.0018623165],"category_scores_gemma":[0.004883487,0.0008001553,0.0010331529,0.0027005712,0.0012077263,0.0017211108,0.0021673443,0.0012823096,0.0003072605],"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.0003562861,0.00008385189,0.0026219904,0.00023546041,0.000072984956,0.00034840152,0.00035386253,0.8276372,0.0079874955,0.026396848,0.0031267675,0.13077888],"study_design_scores_gemma":[0.000021980908,0.000022978704,0.00038237442,0.0000060810435,0.000009767299,0.00007002006,0.00004186443,0.98063755,0.00090059906,0.017142856,0.000755805,0.000008034453],"about_ca_topic_score_codex":0.008518476,"about_ca_topic_score_gemma":0.011573975,"teacher_disagreement_score":0.008518476,"about_ca_system_score_codex":0.0005818679,"about_ca_system_score_gemma":0.00055687415,"threshold_uncertainty_score":0.016937792},"labels":[],"label_agreement":null},{"id":"W1988420580","doi":"10.1007/s006070070013","title":"Output-Sensitive Algorithm for Computing β-Skeletons","year":2000,"lang":"en","type":"article","venue":"Computing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Intersection (aeronautics); Mathematics; Combinatorics; Planar; Algorithm; Graph; Measure (data warehouse); Skeleton (computer programming); RADIUS; Discrete mathematics; Computer science","score_opus":0.020301539706283823,"score_gpt":0.28330157766687813,"score_spread":0.2630000379605943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988420580","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.006611673,0.000046795067,0.9910676,0.000027511447,0.000022659216,0.00002890826,0.00005946753,0.0012110233,0.0009244793],"genre_scores_gemma":[0.07310946,0.00007132248,0.9224783,0.000056885692,0.00002507401,0.00007730237,0.00034910577,0.00031101576,0.0035214545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999225,0.000084276886,0.000054957134,0.00015096898,0.0004189094,0.00006585277],"domain_scores_gemma":[0.9987214,0.00025611848,0.000083912484,0.00030036466,0.00056987396,0.000068181864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009354936,0.00088243064,0.00078060734,0.0016212751,0.00063356303,0.0014502413,0.0015922982,0.00092068105,0.008912201],"category_scores_gemma":[0.0032298,0.0004573713,0.00064289995,0.0013129121,0.0006209411,0.0012512422,0.0017046154,0.0013114711,0.0032188732],"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.0005638453,0.0001387366,0.0012266096,0.00018042937,0.00006495612,0.00011955066,0.0001327065,0.03419307,0.07530193,0.03166522,0.0054031643,0.8510097],"study_design_scores_gemma":[0.00007166989,0.00018036859,0.001337494,0.000036113266,0.000054208245,0.00030747257,0.000072276525,0.86315143,0.09735895,0.026812794,0.01057728,0.000040021383],"about_ca_topic_score_codex":0.0010980227,"about_ca_topic_score_gemma":0.00213578,"teacher_disagreement_score":0.008912201,"about_ca_system_score_codex":0.0005712964,"about_ca_system_score_gemma":0.0010177715,"threshold_uncertainty_score":0.029814303},"labels":[],"label_agreement":null},{"id":"W1990521760","doi":"10.5539/mas.v3n6p141","title":"Research on Vectorization of Embroidery Images Consisting of Straight Lines &amp; Circular Arcs","year":2009,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Digital Image Processing Techniques","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":"Vectorization (mathematics); Computer science; Graphics; Computer graphics (images); Scanner; Image (mathematics); Vector graphics; Computer vision; Artificial intelligence; Parallel computing","score_opus":0.0796019375091712,"score_gpt":0.36786885130390984,"score_spread":0.2882669137947386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990521760","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.01193896,0.00067740714,0.9844503,0.00007897652,0.00006509325,0.000041281743,0.000074138676,0.00066112244,0.0020127522],"genre_scores_gemma":[0.14749691,0.0028195113,0.8407174,0.00006391351,0.000082229286,0.00007953589,0.00065707474,0.0003785142,0.0077050314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999548,0.00006351259,0.000031727457,0.00012819632,0.00019622076,0.000032261752],"domain_scores_gemma":[0.99920195,0.00020758687,0.00007777362,0.00012629347,0.00035425654,0.000032102398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038423986,0.00068833085,0.00046586693,0.0010194804,0.0002261155,0.0010213329,0.00088276406,0.00027940853,0.004420682],"category_scores_gemma":[0.001423569,0.00040820963,0.00056568184,0.0017421575,0.00042743213,0.0020311754,0.00036966908,0.00087346,0.0011302652],"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.000109826404,0.000045508477,0.00076440297,0.0005742968,0.000039863837,0.00012193227,0.00020267609,0.014045907,0.12760872,0.016756864,0.003291288,0.83643866],"study_design_scores_gemma":[0.000054943983,0.00054272544,0.005397766,0.00014342833,0.00010411224,0.0023808144,0.0006035559,0.5552299,0.33606997,0.015402756,0.08386905,0.00020102062],"about_ca_topic_score_codex":0.0014487884,"about_ca_topic_score_gemma":0.00087281904,"teacher_disagreement_score":0.004420682,"about_ca_system_score_codex":0.00039922164,"about_ca_system_score_gemma":0.0004490808,"threshold_uncertainty_score":0.014788628},"labels":[],"label_agreement":null},{"id":"W1991400499","doi":"10.1016/j.dam.2005.03.006","title":"A solvable case of image reconstruction in discrete tomography","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Conservatoire National des Arts et Métiers; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; École Polytechnique Fédérale de Lausanne","keywords":"Mathematics; Bounded function; Image (mathematics); Graph; Combinatorics; Time complexity; Discrete mathematics; Artificial intelligence; Computer science; Mathematical analysis","score_opus":0.010057554231600534,"score_gpt":0.25722725958762,"score_spread":0.24716970535601945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991400499","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.15584634,0.00089369225,0.7525695,0.008136125,0.0005060968,0.0001265785,0.00057645363,0.00045153432,0.080893554],"genre_scores_gemma":[0.89536804,0.00060766557,0.07288618,0.0007367273,0.00054764433,0.000107605956,0.00046614977,0.00020280057,0.02907716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982827,0.0005393754,0.00010740703,0.00029965458,0.0005343943,0.00023645315],"domain_scores_gemma":[0.9957768,0.0023562175,0.00050057354,0.00056772796,0.00032697682,0.00047165333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018249031,0.0008150556,0.0013866383,0.0012696371,0.0019116037,0.0056346823,0.0017802947,0.0051801973,0.008204903],"category_scores_gemma":[0.012297149,0.00063143147,0.0014598242,0.0012887991,0.004191385,0.0054856394,0.0033280347,0.0040692315,0.00068225904],"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.00005093977,0.000026351527,0.00020494573,0.00005953645,0.000015779426,0.0003569347,0.00011996189,0.0066272696,0.00047647924,0.9877458,0.0016052607,0.0027107513],"study_design_scores_gemma":[0.000033505014,0.000010841984,0.00008069332,0.000012906966,0.000007462132,0.00036555965,0.00006863587,0.07259588,0.00043178038,0.9252004,0.0011789515,0.000013379818],"about_ca_topic_score_codex":0.0016991412,"about_ca_topic_score_gemma":0.0010867697,"teacher_disagreement_score":0.008204903,"about_ca_system_score_codex":0.00097456,"about_ca_system_score_gemma":0.0010648799,"threshold_uncertainty_score":0.027448177},"labels":[],"label_agreement":null},{"id":"W1992055650","doi":"10.1016/j.disc.2013.07.011","title":"Corrigendum to “Velocity polytopes of periodic graphs and a no-go theorem for digital physics” [Discrete Mathematics 313 (2013) 1289–1301]","year":2013,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Polytope; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02133920632146357,"score_gpt":0.26101839544759203,"score_spread":0.23967918912612846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992055650","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042494992,0.0046892613,0.004849007,0.07295571,0.88377213,0.00006842683,0.0014070219,0.0006494024,0.03118406],"genre_scores_gemma":[0.026671886,0.016060585,0.01552868,0.094629355,0.2714258,0.00040746076,0.0045246826,0.0021493891,0.56860214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99672794,0.00054772216,0.00035546895,0.0006242257,0.0014619832,0.00028261592],"domain_scores_gemma":[0.99235755,0.0017416622,0.00032742528,0.00071665103,0.004475835,0.00038085485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021750024,0.0021301736,0.002723568,0.0045865974,0.0039260928,0.0034904943,0.004625141,0.0051274616,0.097237386],"category_scores_gemma":[0.02056917,0.001046805,0.0024871754,0.0030840554,0.0026024042,0.0042950544,0.0023861716,0.006535273,0.03058202],"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.000021065955,0.000008979615,0.000036639853,0.00012247855,0.000013776617,0.00006878541,0.00001796025,0.00012932588,0.00006064146,0.008991626,0.9842285,0.0063002803],"study_design_scores_gemma":[0.000051142797,0.000044769193,0.0011649553,0.00020656831,0.00007970475,0.0003179427,0.000083816085,0.0019302656,0.0005678481,0.04844876,0.94700956,0.000094705814],"about_ca_topic_score_codex":0.019051857,"about_ca_topic_score_gemma":0.027256526,"teacher_disagreement_score":0.097237386,"about_ca_system_score_codex":0.005372655,"about_ca_system_score_gemma":0.0030947735,"threshold_uncertainty_score":0.32529145},"labels":[],"label_agreement":null},{"id":"W1994239841","doi":"10.1016/j.laa.2005.11.016","title":"On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Characterization (materials science); Euclidean distance; Polynomial; Matrix (chemical analysis); Euclidean distance matrix; Combinatorics; Realization (probability); Euclidean geometry; Subspace topology; Characteristic polynomial; Algebra over a field; Pure mathematics; Euclidean space; Mathematical analysis; Geometry","score_opus":0.005901363129197902,"score_gpt":0.22123848947358918,"score_spread":0.21533712634439128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994239841","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.24353266,0.007094574,0.6943358,0.005762155,0.00048977917,0.000049728664,0.00064726605,0.0001658957,0.04792211],"genre_scores_gemma":[0.91553444,0.007940884,0.05294463,0.0007992079,0.0017834984,0.00011180972,0.0006605723,0.00016478846,0.02006016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988595,0.00039464608,0.00005191184,0.00024745028,0.0002996791,0.00014672846],"domain_scores_gemma":[0.9946412,0.0033646363,0.0007046408,0.00035596403,0.0005221436,0.00041130604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015647351,0.0010016274,0.00095175725,0.002230409,0.0009884264,0.003366211,0.0013755575,0.001258148,0.0038382406],"category_scores_gemma":[0.01034775,0.00045758497,0.00064226054,0.002517253,0.0058520073,0.010178811,0.0026962443,0.0038902685,0.0008148561],"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.00005308696,0.000020381513,0.000207987,0.000048464088,0.0000065102113,0.00004184313,0.00018231344,0.0043702996,0.0005577328,0.9831024,0.0011568497,0.01025213],"study_design_scores_gemma":[0.0000070818955,0.000018573322,0.0001498749,0.000012931063,0.0000029982227,0.00006206905,0.000049376296,0.012079712,0.00012513349,0.98635197,0.0011258997,0.000014346195],"about_ca_topic_score_codex":0.001491841,"about_ca_topic_score_gemma":0.0008884417,"teacher_disagreement_score":0.0038382406,"about_ca_system_score_codex":0.0010736391,"about_ca_system_score_gemma":0.0009728256,"threshold_uncertainty_score":0.012840211},"labels":[],"label_agreement":null},{"id":"W1996179839","doi":"10.1142/s012905410600398x","title":"PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Centre National de la Recherche Scientifique","keywords":"Corollary; Mathematics; Combinatorics; Property (philosophy); Square lattice; Lattice (music); Reentrancy; Hexagonal lattice; Hexagonal crystal system; Discrete valuation; Polyomino; Salient; Discrete mathematics; Pure mathematics; Geometry; Computer science; Statistical physics","score_opus":0.018182904026323252,"score_gpt":0.28407451216717167,"score_spread":0.2658916081408484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996179839","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.8628781,0.00030044673,0.106562205,0.00020968544,0.00007409925,0.000039089773,0.00014263783,0.0001204043,0.029673453],"genre_scores_gemma":[0.9767734,0.00025734594,0.017982772,0.000038635204,0.000047591682,0.000039034592,0.00012334483,0.000048569702,0.004689301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997868,0.000028185703,0.000012246412,0.000057368907,0.00007429195,0.000041142044],"domain_scores_gemma":[0.99886096,0.00046807024,0.00021733809,0.00010687594,0.00012999949,0.00021678767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422132,0.00028135246,0.000314378,0.0013702046,0.00096449704,0.0019778467,0.00055228046,0.00053559645,0.0044631227],"category_scores_gemma":[0.002619584,0.00022644021,0.00034825466,0.00088324194,0.0018989507,0.0030579853,0.0008762443,0.0008751633,0.00037466933],"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.000061030274,0.000023447283,0.0015611472,0.00004071709,0.0000056632684,0.0003020286,0.00033491445,0.002797088,0.0044695316,0.9779007,0.0002918926,0.01221193],"study_design_scores_gemma":[0.000035245892,0.00009889924,0.0014974091,0.000034227654,0.000008865461,0.00079310784,0.00023352446,0.027541425,0.004242914,0.96019036,0.005300715,0.000023310937],"about_ca_topic_score_codex":0.00031636693,"about_ca_topic_score_gemma":0.00019181572,"teacher_disagreement_score":0.0044631227,"about_ca_system_score_codex":0.00054393295,"about_ca_system_score_gemma":0.00022018336,"threshold_uncertainty_score":0.0149306655},"labels":[],"label_agreement":null},{"id":"W1998139942","doi":"10.1016/s0022-247x(03)00465-7","title":"Differentiators and the geometry of polynomials","year":2003,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Differentiator; Conjecture; De Bruijn sequence; Mathematics; Operator (biology); Hilbert space; Pure mathematics; Space (punctuation); Algebra over a field; Discrete mathematics; Computer science; Telecommunications","score_opus":0.008117234693215418,"score_gpt":0.2514839127944663,"score_spread":0.24336667810125087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998139942","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.30210158,0.015102084,0.49228737,0.008666402,0.0013347565,0.000042426,0.0004378608,0.0003183331,0.17970927],"genre_scores_gemma":[0.93729633,0.0054712663,0.030619688,0.00042172032,0.0009968026,0.000028670964,0.00015159303,0.00007439491,0.024939628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995896,0.000118791606,0.00001916883,0.00008479425,0.00013426351,0.00005334235],"domain_scores_gemma":[0.99895203,0.00052912027,0.00015423894,0.00006626375,0.00018494768,0.000113443544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061028625,0.00049112394,0.00054174743,0.001957343,0.00088995363,0.00252468,0.000584687,0.00068286597,0.0039778054],"category_scores_gemma":[0.003152281,0.000273924,0.00048296113,0.0010855084,0.0030740688,0.003508278,0.0016914295,0.00213761,0.00057240337],"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.000010014281,0.0000025390748,0.000057404082,0.000011806989,0.0000020890877,0.000023591998,0.00007480987,0.0005693781,0.00030352513,0.9947174,0.00039586538,0.003831595],"study_design_scores_gemma":[0.000009711918,0.0000192753,0.0001567792,0.000008416917,0.0000037020538,0.00010808488,0.000074144875,0.004517177,0.00028038933,0.98691946,0.007894691,0.0000081117405],"about_ca_topic_score_codex":0.000977491,"about_ca_topic_score_gemma":0.0005384383,"teacher_disagreement_score":0.0039778054,"about_ca_system_score_codex":0.0012882738,"about_ca_system_score_gemma":0.0004556159,"threshold_uncertainty_score":0.013307095},"labels":[],"label_agreement":null},{"id":"W2002074584","doi":"10.1080/1025584021000003874","title":"Skeletonization of Volumetric Angiograms for Display","year":2002,"lang":"en","type":"article","venue":"Computer Methods in Biomechanics & Biomedical Engineering","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Skeletonization; Topological skeleton; Voxel; Curvature; Artificial intelligence; Medial axis; Computer vision; Segmentation; Mathematics; Computer science; Smoothing; Shape analysis (program analysis); Tangent; Geometry; Active shape model","score_opus":0.025841351292344005,"score_gpt":0.3153706224222706,"score_spread":0.2895292711299266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002074584","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.008511163,0.00019245541,0.9749326,0.0002275408,0.00009664417,0.0001301116,0.00082530983,0.011555835,0.003528339],"genre_scores_gemma":[0.07514611,0.00069536775,0.91428095,0.0000980046,0.00015905654,0.00023312737,0.0024230583,0.0029694384,0.0039948868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971133,0.000052979896,0.000028057022,0.000042727665,0.00013081849,0.000034019882],"domain_scores_gemma":[0.99875844,0.00043395953,0.000078772646,0.00038130686,0.00028206824,0.000065473374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006092617,0.00078895426,0.00056258496,0.0024738372,0.0003433568,0.0015744084,0.000659312,0.0006055344,0.024831772],"category_scores_gemma":[0.003993048,0.00048815462,0.00055956206,0.0013768794,0.0003239809,0.0009039397,0.0010048968,0.000956181,0.0067691933],"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.0004981765,0.00008623509,0.0007363049,0.00036328065,0.000039622035,0.0005949456,0.00018100656,0.013111716,0.23257336,0.021494519,0.03214402,0.6981768],"study_design_scores_gemma":[0.00016947492,0.00026371607,0.0072404384,0.00016782137,0.000065365566,0.003968205,0.00014130172,0.55702,0.21593061,0.047117744,0.16776714,0.0001480986],"about_ca_topic_score_codex":0.00063800556,"about_ca_topic_score_gemma":0.00087743154,"teacher_disagreement_score":0.024831772,"about_ca_system_score_codex":0.0002736974,"about_ca_system_score_gemma":0.00067213597,"threshold_uncertainty_score":0.083070576},"labels":[],"label_agreement":null},{"id":"W2003376141","doi":"10.1016/j.jctb.2008.01.007","title":"A new characterization of graphic matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Matroid; Characterization (materials science); Graphic matroid; Computer science; Binary number; Combinatorics; Mathematics; Arithmetic; Physics","score_opus":0.009260047484923319,"score_gpt":0.22148776045745042,"score_spread":0.2122277129725271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003376141","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.38430697,0.0022841035,0.41077343,0.005256337,0.00071988604,0.00018712766,0.0019135592,0.0010539873,0.19350454],"genre_scores_gemma":[0.8837679,0.0017087763,0.06814287,0.0012703344,0.0017896483,0.00021268283,0.0017686096,0.0004974006,0.040841844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989214,0.00021521887,0.00008281363,0.0003015339,0.00033078797,0.00014829208],"domain_scores_gemma":[0.9965521,0.0014193045,0.00058989855,0.00047134943,0.0004657283,0.0005015405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611453,0.001160177,0.0009533278,0.0050037517,0.0014958938,0.006082989,0.0016031455,0.001542473,0.012468909],"category_scores_gemma":[0.0038202696,0.0007436129,0.00091752934,0.004174413,0.0024908325,0.006706328,0.0025103157,0.0035133692,0.0018799073],"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.000058386,0.00005277372,0.0009511702,0.000085070955,0.000015043292,0.0001910409,0.00037894124,0.001791492,0.003150109,0.9634694,0.0057133986,0.024143312],"study_design_scores_gemma":[0.000023656792,0.00006949942,0.0013260468,0.000051208095,0.000029356037,0.0010063485,0.0002464295,0.019752292,0.0015397315,0.9541476,0.02177177,0.00003603345],"about_ca_topic_score_codex":0.00045669754,"about_ca_topic_score_gemma":0.00047863612,"teacher_disagreement_score":0.012468909,"about_ca_system_score_codex":0.0013274363,"about_ca_system_score_gemma":0.0003501938,"threshold_uncertainty_score":0.04171264},"labels":[],"label_agreement":null},{"id":"W2012123964","doi":"10.1007/s00339-014-8466-4","title":"The reconstruction of finite extent objects with the superlens","year":2014,"lang":"en","type":"article","venue":"Applied Physics A","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Superlens; Optics; Materials science; Physics; Chemistry; Evanescent wave","score_opus":0.007837136473667709,"score_gpt":0.20000687457801103,"score_spread":0.19216973810434332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012123964","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.06514058,0.00068713544,0.9308029,0.00030991773,0.000032130705,0.000027089116,0.00013223621,0.00029930624,0.0025686994],"genre_scores_gemma":[0.30447695,0.001147646,0.69022316,0.0001158621,0.0000392863,0.00003412683,0.00029013894,0.0001703134,0.0035024567],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997261,0.00007898842,0.000012541351,0.000030989857,0.00013242473,0.000018960964],"domain_scores_gemma":[0.9994449,0.00024738666,0.000069773814,0.00011481989,0.00007166276,0.000051492752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010011537,0.00053572,0.00046693106,0.0005868476,0.00019786002,0.0011299782,0.0007021881,0.00074789044,0.0010360439],"category_scores_gemma":[0.0019472935,0.00055418006,0.00039176233,0.00090005173,0.00074506167,0.0020316192,0.0013943665,0.0010403462,0.0003426807],"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.001128244,0.00011261326,0.004903306,0.0008628037,0.00023092907,0.0012679182,0.00063836767,0.22162507,0.300735,0.19545884,0.004091661,0.2689454],"study_design_scores_gemma":[0.000022618282,0.000044974277,0.0014870904,0.0000326392,0.0000214127,0.0006311198,0.00006195226,0.9268864,0.046124347,0.020137878,0.004505475,0.000044151147],"about_ca_topic_score_codex":0.0009957355,"about_ca_topic_score_gemma":0.0015067037,"teacher_disagreement_score":0.0011299782,"about_ca_system_score_codex":0.0003894054,"about_ca_system_score_gemma":0.0004889782,"threshold_uncertainty_score":0.005294621},"labels":[],"label_agreement":null},{"id":"W2012547968","doi":"10.1007/s10044-012-0311-9","title":"Geometric algorithm for dominant point extraction from shape contour","year":2012,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Position (finance); Point (geometry); Set (abstract data type); Regular polygon; Mathematics; Heuristic; Computer science; Convex hull; Artificial intelligence; Iterative closest point; Tree (set theory); Pattern recognition (psychology); Point cloud; Combinatorics; Geometry","score_opus":0.019509206955667845,"score_gpt":0.29756651149045865,"score_spread":0.27805730453479083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012547968","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.0028486683,0.00012337691,0.99521315,0.000038644113,0.000027324802,0.00005363372,0.00004490947,0.0009937516,0.000656524],"genre_scores_gemma":[0.030233907,0.0002967365,0.9661044,0.000053039916,0.000032925884,0.00013634366,0.00038052973,0.00021456946,0.0025476005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944705,0.000043672342,0.000031278796,0.00013784462,0.00028406852,0.00005605613],"domain_scores_gemma":[0.9996069,0.00006232536,0.000033822176,0.00007245081,0.00020563931,0.00001880112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044560118,0.0011056177,0.0011042993,0.002765378,0.00073355995,0.0011456547,0.0019353502,0.0010571495,0.0056578373],"category_scores_gemma":[0.0010362905,0.00069311284,0.0010892204,0.0022023083,0.00057163025,0.001207069,0.001280904,0.0011608264,0.004033801],"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.00012809344,0.000051446026,0.00046523492,0.00018266842,0.00004120603,0.00016089423,0.00010838798,0.011638512,0.09218821,0.008740054,0.0047725723,0.8815227],"study_design_scores_gemma":[0.00008837542,0.0003263646,0.0031618965,0.00006001404,0.00015064006,0.0020033098,0.00014778983,0.7701798,0.16136806,0.015350445,0.047054835,0.00010852659],"about_ca_topic_score_codex":0.0020935684,"about_ca_topic_score_gemma":0.0021388677,"teacher_disagreement_score":0.0056578373,"about_ca_system_score_codex":0.000448409,"about_ca_system_score_gemma":0.0013427223,"threshold_uncertainty_score":0.018927395},"labels":[],"label_agreement":null},{"id":"W2015085522","doi":"10.1049/el:20040566","title":"Architectures for finite Radon transform","year":2004,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Very-large-scale integration; Image (mathematics); Computer science; Architecture; Radon; Image processing; Sequence (biology); Radon transform; Parallel computing; Computational science; Algorithm; Computer hardware; Electronic engineering; Arithmetic; Embedded system; Computer vision; Engineering; Mathematics; Physics","score_opus":0.007587316127119095,"score_gpt":0.23555823364478848,"score_spread":0.22797091751766937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015085522","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.03194437,0.0012090772,0.9498645,0.0002623455,0.00012306678,0.00003663234,0.0000742955,0.003086306,0.013399349],"genre_scores_gemma":[0.39287743,0.0012157633,0.59111273,0.00025776494,0.00011816847,0.00010583183,0.0005379404,0.0001799388,0.013594397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998392,0.000024152208,0.000012896493,0.00003380907,0.00006500904,0.000024947654],"domain_scores_gemma":[0.99983776,0.00003658354,0.000014531956,0.000044838183,0.00005706957,0.000009147447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026216081,0.00030428733,0.00029774633,0.0004156221,0.00026378702,0.0007584333,0.0009027773,0.0005658781,0.0072130687],"category_scores_gemma":[0.0005882106,0.00018025764,0.00037102573,0.00042912154,0.00027795305,0.0012527454,0.00047461124,0.00051679416,0.0021222865],"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.00032975606,0.00008188035,0.0005197063,0.0003214513,0.000048218502,0.00032939552,0.0001927918,0.023548052,0.2331597,0.23075563,0.008142575,0.50257087],"study_design_scores_gemma":[0.00018401889,0.0012066488,0.0016155924,0.00013685063,0.00016028355,0.0028024833,0.00015121138,0.3675787,0.339757,0.099504374,0.18675296,0.00014996012],"about_ca_topic_score_codex":0.0004958922,"about_ca_topic_score_gemma":0.0009034403,"teacher_disagreement_score":0.0072130687,"about_ca_system_score_codex":0.0003866238,"about_ca_system_score_gemma":0.00040255967,"threshold_uncertainty_score":0.024130106},"labels":[],"label_agreement":null},{"id":"W2015323145","doi":"10.1088/1742-6596/256/1/012010","title":"A Parallel Algorithm for Connected Component Labelling of Gray-scale Images on Homogeneous Multicore Architectures","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Multi-core processor; Homogeneous; Computer science; Labelling; Grayscale; Component (thermodynamics); Gray (unit); Parallel computing; Connected component; Scale (ratio); Artificial intelligence; Image (mathematics); Mathematics; Cartography; Combinatorics; Physics; Geography","score_opus":0.01860634326029394,"score_gpt":0.26412607445945213,"score_spread":0.24551973119915818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015323145","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.003264963,0.00007023827,0.99218917,0.000066505585,0.000048066137,0.00008335347,0.000051242903,0.0031650343,0.0010615027],"genre_scores_gemma":[0.023703322,0.00006645377,0.9735737,0.000032118918,0.000018592142,0.00014887046,0.00021346114,0.0002658402,0.001977663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996754,0.000032525844,0.000023091281,0.00007883715,0.0001492613,0.000040850897],"domain_scores_gemma":[0.9995134,0.000093677874,0.00003081771,0.00010441178,0.00022067198,0.000036971764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003700991,0.0010309234,0.0006876732,0.0011860456,0.000970307,0.00082308805,0.0016396709,0.0006874216,0.0065738526],"category_scores_gemma":[0.0011585454,0.00057731813,0.0008585492,0.0015103028,0.0004986374,0.0010857705,0.0008743023,0.0010478562,0.0020978434],"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.00024404586,0.000118521326,0.00050278095,0.00030595504,0.000110738154,0.00024878688,0.00020613811,0.093739234,0.06401504,0.025429972,0.020913562,0.79416513],"study_design_scores_gemma":[0.00010151955,0.00008794369,0.00040863405,0.000019689249,0.000044894758,0.00020114238,0.00003770407,0.93000615,0.030455366,0.018789118,0.019799631,0.000048315207],"about_ca_topic_score_codex":0.0093756,"about_ca_topic_score_gemma":0.014053112,"teacher_disagreement_score":0.0093756,"about_ca_system_score_codex":0.0010194567,"about_ca_system_score_gemma":0.0018924304,"threshold_uncertainty_score":0.02199173},"labels":[],"label_agreement":null},{"id":"W2015863953","doi":"10.1007/bf03167435","title":"The coloring of the voronoi network: investigation of structural heterogeneity in the packings of spheres","year":2005,"lang":"en","type":"article","venue":"Japan Journal of Industrial and Applied Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Voronoi diagram; Delaunay triangulation; Simplex; Weighted Voronoi diagram; Crystallization; Cluster (spacecraft); Measure (data warehouse); Centroidal Voronoi tessellation; Tetrahedron; Process (computing); Mathematics; Statistical physics; Materials science; Computer science; Geometry; Physics; Data mining; Thermodynamics","score_opus":0.04250770371216231,"score_gpt":0.25389013895829676,"score_spread":0.21138243524613445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015863953","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.959018,0.00021288634,0.036689308,0.00013077528,0.000016899072,0.000017901346,0.00009648669,0.00003688081,0.0037809587],"genre_scores_gemma":[0.99605185,0.00007704359,0.0033746967,0.000009530037,0.0000113863525,0.0000071453087,0.00005689464,0.000013870432,0.000397691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997179,0.0000970728,0.000007896567,0.00004966327,0.0000584802,0.00006899535],"domain_scores_gemma":[0.9977487,0.0012465417,0.00026887516,0.00020255736,0.00023199231,0.00030140948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000414854,0.00025007228,0.00043057,0.0012331336,0.0008032749,0.0013011693,0.0008572282,0.0005484748,0.0013307078],"category_scores_gemma":[0.0032916854,0.00043321255,0.00029477046,0.00090359576,0.0013818911,0.0013878542,0.00056756526,0.0003692438,0.00009402577],"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.0005664252,0.00014166722,0.026479987,0.0001495645,0.00007163171,0.00067960814,0.000851709,0.40983316,0.022621788,0.52224386,0.0017426688,0.014617942],"study_design_scores_gemma":[0.000036047597,0.00006525217,0.007964001,0.000009852505,0.000021769243,0.00027640298,0.0004544817,0.8760399,0.0022842372,0.111749835,0.0010677103,0.000030471458],"about_ca_topic_score_codex":0.004292078,"about_ca_topic_score_gemma":0.0028386805,"teacher_disagreement_score":0.004292078,"about_ca_system_score_codex":0.00067226664,"about_ca_system_score_gemma":0.0005338508,"threshold_uncertainty_score":0.008534193},"labels":[],"label_agreement":null},{"id":"W2016102556","doi":"10.1007/s00357-007-0011-0","title":"The Metric Bridge Partition Problem: Partitioning of a Metric Space into Two Subspaces Linked by an Edge in Any Optimal Realization","year":2007,"lang":"en","type":"article","venue":"Journal of Classification","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Realization (probability); Partition (number theory); Linear subspace; Discrete mathematics; Metric space; Graph; Geometry","score_opus":0.03605375981681319,"score_gpt":0.3333145787183773,"score_spread":0.2972608189015641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016102556","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.16672488,0.00057999295,0.82428205,0.0014262695,0.0000827703,0.00013042126,0.00045925216,0.00018200376,0.006132344],"genre_scores_gemma":[0.66531116,0.00091134926,0.32358292,0.00030126097,0.00016718087,0.00036820132,0.001941386,0.0002735992,0.0071430025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991398,0.00028018115,0.000044046006,0.00024308807,0.00016422111,0.0001286],"domain_scores_gemma":[0.99877757,0.00067229196,0.0001359344,0.0002042607,0.00009643845,0.00011340167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013530111,0.00085833,0.0020002478,0.0008831612,0.0012586855,0.0023900066,0.0018655102,0.0030368923,0.004400631],"category_scores_gemma":[0.005040849,0.0008580299,0.00094672566,0.0013449808,0.0021215926,0.00525949,0.0027977854,0.0020892045,0.0005792199],"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.00076596736,0.00028186725,0.0017200082,0.00052846887,0.00014285535,0.0003075842,0.00070467853,0.20429529,0.007914607,0.6199449,0.013395332,0.14999843],"study_design_scores_gemma":[0.00010780179,0.00017106919,0.0006506351,0.000058175112,0.000049203736,0.00018396856,0.00039653503,0.35201022,0.001724808,0.6395933,0.005018607,0.00003573556],"about_ca_topic_score_codex":0.0011243273,"about_ca_topic_score_gemma":0.0010653203,"teacher_disagreement_score":0.004400631,"about_ca_system_score_codex":0.0007802377,"about_ca_system_score_gemma":0.001034077,"threshold_uncertainty_score":0.014721632},"labels":[],"label_agreement":null},{"id":"W2022789141","doi":"10.1007/s10623-006-9014-9","title":"On binary signed digit representations of integers","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Binary number; Numerical digit; Representation (politics); Cryptography; Discrete mathematics; Arithmetic; Number theory; Combinatorics; Algorithm; Computer science","score_opus":0.015423869744795576,"score_gpt":0.2578590586946326,"score_spread":0.24243518894983704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022789141","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.05313645,0.004705862,0.87124914,0.0015439856,0.001594916,0.000081648635,0.00030132238,0.00049584475,0.06689093],"genre_scores_gemma":[0.65935695,0.0097847,0.28076887,0.0013090154,0.0017281378,0.0002455426,0.0008054103,0.00032571045,0.0456757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990044,0.00028547028,0.00008727957,0.0001155453,0.00039739592,0.000109903995],"domain_scores_gemma":[0.9982309,0.0008504793,0.00023844193,0.00032093094,0.00029679222,0.00006250451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881209,0.00082279625,0.00044711973,0.001838744,0.0005222271,0.0025105032,0.0005621079,0.0009591093,0.0055321706],"category_scores_gemma":[0.0065846234,0.00027382842,0.00034578552,0.0029622668,0.0015132386,0.0032972659,0.0014951541,0.0014827232,0.0019693307],"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.000078654586,0.0000147239925,0.00009574969,0.0000668512,0.0000037729833,0.00007025248,0.00012774597,0.0057026856,0.0021996885,0.9125199,0.0029692864,0.0761507],"study_design_scores_gemma":[0.000017930886,0.00006241852,0.00010512209,0.00014499432,0.000008246726,0.0002028878,0.00007690713,0.03587118,0.0028029254,0.93805933,0.022619745,0.000028379565],"about_ca_topic_score_codex":0.00040584992,"about_ca_topic_score_gemma":0.00045885448,"teacher_disagreement_score":0.0055321706,"about_ca_system_score_codex":0.00063596934,"about_ca_system_score_gemma":0.0005049442,"threshold_uncertainty_score":0.018506944},"labels":[],"label_agreement":null},{"id":"W2024909582","doi":"10.1006/cviu.2000.0859","title":"Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images","year":2000,"lang":"en","type":"article","venue":"Computer Vision and Image Understanding","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Adjacency list; Digital topology; Euclidean geometry; Mathematics; Digital geometry; Combinatorics; Digital image; Graph; Representation (politics); Adjacency matrix; Euclidean distance; Topology (electrical circuits); Computer science; Discrete mathematics; Image processing; Image (mathematics); Topological space; Artificial intelligence; General topology; Geometry; Extension topology","score_opus":0.02395372269932123,"score_gpt":0.28079652825282075,"score_spread":0.25684280555349953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024909582","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.05254106,0.0003369852,0.9362974,0.0003088607,0.000097886266,0.00008000597,0.0006145434,0.00033351497,0.009389705],"genre_scores_gemma":[0.5973217,0.0011820969,0.3838293,0.00022283386,0.00013669828,0.00028934667,0.001576929,0.00019515352,0.0152459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996791,0.000062739935,0.000020568523,0.000101685866,0.00010935393,0.000026535628],"domain_scores_gemma":[0.9995969,0.00013515323,0.000087742395,0.000051547457,0.00009558014,0.000033211058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013328815,0.0003462376,0.00045736757,0.0019170227,0.0005678185,0.001348366,0.00086196285,0.00065618363,0.00430134],"category_scores_gemma":[0.00119382,0.0002879839,0.00037104942,0.0023751108,0.0006750134,0.0013310956,0.0005977258,0.00077447825,0.00088161207],"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.00014576099,0.00014316887,0.0014612984,0.00026029974,0.000023365948,0.0003882468,0.0003567763,0.19374898,0.0122842295,0.50425863,0.007865579,0.2790636],"study_design_scores_gemma":[0.00001216797,0.000041294763,0.0013574488,0.00003518747,0.00001718766,0.00033421512,0.00023548027,0.70599914,0.0024826352,0.2776967,0.011759415,0.000029162982],"about_ca_topic_score_codex":0.005377029,"about_ca_topic_score_gemma":0.006093443,"teacher_disagreement_score":0.005377029,"about_ca_system_score_codex":0.0004411484,"about_ca_system_score_gemma":0.0003904717,"threshold_uncertainty_score":0.014389396},"labels":[],"label_agreement":null},{"id":"W2028254056","doi":"10.1016/j.dam.2014.08.018","title":"Reconstructing trees from digitally convex sets","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Convex hull; Convex set; Vertex (graph theory); Subderivative; Orthogonal convex hull; Convexity; Convex combination; Convex analysis; Regular polygon; Absolutely convex set; Convex polytope; Discrete mathematics; Graph; Convex body; Convex optimization; Geometry","score_opus":0.014076264276921234,"score_gpt":0.24145394871815765,"score_spread":0.2273776844412364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028254056","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.04570659,0.00026021202,0.95214987,0.00020442516,0.000040604016,0.000034418274,0.00021193355,0.00025499007,0.001136953],"genre_scores_gemma":[0.46276978,0.00075507566,0.5318778,0.00012592216,0.00009638613,0.0000935064,0.0010895093,0.00024009128,0.002951892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995421,0.00010002876,0.000029470673,0.000082254264,0.00019918114,0.000047014797],"domain_scores_gemma":[0.9959337,0.0028006132,0.00028348193,0.00042604285,0.00040018593,0.0001559004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007277525,0.0007796643,0.0011381855,0.0017377282,0.000430037,0.0015788646,0.0012221042,0.0016480586,0.001393653],"category_scores_gemma":[0.0062029557,0.0009957559,0.0008700349,0.0015334331,0.0010428732,0.0018547976,0.001711292,0.0030266808,0.0005179156],"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.00034766458,0.00010726163,0.0023645994,0.00032064976,0.00008349921,0.0007360579,0.0004095107,0.64627457,0.017961048,0.11686451,0.0041117193,0.21041897],"study_design_scores_gemma":[0.0000090827925,0.00001925958,0.00019703877,0.000020477213,0.000008544822,0.00011102313,0.00004031643,0.9528337,0.0025620954,0.043311246,0.00087710185,0.000010026886],"about_ca_topic_score_codex":0.0023034809,"about_ca_topic_score_gemma":0.0031000697,"teacher_disagreement_score":0.0023034809,"about_ca_system_score_codex":0.0006732537,"about_ca_system_score_gemma":0.00057787355,"threshold_uncertainty_score":0.0048847795},"labels":[],"label_agreement":null},{"id":"W2030100307","doi":"10.1006/jcis.1999.6559","title":"Geometric and Topological Analysis of Three-Dimensional Porous Media: Pore Space Partitioning Based on Morphological Skeletonization","year":2000,"lang":"en","type":"article","venue":"Journal of Colloid and Interface Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":150,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Skeletonization; Medial axis; Characterisation of pore space in soil; Topological skeleton; Topology (electrical circuits); Geometry; Node (physics); Biological system; Porosity; Mathematics; Materials science; Computer science; Physics; Segmentation; Artificial intelligence; Combinatorics; Composite material","score_opus":0.015081855681217787,"score_gpt":0.2677446627628029,"score_spread":0.2526628070815851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030100307","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.26193866,0.00017595458,0.73546255,0.00016547399,0.000014965327,0.00003469066,0.00010968144,0.00029063673,0.0018074015],"genre_scores_gemma":[0.8474333,0.00020236925,0.15122406,0.000017721793,0.00002031025,0.000030839285,0.00017682297,0.00008099361,0.0008135587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985194,0.000035464505,0.0000097352795,0.000023759887,0.000061549574,0.000017480674],"domain_scores_gemma":[0.9993698,0.00023068236,0.00010996882,0.00008186831,0.00015993048,0.00004783974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026028295,0.0002552312,0.00038879912,0.0013647128,0.00034330165,0.00093200884,0.00047330288,0.00044256513,0.0007776531],"category_scores_gemma":[0.0011591678,0.00022707735,0.0003999073,0.00074563845,0.00082459685,0.0009812345,0.00062724185,0.00029702025,0.00015687538],"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.0003361039,0.00015461686,0.0054789684,0.000356304,0.00006783133,0.00034941378,0.00039920484,0.4071296,0.25974044,0.11427402,0.0013359127,0.2103776],"study_design_scores_gemma":[0.0000061032233,0.00003469199,0.0024460272,0.0000069842995,0.0000104436895,0.00020770164,0.000043315147,0.9653058,0.017826533,0.013232181,0.0008568788,0.000023340088],"about_ca_topic_score_codex":0.0007010641,"about_ca_topic_score_gemma":0.0007257253,"teacher_disagreement_score":0.0013647128,"about_ca_system_score_codex":0.00029250342,"about_ca_system_score_gemma":0.00041719762,"threshold_uncertainty_score":0.002601564},"labels":[],"label_agreement":null},{"id":"W2043682027","doi":"10.1145/1015706.1015750","title":"Fast hierarchical importance sampling with blue noise properties","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Rendering (computer graphics); Computer science; Fibonacci number; Computer graphics; Sampling (signal processing); Algorithm; Sample (material); Graphics; Noise (video); Computer graphics (images); Artificial intelligence; Computer vision; Mathematics","score_opus":0.034359321684186046,"score_gpt":0.2575270295874086,"score_spread":0.22316770790322255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043682027","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.010027439,0.00007231295,0.9885848,0.000037141144,0.00001717827,0.000024581032,0.000016167438,0.00021793574,0.0010023362],"genre_scores_gemma":[0.294953,0.00013877657,0.70150113,0.00010919616,0.000049056565,0.00015992612,0.00014632574,0.00017234236,0.0027702309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992557,0.0001633836,0.000026126494,0.000078505866,0.00041087638,0.00006549866],"domain_scores_gemma":[0.99864656,0.0007348194,0.00009128541,0.00023401332,0.00021778498,0.00007558305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009566038,0.00045889476,0.00056812627,0.00071878696,0.00047946675,0.0005569378,0.00088687957,0.0004970618,0.0017831093],"category_scores_gemma":[0.0042241435,0.00040249384,0.00044233233,0.000600932,0.000664606,0.0009014532,0.0012535701,0.0008099828,0.0004746226],"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.000553393,0.00011094739,0.0017709867,0.00026400725,0.000056476965,0.00025844944,0.0005326333,0.45756906,0.0751865,0.13256027,0.003657528,0.32747975],"study_design_scores_gemma":[0.000022194512,0.00002986564,0.00016154314,0.0000055978826,0.000005912717,0.00004749142,0.00001089529,0.98061657,0.006934797,0.01060636,0.0015507092,0.000008094499],"about_ca_topic_score_codex":0.0023228177,"about_ca_topic_score_gemma":0.003470874,"teacher_disagreement_score":0.0023228177,"about_ca_system_score_codex":0.00067350245,"about_ca_system_score_gemma":0.0006451707,"threshold_uncertainty_score":0.005965054},"labels":[],"label_agreement":null},{"id":"W2044474959","doi":"10.1109/icfhr.2012.252","title":"Optimization of Point Selection on Digital Ink Curves","year":2012,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Point (geometry); Upper and lower bounds; Inkwell; Computer science; Algorithm; Approximation error; Series (stratigraphy); Selection (genetic algorithm); Mathematics; Dynamic programming; Linear programming; Mathematical optimization; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.014585686262417517,"score_gpt":0.253904538952752,"score_spread":0.23931885269033448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044474959","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.09389579,0.0002849052,0.9023303,0.00018442412,0.00002848464,0.000097941964,0.00009332007,0.0003226712,0.0027621533],"genre_scores_gemma":[0.6383872,0.0003753595,0.3546628,0.000070963324,0.000037749454,0.00029913482,0.00026276108,0.0001527633,0.005751207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994147,0.00016101814,0.000032658765,0.00012852282,0.00018655449,0.00007660044],"domain_scores_gemma":[0.9981517,0.0012605771,0.00014913091,0.00011552994,0.00022566896,0.000097391596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010262175,0.0010766914,0.0016908547,0.00089791755,0.0004404719,0.0008413037,0.0012386977,0.0013441221,0.0031879537],"category_scores_gemma":[0.004722906,0.0005917955,0.00055756356,0.0011360656,0.0010154814,0.0013815482,0.0011196086,0.00082502916,0.00060287537],"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.00024995583,0.000055016353,0.00055373,0.000094718394,0.000017524315,0.00006886114,0.000052949443,0.94690865,0.0050457856,0.0035316718,0.000658991,0.042762157],"study_design_scores_gemma":[0.000014642563,0.000054814835,0.00012789834,0.0000072044872,0.0000045668553,0.000015910047,0.000016114995,0.9948848,0.00223176,0.0022716122,0.00036483936,0.0000058316846],"about_ca_topic_score_codex":0.0020696959,"about_ca_topic_score_gemma":0.0012006938,"teacher_disagreement_score":0.0031879537,"about_ca_system_score_codex":0.00087166176,"about_ca_system_score_gemma":0.0006450296,"threshold_uncertainty_score":0.010664761},"labels":[],"label_agreement":null},{"id":"W2054063908","doi":"10.1016/j.ipl.2014.05.008","title":"Estimating the number of connected components in sublinear time","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Connected component; Sublinear function; Connectivity; Combinatorics; Strongly connected component; Graph; Component (thermodynamics); Computer science; Time complexity; Discrete mathematics; Mathematics; Minimum spanning tree; Algorithm","score_opus":0.012527989659151443,"score_gpt":0.24632686955367414,"score_spread":0.2337988798945227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054063908","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.11292778,0.0016042583,0.87133276,0.0022435004,0.00029398868,0.00014412736,0.0012533633,0.0037661176,0.0064340197],"genre_scores_gemma":[0.5433758,0.0007886179,0.43863195,0.0004779689,0.0003574958,0.00025947328,0.0030842794,0.0007886276,0.012235752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987097,0.00031008094,0.0000852256,0.0003511937,0.00038459955,0.0001592318],"domain_scores_gemma":[0.98457515,0.012394426,0.00057401357,0.0013308893,0.00078639487,0.0003390283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013004843,0.0014828313,0.0014975687,0.0018063602,0.00065334217,0.002509498,0.0022724797,0.0020686926,0.007608073],"category_scores_gemma":[0.018607855,0.0009251358,0.0008790101,0.0016051831,0.0011471699,0.005762451,0.002234421,0.0023515094,0.0022606226],"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.0028456885,0.00033973387,0.012009563,0.0010428069,0.0003186058,0.00054456864,0.00034512574,0.39608383,0.045873877,0.04627703,0.02192025,0.47239888],"study_design_scores_gemma":[0.000041150863,0.000034047593,0.0012569632,0.000018493567,0.000026100217,0.000095021,0.000048080237,0.95607316,0.0037692715,0.03730865,0.0013156998,0.000013431755],"about_ca_topic_score_codex":0.0056342524,"about_ca_topic_score_gemma":0.010995231,"teacher_disagreement_score":0.007608073,"about_ca_system_score_codex":0.0015145253,"about_ca_system_score_gemma":0.0015159762,"threshold_uncertainty_score":0.0254516},"labels":[],"label_agreement":null},{"id":"W2054275301","doi":"10.1007/s10472-007-9064-3","title":"Region–based theory of discrete spaces: A proximity approach","year":2007,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Complex system; Mathematics; Computer science; Statistical physics; Topology (electrical circuits); Algebra over a field; Pure mathematics; Physics; Artificial intelligence; Combinatorics","score_opus":0.16192205515226704,"score_gpt":0.35175972258948685,"score_spread":0.1898376674372198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054275301","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.0060349703,0.0020374777,0.9849871,0.0005960774,0.00010746961,0.000014989199,0.000043879016,0.00003669797,0.0061413036],"genre_scores_gemma":[0.5357829,0.0077331723,0.43656778,0.0005911881,0.0014806881,0.00021826604,0.00031111273,0.00019430366,0.017120646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978818,0.0009345911,0.000113446156,0.00038765185,0.0005775475,0.00010487622],"domain_scores_gemma":[0.9957623,0.002445345,0.00039847125,0.0005181085,0.00060781284,0.00026804753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026949123,0.0009613947,0.0018834199,0.00392492,0.0011794408,0.0047217878,0.0028253736,0.0017743838,0.0035344167],"category_scores_gemma":[0.0073776436,0.00096872094,0.002003706,0.0035323196,0.0044607273,0.007819122,0.0038601188,0.0037464385,0.0006505068],"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.000009174619,0.000009668811,0.00007601998,0.000056192883,0.00001923597,0.0000400002,0.00012631348,0.0072646085,0.00037454508,0.9864211,0.0004153823,0.0051877866],"study_design_scores_gemma":[0.0000066217276,0.000032089443,0.00010851526,0.00002081789,0.000016773745,0.000086358545,0.000055182565,0.06506259,0.00023345198,0.9293558,0.0050074104,0.000014407456],"about_ca_topic_score_codex":0.0010219782,"about_ca_topic_score_gemma":0.00054918387,"teacher_disagreement_score":0.0047217878,"about_ca_system_score_codex":0.0017720324,"about_ca_system_score_gemma":0.00057171524,"threshold_uncertainty_score":0.014252245},"labels":[],"label_agreement":null},{"id":"W2054932997","doi":"10.1016/j.comgeo.2004.11.003","title":"Computing straight-line 3D grid drawings of graphs in linear volume","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Grid; Volume (thermodynamics); Computer science; Constant (computer programming); Line (geometry); Queue; Focus (optics); Relevance (law); Graph drawing; Line segment; Mathematics; Theoretical computer science; Geometry; Graph; Artificial intelligence","score_opus":0.014323910653175915,"score_gpt":0.2790448373949305,"score_spread":0.2647209267417546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054932997","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.17591573,0.00038864504,0.8033105,0.0004546521,0.000083495695,0.0002229246,0.0025762464,0.0077996035,0.009248062],"genre_scores_gemma":[0.44914392,0.00041834405,0.5403194,0.00011667857,0.00003173176,0.00015338075,0.004319406,0.0010909457,0.004406256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999419,0.0001246938,0.00003730006,0.00013654443,0.00019312183,0.00008944492],"domain_scores_gemma":[0.99818474,0.001000313,0.00014643636,0.00028001532,0.00026934332,0.000119037155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003713973,0.0013480661,0.0014086061,0.0016059146,0.00062097394,0.0023297453,0.001824288,0.0012239476,0.014411633],"category_scores_gemma":[0.0046700872,0.0010241688,0.0010355563,0.0024730125,0.000660388,0.0023782505,0.0015908297,0.0012643671,0.0033582076],"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.00068674434,0.00022458877,0.0046376847,0.0006492163,0.00014789247,0.00050584576,0.0005497068,0.61379147,0.01032483,0.030453298,0.020671733,0.31735706],"study_design_scores_gemma":[0.00007277176,0.000073380725,0.0005082379,0.000023374103,0.000019648123,0.000086655135,0.00019836049,0.95863366,0.0034506675,0.033929262,0.0029870288,0.000016960952],"about_ca_topic_score_codex":0.007641212,"about_ca_topic_score_gemma":0.018141136,"teacher_disagreement_score":0.014411633,"about_ca_system_score_codex":0.0008662546,"about_ca_system_score_gemma":0.00082163245,"threshold_uncertainty_score":0.048211694},"labels":[],"label_agreement":null},{"id":"W2055701045","doi":"10.1109/isvd.2012.13","title":"Computing the Nearest Neighbor Transform Exactly with Only Double Precision","year":2012,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pixel; k-nearest neighbors algorithm; Voronoi diagram; Computer science; Algorithm; Binary number; Artificial intelligence; Mathematics; Arithmetic; Geometry","score_opus":0.020882987394104206,"score_gpt":0.2689286319672413,"score_spread":0.2480456445731371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055701045","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.01371815,0.0002629085,0.97679156,0.00018551805,0.00013036853,0.000038126956,0.000075469936,0.0013215137,0.00747635],"genre_scores_gemma":[0.14746346,0.00034810163,0.84553146,0.00012473401,0.00007711046,0.00009209386,0.00030806143,0.00020912876,0.0058458173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983999,0.00012352057,0.00011413244,0.00027945696,0.00093700143,0.0001459321],"domain_scores_gemma":[0.9985927,0.00036647846,0.00009278614,0.0005406323,0.00036508744,0.00004231598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006590252,0.0008136445,0.0011115184,0.00087434606,0.000826003,0.0023063417,0.0011036479,0.00079621194,0.0053392127],"category_scores_gemma":[0.0057983305,0.00043496973,0.0006235407,0.0011089905,0.0009629999,0.004195768,0.0013995084,0.0011510015,0.0031677221],"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.0004168896,0.00014286001,0.0011844246,0.00030397964,0.000086764325,0.00036141084,0.0003599943,0.118087135,0.046176545,0.15432267,0.012053401,0.66650397],"study_design_scores_gemma":[0.00014074141,0.00011728384,0.0005539394,0.000066694396,0.00005448081,0.0006384787,0.0002038983,0.75350136,0.057356272,0.15541643,0.031875614,0.000074791125],"about_ca_topic_score_codex":0.0031690912,"about_ca_topic_score_gemma":0.0043979594,"teacher_disagreement_score":0.0053392127,"about_ca_system_score_codex":0.00078537065,"about_ca_system_score_gemma":0.0016559275,"threshold_uncertainty_score":0.017861426},"labels":[],"label_agreement":null},{"id":"W2062866312","doi":"10.1016/s0024-3795(01)00485-2","title":"Two-view “cylindrical decomposition” of binary images","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ontario Council on Graduate Studies, Council of Ontario Universities","keywords":"Mathematics; Binary number; Graph; Structuring; Connected component; Representation (politics); Binary image; Decomposition; Algebraic number; Digital image; Alphabet; Image (mathematics); Object (grammar); Theoretical computer science; Artificial intelligence; Algorithm; Computer science; Combinatorics; Image processing; Arithmetic","score_opus":0.015083265708475988,"score_gpt":0.30743243848100416,"score_spread":0.29234917277252814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062866312","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.033421084,0.00028567066,0.95624036,0.00023182751,0.000102160106,0.000039342718,0.00033425706,0.00035583394,0.008989493],"genre_scores_gemma":[0.43299028,0.0008896622,0.5527899,0.00023713546,0.00021421605,0.0000807554,0.0012448909,0.00033561158,0.011217466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967587,0.00007262129,0.000015139611,0.00006163852,0.00011135524,0.00006340197],"domain_scores_gemma":[0.99969614,0.000038027898,0.000037547277,0.00006688153,0.00010430953,0.000057178117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031363886,0.00067509257,0.00046756887,0.0013545416,0.0003147742,0.0016977458,0.0004700439,0.00048015875,0.006929996],"category_scores_gemma":[0.00078719435,0.00031397666,0.0005717027,0.0008172853,0.00061749754,0.0016284743,0.0011178816,0.0008299015,0.0015864719],"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.0006904389,0.000058716243,0.00062199467,0.00035611456,0.00004157332,0.0004767037,0.00043407155,0.011156437,0.17845508,0.54716676,0.012428102,0.24811406],"study_design_scores_gemma":[0.000104525614,0.00034433225,0.0042678714,0.00011628614,0.00008339726,0.0028596923,0.00084039534,0.48149955,0.077186964,0.36522785,0.067293115,0.0001759766],"about_ca_topic_score_codex":0.00078155706,"about_ca_topic_score_gemma":0.0010032334,"teacher_disagreement_score":0.006929996,"about_ca_system_score_codex":0.00026449168,"about_ca_system_score_gemma":0.0003472834,"threshold_uncertainty_score":0.023183167},"labels":[],"label_agreement":null},{"id":"W2069277356","doi":"10.1090/s0002-9939-2014-12412-9","title":"The four-dimensional Perfect-Mirsky Conjecture","year":2014,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics","score_opus":0.012467552668576834,"score_gpt":0.24587778966944399,"score_spread":0.23341023700086716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069277356","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.867803,0.00026726178,0.060934644,0.0019009388,0.00013451846,0.000024470197,0.00069585326,0.00073173223,0.06750768],"genre_scores_gemma":[0.9887705,0.00008322311,0.0056388453,0.0001514566,0.00007129619,0.00002436951,0.00041590488,0.00006442819,0.004780011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878925,0.00022330385,0.00006960168,0.0002547405,0.00041122112,0.0002517715],"domain_scores_gemma":[0.99729615,0.0009062864,0.00047634763,0.000578476,0.00045344865,0.0002892784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009788148,0.00058259035,0.00069001224,0.001186432,0.0014161397,0.0020952257,0.0011140768,0.0009697755,0.007778321],"category_scores_gemma":[0.006219267,0.00040759996,0.00070742186,0.0007034557,0.0023731398,0.0027397443,0.0022901248,0.0011878297,0.0015265004],"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.0001773035,0.00003415583,0.002689085,0.00007296778,0.000020515427,0.0001704903,0.00033626484,0.0065561463,0.0023460747,0.9768212,0.004043823,0.0067320317],"study_design_scores_gemma":[0.000035451143,0.000032095628,0.0009857289,0.000018597944,0.000010451881,0.00010815325,0.00018295935,0.033447575,0.0021957802,0.96078354,0.0021760452,0.000023720759],"about_ca_topic_score_codex":0.0020259242,"about_ca_topic_score_gemma":0.001389481,"teacher_disagreement_score":0.007778321,"about_ca_system_score_codex":0.00096806494,"about_ca_system_score_gemma":0.0006924767,"threshold_uncertainty_score":0.026021063},"labels":[],"label_agreement":null},{"id":"W2071347067","doi":"10.1142/s0219467801000359","title":"TWO ALGORITHMS FOR COMPUTING THE EUCLIDEAN DISTANCE TRANSFORM","year":2001,"lang":"en","type":"article","venue":"International Journal of Image and Graphics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Algorithm; Euclidean distance; Pixel; Feature (linguistics); Metric (unit); Euclidean geometry; Computer science; Distance transform; Binary number; Image processing; Mathematics; Image (mathematics); Artificial intelligence; Arithmetic","score_opus":0.020549973665594027,"score_gpt":0.3258167522426751,"score_spread":0.30526677857708107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071347067","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.0012817183,0.00023024944,0.99635065,0.000117739626,0.00013077309,0.000047684207,0.000060928392,0.0006120488,0.0011682627],"genre_scores_gemma":[0.018191997,0.00030485814,0.97852176,0.00006195813,0.00011866461,0.00021474418,0.00036790236,0.00014447026,0.0020735897],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965479,0.00043225623,0.00031615837,0.000735899,0.0016260439,0.00034189908],"domain_scores_gemma":[0.9972638,0.00068622676,0.00020686082,0.0006275388,0.0010800378,0.00013549221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014289676,0.0016184634,0.0017017922,0.0028654863,0.0008759029,0.0026352382,0.0028464196,0.0020109946,0.0073892144],"category_scores_gemma":[0.010242166,0.00087686273,0.0013252818,0.002786666,0.0013127145,0.0052482756,0.0027295726,0.0026702604,0.0049754474],"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.00033187403,0.00018038585,0.000533864,0.00024816472,0.000057231104,0.00010045348,0.00011992784,0.038397074,0.009990929,0.097313106,0.012903712,0.83982325],"study_design_scores_gemma":[0.00041167127,0.00050850376,0.0013868595,0.0000937291,0.00009048118,0.0014240975,0.00021766912,0.71103674,0.047699425,0.16286369,0.07402254,0.00024464354],"about_ca_topic_score_codex":0.0024288255,"about_ca_topic_score_gemma":0.0034487564,"teacher_disagreement_score":0.0073892144,"about_ca_system_score_codex":0.0011766029,"about_ca_system_score_gemma":0.0023221206,"threshold_uncertainty_score":0.024719417},"labels":[],"label_agreement":null},{"id":"W2071695456","doi":"10.1007/s00453-011-9498-1","title":"Tile-Packing Tomography Is $\\mathbb{NP}$ -hard","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Comisión Interministerial de Ciencia y Tecnología; National Science Foundation","keywords":"Tile; Combinatorics; Disjoint sets; Mathematics; Grid; Projection (relational algebra); Tessellation (computer graphics); Set (abstract data type); Packing problems; Grid pattern; Geometry; Discrete mathematics; Algorithm; Computer science","score_opus":0.03993096740625833,"score_gpt":0.23957218440832576,"score_spread":0.19964121700206744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071695456","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.16417234,0.001513353,0.797798,0.007236309,0.00025809312,0.00028886402,0.0045722323,0.0022634957,0.021897342],"genre_scores_gemma":[0.7030592,0.0017985769,0.27126864,0.0010529722,0.0004243654,0.000571495,0.008160308,0.00058395334,0.013080465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875045,0.0002731334,0.00009062946,0.000437009,0.00024223766,0.00020651685],"domain_scores_gemma":[0.98958606,0.008588923,0.0005553809,0.0008253587,0.00024429476,0.00019997907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080801005,0.0011107662,0.0025518602,0.000536959,0.0010763637,0.0033755105,0.0018201293,0.0026060839,0.0060399515],"category_scores_gemma":[0.008133937,0.0009704142,0.001671654,0.0019964525,0.0019354904,0.0065677273,0.0023836133,0.003158842,0.0011099185],"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.0013274204,0.00036850077,0.005110241,0.0018704691,0.00032421327,0.0017105056,0.00074749225,0.51815146,0.010303359,0.25135106,0.047622554,0.16111268],"study_design_scores_gemma":[0.0001175107,0.000100326826,0.0008926355,0.00006327389,0.000058859187,0.0011051544,0.00036552153,0.60259604,0.0050982395,0.38251096,0.0070514055,0.00004016712],"about_ca_topic_score_codex":0.0021161847,"about_ca_topic_score_gemma":0.0025095828,"teacher_disagreement_score":0.0060399515,"about_ca_system_score_codex":0.0012113404,"about_ca_system_score_gemma":0.0010755515,"threshold_uncertainty_score":0.020205617},"labels":[],"label_agreement":null},{"id":"W2072044129","doi":"10.1016/j.tcs.2010.04.041","title":"Reconstructing <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>h</mml:mi><mml:mi>v</mml:mi></mml:math>-convex multi-coloured polyominoes","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polyomino; Combinatorics; Mathematics; Disjoint sets; Intersection (aeronautics); Focus (optics); Regular polygon; Discrete mathematics; Geometry; Physics; Cartography","score_opus":0.01529987571091161,"score_gpt":0.2548659633559216,"score_spread":0.23956608764501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072044129","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.026180796,0.00031457123,0.91912436,0.00056588376,0.000473364,0.00007516654,0.0035506452,0.0014076473,0.04830761],"genre_scores_gemma":[0.3102133,0.0008847315,0.6127577,0.00028245145,0.00015522169,0.00011680066,0.008285026,0.0033434439,0.063961394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999645,0.000040488725,0.000015158704,0.00008037138,0.00017059594,0.000048298927],"domain_scores_gemma":[0.9991806,0.00022878316,0.000052756954,0.00023701119,0.0002322391,0.00006849561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004053807,0.0007730143,0.0006107815,0.0014301294,0.0005575093,0.0020977585,0.00082803104,0.000798787,0.03806045],"category_scores_gemma":[0.0028125138,0.0005087536,0.00080930657,0.0009268651,0.0007101037,0.0021924472,0.0014983438,0.002279015,0.009423609],"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.00043784763,0.00010614805,0.0023921882,0.0006804709,0.000085340456,0.00052939414,0.00035998298,0.099480525,0.020976769,0.4928075,0.09262558,0.2895182],"study_design_scores_gemma":[0.00006937014,0.00006541285,0.0019464273,0.00014388954,0.000028647184,0.00057096645,0.00029440288,0.4768555,0.025748769,0.39807186,0.09613053,0.00007428106],"about_ca_topic_score_codex":0.002520393,"about_ca_topic_score_gemma":0.005033025,"teacher_disagreement_score":0.03806045,"about_ca_system_score_codex":0.00063088944,"about_ca_system_score_gemma":0.0007128284,"threshold_uncertainty_score":0.12732494},"labels":[],"label_agreement":null},{"id":"W2073187647","doi":"10.1142/s0219467801000372","title":"RECOGNIZING SYMBOLS BY DRAWING THEM","year":2001,"lang":"en","type":"article","venue":"International Journal of Image and Graphics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Symbol (formal); Orientation (vector space); Representation (politics); Artificial intelligence; Template matching; Matching (statistics); Variation (astronomy); Scale (ratio); Position (finance); Line (geometry); Pattern recognition (psychology); Computer vision; Arithmetic; Image (mathematics); Mathematics; Geometry; Statistics; Cartography","score_opus":0.020080088068414218,"score_gpt":0.28299166203880105,"score_spread":0.26291157397038684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073187647","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.022103922,0.0006570407,0.9428402,0.00024466653,0.0004560257,0.00026986055,0.00062290643,0.009962279,0.022843031],"genre_scores_gemma":[0.094011955,0.0013465339,0.8869142,0.0002179189,0.00011513171,0.0001665546,0.0019596473,0.000986167,0.014281812],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992465,0.00013730049,0.000063908585,0.0002756183,0.00020991423,0.00006674945],"domain_scores_gemma":[0.99898475,0.00034741324,0.000064911124,0.0003472397,0.00020863737,0.0000470879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043213338,0.0014958889,0.0012238951,0.0014680456,0.0006203156,0.003576105,0.001852555,0.0015584974,0.02855141],"category_scores_gemma":[0.0046206736,0.0005241748,0.0009303848,0.0020760412,0.00094868045,0.0035970379,0.0014857018,0.0011734193,0.016479447],"study_design_candidate":"bench_or_experimental","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.00018459538,0.000045306555,0.0008721702,0.0003962658,0.000033254702,0.00040604846,0.00047708355,0.008967671,0.051850427,0.020888751,0.011286887,0.9045914],"study_design_scores_gemma":[0.00009178704,0.00057535106,0.0045190263,0.0004305874,0.00026162836,0.0037860535,0.0016344243,0.3045762,0.21928138,0.07615268,0.3884352,0.0002557455],"about_ca_topic_score_codex":0.0016077085,"about_ca_topic_score_gemma":0.0017218507,"teacher_disagreement_score":0.02855141,"about_ca_system_score_codex":0.00039354578,"about_ca_system_score_gemma":0.00059804687,"threshold_uncertainty_score":0.09551394},"labels":[],"label_agreement":null},{"id":"W2074124111","doi":"10.1016/j.tcs.2008.06.015","title":"Discrete sets with minimal moment of inertia","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Moment of inertia; Moment (physics); Combinatorics; Computer science; Algorithm; Physics; Classical mechanics","score_opus":0.011438740854059583,"score_gpt":0.2512032215195959,"score_spread":0.23976448066553632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074124111","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.5302547,0.0012677584,0.3762053,0.0027027414,0.0007883723,0.000106667576,0.0009755377,0.00049665547,0.08720224],"genre_scores_gemma":[0.95605075,0.0004033785,0.026490659,0.0002597987,0.0008090989,0.00011989662,0.0004971793,0.00011347871,0.015255871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900645,0.00014561566,0.00007324572,0.00022915575,0.0003471409,0.00019844773],"domain_scores_gemma":[0.9972409,0.0012892189,0.00042262793,0.00034496913,0.00029357028,0.0004087123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062920514,0.00060901494,0.0014714117,0.0029033648,0.0016827736,0.003186902,0.0011145194,0.0012075393,0.0066319024],"category_scores_gemma":[0.0029394974,0.0005181481,0.0012025955,0.0011077657,0.0032581137,0.0030582864,0.0025170255,0.0021125316,0.00070103776],"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.00010405422,0.000026231239,0.00017986521,0.00004581996,0.0000152199045,0.000084853964,0.00016638954,0.00086191494,0.002331919,0.9899502,0.00082419906,0.0054094093],"study_design_scores_gemma":[0.00005594733,0.00008407048,0.0006656401,0.00001921734,0.000018529861,0.00031830455,0.00011497419,0.0077671777,0.001801515,0.9837361,0.0053819558,0.000036595127],"about_ca_topic_score_codex":0.00027572908,"about_ca_topic_score_gemma":0.00029241003,"teacher_disagreement_score":0.0066319024,"about_ca_system_score_codex":0.00092944247,"about_ca_system_score_gemma":0.00039848743,"threshold_uncertainty_score":0.022185981},"labels":[],"label_agreement":null},{"id":"W2077987919","doi":"10.1016/j.tcs.2012.10.040","title":"Combinatorial properties of double square tiles","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Square (algebra); Mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.02192587794218105,"score_gpt":0.2611460789304941,"score_spread":0.23922020098831304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077987919","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.7921432,0.00064494106,0.096328475,0.00048310353,0.00013130868,0.000058848043,0.0004353035,0.00019627206,0.1095786],"genre_scores_gemma":[0.9678439,0.00031359363,0.018357482,0.00010838508,0.00008659526,0.00007700723,0.00048299355,0.00010331027,0.01262674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996505,0.00005433936,0.00002408105,0.000080472906,0.00011559069,0.00007509009],"domain_scores_gemma":[0.9990075,0.0004283401,0.00017585304,0.00011873319,0.000104059596,0.00016543102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002467906,0.0004372679,0.0005180348,0.0013299368,0.0008560234,0.0030802493,0.0006612338,0.00041798168,0.0076131257],"category_scores_gemma":[0.0013980151,0.0005253742,0.00049022894,0.0011781417,0.0014143143,0.0014972527,0.0013033976,0.0010819095,0.00061998045],"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.00026284961,0.000046312427,0.0016664034,0.00014779625,0.000022441236,0.0005037027,0.00042780212,0.008074979,0.0129013555,0.9536795,0.0023278804,0.019939026],"study_design_scores_gemma":[0.00010639743,0.00013273867,0.0033428343,0.000056957986,0.000050315703,0.0013523285,0.00081473053,0.03213743,0.009151177,0.9339245,0.018885951,0.000044641776],"about_ca_topic_score_codex":0.00069807674,"about_ca_topic_score_gemma":0.00072250824,"teacher_disagreement_score":0.0076131257,"about_ca_system_score_codex":0.00051320606,"about_ca_system_score_gemma":0.00021795883,"threshold_uncertainty_score":0.025468409},"labels":[],"label_agreement":null},{"id":"W2085296387","doi":"10.1359/jbmr.090902","title":"On Lumpers and Splitters: The FRAX Debate Continues","year":2009,"lang":"en","type":"article","venue":"Journal of Bone and Mineral Research","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba; Defence Research and Development Canada","funders":"","keywords":"FRAX; Cohort; Medicine; Hip fracture; Population; Body mass index; Osteoporosis; Risk assessment; Demography; Gerontology; Physical therapy; Environmental health; Internal medicine; Osteoporotic fracture; Computer science; Bone mineral","score_opus":0.04323138122106558,"score_gpt":0.3595992302501116,"score_spread":0.316367849029046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085296387","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005673491,0.088121384,0.0048258533,0.8757276,0.026060589,0.000015306385,0.00008618316,0.000097653465,0.004498059],"genre_scores_gemma":[0.022487856,0.2001541,0.011041815,0.6226175,0.12657325,0.00009438865,0.00023865815,0.0006761913,0.016116349],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98569816,0.005581828,0.0012693723,0.0021122708,0.004771609,0.0005666793],"domain_scores_gemma":[0.9266238,0.051885337,0.0026481254,0.0039777188,0.012126899,0.0027381438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.059771698,0.001078078,0.0024715166,0.0033515415,0.0038566128,0.007610366,0.0066102874,0.019657787,0.013332918],"category_scores_gemma":[0.12518066,0.00073413306,0.0014341781,0.0035639973,0.03157259,0.0223151,0.0044297236,0.02701325,0.011938133],"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.00018774954,0.000037738722,0.0008136601,0.0005558743,0.00005728191,0.00016466988,0.0012599932,0.00012307719,0.00011643316,0.1696762,0.5169057,0.31010157],"study_design_scores_gemma":[0.00005089679,0.00008264816,0.00087407895,0.0036669513,0.000053090094,0.00064848585,0.0018213933,0.00030534843,0.000171083,0.14017822,0.8520579,0.000089909016],"about_ca_topic_score_codex":0.008547624,"about_ca_topic_score_gemma":0.006737624,"teacher_disagreement_score":0.059771698,"about_ca_system_score_codex":0.0039800596,"about_ca_system_score_gemma":0.0059611704,"threshold_uncertainty_score":0.31610674},"labels":[],"label_agreement":null},{"id":"W2092316005","doi":"10.1016/j.dam.2004.09.011","title":"Algorithms for polyominoes based on the discrete Green theorem","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Direction Générale de la Compétitivité, de l’Industrie et des Services","keywords":"Polyomino; Mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.02514378036693904,"score_gpt":0.27655141192817767,"score_spread":0.25140763156123863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092316005","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.008460116,0.0003148086,0.986686,0.00018422575,0.00016552597,0.000058031375,0.00007101723,0.00027716844,0.003783181],"genre_scores_gemma":[0.114695616,0.0006304202,0.87396955,0.00022932714,0.00017571672,0.0003319581,0.0004061884,0.00046424376,0.009096909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923396,0.00018161381,0.000050230876,0.00013712722,0.00029014333,0.0001068766],"domain_scores_gemma":[0.9979844,0.0011252728,0.0001254543,0.00031865126,0.00030117235,0.00014489156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011006267,0.0010766463,0.0018539566,0.0019118421,0.0011851421,0.0026726439,0.0020416733,0.0013244351,0.008609131],"category_scores_gemma":[0.006109416,0.00062655297,0.0012966451,0.002008899,0.0018014191,0.0043836893,0.004094559,0.0036849717,0.002107255],"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.0002583167,0.00012429207,0.00053809234,0.00024871185,0.00006906221,0.00007046646,0.00019829831,0.1149572,0.0035855635,0.6278414,0.0076584243,0.24445008],"study_design_scores_gemma":[0.00005760849,0.000041388237,0.00011905163,0.000036675745,0.000013031873,0.000040472878,0.000054874607,0.4364182,0.0010003311,0.5572548,0.004937234,0.000026307487],"about_ca_topic_score_codex":0.001634808,"about_ca_topic_score_gemma":0.002983592,"teacher_disagreement_score":0.008609131,"about_ca_system_score_codex":0.0011628312,"about_ca_system_score_gemma":0.0012825998,"threshold_uncertainty_score":0.028800488},"labels":[],"label_agreement":null},{"id":"W2094345793","doi":"10.1016/j.ejc.2007.04.010","title":"Latin squares and low discrepancy allocation of two-dimensional data","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Rectangle; Latin square; Combinatorics; Tile; Mathematics; Square (algebra); Space (punctuation); Discrete mathematics; Algorithm; Computer science; Geometry; Geography","score_opus":0.029084955832189962,"score_gpt":0.2859633665509024,"score_spread":0.2568784107187124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094345793","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.09405539,0.0008377709,0.89619124,0.001664188,0.00018216371,0.00007667488,0.00026518467,0.0006143108,0.0061131273],"genre_scores_gemma":[0.64436644,0.0008104227,0.33689693,0.0009499497,0.00048745732,0.0005928597,0.000949697,0.0005949457,0.01435128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99313724,0.0038754574,0.00034660913,0.0007870332,0.0012295991,0.00062402914],"domain_scores_gemma":[0.9670984,0.023257898,0.0016239068,0.005068185,0.0017383922,0.0012130952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056300545,0.0011994473,0.002381153,0.001957086,0.0011990463,0.0037667481,0.0032433048,0.0021922218,0.004876225],"category_scores_gemma":[0.045300316,0.0010029776,0.00079658796,0.0036123178,0.0041474253,0.0046185995,0.006375784,0.0028901251,0.0013759552],"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.0013008086,0.00016731842,0.0014863296,0.00026959332,0.00009760407,0.0001978488,0.00051520154,0.19958363,0.0057563614,0.71055967,0.0073796017,0.07268603],"study_design_scores_gemma":[0.00008980798,0.00007859456,0.00023078779,0.000032165262,0.000013139943,0.00013054902,0.00007675672,0.3641691,0.0016398034,0.6314836,0.002022302,0.000033489],"about_ca_topic_score_codex":0.0011931781,"about_ca_topic_score_gemma":0.0010132843,"teacher_disagreement_score":0.0056300545,"about_ca_system_score_codex":0.0020094612,"about_ca_system_score_gemma":0.0017205824,"threshold_uncertainty_score":0.029774964},"labels":[],"label_agreement":null},{"id":"W2095991286","doi":"10.1016/j.disc.2008.05.005","title":"Linear-time certifying algorithms for near-graphical sequences","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Mathematics; Algorithm; Combinatorics; Discrete mathematics; Time complexity","score_opus":0.06133415210901777,"score_gpt":0.3142347807293254,"score_spread":0.25290062862030765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095991286","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.03717007,0.00025416518,0.95369613,0.0007684045,0.00016306022,0.00015768764,0.0002984232,0.002523664,0.0049684625],"genre_scores_gemma":[0.5257197,0.00038980614,0.46217692,0.0006274426,0.00029558447,0.0003619205,0.001895149,0.00067384844,0.007859708],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995456,0.0010466338,0.00035842252,0.0012150727,0.0013679524,0.00055588444],"domain_scores_gemma":[0.97178763,0.01866377,0.001662006,0.0049250512,0.0020441746,0.0009173092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032356787,0.0015442938,0.0021982412,0.0016397405,0.0014109027,0.0033747053,0.0033203776,0.0024063943,0.010602424],"category_scores_gemma":[0.03054054,0.0008438303,0.0017088214,0.0022600053,0.0025268137,0.007183197,0.005273844,0.005606787,0.0025202853],"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.0012906777,0.00043243522,0.0020746381,0.00072353246,0.00014067785,0.00022773723,0.00057481136,0.20647147,0.009926606,0.32663283,0.0162037,0.43530086],"study_design_scores_gemma":[0.00015779886,0.00020022168,0.0002457818,0.000046275065,0.00004470345,0.00022059605,0.00009874321,0.45385745,0.0053587183,0.5374016,0.0023291702,0.000038980226],"about_ca_topic_score_codex":0.0012201332,"about_ca_topic_score_gemma":0.0017645378,"teacher_disagreement_score":0.010602424,"about_ca_system_score_codex":0.0018306734,"about_ca_system_score_gemma":0.0026953046,"threshold_uncertainty_score":0.035468638},"labels":[],"label_agreement":null},{"id":"W2099556803","doi":"10.1109/icip.1998.723469","title":"Arithmetic coding of a lossless contour based representation of label images","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Chain code; Lossless compression; Arithmetic coding; Computer science; Lossy compression; Artificial intelligence; Computer vision; Encoder; ENCODE; Coding (social sciences); Topology (electrical circuits); Data compression; Algorithm; Mathematics; Context-adaptive binary arithmetic coding; Image (mathematics)","score_opus":0.05366047059780225,"score_gpt":0.3014340498397006,"score_spread":0.24777357924189838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099556803","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.039281946,0.00027467046,0.9559822,0.00012819638,0.00008902111,0.000039198865,0.0001058327,0.0006641281,0.0034347007],"genre_scores_gemma":[0.3281077,0.00053170347,0.66374266,0.000121448524,0.00011388704,0.000108191554,0.00044355655,0.00017503907,0.006655776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998443,0.00002436666,0.000007984565,0.00001831068,0.00009016245,0.000014901719],"domain_scores_gemma":[0.9996111,0.0001123088,0.000052637428,0.00008517579,0.00012513214,0.000013682482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024783658,0.00041741208,0.00020633687,0.000631734,0.0002024365,0.00063843833,0.00060054264,0.00029307287,0.0020142358],"category_scores_gemma":[0.0009846695,0.0001118225,0.00016450544,0.00058090035,0.00036418103,0.0010694269,0.00039300998,0.0005105822,0.0005306643],"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.000598756,0.00008428161,0.00038308126,0.00019055058,0.00001778458,0.00024333423,0.00021130219,0.058754306,0.29943487,0.08027559,0.0035094894,0.5562967],"study_design_scores_gemma":[0.00005150933,0.00028900165,0.00044595278,0.000051794043,0.000036528094,0.00037293596,0.00004983636,0.70040876,0.2638715,0.014839269,0.019542452,0.00004035579],"about_ca_topic_score_codex":0.0004935302,"about_ca_topic_score_gemma":0.0006522966,"teacher_disagreement_score":0.0020142358,"about_ca_system_score_codex":0.00035368837,"about_ca_system_score_gemma":0.0002943439,"threshold_uncertainty_score":0.0067383647},"labels":[],"label_agreement":null},{"id":"W2102571797","doi":"10.1109/83.935035","title":"Breadth-first search and its application to image processing problems","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Pixel; Computer science; Traverse; Image processing; Graph traversal; Computer vision; Queue; Tree traversal; Artificial intelligence; Graph; Digital image processing; Process (computing); Image (mathematics); Algorithm; Theoretical computer science; Geography","score_opus":0.02204797197110572,"score_gpt":0.28922870188344285,"score_spread":0.26718072991233716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102571797","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.005910293,0.0035972313,0.98149604,0.0007581747,0.00008086063,0.000055425593,0.000045457695,0.00047124358,0.0075852405],"genre_scores_gemma":[0.15077764,0.00586698,0.83582944,0.00043607238,0.00026137172,0.00020081618,0.00017149186,0.0003298656,0.006126353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912566,0.00033184086,0.00004697612,0.00011691169,0.00030044437,0.000078153025],"domain_scores_gemma":[0.99747413,0.0021692077,0.00007144918,0.000081888145,0.00014698696,0.000056302106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426137,0.0009047877,0.0011297124,0.0020712386,0.0010816936,0.0014771811,0.0010675335,0.0013746795,0.005102127],"category_scores_gemma":[0.0066577145,0.0006786851,0.0009534608,0.0030688432,0.0017145592,0.002114904,0.0018608157,0.0016132924,0.0008491061],"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.00014622058,0.00008264702,0.0008038567,0.00079870166,0.00010945725,0.00033469268,0.0005610489,0.42047006,0.0031901593,0.3219202,0.007946327,0.2436367],"study_design_scores_gemma":[0.000036473677,0.000053167976,0.00016146823,0.00007501706,0.000022719405,0.00016831064,0.000061652936,0.6212115,0.0010023192,0.3636627,0.013521038,0.00002364094],"about_ca_topic_score_codex":0.0064519104,"about_ca_topic_score_gemma":0.0053700865,"teacher_disagreement_score":0.0064519104,"about_ca_system_score_codex":0.0012657655,"about_ca_system_score_gemma":0.0012160693,"threshold_uncertainty_score":0.017068326},"labels":[],"label_agreement":null},{"id":"W2107122249","doi":"10.1109/icip.2007.4379791","title":"Sequential, Irregular and Complex Object Contour Tracing on FPGA","year":2007,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Field-programmable gate array; Computer science; Tracing; Scalability; Computer hardware; Frame (networking); Reconfigurable computing; Hardware acceleration; Virtex; Embedded system; Frame rate; Artificial intelligence","score_opus":0.04147615841388244,"score_gpt":0.3026958550696936,"score_spread":0.26121969665581113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107122249","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.13668238,0.00026756732,0.85393757,0.000060959042,0.000036160676,0.000067585774,0.000058221092,0.002278697,0.0066108364],"genre_scores_gemma":[0.6075942,0.00027863975,0.3870153,0.000033303502,0.000012096381,0.000046509056,0.00010224135,0.00006680706,0.0048508192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992347,0.000009355258,0.0000042047336,0.000015696452,0.000038105856,0.000009188917],"domain_scores_gemma":[0.99988496,0.000042609736,0.000014110798,0.000025896617,0.000026041498,0.0000065259333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113894734,0.00020706689,0.00015842005,0.000261207,0.00013920998,0.00026026584,0.00043798672,0.00016381546,0.0018315389],"category_scores_gemma":[0.00029994446,0.00011375266,0.00011390777,0.00019807425,0.00014194904,0.00027676547,0.000102017635,0.00013159652,0.00025255175],"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.00052490557,0.000048853322,0.0017926004,0.00022002905,0.000031548003,0.00048121135,0.00017937418,0.11322913,0.27322376,0.0118609145,0.0020711878,0.59633636],"study_design_scores_gemma":[0.000073408795,0.00048122165,0.0030569267,0.00004010641,0.000035956295,0.0008251066,0.000050885064,0.81827706,0.15540716,0.0024378095,0.019286875,0.000027534492],"about_ca_topic_score_codex":0.0015270604,"about_ca_topic_score_gemma":0.0019342878,"teacher_disagreement_score":0.0018315389,"about_ca_system_score_codex":0.00021675187,"about_ca_system_score_gemma":0.00022989216,"threshold_uncertainty_score":0.0061270595},"labels":[],"label_agreement":null},{"id":"W2107749697","doi":"10.1142/s0218195911003627","title":"RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Mathematics; Regular polygon; Combinatorics; Polygon (computer graphics); Rectilinear polygon; Convex polygon; Star-shaped polygon; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Convex polytope; Polygon covering; Convex set; Geometry; Convex optimization; Computer science; Simple polygon; Artificial intelligence","score_opus":0.023415847383909623,"score_gpt":0.28165872347345394,"score_spread":0.2582428760895443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107749697","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.06078024,0.00018478087,0.9365366,0.00017096756,0.000021550895,0.00008039749,0.0003600212,0.00033224572,0.0015331033],"genre_scores_gemma":[0.23422313,0.00036563803,0.7617613,0.000057611625,0.000053522526,0.00023965661,0.0016114077,0.00018665846,0.0015010198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985563,0.00034565252,0.00008696995,0.000334435,0.0004905699,0.00018598462],"domain_scores_gemma":[0.9948192,0.0034561409,0.00053127843,0.00061555515,0.00039900836,0.000178784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105886,0.0014027095,0.0020025107,0.0015142477,0.0007738966,0.0017977613,0.0017191916,0.0013814567,0.0022120862],"category_scores_gemma":[0.00845592,0.0015971275,0.0015593078,0.0024897486,0.0016494556,0.0034195469,0.002293001,0.002552835,0.00062522537],"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.00045652955,0.00018416035,0.003625935,0.00035955242,0.00006746918,0.0004922107,0.00031791514,0.7541073,0.008641381,0.0440414,0.0033439295,0.18436225],"study_design_scores_gemma":[0.000024154613,0.000058688638,0.0005348624,0.000023653492,0.000012151473,0.00018046935,0.00013108317,0.94934857,0.0046784705,0.04380509,0.0011769444,0.00002578664],"about_ca_topic_score_codex":0.0036072037,"about_ca_topic_score_gemma":0.0038305945,"teacher_disagreement_score":0.0036072037,"about_ca_system_score_codex":0.0007645065,"about_ca_system_score_gemma":0.00087241124,"threshold_uncertainty_score":0.007400155},"labels":[],"label_agreement":null},{"id":"W2110541347","doi":"10.1109/cgiv.2007.32","title":"Curve reconstruction in the presence of noise","year":2007,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Planar; Computer science; Heuristic; Noise (video); Neighbourhood (mathematics); Sample (material); Graph; Algorithm; Curve fitting; Artificial intelligence; Mathematics; Theoretical computer science; Machine learning; Computer graphics (images); Mathematical analysis; Physics","score_opus":0.01914705256276001,"score_gpt":0.2798895862417474,"score_spread":0.2607425336789874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110541347","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.10716353,0.00027805928,0.8911235,0.00012691267,0.000028350034,0.000029382878,0.00003018778,0.00040284882,0.00081719307],"genre_scores_gemma":[0.4983388,0.0002729542,0.49989912,0.00005725394,0.000038995346,0.000023124654,0.00014672993,0.00012088498,0.0011021523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985631,0.000302572,0.000054302105,0.00026062774,0.00070627796,0.00011321741],"domain_scores_gemma":[0.9966106,0.001897059,0.0003181789,0.0006207165,0.00043490794,0.00011855691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019584864,0.0007319103,0.0015969952,0.0013207122,0.00063515827,0.0011147981,0.0013276252,0.001850883,0.0008613076],"category_scores_gemma":[0.00905262,0.00068627315,0.00053967454,0.00089634856,0.0017145127,0.0022488313,0.0011078665,0.0011413172,0.00037907492],"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.0013741894,0.00008886333,0.002976728,0.0002903423,0.0001338042,0.0009789063,0.00042201485,0.7129715,0.086917065,0.027182212,0.0006765977,0.16598779],"study_design_scores_gemma":[0.00002721012,0.00017506168,0.0005252474,0.000014285386,0.000019868678,0.00045176633,0.00006929086,0.95468587,0.036156658,0.00689445,0.00094623194,0.00003409729],"about_ca_topic_score_codex":0.0015655779,"about_ca_topic_score_gemma":0.0013694715,"teacher_disagreement_score":0.0019584864,"about_ca_system_score_codex":0.00061023195,"about_ca_system_score_gemma":0.00055571774,"threshold_uncertainty_score":0.010357618},"labels":[],"label_agreement":null},{"id":"W2119167889","doi":"10.1109/tip.2011.2107524","title":"Least-Squares Luma–Chroma Demultiplexing Algorithm for Bayer Demosaicking","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Toronto","funders":"","keywords":"Demosaicing; Algorithm; Computer science; Artificial intelligence; Image processing; Computer vision; Mathematics; Pattern recognition (psychology); Image (mathematics); Color image","score_opus":0.043292096699834505,"score_gpt":0.2804801042245686,"score_spread":0.2371880075247341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119167889","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.0031045908,0.00008405393,0.995739,0.000029892939,0.000014660684,0.000020365393,0.000026488322,0.00038775068,0.00059323816],"genre_scores_gemma":[0.028776957,0.00011497783,0.9695033,0.000030480942,0.000013089003,0.000036052148,0.00009323975,0.000058290218,0.0013735052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996989,0.00006135597,0.000015882346,0.000055701923,0.0001468708,0.000021393036],"domain_scores_gemma":[0.99935895,0.00019586844,0.0000555329,0.00012484791,0.00023943142,0.000025381305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082461763,0.00066475477,0.0005018043,0.00061476574,0.00039772215,0.0005759861,0.00061349466,0.0005975868,0.0029062955],"category_scores_gemma":[0.0017936681,0.0002755803,0.00036916864,0.00063245895,0.0003470757,0.00057974574,0.0005027106,0.0008466129,0.001453298],"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.00027902384,0.00008453163,0.0008792352,0.00022714058,0.00008157099,0.00008551387,0.00015810369,0.084172875,0.1735406,0.014291232,0.0038021863,0.7223979],"study_design_scores_gemma":[0.000028028537,0.00013280052,0.0012907878,0.000023480865,0.000041893916,0.00029513874,0.000045885092,0.8514584,0.12804864,0.004362978,0.014225029,0.000046936504],"about_ca_topic_score_codex":0.0013205475,"about_ca_topic_score_gemma":0.0030847082,"teacher_disagreement_score":0.0029062955,"about_ca_system_score_codex":0.00048348575,"about_ca_system_score_gemma":0.0008953256,"threshold_uncertainty_score":0.009722531},"labels":[],"label_agreement":null},{"id":"W2119841484","doi":"10.1109/pacrim.1991.160707","title":"Modelling and simulation of a range-finding device","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Range (aeronautics); Computer science; Artificial intelligence; Geometric modeling; Computer vision; Engineering; Mechanical engineering","score_opus":0.08112886116598933,"score_gpt":0.2959156612316137,"score_spread":0.2147868000656244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119841484","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.06888069,0.00037666372,0.878257,0.000617187,0.00017502873,0.00017061373,0.00042487224,0.0016892324,0.049408745],"genre_scores_gemma":[0.80215716,0.0008247644,0.1516808,0.00018859007,0.000061639264,0.00051225827,0.00048151638,0.0002470643,0.043846145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975353,0.000032828935,0.000011150995,0.000044511093,0.00012651512,0.000031394018],"domain_scores_gemma":[0.99979264,0.000074395255,0.00002033601,0.000037605016,0.000050529346,0.00002448228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020647248,0.0004444261,0.00064475427,0.00038973443,0.0005226987,0.0013191409,0.0015512864,0.0017156743,0.004391371],"category_scores_gemma":[0.00069907325,0.0003825584,0.00061333826,0.00037571267,0.00076664006,0.0012919232,0.000842768,0.000581257,0.0011654455],"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.00005302141,0.00002862359,0.00028336895,0.000051305786,0.000011465875,0.00022551308,0.00011512261,0.9631882,0.008167294,0.022198731,0.000714155,0.0049632117],"study_design_scores_gemma":[0.000011138184,0.000018399802,0.000059922593,0.0000057068683,0.000004677949,0.000046659887,0.00001437192,0.99344796,0.0016555442,0.0017742723,0.0029512802,0.0000100336765],"about_ca_topic_score_codex":0.004623666,"about_ca_topic_score_gemma":0.0013597653,"teacher_disagreement_score":0.004623666,"about_ca_system_score_codex":0.00088293815,"about_ca_system_score_gemma":0.0008677772,"threshold_uncertainty_score":0.014690578},"labels":[],"label_agreement":null},{"id":"W2120324771","doi":"10.1016/j.tcs.2011.04.019","title":"A linear time and space algorithm for detecting path intersection in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Intersection (aeronautics); Initialization; Algorithm; Path (computing); Dimension (graph theory); Mathematics; Linear space; Data structure; Time complexity; Computer science; Discrete mathematics; Combinatorics","score_opus":0.017869333412496385,"score_gpt":0.24595248615093426,"score_spread":0.22808315273843788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120324771","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.008390922,0.00048406902,0.9714149,0.00049047335,0.00016454216,0.0003271856,0.00081413315,0.012667794,0.0052460297],"genre_scores_gemma":[0.045425624,0.00022982362,0.9443609,0.00012331665,0.00006954546,0.0003737082,0.0026526859,0.0005542847,0.0062101544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752825,0.00034434054,0.00022038833,0.0007164224,0.0009158744,0.00027472325],"domain_scores_gemma":[0.9967435,0.0017600949,0.00023469877,0.00055382104,0.0005233071,0.00018467083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451856,0.002438256,0.0016275917,0.004410553,0.0019770025,0.0037590743,0.003543975,0.002177872,0.030905722],"category_scores_gemma":[0.006975184,0.0008403711,0.0016921728,0.004383046,0.0013311349,0.004295948,0.0030432988,0.0024459043,0.009595045],"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.00077343854,0.0004410012,0.0013770753,0.00058287627,0.00014977627,0.00020018323,0.0002907709,0.037662964,0.013225868,0.024733422,0.04447063,0.876092],"study_design_scores_gemma":[0.0005495506,0.0005808696,0.0019509689,0.000121111276,0.00016942005,0.0009580388,0.0006823498,0.8407074,0.030622939,0.08581724,0.03767016,0.00016996216],"about_ca_topic_score_codex":0.014968536,"about_ca_topic_score_gemma":0.02449514,"teacher_disagreement_score":0.030905722,"about_ca_system_score_codex":0.00219721,"about_ca_system_score_gemma":0.004750612,"threshold_uncertainty_score":0.10338992},"labels":[],"label_agreement":null},{"id":"W2123382753","doi":"10.1109/das.2012.51","title":"Linear Compression of Digital Ink via Point Selection","year":2012,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Compression ratio; Compression (physics); Computer science; Data compression; Algorithm; Piecewise linear function; Point (geometry); Data compression ratio; Inkwell; Linear approximation; Piecewise; Selection (genetic algorithm); Mathematics; Artificial intelligence; Image compression; Nonlinear system; Speech recognition; Image processing; Materials science; Mathematical analysis; Engineering; Geometry","score_opus":0.01769240014586346,"score_gpt":0.27269529860354086,"score_spread":0.2550028984576774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123382753","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.082552925,0.000534421,0.9111067,0.000104655606,0.00010032959,0.000044027693,0.0000745902,0.0016450317,0.0038372318],"genre_scores_gemma":[0.58579695,0.0006934399,0.40347552,0.00007861894,0.00008492777,0.0000684029,0.0001896934,0.00017763577,0.00943476],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978703,0.00002374335,0.000011446002,0.000028728251,0.00013092063,0.000018215702],"domain_scores_gemma":[0.99964964,0.00013493896,0.00003349345,0.00008307531,0.000083312145,0.000015609985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015162605,0.00030923184,0.00030056934,0.00053791795,0.00020827653,0.000412474,0.0005002114,0.00027715098,0.0027001603],"category_scores_gemma":[0.00087664096,0.00013804557,0.00021111139,0.00073799735,0.0003392038,0.00053033687,0.00041606807,0.0003598946,0.0008259605],"study_design_candidate":"bench_or_experimental","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.00040668034,0.000053826083,0.0007002569,0.00020561539,0.000026787327,0.00031773825,0.00015591858,0.050139338,0.24443063,0.0061236513,0.0019793771,0.69546026],"study_design_scores_gemma":[0.000028597582,0.00027871242,0.0012115204,0.000020815207,0.000026648455,0.0006910387,0.000050566312,0.66874725,0.31741202,0.0026753803,0.008824213,0.00003312136],"about_ca_topic_score_codex":0.0005918477,"about_ca_topic_score_gemma":0.0006537336,"teacher_disagreement_score":0.0027001603,"about_ca_system_score_codex":0.00016286602,"about_ca_system_score_gemma":0.00016706756,"threshold_uncertainty_score":0.009032905},"labels":[],"label_agreement":null},{"id":"W2124130976","doi":"10.1109/icassp.1988.196747","title":"Morphological skeleton representation and shape recognition","year":2003,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Topological skeleton; Pattern recognition (psychology); Representation (politics); Skeleton (computer programming); Artificial intelligence; Computer science; Shape analysis (program analysis); Matching (statistics); Medial axis; Feature extraction; Similarity (geometry); Feature (linguistics); Distance transform; Set (abstract data type); Computer vision; Mathematics; Image (mathematics); Active shape model; Segmentation","score_opus":0.0506781376865385,"score_gpt":0.29408150726045157,"score_spread":0.24340336957391306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124130976","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.002677468,0.0005758542,0.9884183,0.00015114412,0.00006305169,0.00004273017,0.00012936897,0.0013506584,0.0065914025],"genre_scores_gemma":[0.08825972,0.0016407978,0.8940279,0.00016859856,0.0002251915,0.000113184804,0.0011983105,0.00040491932,0.0139614055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915874,0.0001259893,0.00008201785,0.00023431897,0.00034197286,0.000056941306],"domain_scores_gemma":[0.99938893,0.0001224396,0.00009475332,0.00018119198,0.0001807036,0.00003201979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063247344,0.0006522373,0.0007421358,0.0032284767,0.00048606866,0.0025667227,0.0011775437,0.0012824654,0.010628155],"category_scores_gemma":[0.0021875591,0.0004040264,0.0010435927,0.0030068834,0.0015659132,0.0028453062,0.0013295183,0.00089908706,0.0065023317],"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.00009014507,0.000035734913,0.00035339833,0.00036321845,0.000040797164,0.00038898704,0.00019348305,0.026698928,0.05709976,0.3318838,0.009299784,0.57355195],"study_design_scores_gemma":[0.000032838536,0.00010932732,0.001720783,0.00012647465,0.00004770494,0.0023695915,0.00015656803,0.49837932,0.05840573,0.30796173,0.13058652,0.00010339615],"about_ca_topic_score_codex":0.000823312,"about_ca_topic_score_gemma":0.0007597936,"teacher_disagreement_score":0.010628155,"about_ca_system_score_codex":0.0005596952,"about_ca_system_score_gemma":0.00054005923,"threshold_uncertainty_score":0.035554767},"labels":[],"label_agreement":null},{"id":"W2124356944","doi":"10.1016/j.tcs.2005.08.019","title":"The discrete Green Theorem and some applications in discrete geometry","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Direction Générale de la Compétitivité, de l’Industrie et des Services","keywords":"Mathematics; Intersection (aeronautics); Polyomino; Boundary (topology); Discrete geometry; Moment (physics); Geometry; Generating function; Green's theorem; Center (category theory); Function (biology); Bounded function; Discrete mathematics; Combinatorics; Fundamental theorem; Mathematical analysis","score_opus":0.007065804377029443,"score_gpt":0.2646758480864806,"score_spread":0.2576100437094512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124356944","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.062820785,0.068591855,0.711337,0.02878171,0.0041454933,0.0000605669,0.00040186045,0.00032399717,0.123536624],"genre_scores_gemma":[0.6839069,0.05177031,0.20219633,0.0059755696,0.012367665,0.00021299762,0.00046522822,0.00041166187,0.042693425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994543,0.00023394435,0.00003109931,0.00008696651,0.00014442917,0.000049323076],"domain_scores_gemma":[0.99825305,0.0012308857,0.00011546235,0.00010945307,0.00015237283,0.0001388187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018654526,0.0011781781,0.0016845969,0.0032717895,0.001446777,0.0030459114,0.0012029851,0.0021046964,0.0040335697],"category_scores_gemma":[0.0041473797,0.0005539678,0.0014709731,0.0033710427,0.0070306486,0.004854007,0.0022335132,0.0061411383,0.0006380812],"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.000008086353,0.0000086293785,0.00005243783,0.000036527086,0.0000074456048,0.000033296503,0.000044617,0.0008058384,0.00020309545,0.99372125,0.0010259385,0.0040529436],"study_design_scores_gemma":[0.0000066904777,0.000005962853,0.000060012848,0.0000086591035,0.0000027794074,0.00003532983,0.000016864655,0.0029929332,0.00005468126,0.9936812,0.0031289367,0.000005978763],"about_ca_topic_score_codex":0.0013283392,"about_ca_topic_score_gemma":0.0009494206,"teacher_disagreement_score":0.0040335697,"about_ca_system_score_codex":0.0018966086,"about_ca_system_score_gemma":0.0005889177,"threshold_uncertainty_score":0.013760924},"labels":[],"label_agreement":null},{"id":"W2124993762","doi":"10.1016/j.endm.2005.05.085","title":"Discrete Tomography in Discrete Deconvolution: Deconvolution of Binary Images Using Ryser's Algorithm","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Deconvolution; Algorithm; Blind deconvolution; Thresholding; Binary number; Mathematics; Viterbi algorithm; Wiener filter; Wiener deconvolution; Polynomial; Equalization (audio); Artificial intelligence; Image (mathematics); Computer science; Decoding methods; Arithmetic","score_opus":0.012342428220268419,"score_gpt":0.28389115264451953,"score_spread":0.2715487244242511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124993762","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.0030702418,0.00014694026,0.9953217,0.00007896253,0.000024427158,0.000013629696,0.000011774097,0.00010598831,0.0012264358],"genre_scores_gemma":[0.09649636,0.00074646453,0.89779943,0.00009122385,0.0000616896,0.00006575121,0.000059482663,0.00013156292,0.0045479573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942434,0.0002543641,0.000029513154,0.00009136365,0.00016852365,0.00003198418],"domain_scores_gemma":[0.99908316,0.0005168837,0.00006429786,0.00018766189,0.00011465166,0.000033315897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016359113,0.00067948765,0.000910262,0.00074620673,0.000353584,0.0015381785,0.0010698192,0.0013262717,0.002479494],"category_scores_gemma":[0.0035736521,0.000476796,0.00064713333,0.0010214935,0.0015023499,0.002638494,0.0016530078,0.0021800615,0.00094296184],"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.0003411813,0.00008560108,0.00038621586,0.00043719192,0.0000739289,0.0001716366,0.00031033586,0.11055205,0.028840704,0.6279809,0.0028235873,0.2279968],"study_design_scores_gemma":[0.000034268534,0.000041271225,0.00015051936,0.000022352935,0.00002081217,0.0002137476,0.000036527264,0.8664201,0.015321645,0.113600776,0.004100906,0.000037102058],"about_ca_topic_score_codex":0.0006595574,"about_ca_topic_score_gemma":0.0005267338,"teacher_disagreement_score":0.002479494,"about_ca_system_score_codex":0.00042215802,"about_ca_system_score_gemma":0.00067131495,"threshold_uncertainty_score":0.008651614},"labels":[],"label_agreement":null},{"id":"W2127682860","doi":"10.1109/ccece.1993.332256","title":"A fast distance approximation algorithm for encoded quadtree locations","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Euclidean distance; Function (biology); Integer (computer science); Approximation error; Algorithm; Computer science; Plane (geometry); Euclidean space; Domain (mathematical analysis); Euclidean geometry; Approximation algorithm; Distance transform; Quadtree; Distance measures; Mathematics; Distance measurement; Combinatorics; Discrete mathematics; Artificial intelligence; Mathematical analysis; Image (mathematics); Geometry","score_opus":0.025931789811754098,"score_gpt":0.25845236751403156,"score_spread":0.23252057770227746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127682860","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.0017243274,0.00021689195,0.9965767,0.00002708184,0.00004073573,0.000026647383,0.00004487593,0.0007153231,0.0006273685],"genre_scores_gemma":[0.024457749,0.00026762727,0.9725672,0.000026394473,0.000023228398,0.000085199485,0.00029520533,0.00013126594,0.0021461146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994605,0.00007079642,0.00004151877,0.00008653057,0.00029988887,0.000040811163],"domain_scores_gemma":[0.9992588,0.00016427231,0.00005202554,0.00014816727,0.00035005112,0.000026549427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046066561,0.0008168887,0.0008583025,0.0012341253,0.00060656865,0.0012300964,0.0014836186,0.000848554,0.005484482],"category_scores_gemma":[0.0024542382,0.00042644097,0.0005825923,0.0018138015,0.0003495727,0.0019324356,0.0012747154,0.0010547347,0.0031159087],"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.000120849734,0.000044779183,0.00026359432,0.00020591295,0.000034259305,0.000102510836,0.00013692542,0.0786841,0.021838283,0.036673184,0.0077297525,0.8541659],"study_design_scores_gemma":[0.00004744144,0.00011662376,0.00027256203,0.000049685023,0.000025241125,0.00045360235,0.00007087208,0.92282444,0.024329871,0.020752525,0.031010596,0.000046559435],"about_ca_topic_score_codex":0.0029861478,"about_ca_topic_score_gemma":0.003012876,"teacher_disagreement_score":0.005484482,"about_ca_system_score_codex":0.0008042116,"about_ca_system_score_gemma":0.0010023386,"threshold_uncertainty_score":0.018347442},"labels":[],"label_agreement":null},{"id":"W2128936061","doi":"10.1109/icpr.1992.202081","title":"An optimal algorithm for detecting straight lines in chain codes","year":2003,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Task (project management); Computer science; Pixel; Algorithm; Chain (unit); SIMPLE algorithm; Artificial intelligence; Engineering","score_opus":0.02199845669990743,"score_gpt":0.29967623618217737,"score_spread":0.27767777948226996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128936061","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.002872809,0.00008716136,0.99466926,0.00003613625,0.00002737553,0.00004562186,0.000054781536,0.0009204244,0.0012864623],"genre_scores_gemma":[0.029250627,0.000111956055,0.96795154,0.000039037746,0.000023627514,0.00011669265,0.00028669223,0.00019301777,0.0020267018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987023,0.00017068458,0.0001013155,0.00030423087,0.0005665175,0.0001549683],"domain_scores_gemma":[0.9984635,0.0004879426,0.000120069075,0.0002874811,0.00056645664,0.000074547104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065594073,0.0010293253,0.0008130779,0.0024493772,0.0009925172,0.0014634005,0.0012425061,0.00114949,0.009349392],"category_scores_gemma":[0.004015727,0.0007003366,0.0007463657,0.0019241093,0.0010805941,0.0023172616,0.0014631603,0.0013438432,0.0038250377],"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.00025181862,0.00013844471,0.0010865174,0.0002367226,0.00004057075,0.00015640755,0.00016151456,0.051982604,0.03484173,0.05624063,0.011068856,0.8437942],"study_design_scores_gemma":[0.00013591899,0.00023900002,0.00094511104,0.000094341034,0.000055098903,0.00087978714,0.0001793573,0.779079,0.046659563,0.13967201,0.031949818,0.000111017886],"about_ca_topic_score_codex":0.0030964673,"about_ca_topic_score_gemma":0.0037361106,"teacher_disagreement_score":0.009349392,"about_ca_system_score_codex":0.0008471326,"about_ca_system_score_gemma":0.0017679024,"threshold_uncertainty_score":0.03127688},"labels":[],"label_agreement":null},{"id":"W2133276644","doi":"10.1007/s00357-008-9016-6","title":"The Metric Cutpoint Partition Problem","year":2008,"lang":"en","type":"article","venue":"Journal of Classification","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Partition (number theory); Linear subspace; Realization (probability); Discrete mathematics; Graph; Metric (unit); Metric space; Statistics; Geometry","score_opus":0.04848917196264458,"score_gpt":0.2817536667559093,"score_spread":0.23326449479326472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133276644","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.07263685,0.0033087716,0.908535,0.0026390296,0.00023980119,0.0002029311,0.0010950837,0.000446252,0.010896301],"genre_scores_gemma":[0.53359187,0.0033128024,0.4368418,0.00079722964,0.00091238663,0.0006278605,0.005113154,0.000560881,0.018242035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830866,0.0005187082,0.00008461423,0.00047093944,0.00048639544,0.00013065425],"domain_scores_gemma":[0.99661404,0.002181519,0.0002577551,0.00040844778,0.00030788287,0.00023035293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001765241,0.0011075552,0.002576815,0.0018504305,0.0012706545,0.0032765064,0.00274924,0.00369659,0.008422522],"category_scores_gemma":[0.010548986,0.0008081875,0.00094584515,0.0027595416,0.0021522618,0.005361264,0.0032244285,0.0030192365,0.001037732],"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.0005799057,0.0002583948,0.0019655437,0.00079643104,0.00023037246,0.00032917105,0.00038199095,0.14970228,0.0042882715,0.4680984,0.041960694,0.3314085],"study_design_scores_gemma":[0.00011608158,0.00013717412,0.0009507761,0.00008436309,0.000054972123,0.0003727798,0.0001534327,0.29983267,0.0016179911,0.68101597,0.015628736,0.00003502942],"about_ca_topic_score_codex":0.0015201863,"about_ca_topic_score_gemma":0.0011563457,"teacher_disagreement_score":0.008422522,"about_ca_system_score_codex":0.0011340021,"about_ca_system_score_gemma":0.0010006707,"threshold_uncertainty_score":0.028176129},"labels":[],"label_agreement":null},{"id":"W2133546939","doi":"10.1016/j.patcog.2008.11.010","title":"Lyndon Christoffel digitally convex","year":2008,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Digital geometry; Christoffel symbols; Convexity; Convex hull; Euclidean geometry; Computational geometry; Computation; Mathematics; Polyomino; Regular polygon; Discrete geometry; Algorithm; Combinatorics; Computer science; Artificial intelligence; Digital image; Image processing; Geometry; Image (mathematics)","score_opus":0.0438764992275604,"score_gpt":0.23549150183402148,"score_spread":0.19161500260646108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133546939","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.009679507,0.018457482,0.22887656,0.018029906,0.011607868,0.00006789153,0.0010414841,0.000952364,0.71128696],"genre_scores_gemma":[0.17851925,0.03385028,0.0792478,0.0030227038,0.004999142,0.00021952868,0.000916412,0.0013755432,0.69784945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931073,0.00007397561,0.000034717665,0.00018212454,0.00032913766,0.00006940629],"domain_scores_gemma":[0.99923325,0.00021603305,0.000047424674,0.00011767534,0.0002963299,0.00008927032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067045976,0.0010051779,0.0008066303,0.0014841286,0.0009791576,0.0020514491,0.0007509478,0.000999098,0.048000444],"category_scores_gemma":[0.0034416167,0.00032374624,0.0005159636,0.0016324982,0.0016533894,0.0027449527,0.002452685,0.003126346,0.018104544],"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.000058777696,0.000012187661,0.00007138679,0.00012294378,0.00000982066,0.00009586722,0.00004606116,0.0019671416,0.00091691344,0.81777805,0.066367395,0.11255348],"study_design_scores_gemma":[0.000029321598,0.000031337684,0.0001701919,0.00012657445,0.00001628546,0.00042347898,0.00004211147,0.009041082,0.0030294578,0.4724457,0.51460236,0.00004224272],"about_ca_topic_score_codex":0.0023477997,"about_ca_topic_score_gemma":0.001534403,"teacher_disagreement_score":0.048000444,"about_ca_system_score_codex":0.0016900379,"about_ca_system_score_gemma":0.0012437446,"threshold_uncertainty_score":0.16057754},"labels":[],"label_agreement":null},{"id":"W2138255982","doi":"10.1007/3-540-36151-0_39","title":"Camera Position Reconstruction and Tight Direction Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Computer science; Implementation; Dimension (graph theory); Graph; Simple (philosophy); Position (finance); Computer vision; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.010457293919729644,"score_gpt":0.22156271338722167,"score_spread":0.21110541946749203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138255982","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.0022285858,0.00017860738,0.9962649,0.000044840035,0.000017674696,0.000008904881,0.00003244042,0.00018939529,0.0010347684],"genre_scores_gemma":[0.16142574,0.001351624,0.8250097,0.00012380513,0.0001193378,0.00007681432,0.0005800017,0.00030437278,0.011008664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921346,0.00022641996,0.000033710407,0.00022587948,0.00022414241,0.00007632589],"domain_scores_gemma":[0.99905413,0.00040841027,0.00010512317,0.0002530152,0.0001415942,0.000037721038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086175173,0.001277635,0.0011931065,0.0011379258,0.00049926585,0.0014557962,0.0014416277,0.0013731178,0.0037306657],"category_scores_gemma":[0.004336982,0.001249867,0.00072188466,0.0017072464,0.0009185685,0.0033773766,0.0021032149,0.0019219302,0.0011640599],"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.00033099364,0.00006518578,0.00075055857,0.000155264,0.00009675321,0.00012180711,0.0001280853,0.42785868,0.011214288,0.101534866,0.005098928,0.4526446],"study_design_scores_gemma":[0.000012944899,0.000026007403,0.00021514179,0.000015430582,0.000014387712,0.0001267232,0.000023129389,0.9410519,0.0036979208,0.051887285,0.0029122552,0.00001690047],"about_ca_topic_score_codex":0.005758698,"about_ca_topic_score_gemma":0.0054151993,"teacher_disagreement_score":0.005758698,"about_ca_system_score_codex":0.0007520012,"about_ca_system_score_gemma":0.0006118235,"threshold_uncertainty_score":0.012480259},"labels":[],"label_agreement":null},{"id":"W2140768515","doi":"10.1109/ccece.2006.277656","title":"Segmentation of Dental Radiographs Using a Swarm Intelligence Approach","year":2006,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Swarm behaviour; Swarm intelligence; Computer science; Pixel; Artificial intelligence; Image segmentation; Cellular automaton; Segmentation; Computer vision; Segmentation-based object categorization; Scale-space segmentation; Context (archaeology); Pattern recognition (psychology); Algorithm; Particle swarm optimization; Geography","score_opus":0.02158412298409306,"score_gpt":0.27161507501993654,"score_spread":0.25003095203584347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140768515","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.01813467,0.0003091501,0.9795446,0.00011617222,0.000029386862,0.00005144812,0.000015440073,0.00041245,0.0013867643],"genre_scores_gemma":[0.23505177,0.00046519036,0.7622992,0.00006203112,0.00003542789,0.00009650387,0.000071884104,0.00006623866,0.0018516757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974376,0.000054162825,0.00002189213,0.000058070782,0.00010281465,0.000019172809],"domain_scores_gemma":[0.9997235,0.00013026893,0.000041501113,0.000030665065,0.000060614257,0.000013427849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003963505,0.0006055988,0.0007205877,0.0012227974,0.0004277821,0.00088580867,0.0004922952,0.00073935237,0.00075479475],"category_scores_gemma":[0.00087965355,0.00041198474,0.00073807465,0.0005044434,0.0005385045,0.0007531587,0.0003935885,0.00038121597,0.00028012923],"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.00015438812,0.00010298688,0.002295474,0.00027743628,0.00013562749,0.00039175656,0.00052253343,0.45013016,0.13071589,0.012193891,0.0015213856,0.40155846],"study_design_scores_gemma":[0.00001392159,0.00005423969,0.0007296368,0.00001545399,0.00003003475,0.00013800802,0.000068395195,0.9786516,0.012676859,0.004366717,0.0032360612,0.000019024075],"about_ca_topic_score_codex":0.002689337,"about_ca_topic_score_gemma":0.002556953,"teacher_disagreement_score":0.002689337,"about_ca_system_score_codex":0.0005436502,"about_ca_system_score_gemma":0.00047016333,"threshold_uncertainty_score":0.0053474307},"labels":[],"label_agreement":null},{"id":"W2144402595","doi":"10.1109/icassp.1989.266774","title":"Pseudo-Euclidean morphological skeleton transform for machine vision","year":2003,"lang":"en","type":"article","venue":"International Conference on Acoustics, Speech, and Signal Processing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Euclidean geometry; Invariant (physics); Euclidean distance; Skeleton (computer programming); Artificial intelligence; Dilation (metric space); Rotation (mathematics); Euclidean group; Mathematics; Structuring; Computer vision; Algorithm; Computer science; Pattern recognition (psychology); Pure mathematics; Combinatorics; Geometry","score_opus":0.035045923071815685,"score_gpt":0.3151139292849893,"score_spread":0.2800680062131736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144402595","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.0011508559,0.0010037967,0.9948632,0.00016715727,0.00012984297,0.000015560003,0.00005788547,0.0005849898,0.002026689],"genre_scores_gemma":[0.036915813,0.0024788491,0.9531945,0.00015570542,0.0002550515,0.000076809294,0.00048697196,0.00017712994,0.0062592127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995216,0.00009682826,0.000041484418,0.000086904874,0.00023319157,0.000020066429],"domain_scores_gemma":[0.99960536,0.000086647575,0.00004739648,0.00009483388,0.00015182112,0.000013987784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053132756,0.0006720524,0.00050141657,0.0012774805,0.00022357854,0.001049857,0.0007756356,0.0009920596,0.005099741],"category_scores_gemma":[0.0014488099,0.00027983988,0.0005955299,0.0021246306,0.0006318854,0.0016179294,0.000584612,0.0008274032,0.0033219117],"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.000056101115,0.000028097556,0.00019292715,0.0003574961,0.000063941116,0.00018747567,0.000064711676,0.032490928,0.032924976,0.15074332,0.012930585,0.7699595],"study_design_scores_gemma":[0.000024955372,0.00012111771,0.0008305533,0.00007064094,0.00003881413,0.0009699684,0.000033841436,0.6933597,0.03071034,0.13659625,0.13718158,0.00006225794],"about_ca_topic_score_codex":0.00056447857,"about_ca_topic_score_gemma":0.00067986397,"teacher_disagreement_score":0.005099741,"about_ca_system_score_codex":0.0004218575,"about_ca_system_score_gemma":0.00044753807,"threshold_uncertainty_score":0.01706034},"labels":[],"label_agreement":null},{"id":"W2148709549","doi":"10.1109/icdar.1993.395735","title":"Validation of preprocessing algorithms: A methodology and its application to the design of a thinning algorithm for handwritten characters","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Polytechnique Montréal","funders":"Government of Canada","keywords":"Algorithm; Computer science; Thinning; Preprocessor; Artificial intelligence; Algorithm design; Character (mathematics); Machine learning; Data mining; Mathematics","score_opus":0.10621029547885223,"score_gpt":0.3295756502443712,"score_spread":0.22336535476551894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148709549","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.007046821,0.000058406997,0.99061126,0.00003384796,0.000032690696,0.0008043579,0.000051815652,0.0008709641,0.0004897905],"genre_scores_gemma":[0.022873785,0.0000700573,0.975041,0.000024222403,0.000008689755,0.0013201885,0.00008717374,0.00011937623,0.0004555643],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99342996,0.0026608196,0.00079297717,0.00078498793,0.0021866465,0.0001446204],"domain_scores_gemma":[0.9781457,0.009567205,0.002372945,0.0035340728,0.0061288476,0.00025129397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012018868,0.0015541065,0.0007951826,0.0018347428,0.0010268806,0.0017360474,0.0020208403,0.0015588165,0.003952774],"category_scores_gemma":[0.030855143,0.00062003837,0.0007344122,0.0017204612,0.00128815,0.0014309352,0.0012624941,0.0010938664,0.0013649124],"study_design_candidate":"bench_or_experimental","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.00046002166,0.00068078015,0.0030775093,0.0011387784,0.00019303676,0.00022756787,0.0008878631,0.033122096,0.13693461,0.013353379,0.0029295017,0.8069949],"study_design_scores_gemma":[0.00035716742,0.0051150573,0.008983004,0.00052051473,0.0002670569,0.0019747554,0.000649942,0.38306418,0.54156345,0.016700093,0.04049857,0.00030617786],"about_ca_topic_score_codex":0.00095343776,"about_ca_topic_score_gemma":0.00092072587,"teacher_disagreement_score":0.012018868,"about_ca_system_score_codex":0.00075640937,"about_ca_system_score_gemma":0.0017648174,"threshold_uncertainty_score":0.06356263},"labels":[],"label_agreement":null},{"id":"W2152694539","doi":"10.1145/1936652.1936666","title":"Seeing through the fog","year":2010,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Usability; Reduction (mathematics); Noise reduction; Noise (video); Cost reduction; Artificial intelligence; Human–computer interaction; Computer vision; Multimedia; Image (mathematics); Mathematics","score_opus":0.013564756719134789,"score_gpt":0.27150895479286397,"score_spread":0.2579441980737292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152694539","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.19437528,0.009910111,0.26409408,0.011730171,0.004372955,0.00035069603,0.0022075356,0.008888808,0.50407034],"genre_scores_gemma":[0.8126288,0.0069789304,0.09807767,0.005832322,0.00082241587,0.00011407038,0.0011593073,0.0012130224,0.073173426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996877,0.000029494733,0.0000075156245,0.0000936556,0.000100119876,0.000081602935],"domain_scores_gemma":[0.99957603,0.000097946286,0.000027516375,0.000105313185,0.00010519965,0.000087997316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021654509,0.0006100016,0.00050845835,0.00053806097,0.0018722205,0.0032085793,0.0007362963,0.001141259,0.016220782],"category_scores_gemma":[0.0013424348,0.0004022643,0.0005347627,0.00050854054,0.0012287326,0.0032979115,0.0022655192,0.0013098713,0.0048433384],"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.0007833485,0.00018866784,0.011110059,0.00078437035,0.00020948274,0.0022305967,0.0055344547,0.010777159,0.12562989,0.07898813,0.21419714,0.5495666],"study_design_scores_gemma":[0.00011147137,0.0004329743,0.022665333,0.00044581617,0.00021708041,0.0031363978,0.005522024,0.050863385,0.037803028,0.1079388,0.77059567,0.00026806362],"about_ca_topic_score_codex":0.01146724,"about_ca_topic_score_gemma":0.01292228,"teacher_disagreement_score":0.016220782,"about_ca_system_score_codex":0.00072247616,"about_ca_system_score_gemma":0.0010903692,"threshold_uncertainty_score":0.05426389},"labels":[],"label_agreement":null},{"id":"W2153952576","doi":"10.1109/icpr.2002.1047976","title":"Shape representation using concavity graphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Representation (politics); Political science","score_opus":0.05841028313042421,"score_gpt":0.32950157046465245,"score_spread":0.2710912873342282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153952576","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.0074423556,0.00016194649,0.9886035,0.00014558979,0.000029534556,0.0000416419,0.00039444695,0.0012811705,0.0018998106],"genre_scores_gemma":[0.17111224,0.0006358471,0.8215862,0.00024684172,0.000062918916,0.00018407824,0.0024212992,0.000552207,0.00319837],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930775,0.00012700741,0.00005856312,0.00017706385,0.00028475522,0.000044906697],"domain_scores_gemma":[0.99862516,0.00038649948,0.0001792357,0.0004141264,0.0003301305,0.000064890606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043326008,0.0006387402,0.0006541683,0.0033706292,0.0006793934,0.001972072,0.0014382025,0.00081406755,0.0031377487],"category_scores_gemma":[0.0030696047,0.0005348705,0.0009172453,0.0030363004,0.0010072135,0.0035997066,0.0016396662,0.0011086996,0.0016078377],"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.00035692393,0.000088477114,0.0027497082,0.00041172546,0.000092649585,0.00035546525,0.0007088609,0.11311971,0.030350687,0.26436415,0.013996029,0.5734056],"study_design_scores_gemma":[0.000026825079,0.00009275173,0.0011862318,0.000080628386,0.00004938538,0.00063305895,0.00018231157,0.7664732,0.01731538,0.16249657,0.05135471,0.00010897925],"about_ca_topic_score_codex":0.0048499918,"about_ca_topic_score_gemma":0.0051148795,"teacher_disagreement_score":0.0048499918,"about_ca_system_score_codex":0.0008566962,"about_ca_system_score_gemma":0.0007070128,"threshold_uncertainty_score":0.010496795},"labels":[],"label_agreement":null},{"id":"W2154672925","doi":"10.1016/j.patrec.2006.09.004","title":"A note on ‘A fully parallel 3D thinning algorithm and its applications’","year":2006,"lang":"en","type":"article","venue":"Pattern Recognition Letters","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Thinning; Computer science; Algorithm; Parallel algorithm; Layer (electronics); Binary number; Image (mathematics); Template; Parallel computing; Artificial intelligence; Mathematics; Arithmetic","score_opus":0.01708169486323152,"score_gpt":0.24886865649796883,"score_spread":0.2317869616347373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154672925","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002116856,0.015956065,0.87336445,0.015186245,0.06433361,0.00015304226,0.00041564202,0.0028412566,0.025632806],"genre_scores_gemma":[0.019054914,0.012682008,0.86007524,0.008600792,0.022437042,0.00020994323,0.0008337982,0.0018863044,0.07421996],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859554,0.00022956492,0.00016913193,0.00020763408,0.00071012985,0.00008800747],"domain_scores_gemma":[0.99744874,0.0007496519,0.000093038594,0.0005541077,0.0010538909,0.00010063411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016403814,0.0012858387,0.0009135176,0.0011157884,0.0012376014,0.0019384366,0.0029384117,0.0027997566,0.013168138],"category_scores_gemma":[0.0052825413,0.00087959075,0.0012301515,0.0017479779,0.0015770625,0.0034928718,0.0014451679,0.004112186,0.008897253],"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.0002998367,0.00006438695,0.00029318422,0.00071696367,0.000106753585,0.00079013145,0.00015388842,0.007927113,0.025449716,0.083823204,0.47278205,0.4075928],"study_design_scores_gemma":[0.000023642833,0.000081428385,0.00064873975,0.00009973769,0.00004111121,0.001267372,0.000029825498,0.02043747,0.019314919,0.049056944,0.9088743,0.00012452419],"about_ca_topic_score_codex":0.0018631011,"about_ca_topic_score_gemma":0.0035369887,"teacher_disagreement_score":0.013168138,"about_ca_system_score_codex":0.00059216144,"about_ca_system_score_gemma":0.0009179386,"threshold_uncertainty_score":0.044051766},"labels":[],"label_agreement":null},{"id":"W2161953739","doi":"10.1109/icdar.1993.395730","title":"Evaluation of thinning algorithms from an OCR viewpoint","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Algorithm; Thinning; Social connectedness; Perspective (graphical); Artificial intelligence; Range (aeronautics); Character (mathematics); Noise (video); Process (computing); Parallel algorithm; Machine learning; Mathematics; Image (mathematics); Programming language; Engineering","score_opus":0.10535394486446743,"score_gpt":0.34249695037391864,"score_spread":0.23714300550945122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161953739","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5490973,0.0054145283,0.4224733,0.0003247368,0.00046787527,0.000878398,0.0008018888,0.0085568465,0.011985165],"genre_scores_gemma":[0.43666318,0.0019280305,0.5535706,0.000113452355,0.00011427229,0.00020196474,0.002173242,0.0008322736,0.0044030272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961468,0.0006842241,0.0006012559,0.0006920051,0.0016580861,0.00021766267],"domain_scores_gemma":[0.9870433,0.005906477,0.00091437914,0.0015181723,0.004381454,0.00023619588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003929154,0.0019630513,0.0013499896,0.0029674638,0.0008383448,0.0015536612,0.0012149313,0.0013709965,0.0036821472],"category_scores_gemma":[0.015706953,0.000591597,0.0008274099,0.0023898624,0.00053295906,0.0017114508,0.0009256639,0.0006812672,0.0011955935],"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.0013710813,0.00047549908,0.003417117,0.00052001607,0.00037401987,0.00013519503,0.00011112962,0.08587211,0.040828127,0.0010901995,0.0022397693,0.8635658],"study_design_scores_gemma":[0.00021155727,0.0022627462,0.0093993,0.000109253415,0.00043151504,0.001283713,0.00022104087,0.7728691,0.20393738,0.0019491977,0.0071958876,0.00012924937],"about_ca_topic_score_codex":0.003390734,"about_ca_topic_score_gemma":0.0034333905,"teacher_disagreement_score":0.003929154,"about_ca_system_score_codex":0.0009144433,"about_ca_system_score_gemma":0.00084360206,"threshold_uncertainty_score":0.02077961},"labels":[],"label_agreement":null},{"id":"W2162291696","doi":"10.1007/978-3-642-33718-5_43","title":"Hausdorff Distance Constraint for Multi-surface Segmentation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hausdorff distance; Computer science; Submodular set function; Segmentation; Surface (topology); Constraint (computer-aided design); Hausdorff space; Mathematical optimization; Image segmentation; Artificial intelligence; Process (computing); Algorithm; Mathematics; Combinatorics; Geometry","score_opus":0.039277610875061944,"score_gpt":0.3017740785252674,"score_spread":0.26249646765020546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162291696","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.0078088907,0.0010269206,0.986537,0.00016377342,0.00007287083,0.000037506255,0.00034475757,0.0004998112,0.0035084372],"genre_scores_gemma":[0.18288961,0.0018088997,0.8007185,0.00018850568,0.00022089151,0.00020485294,0.0026233033,0.0011196133,0.010225787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921834,0.000111474554,0.000073454205,0.0002305427,0.00029338477,0.000072787276],"domain_scores_gemma":[0.99881494,0.0005147436,0.00008965246,0.00022835487,0.0002945259,0.00005772763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010261324,0.0008456136,0.0021303662,0.0015232741,0.0005623882,0.0024847125,0.002389859,0.001972637,0.005313377],"category_scores_gemma":[0.0033117065,0.00088767643,0.0011408721,0.0021493756,0.00093088404,0.0032054773,0.0018775512,0.0020931053,0.001572734],"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.00041720236,0.00008818241,0.0006809518,0.0009484011,0.00013299764,0.00039857024,0.0001986958,0.30368415,0.046240326,0.19220328,0.014149984,0.44085726],"study_design_scores_gemma":[0.000010415132,0.000039439936,0.0004348075,0.00004249522,0.00002174282,0.00017809359,0.000026721895,0.93477863,0.009531835,0.04509858,0.009809314,0.000027980788],"about_ca_topic_score_codex":0.004218207,"about_ca_topic_score_gemma":0.0037541417,"teacher_disagreement_score":0.005313377,"about_ca_system_score_codex":0.0011729174,"about_ca_system_score_gemma":0.0011699499,"threshold_uncertainty_score":0.017775},"labels":[],"label_agreement":null},{"id":"W2163865101","doi":"10.1109/pacrim.1995.519553","title":"Filling boundaries by insertion and traversal in a linear quadtree domain","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quadtree; Pixel; Tree traversal; Boundary (topology); Computer science; Algorithm; Code (set theory); Domain (mathematical analysis); Blocking (statistics); Computer vision; Mathematics; Set (abstract data type); Artificial intelligence; Mathematical analysis","score_opus":0.014895465456565931,"score_gpt":0.2301479375890455,"score_spread":0.21525247213247958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163865101","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.013614215,0.000074127594,0.9840826,0.000042498126,0.000008673021,0.000040510407,0.00003268179,0.0012239882,0.0008807098],"genre_scores_gemma":[0.053607773,0.00006903724,0.9449629,0.000028472514,0.0000040007026,0.000052874417,0.00013051696,0.00018912209,0.00095515576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965227,0.000050645263,0.000026741043,0.000070330556,0.0001337362,0.0000663551],"domain_scores_gemma":[0.9992506,0.0003243539,0.00009286224,0.00015311534,0.0001399003,0.0000391274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043262303,0.00037635185,0.0006741668,0.00053741364,0.000519839,0.0010265338,0.001174655,0.0006935066,0.0027861586],"category_scores_gemma":[0.0014623961,0.00047530033,0.00043888885,0.0007425836,0.00069752237,0.0018610583,0.0015431577,0.00068093126,0.001840538],"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.00036828715,0.00009773204,0.0013060202,0.00033703088,0.000017831457,0.00027656514,0.0007874574,0.03973515,0.14230743,0.04041221,0.0044145873,0.7699398],"study_design_scores_gemma":[0.0001057601,0.00037314888,0.00086975767,0.00011042827,0.0000349644,0.0013171632,0.00047879535,0.7293778,0.1668855,0.052848823,0.04751679,0.0000810029],"about_ca_topic_score_codex":0.0016288992,"about_ca_topic_score_gemma":0.0020260853,"teacher_disagreement_score":0.0027861586,"about_ca_system_score_codex":0.00035577442,"about_ca_system_score_gemma":0.0007947766,"threshold_uncertainty_score":0.009320617},"labels":[],"label_agreement":null},{"id":"W2164116870","doi":"10.1109/pacrim.1989.48363","title":"Morphological skeleton transforms for determining position and orientation of pre-marked objects","year":2003,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ellipse; Artificial intelligence; Skeleton (computer programming); Position (finance); Computer vision; Orientation (vector space); Perspective (graphical); Object (grammar); Scheme (mathematics); Computer science; Surface (topology); Image (mathematics); Euclidean geometry; Pattern recognition (psychology); Mathematics; Geometry; Mathematical analysis","score_opus":0.013800509322104047,"score_gpt":0.2778264528752995,"score_spread":0.2640259435531955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164116870","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.011258827,0.00010448682,0.98687565,0.000034000994,0.000022390925,0.00002739341,0.00004161172,0.0007780698,0.0008574376],"genre_scores_gemma":[0.111243814,0.00034237016,0.8859078,0.000018761864,0.000024622688,0.000048922135,0.00028366788,0.00013123268,0.001998803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996253,0.00007085091,0.00003076806,0.00006590492,0.0001785689,0.000028526967],"domain_scores_gemma":[0.9992663,0.00016788619,0.00011577637,0.00018809106,0.00022959383,0.000032302898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050818553,0.00061572506,0.00034652106,0.0014397303,0.00025935474,0.00089736626,0.00060491374,0.0005889022,0.0024819437],"category_scores_gemma":[0.0020523104,0.00033703924,0.0004307254,0.0012837407,0.00063032605,0.0013432059,0.0006134312,0.00059145404,0.0018084826],"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.00025809236,0.000055769244,0.00065200886,0.00014351119,0.000021720552,0.00029221707,0.00016863289,0.024497202,0.2444426,0.019823592,0.0019317186,0.70771295],"study_design_scores_gemma":[0.000041210533,0.00021813557,0.0032644363,0.00004655345,0.000041934425,0.0013561802,0.000120950535,0.6485264,0.3121939,0.017228276,0.01690131,0.00006083248],"about_ca_topic_score_codex":0.00063923345,"about_ca_topic_score_gemma":0.0009377241,"teacher_disagreement_score":0.0024819437,"about_ca_system_score_codex":0.00025334134,"about_ca_system_score_gemma":0.0005786992,"threshold_uncertainty_score":0.008302927},"labels":[],"label_agreement":null},{"id":"W2167131512","doi":"10.1109/icsmc.2007.4414062","title":"A real-time implementation of chaotic contour tracing and filling of video objects on reconfigurable hardware","year":2007,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Field-programmable gate array; Computer science; Tracing; Scalability; Hardware acceleration; Reconfigurable computing; Computer hardware; Hardware architecture; Frame (networking); Software; Frame rate; Embedded system; Artificial intelligence","score_opus":0.018095138755860822,"score_gpt":0.29358077620682044,"score_spread":0.2754856374509596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167131512","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.12941979,0.00030743514,0.8615144,0.0000992594,0.00007546059,0.0000814382,0.00005103772,0.0032028207,0.0052483818],"genre_scores_gemma":[0.6479111,0.00014059046,0.34914333,0.000041035564,0.000021600295,0.00004534982,0.00006201057,0.00006199508,0.0025729265],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999105,0.000013436484,0.0000055255764,0.000017705957,0.000039657327,0.000013192919],"domain_scores_gemma":[0.9998431,0.000050045546,0.00002517154,0.0000385365,0.000031336822,0.000011767683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011241512,0.00023328105,0.00016460431,0.0002653732,0.00014914478,0.00025593006,0.0007076652,0.00023707202,0.0013577873],"category_scores_gemma":[0.00036755187,0.00012586173,0.00014007963,0.00016193785,0.00016664053,0.0002806559,0.00015036037,0.00017211439,0.00019380786],"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.00047918636,0.00006655429,0.0012364078,0.00022181169,0.000039099177,0.0007011387,0.00020060928,0.037931073,0.53304666,0.010256262,0.0017952266,0.41402593],"study_design_scores_gemma":[0.00012819117,0.00074022415,0.0030221671,0.00004050908,0.000053301166,0.0014664632,0.000040353225,0.50360024,0.46812966,0.0014265282,0.021298448,0.00005399266],"about_ca_topic_score_codex":0.0006591568,"about_ca_topic_score_gemma":0.0008780349,"teacher_disagreement_score":0.0013577873,"about_ca_system_score_codex":0.00019330309,"about_ca_system_score_gemma":0.00023254975,"threshold_uncertainty_score":0.004542291},"labels":[],"label_agreement":null},{"id":"W2168700313","doi":"10.1109/83.821742","title":"A two-subcycle thinning algorithm and its parallel implementation on SIMD machines","year":2000,"lang":"en","type":"letter","venue":"IEEE Transactions on Image Processing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"SIMD; Thinning; Computer science; Parallel computing; Algorithm; Parallel algorithm; Social connectedness","score_opus":0.018453596779528313,"score_gpt":0.30619401678719044,"score_spread":0.28774042000766215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168700313","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.020597054,0.00030094938,0.9688126,0.00031890345,0.00016365253,0.00014169296,0.000092980445,0.002071594,0.0075006704],"genre_scores_gemma":[0.084879585,0.00018229845,0.9106909,0.00009578716,0.000029790695,0.00014550299,0.00016388368,0.00010427706,0.0037079328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996923,0.000052848038,0.000024466195,0.000051543233,0.00014853268,0.000030370658],"domain_scores_gemma":[0.9995252,0.000102457656,0.00003358584,0.00014081373,0.00017208507,0.000025848272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044227243,0.00052030745,0.00045527966,0.00070272066,0.00050268805,0.0005966725,0.0008773237,0.0005111446,0.006186329],"category_scores_gemma":[0.00087448594,0.0003217554,0.00023739117,0.0010649895,0.00034079203,0.0007276509,0.00035592588,0.0004715693,0.0015395867],"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.00072329777,0.00016265363,0.0010225418,0.00020185203,0.00004241459,0.00065392256,0.0001104582,0.045974378,0.13221754,0.035670463,0.015178723,0.7680417],"study_design_scores_gemma":[0.0001322979,0.00023128306,0.0006390584,0.00002318799,0.000021774833,0.0013140092,0.000035007975,0.86428213,0.08701586,0.012040531,0.034219448,0.000045473975],"about_ca_topic_score_codex":0.0007522997,"about_ca_topic_score_gemma":0.0016041648,"teacher_disagreement_score":0.006186329,"about_ca_system_score_codex":0.00047629973,"about_ca_system_score_gemma":0.00049140205,"threshold_uncertainty_score":0.020695329},"labels":[],"label_agreement":null},{"id":"W2170289512","doi":"10.1109/icpr.2000.906146","title":"Vector templates for symbol recognition","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Symbol (formal); Template; Computer science; Template matching; Artificial intelligence; Pattern recognition (psychology); Representation (politics); Orientation (vector space); Matching (statistics); Position (finance); Scale (ratio); Computer vision; Mathematics; Image (mathematics); Geometry","score_opus":0.06796262352377111,"score_gpt":0.26159000829016216,"score_spread":0.19362738476639105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170289512","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.0009412267,0.001680824,0.986784,0.000127517,0.00026369977,0.00007961901,0.0003679375,0.00451685,0.0052383333],"genre_scores_gemma":[0.0376879,0.00322228,0.94076157,0.00023742081,0.00031539297,0.00032244963,0.003013089,0.0007993197,0.013640629],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854636,0.00032397048,0.00016090508,0.0002846452,0.0005762354,0.00010792031],"domain_scores_gemma":[0.9982432,0.00050234684,0.00010372248,0.0006201836,0.00047141456,0.000059078942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009501083,0.0009866684,0.0012206725,0.0020078125,0.00055136916,0.0026377449,0.0021777267,0.0013034572,0.024231466],"category_scores_gemma":[0.0050431048,0.00052934675,0.0008862502,0.0031077527,0.00082464237,0.003837258,0.0014772556,0.0015226245,0.02214535],"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.0001427512,0.0000454066,0.00019983287,0.0003570518,0.000053655847,0.00013115212,0.00009856368,0.011209422,0.017625127,0.09469064,0.02820808,0.8472383],"study_design_scores_gemma":[0.00007193044,0.00018381776,0.0006880753,0.00032528146,0.000078100755,0.0011979676,0.00014289649,0.3255075,0.053583626,0.2817723,0.33631304,0.00013542805],"about_ca_topic_score_codex":0.0011118462,"about_ca_topic_score_gemma":0.00090536196,"teacher_disagreement_score":0.024231466,"about_ca_system_score_codex":0.0005618476,"about_ca_system_score_gemma":0.0007348764,"threshold_uncertainty_score":0.08106232},"labels":[],"label_agreement":null},{"id":"W2171755253","doi":"10.1109/tip.2005.857277","title":"Bidirectional labeling and registration scheme for grayscale image segmentation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Segmentation; Artificial intelligence; Scale-space segmentation; Image segmentation; Computer vision; Grayscale; Computer science; Segmentation-based object categorization; Scheme (mathematics); Pixel; Image registration; Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.020067715444319692,"score_gpt":0.2941053754937309,"score_spread":0.2740376600494112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171755253","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.004745165,0.00008441679,0.9933175,0.000054207063,0.00002170812,0.00003168632,0.000015070082,0.00039218855,0.0013381531],"genre_scores_gemma":[0.16335234,0.00027288176,0.8325609,0.00007764642,0.000034120225,0.00013417915,0.00013278349,0.00024347412,0.0031916169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901175,0.0002047295,0.00004933877,0.00016742744,0.00046850982,0.00009830235],"domain_scores_gemma":[0.9989592,0.0002160766,0.00011099771,0.00038511812,0.0002606667,0.000067958405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011109927,0.00046941437,0.00059381453,0.0008895145,0.00058303616,0.0010622304,0.0013264434,0.0008506054,0.003457839],"category_scores_gemma":[0.002039742,0.00042207533,0.0004814163,0.0008869649,0.0010983585,0.0021044202,0.0017096585,0.0010340775,0.0019627914],"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.00044258768,0.00013900075,0.0010480762,0.00027547567,0.000051478914,0.0002565294,0.00042302208,0.07592779,0.24674292,0.2123784,0.004470939,0.4578438],"study_design_scores_gemma":[0.00005347375,0.00015629623,0.000504735,0.00002604152,0.000032141044,0.0004898039,0.00007253776,0.82207435,0.11292178,0.039586272,0.024013042,0.00006950156],"about_ca_topic_score_codex":0.0011711211,"about_ca_topic_score_gemma":0.0013210652,"teacher_disagreement_score":0.003457839,"about_ca_system_score_codex":0.000685296,"about_ca_system_score_gemma":0.001080869,"threshold_uncertainty_score":0.011567652},"labels":[],"label_agreement":null},{"id":"W2172263801","doi":"10.1016/j.comgeo.2016.06.001","title":"Probing convex polygons with a wedge","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Omega; Wedge (geometry); Regular polygon; Combinatorics; Polygon (computer graphics); Orientation (vector space); Physics; Geometry; Convex polygon; Mathematics; Computer science","score_opus":0.01447344354937682,"score_gpt":0.24694983642336288,"score_spread":0.23247639287398605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172263801","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.0931353,0.00013134087,0.895908,0.00029878234,0.000072211,0.00007272768,0.00015683715,0.00040672993,0.009817984],"genre_scores_gemma":[0.56067574,0.0001946614,0.43337646,0.00017115343,0.00003081892,0.00011447735,0.00027067342,0.00020915913,0.0049569616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992536,0.00019144166,0.00004203202,0.00015887289,0.00026944175,0.00008453987],"domain_scores_gemma":[0.9985746,0.00078086165,0.000090345755,0.0003596814,0.0000914749,0.00010311455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006737627,0.00061486824,0.00087767944,0.0006968138,0.00044375917,0.001123451,0.0009552404,0.0010694162,0.0048564123],"category_scores_gemma":[0.0042589162,0.00086929614,0.0006725323,0.00064975454,0.001032208,0.002124407,0.0035993184,0.0016926902,0.0007395769],"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.0013132626,0.00044482952,0.0049947537,0.00047783362,0.000100488396,0.0014425225,0.0009221452,0.24690305,0.11046621,0.3907431,0.007280227,0.23491165],"study_design_scores_gemma":[0.000058985606,0.00019408722,0.00044873642,0.00004274172,0.00001699808,0.00049136695,0.00025825476,0.856753,0.019564977,0.11585456,0.006287464,0.000028842329],"about_ca_topic_score_codex":0.00041094844,"about_ca_topic_score_gemma":0.00034494148,"teacher_disagreement_score":0.0048564123,"about_ca_system_score_codex":0.00036646237,"about_ca_system_score_gemma":0.00031322442,"threshold_uncertainty_score":0.016246319},"labels":[],"label_agreement":null},{"id":"W2175309622","doi":"10.1016/j.endm.2005.05.035","title":"Degree constrained subgraphs","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Weighting; Degree (music); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.019654324841137705,"score_gpt":0.27627466262816175,"score_spread":0.25662033778702403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175309622","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.41070274,0.0011964748,0.28389078,0.004790829,0.0003806656,0.00041054838,0.0071118544,0.0010600983,0.2904561],"genre_scores_gemma":[0.84390277,0.00094481657,0.049988028,0.0008826132,0.00022137201,0.00028623117,0.0073195207,0.0005356858,0.09591893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996375,0.000074947035,0.000013935479,0.00012299677,0.000082503866,0.00006821213],"domain_scores_gemma":[0.99870074,0.00047855542,0.00013760476,0.00033829128,0.00015295959,0.00019178404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026438097,0.00056192954,0.00064752105,0.0010138709,0.0012642979,0.0016749055,0.0010475348,0.00078365754,0.03034837],"category_scores_gemma":[0.0022390725,0.00045489508,0.0006299867,0.0014220692,0.0007270631,0.0025772415,0.0015297331,0.0019199337,0.0028208606],"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.00017796819,0.00007935613,0.0012168176,0.00021197343,0.000053039923,0.00030111757,0.0002686509,0.008811052,0.0052035106,0.9172943,0.025857031,0.040525146],"study_design_scores_gemma":[0.000029966617,0.000018391414,0.0010033072,0.000025866368,0.000031951182,0.00035807712,0.00013450155,0.015558366,0.0021292532,0.957859,0.02284122,0.000010161072],"about_ca_topic_score_codex":0.0010491671,"about_ca_topic_score_gemma":0.0018818125,"teacher_disagreement_score":0.03034837,"about_ca_system_score_codex":0.000687154,"about_ca_system_score_gemma":0.00045466184,"threshold_uncertainty_score":0.10152537},"labels":[],"label_agreement":null},{"id":"W2188108660","doi":"10.82308/49991","title":"Coarse-to-fine medial surfaces","year":2006,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science","score_opus":0.015038760855889432,"score_gpt":0.25382247173856737,"score_spread":0.23878371088267794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188108660","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.027490735,0.000069831214,0.9710448,0.00011709806,0.0000140718885,0.000028341865,0.000021330346,0.00020870964,0.0010050964],"genre_scores_gemma":[0.3101526,0.0001941298,0.68657404,0.000042394462,0.00003794678,0.000060603455,0.00011984377,0.00018534686,0.0026331018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943036,0.0000846728,0.000034957655,0.00015634754,0.00024477948,0.000048899627],"domain_scores_gemma":[0.9974679,0.0014317316,0.00026985462,0.00036382827,0.00030300004,0.00016378191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016908371,0.00066679856,0.000861964,0.0011174531,0.0008226211,0.0018008995,0.0011095343,0.0013739478,0.0028491796],"category_scores_gemma":[0.008518022,0.0006024173,0.0006886563,0.00057387474,0.0021534571,0.0026263301,0.0023372397,0.0013801857,0.0006683649],"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.0001915424,0.00004417002,0.0015204196,0.00023290765,0.00003439358,0.00017763178,0.00044071084,0.7085571,0.019528413,0.15899596,0.00091644214,0.109360255],"study_design_scores_gemma":[0.000013605249,0.000048828977,0.00016862835,0.000018539047,0.0000044448757,0.00006867122,0.00005406731,0.9484424,0.0047121886,0.044945017,0.0015126036,0.000010968717],"about_ca_topic_score_codex":0.0020656695,"about_ca_topic_score_gemma":0.0022518001,"teacher_disagreement_score":0.0028491796,"about_ca_system_score_codex":0.0007991833,"about_ca_system_score_gemma":0.0009549741,"threshold_uncertainty_score":0.009531498},"labels":[],"label_agreement":null},{"id":"W2237678738","doi":"","title":"Génération de maillages anisotropes à partir de fichiers stéréolithographie","year":2001,"lang":"fr","type":"article","venue":"ORBi (University of Liège)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Communication; Computer science; Sociology","score_opus":0.02073030304660097,"score_gpt":0.2341326310240173,"score_spread":0.21340232797741632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237678738","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.51501197,0.0006102959,0.45552564,0.0003823112,0.00048798212,0.00019926032,0.00046416314,0.003674353,0.023644015],"genre_scores_gemma":[0.7389235,0.0008411937,0.22268327,0.00015461646,0.00023989523,0.00016599096,0.0007673555,0.00074419484,0.035480004],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996063,0.000064166714,0.000014828629,0.00006039833,0.00019719628,0.00005712131],"domain_scores_gemma":[0.99964964,0.000116669515,0.000050274833,0.00007441399,0.0000750873,0.000033918004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003588921,0.0010058609,0.0006643289,0.00090303924,0.0005757992,0.00110164,0.00033919813,0.001040949,0.0053196736],"category_scores_gemma":[0.0007322015,0.00036378996,0.0006743354,0.0004013249,0.00064080325,0.00069500785,0.00042911866,0.0010736958,0.0021307566],"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.0008236012,0.00020095213,0.0010967007,0.00024874898,0.00007591825,0.0008893931,0.0004535621,0.02472418,0.6973897,0.10575123,0.0049737534,0.16337228],"study_design_scores_gemma":[0.00025447665,0.00070568663,0.0038899644,0.000058797712,0.000086622436,0.0010551466,0.0002018262,0.118084826,0.8276979,0.0133011965,0.0345494,0.0001141871],"about_ca_topic_score_codex":0.0007710004,"about_ca_topic_score_gemma":0.0011656116,"teacher_disagreement_score":0.0053196736,"about_ca_system_score_codex":0.0007427541,"about_ca_system_score_gemma":0.00034875202,"threshold_uncertainty_score":0.0177961},"labels":[],"label_agreement":null},{"id":"W2282111065","doi":"10.4230/dagrep.4.10.51","title":"Optimal algorithms and proofs (Dagstuhl Seminar 14421)","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Council for Research in the Social Sciences, Columbia University; Universität Wien; Julius-Maximilians-Universität Würzburg; Université de Fribourg; Kungliga Tekniska Högskolan; University of Toronto; Universität Ulm; University of Leeds; Middlesex University; State University of New York; National Institute of Informatics; Univerzita Karlova v Praze; Technische Universität Chemnitz","keywords":"Mathematical proof; Computer science; Theoretical computer science; Algorithm; Mathematics","score_opus":0.027977739421020744,"score_gpt":0.28091864407180567,"score_spread":0.25294090465078495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282111065","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.016878605,0.16940601,0.13654892,0.17101295,0.07505097,0.00050017337,0.010994306,0.004684233,0.41492376],"genre_scores_gemma":[0.27678752,0.04819218,0.11232637,0.02076581,0.041070927,0.0014071468,0.01292836,0.0060429075,0.48047885],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931075,0.0025170199,0.00035231587,0.0009278348,0.0023045314,0.0007908675],"domain_scores_gemma":[0.99703634,0.0010895777,0.00014800757,0.00042184468,0.00058201404,0.000722296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008963508,0.0022980168,0.0021093837,0.0026981735,0.0018962673,0.0076363683,0.0020566287,0.0035866944,0.06127673],"category_scores_gemma":[0.011919626,0.0010001112,0.0019415295,0.0031909053,0.002298896,0.0043247063,0.0046903696,0.007097813,0.027660826],"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.00039948692,0.00020592946,0.00017480507,0.0004571735,0.00006450264,0.0001823954,0.00027950213,0.0028249614,0.0015856174,0.28487423,0.60084563,0.10810571],"study_design_scores_gemma":[0.0002461879,0.00014028662,0.001303875,0.0003930153,0.00005007954,0.00021040204,0.0000746284,0.0037623725,0.0019939654,0.31511334,0.6766516,0.0000602551],"about_ca_topic_score_codex":0.0022471747,"about_ca_topic_score_gemma":0.002119124,"teacher_disagreement_score":0.06127673,"about_ca_system_score_codex":0.0075616986,"about_ca_system_score_gemma":0.0038936296,"threshold_uncertainty_score":0.2049911},"labels":[],"label_agreement":null},{"id":"W2305149859","doi":"","title":"Constructing ɣ-Sets [Gamma-Sets] of Grids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Digital Image Processing Techniques","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":"Mathematics","score_opus":0.026720149099788537,"score_gpt":0.28353178095884424,"score_spread":0.2568116318590557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2305149859","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.20258772,0.00032446775,0.7556621,0.0005491765,0.00020173019,0.00019454877,0.00047760305,0.0007302001,0.03927238],"genre_scores_gemma":[0.59604466,0.00042017357,0.3885396,0.0003559119,0.000064219545,0.00022415209,0.001110466,0.0003644828,0.01287624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921393,0.00022216272,0.00006199634,0.00016548258,0.00019798872,0.00013854304],"domain_scores_gemma":[0.9978199,0.00093378214,0.00015860547,0.0005777226,0.00030215917,0.00020788237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068898516,0.0006562884,0.0008533111,0.0015386298,0.0013013125,0.00225953,0.002003255,0.0008771,0.006049277],"category_scores_gemma":[0.004962502,0.0012015605,0.0013321799,0.0016834474,0.0017375288,0.002253994,0.0037818612,0.0019229056,0.0011871543],"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.00015004697,0.000056006993,0.001836291,0.00016635316,0.000049838458,0.00023812495,0.00071806705,0.022477906,0.0049600173,0.9165718,0.0043773605,0.048398226],"study_design_scores_gemma":[0.000035947895,0.000044561297,0.0004801478,0.000072225695,0.000030780433,0.00017991786,0.00031904478,0.039406594,0.0039567207,0.9456138,0.009835462,0.00002483417],"about_ca_topic_score_codex":0.0012439366,"about_ca_topic_score_gemma":0.0013982587,"teacher_disagreement_score":0.006049277,"about_ca_system_score_codex":0.000977005,"about_ca_system_score_gemma":0.00056921353,"threshold_uncertainty_score":0.02023685},"labels":[],"label_agreement":null},{"id":"W2331980264","doi":"10.1515/acv-2014-0036","title":"Gaussian ℬ𝒱 capacity","year":2015,"lang":"en","type":"article","venue":"Advances in Calculus of Variations","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gaussian; Mathematics; TRACE (psycholinguistics); Gaussian random field; Gaussian function; Applied mathematics; Physics","score_opus":0.03266423222261787,"score_gpt":0.30799793050159263,"score_spread":0.27533369827897475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331980264","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.101663955,0.002828019,0.76928544,0.0035056947,0.00072101655,0.000087912966,0.0009952805,0.00050867925,0.12040403],"genre_scores_gemma":[0.96075815,0.0018569392,0.0192183,0.00065990596,0.00071663177,0.00008782231,0.00034281655,0.00008101967,0.016278397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827695,0.00036460377,0.000061046245,0.0002102709,0.0006936046,0.0003935904],"domain_scores_gemma":[0.99568534,0.0018858447,0.00029889803,0.0005593819,0.0012829057,0.00028772608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017185548,0.0004321725,0.0007504652,0.0011404705,0.00061220734,0.002436364,0.0013314652,0.00095076207,0.0059804325],"category_scores_gemma":[0.0061942223,0.0002470804,0.00058635,0.0013505168,0.003366526,0.0028831721,0.0018164599,0.0015664517,0.000801044],"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.000022861934,0.0000062232684,0.00010951197,0.000028439168,0.000007759103,0.00004006857,0.000044216635,0.0075677102,0.0006523037,0.98540735,0.001726241,0.0043873778],"study_design_scores_gemma":[0.0000098539085,0.0000231187,0.00019612719,0.000033698838,0.000009192056,0.00011021398,0.000032416356,0.08859659,0.0011481658,0.9044876,0.00532745,0.000025646652],"about_ca_topic_score_codex":0.0036238988,"about_ca_topic_score_gemma":0.0011151986,"teacher_disagreement_score":0.0059804325,"about_ca_system_score_codex":0.001883547,"about_ca_system_score_gemma":0.0016187669,"threshold_uncertainty_score":0.020006537},"labels":[],"label_agreement":null},{"id":"W2396734982","doi":"","title":"A Characterization Of Graphic Matroids Which Yield Biographic Splittings Matroids.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Matroid; Characterization (materials science); Yield (engineering); Mathematics; Combinatorics; Graphic matroid; Materials science; Nanotechnology; Composite material","score_opus":0.018457838717400518,"score_gpt":0.23813036247594513,"score_spread":0.21967252375854462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396734982","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.6124926,0.0010342626,0.22969176,0.0024779716,0.00022401116,0.00023928718,0.003399708,0.00106374,0.1493767],"genre_scores_gemma":[0.9165836,0.00057159096,0.05202176,0.0004909303,0.00031060594,0.00015333203,0.0038634108,0.0003339394,0.025670769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993162,0.00011975632,0.00005373864,0.00017380693,0.00022752385,0.00010902065],"domain_scores_gemma":[0.9968438,0.0010442752,0.00071707816,0.00048353086,0.0003610702,0.0005503695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005355212,0.0007164682,0.00059859833,0.0020902804,0.0011179536,0.0037207063,0.0008439087,0.00113754,0.014367257],"category_scores_gemma":[0.0036277026,0.00064606074,0.00076620036,0.0019446875,0.001423708,0.0031681014,0.0017581282,0.0021981595,0.0024176408],"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.000168249,0.00017646307,0.002988493,0.00021340755,0.000035672758,0.0005164444,0.00072534865,0.00634792,0.010224414,0.91779685,0.014339377,0.04646736],"study_design_scores_gemma":[0.000037553586,0.00010167637,0.002712954,0.0000836347,0.000037162863,0.0016459434,0.00052887225,0.03760195,0.004370651,0.932825,0.020016933,0.00003769327],"about_ca_topic_score_codex":0.00065521226,"about_ca_topic_score_gemma":0.0007376485,"teacher_disagreement_score":0.014367257,"about_ca_system_score_codex":0.0010354266,"about_ca_system_score_gemma":0.0004166323,"threshold_uncertainty_score":0.04806322},"labels":[],"label_agreement":null},{"id":"W2396949595","doi":"","title":"No 4-isosceles set with eight points on a circle.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"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":"Isosceles triangle; Mathematics; Set (abstract data type); Combinatorics; Geometry; Computer science","score_opus":0.01413272286756431,"score_gpt":0.24641789016791826,"score_spread":0.23228516730035395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396949595","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.42380774,0.0016471165,0.109581806,0.0035446598,0.0022670059,0.00019076752,0.0031820827,0.0010765648,0.4547022],"genre_scores_gemma":[0.78531194,0.00090147834,0.064099,0.000922521,0.00061557966,0.00024312458,0.005393911,0.00038202567,0.1421303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987703,0.00022677412,0.00010940634,0.00031841383,0.0003759113,0.00019914469],"domain_scores_gemma":[0.9986608,0.0003833661,0.0002069936,0.00026170362,0.00023896131,0.0002482192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000602533,0.0010910014,0.0015448529,0.002747792,0.0030654096,0.0035496086,0.001549006,0.0014496283,0.031689715],"category_scores_gemma":[0.0021757549,0.0006868401,0.0013748792,0.0013703959,0.0029192248,0.0027410553,0.003398655,0.0025379537,0.009402018],"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.0007315041,0.00013337213,0.0014226517,0.00037407278,0.00012933233,0.0012097424,0.00058544223,0.0024021047,0.0058276057,0.9192754,0.018808743,0.04910005],"study_design_scores_gemma":[0.00021050265,0.000150585,0.002881044,0.00014157638,0.00009381431,0.0024038714,0.00084921165,0.0066708843,0.0077079013,0.8437909,0.13495304,0.00014668542],"about_ca_topic_score_codex":0.0011604092,"about_ca_topic_score_gemma":0.0014665066,"teacher_disagreement_score":0.031689715,"about_ca_system_score_codex":0.0013221534,"about_ca_system_score_gemma":0.000786602,"threshold_uncertainty_score":0.10601264},"labels":[],"label_agreement":null},{"id":"W2397545861","doi":"","title":"On Potentially K 6 -3K 2 -graphic sequences.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"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":"Mathematics","score_opus":0.009171763233905216,"score_gpt":0.2351543934691195,"score_spread":0.22598263023521428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397545861","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.44971088,0.002006216,0.23694623,0.0018448404,0.00080879265,0.00021812238,0.0023446542,0.0018997543,0.30422053],"genre_scores_gemma":[0.80952734,0.0010409256,0.0687876,0.0005197773,0.00023169036,0.0001709657,0.002192309,0.0005525702,0.116976835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990957,0.00017045993,0.000070435664,0.00014598618,0.00026240374,0.00025509147],"domain_scores_gemma":[0.9989624,0.00040309888,0.000145885,0.00017011387,0.00017678252,0.00014174223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036563547,0.0010114773,0.000582885,0.002084968,0.0014370852,0.0028643992,0.00077962835,0.001118486,0.034509446],"category_scores_gemma":[0.0023587046,0.00046278047,0.00062317087,0.001908939,0.0013245082,0.002822457,0.0025616419,0.0012802448,0.010593119],"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.0009442569,0.00013648774,0.0015052411,0.0005506865,0.000053152613,0.0021074647,0.0009825393,0.012713961,0.02258927,0.82672065,0.018138329,0.11355801],"study_design_scores_gemma":[0.000089720685,0.00014331038,0.0018553948,0.00020712998,0.000036208698,0.0019015103,0.00051595987,0.02851156,0.013631803,0.87924284,0.07376177,0.00010278898],"about_ca_topic_score_codex":0.0010735057,"about_ca_topic_score_gemma":0.0027992532,"teacher_disagreement_score":0.034509446,"about_ca_system_score_codex":0.0009623491,"about_ca_system_score_gemma":0.0005475946,"threshold_uncertainty_score":0.115445614},"labels":[],"label_agreement":null},{"id":"W2397768957","doi":"","title":"Excluded-Minors For The Class Of Graphic Splitting Matroids.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"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":"Matroid; Mathematics; Class (philosophy); Combinatorics; Computer science; Artificial intelligence","score_opus":0.012697529181452866,"score_gpt":0.26088607893195176,"score_spread":0.2481885497504989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397768957","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.6157422,0.0013441498,0.23473802,0.0022630834,0.00041417437,0.00017813264,0.0020860832,0.0008950207,0.14233905],"genre_scores_gemma":[0.93621707,0.00050207344,0.024956996,0.00028618987,0.0004776256,0.00013785691,0.0023097405,0.0002266424,0.034885738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949753,0.000106372194,0.000031920394,0.00011169547,0.00016767507,0.0000848031],"domain_scores_gemma":[0.9983606,0.0006908196,0.00026691353,0.00022264251,0.00015518721,0.000303854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046135884,0.0006321239,0.0005315347,0.0013232039,0.0015152178,0.0032504683,0.0008124735,0.00080666493,0.015683584],"category_scores_gemma":[0.0022457691,0.00041062068,0.00079845975,0.0008316142,0.0014684923,0.0024158785,0.0013873316,0.0018077416,0.002095867],"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.0001790441,0.00009206702,0.001299035,0.000105940606,0.000028870609,0.00038968632,0.000428218,0.0020947657,0.0036482718,0.961918,0.009408877,0.020407198],"study_design_scores_gemma":[0.000043880576,0.000051029798,0.0011607242,0.000024807285,0.000015498632,0.0008814616,0.00016388413,0.011891439,0.0013052364,0.96970826,0.014735346,0.000018495628],"about_ca_topic_score_codex":0.00064234046,"about_ca_topic_score_gemma":0.00087853614,"teacher_disagreement_score":0.015683584,"about_ca_system_score_codex":0.0008495564,"about_ca_system_score_gemma":0.0004679771,"threshold_uncertainty_score":0.05246687},"labels":[],"label_agreement":null},{"id":"W2398963575","doi":"","title":"Characterizing K r+1 -C k -graphic Sequences.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Mathematics; Combinatorics","score_opus":0.031034303303532795,"score_gpt":0.26708092812215734,"score_spread":0.23604662481862454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398963575","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.39888015,0.0011479191,0.4232174,0.0012870597,0.00045566325,0.00023804829,0.002140325,0.0018803488,0.17075312],"genre_scores_gemma":[0.8832821,0.00071299233,0.06444345,0.0005069991,0.00021369381,0.0001527077,0.00256092,0.00045955117,0.04766763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992687,0.00012985402,0.000066071174,0.00017664036,0.0002033376,0.00015535028],"domain_scores_gemma":[0.9983285,0.00057115906,0.00030188015,0.00027850847,0.0003505791,0.00016928113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037543522,0.00088548724,0.00047694778,0.002377169,0.0009891009,0.0033317553,0.0007598639,0.0010176135,0.014992578],"category_scores_gemma":[0.0043674903,0.00034692962,0.00045592478,0.0019567646,0.0012849235,0.0020940667,0.0015129246,0.0012676234,0.0051564034],"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.00035411151,0.00011397882,0.0026823673,0.0003653219,0.000036292637,0.000631127,0.0006838422,0.010038289,0.02758552,0.8371683,0.014341058,0.10599989],"study_design_scores_gemma":[0.000051325314,0.00015604426,0.0026200486,0.00014868166,0.000041335905,0.0017479653,0.0005554498,0.049475886,0.017367685,0.88383996,0.04389306,0.00010257219],"about_ca_topic_score_codex":0.0011443632,"about_ca_topic_score_gemma":0.001584596,"teacher_disagreement_score":0.014992578,"about_ca_system_score_codex":0.00093904603,"about_ca_system_score_gemma":0.0006430485,"threshold_uncertainty_score":0.050155103},"labels":[],"label_agreement":null},{"id":"W2400979426","doi":"","title":"Potentially K 1, 1, t -graphic sequences.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"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":"Mathematics; Combinatorics","score_opus":0.015101425487720166,"score_gpt":0.2520880504996326,"score_spread":0.23698662501191245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400979426","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.28678262,0.0047721365,0.30370712,0.0030096297,0.0015676441,0.00042744857,0.0061143353,0.0039784727,0.3896406],"genre_scores_gemma":[0.7126543,0.0019925484,0.08963736,0.0008406769,0.0003608827,0.00028633268,0.005344226,0.0009028364,0.18798088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954957,0.00006420243,0.000040823244,0.0001249836,0.00009858581,0.00012185548],"domain_scores_gemma":[0.99922323,0.0002634757,0.0001103361,0.00014281085,0.0001586708,0.000101532445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002526688,0.0010789555,0.00043803224,0.0017706108,0.0012159176,0.0032491137,0.0007656198,0.0009933463,0.041022256],"category_scores_gemma":[0.0030149664,0.00034674266,0.00053261826,0.0015210761,0.0008151982,0.0025576125,0.0013645277,0.0013152594,0.010966548],"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.0017285967,0.00028622654,0.003509425,0.0014455356,0.00010884001,0.003687979,0.0010764536,0.0079183625,0.057739154,0.6324628,0.05407485,0.2359618],"study_design_scores_gemma":[0.00013474247,0.00027813652,0.0037734706,0.0003666626,0.00013823819,0.0047503705,0.0007422139,0.022609293,0.030308712,0.77031827,0.16645622,0.00012361282],"about_ca_topic_score_codex":0.0007615587,"about_ca_topic_score_gemma":0.0017978171,"teacher_disagreement_score":0.041022256,"about_ca_system_score_codex":0.0007101907,"about_ca_system_score_gemma":0.00060075393,"threshold_uncertainty_score":0.13723314},"labels":[],"label_agreement":null},{"id":"W2402494642","doi":"","title":"Potentially K-pr+1-graphic sequences.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Mathematics; Arithmetic","score_opus":0.011221293487695464,"score_gpt":0.24757840790882693,"score_spread":0.23635711442113147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402494642","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.25641283,0.0031399452,0.23972592,0.0028149053,0.0011305717,0.00033586498,0.0049696597,0.003426383,0.48804384],"genre_scores_gemma":[0.74658066,0.001278535,0.077762805,0.0007054411,0.0003217736,0.00020389141,0.004391906,0.0007849728,0.1679701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993237,0.000115303694,0.00005461176,0.00017860031,0.00017277797,0.00015505069],"domain_scores_gemma":[0.9988362,0.00043818192,0.00015818304,0.00025064367,0.00020203844,0.000114764196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029054563,0.0010091816,0.000550529,0.0015910873,0.0010231736,0.002680161,0.0008917422,0.0009082906,0.047175035],"category_scores_gemma":[0.003066016,0.00042622347,0.00054640486,0.0012695343,0.0009730212,0.00232406,0.0017586289,0.0014817027,0.014805883],"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.001213458,0.00018912904,0.0025452776,0.00094573555,0.00007126932,0.0030243453,0.00078229303,0.005138544,0.03577169,0.71374494,0.035501085,0.20107217],"study_design_scores_gemma":[0.00012312668,0.00023432843,0.0038290187,0.0002645314,0.00009442279,0.005638519,0.00050057424,0.015315563,0.021216316,0.7856944,0.16696241,0.00012676357],"about_ca_topic_score_codex":0.00054897065,"about_ca_topic_score_gemma":0.0013151692,"teacher_disagreement_score":0.047175035,"about_ca_system_score_codex":0.0007275112,"about_ca_system_score_gemma":0.00042188625,"threshold_uncertainty_score":0.15781617},"labels":[],"label_agreement":null},{"id":"W2403346498","doi":"","title":"On Potentially C 2, 6 -graphic Sequences.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"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":"Mathematics","score_opus":0.02254791586065287,"score_gpt":0.2603715939640396,"score_spread":0.23782367810338673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403346498","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.2655075,0.0023413338,0.39929643,0.0015751484,0.0011768896,0.00021845047,0.0017997646,0.0021998917,0.32588473],"genre_scores_gemma":[0.71440136,0.0015351796,0.1231001,0.0007173954,0.00036489067,0.00020452164,0.0023261704,0.0007746902,0.15657566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919325,0.00014712405,0.000053715987,0.00013706567,0.0002681313,0.00020067462],"domain_scores_gemma":[0.9987907,0.00047181704,0.00015243074,0.0001728608,0.00024799615,0.00016429121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043294564,0.0010607591,0.00053633825,0.0027000462,0.0014421412,0.0030237194,0.0007474433,0.0010433482,0.03045095],"category_scores_gemma":[0.0033833683,0.0004338275,0.000574255,0.0020699785,0.0012951518,0.0030090658,0.0020984185,0.0014915059,0.00781948],"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.00043501274,0.00007497596,0.0007947483,0.00029655118,0.000027447892,0.00094390125,0.00052325334,0.007107767,0.011952547,0.86891323,0.016735308,0.092195235],"study_design_scores_gemma":[0.000049741542,0.000115922,0.00105388,0.00018008056,0.00002358087,0.0010725495,0.00034351562,0.027665753,0.011718614,0.88501394,0.072689176,0.00007319725],"about_ca_topic_score_codex":0.0013539413,"about_ca_topic_score_gemma":0.003139933,"teacher_disagreement_score":0.03045095,"about_ca_system_score_codex":0.00095860637,"about_ca_system_score_gemma":0.0006597922,"threshold_uncertainty_score":0.10186857},"labels":[],"label_agreement":null},{"id":"W2403383766","doi":"","title":"A note on the charaterization of potentially K 1, 1, s -graphic sequences.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Mathematics; Arithmetic","score_opus":0.01257930895811831,"score_gpt":0.2459077578593007,"score_spread":0.23332844890118237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403383766","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.044450376,0.006695689,0.36170045,0.010192244,0.010263679,0.00015026041,0.0010064758,0.0015866896,0.5639541],"genre_scores_gemma":[0.57051855,0.0072812205,0.2546073,0.006261523,0.0051562204,0.0003323282,0.0012765637,0.0012818889,0.15328446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999276,0.00017553884,0.000055311335,0.00014227489,0.00023673223,0.00011420568],"domain_scores_gemma":[0.9976986,0.0011892241,0.00013225224,0.00044909166,0.00027380444,0.0002569972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089640915,0.0009406789,0.00078291784,0.0022504774,0.0028604944,0.0037516337,0.0014218722,0.0011613003,0.023326272],"category_scores_gemma":[0.0060420125,0.00043725292,0.0010350854,0.0021367783,0.0037401398,0.005372614,0.0036137118,0.004959331,0.004407618],"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.00008312842,0.000016019394,0.00015985128,0.00011500925,0.000007669781,0.00021808816,0.0001925137,0.00058691564,0.0014466067,0.9571784,0.017053826,0.022941984],"study_design_scores_gemma":[0.000011930713,0.000036427817,0.00020560266,0.00005341205,0.000010487719,0.0005313864,0.00007445412,0.002025747,0.0013610823,0.9311792,0.064478844,0.000031547963],"about_ca_topic_score_codex":0.0011010184,"about_ca_topic_score_gemma":0.0018853634,"teacher_disagreement_score":0.023326272,"about_ca_system_score_codex":0.0010318033,"about_ca_system_score_gemma":0.00086100446,"threshold_uncertainty_score":0.07803416},"labels":[],"label_agreement":null},{"id":"W2406187658","doi":"10.1080/00029890.2008.11920549","title":"Thin Sets with Fat Shadows: Projections of Cantor Sets","year":2008,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Acadia University","funders":"","keywords":"Cantor set; Shadow (psychology); Projection (relational algebra); Subspace topology; Totally disconnected space; Mathematics; Cantor function; Unit sphere; Combinatorics; Unit square; Set (abstract data type); Mathematical analysis; Computer science; Algorithm","score_opus":0.020841731288752306,"score_gpt":0.27073060752830186,"score_spread":0.24988887623954956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406187658","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.32736957,0.0020961983,0.49320325,0.0018745249,0.0006865538,0.00022981696,0.0010403873,0.000880017,0.17261966],"genre_scores_gemma":[0.89675045,0.0014490038,0.07491741,0.00041054792,0.00042374938,0.00027461842,0.00083624467,0.0003389439,0.02459896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984944,0.00031189216,0.00006467219,0.00025627672,0.0005633366,0.00030940832],"domain_scores_gemma":[0.9953047,0.0019931737,0.00046682672,0.000517951,0.00074583373,0.0009716055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012104835,0.00083255407,0.00063855335,0.0026711153,0.002122763,0.0050550653,0.0008190087,0.00085855165,0.012604844],"category_scores_gemma":[0.006739031,0.0010299687,0.0010664241,0.001286711,0.004213589,0.0050138654,0.0047971243,0.0030513273,0.0012341007],"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.00006816942,0.000014456378,0.00030140244,0.000042474305,0.000010232072,0.0001865182,0.00048014717,0.0012563778,0.0016523857,0.98732764,0.0014933976,0.0071667987],"study_design_scores_gemma":[0.000033635366,0.000046279914,0.0006381231,0.00005376147,0.000016461814,0.0003950357,0.0005230608,0.012686782,0.0017105478,0.975024,0.008829726,0.00004266064],"about_ca_topic_score_codex":0.0017910362,"about_ca_topic_score_gemma":0.001447313,"teacher_disagreement_score":0.012604844,"about_ca_system_score_codex":0.0012945783,"about_ca_system_score_gemma":0.0008883338,"threshold_uncertainty_score":0.042167366},"labels":[],"label_agreement":null},{"id":"W2406685393","doi":"","title":"A Characterization on Potentially K 6 -E(K 3 )-graphic Sequences.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Characterization (materials science); Mathematics; Nanotechnology; Materials science","score_opus":0.010274289344532762,"score_gpt":0.2252204665717146,"score_spread":0.21494617722718184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406685393","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.5226761,0.001309349,0.18312363,0.0017837475,0.00051772076,0.00017537315,0.0024718705,0.0013231776,0.28661898],"genre_scores_gemma":[0.8987579,0.00065183075,0.035236523,0.0004716556,0.0002108783,0.00013988861,0.0024179437,0.00031861418,0.06179477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994937,0.00007071254,0.000048951533,0.00010747325,0.00014678159,0.00013233814],"domain_scores_gemma":[0.9985214,0.0005964359,0.00024239815,0.00016509148,0.000230627,0.00024402456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002800462,0.0008204096,0.0004370133,0.0021004744,0.0012577646,0.0027853476,0.00072115683,0.00096888805,0.02549774],"category_scores_gemma":[0.0027753715,0.00038132555,0.0004818649,0.0018632468,0.0012783294,0.002541794,0.001866107,0.0015520044,0.0053266995],"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.0004998292,0.00008490506,0.0018655455,0.00025456815,0.000019229112,0.0010419392,0.0007508923,0.003168962,0.01292527,0.91178244,0.0097706495,0.05783581],"study_design_scores_gemma":[0.00006412441,0.00018566007,0.002894013,0.00017572712,0.000036605383,0.002658399,0.0006314808,0.013899682,0.008443257,0.9081305,0.06280347,0.000077151446],"about_ca_topic_score_codex":0.0007027478,"about_ca_topic_score_gemma":0.0009841308,"teacher_disagreement_score":0.02549774,"about_ca_system_score_codex":0.00069620874,"about_ca_system_score_gemma":0.00047821546,"threshold_uncertainty_score":0.08529842},"labels":[],"label_agreement":null},{"id":"W2408748049","doi":"","title":"On a characterization for a graphic sequence to be potentially K r+1 -E(G)-graphic.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Characterization (materials science); Sequence (biology); Mathematics; Combinatorics; Biology; Nanotechnology; Genetics; Materials science","score_opus":0.043149540782141005,"score_gpt":0.28596882953651004,"score_spread":0.24281928875436903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408748049","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.19790718,0.0014979709,0.515953,0.003724444,0.0008863144,0.0004120907,0.0043558367,0.0025455148,0.27271768],"genre_scores_gemma":[0.7857876,0.0012404941,0.14344834,0.0020672781,0.00079429173,0.000677343,0.0061634355,0.0010549923,0.05876621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902153,0.0001552578,0.00010984562,0.00029513094,0.00020803905,0.00021025221],"domain_scores_gemma":[0.9966869,0.0017344827,0.0003681116,0.00047535545,0.0003810013,0.00035419434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000827132,0.0012508461,0.00075347343,0.0031697962,0.0021525095,0.0038326199,0.0011069261,0.0017798133,0.028022107],"category_scores_gemma":[0.0060845,0.00050628156,0.0010619401,0.0025469614,0.0025748168,0.0062641026,0.0030743114,0.003309872,0.0059565357],"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.000244526,0.000093728835,0.0010572337,0.00021385313,0.000020133819,0.00042572196,0.0006368278,0.0029980217,0.0058933212,0.9280914,0.017710762,0.04261447],"study_design_scores_gemma":[0.000041262723,0.0001505142,0.0017822267,0.00016467465,0.000042078842,0.0012757897,0.00038561702,0.012796496,0.0036076172,0.9326783,0.04699935,0.000076058306],"about_ca_topic_score_codex":0.0011866095,"about_ca_topic_score_gemma":0.0016565203,"teacher_disagreement_score":0.028022107,"about_ca_system_score_codex":0.0012437504,"about_ca_system_score_gemma":0.00074104604,"threshold_uncertainty_score":0.093743324},"labels":[],"label_agreement":null},{"id":"W24407101","doi":"10.1007/11505877_17","title":"A Note on a Result of Daurat and Nivat","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Centre National de la Recherche Scientifique","keywords":"Corollary; Reentrancy; Mathematics; Polyomino; Salient; Combinatorics; Property (philosophy); Square lattice; Valuation (finance); Lattice (music); Discrete mathematics; Computer science; Geometry; Statistical physics; Physics; Artificial intelligence; Philosophy","score_opus":0.01660863708907274,"score_gpt":0.2659872466039845,"score_spread":0.24937860951491175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24407101","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.009512212,0.13091667,0.21644078,0.17385988,0.07476955,0.0001671383,0.0018243298,0.0017685214,0.39074084],"genre_scores_gemma":[0.2203903,0.10255105,0.20677902,0.109699555,0.08786971,0.00083252374,0.0029749903,0.004558827,0.264344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955592,0.0012508758,0.00029541104,0.0009461513,0.0014655661,0.00048277833],"domain_scores_gemma":[0.99365485,0.0036238926,0.00022453147,0.00095152296,0.0011970404,0.00034808798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004314297,0.0025862455,0.0038036196,0.0059863534,0.006241478,0.004447075,0.004956478,0.004397582,0.016646514],"category_scores_gemma":[0.0148754185,0.00091216684,0.0053764936,0.007105785,0.00605588,0.014904563,0.010290564,0.009417997,0.008205194],"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.0001731622,0.00007651588,0.00034712214,0.00071482064,0.00010229303,0.00025704355,0.0004210447,0.0008283713,0.0010801975,0.7737311,0.17712982,0.04513844],"study_design_scores_gemma":[0.000027587706,0.0000424899,0.00056492124,0.00017096801,0.00009817763,0.00031844006,0.000069361966,0.0015355127,0.0007184765,0.81458217,0.18181159,0.00006032079],"about_ca_topic_score_codex":0.004716045,"about_ca_topic_score_gemma":0.002883763,"teacher_disagreement_score":0.016646514,"about_ca_system_score_codex":0.003328513,"about_ca_system_score_gemma":0.0022518963,"threshold_uncertainty_score":0.055688083},"labels":[],"label_agreement":null},{"id":"W2479263369","doi":"10.1016/j.jda.2016.07.001","title":"Reconstructing binary matrices with timetabling constraints","year":2016,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Dimension (graph theory); Binary number; Greedy algorithm; Relaxation (psychology); Matrix (chemical analysis); Mathematical optimization; Mathematics; Computational complexity theory; Computer science; Algorithm; Time complexity; Combinatorics","score_opus":0.013487613310519635,"score_gpt":0.25613811537437825,"score_spread":0.2426505020638586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479263369","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.01578853,0.00014610826,0.9812335,0.00023749436,0.00008456807,0.000034303237,0.00019017296,0.00030993955,0.0019754632],"genre_scores_gemma":[0.18842073,0.00040869843,0.8032405,0.00022213018,0.00012332742,0.000119927536,0.00076203217,0.0002707598,0.0064319796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999265,0.00016795499,0.000045932502,0.00010856479,0.00034116255,0.00007133576],"domain_scores_gemma":[0.9962632,0.0023070995,0.00027542957,0.0006089386,0.0003875963,0.0001576898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074082956,0.00085491233,0.0007320135,0.0007211768,0.00038665935,0.0011640076,0.0009562593,0.0012539728,0.0063825576],"category_scores_gemma":[0.007029813,0.00070174364,0.00046024076,0.0013378061,0.0006409804,0.0023737168,0.0014356442,0.0018460627,0.0011393398],"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.0007173801,0.00017942235,0.00085269427,0.0004116025,0.000058144393,0.00044366755,0.00020549413,0.42220816,0.028035173,0.109458566,0.014487482,0.42294222],"study_design_scores_gemma":[0.000038784357,0.00008355734,0.00012740439,0.000021788734,0.0000074488476,0.00016931798,0.000053771564,0.9439402,0.01034772,0.041665256,0.0035250336,0.000019722005],"about_ca_topic_score_codex":0.0033293637,"about_ca_topic_score_gemma":0.0045968234,"teacher_disagreement_score":0.0063825576,"about_ca_system_score_codex":0.0003869446,"about_ca_system_score_gemma":0.0011311097,"threshold_uncertainty_score":0.021351755},"labels":[],"label_agreement":null},{"id":"W2505577832","doi":"10.1017/cbo9781139523967.001","title":"Preface","year":2015,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Field (mathematics); Computer graphics; Graphics; Subject (documents); State (computer science); Theoretical computer science; Data science; Artificial intelligence; Computer graphics (images); Algorithm; Mathematics; World Wide Web","score_opus":0.04475444442365625,"score_gpt":0.22598402589973257,"score_spread":0.18122958147607632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505577832","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.0010340714,0.015588147,0.007958777,0.009148361,0.040104236,0.00019909763,0.0038944178,0.0013436087,0.9207294],"genre_scores_gemma":[0.0034562193,0.006085253,0.002772115,0.0018879228,0.0060188817,0.00008372139,0.0033515205,0.00071904383,0.97562546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938965,0.000061564366,0.00003099521,0.000121431374,0.00035493763,0.000041460353],"domain_scores_gemma":[0.99872607,0.0002631327,0.000053692664,0.00013846775,0.0006052309,0.00021329225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164903,0.0008891319,0.0008522572,0.0019037866,0.0017126584,0.0041495427,0.0013205733,0.0012369155,0.40568027],"category_scores_gemma":[0.0036596518,0.00033572136,0.00053663633,0.0016021354,0.00071028376,0.0031680472,0.0018171984,0.0028647059,0.2866874],"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.000022411525,0.00002297867,0.000071674345,0.00016563114,0.0000025627114,0.00005763691,0.00016499075,0.00014273191,0.00024654716,0.014637125,0.90010977,0.08435598],"study_design_scores_gemma":[0.0000011614692,0.0000063242214,0.00008188199,0.00007535916,7.8981594e-7,0.00006683931,0.000036615034,0.000027357439,0.00004875805,0.002349301,0.997303,0.000002519241],"about_ca_topic_score_codex":0.0013169942,"about_ca_topic_score_gemma":0.0021604574,"teacher_disagreement_score":0.40568027,"about_ca_system_score_codex":0.0013127251,"about_ca_system_score_gemma":0.0011026873,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2515361867","doi":"10.1007/s00454-016-9823-1","title":"Unique Determination of Convex Lattice Sets","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Regular polygon; Lattice (music); Physics; Geometry","score_opus":0.015330599697729083,"score_gpt":0.28902329182556397,"score_spread":0.27369269212783487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515361867","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.16655186,0.00056000607,0.7730661,0.000913752,0.00031492382,0.00010836611,0.00054214895,0.00047342505,0.057469454],"genre_scores_gemma":[0.72109556,0.00033776747,0.25902948,0.00016895888,0.00013600306,0.00013034172,0.0006819337,0.00039645957,0.018023467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830675,0.00041526704,0.0000861471,0.00036645198,0.0006080514,0.0002173327],"domain_scores_gemma":[0.9968688,0.0011966503,0.0003333649,0.00041606565,0.00063530856,0.0005499058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091820717,0.0004887771,0.0013237112,0.0020879067,0.0022096005,0.0043715728,0.001620842,0.00097283314,0.005508425],"category_scores_gemma":[0.006968734,0.0009982707,0.0010309593,0.0011152168,0.0031177104,0.0029243492,0.0035894166,0.0038424272,0.0014232281],"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.000065560074,0.000039570357,0.0005347106,0.00008491066,0.00001715137,0.00012916952,0.00030210082,0.009411696,0.004116028,0.9581478,0.0028895778,0.024261707],"study_design_scores_gemma":[0.000019871643,0.000034083325,0.00036582796,0.000033993794,0.000008711724,0.00031360905,0.00034393175,0.072369814,0.005827059,0.9141071,0.0065259347,0.000050098955],"about_ca_topic_score_codex":0.001080713,"about_ca_topic_score_gemma":0.0013531292,"teacher_disagreement_score":0.005508425,"about_ca_system_score_codex":0.0012239424,"about_ca_system_score_gemma":0.0011197473,"threshold_uncertainty_score":0.018427491},"labels":[],"label_agreement":null},{"id":"W2528347621","doi":"","title":"VLSI architecture for the computation of the diameter and the closest points of a set","year":2013,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Very-large-scale integration; Computation; Set (abstract data type); Curse of dimensionality; Mathematics; Algorithm; Computer science; Path (computing); Parallel computing; Artificial intelligence","score_opus":0.013636608284359867,"score_gpt":0.2518685577855731,"score_spread":0.23823194950121324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528347621","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.049125664,0.0007527617,0.93926233,0.00024729583,0.00017459123,0.00006899829,0.00024443524,0.003980953,0.0061430507],"genre_scores_gemma":[0.30597165,0.0004067713,0.6888797,0.00011171621,0.0000889793,0.0001346459,0.00047423615,0.000082449435,0.003849895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983335,0.000022303548,0.000015981212,0.000034829427,0.00006993326,0.000023525832],"domain_scores_gemma":[0.99970454,0.00007987345,0.000021956861,0.00005172567,0.00012329406,0.000018588718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002241044,0.0004028453,0.00036393775,0.0009801105,0.00040788445,0.00080837705,0.0011639029,0.0005328638,0.006550619],"category_scores_gemma":[0.0012741424,0.0002796412,0.0003247865,0.0009249609,0.00023607683,0.0007555658,0.000508798,0.0004037343,0.0015695564],"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.00082269276,0.00012967786,0.0024002478,0.00037333244,0.00014823256,0.00025764448,0.0002598614,0.04462937,0.14413188,0.048441175,0.017042516,0.74136335],"study_design_scores_gemma":[0.00035834016,0.0011555289,0.0043038833,0.00012485901,0.00023022125,0.00087803433,0.0001976117,0.7751987,0.12461727,0.048692614,0.044126216,0.00011666166],"about_ca_topic_score_codex":0.0018095082,"about_ca_topic_score_gemma":0.004733596,"teacher_disagreement_score":0.006550619,"about_ca_system_score_codex":0.0006597812,"about_ca_system_score_gemma":0.0006836597,"threshold_uncertainty_score":0.021913946},"labels":[],"label_agreement":null},{"id":"W2592494687","doi":"","title":"On (s, t)-relaxed L(2, 1)-labelings of the hexagonal lattice.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"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":"Mathematics; Hexagonal crystal system; Combinatorics; Lattice (music); Hexagonal lattice; Crystallography; Condensed matter physics; Physics; Chemistry","score_opus":0.016875481841668774,"score_gpt":0.2675578239069637,"score_spread":0.25068234206529494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592494687","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.46823516,0.0012662528,0.3572376,0.002125315,0.0006592278,0.00021308544,0.0031440435,0.0014314492,0.16568789],"genre_scores_gemma":[0.8144952,0.0006542374,0.1452213,0.00075856864,0.00018751,0.00024564093,0.0029791668,0.0005194439,0.034938976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989447,0.00038453692,0.00006644335,0.00013002502,0.00021372648,0.00026055757],"domain_scores_gemma":[0.99830496,0.0006429219,0.00021456426,0.00040439016,0.0002055586,0.00022765437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064884,0.0004679421,0.00062168844,0.0009504207,0.0016524319,0.0025029916,0.001207437,0.0009987378,0.0123702735],"category_scores_gemma":[0.00322819,0.00042004793,0.0006387724,0.0012395704,0.0014583139,0.0023857187,0.0017277901,0.0017509201,0.0021782315],"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.00030473326,0.000057796202,0.0005040776,0.00013692088,0.000017625736,0.00016994767,0.00024982714,0.015644977,0.002989167,0.9436327,0.011238417,0.025053643],"study_design_scores_gemma":[0.0000598192,0.00004466565,0.00026464264,0.00004230109,0.000009359322,0.00013656236,0.00023884384,0.047039993,0.0017788394,0.9415012,0.008855493,0.000028246995],"about_ca_topic_score_codex":0.0033126525,"about_ca_topic_score_gemma":0.005543634,"teacher_disagreement_score":0.0123702735,"about_ca_system_score_codex":0.0011489969,"about_ca_system_score_gemma":0.000854357,"threshold_uncertainty_score":0.04138261},"labels":[],"label_agreement":null},{"id":"W2605538923","doi":"10.1049/iet-ipr.2016.0630","title":"Localisation of topological features using 3D object representations","year":2017,"lang":"en","type":"article","venue":"IET Image Processing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Object (grammar); Computer science; Computer vision; Topology (electrical circuits); Artificial intelligence; Mathematics; Combinatorics","score_opus":0.04852715598312905,"score_gpt":0.36523653418711505,"score_spread":0.316709378203986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605538923","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.02747536,0.00010725932,0.96950287,0.000057974852,0.000020263553,0.000042164975,0.00013150914,0.00097255997,0.0016899399],"genre_scores_gemma":[0.36619896,0.0003661601,0.62976074,0.00005929983,0.000035426096,0.00012104805,0.0007742831,0.00028539263,0.002398622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996667,0.000050666815,0.000019631096,0.000079505335,0.00013271434,0.00005077623],"domain_scores_gemma":[0.999524,0.00012299242,0.00006468062,0.0001409697,0.00011486677,0.00003244904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039180493,0.00051905843,0.00065272476,0.003797301,0.00030270056,0.0027048346,0.00088119373,0.00086425233,0.002890415],"category_scores_gemma":[0.001402893,0.00042538167,0.00076029013,0.0016159628,0.0008284599,0.0018336873,0.0018948762,0.0005131129,0.0012338173],"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.00027620792,0.000093045164,0.0021290015,0.00044716144,0.00008327614,0.0007491831,0.0011185345,0.09854899,0.20446302,0.11382157,0.003021662,0.5752484],"study_design_scores_gemma":[0.000027064141,0.00014893542,0.0036105746,0.00007663278,0.00005760291,0.0010456141,0.0005028376,0.83423245,0.08261914,0.056846265,0.020724488,0.00010839519],"about_ca_topic_score_codex":0.00094158505,"about_ca_topic_score_gemma":0.0006606795,"teacher_disagreement_score":0.003797301,"about_ca_system_score_codex":0.00047735422,"about_ca_system_score_gemma":0.0004402347,"threshold_uncertainty_score":0.0096693635},"labels":[],"label_agreement":null},{"id":"W2609386485","doi":"10.1090/amsip/025/16","title":"On the connectedness and classification of self-affine tiles","year":2002,"lang":"en","type":"book-chapter","venue":"AMS/IP studies in advanced mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Social connectedness; Affine transformation; Computer science; Mathematics; Pure mathematics; Psychology; Social psychology","score_opus":0.07942916936167625,"score_gpt":0.3153613817385345,"score_spread":0.23593221237685824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609386485","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.6836685,0.0052693738,0.1432846,0.0012584231,0.00038801384,0.000096522905,0.00065459416,0.0003149923,0.16506493],"genre_scores_gemma":[0.924407,0.0029709726,0.036020875,0.0002588141,0.0005670276,0.00007796633,0.0013347223,0.00018347419,0.03417917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997197,0.00003983817,0.00002163984,0.00010691112,0.00007502163,0.00003678078],"domain_scores_gemma":[0.9987968,0.0006550984,0.00014856727,0.0001494201,0.000114012975,0.00013596217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039859704,0.0005621028,0.0007812637,0.0032368,0.0011855684,0.0026579848,0.00087830896,0.00074964826,0.0056339344],"category_scores_gemma":[0.0020703804,0.0005480437,0.0006380234,0.0023810023,0.0036197451,0.0038377938,0.0016838401,0.0022020652,0.00057013007],"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.00008556877,0.000032182776,0.0019806009,0.00012217562,0.00001417279,0.00014384923,0.0008652931,0.0035254902,0.0031622732,0.9527453,0.0024208974,0.03490217],"study_design_scores_gemma":[0.000012798369,0.000046508772,0.0029714152,0.00004256333,0.000016773714,0.00032508653,0.00027061751,0.0068434216,0.0012733801,0.9796886,0.008493464,0.000015355787],"about_ca_topic_score_codex":0.0007729576,"about_ca_topic_score_gemma":0.0007333091,"teacher_disagreement_score":0.0056339344,"about_ca_system_score_codex":0.00069569936,"about_ca_system_score_gemma":0.00018592752,"threshold_uncertainty_score":0.018847346},"labels":[],"label_agreement":null},{"id":"W2726040086","doi":"10.1111/cgf.13166","title":"Compactly Supported Biorthogonal Wavelet Bases on the Body Centered Cubic Lattice","year":2017,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Biorthogonal system; Wavelet; Biorthogonal wavelet; Lattice (music); Computer science; Cubic crystal system; Cartesian coordinate system; Algorithm; Wavelet transform; Mathematics; Artificial intelligence; Geometry; Physics; Acoustics; Condensed matter physics","score_opus":0.04075877410744571,"score_gpt":0.28697188166631116,"score_spread":0.24621310755886544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726040086","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.0683726,0.0002467887,0.9246664,0.00019412274,0.000090145295,0.000024256076,0.00008092371,0.00029641966,0.006028397],"genre_scores_gemma":[0.5302812,0.0006975497,0.46264935,0.00017863447,0.0000662706,0.00008277539,0.00026509655,0.00014235299,0.0056367917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977905,0.000039430874,0.000009111763,0.00001640674,0.00013414623,0.00002191465],"domain_scores_gemma":[0.9994814,0.00014783817,0.000047364218,0.00009000827,0.00019316979,0.000040289062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034391176,0.0002918132,0.00034224842,0.00045608627,0.00018668713,0.0007451007,0.0003535874,0.00034477314,0.0018412969],"category_scores_gemma":[0.001067314,0.00013559278,0.00018135377,0.0005153489,0.00052819663,0.00059866963,0.00037653447,0.0007157773,0.0007022504],"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.00039732907,0.0001368844,0.0006546887,0.00024320667,0.00002801559,0.00037441877,0.00028509903,0.2664755,0.13812555,0.32298443,0.006666758,0.2636282],"study_design_scores_gemma":[0.00003163648,0.00008873161,0.00025938533,0.000022586211,0.0000053009007,0.000177882,0.000092715425,0.9407442,0.018510992,0.03248204,0.0075634574,0.000021050937],"about_ca_topic_score_codex":0.0010164924,"about_ca_topic_score_gemma":0.00078532303,"teacher_disagreement_score":0.0018412969,"about_ca_system_score_codex":0.00019793077,"about_ca_system_score_gemma":0.0003541709,"threshold_uncertainty_score":0.0061597824},"labels":[],"label_agreement":null},{"id":"W2759503368","doi":"","title":"Degree Associated Reconstruction Number of Graphs with Regular Pruned Graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"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":"Mathematics; Combinatorics; Degree (music); Graph","score_opus":0.018788404857681094,"score_gpt":0.2594117058226955,"score_spread":0.24062330096501441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759503368","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.8067508,0.00067809416,0.1502795,0.0015833228,0.00019784238,0.00007418963,0.001582731,0.0007382189,0.03811531],"genre_scores_gemma":[0.95892614,0.00031640378,0.032123644,0.00012652151,0.000052666564,0.00004651883,0.0010463978,0.00013052602,0.0072312155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995321,0.000100885474,0.00001773946,0.00012764374,0.00012667384,0.000095031704],"domain_scores_gemma":[0.99698824,0.0016433581,0.00031605506,0.00047262316,0.00029026644,0.00028957464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004380671,0.000332192,0.00037135393,0.0010382145,0.0008055215,0.0011971599,0.00092270435,0.00076109625,0.0085839275],"category_scores_gemma":[0.0053000897,0.0002535182,0.00030323752,0.0007177038,0.00080100546,0.0013879958,0.000736465,0.00082031736,0.0007647379],"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.0014859561,0.00031310375,0.014444346,0.0008223884,0.00014983577,0.0009595842,0.0009963929,0.13174509,0.048432503,0.6387643,0.031380598,0.13050596],"study_design_scores_gemma":[0.00011320482,0.00023565152,0.011724188,0.000120951256,0.00015482566,0.0018626526,0.0007218718,0.45723823,0.029514825,0.48131654,0.01692257,0.00007443238],"about_ca_topic_score_codex":0.0011460782,"about_ca_topic_score_gemma":0.0019464466,"teacher_disagreement_score":0.0085839275,"about_ca_system_score_codex":0.0007501417,"about_ca_system_score_gemma":0.0005415569,"threshold_uncertainty_score":0.028716087},"labels":[],"label_agreement":null},{"id":"W2793169977","doi":"10.1016/j.topol.2018.02.020","title":"Cell structures and topologically complete spaces","year":2018,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Metric space; Topological space; Convergence (economics); Inverse; Class (philosophy); Topological conjugacy; Pure mathematics; Discrete mathematics; Topology (electrical circuits); Combinatorics; Geometry; Computer science","score_opus":0.022203606868988934,"score_gpt":0.2846946762651139,"score_spread":0.262491069396125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793169977","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.4586424,0.009498402,0.47319227,0.0033791456,0.00033322276,0.000062499974,0.00073582743,0.00019590624,0.053960305],"genre_scores_gemma":[0.93105745,0.0046629626,0.04459855,0.00035173676,0.0005437025,0.0001406808,0.0008878561,0.00006588655,0.017691087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995326,0.00012933873,0.00002729418,0.000092764945,0.00016391056,0.00005407176],"domain_scores_gemma":[0.9975654,0.0011240346,0.00039251093,0.0001980808,0.000399008,0.00032096697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007719028,0.0005988545,0.00062834396,0.0028854692,0.001313094,0.004180725,0.00081387593,0.001053069,0.0030905716],"category_scores_gemma":[0.0033819587,0.00042171055,0.00039317508,0.002057399,0.003963458,0.0052166576,0.0019218982,0.001667976,0.0004252525],"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.00001495254,0.000008917506,0.00020109322,0.00002524193,0.000005671935,0.000043904012,0.00024413425,0.0014475745,0.00056152215,0.992993,0.00045043323,0.0040036873],"study_design_scores_gemma":[0.0000064695664,0.0000130353,0.0002151714,0.000007782472,0.0000047368303,0.000066713714,0.00013795155,0.0053094625,0.00030015863,0.98978627,0.004143975,0.0000082783245],"about_ca_topic_score_codex":0.0010446217,"about_ca_topic_score_gemma":0.0010592665,"teacher_disagreement_score":0.004180725,"about_ca_system_score_codex":0.0008264797,"about_ca_system_score_gemma":0.0004979486,"threshold_uncertainty_score":0.010338962},"labels":[],"label_agreement":null},{"id":"W2793210096","doi":"","title":"The Local Diagnosability of k-Ary n-Cube.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Mathematics; Cube (algebra); Combinatorics; Arithmetic","score_opus":0.010660461349014237,"score_gpt":0.2593311247027864,"score_spread":0.24867066335377216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793210096","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.4110738,0.0020530033,0.50948507,0.0020739178,0.0002770307,0.0001266011,0.0016679994,0.0011684976,0.07207416],"genre_scores_gemma":[0.9694157,0.0003713117,0.021606112,0.00019224508,0.000095492964,0.0000902382,0.00069226156,0.00007635373,0.007460353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990557,0.00017644378,0.0000754957,0.00024629332,0.00027972212,0.00016630905],"domain_scores_gemma":[0.99673426,0.0018127002,0.00034548275,0.0005317109,0.00031340262,0.0002624087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007051935,0.0003802079,0.00065654895,0.0006856482,0.0007694003,0.002300616,0.00107693,0.00067008194,0.0073217424],"category_scores_gemma":[0.0051090154,0.00025658996,0.0007310264,0.0006963216,0.0021312372,0.0033219163,0.0022718844,0.0016007699,0.0007426458],"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.00042918025,0.000054564098,0.002021412,0.00039040932,0.00007954914,0.00062479853,0.0005338291,0.04243115,0.008670354,0.9008326,0.0050089965,0.03892315],"study_design_scores_gemma":[0.00004421275,0.000067734756,0.00081519055,0.000044449334,0.000039191775,0.0004159383,0.00019884823,0.0678968,0.0045737624,0.9220128,0.0038615346,0.000029640607],"about_ca_topic_score_codex":0.001608808,"about_ca_topic_score_gemma":0.001496248,"teacher_disagreement_score":0.0073217424,"about_ca_system_score_codex":0.0013189581,"about_ca_system_score_gemma":0.00084797613,"threshold_uncertainty_score":0.024493694},"labels":[],"label_agreement":null},{"id":"W2805581493","doi":"10.1111/cgf.13359","title":"String Art: Towards Computational Fabrication of String Images","year":2018,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; String (physics); Computation; Set (abstract data type); Graph; Computer graphics (images); Fuse (electrical); Theoretical computer science; Image (mathematics); Artificial intelligence; Computer vision; Algorithm; Mathematics; Engineering; Programming language","score_opus":0.016704615334107734,"score_gpt":0.26943573822972455,"score_spread":0.25273112289561683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805581493","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.0082950415,0.000060852926,0.9870515,0.000081960716,0.000033503202,0.000038794926,0.00003685321,0.0010338996,0.0033676862],"genre_scores_gemma":[0.12760106,0.000106112006,0.8690811,0.0000719878,0.000023785738,0.000079482714,0.00011659526,0.00040189573,0.0025180364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958235,0.000069743226,0.000020608784,0.00010837517,0.0001843791,0.000034559067],"domain_scores_gemma":[0.99944884,0.00020816555,0.00004864796,0.00018976443,0.00007244495,0.00003215173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043925297,0.00059666706,0.0007021871,0.0006840462,0.0004914325,0.0013129702,0.0015719892,0.0008380648,0.0077929115],"category_scores_gemma":[0.0012519177,0.0005393611,0.0010953263,0.0004777204,0.0014323306,0.0014888934,0.0015772418,0.0012071219,0.0013235487],"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.00021025422,0.00014353203,0.00069909147,0.0005964348,0.00010646942,0.0004010727,0.00037794668,0.40534875,0.097838156,0.192905,0.0068341037,0.29453918],"study_design_scores_gemma":[0.000024813882,0.000056176585,0.00018164469,0.000021742893,0.000011674181,0.00011682196,0.000046283072,0.9324134,0.021431483,0.034473497,0.011203278,0.000019109219],"about_ca_topic_score_codex":0.0008471742,"about_ca_topic_score_gemma":0.001103034,"teacher_disagreement_score":0.0077929115,"about_ca_system_score_codex":0.0005091803,"about_ca_system_score_gemma":0.00046655402,"threshold_uncertainty_score":0.02606994},"labels":[],"label_agreement":null},{"id":"W2810835895","doi":"10.7546/nntdm.2018.24.2.1-5","title":"The system of prime coordinates assigned to the positive integers","year":2018,"lang":"en","type":"article","venue":"Notes on Number Theory and Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Prime (order theory); Mathematics; Combinatorics; Computer science","score_opus":0.00977222975284659,"score_gpt":0.27297753620704296,"score_spread":0.2632053064541964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810835895","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.24890785,0.0015441837,0.55900055,0.0015168155,0.0015581617,0.00021282793,0.00066226535,0.0008111092,0.18578635],"genre_scores_gemma":[0.84288895,0.0012058238,0.1189817,0.00033541504,0.00067371613,0.0002301186,0.0004227954,0.00030352548,0.034957904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902344,0.00024469732,0.00003678704,0.00028884105,0.0002431882,0.00016301771],"domain_scores_gemma":[0.99946064,0.00012919457,0.00010536451,0.00009638244,0.00014305487,0.00006542599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006728416,0.00062587886,0.00048043302,0.0016147346,0.0016349738,0.003317067,0.0007821774,0.0005923914,0.0071492405],"category_scores_gemma":[0.0025279329,0.00037543286,0.00042398984,0.0012987711,0.0044341,0.0019431167,0.0014899741,0.0020440056,0.002170561],"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.000027544855,0.000003749937,0.0001180095,0.000014011402,0.0000019521508,0.00007079351,0.00010752811,0.00074318395,0.0014587954,0.98962396,0.0008863514,0.0069440235],"study_design_scores_gemma":[0.000038183425,0.000114268936,0.00038544147,0.000024606,0.000013871917,0.00040888903,0.00016106392,0.007906958,0.004852784,0.9443283,0.041721348,0.000044347056],"about_ca_topic_score_codex":0.0007977027,"about_ca_topic_score_gemma":0.0004165767,"teacher_disagreement_score":0.0071492405,"about_ca_system_score_codex":0.0011977736,"about_ca_system_score_gemma":0.0009772172,"threshold_uncertainty_score":0.023916602},"labels":[],"label_agreement":null},{"id":"W2902474828","doi":"10.1109/mmsp.2018.8547142","title":"SPmat: A Framework and Data Representation for Binary Image Processing","year":2018,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Binary number; Pixel; Representation (politics); Software; Image processing; Margin (machine learning); Binary image; Computation; Implementation; Theoretical computer science; Image (mathematics); Algorithm; Pattern recognition (psychology); Artificial intelligence; Machine learning; Programming language; Mathematics","score_opus":0.07227649858499395,"score_gpt":0.3963456391089663,"score_spread":0.32406914052397234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902474828","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.00061782374,0.00009849918,0.99484986,0.000047037178,0.000038917395,0.00003773856,0.0003425196,0.0034471569,0.0005204414],"genre_scores_gemma":[0.01372496,0.00028814084,0.98113006,0.000091008165,0.00006329469,0.00026058976,0.0016801393,0.0015163732,0.001245365],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988004,0.00016904956,0.00013260351,0.00019523842,0.00060538226,0.00009729925],"domain_scores_gemma":[0.99865097,0.00027940038,0.0001251711,0.00046491693,0.00039632825,0.000083277424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010042585,0.0012540795,0.0011284691,0.0025413479,0.00071525975,0.00358236,0.0033284824,0.0015739085,0.011012916],"category_scores_gemma":[0.0047411188,0.00090713473,0.0014474846,0.0034842435,0.0012701228,0.0039271633,0.0028637974,0.0024742773,0.009387844],"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.0004993211,0.00012971435,0.0007338215,0.0009427821,0.00012520608,0.00046543244,0.00036201277,0.055550434,0.058487687,0.16897158,0.05732003,0.656412],"study_design_scores_gemma":[0.000084315456,0.00021631287,0.000721611,0.00015566158,0.000069171634,0.0014737454,0.00012824145,0.5918467,0.076061934,0.1753351,0.15373981,0.00016746794],"about_ca_topic_score_codex":0.0016964751,"about_ca_topic_score_gemma":0.0017441631,"teacher_disagreement_score":0.011012916,"about_ca_system_score_codex":0.00059648056,"about_ca_system_score_gemma":0.0013673987,"threshold_uncertainty_score":0.03684187},"labels":[],"label_agreement":null},{"id":"W29075377","doi":"10.4300/jgme-d-16-00864.1","title":"Graph Reconstruction by Permutations.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Mathematics; Graph; Combinatorics","score_opus":0.01229706004766689,"score_gpt":0.23337963329807887,"score_spread":0.22108257325041197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29075377","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.01010976,0.00050907204,0.94239855,0.00061157515,0.0004371083,0.0003194318,0.0067535057,0.016540285,0.022320768],"genre_scores_gemma":[0.14708944,0.00081037404,0.7866383,0.0004278862,0.00018996574,0.0006957636,0.019991457,0.005745231,0.038411546],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894303,0.00025504033,0.000084261694,0.0003374034,0.00026087812,0.000119358665],"domain_scores_gemma":[0.9976726,0.00078518904,0.00013049059,0.0010101035,0.00031118758,0.0000903725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013336145,0.0012371913,0.00079839816,0.0033997775,0.0010265798,0.0022370962,0.0012479596,0.0010798399,0.05612368],"category_scores_gemma":[0.008095664,0.00072398735,0.0019681472,0.0022545413,0.00096756517,0.002459565,0.0027704532,0.0018756917,0.021916172],"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.00056388706,0.00019696848,0.0022880451,0.0009931524,0.00024139551,0.0005466888,0.0006684209,0.013165149,0.008837657,0.19234799,0.12939718,0.6507535],"study_design_scores_gemma":[0.00016477896,0.00011985466,0.00161928,0.00021709148,0.00015606581,0.0010511231,0.0005021639,0.14202559,0.012260705,0.5719804,0.2698277,0.00007522125],"about_ca_topic_score_codex":0.0024300122,"about_ca_topic_score_gemma":0.0053771134,"teacher_disagreement_score":0.05612368,"about_ca_system_score_codex":0.00056053174,"about_ca_system_score_gemma":0.0012647815,"threshold_uncertainty_score":0.18775237},"labels":[],"label_agreement":null},{"id":"W2911268076","doi":"10.1016/j.jalgebra.2019.01.023","title":"Corrigendum to “The recognition problem for table algebras and reality-based algebras” [J. Algebra 479 (2017) 173–191]","year":2019,"lang":"en","type":"erratum","venue":"Journal of Algebra","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Table (database); Algebra over a field; Pure mathematics; Computer science; Data mining","score_opus":0.04292851723323887,"score_gpt":0.28229131956910614,"score_spread":0.23936280233586726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911268076","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026795792,0.00517986,0.0036231114,0.09300321,0.86933345,0.00005071037,0.0016588827,0.000710615,0.026172213],"genre_scores_gemma":[0.016145654,0.014862824,0.008821388,0.0924848,0.32559645,0.00028072702,0.0060732504,0.0020293777,0.53370553],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99637884,0.0007014863,0.00044828915,0.00071637495,0.001479803,0.00027522468],"domain_scores_gemma":[0.9885311,0.0026541732,0.00042349807,0.0010273689,0.0069057853,0.00045804356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025288598,0.0019117612,0.002348948,0.0043879994,0.0036702522,0.0041599497,0.003221172,0.0044356957,0.13844243],"category_scores_gemma":[0.02464634,0.00096132647,0.002693179,0.003153056,0.0027864752,0.004992561,0.0025481428,0.006285075,0.059347168],"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.000012835325,0.000005813502,0.000024683985,0.000071985465,0.000009445186,0.00005601611,0.000017641487,0.00003672309,0.000030622254,0.0038357559,0.99230886,0.0035896206],"study_design_scores_gemma":[0.000028857157,0.000019534262,0.0005375182,0.00019173203,0.000035690227,0.00028089542,0.00005804908,0.00046119327,0.00026098444,0.01791453,0.9801602,0.00005078044],"about_ca_topic_score_codex":0.020945018,"about_ca_topic_score_gemma":0.027093979,"teacher_disagreement_score":0.13844243,"about_ca_system_score_codex":0.0056992564,"about_ca_system_score_gemma":0.003251445,"threshold_uncertainty_score":0.46313608},"labels":[],"label_agreement":null},{"id":"W2911401455","doi":"","title":"Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery","year":2009,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Digital geometry; Computer graphics (images); Geometry; Artificial intelligence; Computer science; Geography; Mathematics; Remote sensing; Image (mathematics); Image processing; Digital image","score_opus":0.024294330821938433,"score_gpt":0.2887976157777737,"score_spread":0.26450328495583525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911401455","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02516129,0.01942246,0.7957935,0.006764927,0.01920271,0.00015955982,0.00076560007,0.0020801583,0.1306499],"genre_scores_gemma":[0.19330037,0.022891952,0.4857027,0.0010187548,0.0072760265,0.00014954517,0.0030861686,0.0017557782,0.28481877],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994981,0.00012933748,0.000024638372,0.00009867189,0.0002114031,0.000037793376],"domain_scores_gemma":[0.99891126,0.00026034765,0.000028714801,0.00029705314,0.00035427004,0.00014832804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090782385,0.0007124654,0.0014407083,0.0010912337,0.0006849363,0.0028449479,0.0010058125,0.0006186238,0.024379488],"category_scores_gemma":[0.0016103367,0.00034575863,0.0007223024,0.0009366741,0.001008246,0.001224887,0.0012273074,0.0018202715,0.0057637454],"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.00045089243,0.00028484358,0.0016384209,0.00042805864,0.00018814465,0.00029724027,0.00041267648,0.010508939,0.02066566,0.10560484,0.28438172,0.57513857],"study_design_scores_gemma":[0.00007192968,0.00026273425,0.004785951,0.00023419829,0.00011911374,0.0011525555,0.00035444406,0.12065903,0.01653744,0.09584474,0.7599102,0.00006755758],"about_ca_topic_score_codex":0.0026054198,"about_ca_topic_score_gemma":0.0050831446,"teacher_disagreement_score":0.024379488,"about_ca_system_score_codex":0.0007504985,"about_ca_system_score_gemma":0.0007874502,"threshold_uncertainty_score":0.08155751},"labels":[],"label_agreement":null},{"id":"W2943842518","doi":"10.1007/978-3-030-24766-9_29","title":"Efficient Second-Order Shape-Constrained Function Fitting","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convexity; Mathematics; Monotonic function; Lipschitz continuity; Combinatorics; Function (biology); Norm (philosophy); Concave function; Linear programming; Simple (philosophy); Generalization; Regular polygon; Range (aeronautics); Convex function; Algorithm; Discrete mathematics; Mathematical optimization; Pure mathematics; Mathematical analysis","score_opus":0.014993862704939924,"score_gpt":0.26059939465395926,"score_spread":0.24560553194901932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943842518","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.006852073,0.00014188782,0.98868144,0.0000869395,0.000037410722,0.000022727807,0.00010538176,0.0014280279,0.0026440623],"genre_scores_gemma":[0.19711345,0.00032679082,0.78251624,0.00019411226,0.0000691862,0.00013290941,0.0010574814,0.0020367145,0.016553095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991097,0.00012724785,0.000031850606,0.00010709868,0.00051616295,0.00010792363],"domain_scores_gemma":[0.9988207,0.00040403364,0.000070114,0.0003767685,0.00024412751,0.00008423065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081939076,0.0013890966,0.0016963345,0.00117201,0.00072095514,0.0022979216,0.0021715485,0.0022844337,0.009031411],"category_scores_gemma":[0.0036283024,0.00096481555,0.0015307049,0.00193615,0.00059300545,0.0015500608,0.0024102104,0.0021124794,0.006353448],"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.00051993784,0.00020870722,0.0013422732,0.0002937887,0.00013727891,0.00029412625,0.00022971352,0.3291623,0.06609355,0.044379912,0.0129693365,0.5443691],"study_design_scores_gemma":[0.000009955266,0.000018161376,0.00020992565,0.000007535872,0.000007976497,0.00009822292,0.000019044686,0.98133427,0.008229506,0.006531804,0.0035169027,0.000016647227],"about_ca_topic_score_codex":0.0035839193,"about_ca_topic_score_gemma":0.00567855,"teacher_disagreement_score":0.009031411,"about_ca_system_score_codex":0.00086038647,"about_ca_system_score_gemma":0.0018443194,"threshold_uncertainty_score":0.030213118},"labels":[],"label_agreement":null},{"id":"W2947620650","doi":"10.2478/ausm-2018-0020","title":"Rejection sampling of bipartite graphs with given degree sequence","year":2018,"lang":"en","type":"article","venue":"Acta Universitatis Sapientiae Mathematica","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bipartite graph; Combinatorics; Realization (probability); Mathematics; Degree (music); Graph; Simple graph; Sequence (biology); Discrete mathematics; Simple (philosophy); Algorithm; Physics; Statistics; Chemistry","score_opus":0.0494297598575283,"score_gpt":0.27521231283853476,"score_spread":0.22578255298100647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947620650","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.24778771,0.00013697003,0.7470712,0.00039038446,0.00005906674,0.00025492278,0.00041538736,0.0012416014,0.0026427698],"genre_scores_gemma":[0.8145519,0.00006912997,0.17987052,0.00024824767,0.00005475995,0.00028029754,0.0013252111,0.00023531294,0.003364727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730253,0.0014195879,0.00008316284,0.0005101729,0.00044102108,0.00024344024],"domain_scores_gemma":[0.98980814,0.006277922,0.00069691084,0.001988605,0.0007296723,0.0004987689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020767644,0.00071848324,0.00087431853,0.0008115991,0.00063646806,0.0009100756,0.0015806976,0.0011608282,0.0037442946],"category_scores_gemma":[0.012029601,0.0005595768,0.0009602349,0.00067591213,0.0011568752,0.0014007697,0.0013506918,0.0011273362,0.00082779396],"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.0039540855,0.00058921066,0.014149797,0.00057128194,0.0002846795,0.0009821681,0.00077441346,0.621845,0.057117056,0.16235961,0.009081921,0.12829076],"study_design_scores_gemma":[0.000115695635,0.000094366354,0.0005985211,0.000011228892,0.000015661419,0.00010534749,0.00004328465,0.94719094,0.004630285,0.046177134,0.001002014,0.000015494821],"about_ca_topic_score_codex":0.0014403831,"about_ca_topic_score_gemma":0.0018687797,"teacher_disagreement_score":0.0037442946,"about_ca_system_score_codex":0.0007592407,"about_ca_system_score_gemma":0.0005762961,"threshold_uncertainty_score":0.012525916},"labels":[],"label_agreement":null},{"id":"W2950566000","doi":"10.1137/1.9781611973082.86","title":"New Approximation Algorithms for Minimum Enclosing Convex Shapes","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regular polygon; Algorithm; Computer science; Approximation algorithm; Mathematics; Geometry","score_opus":0.06960156800308266,"score_gpt":0.30765789326178217,"score_spread":0.23805632525869952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950566000","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.0036920775,0.0002547884,0.9936724,0.00011037691,0.000034250774,0.00003422237,0.000057573212,0.00047511194,0.0016691629],"genre_scores_gemma":[0.07290078,0.00048354204,0.92197055,0.00012027054,0.000088700544,0.00023732966,0.0005297966,0.00037640054,0.003292702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981401,0.0002960986,0.0001157006,0.00032222012,0.0009453196,0.00018054151],"domain_scores_gemma":[0.99748945,0.0011566362,0.00024400563,0.0005761865,0.00041016322,0.00012365791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001633544,0.0015593346,0.0019034686,0.0020145434,0.00061338244,0.0021229852,0.0030172362,0.0019949954,0.0041547935],"category_scores_gemma":[0.010035471,0.0011205134,0.0017792458,0.0026521322,0.001399511,0.0038546384,0.004055037,0.0039790766,0.0018968568],"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.00027746835,0.00014427041,0.00090437103,0.00026545665,0.0000546989,0.00012942385,0.00031006362,0.5355512,0.0058611766,0.13579433,0.00986247,0.31084508],"study_design_scores_gemma":[0.000024350269,0.00003143145,0.00007835821,0.000021689159,0.0000061617284,0.000069979884,0.000026491496,0.96225125,0.0012146975,0.032607585,0.0036579731,0.000010073572],"about_ca_topic_score_codex":0.0026186113,"about_ca_topic_score_gemma":0.0028414691,"teacher_disagreement_score":0.0041547935,"about_ca_system_score_codex":0.0016202589,"about_ca_system_score_gemma":0.0011024221,"threshold_uncertainty_score":0.013899207},"labels":[],"label_agreement":null},{"id":"W2952404043","doi":"10.48550/arxiv.math/0408396","title":"Collinear Points in Permutations","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Conjecture; Combinatorics; Transversal (combinatorics); Mathematics; Prime (order theory); Intersection (aeronautics); Upper and lower bounds; Geometry; Mathematical analysis; Geography","score_opus":0.05032798172890329,"score_gpt":0.3089663246054716,"score_spread":0.2586383428765683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952404043","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.6010242,0.0022338624,0.30510986,0.004254577,0.00062049815,0.00012917728,0.0006976967,0.00054045505,0.08538968],"genre_scores_gemma":[0.9367897,0.0009058153,0.048250787,0.0005139421,0.00030120145,0.00011339198,0.0005700198,0.00011752886,0.01243772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837035,0.00038227154,0.00012043469,0.00048490003,0.00027470724,0.00036734078],"domain_scores_gemma":[0.9970571,0.001380922,0.00043744,0.0005572192,0.00029396635,0.00027347656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011343424,0.0006025353,0.0009065523,0.001718977,0.0039616567,0.0028536033,0.00078037125,0.0021146387,0.011124799],"category_scores_gemma":[0.0066156876,0.00055729866,0.0007996476,0.0022753305,0.0038037223,0.007168036,0.0036222637,0.0022006845,0.0021707406],"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.00015111937,0.00003075266,0.0017484414,0.000085683925,0.000017022765,0.00047116072,0.00069807883,0.002844371,0.0021623482,0.9644589,0.0027534927,0.024578713],"study_design_scores_gemma":[0.000012127229,0.00003753254,0.0002698889,0.000024105091,0.000008091669,0.00032436062,0.0005232781,0.003553293,0.0008971233,0.98660904,0.0077244355,0.000016780261],"about_ca_topic_score_codex":0.000847271,"about_ca_topic_score_gemma":0.0009639812,"teacher_disagreement_score":0.011124799,"about_ca_system_score_codex":0.0009741686,"about_ca_system_score_gemma":0.00049794343,"threshold_uncertainty_score":0.037216127},"labels":[],"label_agreement":null},{"id":"W2952622791","doi":"10.48550/arxiv.0710.0911","title":"Discrete sets with minimal moment of inertia","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Moment (physics); Moment of inertia; Physics; Classical mechanics","score_opus":0.039169391166335804,"score_gpt":0.3002340408489384,"score_spread":0.26106464968260257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952622791","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.504247,0.0029321597,0.26249516,0.0055862865,0.0013830307,0.00008257863,0.0010985562,0.0005573268,0.22161789],"genre_scores_gemma":[0.96705776,0.00048429024,0.015956383,0.00026399197,0.00091048004,0.000053038362,0.00038242873,0.00009394288,0.014797611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999154,0.00012692902,0.00004935022,0.00021465174,0.00029811417,0.00015701291],"domain_scores_gemma":[0.99815637,0.0007770717,0.0002346297,0.00027792613,0.00023138389,0.00032253156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052832195,0.00036930857,0.0009110082,0.0021286153,0.0013283379,0.0029235473,0.00078218,0.00087392214,0.0061487216],"category_scores_gemma":[0.0021606886,0.0003328038,0.00087416114,0.00093894894,0.0029603972,0.0026606824,0.0023929498,0.0018858586,0.0007031213],"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.000047142403,0.000009579616,0.00012229056,0.000041375,0.0000060156563,0.0000706435,0.00011866833,0.00043934616,0.0015567011,0.9923844,0.0011533562,0.004050584],"study_design_scores_gemma":[0.000024854737,0.00003908633,0.0005750519,0.000017041391,0.000009653588,0.0002683792,0.00007879889,0.0046489867,0.0012774008,0.9848333,0.008208727,0.000018745994],"about_ca_topic_score_codex":0.00034238663,"about_ca_topic_score_gemma":0.00031765076,"teacher_disagreement_score":0.0061487216,"about_ca_system_score_codex":0.0010696643,"about_ca_system_score_gemma":0.0003425156,"threshold_uncertainty_score":0.020569563},"labels":[],"label_agreement":null},{"id":"W2955458186","doi":"10.1287/ijoo.2019.0030","title":"Data Association via Set Packing for Computer Vision Applications","year":2020,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Association (psychology); Computer science; Set (abstract data type); Data association; Artificial intelligence; Data set; Computer vision; Filter (signal processing); Psychology","score_opus":0.047258966436400957,"score_gpt":0.3207108771548662,"score_spread":0.2734519107184652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955458186","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.0030690057,0.0011421198,0.99183357,0.00041009087,0.00010354432,0.00015290124,0.00018626092,0.0003231235,0.0027794633],"genre_scores_gemma":[0.12015521,0.003173141,0.8687512,0.00048480878,0.00045831708,0.0008067761,0.0012614278,0.00029649845,0.004612677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963251,0.0016150326,0.00023834694,0.00061577244,0.000948316,0.00025741092],"domain_scores_gemma":[0.9926537,0.0046612695,0.0006921032,0.0010295394,0.0007424588,0.00022088269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032735392,0.001840263,0.0023329996,0.0020284131,0.0011168874,0.0035851113,0.0023290785,0.0020051235,0.008824345],"category_scores_gemma":[0.01299657,0.0011132259,0.0018787296,0.0059719714,0.0014260529,0.0041421466,0.0029369632,0.004617569,0.0023282997],"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.00027963612,0.00036943168,0.0010271254,0.00088726415,0.00016199746,0.00024027907,0.00019935855,0.4333434,0.0029269122,0.2032549,0.019374548,0.33793512],"study_design_scores_gemma":[0.000020773365,0.000097316064,0.00019276631,0.00006956166,0.000022686805,0.00013910985,0.000056983736,0.83683634,0.001572509,0.15297212,0.007998862,0.000020985348],"about_ca_topic_score_codex":0.00165071,"about_ca_topic_score_gemma":0.0017137121,"teacher_disagreement_score":0.008824345,"about_ca_system_score_codex":0.0018527119,"about_ca_system_score_gemma":0.002088338,"threshold_uncertainty_score":0.029520392},"labels":[],"label_agreement":null},{"id":"W2963986177","doi":"10.55016/ojs/cdm.v6i1.62075","title":"Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","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":"Agence Nationale de la Recherche","keywords":"Claw; Homogeneous; Combinatorics; Mathematics; Graph; Computer science; Biology","score_opus":0.01797061144220087,"score_gpt":0.2587732794256537,"score_spread":0.24080266798345284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963986177","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.7274151,0.0007403418,0.25281543,0.0013535634,0.000036729085,0.000077806,0.0005025006,0.00024105646,0.016817488],"genre_scores_gemma":[0.92137015,0.00034628384,0.069484085,0.00021242042,0.000058353537,0.00006898544,0.001010256,0.00007594379,0.0073735616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994357,0.00014196419,0.000036873997,0.00017795722,0.00011662119,0.00009090526],"domain_scores_gemma":[0.9985655,0.0007621956,0.00018068477,0.00023958791,0.00010307447,0.00014892947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214929,0.00041865397,0.0004195983,0.0010349271,0.000897365,0.0012845632,0.0010131892,0.0011584907,0.0031243064],"category_scores_gemma":[0.0021153027,0.0003452797,0.0006062184,0.0011381307,0.0019416701,0.0035722007,0.001408187,0.0013450377,0.00030044044],"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.00020873269,0.00010600719,0.00224552,0.00013402662,0.000028887927,0.0006293156,0.00093493355,0.020925164,0.012317214,0.92035514,0.0025078277,0.039607335],"study_design_scores_gemma":[0.00003164801,0.00010446739,0.0015136932,0.000037037382,0.000035119032,0.0010739529,0.00070575974,0.08221317,0.011485537,0.8936356,0.009128412,0.000035685756],"about_ca_topic_score_codex":0.0013021029,"about_ca_topic_score_gemma":0.0009801302,"teacher_disagreement_score":0.0031243064,"about_ca_system_score_codex":0.0007105847,"about_ca_system_score_gemma":0.00037766094,"threshold_uncertainty_score":0.010451794},"labels":[],"label_agreement":null},{"id":"W2967801514","doi":"10.1016/j.patrec.2019.07.024","title":"Supervised classification using graph-based space partitioning","year":2019,"lang":"en","type":"article","venue":"Pattern Recognition Letters","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Cardinality (data modeling); Heuristic; Computational complexity theory; Algorithm; Pattern recognition (psychology); Computer science; Artificial intelligence; Mathematical optimization; Data mining","score_opus":0.053560524661994575,"score_gpt":0.2646547422441603,"score_spread":0.21109421758216573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967801514","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.051796287,0.0004595198,0.9417669,0.00026425906,0.00009801345,0.00028307847,0.000622466,0.0023802752,0.0023292885],"genre_scores_gemma":[0.44546735,0.00029106857,0.54525137,0.00016881923,0.00010260764,0.0004520932,0.0038922152,0.00042888153,0.003945608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891376,0.00031053767,0.000056912362,0.00033595337,0.00027197294,0.00011079808],"domain_scores_gemma":[0.9986822,0.0005972751,0.00009601145,0.00023280007,0.00033032265,0.000061414925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053906895,0.00101187,0.0016702651,0.0030964732,0.0010362482,0.0014153376,0.0015614987,0.0011007714,0.002277388],"category_scores_gemma":[0.0021677879,0.00035414976,0.0015579885,0.0023419054,0.0007252428,0.0011807914,0.0011734365,0.0009636796,0.0010785979],"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.000630068,0.0005477068,0.00327317,0.00032008768,0.00027654666,0.0001563404,0.00025631595,0.19140747,0.01984337,0.014218487,0.013052498,0.7560179],"study_design_scores_gemma":[0.000028821536,0.00008118784,0.00085658475,0.000016153606,0.000036073026,0.00005687946,0.000070552414,0.97859174,0.0023749133,0.016057067,0.0018155954,0.000014380557],"about_ca_topic_score_codex":0.008406353,"about_ca_topic_score_gemma":0.009975411,"teacher_disagreement_score":0.008406353,"about_ca_system_score_codex":0.00080348464,"about_ca_system_score_gemma":0.0012840885,"threshold_uncertainty_score":0.016714811},"labels":[],"label_agreement":null},{"id":"W2979001052","doi":"10.33434/cams.541413","title":"Computable Proximity of $\\ell_1$-Discs on the Digital Plane","year":2019,"lang":"en","type":"article","venue":"Communications in Advanced Mathematical Sciences","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Jaccard index; Metric (unit); Mathematics; Plane (geometry); Characterization (materials science); Geometry; Topology (electrical circuits); Computer science; Combinatorics; Physics; Engineering; Optics; Statistics","score_opus":0.05204451787258027,"score_gpt":0.3296756248979762,"score_spread":0.27763110702539595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979001052","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.77656746,0.00063455995,0.2028033,0.0005147981,0.00007208974,0.000049069917,0.0004484808,0.00016988599,0.018740322],"genre_scores_gemma":[0.9546704,0.0003543754,0.040560484,0.00007387103,0.00007481325,0.00004273342,0.0005076786,0.000048265305,0.0036673343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989059,0.0002462989,0.00011342988,0.00027344486,0.00035632317,0.00010462054],"domain_scores_gemma":[0.99582857,0.0021613766,0.00087508,0.0003697362,0.0004198788,0.00034534236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053018297,0.00040143012,0.0008039028,0.0027929698,0.0010040087,0.004102512,0.0009076643,0.0008485585,0.003854521],"category_scores_gemma":[0.00945887,0.00026518604,0.00047337508,0.0019569993,0.002287393,0.005081748,0.0028299436,0.0012459666,0.00058611925],"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.00018189193,0.00002720837,0.0027703021,0.00016883425,0.000016532595,0.00026305285,0.0009404558,0.015104242,0.0038431003,0.9518036,0.00093887,0.023941997],"study_design_scores_gemma":[0.000029316087,0.000126909,0.0027641708,0.000093847266,0.00001795452,0.0007577313,0.00084097876,0.08003937,0.0068692486,0.8964729,0.011932702,0.000054955817],"about_ca_topic_score_codex":0.00076029415,"about_ca_topic_score_gemma":0.00045024755,"teacher_disagreement_score":0.004102512,"about_ca_system_score_codex":0.0012658463,"about_ca_system_score_gemma":0.0002919874,"threshold_uncertainty_score":0.01289463},"labels":[],"label_agreement":null},{"id":"W2980584028","doi":"","title":"Contrôle actif de la perte par transmission d'une plaque par minimisation du débit volumique","year":2000,"lang":"fr","type":"article","venue":"Knowledge UdeS (Institutional Deposit of the University of Sherbrooke)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Minimisation (clinical trials); Mathematics","score_opus":0.010408106383947515,"score_gpt":0.2082024638894063,"score_spread":0.1977943575054588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980584028","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.379845,0.0029557452,0.5860229,0.0009336808,0.0004101676,0.00034375233,0.00016870593,0.0012882927,0.02803178],"genre_scores_gemma":[0.88691145,0.0014806588,0.08728239,0.0001540832,0.000057391553,0.00021814654,0.000067094385,0.0001583686,0.023670383],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999483,0.000052774427,0.000017811888,0.00011874609,0.00027903434,0.00004870913],"domain_scores_gemma":[0.99945086,0.0002617798,0.000061815714,0.000051257146,0.00015128027,0.00002297211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006835222,0.0006253038,0.00062289415,0.00038129117,0.00040232833,0.0013615782,0.0006948787,0.00068367796,0.003989073],"category_scores_gemma":[0.0010346604,0.00032852162,0.00045241418,0.0002294728,0.00049761863,0.00064855465,0.0006031339,0.00068830134,0.00048530128],"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.000537514,0.00014073777,0.0010210136,0.0005778603,0.000039633058,0.00012621598,0.00049634965,0.063105136,0.80015355,0.004682825,0.0011386576,0.12798052],"study_design_scores_gemma":[0.000085266016,0.0011720848,0.004697335,0.00009191888,0.0000983908,0.00015502358,0.00038584077,0.3551184,0.61140394,0.0019824037,0.024719281,0.000090161986],"about_ca_topic_score_codex":0.0022070087,"about_ca_topic_score_gemma":0.0037241827,"teacher_disagreement_score":0.003989073,"about_ca_system_score_codex":0.0006181102,"about_ca_system_score_gemma":0.0005899719,"threshold_uncertainty_score":0.013344765},"labels":[],"label_agreement":null},{"id":"W2987280344","doi":"10.48550/arxiv.0904.0262","title":"Every Large Point Set contains Many Collinear Points or an Empty Pentagon","year":2009,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Pentagon; Conjecture; Combinatorics; Clique; Integer (computer science); Mathematics; Set (abstract data type); Plane (geometry); Point (geometry); Line (geometry); Discrete mathematics; Computer science; Geometry","score_opus":0.03004413244518271,"score_gpt":0.3187180300584082,"score_spread":0.2886738976132255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987280344","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.56481403,0.00093831186,0.38820753,0.0027617565,0.0002589248,0.00010203687,0.0012872949,0.0004660364,0.041164033],"genre_scores_gemma":[0.93825996,0.00071856566,0.052425962,0.0007001,0.00022080807,0.00014491487,0.0016020733,0.00013450053,0.0057930723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985159,0.0003094085,0.00007822953,0.0005045931,0.000322236,0.00026961777],"domain_scores_gemma":[0.99262685,0.0043686572,0.00072720007,0.0013189159,0.00042762488,0.0005306395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013366089,0.0007827168,0.0013879237,0.0010495526,0.0019255156,0.0032886658,0.0015974918,0.0012021816,0.006583887],"category_scores_gemma":[0.0063312077,0.00089557597,0.0015639174,0.0019110788,0.0043520182,0.0064465567,0.004968038,0.0032313494,0.0009598694],"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.0010614136,0.00009009694,0.005478055,0.00072082016,0.0001952554,0.0017799727,0.0010944027,0.03439569,0.009188591,0.91372144,0.009397162,0.022877187],"study_design_scores_gemma":[0.00011212414,0.00013463343,0.0015788367,0.00007957407,0.000082393846,0.001308242,0.0006831693,0.05058763,0.005768674,0.9286612,0.010942191,0.000061361956],"about_ca_topic_score_codex":0.00060051406,"about_ca_topic_score_gemma":0.00059600605,"teacher_disagreement_score":0.006583887,"about_ca_system_score_codex":0.0006126311,"about_ca_system_score_gemma":0.00035978158,"threshold_uncertainty_score":0.022025347},"labels":[],"label_agreement":null},{"id":"W3047403295","doi":"10.7151/dmgt.2407","title":"Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs","year":2021,"lang":"en","type":"preprint","venue":"Discussiones Mathematicae Graph Theory","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Victoria","funders":"","keywords":"Cartesian product; Bijection; Combinatorics; Mathematics; Convexity; Regular polygon; Product (mathematics); Binary number; Convex hull; Convex set; Set (abstract data type); Discrete mathematics; Convex optimization; Geometry; Arithmetic; Computer science","score_opus":0.017957794261899387,"score_gpt":0.25459006193379125,"score_spread":0.23663226767189185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047403295","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.5603524,0.0016421647,0.39494503,0.0005807876,0.000046602112,0.00014480585,0.0013596533,0.00023122625,0.04069738],"genre_scores_gemma":[0.8429614,0.0013670201,0.13875026,0.0001238893,0.000117974436,0.0002323627,0.0020499309,0.00012093462,0.014276262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916923,0.00017343798,0.0000630572,0.00022832653,0.0002493114,0.000116710355],"domain_scores_gemma":[0.99704593,0.0016846053,0.00042051097,0.00029252394,0.00033588652,0.00022052643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053815846,0.0006189405,0.0005890072,0.0028588658,0.00089237833,0.0026545804,0.0008253637,0.00044084468,0.0038557407],"category_scores_gemma":[0.0049414234,0.00062162086,0.00067327556,0.0021988782,0.002685006,0.005001024,0.0015312079,0.0011703683,0.00042777575],"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.0000668194,0.000022504119,0.0023853653,0.00010593846,0.000018523036,0.00011713845,0.0006046888,0.014810399,0.0018940088,0.9504654,0.0016866609,0.027822478],"study_design_scores_gemma":[0.000012978988,0.000025812438,0.0014351408,0.000049043043,0.000021740627,0.00029136502,0.00024382217,0.050003827,0.0032828262,0.935527,0.009080548,0.000025838472],"about_ca_topic_score_codex":0.0027620713,"about_ca_topic_score_gemma":0.0030327702,"teacher_disagreement_score":0.0038557407,"about_ca_system_score_codex":0.0015597555,"about_ca_system_score_gemma":0.0007707891,"threshold_uncertainty_score":0.012898743},"labels":[],"label_agreement":null},{"id":"W3111022228","doi":"","title":"Visualizing Riemannian Surfaces in 3D Using OpenGL","year":2018,"lang":"en","type":"article","venue":"MacEwan University Student Research Proceedings","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"OpenGL; Computer graphics (images); Surface (topology); Visualization; Computer science; Plane (geometry); Riemann surface; Geometry; Mathematics; Artificial intelligence","score_opus":0.17445365783328662,"score_gpt":0.44109980994327563,"score_spread":0.266646152109989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111022228","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.014626672,0.00023004116,0.8986979,0.00057196576,0.000130885,0.000077988225,0.0014797533,0.064392105,0.019792678],"genre_scores_gemma":[0.16656458,0.0007577798,0.79592,0.00036461055,0.000098204175,0.0003311316,0.0036053683,0.017367462,0.014990783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.00007103697,0.000024263267,0.00008034688,0.0002573855,0.00007222222],"domain_scores_gemma":[0.9993337,0.0002775373,0.0000364056,0.00010587124,0.0001537746,0.00009267973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060297013,0.0016084318,0.0008793012,0.001352461,0.0007945551,0.002707967,0.0016244402,0.00096437894,0.03362195],"category_scores_gemma":[0.0023262326,0.0004964676,0.0012717866,0.00077869685,0.0005890089,0.0027605994,0.003179372,0.0016979623,0.005847421],"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.00045473166,0.00023860559,0.003068584,0.00078951824,0.00013521132,0.0011853055,0.0034999659,0.06542225,0.07762987,0.0831895,0.14869869,0.61568785],"study_design_scores_gemma":[0.000226815,0.00028147048,0.003995505,0.00035665656,0.00007319632,0.0014563568,0.0006533001,0.405495,0.08049254,0.10192597,0.40469182,0.00035132474],"about_ca_topic_score_codex":0.00244706,"about_ca_topic_score_gemma":0.0033054953,"teacher_disagreement_score":0.03362195,"about_ca_system_score_codex":0.000494935,"about_ca_system_score_gemma":0.0006110388,"threshold_uncertainty_score":0.11247659},"labels":[],"label_agreement":null},{"id":"W3115014921","doi":"10.3233/fi-2020-1981","title":"Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means","year":2020,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computation; Dimension (graph theory); Mathematics; Theoretical computer science; Discrete mathematics; Graph; Topology (electrical circuits); Computer science; Algorithm; Combinatorics","score_opus":0.022566294091324015,"score_gpt":0.26055473670548457,"score_spread":0.23798844261416055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115014921","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.03896563,0.00011750889,0.9581547,0.0001279243,0.000021013404,0.000040223047,0.00017153478,0.0008011489,0.0016002399],"genre_scores_gemma":[0.31202558,0.00015238943,0.6855394,0.000048216698,0.000048948586,0.0001053901,0.0005261079,0.00018570099,0.0013682214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992507,0.00013463438,0.00006537651,0.0002208209,0.00022315492,0.000105309235],"domain_scores_gemma":[0.9966048,0.001893787,0.00022786413,0.0008706291,0.00026338515,0.00013955343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073832297,0.0006488826,0.0008465125,0.0017969811,0.00067360897,0.002231354,0.0012991577,0.0005697884,0.0026180819],"category_scores_gemma":[0.004155338,0.00043215358,0.0011877493,0.0012972419,0.0013596928,0.0039131544,0.0026973176,0.0013878451,0.0006535794],"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.0005129676,0.0001555764,0.0074425493,0.00059066707,0.0001284046,0.00024764164,0.0008333097,0.12712666,0.032651935,0.4165306,0.0054783844,0.40830135],"study_design_scores_gemma":[0.000036245972,0.00010020469,0.0015261209,0.000036194368,0.00003311173,0.00022225257,0.0001724012,0.44570652,0.021639287,0.52333075,0.007136569,0.000060282684],"about_ca_topic_score_codex":0.0006651918,"about_ca_topic_score_gemma":0.0014291812,"teacher_disagreement_score":0.0026180819,"about_ca_system_score_codex":0.0011183982,"about_ca_system_score_gemma":0.0009923748,"threshold_uncertainty_score":0.0087583065},"labels":[],"label_agreement":null},{"id":"W3128806768","doi":"","title":"Pen and Pixel: IC405 and IC410","year":2008,"lang":"en","type":"article","venue":"Journal of the Royal Astronomical Society of Canada","topic":"Digital Image Processing Techniques","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":"Geology","score_opus":0.006522241071413407,"score_gpt":0.18371226266420945,"score_spread":0.17719002159279604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128806768","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.02824314,0.0036649606,0.12811993,0.0024505411,0.0050437036,0.0007023764,0.027204849,0.13248147,0.67208904],"genre_scores_gemma":[0.12614585,0.0015255107,0.10412266,0.0014627796,0.00064505445,0.00024579355,0.030434133,0.021503627,0.7139147],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999337,0.000043360036,0.000040539293,0.00013651657,0.00032399796,0.00011853981],"domain_scores_gemma":[0.998681,0.00011318435,0.000052902382,0.00023591962,0.00063680805,0.00028022507],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007097296,0.0012738985,0.00047774136,0.001261816,0.0006557982,0.0019714658,0.0017413558,0.0012779331,0.3658804],"category_scores_gemma":[0.003002621,0.0005115053,0.00029474517,0.0020217164,0.0004083618,0.0018474215,0.00097528676,0.0010449432,0.106409065],"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.0013238183,0.000075578915,0.00078458403,0.00024315712,0.000015633823,0.00031480798,0.00009000779,0.00063359085,0.014785448,0.014759271,0.6679659,0.29900828],"study_design_scores_gemma":[0.00011072024,0.000105205894,0.0018393699,0.00007024611,0.00001883802,0.0003760828,0.000062053725,0.003958457,0.028938385,0.0033132331,0.9611667,0.00004072405],"about_ca_topic_score_codex":0.007706097,"about_ca_topic_score_gemma":0.014985152,"teacher_disagreement_score":0.3658804,"about_ca_system_score_codex":0.0012589577,"about_ca_system_score_gemma":0.0015001484,"threshold_uncertainty_score":0.90449464},"labels":[],"label_agreement":null},{"id":"W3131538362","doi":"10.1007/s10651-020-00481-1","title":"Halton iterative partitioning master frames","year":2021,"lang":"en","type":"article","venue":"Environmental and Ecological Statistics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"North Island College","funders":"","keywords":"Sample (material); Sampling (signal processing); Frame (networking); Partition (number theory); Computer science; Sampling design; Sampling frame; Population; Statistics; Range (aeronautics); Sample size determination; Resource (disambiguation); Mathematics; Computer vision","score_opus":0.016839650934105062,"score_gpt":0.2250876455317371,"score_spread":0.20824799459763205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131538362","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.0025851163,0.00008401921,0.99452305,0.000070232556,0.00003603964,0.000041302123,0.000077042365,0.00026786944,0.0023153194],"genre_scores_gemma":[0.06689535,0.00020849309,0.91942936,0.0001053144,0.00007505572,0.0002657956,0.000516016,0.0003714626,0.012133116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992417,0.00019147298,0.000043153195,0.00018284598,0.00025534222,0.00008548213],"domain_scores_gemma":[0.9984194,0.0006311621,0.00006783804,0.00036103305,0.00044901518,0.0000714704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170341,0.00096924434,0.001049557,0.0012680708,0.0007465332,0.0017207502,0.0018884452,0.0015150195,0.015014607],"category_scores_gemma":[0.0056344764,0.0006954644,0.0007034336,0.0010816283,0.0007293111,0.0017559413,0.0024753024,0.0015254442,0.004269943],"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.00058794837,0.00007652487,0.00069834176,0.00017905814,0.00007266798,0.000119909266,0.00031834893,0.16738163,0.014984054,0.15183659,0.01178149,0.6519635],"study_design_scores_gemma":[0.00003528527,0.00005387446,0.00019199579,0.000024945379,0.000014875919,0.000066632376,0.0000577971,0.940955,0.007985627,0.037441485,0.013151793,0.000020724669],"about_ca_topic_score_codex":0.004439089,"about_ca_topic_score_gemma":0.006674661,"teacher_disagreement_score":0.015014607,"about_ca_system_score_codex":0.00092188583,"about_ca_system_score_gemma":0.001518558,"threshold_uncertainty_score":0.050228894},"labels":[],"label_agreement":null},{"id":"W3142983110","doi":"","title":"4 - Conception optimisée d'architectures en précision finie pour les applications de traitement du signal","year":2001,"lang":"fr","type":"article","venue":"Traitement du signal","topic":"Digital Image Processing Techniques","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":"Computer science; Architecture; SIGNAL (programming language); Computer architecture; Transformation (genetics); Process (computing); Signal processing; Digital signal; Behavioral modeling; Digital signal processing; Automation; Computer engineering; Artificial intelligence; Computer hardware; Engineering; Programming language","score_opus":0.034784719612652636,"score_gpt":0.2889966924703306,"score_spread":0.254211972857678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142983110","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.016995499,0.00044923282,0.9765812,0.00015986727,0.000031925705,0.00003659756,0.000039364077,0.00025374247,0.005452633],"genre_scores_gemma":[0.30032885,0.0011316251,0.68897396,0.00010449879,0.000034000997,0.00024408265,0.00010395111,0.00018824839,0.0088907955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931467,0.00018472305,0.000029236991,0.00010059014,0.00031309464,0.000057789075],"domain_scores_gemma":[0.9996221,0.00016939107,0.000042809053,0.000051658502,0.00010194368,0.000012135906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012779337,0.00069500355,0.00046148666,0.0005849726,0.00029618604,0.0018638782,0.00057334034,0.00068866217,0.0023842836],"category_scores_gemma":[0.0014547845,0.00043725918,0.0008808639,0.00041829373,0.0011809635,0.0013335262,0.0003732615,0.0010328916,0.0005176451],"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.0001761366,0.000032079533,0.0007844914,0.00029615656,0.00005326733,0.00012923368,0.0002554519,0.5017661,0.06416853,0.37654948,0.0011215779,0.05466755],"study_design_scores_gemma":[0.000071060655,0.00017671628,0.00064584246,0.00008956869,0.000042651664,0.00018188007,0.00006591734,0.84716755,0.049564835,0.07062479,0.03132947,0.000039674214],"about_ca_topic_score_codex":0.003349204,"about_ca_topic_score_gemma":0.002713714,"teacher_disagreement_score":0.003349204,"about_ca_system_score_codex":0.0016289605,"about_ca_system_score_gemma":0.0012199932,"threshold_uncertainty_score":0.011819005},"labels":[],"label_agreement":null},{"id":"W3157507042","doi":"10.46298/dmtcs.6402","title":"The configuration space of a robotic arm in a tunnel of width 2","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund; York University; Universidad del Valle; National Science Foundation; Government of Canada; San Francisco State University","keywords":"Configuration space; Robotic arm; Position (finance); Space (punctuation); Mathematics; Motion (physics); Robot; Property (philosophy); Geometry; Topology (electrical circuits); Combinatorics; Artificial intelligence; Computer science; Physics","score_opus":0.01749619517794802,"score_gpt":0.2652316864787973,"score_spread":0.2477354913008493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157507042","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.9088621,0.0005302287,0.067353025,0.00044733152,0.00004348856,0.000031395743,0.00026319918,0.00013749789,0.022331733],"genre_scores_gemma":[0.98597324,0.0001499117,0.010497921,0.000030697625,0.00000903703,0.000040789357,0.00010391598,0.000027911667,0.003166609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984205,0.000041235136,0.0000058413634,0.000037041842,0.000030116185,0.000043601696],"domain_scores_gemma":[0.99968946,0.00013246914,0.00007504168,0.000024612718,0.000020815402,0.00005753152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029362077,0.0004058432,0.0003162855,0.00049108575,0.00077212794,0.00085897546,0.000739636,0.0009404464,0.0047785137],"category_scores_gemma":[0.00091625605,0.00034273413,0.00037686218,0.00051648886,0.0015342276,0.00091438624,0.0013104097,0.00069555786,0.00047419657],"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.0008873473,0.00012057391,0.004670822,0.00030764355,0.00006964095,0.0023501427,0.0008237637,0.53316915,0.025285386,0.40802258,0.0032747316,0.021018269],"study_design_scores_gemma":[0.00013351406,0.0005349329,0.0043936907,0.00008806622,0.0000267996,0.0008292128,0.00077956566,0.78009045,0.004397317,0.20143153,0.0071691587,0.00012570602],"about_ca_topic_score_codex":0.002312821,"about_ca_topic_score_gemma":0.0013374112,"teacher_disagreement_score":0.0047785137,"about_ca_system_score_codex":0.00041405967,"about_ca_system_score_gemma":0.00033934126,"threshold_uncertainty_score":0.015985668},"labels":[],"label_agreement":null},{"id":"W3158320605","doi":"10.55016/ojs/cdm.v16i1.62636","title":"Equivalent classes of degree sequences for triangulated polyhedra and their convex realization","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","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":"Polyhedron; Mathematics; Combinatorics; Regular polygon; Degree (music); Equivalence (formal languages); Set (abstract data type); Convex polytope; Realization (probability); Dual polyhedron; Discrete mathematics; Convex set; Convex optimization; Geometry; Computer science","score_opus":0.04225962854213899,"score_gpt":0.3325056220029084,"score_spread":0.2902459934607694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158320605","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.5979759,0.0001979094,0.36164564,0.00027561557,0.00010232838,0.00012083222,0.0007390603,0.00026041965,0.038682375],"genre_scores_gemma":[0.9371044,0.00016676019,0.054974284,0.000059722166,0.00007340832,0.00013655866,0.00091340794,0.00011486241,0.0064565456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864,0.0001644903,0.00007653567,0.00028985724,0.0005129566,0.0003161759],"domain_scores_gemma":[0.99834144,0.00063808553,0.00019295022,0.00022463493,0.000271779,0.00033113422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006351755,0.00040630886,0.0006787676,0.0017171156,0.0015711496,0.0034722215,0.0010258304,0.00064783124,0.007480043],"category_scores_gemma":[0.0033499745,0.0004235687,0.0009354758,0.0011538541,0.0022854253,0.0037357253,0.0018386022,0.0021831505,0.00045276794],"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.000089081186,0.00006360258,0.001026387,0.00003973071,0.000007675013,0.00008033872,0.00028302977,0.009946239,0.0018306061,0.9721777,0.00064427813,0.013811415],"study_design_scores_gemma":[0.00003837452,0.000092686074,0.001415654,0.00004876747,0.000013262056,0.00018591258,0.00046257864,0.07282579,0.0041001877,0.91316336,0.007615574,0.00003787211],"about_ca_topic_score_codex":0.0020105096,"about_ca_topic_score_gemma":0.0022226993,"teacher_disagreement_score":0.007480043,"about_ca_system_score_codex":0.0016930704,"about_ca_system_score_gemma":0.00059144164,"threshold_uncertainty_score":0.025023282},"labels":[],"label_agreement":null},{"id":"W3172701151","doi":"","title":"NP-completeness of two pencil puzzles: Yajilin and Country Road","year":2012,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"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":"Completeness (order theory); Pencil (optics); Mathematics; Mathematics education; Statistics; Mathematical analysis; Engineering","score_opus":0.032001315473700685,"score_gpt":0.29582403047800204,"score_spread":0.2638227150043014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172701151","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.5435999,0.0034608664,0.16077274,0.030769974,0.0008037325,0.00024018761,0.0024980684,0.0014314158,0.2564231],"genre_scores_gemma":[0.92863554,0.0009300906,0.036047846,0.0012810848,0.00015680371,0.00015729378,0.0019356943,0.0003892375,0.030466493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866915,0.00043121167,0.00008806871,0.0003846151,0.00018875668,0.00023813431],"domain_scores_gemma":[0.99291974,0.0054944498,0.00028883884,0.00058001437,0.0004228997,0.00029409275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010706903,0.0007640327,0.0015634521,0.0008439219,0.004532503,0.004837022,0.0018633966,0.0033647285,0.017034471],"category_scores_gemma":[0.011502699,0.0008587087,0.0020274625,0.0016944637,0.0036202387,0.011706954,0.0034032562,0.005425832,0.0017101689],"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.00050990476,0.00015530216,0.0013361659,0.00044635747,0.00006870316,0.00063869474,0.0017333407,0.022310635,0.0011505103,0.91404694,0.027734097,0.029869346],"study_design_scores_gemma":[0.00008715264,0.00002984574,0.0004225411,0.000054593478,0.000036091584,0.00019393316,0.00063090795,0.020671925,0.00071748253,0.96326524,0.013858297,0.000031902942],"about_ca_topic_score_codex":0.0058172345,"about_ca_topic_score_gemma":0.004844214,"teacher_disagreement_score":0.017034471,"about_ca_system_score_codex":0.0020251963,"about_ca_system_score_gemma":0.002411363,"threshold_uncertainty_score":0.056985974},"labels":[],"label_agreement":null},{"id":"W3192628405","doi":"10.51201/jusst/21/07285","title":"Some Recent Developments in theory of Metric Spaces","year":2021,"lang":"en","type":"article","venue":"Journal of University of Shanghai for Science and Technology","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Topology (electrical circuits); Metric space; Mathematics; Metric (unit); Space (punctuation); Set (abstract data type); Topological space; Function (biology); Hausdorff space; Computer science; Pure mathematics; Combinatorics","score_opus":0.017008395249719987,"score_gpt":0.24961889579930793,"score_spread":0.23261050054958796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192628405","genre_codex":"review","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.004972783,0.45042625,0.30226785,0.04170538,0.014246621,0.00007374568,0.00051519816,0.0002776079,0.18551455],"genre_scores_gemma":[0.18759762,0.41774035,0.2502204,0.022436652,0.052959304,0.0005298001,0.0010531516,0.00053313514,0.06692961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633884,0.0015453936,0.00025615795,0.00059067464,0.0011112364,0.00015769606],"domain_scores_gemma":[0.9946266,0.0034002112,0.00025238396,0.00042329993,0.0010146069,0.00028285698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050817556,0.0015341969,0.0013903208,0.0042008073,0.0023929316,0.005939951,0.0020030567,0.0029119055,0.009389516],"category_scores_gemma":[0.009488616,0.0007511832,0.0015460147,0.0060149776,0.0073344726,0.011498422,0.0033555594,0.007724558,0.0033056303],"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.00000751973,0.000010396633,0.00007950652,0.00020693957,0.000012806359,0.00006793306,0.00015334392,0.00046328115,0.000082983825,0.9757337,0.00891224,0.014269384],"study_design_scores_gemma":[0.000006444982,0.000025528545,0.00015517809,0.00015991581,0.000008989892,0.00024258374,0.000080630416,0.001930485,0.00009084588,0.7661747,0.2311047,0.000020000089],"about_ca_topic_score_codex":0.0020211835,"about_ca_topic_score_gemma":0.001481305,"teacher_disagreement_score":0.009389516,"about_ca_system_score_codex":0.0036708133,"about_ca_system_score_gemma":0.001394255,"threshold_uncertainty_score":0.03141105},"labels":[],"label_agreement":null},{"id":"W4206385372","doi":"10.1016/j.acha.2017.02.003","title":"Decomposition matrices for the special case of data on the triangular lattice of G(2)","year":2017,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Triangular matrix; Lattice (music); Decomposition; Matrix decomposition; Hexagonal lattice; Matrix (chemical analysis); Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.05217954910674238,"score_gpt":0.34403294041148175,"score_spread":0.29185339130473936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206385372","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.14519362,0.00033956105,0.8229292,0.0010038397,0.00043007964,0.00012498879,0.0015544615,0.00043113995,0.027993064],"genre_scores_gemma":[0.7043079,0.00044165907,0.27034894,0.00046716834,0.0002841784,0.00020618245,0.0022232477,0.00037039502,0.021350294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995975,0.000080832746,0.00002015524,0.00007913893,0.00014724661,0.00007507444],"domain_scores_gemma":[0.9987815,0.00031928677,0.00013763794,0.00026556657,0.00027353995,0.00022257054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004983603,0.00037540137,0.00035732525,0.0010736786,0.00042814028,0.0012075963,0.000846527,0.0008178194,0.01569326],"category_scores_gemma":[0.00271591,0.0001627378,0.00031710402,0.0008489435,0.000824622,0.0011967187,0.0006916496,0.0011692285,0.0022849382],"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.00025663179,0.00010559905,0.0009922446,0.0001699346,0.000026384536,0.00040903012,0.00029018617,0.030978352,0.013440993,0.85614663,0.016473936,0.08070995],"study_design_scores_gemma":[0.000026534888,0.000046905363,0.00082458864,0.000028590595,0.0000075947705,0.0004205546,0.0002197774,0.3261111,0.0026948203,0.6589885,0.010582609,0.00004848447],"about_ca_topic_score_codex":0.00095289556,"about_ca_topic_score_gemma":0.0013162751,"teacher_disagreement_score":0.01569326,"about_ca_system_score_codex":0.0003138001,"about_ca_system_score_gemma":0.0004983038,"threshold_uncertainty_score":0.052499115},"labels":[],"label_agreement":null},{"id":"W4207027624","doi":"10.1016/j.comgeo.2017.06.010","title":"Table cartogram","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba; University of Waterloo; University of British Columbia","funders":"","keywords":"Rectangle; Table (database); Quadrilateral; Regular polygon; Mathematics; Partition (number theory); Combinatorics; Adjacency list; Geometry; Computer science; Physics; Database","score_opus":0.024357971888012264,"score_gpt":0.3034193636811764,"score_spread":0.27906139179316414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207027624","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019609766,0.0013389979,0.30172163,0.0016588992,0.0033630421,0.0008169754,0.07045477,0.023535194,0.5775007],"genre_scores_gemma":[0.18816331,0.002997437,0.36121127,0.0006416532,0.0005871039,0.0005922506,0.07359351,0.0048846537,0.36732882],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998049,0.000015016254,0.00000975938,0.00005735999,0.00008814877,0.00002481494],"domain_scores_gemma":[0.9997876,0.000026324555,0.00000968403,0.00005015275,0.000101365855,0.000024971836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007760942,0.0009745771,0.0007109942,0.0021629927,0.0009857086,0.0021583347,0.00082293944,0.000668172,0.2797055],"category_scores_gemma":[0.0006273612,0.00038995556,0.00064106926,0.0028626132,0.0003418263,0.00093567104,0.00087321585,0.0005806789,0.06887451],"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.00037196247,0.000053798078,0.00090954336,0.00053149596,0.00002830305,0.0009219984,0.0002008671,0.009673065,0.0113556115,0.05965533,0.3668457,0.5494524],"study_design_scores_gemma":[0.000054238943,0.00007643886,0.0012375716,0.000090450885,0.00002260304,0.0008396139,0.00023170072,0.016445883,0.0056678834,0.016941173,0.95834506,0.000047381192],"about_ca_topic_score_codex":0.0072479057,"about_ca_topic_score_gemma":0.0064391545,"teacher_disagreement_score":0.2797055,"about_ca_system_score_codex":0.00041654494,"about_ca_system_score_gemma":0.0011363951,"threshold_uncertainty_score":0.9357081},"labels":[],"label_agreement":null},{"id":"W4210414494","doi":"10.33425/2771-5906.1007","title":"Anorexia Nervosa &amp; Alzheimer's","year":2021,"lang":"en","type":"article","venue":"Trends in Internal Medicine","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint John Regional Hospital","funders":"","keywords":"Anorexia nervosa; Anorexia; Disease; Psychology; Alzheimer's disease; Psychiatry; Perception; Medicine; Psychotherapist; Neuroscience; Eating disorders; Internal medicine","score_opus":0.06250670839462823,"score_gpt":0.35643330255842604,"score_spread":0.2939265941637978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210414494","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86662483,0.029020514,0.0021361113,0.012216269,0.0011041448,0.00015876994,0.00037218948,0.00017828237,0.08818895],"genre_scores_gemma":[0.97865194,0.0062423986,0.0022524463,0.0028907836,0.00087251654,0.000034223045,0.0000938534,0.00001800386,0.00894372],"study_design_codex":"case_report","study_design_gemma":"not_applicable","domain_scores_codex":[0.99988115,0.000013170094,0.000015206525,0.000021990585,0.000021234757,0.000047225898],"domain_scores_gemma":[0.9997242,0.00007970411,0.00007743081,0.000011634682,0.000018995097,0.00008804269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016984876,0.0009130216,0.00048369044,0.0011104563,0.0023692031,0.00066018535,0.00042318326,0.0018193905,0.0034701729],"category_scores_gemma":[0.0009742851,0.00026451435,0.00036038144,0.000863821,0.0010304188,0.0006881305,0.000815495,0.0016847822,0.00069777766],"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.000034263576,0.00003686976,0.013657989,0.00006135331,0.0000071569766,0.980788,0.00024193632,0.00006712777,0.00055750954,0.00076180394,0.00046999936,0.0033159112],"study_design_scores_gemma":[0.0000052125447,0.00003161992,0.0080758305,0.0000393329,0.000008679007,0.9883079,0.0002822376,0.000073183575,0.00014855977,0.00051967584,0.0025003063,0.000007514358],"about_ca_topic_score_codex":0.0036129684,"about_ca_topic_score_gemma":0.0044579897,"teacher_disagreement_score":0.0036129684,"about_ca_system_score_codex":0.0005503558,"about_ca_system_score_gemma":0.0005977306,"threshold_uncertainty_score":0.011608899},"labels":[],"label_agreement":null},{"id":"W4233689197","doi":"10.1017/cbo9781139523967.002","title":"Introduction","year":2015,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer graphics (images); Computer graphics; Graphics; Artificial intelligence; Computer vision","score_opus":0.03152767487593279,"score_gpt":0.21501190100320827,"score_spread":0.1834842261272755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233689197","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.0012501299,0.02281938,0.0112577705,0.0074636745,0.009990206,0.00026424308,0.0036510236,0.001850623,0.9414531],"genre_scores_gemma":[0.004778973,0.015451206,0.005811732,0.0035992824,0.002124558,0.00015858901,0.0041974923,0.0005319902,0.96334624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991742,0.00007393221,0.00004150161,0.00018957951,0.00043347658,0.000087408785],"domain_scores_gemma":[0.99933726,0.00011637285,0.00003550417,0.00008129218,0.00031305995,0.0001164891],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00059452554,0.0010048436,0.00073177426,0.0013743044,0.0014880983,0.0038581681,0.0019538454,0.0022812518,0.39733356],"category_scores_gemma":[0.002333055,0.00035269573,0.0006176458,0.0012712877,0.00073409383,0.003526708,0.0025666154,0.0021386652,0.2624331],"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.00004260505,0.000058698046,0.00023993939,0.0005298885,0.0000064271026,0.00015146605,0.0004862152,0.00025882543,0.00076685403,0.05942475,0.67493623,0.26309815],"study_design_scores_gemma":[0.0000012873553,0.000007101662,0.000071633054,0.00010547357,0.0000010889318,0.00008118289,0.000039462615,0.000017739505,0.00005588192,0.0027955233,0.9968208,0.0000028072232],"about_ca_topic_score_codex":0.001983471,"about_ca_topic_score_gemma":0.0024296213,"teacher_disagreement_score":0.60266644,"about_ca_system_score_codex":0.0013559522,"about_ca_system_score_gemma":0.0016839547,"threshold_uncertainty_score":0.8596305},"labels":[],"label_agreement":null},{"id":"W4241111140","doi":"10.1002/9781119517566.ch11","title":"<b>Curves and Regular Surfaces in</b> ℝ <sup>3</sup>","year":2019,"lang":"en","type":"other","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Surface (topology); Surface of revolution; Tangent; Smoothness; Piecewise; Subspace topology; Euclidean geometry; Plane (geometry); Manifold (fluid mechanics); Tangent space; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.010615780972580324,"score_gpt":0.23887858734174883,"score_spread":0.2282628063691685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241111140","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.16095144,0.015173255,0.3270761,0.0036468806,0.00074815506,0.00009012737,0.0004940718,0.0006722645,0.4911477],"genre_scores_gemma":[0.7143508,0.0115654925,0.13878506,0.00070455554,0.00077742146,0.00010534396,0.00072421844,0.0006561627,0.13233098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974984,0.000036132573,0.000011016681,0.00005604569,0.00011037256,0.000036612364],"domain_scores_gemma":[0.9996388,0.00011535896,0.00007983285,0.000052035546,0.00006534112,0.000048621998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028689648,0.0004960712,0.00029297537,0.001685469,0.0007520976,0.0028920511,0.00044613227,0.00083172036,0.009544863],"category_scores_gemma":[0.00087752263,0.00025719887,0.0004221864,0.0013453274,0.0023444826,0.0022053942,0.001211618,0.001319661,0.00204631],"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.000011847837,0.000005700029,0.00020215113,0.0000501631,0.0000030521314,0.00009536639,0.00017269183,0.0016217753,0.0015412132,0.97905433,0.0024765607,0.014765179],"study_design_scores_gemma":[0.000005159782,0.000019879599,0.0017671556,0.00007136234,0.000006534287,0.000586637,0.00042013853,0.010644479,0.0021420596,0.8655886,0.11872625,0.000021709846],"about_ca_topic_score_codex":0.0015257675,"about_ca_topic_score_gemma":0.001060948,"teacher_disagreement_score":0.009544863,"about_ca_system_score_codex":0.00070846826,"about_ca_system_score_gemma":0.00035568947,"threshold_uncertainty_score":0.031930685},"labels":[],"label_agreement":null},{"id":"W4243087330","doi":"10.1007/978-0-387-39940-9_2463","title":"Digital Image","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Computer graphics (images)","score_opus":0.012620714720195707,"score_gpt":0.2383439698334868,"score_spread":0.22572325511329108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243087330","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.0013465944,0.0042642537,0.045031253,0.000643799,0.0011768112,0.00020604623,0.0057979166,0.007984683,0.9335487],"genre_scores_gemma":[0.0055804965,0.0034718376,0.017649649,0.0005666647,0.00021951551,0.000070252434,0.0064484603,0.00092709163,0.9650661],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997993,0.0000073889028,0.0000064382284,0.0000348312,0.00013875951,0.000013348083],"domain_scores_gemma":[0.9997595,0.000026906207,0.000009410567,0.000055254775,0.000121428595,0.000027521975],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015505435,0.00073067326,0.00052006426,0.001761535,0.00037621392,0.0020344732,0.0009842869,0.0007530865,0.42502967],"category_scores_gemma":[0.00059235387,0.00028499003,0.0003083463,0.0017394802,0.00022401917,0.0015320648,0.0009789043,0.00076797564,0.359619],"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.000039253366,0.000028342976,0.00008912481,0.00029079642,0.000008628693,0.000110998146,0.00003143016,0.00027646322,0.009051025,0.007122727,0.50190604,0.48104507],"study_design_scores_gemma":[0.000005326918,0.00001369091,0.00036744418,0.0000582608,0.0000064017827,0.00042942824,0.0000228567,0.00073729863,0.003547258,0.001580773,0.99322224,0.000008985135],"about_ca_topic_score_codex":0.00088916416,"about_ca_topic_score_gemma":0.0019215397,"teacher_disagreement_score":0.42502967,"about_ca_system_score_codex":0.0002682945,"about_ca_system_score_gemma":0.0003093374,"threshold_uncertainty_score":0.8201254},"labels":[],"label_agreement":null},{"id":"W4243470186","doi":"10.1007/978-1-4939-7131-2_100388","title":"Force-Directed Algorithm","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Algorithm","score_opus":0.018505954216575624,"score_gpt":0.24707154488126543,"score_spread":0.2285655906646898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243470186","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010502823,0.0016050051,0.9123481,0.00038261805,0.0006200263,0.000086608095,0.00025042036,0.002362217,0.08129483],"genre_scores_gemma":[0.03272758,0.0027443904,0.7997597,0.00053056865,0.00027606668,0.00023618682,0.0012640549,0.0013872458,0.16107419],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997595,0.000021492042,0.000006750786,0.0000609064,0.00013159923,0.000019791412],"domain_scores_gemma":[0.9998192,0.000044484736,0.00000746626,0.000040444138,0.000072668976,0.000015719244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029111656,0.0010726823,0.00069926586,0.0009042469,0.0005985567,0.0010928024,0.001602294,0.0014894961,0.036206126],"category_scores_gemma":[0.00070929044,0.00034887806,0.00051383453,0.0007940219,0.0005277135,0.0010761818,0.0011833473,0.0014319775,0.021287763],"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.0000481151,0.000059406222,0.00010005303,0.0002510942,0.000034789224,0.000055232398,0.000055352528,0.04229613,0.008886502,0.10680952,0.10225322,0.7391506],"study_design_scores_gemma":[0.00003963971,0.000052740586,0.00024326376,0.00017568097,0.000026095766,0.00037981392,0.00003148837,0.4321754,0.012729474,0.09085453,0.4632435,0.00004829932],"about_ca_topic_score_codex":0.0021228006,"about_ca_topic_score_gemma":0.0029166278,"teacher_disagreement_score":0.036206126,"about_ca_system_score_codex":0.00048747502,"about_ca_system_score_gemma":0.0008727774,"threshold_uncertainty_score":0.121121585},"labels":[],"label_agreement":null},{"id":"W4244106388","doi":"10.1115/detc2017-67840","title":"Optimization of the Singularity Locus of a Novel Kinematically Redundant Spherical Parallel Manipulator","year":2017,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Workspace; Jacobian matrix and determinant; Gravitational singularity; Singularity; Locus (genetics); Parallel manipulator; Robot; Computer science; Architecture; Point (geometry); Geometric primitive; Topology (electrical circuits); Mathematics; Mathematical analysis; Geometry; Applied mathematics; Artificial intelligence; Combinatorics","score_opus":0.03625514454691115,"score_gpt":0.2870560271770733,"score_spread":0.25080088263016215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244106388","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.054348722,0.00012591573,0.9385658,0.000059092945,0.00002160132,0.0000323267,0.000022730212,0.00017643056,0.006647501],"genre_scores_gemma":[0.69032764,0.00022997754,0.3058033,0.000024334578,0.000022358772,0.00008465735,0.0000683911,0.000056799738,0.0033826244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987006,0.00002499994,0.0000056088547,0.000023502365,0.00006357081,0.000012331088],"domain_scores_gemma":[0.99987984,0.000018978299,0.000034174234,0.000020285717,0.00003426273,0.000012439354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022278905,0.0006237437,0.00032944465,0.00032692787,0.00021944728,0.00031970887,0.00049413176,0.00033488782,0.0013936264],"category_scores_gemma":[0.00038371314,0.00023368442,0.00028282788,0.00021634284,0.00037697714,0.0004070753,0.0005473285,0.00031745218,0.0004170873],"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.0001438937,0.000051164254,0.00078891666,0.00023514197,0.000035784684,0.0005254896,0.00013518607,0.7116602,0.12100948,0.046315372,0.0011249842,0.117974356],"study_design_scores_gemma":[0.000043717322,0.00044985313,0.0007416913,0.000018902676,0.000025741369,0.00048736235,0.000047276546,0.9679644,0.013357906,0.011114976,0.0057231807,0.000024963623],"about_ca_topic_score_codex":0.00027786032,"about_ca_topic_score_gemma":0.0003631844,"teacher_disagreement_score":0.0013936264,"about_ca_system_score_codex":0.00021078135,"about_ca_system_score_gemma":0.00042654076,"threshold_uncertainty_score":0.0046620965},"labels":[],"label_agreement":null},{"id":"W4246704189","doi":"10.1002/hipo.22967","title":"Cover Image, Volume 29, Issue 1","year":2018,"lang":"en","type":"paratext","venue":"Hippocampus","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Women and Children’s Health Research Institute; University of Alberta","funders":"","keywords":"Cover (algebra); Legend; Image (mathematics); Grid; Volume (thermodynamics); Psychology; Computer science; Artificial intelligence; Art history; Art; Mathematics; Physics; Geometry; Engineering","score_opus":0.01237276890353566,"score_gpt":0.2761486274247634,"score_spread":0.26377585852122776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246704189","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.0005152799,0.0021601303,0.0018191172,0.004353759,0.03561295,0.00025590486,0.011781276,0.0036337283,0.93986785],"genre_scores_gemma":[0.0019720958,0.0013918608,0.00070797827,0.0011270519,0.0059139333,0.00006701584,0.004974757,0.0008753005,0.98297],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974996,0.000017905662,0.0000133992935,0.000049133414,0.0001422037,0.000027466755],"domain_scores_gemma":[0.9984212,0.0003032361,0.00008065243,0.00015876433,0.0006873728,0.00034873615],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020824297,0.001096294,0.0010776637,0.002299826,0.00094867276,0.003948502,0.0010284343,0.0014287689,0.907165],"category_scores_gemma":[0.0028677885,0.00034002194,0.00053956785,0.0024563111,0.00050963357,0.0022424657,0.0013213155,0.0013749675,0.8188159],"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.000010757427,0.000007311594,0.000018084034,0.000054144977,7.6812034e-7,0.00001630385,0.0000024892083,0.000022417451,0.00013147139,0.00040009248,0.9865789,0.012757285],"study_design_scores_gemma":[0.000009591599,0.000016131435,0.0003373163,0.00009811975,0.0000016996927,0.000106458945,0.000017342503,0.00013576318,0.00012735394,0.0006307336,0.99851507,0.0000043234204],"about_ca_topic_score_codex":0.0015283892,"about_ca_topic_score_gemma":0.0026296284,"teacher_disagreement_score":0.09283501,"about_ca_system_score_codex":0.0008913756,"about_ca_system_score_gemma":0.00056196086,"threshold_uncertainty_score":0.13241786},"labels":[],"label_agreement":null},{"id":"W4247052561","doi":"10.1145/1186562.1015750","title":"Fast hierarchical importance sampling with blue noise properties","year":2004,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Rendering (computer graphics); Computer science; Fibonacci number; Sampling (signal processing); Computer graphics; Algorithm; Sample (material); Graphics; Noise (video); Computer graphics (images); Computational science; Artificial intelligence; Computer vision; Mathematics","score_opus":0.028154686319862135,"score_gpt":0.24918406792923817,"score_spread":0.22102938160937602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247052561","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.01051039,0.00007066115,0.98813,0.0000368908,0.000016682485,0.000023403578,0.000015509146,0.0002080685,0.0009883433],"genre_scores_gemma":[0.2965725,0.00013512935,0.70008993,0.00010144947,0.000046152705,0.00015124363,0.00013766909,0.00015635342,0.0026095472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993112,0.00015083046,0.000024354735,0.000072740186,0.00038055386,0.000060272232],"domain_scores_gemma":[0.9987036,0.00070931826,0.00008843356,0.00021999267,0.00020567127,0.00007294611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092697464,0.00044279383,0.0005477562,0.00069762906,0.0004710632,0.0005269857,0.00083794235,0.000473471,0.0016616574],"category_scores_gemma":[0.004030249,0.0003809019,0.00042230976,0.0005785823,0.00065475557,0.00086655386,0.0011709164,0.0007647506,0.00043273336],"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.00052999414,0.00010753703,0.001745376,0.00025501102,0.00005455525,0.00025239194,0.0005141183,0.4555073,0.07746325,0.1332506,0.0034675577,0.32685223],"study_design_scores_gemma":[0.000021560516,0.000030353633,0.00016769639,0.000005561442,0.000005962893,0.00004879973,0.000010811068,0.98005635,0.0074182204,0.010661699,0.0015648181,0.000008262409],"about_ca_topic_score_codex":0.0021672938,"about_ca_topic_score_gemma":0.0033173016,"teacher_disagreement_score":0.0021672938,"about_ca_system_score_codex":0.0006499562,"about_ca_system_score_gemma":0.0006189558,"threshold_uncertainty_score":0.005558789},"labels":[],"label_agreement":null},{"id":"W4250699386","doi":"10.1017/cbo9780511977152.006","title":"Matroids","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.02910450630896245,"score_gpt":0.19925949797555076,"score_spread":0.17015499166658832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250699386","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.0110471975,0.019165734,0.18163411,0.0038278243,0.001787426,0.00008733528,0.0066890894,0.001791316,0.77397],"genre_scores_gemma":[0.2155559,0.03513954,0.1076916,0.0016194236,0.0034225995,0.00029866025,0.013336338,0.0018050201,0.6211309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996637,0.000053593878,0.000022187718,0.00008080897,0.00014638239,0.000033350967],"domain_scores_gemma":[0.99965835,0.00010351253,0.000024238423,0.00008539055,0.00008454016,0.00004406034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035602463,0.00077622605,0.0006283802,0.0013596144,0.00057894667,0.0025241876,0.0006840315,0.00055165094,0.07208101],"category_scores_gemma":[0.0010281012,0.00032915646,0.00057555095,0.0018673517,0.00074289285,0.002981156,0.00110978,0.0017054018,0.02832545],"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.000041863354,0.000033224987,0.00018100507,0.00042169192,0.00002442823,0.00007032174,0.000110828354,0.002742118,0.0014960332,0.68666685,0.16195239,0.1462592],"study_design_scores_gemma":[0.0000134291595,0.00003384682,0.00039384764,0.000093346454,0.000014567,0.00041102615,0.00005825122,0.0038778435,0.0008080123,0.62229145,0.37199032,0.000014044878],"about_ca_topic_score_codex":0.000452026,"about_ca_topic_score_gemma":0.0006238989,"teacher_disagreement_score":0.07208101,"about_ca_system_score_codex":0.0008288677,"about_ca_system_score_gemma":0.00044863732,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4253814772","doi":"10.1007/978-3-642-40450-4_36","title":"Table Cartograms","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba; University of British Columbia","funders":"","keywords":"Rectangle; Quadrilateral; Table (database); Regular polygon; Adjacency list; Partition (number theory); Combinatorics; Mathematics; Computer science; Geometry; Physics; Database","score_opus":0.01645269611225484,"score_gpt":0.24541285603035037,"score_spread":0.22896015991809554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253814772","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030827466,0.0015831721,0.08736767,0.00060857064,0.0016835391,0.0003276268,0.024625696,0.011700836,0.86902016],"genre_scores_gemma":[0.033795834,0.0044523217,0.12175005,0.00037063673,0.0003352346,0.00027229634,0.035901096,0.004569962,0.7985525],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982774,0.000012564104,0.000008450535,0.0000394472,0.00009176954,0.000019950396],"domain_scores_gemma":[0.9997693,0.000027849565,0.000008751595,0.00006189181,0.00010877507,0.00002342209],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012220512,0.0011966428,0.00065696205,0.002758766,0.0010365271,0.0025039932,0.0010206603,0.00060136546,0.49398154],"category_scores_gemma":[0.00074178434,0.0005543969,0.00066572963,0.0043564523,0.00037831315,0.0016998354,0.0009608251,0.0007792198,0.21477702],"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.0001442398,0.000031534764,0.00020953889,0.00045461062,0.000014424607,0.0002455669,0.00015291208,0.002260129,0.004599091,0.0627963,0.44964454,0.4794471],"study_design_scores_gemma":[0.0000135076125,0.0000233737,0.00025197415,0.00006693679,0.000009529194,0.0002751282,0.00010472089,0.0014025697,0.0016617153,0.009541008,0.9866332,0.000016435979],"about_ca_topic_score_codex":0.0040413584,"about_ca_topic_score_gemma":0.0051733893,"teacher_disagreement_score":0.49398154,"about_ca_system_score_codex":0.00047125743,"about_ca_system_score_gemma":0.00088014995,"threshold_uncertainty_score":0.7217739},"labels":[],"label_agreement":null},{"id":"W4253964759","doi":"10.1007/978-981-10-6113-4","title":"Digital Image Processing","year":2017,"lang":"en","type":"book","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":400,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Digital image processing; Computer vision; Image processing; Image (mathematics); Artificial intelligence; Computer graphics (images)","score_opus":0.01892458715604498,"score_gpt":0.27524276210953985,"score_spread":0.25631817495349485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253964759","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.0014853374,0.019358674,0.2195589,0.0008384196,0.0034129217,0.00025327344,0.0011180267,0.0071228775,0.7468515],"genre_scores_gemma":[0.004826859,0.010283762,0.0371368,0.00055927894,0.00055091217,0.00011301553,0.0015213329,0.00079890684,0.9442092],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947006,0.000018477334,0.000015280299,0.0000805032,0.00038923442,0.000026514397],"domain_scores_gemma":[0.99955386,0.000059651986,0.00001906163,0.0001078903,0.0002232273,0.00003627726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023382997,0.0015593049,0.001152043,0.003059313,0.0006659631,0.0023759198,0.0016217853,0.00096493773,0.18130319],"category_scores_gemma":[0.0007482846,0.0005939054,0.00053933024,0.0026786104,0.00060537976,0.0022751247,0.0017810422,0.001953418,0.17486691],"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.00002172713,0.000035553516,0.00007119671,0.0004283854,0.000016351645,0.00009554533,0.000041294243,0.0006279652,0.010835552,0.013564424,0.28602883,0.68823326],"study_design_scores_gemma":[0.000004696601,0.000028083186,0.00026045865,0.00012667666,0.000014177057,0.00059981516,0.000026949241,0.0019226529,0.00619756,0.006453198,0.98434585,0.000019768979],"about_ca_topic_score_codex":0.0007056241,"about_ca_topic_score_gemma":0.001789487,"teacher_disagreement_score":0.18130319,"about_ca_system_score_codex":0.00048444833,"about_ca_system_score_gemma":0.00066316465,"threshold_uncertainty_score":0.6065196},"labels":[],"label_agreement":null},{"id":"W4283210925","doi":"10.2478/puma-2022-0016","title":"On the exhaustive generation of discrete figures with connectivity constraints","year":2022,"lang":"en","type":"article","venue":"Pure mathematics and applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Polyomino; Pixel; Enumeration; Generalization; Combinatorics; Set (abstract data type); Mathematics; Discrete geometry; Discrete mathematics; Connected component; Algorithm; Computer science; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.02598758730102014,"score_gpt":0.25992296107276947,"score_spread":0.23393537377174933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283210925","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.3080479,0.0002837677,0.64981204,0.0005153922,0.00012208236,0.00016576303,0.00041334843,0.0009714819,0.03966825],"genre_scores_gemma":[0.70289606,0.0002246812,0.2875648,0.00013477332,0.0000373583,0.00018970137,0.0007737731,0.0002890703,0.007889761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941933,0.00019906116,0.000028216,0.00009115831,0.00020072806,0.000061530576],"domain_scores_gemma":[0.9960496,0.0029441214,0.00015987869,0.0004991254,0.00025129097,0.00009612461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005231111,0.00026609882,0.00039342756,0.00069690606,0.0004389568,0.00084901426,0.00058228977,0.00054967013,0.00735007],"category_scores_gemma":[0.0049771145,0.00028476788,0.0003733624,0.00074374716,0.00088070356,0.001159929,0.0010786359,0.0005132001,0.00081129785],"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.00027806184,0.00012621933,0.0016893548,0.00040730226,0.00003789589,0.000668783,0.0003653817,0.29192713,0.019257996,0.4806736,0.00995623,0.19461204],"study_design_scores_gemma":[0.00006538843,0.00009481443,0.00041442478,0.00004623853,0.000020307223,0.00027189453,0.00008155093,0.72115076,0.013567354,0.2523873,0.011880211,0.000019752348],"about_ca_topic_score_codex":0.00045795742,"about_ca_topic_score_gemma":0.0007049039,"teacher_disagreement_score":0.00735007,"about_ca_system_score_codex":0.00042949925,"about_ca_system_score_gemma":0.00034876147,"threshold_uncertainty_score":0.024588406},"labels":[],"label_agreement":null},{"id":"W4283651127","doi":"10.1007/s00453-022-00990-4","title":"Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Università degli Studi di Firenze","keywords":"Algorithm; Intersection graph; Intersection (aeronautics); Graph; Computer science; Combinatorics; Mathematics; Line graph","score_opus":0.01854088776824441,"score_gpt":0.24027197416033086,"score_spread":0.22173108639208644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283651127","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.9066116,0.00046705425,0.06703887,0.002341816,0.000042319094,0.00015278606,0.003553234,0.00055551674,0.019236762],"genre_scores_gemma":[0.9526454,0.00029776565,0.032732073,0.00028995785,0.000087797365,0.00018953474,0.0059009898,0.00022512057,0.0076312823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761945,0.00052978884,0.00014700221,0.00059999264,0.0006715646,0.00043217908],"domain_scores_gemma":[0.9884166,0.006527628,0.002241667,0.0007401672,0.0009713984,0.0011025094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009628018,0.00072081503,0.0010642587,0.0029599483,0.0023691806,0.007776485,0.0023463035,0.0021490229,0.012607556],"category_scores_gemma":[0.0092227375,0.0011465215,0.0011783908,0.0037468013,0.002349004,0.010406791,0.0029736992,0.0021841314,0.0010910726],"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.0014623227,0.00059717236,0.022881372,0.0008261579,0.00022887993,0.0011419684,0.0033664163,0.12418919,0.007792381,0.77731514,0.015203348,0.044995576],"study_design_scores_gemma":[0.00013027061,0.000107839005,0.0051426785,0.00009133354,0.000087814005,0.000589147,0.0011509099,0.18600534,0.0041216007,0.7945374,0.007970193,0.000065322514],"about_ca_topic_score_codex":0.0037953279,"about_ca_topic_score_gemma":0.0037251844,"teacher_disagreement_score":0.012607556,"about_ca_system_score_codex":0.0033093418,"about_ca_system_score_gemma":0.0011468655,"threshold_uncertainty_score":0.042176425},"labels":[],"label_agreement":null},{"id":"W4283805190","doi":"10.1609/aaai.v36i4.20280","title":"Undercover Boolean Matrix Factorization with MaxSAT","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut Universitaire de Gériatrie de Montréal; Université du Québec à Montréal","funders":"","keywords":"Maximum satisfiability problem; Logical matrix; Factorization; Matrix (chemical analysis); Mathematics; Implicant; Combinatorics; Discrete mathematics; Block (permutation group theory); Product (mathematics); Algorithm; Boolean function; Computer science; Boolean expression; Group (periodic table); Physics; Chemistry","score_opus":0.05503056819948492,"score_gpt":0.2889159486216709,"score_spread":0.23388538042218598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283805190","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.035100773,0.00043546292,0.9526215,0.00096649415,0.00008740394,0.00012823592,0.00084087986,0.002900348,0.0069187363],"genre_scores_gemma":[0.49758255,0.00046152665,0.49149624,0.0008394255,0.00018799996,0.00031855315,0.0028638672,0.00071586954,0.005533919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759966,0.00080549315,0.00009874262,0.00052956445,0.0006440062,0.00032256692],"domain_scores_gemma":[0.99432003,0.0033741568,0.0004129554,0.001385481,0.000381413,0.00012594699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001668806,0.0015121,0.0014031022,0.0008772045,0.0009291999,0.0023721952,0.0017000028,0.001691469,0.008899666],"category_scores_gemma":[0.0127725825,0.0007567216,0.0015743746,0.0013841703,0.0014589847,0.004974876,0.0024360304,0.0024596306,0.0019359196],"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.0008834945,0.00025734818,0.0023251853,0.00048576723,0.0001390603,0.00038425447,0.00039475935,0.54319817,0.007910819,0.14770663,0.029026235,0.2672884],"study_design_scores_gemma":[0.000055035638,0.00006260847,0.00018555656,0.00003722513,0.000017633496,0.00013491341,0.00007141137,0.85037005,0.0035116354,0.14270824,0.0028274346,0.000018236115],"about_ca_topic_score_codex":0.0032329145,"about_ca_topic_score_gemma":0.005969401,"teacher_disagreement_score":0.008899666,"about_ca_system_score_codex":0.0016142857,"about_ca_system_score_gemma":0.0020871945,"threshold_uncertainty_score":0.029772341},"labels":[],"label_agreement":null},{"id":"W4293334318","doi":"10.48550/arxiv.0905.1932","title":"C*-algebras of Penrose's hyperbolic tilings","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Invariant (physics); Mathematics; Affine transformation; Hyperbolic geometry; Substitution tiling; Pure mathematics; Order (exchange); Hyperbolic triangle; Harmonic; Combinatorics; Physics; Mathematical physics; Algebraic geometry; Quantum mechanics","score_opus":0.06197507930926001,"score_gpt":0.19479552636748354,"score_spread":0.13282044705822355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293334318","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77100354,0.0009800545,0.08953948,0.0005430579,0.00022881251,0.000102364174,0.00042985525,0.0002959899,0.13687676],"genre_scores_gemma":[0.9724295,0.00031887862,0.01361417,0.00015475857,0.00008172932,0.00004085435,0.0001931479,0.000036834143,0.013130151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962556,0.000048461316,0.000024721989,0.000074737356,0.0001309207,0.00009557341],"domain_scores_gemma":[0.9996105,0.00005183151,0.00007501686,0.000054009026,0.000087700006,0.000120941666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002929544,0.0003178589,0.0003411999,0.00096888945,0.0009456191,0.0017272071,0.000508541,0.0005155941,0.0049790135],"category_scores_gemma":[0.0006609345,0.00017761756,0.00039124594,0.0005967376,0.0016404549,0.0020857737,0.00088546396,0.0008501901,0.0007722287],"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.000021044643,0.000014368619,0.0001581339,0.000024442636,0.0000033990705,0.00015194368,0.00017849127,0.0014558921,0.0027910508,0.99031514,0.00044854966,0.0044375705],"study_design_scores_gemma":[0.00002270698,0.000047869526,0.0005755453,0.000019628196,0.000005879694,0.00030262436,0.00029446973,0.01107784,0.0039534452,0.97674805,0.006921723,0.000030206284],"about_ca_topic_score_codex":0.0015001505,"about_ca_topic_score_gemma":0.0009882071,"teacher_disagreement_score":0.0049790135,"about_ca_system_score_codex":0.0007589853,"about_ca_system_score_gemma":0.00049698417,"threshold_uncertainty_score":0.016656458},"labels":[],"label_agreement":null},{"id":"W4296980399","doi":"10.1561/0600000008","title":"Computational Symmetry in Computer Vision and Computer Graphics","year":2010,"lang":"en","type":"article","venue":"Foundations and Trends® in Computer Graphics and Vision","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer graphics; Computer science; Computer graphics (images); Symmetry (geometry); Artificial intelligence; Graphics; Computer graphics lighting; Computer vision; Real-time computer graphics; 3D computer graphics; Mathematics; Geometry","score_opus":0.014541628458716843,"score_gpt":0.31434496225495406,"score_spread":0.29980333379623725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296980399","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.011297098,0.06756387,0.8297903,0.008839707,0.0013141864,0.00010930232,0.0002818975,0.0005583582,0.08024528],"genre_scores_gemma":[0.4269926,0.08168343,0.45771587,0.0023788346,0.0046031736,0.00037431583,0.00097217533,0.00048886426,0.024790732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849296,0.0005015963,0.00009587834,0.00026965322,0.00053336733,0.00010661681],"domain_scores_gemma":[0.99787784,0.0012370478,0.00014323139,0.00036073982,0.000305769,0.0000754759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017390348,0.000682605,0.00074892456,0.0020037394,0.0011143363,0.004104242,0.0012526417,0.0014845225,0.007549374],"category_scores_gemma":[0.0055383495,0.00046029952,0.0007003386,0.0027170093,0.004773607,0.007330925,0.0019193782,0.002663793,0.0017250321],"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.000014147909,0.0000098962555,0.000189228,0.00018065149,0.000012349078,0.000040997213,0.00010675813,0.0028517297,0.0005191254,0.92733455,0.0070910505,0.061649535],"study_design_scores_gemma":[0.0000066766656,0.000018662457,0.00024013544,0.000077899174,0.0000066566836,0.00012918768,0.000081862796,0.012725689,0.00064791023,0.9376224,0.048425272,0.000017591208],"about_ca_topic_score_codex":0.0013213464,"about_ca_topic_score_gemma":0.0009788801,"teacher_disagreement_score":0.007549374,"about_ca_system_score_codex":0.0014027775,"about_ca_system_score_gemma":0.0015481367,"threshold_uncertainty_score":0.025255203},"labels":[],"label_agreement":null},{"id":"W4312011719","doi":"10.5281/zenodo.7454825","title":"Certifying Maximum Likelihood Degrees of Matroid Strata","year":2022,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Matroid; Maximum likelihood; Mathematics; Combinatorics; Statistics","score_opus":0.07251832810439324,"score_gpt":0.1872367767874126,"score_spread":0.11471844868301936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312011719","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.18613243,0.00015716786,0.8033592,0.00049533625,0.000048272133,0.00015815285,0.0010124953,0.0021441865,0.0064927875],"genre_scores_gemma":[0.8601409,0.000082126724,0.13492174,0.00011129031,0.00008922886,0.00015168644,0.001629718,0.00035972538,0.002513611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499536,0.0010473124,0.00029694024,0.00091840746,0.002074756,0.0006671999],"domain_scores_gemma":[0.97454506,0.012162513,0.0020320434,0.006924518,0.003398187,0.0009376474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004252131,0.0007047998,0.0009749663,0.0023119773,0.0009456515,0.0039871093,0.0019897523,0.0013499645,0.005866195],"category_scores_gemma":[0.04672366,0.0008193881,0.0017226065,0.0014451197,0.002394675,0.0049042045,0.0035772012,0.0032540748,0.0015247915],"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.0007676037,0.00019215108,0.026011907,0.00036477746,0.00012261611,0.00042718486,0.0011277159,0.26716927,0.017927354,0.554291,0.006063513,0.12553492],"study_design_scores_gemma":[0.00006804468,0.00014779838,0.0036104878,0.000066035755,0.000029549215,0.0003238058,0.00019382943,0.60090595,0.024765642,0.36562523,0.004175856,0.000087796834],"about_ca_topic_score_codex":0.0019293745,"about_ca_topic_score_gemma":0.0022677958,"teacher_disagreement_score":0.005866195,"about_ca_system_score_codex":0.0025392347,"about_ca_system_score_gemma":0.0018019635,"threshold_uncertainty_score":0.0224877},"labels":[],"label_agreement":null},{"id":"W4313829820","doi":"10.21203/rs.3.rs-1219938/v1","title":"A Coordinate-based Fuzzy Encoding Strategy for Compressing Grayscale Images","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Recruitment Program of Global Experts; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Grayscale; Encoding (memory); Computer science; Fuzzy logic; Computer vision; Artificial intelligence; Computer graphics (images); Image (mathematics)","score_opus":0.21376166741022595,"score_gpt":0.45148780446872644,"score_spread":0.2377261370585005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313829820","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.044271268,0.00043877694,0.9517814,0.00010542846,0.00008415821,0.00004933492,0.00006377488,0.00029476723,0.00291118],"genre_scores_gemma":[0.49053618,0.000711707,0.5034484,0.00009707386,0.00009758121,0.00006890878,0.00012845304,0.00005965554,0.0048520016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988115,0.000015588335,0.000010473462,0.000030365796,0.000048895563,0.000013507844],"domain_scores_gemma":[0.99976534,0.000048527112,0.000024227566,0.00004197277,0.00010275953,0.000017295944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015971261,0.00038173707,0.00036385257,0.0005879732,0.00029178953,0.00059295347,0.00043889176,0.00034778917,0.0020742451],"category_scores_gemma":[0.0006351389,0.0001336543,0.00022651708,0.00066344975,0.00033489804,0.00072747027,0.0003020669,0.00033644275,0.00047340035],"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.0004786178,0.00011292499,0.00036459134,0.00020107628,0.000030453028,0.0002533551,0.00018724253,0.030417113,0.37777656,0.041549895,0.002279309,0.54634887],"study_design_scores_gemma":[0.00005143613,0.00047907617,0.00092548976,0.000039171613,0.00009523056,0.0006491916,0.0001310371,0.7912712,0.18688674,0.010865115,0.008543735,0.00006250319],"about_ca_topic_score_codex":0.0018734247,"about_ca_topic_score_gemma":0.001884677,"teacher_disagreement_score":0.0020742451,"about_ca_system_score_codex":0.00028749256,"about_ca_system_score_gemma":0.0003070728,"threshold_uncertainty_score":0.0069390535},"labels":[],"label_agreement":null},{"id":"W4382322930","doi":"10.48550/arxiv.2306.14465","title":"Connectedness, Continuity, and Proximities in Temporal Digital Topology","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Social connectedness; Topology (electrical circuits); Topological space; Digital topology; Focus (optics); Computer science; Sequence (biology); Mathematics; Discrete mathematics; General topology; Extension topology; Physics; Combinatorics","score_opus":0.0805932290420152,"score_gpt":0.20786151600537617,"score_spread":0.12726828696336095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382322930","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.073200576,0.0026789398,0.8814393,0.0017376068,0.00039616544,0.00011917411,0.00057150057,0.00023346515,0.039623264],"genre_scores_gemma":[0.72758716,0.0036673227,0.254325,0.00047137277,0.0007077574,0.00036951253,0.0010675745,0.0001819824,0.011622218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797004,0.00048929144,0.00022273972,0.0005861966,0.0006190986,0.00011265337],"domain_scores_gemma":[0.9952709,0.0021396938,0.0005938435,0.0007049847,0.0008630111,0.00042761015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019076876,0.00049334817,0.00051246496,0.003349739,0.0016109479,0.0038927253,0.0009071956,0.0009847442,0.004129763],"category_scores_gemma":[0.0077369036,0.00044155083,0.00084474345,0.003234633,0.0069440845,0.010179724,0.0035264364,0.0030221143,0.0005840587],"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.000017173934,0.0000072752027,0.00024948173,0.0000493378,0.000006706169,0.00010567026,0.00038127607,0.0014750669,0.0006642113,0.98946124,0.00028474297,0.0072978046],"study_design_scores_gemma":[0.000009178764,0.00005403593,0.0006938248,0.00004561961,0.000017230646,0.00049916236,0.00043760668,0.010977924,0.0012360839,0.9628888,0.023115778,0.000024738436],"about_ca_topic_score_codex":0.0013975698,"about_ca_topic_score_gemma":0.0010180217,"teacher_disagreement_score":0.004129763,"about_ca_system_score_codex":0.001141352,"about_ca_system_score_gemma":0.000740855,"threshold_uncertainty_score":0.013815463},"labels":[],"label_agreement":null},{"id":"W4383566755","doi":"10.1016/b978-0-12-805320-1.00007-5","title":"Graph cuts","year":2023,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Graph; Binary number; Cut; Theoretical computer science; Mathematical optimization; Conditional random field; Combinatorial optimization; Segmentation; Algorithm; Artificial intelligence; Image segmentation; Mathematics; Arithmetic","score_opus":0.024802814414626038,"score_gpt":0.25516258230871763,"score_spread":0.2303597678940916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383566755","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047062254,0.0061554355,0.4732922,0.0020003594,0.0017146276,0.00025695792,0.0032726878,0.003628692,0.50497276],"genre_scores_gemma":[0.063791566,0.0092337085,0.41179198,0.0011826418,0.00093228294,0.0004146992,0.009914977,0.0031139345,0.49962422],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995233,0.00006408439,0.000014968879,0.0001506142,0.00020487847,0.000042154094],"domain_scores_gemma":[0.9994246,0.00019304852,0.000033276217,0.00016488992,0.00013519167,0.00004909092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035893297,0.0013334455,0.0008217029,0.002074321,0.00075626525,0.0026290994,0.0012426173,0.0013131384,0.09782254],"category_scores_gemma":[0.0018429742,0.00073872914,0.0007063134,0.002590611,0.0007936368,0.002145394,0.0011813883,0.0024533023,0.03491819],"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.000058458696,0.000066140376,0.00015179887,0.0003538347,0.00003640745,0.000083101615,0.00009335306,0.013122958,0.0026853418,0.20193198,0.2561383,0.52527833],"study_design_scores_gemma":[0.000029143026,0.000044940753,0.0004911109,0.00023336221,0.000031956326,0.00043262995,0.00012125975,0.03655381,0.0026125773,0.4403273,0.5190974,0.000024427478],"about_ca_topic_score_codex":0.0023317703,"about_ca_topic_score_gemma":0.0036205791,"teacher_disagreement_score":0.09782254,"about_ca_system_score_codex":0.00088052364,"about_ca_system_score_gemma":0.0008190438,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4384342517","doi":"10.4171/8ecm/37","title":"From art and circuit design to geometry and combinatorics","year":2023,"lang":"en","type":"book-chapter","venue":"EMS Press eBooks","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Geodesic; Combinatorics; Mathematics; Class (philosophy); Geometry; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.07514284951377916,"score_gpt":0.25768092123805203,"score_spread":0.1825380717242729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384342517","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.0030679246,0.012789287,0.07608724,0.002332403,0.0010100306,0.000035836383,0.00017293131,0.00033958163,0.90416485],"genre_scores_gemma":[0.11949436,0.026896803,0.04842708,0.001322679,0.0010850932,0.00013269766,0.00033474184,0.00043401675,0.8018726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998461,0.000027789432,0.0000054584757,0.000029837516,0.00007106229,0.000019702878],"domain_scores_gemma":[0.9997731,0.00011778137,0.000008793065,0.00004749358,0.00003814506,0.00001463859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001540073,0.00051002426,0.00030355743,0.00078494643,0.0007961599,0.0023322804,0.00072287803,0.0006597897,0.037933268],"category_scores_gemma":[0.00057771115,0.00031681304,0.00036303367,0.0012714838,0.0018268636,0.0020356285,0.0005727586,0.0014032766,0.006529938],"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.000009866034,0.000009769912,0.000035252127,0.00013392142,0.0000042984607,0.000029267268,0.000098126475,0.002263605,0.00064563117,0.87473327,0.040613282,0.0814237],"study_design_scores_gemma":[0.0000048139855,0.000019224603,0.00010650975,0.00008738722,0.000004407609,0.00014917243,0.00006238081,0.0021348104,0.0007522047,0.45565087,0.5410196,0.000008652572],"about_ca_topic_score_codex":0.0011471747,"about_ca_topic_score_gemma":0.002283445,"teacher_disagreement_score":0.037933268,"about_ca_system_score_codex":0.0017924766,"about_ca_system_score_gemma":0.00060992053,"threshold_uncertainty_score":0.12689942},"labels":[],"label_agreement":null},{"id":"W4387305967","doi":"10.1016/j.ejc.2023.103813","title":"Hereditary classes of ordered sets of width at most two","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of Calgary","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics","score_opus":0.022747337532556283,"score_gpt":0.2716756933517104,"score_spread":0.2489283558191541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387305967","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.8832438,0.00040511045,0.077324964,0.0007678721,0.00007079925,0.000044040316,0.00094682473,0.0004619043,0.03673468],"genre_scores_gemma":[0.9799009,0.0001952968,0.008158436,0.00013062383,0.00010100472,0.000060918544,0.0007680755,0.00010902795,0.010575663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.00016511392,0.00005490358,0.0002296327,0.00021633513,0.00026556794],"domain_scores_gemma":[0.994863,0.003280071,0.0004730375,0.00038110808,0.00022890781,0.00077383954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082962395,0.00046725495,0.0006038032,0.0019514451,0.0017776595,0.0036723607,0.0013871553,0.00064714625,0.010711509],"category_scores_gemma":[0.0037486015,0.0008102039,0.00063255726,0.0015030783,0.0020932716,0.004752276,0.0015563545,0.0012300115,0.0005228818],"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.00028428118,0.000107023814,0.0034211369,0.00009604281,0.00004455795,0.00024838164,0.000759168,0.0024902786,0.0033087863,0.97400224,0.0032350263,0.012003018],"study_design_scores_gemma":[0.00010627461,0.000070182025,0.0048237382,0.000046090187,0.00007802678,0.0005502736,0.00054851547,0.018443586,0.004469215,0.96394813,0.006871601,0.000044270764],"about_ca_topic_score_codex":0.0010907245,"about_ca_topic_score_gemma":0.0013303966,"teacher_disagreement_score":0.010711509,"about_ca_system_score_codex":0.0017335477,"about_ca_system_score_gemma":0.00064537395,"threshold_uncertainty_score":0.035833597},"labels":[],"label_agreement":null},{"id":"W4389339495","doi":"10.1145/3618308","title":"Analysis and Synthesis of Digital Dyadic Sequences","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Sequence (biology); Rendering (computer graphics); Subspace topology; Computer science; Sobol sequence; Net (polyhedron); Mathematics; Computer graphics; Graphics; Set (abstract data type); Base (topology); Sequence space; Algorithm; Theoretical computer science; Discrete mathematics; Computer graphics (images); Artificial intelligence; Geometry","score_opus":0.024053240524807576,"score_gpt":0.27197999196080247,"score_spread":0.2479267514359949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389339495","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.087338805,0.0002653795,0.8987067,0.00006616819,0.00005697184,0.00003774388,0.000088735396,0.00024489345,0.013194682],"genre_scores_gemma":[0.6515626,0.0003601371,0.3356675,0.000060355087,0.000038843245,0.00010465166,0.00025711922,0.00011338066,0.0118354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998085,0.000036226407,0.000011390244,0.000043455857,0.00007837691,0.000022015553],"domain_scores_gemma":[0.9996966,0.000101180856,0.000048897124,0.000039004004,0.00008824595,0.000026190271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002359434,0.0003756636,0.00022522922,0.00064885354,0.0002484496,0.0005547048,0.00030633446,0.00029316955,0.0041251713],"category_scores_gemma":[0.0009819345,0.00016587137,0.00018741211,0.0003993606,0.00045352173,0.00062176515,0.00038686197,0.00030611726,0.0004955896],"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.0002117073,0.000056849705,0.0012353483,0.00024949593,0.000021959233,0.0002747244,0.00023321318,0.2911848,0.08291742,0.4596136,0.0014027584,0.16259818],"study_design_scores_gemma":[0.000021510594,0.00021082544,0.0004992163,0.00004180668,0.000013456312,0.0002880307,0.00011575386,0.85577816,0.04102387,0.08573017,0.016252914,0.00002424977],"about_ca_topic_score_codex":0.0004806199,"about_ca_topic_score_gemma":0.0006795734,"teacher_disagreement_score":0.0041251713,"about_ca_system_score_codex":0.00041823514,"about_ca_system_score_gemma":0.00030791387,"threshold_uncertainty_score":0.013800085},"labels":[],"label_agreement":null},{"id":"W4389504647","doi":"10.1007/s00454-023-00615-9","title":"Improved Estimates on the Number of Unit Perimeter Triangles","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Perimeter; Mathematics; Combinatorics; Plane (geometry); Integer (computer science); Unit (ring theory); Point (geometry); Section (typography); Grid; Upper and lower bounds; Set (abstract data type); Geometry; Computer science; Mathematical analysis","score_opus":0.03385344117330329,"score_gpt":0.3233221951589076,"score_spread":0.2894687539856043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389504647","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.028537301,0.0039642695,0.9088353,0.0015324276,0.0011842784,0.00011281753,0.0010254276,0.0008599895,0.05394813],"genre_scores_gemma":[0.27089217,0.005429667,0.6684111,0.0007873076,0.002240633,0.0005387649,0.0022848886,0.0017432285,0.047672186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971738,0.00067589193,0.00016329154,0.00055257307,0.001170689,0.00026369217],"domain_scores_gemma":[0.9821323,0.011086913,0.00068165717,0.0025361206,0.0027739743,0.0007890656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029663118,0.002468448,0.0018735745,0.006386233,0.00091898703,0.002925107,0.0047101337,0.0019534754,0.022839738],"category_scores_gemma":[0.025065515,0.0010408325,0.0016546975,0.0029544523,0.0025045625,0.008512401,0.0050908816,0.0062211715,0.005791473],"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.00078079005,0.00024291205,0.004409462,0.0011403706,0.00014126468,0.00045715988,0.0005168775,0.08241931,0.020832932,0.6615705,0.028674426,0.19881396],"study_design_scores_gemma":[0.00006700671,0.00016396627,0.003991172,0.00026257968,0.00010844238,0.00059579755,0.00020805604,0.53936696,0.009716732,0.4121875,0.0332202,0.000111602945],"about_ca_topic_score_codex":0.0017703789,"about_ca_topic_score_gemma":0.0029296307,"teacher_disagreement_score":0.022839738,"about_ca_system_score_codex":0.0016937347,"about_ca_system_score_gemma":0.00071781216,"threshold_uncertainty_score":0.07640648},"labels":[],"label_agreement":null},{"id":"W4389747813","doi":"10.1109/tvcg.2023.3343166","title":"Cone-Traced Supersampling With Subpixel Edge Reconstruction","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Visualization and Computer Graphics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Huawei Technologies (Canada)","funders":"","keywords":"Subpixel rendering; Computer science; Computer vision; Computer graphics (images); Artificial intelligence; Enhanced Data Rates for GSM Evolution; Visual hull; Iterative reconstruction; Visualization; Pixel","score_opus":0.025993468721322167,"score_gpt":0.27885170196264003,"score_spread":0.25285823324131784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389747813","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.010476414,0.000036784175,0.9872143,0.000021942851,0.000015453808,0.00003474942,0.0000436399,0.000888594,0.001268053],"genre_scores_gemma":[0.119896054,0.000086757515,0.876967,0.000041076353,0.0000140049315,0.000049619415,0.0002468745,0.00036866707,0.0023299844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999571,0.000041479034,0.000016763313,0.000049835493,0.00028509714,0.000035657456],"domain_scores_gemma":[0.9994247,0.00012921679,0.000063422194,0.00018059189,0.00016270849,0.000039436487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044381182,0.00066188606,0.0004706061,0.00071304064,0.00022119442,0.0008315987,0.0007997584,0.00050393946,0.0032285154],"category_scores_gemma":[0.0015244719,0.00031209944,0.0005019093,0.0005474039,0.00034929038,0.000695527,0.0010069578,0.0007077422,0.0007785255],"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.0003539967,0.00019586128,0.0024896648,0.00017927775,0.000054550164,0.00042531404,0.00049263996,0.26058027,0.1360853,0.045757838,0.006551791,0.54683363],"study_design_scores_gemma":[0.000017203605,0.00006325851,0.00029793376,0.000009139921,0.0000065761337,0.00020497241,0.000031627485,0.95812833,0.030450948,0.0042955745,0.006477189,0.00001727054],"about_ca_topic_score_codex":0.003002384,"about_ca_topic_score_gemma":0.0048343698,"teacher_disagreement_score":0.0032285154,"about_ca_system_score_codex":0.00038228845,"about_ca_system_score_gemma":0.0011265283,"threshold_uncertainty_score":0.010800481},"labels":[],"label_agreement":null},{"id":"W4390018014","doi":"10.1137/1.9781611977806","title":"An Introduction to Convexity, Optimization, and Algorithms","year":2023,"lang":"en","type":"book","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Convexity; Computer science; Algorithm; Economics","score_opus":0.050747356756038225,"score_gpt":0.2756462767649708,"score_spread":0.22489892000893255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390018014","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013302492,0.18562587,0.25051564,0.009164724,0.01115661,0.00015215448,0.0011269734,0.0013849853,0.53954285],"genre_scores_gemma":[0.040383965,0.24676332,0.2409405,0.009921763,0.017559215,0.00067262683,0.0016648453,0.0023752148,0.43971857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926025,0.00016711061,0.000040321964,0.0001080771,0.0003717786,0.000052557563],"domain_scores_gemma":[0.9991499,0.0005715459,0.00003439881,0.00007319918,0.00013915598,0.00003181358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079123024,0.0019483309,0.001679981,0.0019026777,0.00083995925,0.0031199637,0.0012553864,0.0012073634,0.030194977],"category_scores_gemma":[0.0020595412,0.00067033136,0.0011862353,0.0037903122,0.0029919527,0.0034094867,0.0015029137,0.004661637,0.0140186595],"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.000020766587,0.00002811413,0.00008999422,0.00058775203,0.000027799579,0.00008628519,0.000082197694,0.0030202575,0.0005704852,0.52401245,0.34737518,0.12409871],"study_design_scores_gemma":[0.000008503,0.000026000176,0.00031510016,0.00035780892,0.000013239353,0.00031236044,0.000054284763,0.005015065,0.00041139216,0.31504998,0.6784096,0.000026755404],"about_ca_topic_score_codex":0.0020401448,"about_ca_topic_score_gemma":0.0033821499,"teacher_disagreement_score":0.030194977,"about_ca_system_score_codex":0.0013482826,"about_ca_system_score_gemma":0.0018920088,"threshold_uncertainty_score":0.10101223},"labels":[],"label_agreement":null},{"id":"W4390843319","doi":"10.1007/978-3-031-52213-0","title":"Algorithms and Discrete Applied Mathematics","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Indian Institute of Technology Guwahati; Indian Institute of Technology Kharagpur; Univerza v Ljubljani; Freie Universität Berlin; Université de Bordeaux; Indian Institute of Technology Delhi; Ben-Gurion University of the Negev; Technische Universiteit Eindhoven; Indian Institute of Technology Bhilai; Indian Institute of Technology Palakkad; University of Ottawa; Indian Institute of Technology Gandhinagar; Institute of Mathematical Sciences; University of Lethbridge; Indian Institute of Technology Kanpur; Indian Institute of Science","keywords":"Computer science; Theoretical computer science; Algorithm; Calculus (dental); Algebra over a field; Mathematics; Pure mathematics","score_opus":0.013166751723277479,"score_gpt":0.2623623419255963,"score_spread":0.24919559020231885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390843319","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.0060500554,0.06749788,0.3057248,0.0048638275,0.0075395177,0.00009307887,0.0007337191,0.0010109124,0.6064862],"genre_scores_gemma":[0.13729769,0.07622014,0.14366595,0.0022242283,0.010739989,0.0004439095,0.0014547987,0.0012445345,0.62670875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959904,0.000075536045,0.00001994981,0.000071314484,0.00020325938,0.000030886495],"domain_scores_gemma":[0.99961793,0.000174097,0.000022308399,0.00008427441,0.000072276736,0.000029054212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035129808,0.0013416519,0.0018449067,0.0019469934,0.0008651216,0.0032381804,0.0008681841,0.000747652,0.027993783],"category_scores_gemma":[0.0012682091,0.000439267,0.00063504593,0.0039951596,0.001660449,0.0026142846,0.0011695911,0.0033982254,0.012483661],"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.000020873307,0.000031974327,0.00009671198,0.000338027,0.00002226039,0.000033867156,0.000101786456,0.0019543222,0.0008866982,0.74086064,0.07415821,0.18149462],"study_design_scores_gemma":[0.000015132876,0.000026179778,0.00034366577,0.000090606525,0.00001604684,0.00020631109,0.000045232835,0.006650806,0.00040469939,0.72204643,0.2701431,0.000011753888],"about_ca_topic_score_codex":0.00047270663,"about_ca_topic_score_gemma":0.0005572992,"teacher_disagreement_score":0.027993783,"about_ca_system_score_codex":0.0011514807,"about_ca_system_score_gemma":0.00073022844,"threshold_uncertainty_score":0.09364849},"labels":[],"label_agreement":null},{"id":"W4391335640","doi":"10.28924/2291-8639-22-2024-20","title":"Fixed Point Set and Equivariant Map of a S-Topological Transformation Group","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Digital Image Processing Techniques","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; Equivariant map; Fixed point; Closure (psychology); Topological group; Group (periodic table); Fixed-point property; Isomorphism (crystallography); Homomorphism; Topology (electrical circuits); Transformation (genetics); Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.014201558350570371,"score_gpt":0.31030324630183365,"score_spread":0.2961016879512633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391335640","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.7854613,0.00045125955,0.18296196,0.00031364066,0.00007808343,0.00007530301,0.00017036538,0.0002388895,0.030249085],"genre_scores_gemma":[0.97521055,0.00022809263,0.015445182,0.000044418026,0.0000687527,0.00007122147,0.00019695921,0.000042789132,0.008692143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947315,0.000069253394,0.000028284067,0.00019145817,0.00014223323,0.000095669166],"domain_scores_gemma":[0.99956423,0.00010175537,0.00009490615,0.000057793804,0.0000846474,0.000096806536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003328168,0.0003404045,0.0004838585,0.002029823,0.0010249248,0.0013869784,0.00051477284,0.00045940027,0.0036269012],"category_scores_gemma":[0.00083452,0.00020049847,0.0009688076,0.0005481839,0.0018559836,0.0015702298,0.0016073297,0.0007466438,0.0004176047],"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.000120071156,0.000047518395,0.0019100659,0.000050993316,0.000031809133,0.0006320147,0.0012400557,0.0035874553,0.024452355,0.9477185,0.00036856762,0.019840663],"study_design_scores_gemma":[0.00006921711,0.0004638684,0.0036647907,0.000037355432,0.000060970106,0.0014013486,0.0009859634,0.045252312,0.02607453,0.906817,0.015087513,0.00008523899],"about_ca_topic_score_codex":0.000892844,"about_ca_topic_score_gemma":0.00031574018,"teacher_disagreement_score":0.0036269012,"about_ca_system_score_codex":0.00075744884,"about_ca_system_score_gemma":0.00044940732,"threshold_uncertainty_score":0.012133241},"labels":[],"label_agreement":null},{"id":"W4391517886","doi":"10.51926/iste.9781784059545","title":"Articulations entre les espaces sensible, graphique et géométrique","year":2023,"lang":"fr","type":"book","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Art","score_opus":0.061138526431073016,"score_gpt":0.30567171120728803,"score_spread":0.24453318477621502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391517886","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.14294283,0.009902397,0.18197726,0.011119874,0.0008104557,0.00014852574,0.00040372674,0.00077842636,0.65191644],"genre_scores_gemma":[0.7920248,0.0053895414,0.038541336,0.0010791662,0.00022933864,0.00009949337,0.0003798299,0.0005769682,0.16167946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99628866,0.0012101408,0.00011827686,0.0007126898,0.0012613373,0.00040895728],"domain_scores_gemma":[0.994958,0.0019998082,0.00033940776,0.0009936705,0.0012450186,0.0004640769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031313566,0.0010050763,0.00051927543,0.0035252422,0.0051620738,0.011329943,0.0012340801,0.0023519313,0.023245465],"category_scores_gemma":[0.0054028346,0.00050259917,0.00076249294,0.0036982237,0.01803178,0.006975581,0.0046547013,0.002814087,0.0028798154],"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.00006111652,0.000021634414,0.003593419,0.00031094206,0.000026488944,0.0004836405,0.06539421,0.0006180485,0.0044626687,0.8382217,0.006986819,0.07981923],"study_design_scores_gemma":[0.000012649499,0.00006774228,0.022632638,0.00064314815,0.000049460596,0.0012205332,0.062208407,0.001982093,0.0034563423,0.17685291,0.7307531,0.000120974844],"about_ca_topic_score_codex":0.07345028,"about_ca_topic_score_gemma":0.112391435,"teacher_disagreement_score":0.07345028,"about_ca_system_score_codex":0.01075835,"about_ca_system_score_gemma":0.00624267,"threshold_uncertainty_score":0.1460455},"labels":[],"label_agreement":null},{"id":"W4392575374","doi":"10.48550/arxiv.2403.03365","title":"Rigid Matroid Categories","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.05652373276641975,"score_gpt":0.19468394202025496,"score_spread":0.1381602092538352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392575374","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.18324946,0.0012239951,0.5884127,0.0015993234,0.00041422388,0.00025184223,0.0006791351,0.001157955,0.22301134],"genre_scores_gemma":[0.76961654,0.00087557343,0.17417622,0.0004990656,0.00032889255,0.0002717138,0.00095964037,0.00020560756,0.053066704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844307,0.00023818351,0.000101395715,0.00032380663,0.0006491613,0.00024441088],"domain_scores_gemma":[0.9989668,0.00013652965,0.00014213054,0.0002692774,0.0002281077,0.0002571929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009824118,0.00053118984,0.00036232523,0.0014713724,0.0019230521,0.0029608025,0.0012605091,0.0009200186,0.008841203],"category_scores_gemma":[0.0013110128,0.0003093079,0.0009278671,0.0010403785,0.0030026739,0.004876202,0.0044428627,0.0016195732,0.0018989035],"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.000009569009,0.000010243399,0.00018577672,0.000018507937,0.000003839531,0.000088048866,0.00024816798,0.00035679011,0.0011120059,0.99265265,0.00050330587,0.00481097],"study_design_scores_gemma":[0.000015241912,0.000090877664,0.00067517516,0.000040098006,0.000023017828,0.0010282628,0.0006875374,0.0069075595,0.00451228,0.88395727,0.10203014,0.00003257434],"about_ca_topic_score_codex":0.0009138471,"about_ca_topic_score_gemma":0.000726714,"teacher_disagreement_score":0.008841203,"about_ca_system_score_codex":0.00077333814,"about_ca_system_score_gemma":0.0005709164,"threshold_uncertainty_score":0.029576838},"labels":[],"label_agreement":null},{"id":"W4392915244","doi":"10.3390/sym16030368","title":"Recent Developments in Iterative Algorithms for Digital Metrics","year":2024,"lang":"en","type":"article","venue":"Symmetry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"King Abdulaziz University","keywords":"Fixed point; Computer science; Metric space; Iterative method; Iterative and incremental development; Algorithm; Theoretical computer science; Digital image; Frame (networking); Mathematics; Image (mathematics); Discrete mathematics; Computer vision; Image processing; Mathematical analysis","score_opus":0.03564303878373219,"score_gpt":0.32007121460470683,"score_spread":0.2844281758209746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392915244","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.015607309,0.15613425,0.7633938,0.0037053463,0.0016732465,0.0000841187,0.00009794133,0.00022390341,0.059080113],"genre_scores_gemma":[0.27951565,0.15765725,0.5381648,0.0011753414,0.00613781,0.00023693388,0.00024589596,0.00024715354,0.01661923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833006,0.00050327234,0.00016664216,0.00026908366,0.00064772856,0.000083257015],"domain_scores_gemma":[0.99598664,0.0024138424,0.00019475268,0.0005826063,0.0007033132,0.00011886749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002502712,0.0008325641,0.00077311305,0.0021290944,0.00051488297,0.0019430214,0.0010814907,0.001316749,0.0025617527],"category_scores_gemma":[0.007669387,0.0005212138,0.0010659111,0.0030066448,0.0028279219,0.003991954,0.0016968045,0.0028205817,0.00080887944],"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.000029044975,0.000023605382,0.00026863196,0.0006320295,0.00003390705,0.00008164312,0.00028581137,0.01048793,0.0014044188,0.8870058,0.0019015362,0.09784568],"study_design_scores_gemma":[0.000027308786,0.0001934232,0.00064573716,0.00040393826,0.000049067152,0.00084850687,0.0001857743,0.14190374,0.0044087516,0.6502339,0.20100918,0.00009070337],"about_ca_topic_score_codex":0.00095671497,"about_ca_topic_score_gemma":0.0005596061,"teacher_disagreement_score":0.0025617527,"about_ca_system_score_codex":0.001469019,"about_ca_system_score_gemma":0.000995699,"threshold_uncertainty_score":0.013235748},"labels":[],"label_agreement":null},{"id":"W4394880856","doi":"10.26493/1855-3974.3087.f36","title":"Z_3^8 is not a CI-group","year":2024,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Group (periodic table); Chemistry","score_opus":0.0324005936871241,"score_gpt":0.283248272130124,"score_spread":0.2508476784429999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394880856","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.44637063,0.0013610662,0.06911269,0.00631903,0.0014522976,0.00015392387,0.0013613037,0.0011741021,0.47269484],"genre_scores_gemma":[0.892448,0.00068492355,0.023103885,0.0009326484,0.00024030366,0.000119443335,0.0013931359,0.00018794191,0.08088958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995121,0.000047929396,0.000027345075,0.00015473716,0.00011446626,0.00014352221],"domain_scores_gemma":[0.99950063,0.00012412416,0.00010170175,0.00007279798,0.00011141867,0.00008924841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003221317,0.00040090733,0.00066726486,0.0006359257,0.0014900649,0.0019771822,0.00051220274,0.0006440507,0.016039575],"category_scores_gemma":[0.00076974614,0.00023225928,0.0005489581,0.00061577547,0.0022823133,0.0022107288,0.0012201564,0.0015520946,0.0020393333],"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.00019064477,0.00003225112,0.0006849014,0.000079789774,0.000024737034,0.00033251735,0.00025931324,0.00039476212,0.004025782,0.96848226,0.0053310804,0.020162083],"study_design_scores_gemma":[0.00010808374,0.00008937397,0.0016284268,0.000032006275,0.00003805148,0.0006610238,0.0005144713,0.0022027446,0.007545541,0.7912933,0.19584225,0.000044732118],"about_ca_topic_score_codex":0.0020627817,"about_ca_topic_score_gemma":0.0017550396,"teacher_disagreement_score":0.016039575,"about_ca_system_score_codex":0.0013733166,"about_ca_system_score_gemma":0.00079836237,"threshold_uncertainty_score":0.05365777},"labels":[],"label_agreement":null},{"id":"W4396243272","doi":"10.1107/s2053273324002432","title":"Bond topology of chain, ribbon and tube silicates. Part II. Geometrical analysis of infinite 1D arrangements of (<i>T</i>O<sub>4</sub>)<sup> <i>n</i>−</sup> tetrahedra","year":2024,"lang":"en","type":"article","venue":"Acta Crystallographica Section A Foundations and Advances","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Ribbon; Tetrahedron; Tube (container); Chain (unit); Crystallography; Topology (electrical circuits); Materials science; Physics; Combinatorics; Composite material; Chemistry; Mathematics","score_opus":0.01120426548356616,"score_gpt":0.2588279666951089,"score_spread":0.24762370121154273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396243272","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.9945209,0.000111512614,0.002763036,0.00001672722,0.000002850457,0.000006960525,0.000099647645,0.00002027583,0.0024581335],"genre_scores_gemma":[0.9954014,0.00008412726,0.0036141286,0.000005375999,0.0000021198398,0.000013360822,0.0002698038,0.000011931374,0.00059776264],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999511,0.00000879053,0.0000038037247,0.000011678614,0.000017227165,0.000007354527],"domain_scores_gemma":[0.9998872,0.000033272543,0.00003216096,0.00001643749,0.000015160671,0.000015785125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004650162,0.00011608859,0.000111531146,0.0005846421,0.00024384749,0.00035344448,0.0002827486,0.0002771235,0.0015811778],"category_scores_gemma":[0.00028056867,0.00014175494,0.00018668926,0.00031819424,0.00046858127,0.0003156544,0.000176558,0.00015133343,0.0001377543],"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.00053243584,0.00014145127,0.04966202,0.0005427731,0.000103279424,0.0014383886,0.0014292735,0.22373995,0.3744967,0.2765763,0.0019217723,0.069415666],"study_design_scores_gemma":[0.000050813214,0.00048816894,0.06550524,0.00004455022,0.00005820166,0.0016982694,0.0011793139,0.67380685,0.082544796,0.16326575,0.01125752,0.000100603254],"about_ca_topic_score_codex":0.00097154424,"about_ca_topic_score_gemma":0.001756528,"teacher_disagreement_score":0.0015811778,"about_ca_system_score_codex":0.00027475104,"about_ca_system_score_gemma":0.00011869682,"threshold_uncertainty_score":0.005289614},"labels":[],"label_agreement":null},{"id":"W4396826616","doi":"10.5267/j.ccl.2024.2.001","title":"Synthesis, characterization and biological activities of NiO-cellulose nanocomposite","year":2024,"lang":"en","type":"article","venue":"Current Chemistry Letters","topic":"Digital Image Processing Techniques","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":"Chemistry; Nanocomposite; Cellulose; Non-blocking I/O; Characterization (materials science); Nanotechnology; Chemical engineering; Organic chemistry; Combinatorial chemistry; Catalysis","score_opus":0.016323795640803298,"score_gpt":0.249489809258973,"score_spread":0.2331660136181697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396826616","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.9793226,0.0028146312,0.013323105,0.00009216304,0.00005109019,0.00009448512,0.0007349529,0.00012988671,0.003437119],"genre_scores_gemma":[0.9731209,0.0016886452,0.019474247,0.00005978779,0.000012250384,0.0001482228,0.000772737,0.000036602552,0.00468655],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999031,0.0000069330604,0.000013721439,0.000021100474,0.00004094313,0.000014285426],"domain_scores_gemma":[0.99988365,0.000017840146,0.000032389104,0.0000071947607,0.000036580335,0.00002223306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017021938,0.00031579766,0.00025287003,0.00024320617,0.0000976245,0.00018104259,0.00017263673,0.00020837643,0.00058838585],"category_scores_gemma":[0.00019707375,0.00010540062,0.0001702361,0.00021975214,0.00009388429,0.0001513213,0.00012333565,0.0002421534,0.00015732912],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000030463421,0.000021268477,0.00011792479,0.00007303893,0.0000025605561,0.0000441692,0.0000068438485,0.000101823054,0.9980775,0.000018454124,0.000016754218,0.001489164],"study_design_scores_gemma":[0.0000034199209,0.000117249874,0.0017102704,0.000006855139,0.000009562553,0.00012967132,0.000014082381,0.00073339307,0.9961665,0.00001546709,0.0010887061,0.0000047205663],"about_ca_topic_score_codex":0.0006920719,"about_ca_topic_score_gemma":0.0015052912,"teacher_disagreement_score":0.0006920719,"about_ca_system_score_codex":0.00020327806,"about_ca_system_score_gemma":0.00019382835,"threshold_uncertainty_score":0.0019683242},"labels":[],"label_agreement":null},{"id":"W4399528893","doi":"10.1007/s00454-024-00661-x","title":"A Sylvester–Gallai-Type Theorem for Complex-Representable Matroids","year":2024,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Type (biology); Mathematics; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.030090876649505556,"score_gpt":0.3282654088476513,"score_spread":0.29817453219814577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399528893","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.11407965,0.0013981311,0.65913147,0.006009151,0.0010708093,0.000116660405,0.0008459343,0.0005510366,0.21679717],"genre_scores_gemma":[0.8088031,0.002268436,0.103223495,0.0024005244,0.0020603803,0.00026923587,0.0009903882,0.000469454,0.07951494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995291,0.00008642244,0.000023329487,0.00013223698,0.00016225486,0.000066548375],"domain_scores_gemma":[0.9984932,0.0006784872,0.00017364524,0.00019814349,0.0002746376,0.0001819573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009259789,0.0009516974,0.00083596323,0.0017375991,0.0013571215,0.003130199,0.0013277144,0.0015391792,0.012107603],"category_scores_gemma":[0.0030834677,0.0005152929,0.0013170512,0.0014944181,0.0028012772,0.00467073,0.0024443085,0.00459721,0.0019927714],"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.000013481906,0.000011877605,0.000071944894,0.000022120077,0.000006948625,0.000029546321,0.00007332624,0.00085373956,0.0006516207,0.99108106,0.0027418789,0.0044425447],"study_design_scores_gemma":[0.00000876066,0.00001153682,0.00009296421,0.000006733046,0.000004816822,0.00006301765,0.000017686596,0.005587415,0.0003737579,0.9898747,0.003950783,0.0000077154355],"about_ca_topic_score_codex":0.00073708117,"about_ca_topic_score_gemma":0.0007197106,"teacher_disagreement_score":0.012107603,"about_ca_system_score_codex":0.0012776557,"about_ca_system_score_gemma":0.0005050628,"threshold_uncertainty_score":0.04050398},"labels":[],"label_agreement":null},{"id":"W4399559849","doi":"10.1016/j.ejc.2024.104004","title":"Corrigendum to “Describing quasi-graphic matroids” [European J. Combin. 85 (2020) 103062]","year":2024,"lang":"en","type":"erratum","venue":"European Journal of Combinatorics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Douglas College","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.029147713484708373,"score_gpt":0.2449687663328516,"score_spread":0.21582105284814324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399559849","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046280507,0.007864828,0.005935806,0.056462944,0.84142494,0.00013438365,0.0044147777,0.0013299886,0.081969604],"genre_scores_gemma":[0.012198574,0.014242511,0.010172723,0.0406612,0.1681383,0.00038902758,0.009111128,0.0023154144,0.74277115],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701715,0.00055728434,0.00026327284,0.00057754363,0.001325699,0.0002590409],"domain_scores_gemma":[0.99470115,0.0014178983,0.0002902921,0.0004988178,0.002609026,0.00048283354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017351073,0.002845958,0.0028800126,0.005857484,0.003426351,0.0042716605,0.0040949984,0.004591945,0.25157103],"category_scores_gemma":[0.0123760775,0.0013705251,0.002898386,0.004493068,0.0018900414,0.004493275,0.0026891334,0.004965302,0.10447935],"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.000021360083,0.000010034985,0.0000314744,0.00011808794,0.00001492997,0.00006738485,0.000011278582,0.00009244331,0.000092634036,0.0029149703,0.9916578,0.004967655],"study_design_scores_gemma":[0.000037245,0.000039704195,0.0008266767,0.00017248838,0.000042981803,0.00030121522,0.000035425124,0.0006434564,0.00035293828,0.016277151,0.98121166,0.000059095863],"about_ca_topic_score_codex":0.0142645035,"about_ca_topic_score_gemma":0.024410998,"teacher_disagreement_score":0.25157103,"about_ca_system_score_codex":0.0057938844,"about_ca_system_score_gemma":0.0021651129,"threshold_uncertainty_score":0.8415889},"labels":[],"label_agreement":null},{"id":"W4399597816","doi":"10.48550/arxiv.2406.07134","title":"Categories of Line Defects and Cohomological Hall Algebras","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Krembil Foundation; National Natural Science Foundation of China; Division of Mathematical Sciences; University of Cambridge; Government of Canada; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada","keywords":"Line (geometry); Mathematics; Geometry","score_opus":0.06468835297311866,"score_gpt":0.20397603098770675,"score_spread":0.13928767801458808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399597816","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.9305259,0.00034231658,0.03774813,0.00072812923,0.00005117479,0.000045676603,0.0002649709,0.00022167414,0.030072019],"genre_scores_gemma":[0.9893637,0.000114284325,0.005319398,0.00011009489,0.000064845066,0.000041056952,0.00019921488,0.00002338685,0.004764059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926215,0.00014110975,0.000049863203,0.0001373122,0.00024707665,0.00016239993],"domain_scores_gemma":[0.9990295,0.00023157503,0.00016706198,0.0001613129,0.00014772695,0.00026285998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074380107,0.00025252718,0.00027607707,0.0025408498,0.0012341547,0.002599339,0.0010799525,0.0007069973,0.0049776365],"category_scores_gemma":[0.001079341,0.00030097595,0.0003954153,0.00092359725,0.0032850418,0.004477838,0.0030884834,0.0009922803,0.00039141683],"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.000029488245,0.000034986817,0.00093046756,0.000023306133,0.0000055213927,0.00012112996,0.00069767406,0.0004287553,0.0019656087,0.9897455,0.00045587806,0.0055616316],"study_design_scores_gemma":[0.000027145325,0.00004996905,0.0031591067,0.000017950111,0.0000112249045,0.00036846395,0.00084996695,0.004780941,0.0021832236,0.9822433,0.006277289,0.000031373605],"about_ca_topic_score_codex":0.0007489231,"about_ca_topic_score_gemma":0.000462994,"teacher_disagreement_score":0.0049776365,"about_ca_system_score_codex":0.00095668936,"about_ca_system_score_gemma":0.00045708928,"threshold_uncertainty_score":0.016651869},"labels":[],"label_agreement":null},{"id":"W4401768973","doi":"10.18280/isi.290415","title":"Diverse Bases for Functional Spaces for Non-Rigid Shape Correspondence","year":2024,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Digital Image Processing Techniques","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":"Ministry of Electronics and Information technology","keywords":"Computer science; Mathematics","score_opus":0.04351688014850056,"score_gpt":0.2836863031980671,"score_spread":0.24016942304956654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401768973","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.0070997505,0.0033504912,0.9807992,0.00043934505,0.00014796888,0.00004350194,0.00013856198,0.000099086996,0.007882156],"genre_scores_gemma":[0.26584616,0.014591503,0.70789945,0.00048542672,0.0007593416,0.00060250104,0.0011337093,0.00029601058,0.00838589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845755,0.00065875315,0.000117746815,0.00023645218,0.00043801015,0.00009152683],"domain_scores_gemma":[0.99803585,0.000801158,0.00016701604,0.0004184643,0.0004472608,0.00013028238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025614665,0.0012976187,0.0012978214,0.003387909,0.0010955031,0.003166709,0.0018376206,0.0018584948,0.005016678],"category_scores_gemma":[0.006295782,0.00046585142,0.0015451197,0.0029399,0.0024562704,0.003770877,0.0033128716,0.0037023984,0.0024461523],"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.000025069396,0.00003412974,0.00020372462,0.0001988183,0.000022276736,0.000046019486,0.0001336951,0.01991395,0.001876673,0.90299046,0.0016765635,0.072878584],"study_design_scores_gemma":[0.0000117347645,0.00009772133,0.00025104178,0.00014749556,0.000014731864,0.00021823269,0.00014097097,0.1625583,0.0011540193,0.81355745,0.02180439,0.00004384123],"about_ca_topic_score_codex":0.00054102624,"about_ca_topic_score_gemma":0.00056165026,"teacher_disagreement_score":0.005016678,"about_ca_system_score_codex":0.00088430214,"about_ca_system_score_gemma":0.0007560073,"threshold_uncertainty_score":0.016782463},"labels":[],"label_agreement":null},{"id":"W4401963033","doi":"10.1051/ita/2024013","title":"On the generation of discrete figures with connectivity constraints","year":2024,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science","score_opus":0.013351831561535923,"score_gpt":0.26040870585712084,"score_spread":0.24705687429558493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401963033","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.14968,0.00030742004,0.82233524,0.0003793545,0.0000828565,0.00012688104,0.00034616352,0.00074057817,0.026001526],"genre_scores_gemma":[0.4652707,0.00038822272,0.524323,0.00011656821,0.00003803788,0.00020210969,0.00092161086,0.00025777184,0.008481942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962866,0.00009618542,0.0000172178,0.000085621235,0.00012643359,0.000045937253],"domain_scores_gemma":[0.99812084,0.0012462517,0.00012146797,0.00029993648,0.00015047676,0.00006092214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002994313,0.00030351806,0.00037056196,0.0006479189,0.00046691726,0.0008305883,0.00068437774,0.00044434884,0.006894181],"category_scores_gemma":[0.0031163103,0.00028582214,0.0004301278,0.00087371434,0.00079761643,0.0014222405,0.00083840673,0.00050799694,0.00087466894],"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.00024803705,0.000099836136,0.0014652105,0.00030290513,0.000028179094,0.0005001308,0.0003313051,0.42892992,0.021878924,0.30940926,0.00696839,0.22983791],"study_design_scores_gemma":[0.00005185627,0.00010323694,0.00038914074,0.000034218854,0.000018000112,0.00031623812,0.00009701062,0.82563186,0.011486941,0.14622177,0.015628474,0.000021203772],"about_ca_topic_score_codex":0.0008903527,"about_ca_topic_score_gemma":0.0013566001,"teacher_disagreement_score":0.006894181,"about_ca_system_score_codex":0.0004841616,"about_ca_system_score_gemma":0.00039141066,"threshold_uncertainty_score":0.023063302},"labels":[],"label_agreement":null},{"id":"W4402193695","doi":"10.1109/fccm60383.2024.00026","title":"Mapping Enumeration for Multi-Context CGRAs Using Zero-Suppressed Binary Decision Diagrams","year":2024,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Enumeration; Binary decision diagram; Computer science; Context (archaeology); Zero (linguistics); Binary number; Influence diagram; Theoretical computer science; Parallel computing; Programming language; Mathematics; Discrete mathematics; Arithmetic; Decision tree; Data mining","score_opus":0.07944118068427401,"score_gpt":0.34084352469057705,"score_spread":0.261402344006303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402193695","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.040236507,0.00010655859,0.9554467,0.00010582327,0.00001806866,0.00009622737,0.000099522455,0.00044648917,0.0034439913],"genre_scores_gemma":[0.3872443,0.00014369936,0.60941565,0.00008710813,0.00001403163,0.00026125973,0.0002734809,0.00015099614,0.0024093925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988607,0.0004908871,0.00007495252,0.00016274716,0.00026077082,0.00014999992],"domain_scores_gemma":[0.9972403,0.0021579792,0.00014699006,0.00012794648,0.00026368434,0.00006314497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015202696,0.0007509989,0.0006517392,0.00094696105,0.00046701054,0.0011315116,0.00087076647,0.00067259,0.0033932035],"category_scores_gemma":[0.004337171,0.0003506794,0.0009218011,0.00059539394,0.00089913025,0.0011078517,0.0011959415,0.00092398404,0.00037505655],"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.00013650274,0.00008579925,0.0009991184,0.00026196468,0.000030068373,0.00015649207,0.00019692983,0.7927979,0.0059058196,0.07950518,0.0010911386,0.11883315],"study_design_scores_gemma":[0.00002955032,0.00005962752,0.00007933011,0.000026252488,0.000013668576,0.000032056967,0.000039888502,0.9485567,0.0045567225,0.044820283,0.0017759122,0.000010031675],"about_ca_topic_score_codex":0.0028825842,"about_ca_topic_score_gemma":0.004379435,"teacher_disagreement_score":0.0033932035,"about_ca_system_score_codex":0.0010796922,"about_ca_system_score_gemma":0.001694275,"threshold_uncertainty_score":0.011351407},"labels":[],"label_agreement":null},{"id":"W4402520889","doi":"10.2298/fil2403793p","title":"Geometric realizations of homotopic paths over curved surfaces","year":2024,"lang":"en","type":"article","venue":"Filomat","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Antipodal point; Surface (topology); Curvature; Path integral formulation; Path (computing); Realization (probability); Feynman diagram; Zero (linguistics); Mathematical analysis; Geometry; Pure mathematics; Mathematical physics","score_opus":0.017682138546043055,"score_gpt":0.27972697237277083,"score_spread":0.2620448338267278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402520889","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.68808407,0.0003608881,0.2785457,0.00024440346,0.00007898068,0.00005064003,0.00015322387,0.00033045892,0.0321517],"genre_scores_gemma":[0.9710816,0.00018263828,0.024127893,0.000029421446,0.000035080495,0.000025773585,0.0001176317,0.00007409753,0.0043257885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999398,0.00007408389,0.000028637922,0.00013648467,0.00025628126,0.00010656791],"domain_scores_gemma":[0.9995347,0.00009193752,0.00011280159,0.000099316254,0.00008304993,0.00007821232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031732206,0.00042431068,0.0003057897,0.0017322716,0.00095952564,0.0019502401,0.0005318697,0.00073958247,0.003736224],"category_scores_gemma":[0.0012497772,0.00027502413,0.00053426006,0.00056726293,0.0022186371,0.0024860008,0.0014620919,0.001310559,0.00036220468],"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.000018588895,0.000007740554,0.00041853442,0.000010284498,0.000004000556,0.00017532126,0.00024335073,0.005532466,0.0034432337,0.9836256,0.0001572898,0.0063635916],"study_design_scores_gemma":[0.00001072758,0.00006949811,0.0020323426,0.000023042548,0.000009522254,0.00044373487,0.00040213048,0.0657383,0.00501738,0.9169511,0.009261879,0.000040319548],"about_ca_topic_score_codex":0.0010145884,"about_ca_topic_score_gemma":0.0006535405,"teacher_disagreement_score":0.003736224,"about_ca_system_score_codex":0.0009893319,"about_ca_system_score_gemma":0.0003985106,"threshold_uncertainty_score":0.012498915},"labels":[],"label_agreement":null},{"id":"W4402666395","doi":"10.1109/tip.2024.3459611","title":"Optimized Pattern Partitioning for Multi-Pass Printing: PARAOMASKING","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.044733544535584056,"score_gpt":0.3267610419559502,"score_spread":0.28202749742036615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402666395","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.095999196,0.00038649855,0.8975643,0.000098951976,0.00004757163,0.000046069283,0.00004239457,0.00095468736,0.0048604114],"genre_scores_gemma":[0.5888337,0.00024276244,0.4021065,0.000095483374,0.000019054742,0.00006659656,0.00010554642,0.00049473613,0.008035735],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968994,0.000033537537,0.000016413978,0.0000866326,0.00013272591,0.00004070597],"domain_scores_gemma":[0.999408,0.00017042494,0.000091508824,0.00020706019,0.00009393404,0.000029171872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002580283,0.00052554277,0.00047631198,0.0003842296,0.0003950043,0.0010290615,0.0008613449,0.00060134544,0.0019979065],"category_scores_gemma":[0.0007851985,0.0003719573,0.0003400001,0.0004514578,0.0005187441,0.0010974768,0.000679862,0.00068034424,0.00083596486],"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.00038492092,0.00013376029,0.0008688833,0.00019682331,0.00003590714,0.00025692006,0.00022596806,0.10447311,0.660329,0.019724188,0.001214244,0.2121563],"study_design_scores_gemma":[0.000035966816,0.00031570924,0.0011094064,0.000016042444,0.000028808157,0.00057497784,0.00007364872,0.51887393,0.4586476,0.010475074,0.009800604,0.000048197493],"about_ca_topic_score_codex":0.00064156344,"about_ca_topic_score_gemma":0.001482498,"teacher_disagreement_score":0.0019979065,"about_ca_system_score_codex":0.00062673155,"about_ca_system_score_gemma":0.00046473506,"threshold_uncertainty_score":0.0066837072},"labels":[],"label_agreement":null},{"id":"W4403411543","doi":"10.1016/j.acha.2024.101718","title":"Linearized Wasserstein dimensionality reduction with approximation guarantees","year":2024,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fields Institute for Research in Mathematical Sciences; University of Texas at Arlington; Army Research Office; University of North Carolina; Intel Corporation; Division of Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Dimensionality reduction; Reduction (mathematics); Curse of dimensionality; Applied mathematics; Mathematical optimization; Statistics; Artificial intelligence; Geometry; Computer science","score_opus":0.010315749869788012,"score_gpt":0.24360847082377937,"score_spread":0.23329272095399137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403411543","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.008079628,0.00044601114,0.987944,0.0008431659,0.00009750734,0.000022757513,0.00016033006,0.0006290335,0.0017774935],"genre_scores_gemma":[0.49262595,0.0015123092,0.48116034,0.00089965947,0.00075334887,0.00032052124,0.0017670091,0.00096571207,0.01999524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984236,0.0005299323,0.00007103052,0.0003100202,0.00053323415,0.0001322146],"domain_scores_gemma":[0.9971981,0.0013598957,0.00017710708,0.0007801055,0.00036441348,0.00012027987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016654831,0.0012257834,0.0016014026,0.00097577245,0.0005506573,0.0017421808,0.0016491705,0.0016576817,0.004026033],"category_scores_gemma":[0.010268597,0.0006544882,0.00094420067,0.001224855,0.0015708999,0.003509722,0.0039031196,0.0038053077,0.0016950519],"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.00037142966,0.00016483308,0.00089500466,0.0003283969,0.00013376205,0.00015370097,0.00017790569,0.3842932,0.0076166093,0.32980198,0.024099573,0.25196356],"study_design_scores_gemma":[0.0000126497725,0.000035283152,0.00013598413,0.000010563617,0.0000090519015,0.00006342941,0.00001629947,0.86902547,0.0015557084,0.12746125,0.0016607749,0.000013562958],"about_ca_topic_score_codex":0.0016289676,"about_ca_topic_score_gemma":0.0016352782,"teacher_disagreement_score":0.004026033,"about_ca_system_score_codex":0.0009884542,"about_ca_system_score_gemma":0.0010947186,"threshold_uncertainty_score":0.013468385},"labels":[],"label_agreement":null},{"id":"W4403969767","doi":"10.55016/ojs/cdm.v19i3.74134","title":"A linear time approach to three-dimensional reconstruction by discrete tomography","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","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":"Università Cattolica del Sacro Cuore; Monash University","keywords":"Mathematics; Tomography; Algorithm; Applied mathematics; Mathematical optimization; Medicine; Radiology","score_opus":0.009945675056371128,"score_gpt":0.27015537570318493,"score_spread":0.2602097006468138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403969767","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.0022246307,0.00013758375,0.99403787,0.00031903322,0.0000294924,0.00001606961,0.00001845802,0.00011821253,0.0030985244],"genre_scores_gemma":[0.14931773,0.00055969704,0.8403127,0.00022031197,0.00008905076,0.00014443672,0.00010194386,0.00017670431,0.009077431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996613,0.00012025715,0.000011457635,0.000043662298,0.00013497246,0.00002824863],"domain_scores_gemma":[0.9992348,0.00047040812,0.00006684454,0.00013014826,0.00006094501,0.000036885293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061107206,0.00042966122,0.00039159448,0.00051085115,0.0004543627,0.0011900449,0.0012530361,0.0007563932,0.0038124416],"category_scores_gemma":[0.0019637286,0.0003343538,0.0005714799,0.000545319,0.0020381692,0.0013416351,0.0016885382,0.0022528653,0.0007387918],"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.00012184723,0.00007695384,0.00036737838,0.00026623084,0.000036256388,0.00013513755,0.00023852775,0.21167688,0.015402681,0.7016571,0.002732186,0.06728879],"study_design_scores_gemma":[0.000014538405,0.00001680491,0.000051103736,0.00001121438,0.0000034296124,0.00006010889,0.00001991501,0.9120486,0.0024805102,0.08100517,0.0042760023,0.000012544571],"about_ca_topic_score_codex":0.0012869996,"about_ca_topic_score_gemma":0.0015260486,"teacher_disagreement_score":0.0038124416,"about_ca_system_score_codex":0.0010208216,"about_ca_system_score_gemma":0.00071542844,"threshold_uncertainty_score":0.012753844},"labels":[],"label_agreement":null},{"id":"W4406892935","doi":"10.1016/j.tmater.2025.100051","title":"Visualizing pulp fibers using X-ray tomography: Enhancing the contrast by labeling with iron oxide nanoparticles and the use of immersion oil","year":2025,"lang":"en","type":"article","venue":"Tomography of Materials and Structures","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iron oxide; Nanoparticle; Immersion (mathematics); Iron oxide nanoparticles; Pulp (tooth); Contrast (vision); Materials science; Contrast enhancement; Chemical engineering; Chemistry; Nanotechnology; Metallurgy; Computer science; Dentistry; Artificial intelligence; Magnetic resonance imaging; Radiology; Engineering; Medicine; Mathematics","score_opus":0.011339056124329637,"score_gpt":0.24049096148923121,"score_spread":0.22915190536490157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406892935","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.7728004,0.001525653,0.22317359,0.0002087301,0.00005586927,0.00012194432,0.00006820809,0.00022325726,0.00182245],"genre_scores_gemma":[0.6529843,0.0020661955,0.3415296,0.00011153278,0.000024338091,0.0001347597,0.00013213772,0.0000865396,0.0029305818],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998965,0.000020526862,0.000008085403,0.000030980424,0.000027405207,0.00001645496],"domain_scores_gemma":[0.9997708,0.00010292142,0.000049465245,0.00002569186,0.000031089967,0.000020010253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039867227,0.0004582314,0.00021236631,0.0002761474,0.00020050726,0.00048322082,0.00044515304,0.00052045577,0.0008555366],"category_scores_gemma":[0.00031750332,0.0002638064,0.000200569,0.0001610071,0.00045081077,0.00076537684,0.00029148455,0.0005550084,0.00016133244],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000020604655,0.000008105093,0.00010642536,0.000026686106,0.0000015826163,0.000030443343,0.000016165732,0.00006862844,0.99838376,0.000108537344,0.000006498796,0.0012226264],"study_design_scores_gemma":[0.000003507084,0.00008532046,0.0006508887,0.00000480449,0.000004759869,0.00018887517,0.000021597074,0.0012276917,0.997235,0.000066195666,0.0005066922,0.000004692124],"about_ca_topic_score_codex":0.0004400463,"about_ca_topic_score_gemma":0.0008347836,"teacher_disagreement_score":0.0008555366,"about_ca_system_score_codex":0.00025528448,"about_ca_system_score_gemma":0.00029580365,"threshold_uncertainty_score":0.0028620362},"labels":[],"label_agreement":null},{"id":"W4407829982","doi":"10.1111/tgis.70015","title":"<i>TGGLinesPlus</i> : A Robust Topological Graph‐Guided Computer Vision Algorithm for Line Detection From Images","year":2025,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"Curtin University of Technology; Pennsylvania State University; Nuclear Safety and Security Commission; University of Pennsylvania; National Aeronautics and Space Administration","keywords":"Line (geometry); Computer science; Artificial intelligence; Computer vision; Graph; Topological graph; Algorithm; Pattern recognition (psychology); Mathematics; Theoretical computer science; Geometry","score_opus":0.02095917669243053,"score_gpt":0.30042597846057756,"score_spread":0.27946680176814703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407829982","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.0124809975,0.00007372122,0.9784096,0.00015028776,0.000054095803,0.00011108358,0.00015936393,0.007267594,0.0012932771],"genre_scores_gemma":[0.12730172,0.00007324889,0.86907786,0.00018993302,0.000039185663,0.0001177397,0.0007028642,0.0005214317,0.001976013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995022,0.00006318478,0.00002368887,0.00014314611,0.00021805079,0.000049669794],"domain_scores_gemma":[0.9993124,0.00013917516,0.000095224175,0.00014617348,0.00025878864,0.000048302936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056088204,0.0012016664,0.00069170236,0.0025760601,0.0005294381,0.0012604028,0.0019924736,0.0012939224,0.00356892],"category_scores_gemma":[0.0020812498,0.00043501082,0.0006786065,0.0014155046,0.0009407292,0.0013740073,0.0011951819,0.00092197815,0.0017572715],"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.00024382987,0.00012832436,0.0010642569,0.00015123608,0.000087901644,0.00016513703,0.00010016382,0.2166378,0.04230742,0.0090659475,0.019481882,0.7105661],"study_design_scores_gemma":[0.000018675895,0.0000484142,0.00027404586,0.000007729107,0.0000064612864,0.0000745817,0.000015834328,0.9764459,0.017658718,0.0023794582,0.003054185,0.000015999922],"about_ca_topic_score_codex":0.007493518,"about_ca_topic_score_gemma":0.008122396,"teacher_disagreement_score":0.007493518,"about_ca_system_score_codex":0.00078479527,"about_ca_system_score_gemma":0.0010541576,"threshold_uncertainty_score":0.01489979},"labels":[],"label_agreement":null},{"id":"W4409286962","doi":"10.1007/s00010-025-01156-7","title":"New recursive constructions of amoebas and their balancing number","year":2025,"lang":"en","type":"article","venue":"Aequationes Mathematicae","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.009137235952511563,"score_gpt":0.26443342868498465,"score_spread":0.25529619273247306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409286962","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.107143536,0.0013419105,0.6906906,0.0014980806,0.0012558079,0.000106166204,0.00019701399,0.0009348174,0.19683209],"genre_scores_gemma":[0.65282404,0.00087373285,0.26074865,0.0008151483,0.0006503132,0.0003960272,0.00025543422,0.00092037034,0.08251634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991648,0.00027675807,0.000051513485,0.00016294347,0.00018895972,0.00015509315],"domain_scores_gemma":[0.9990308,0.00044790955,0.00007043526,0.0001486585,0.00016544924,0.00013684422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011604555,0.0009427274,0.0007473521,0.0022343008,0.0026328007,0.0035006164,0.0013980283,0.0017551099,0.011401735],"category_scores_gemma":[0.0043834853,0.0006096927,0.0010270766,0.0015135068,0.003104324,0.0040456443,0.0029931704,0.0031244846,0.0023192016],"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.000012132386,0.0000061137557,0.00005391994,0.0000098981045,0.0000019308147,0.000025462543,0.000090721594,0.00022579453,0.00051513955,0.99376667,0.0006330157,0.0046591824],"study_design_scores_gemma":[0.000012634263,0.000014112266,0.00010288078,0.000016761896,0.000007685076,0.000089866015,0.00006958627,0.0046871975,0.0009789243,0.9797987,0.014208277,0.00001335455],"about_ca_topic_score_codex":0.00063293386,"about_ca_topic_score_gemma":0.0009993179,"teacher_disagreement_score":0.011401735,"about_ca_system_score_codex":0.0012912676,"about_ca_system_score_gemma":0.00047291865,"threshold_uncertainty_score":0.03814262},"labels":[],"label_agreement":null},{"id":"W4409687339","doi":"10.59275/j.melba.2025-c1d9","title":"GeoLS: an Intensity-based, Geodesic Soft Labeling for Image Segmentation","year":2025,"lang":"en","type":"article","venue":"The Journal of Machine Learning for Biomedical Imaging","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer vision; Segmentation; Artificial intelligence; Intensity (physics); Geodesic; Computer science; Image segmentation; Image (mathematics); Mathematics; Physics; Geometry; Optics","score_opus":0.012982768790405311,"score_gpt":0.3178742906932374,"score_spread":0.3048915219028321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409687339","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.0051905853,0.00013512876,0.99155515,0.00014980587,0.000040264218,0.00006529828,0.00012627234,0.0021382596,0.00059931236],"genre_scores_gemma":[0.087400734,0.0003095568,0.90732145,0.00032003474,0.00012253925,0.0002243608,0.0009286544,0.00096987764,0.0024027617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980684,0.00043259608,0.00011038045,0.0005153153,0.00075193756,0.00012135946],"domain_scores_gemma":[0.9973435,0.00083162327,0.000426534,0.00068327825,0.00055410416,0.00016094884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021045562,0.0017591672,0.0017326073,0.003557732,0.0010474001,0.0022359118,0.002980286,0.0028468922,0.0026042578],"category_scores_gemma":[0.0066784746,0.0010599238,0.0016866736,0.0027427047,0.0023565374,0.0030303893,0.0037450362,0.0029740257,0.002157688],"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.0004777603,0.00022157276,0.0019376733,0.0004817709,0.00015138536,0.00023838074,0.0005715546,0.2493794,0.03130844,0.03149337,0.011018679,0.67272],"study_design_scores_gemma":[0.00002287861,0.0000709061,0.0003590019,0.000032819607,0.000020026668,0.00012916354,0.000052087395,0.9532621,0.011708707,0.029914945,0.004383002,0.00004447596],"about_ca_topic_score_codex":0.0037500123,"about_ca_topic_score_gemma":0.0060673915,"teacher_disagreement_score":0.0037500123,"about_ca_system_score_codex":0.0015321523,"about_ca_system_score_gemma":0.0021308002,"threshold_uncertainty_score":0.011130035},"labels":[],"label_agreement":null},{"id":"W4412318759","doi":"","title":"Loftin, John; McIntosh, Ian. Minimal Lagrangian surfaces in CH2 and representations of surface groups into SU(2,1). Geom. Dedicata 162 (2013), 67--93.","year":2013,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Lagrangian; Mathematics; Surface (topology); Algebra over a field; Pure mathematics; Combinatorics; Geometry","score_opus":0.011609324205228966,"score_gpt":0.26085507994992696,"score_spread":0.24924575574469798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412318759","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.11861826,0.23039298,0.20202623,0.07425881,0.0060162046,0.00011676704,0.0030711065,0.0018743386,0.36362532],"genre_scores_gemma":[0.6592514,0.0806985,0.04228124,0.003000324,0.0024889933,0.00017132256,0.0012679528,0.0005099164,0.2103304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99988675,0.000011241345,0.000005034095,0.000023045184,0.000050446703,0.000023518141],"domain_scores_gemma":[0.9995728,0.00013569059,0.00005308366,0.000051973442,0.00013484653,0.000051652605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000376642,0.00045770057,0.00043402106,0.0021477276,0.002275181,0.0013028032,0.00097533874,0.0009836508,0.013280235],"category_scores_gemma":[0.0017006642,0.00029041353,0.0002678097,0.0012801156,0.001797759,0.0039616944,0.0010874466,0.0015648758,0.002592763],"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.00023555818,0.00006998724,0.0009989445,0.00048515055,0.000022638087,0.00052902626,0.0010292224,0.00091520936,0.007434911,0.63392204,0.1815987,0.17275855],"study_design_scores_gemma":[0.000044159595,0.000120178316,0.0036094985,0.00021451988,0.000052525505,0.00089856953,0.00093415065,0.00247206,0.015482194,0.47971922,0.4963824,0.00007053387],"about_ca_topic_score_codex":0.0041293968,"about_ca_topic_score_gemma":0.004636403,"teacher_disagreement_score":0.013280235,"about_ca_system_score_codex":0.00078853074,"about_ca_system_score_gemma":0.00036868016,"threshold_uncertainty_score":0.04442686},"labels":[],"label_agreement":null},{"id":"W4412327424","doi":"","title":"Reconstructing r-regular Objects from Trinary Digital Images","year":2019,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer graphics (images); Computer vision; Artificial intelligence","score_opus":0.005686007236048612,"score_gpt":0.20671168609422436,"score_spread":0.20102567885817574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412327424","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.11073076,0.00020594553,0.88487434,0.00014938669,0.000057507477,0.00006519627,0.00024169886,0.0009075882,0.0027674956],"genre_scores_gemma":[0.38091153,0.0005143607,0.6137045,0.00008393641,0.000054697073,0.000040482264,0.0006868419,0.00035789429,0.0036458513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977976,0.000030464522,0.000015135726,0.000053182324,0.00008726439,0.000034174853],"domain_scores_gemma":[0.99931395,0.00015689239,0.00009115957,0.00027963414,0.0001104848,0.000047949743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038832202,0.00057490205,0.0005139144,0.0014259021,0.0002218424,0.00090705126,0.0006274389,0.0007215401,0.0019838193],"category_scores_gemma":[0.0015550161,0.0005400013,0.00064186647,0.0012250615,0.0007558755,0.0008827497,0.0010448194,0.0011318377,0.0010638199],"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.0008617127,0.00011522975,0.0038563267,0.0006348192,0.00016798239,0.0023205935,0.00074204017,0.07089222,0.29047775,0.04365896,0.0050299005,0.5812425],"study_design_scores_gemma":[0.0000470276,0.00021687355,0.0052699316,0.00008142598,0.00012330689,0.004012182,0.00054694194,0.82287514,0.12169377,0.031319275,0.013730418,0.00008378605],"about_ca_topic_score_codex":0.0010410774,"about_ca_topic_score_gemma":0.001654584,"teacher_disagreement_score":0.0019838193,"about_ca_system_score_codex":0.00022827715,"about_ca_system_score_gemma":0.00041333423,"threshold_uncertainty_score":0.00663656},"labels":[],"label_agreement":null},{"id":"W4412582246","doi":"10.55016/ojs/cdm.v12i2.62514","title":"Degree Associated Reconstruction Parameters of Total Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","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":"Mathematics; Degree (music); Combinatorics","score_opus":0.032414841910564075,"score_gpt":0.3101735317346863,"score_spread":0.2777586898241222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582246","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.8338596,0.00032210306,0.15070632,0.00021193187,0.000020382813,0.00004624038,0.000530115,0.00019227361,0.014110921],"genre_scores_gemma":[0.97152406,0.00026117743,0.02462852,0.0000486503,0.00003279861,0.000054358647,0.0005060776,0.00010531359,0.0028390693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992304,0.00020175785,0.000048297592,0.00023524174,0.0001853001,0.00009899896],"domain_scores_gemma":[0.99374723,0.0032357487,0.00093941414,0.0010312981,0.0005346373,0.0005116784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092272024,0.0005077464,0.0004317599,0.0018252617,0.0005938332,0.0013390183,0.0011159638,0.0007161202,0.0036867703],"category_scores_gemma":[0.007620225,0.00036564874,0.00041702547,0.0011490362,0.0016878479,0.003144269,0.0010171463,0.0011235152,0.0003898517],"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.00041007972,0.00008944294,0.011922752,0.00020575359,0.00006253318,0.00023885684,0.00077340624,0.1028001,0.01508738,0.81691855,0.00201806,0.049473096],"study_design_scores_gemma":[0.00005167043,0.00016569218,0.00810089,0.00005738874,0.00006532396,0.0010920458,0.0005222445,0.23518352,0.013223034,0.73307866,0.008369218,0.00009031212],"about_ca_topic_score_codex":0.00048061484,"about_ca_topic_score_gemma":0.00069765,"teacher_disagreement_score":0.0036867703,"about_ca_system_score_codex":0.0008825723,"about_ca_system_score_gemma":0.00032481435,"threshold_uncertainty_score":0.012333453},"labels":[],"label_agreement":null},{"id":"W4413321422","doi":"10.23919/oecc/psc62146.2025.11109328","title":"Algorithm Finding GMI-Optimal Binary Labelings for BICM","year":2025,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"Engineering and Physical Sciences Research Council; University College London; European Commission; Royal Academy of Engineering","keywords":"Binary number; Computer science; Algorithm; Mathematics; Arithmetic","score_opus":0.0169344341154476,"score_gpt":0.304735335399959,"score_spread":0.2878009012845114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413321422","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.009719095,0.00017934943,0.97205985,0.0003178461,0.00004896501,0.000109651366,0.00028499123,0.0021979802,0.015082321],"genre_scores_gemma":[0.09216457,0.00010996368,0.90221494,0.00012152975,0.000022295375,0.00024522073,0.0005790025,0.00023624155,0.0043063094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956995,0.00011800228,0.000020198517,0.00007062263,0.00015623745,0.00006490537],"domain_scores_gemma":[0.99943906,0.00022084967,0.00005130246,0.000086084656,0.00017554437,0.000027116092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058153627,0.00070434285,0.0006683147,0.0010784088,0.0008612908,0.0010124978,0.00088602985,0.0007920219,0.013212932],"category_scores_gemma":[0.0023073503,0.0004192101,0.00027331407,0.0011663068,0.00060683175,0.0007660164,0.0014845472,0.00092329754,0.004388872],"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.00046914304,0.00010584927,0.0006490791,0.0002894858,0.000032288823,0.00013233657,0.0002857516,0.09792549,0.028044647,0.08620102,0.023217544,0.76264745],"study_design_scores_gemma":[0.00019496217,0.00015863377,0.0005329288,0.000100925936,0.000028696568,0.00034950624,0.0002422547,0.81531006,0.030356681,0.121799074,0.030857172,0.00006905601],"about_ca_topic_score_codex":0.0014399649,"about_ca_topic_score_gemma":0.0027480456,"teacher_disagreement_score":0.013212932,"about_ca_system_score_codex":0.00094678835,"about_ca_system_score_gemma":0.001460365,"threshold_uncertainty_score":0.044201612},"labels":[],"label_agreement":null},{"id":"W4413379599","doi":"10.4153/s0008414x24000695","title":"Graphes dans les surfaces et ergodicité topologique","year":2025,"lang":"fr","type":"article","venue":"Canadian Journal of Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Mathematics; Humanities; Philosophy","score_opus":0.03637281379650218,"score_gpt":0.28968945539377056,"score_spread":0.25331664159726835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413379599","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.25806838,0.012975466,0.30964017,0.01122895,0.0011837896,0.00006769382,0.0013387025,0.001371839,0.40412506],"genre_scores_gemma":[0.8708534,0.006338469,0.031641565,0.00059127645,0.0011393256,0.00012765032,0.0009958582,0.00066840526,0.087643944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940646,0.00016071214,0.000027324488,0.0001446181,0.00016729851,0.00009363972],"domain_scores_gemma":[0.9987649,0.00068407616,0.00011706144,0.00009787661,0.00021923937,0.00011697072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008494516,0.0010503758,0.00063497276,0.003892354,0.0012026747,0.004039096,0.00061371486,0.0011210067,0.014297105],"category_scores_gemma":[0.0024459683,0.00044262208,0.0010595638,0.0020022658,0.00451419,0.0037757237,0.0014325154,0.0032215593,0.0023246706],"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.0000066350935,0.0000043403843,0.00016111304,0.000028297814,0.000005222064,0.000037652007,0.00015826421,0.0026270174,0.00031206227,0.99224347,0.0010602602,0.0033556165],"study_design_scores_gemma":[0.0000054631337,0.000008475011,0.0005355603,0.000021975398,0.0000050707613,0.000097130665,0.00016280869,0.010010714,0.00049485196,0.9720427,0.01660032,0.000014923822],"about_ca_topic_score_codex":0.006381224,"about_ca_topic_score_gemma":0.0035278443,"teacher_disagreement_score":0.014297105,"about_ca_system_score_codex":0.0032678188,"about_ca_system_score_gemma":0.0007124063,"threshold_uncertainty_score":0.047828555},"labels":[],"label_agreement":null},{"id":"W4413972868","doi":"10.70930/tac/0uzg5y28","title":"The least subtopos containing the discrete skeleton of Ω","year":2024,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Digital Image Processing Techniques","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":"Consejo Nacional de Investigaciones Científicas y Técnicas; European Commission","keywords":"Skeleton (computer programming); Computer science; Programming language","score_opus":0.007738071889102662,"score_gpt":0.2659497641965214,"score_spread":0.25821169230741875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413972868","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.75047773,0.00042167108,0.16637789,0.00028161783,0.00016429544,0.00008980464,0.0006574727,0.00054763217,0.08098193],"genre_scores_gemma":[0.9474764,0.00029641675,0.029248409,0.00007143964,0.0000678186,0.00006158246,0.0010580426,0.00016807356,0.021551928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994398,0.000048665243,0.000047272082,0.00017931522,0.0001633922,0.00012162918],"domain_scores_gemma":[0.99923074,0.00014873348,0.00009520441,0.00015707349,0.0001927655,0.00017557658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003121774,0.0003884968,0.00040572596,0.0014717256,0.0014652153,0.002011837,0.0003611102,0.0006428166,0.0072686346],"category_scores_gemma":[0.0012595322,0.0004605833,0.00053621066,0.0005642112,0.0020927647,0.002146329,0.0024760517,0.0012535105,0.0017251406],"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.0003492032,0.00008818191,0.009082917,0.0002728617,0.000041791056,0.0031535397,0.0031907125,0.00096575276,0.060266256,0.86281097,0.0025237352,0.05725414],"study_design_scores_gemma":[0.00004879005,0.000325585,0.030928433,0.0002696367,0.000103502425,0.010227182,0.0056645973,0.0059644603,0.09025874,0.74930066,0.10680639,0.00010210078],"about_ca_topic_score_codex":0.0004419157,"about_ca_topic_score_gemma":0.00051852583,"teacher_disagreement_score":0.0072686346,"about_ca_system_score_codex":0.00035252311,"about_ca_system_score_gemma":0.00029787695,"threshold_uncertainty_score":0.024316013},"labels":[],"label_agreement":null},{"id":"W4414756345","doi":"10.1007/s00493-025-00181-z","title":"Average plane-size in complex-representable matroids","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Bounded function; Constant (computer programming); Rank (graph theory); Integer (computer science); Upper and lower bounds","score_opus":0.012517289125328734,"score_gpt":0.2742975333598036,"score_spread":0.2617802442344749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414756345","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.7697467,0.0012725267,0.20043746,0.002438091,0.000117147334,0.00007565894,0.0012920301,0.00061295,0.024007414],"genre_scores_gemma":[0.97170883,0.0009397708,0.020180836,0.00018667386,0.00023776926,0.000107053624,0.00051235367,0.00020269673,0.0059240563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998961,0.0002712739,0.000047167636,0.00021463627,0.0002977509,0.00020823863],"domain_scores_gemma":[0.9872248,0.008221111,0.0015263954,0.00097429624,0.00077054,0.0012828995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013834535,0.00086531084,0.001472681,0.0017058711,0.0009860514,0.0044042864,0.0024482417,0.0016670575,0.008169633],"category_scores_gemma":[0.0129564265,0.00078308646,0.00061746396,0.0021699115,0.0020420204,0.0063107903,0.0018119247,0.0018905282,0.0005527086],"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.00063202274,0.0001710795,0.0040714582,0.0003188614,0.00010799669,0.00023380472,0.0003964954,0.12867251,0.009223742,0.81751585,0.008279704,0.030376524],"study_design_scores_gemma":[0.00006122465,0.00009401215,0.0018529233,0.000035035955,0.000051852574,0.00033178448,0.00014343126,0.24871929,0.0028851447,0.7434932,0.002304548,0.00002745329],"about_ca_topic_score_codex":0.0009886204,"about_ca_topic_score_gemma":0.0012751422,"teacher_disagreement_score":0.008169633,"about_ca_system_score_codex":0.0019409187,"about_ca_system_score_gemma":0.0006008802,"threshold_uncertainty_score":0.0273301},"labels":[],"label_agreement":null},{"id":"W4415914287","doi":"10.28924/2291-8639-23-2025-271","title":"\\(\\alpha_\\sigma\\)-Sets: A Novel Framework for Generalized Topological Structures with Applications in Digital Topology","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Digital Image Processing Techniques","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":"Digital topology; Topology (electrical circuits); Counterexample; Boundary (topology); Characterization (materials science); Countable set; General topology; Class (philosophy); Topological space","score_opus":0.01597942855106505,"score_gpt":0.34811300878406776,"score_spread":0.3321335802330027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415914287","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.21463296,0.0017446544,0.7434279,0.0010969074,0.00028316904,0.000081319995,0.00023890338,0.00024954334,0.03824466],"genre_scores_gemma":[0.8199539,0.0009841354,0.16796441,0.00038089833,0.0003430814,0.00016697538,0.0002782805,0.00012405089,0.0098043345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992994,0.00019027096,0.000059859536,0.00020824642,0.00017043584,0.000071780974],"domain_scores_gemma":[0.99906045,0.00028646836,0.00017241927,0.00020927575,0.00013732337,0.0001340534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008204631,0.0004899489,0.00046275306,0.0015491608,0.0012421097,0.0024005133,0.0008603345,0.0007118677,0.0020050711],"category_scores_gemma":[0.0014439718,0.00030025802,0.0007485004,0.0009183349,0.0047864188,0.0044314144,0.002253561,0.001563502,0.00039450923],"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.000008755342,0.0000047395315,0.00016443148,0.000017300747,0.000003326698,0.000064465035,0.00019117582,0.0007941004,0.0011667829,0.9937264,0.0001545588,0.0037040028],"study_design_scores_gemma":[0.000006567796,0.00003426679,0.0003190888,0.000026110354,0.000008702641,0.00030797644,0.00020721844,0.011713695,0.0015053956,0.97192514,0.013931752,0.000014121283],"about_ca_topic_score_codex":0.0004820564,"about_ca_topic_score_gemma":0.0004332361,"teacher_disagreement_score":0.0024005133,"about_ca_system_score_codex":0.0007661303,"about_ca_system_score_gemma":0.00039953348,"threshold_uncertainty_score":0.0067076087},"labels":[],"label_agreement":null},{"id":"W4416176824","doi":"10.1016/j.disc.2025.114860","title":"Spherical codes attached to complex weighing matrices","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bent molecular geometry; Dimension (graph theory); RADIUS; Sequence (biology); Code (set theory); Upper and lower bounds; Order (exchange)","score_opus":0.029401637998103643,"score_gpt":0.3311629728494699,"score_spread":0.30176133485136625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416176824","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.0977206,0.00048543187,0.84141797,0.0008480208,0.0010926834,0.00007216423,0.00032513213,0.00054342806,0.057494596],"genre_scores_gemma":[0.7683519,0.0012750403,0.13669139,0.0009532564,0.0011089195,0.00017897761,0.00059252145,0.00083973777,0.09000823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990097,0.00022911148,0.000055579712,0.0001378816,0.00042616823,0.00014136905],"domain_scores_gemma":[0.9969035,0.0008357841,0.0005511935,0.0005295263,0.00089278567,0.00028732247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064267695,0.0010973309,0.00063201337,0.002489364,0.0007903151,0.0023865406,0.0009272727,0.0020776421,0.011108265],"category_scores_gemma":[0.005418405,0.00044884798,0.00047581532,0.0020104675,0.001866743,0.001838899,0.0021000938,0.0020440521,0.003704431],"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.00004295664,0.00001526271,0.00017925008,0.000037792393,0.000007457358,0.000105532476,0.00011138407,0.005131841,0.0055873096,0.9656751,0.0023241893,0.020781826],"study_design_scores_gemma":[0.000017019436,0.000048061982,0.00057419925,0.000041506766,0.000009727615,0.000415473,0.00014114245,0.074047804,0.0073757796,0.9024645,0.014795693,0.00006902015],"about_ca_topic_score_codex":0.00090118137,"about_ca_topic_score_gemma":0.00076057564,"teacher_disagreement_score":0.011108265,"about_ca_system_score_codex":0.00081438484,"about_ca_system_score_gemma":0.0005394699,"threshold_uncertainty_score":0.037160873},"labels":[],"label_agreement":null},{"id":"W4416785431","doi":"10.28924/2291-8639-23-2025-323","title":"Lξ-Families: Localized Topology with Applications in Edge Detection","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Digital Image Processing Techniques","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":"Higher Council for Science and Technology","keywords":"Topology (electrical circuits); Boundary (topology); Topological space; Generalization; Topological dynamics; Class (philosophy); Characterization (materials science); Development (topology)","score_opus":0.006911902369009699,"score_gpt":0.3001953654864714,"score_spread":0.29328346311746173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416785431","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.06739116,0.00068983855,0.9215001,0.0004745554,0.0000666267,0.0000510529,0.00014279548,0.00025916199,0.009424687],"genre_scores_gemma":[0.71293783,0.0012147974,0.27910125,0.00030618664,0.00020130238,0.00022319658,0.00034388053,0.00022664935,0.005444873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913675,0.00033272803,0.000039632952,0.00022165799,0.00018430674,0.00008496042],"domain_scores_gemma":[0.996387,0.0019428452,0.00058678247,0.00043799356,0.00035001576,0.00029533368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015061157,0.00061245245,0.00054865674,0.0028978223,0.001476788,0.002188033,0.0010819883,0.0012640818,0.002906029],"category_scores_gemma":[0.005793742,0.0004074236,0.000713109,0.0014449086,0.0040973523,0.004686829,0.002339606,0.0015401996,0.0006976181],"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.00005043957,0.000025088337,0.0017638362,0.00010219942,0.00001292621,0.00032189666,0.0006072073,0.013929801,0.00495176,0.9488137,0.0015371665,0.027883947],"study_design_scores_gemma":[0.00001150968,0.000096226475,0.000750863,0.00007179781,0.000013646033,0.0008548412,0.00044986137,0.118478544,0.0038996076,0.86077565,0.014555609,0.00004186915],"about_ca_topic_score_codex":0.0007100215,"about_ca_topic_score_gemma":0.00047510557,"teacher_disagreement_score":0.002906029,"about_ca_system_score_codex":0.0009698901,"about_ca_system_score_gemma":0.00041989938,"threshold_uncertainty_score":0.009721637},"labels":[],"label_agreement":null},{"id":"W60612749","doi":"10.1007/3-540-55797-0_109","title":"A search for close separation (≲ 1″) quasar images","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in physics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Theoretical Astrophysics","funders":"","keywords":"Quasar; Separation (statistics); Computer science; Physics; Astrophysics; Machine learning","score_opus":0.031422875237760196,"score_gpt":0.3131578236628399,"score_spread":0.2817349484250797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60612749","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.62641656,0.002938109,0.35045302,0.0014246897,0.0001994702,0.00011123352,0.0004853542,0.002274508,0.015696997],"genre_scores_gemma":[0.77940774,0.00058326096,0.21273409,0.00046985067,0.00030002408,0.00003890074,0.0010607274,0.00018738482,0.005218022],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99978584,0.000020740601,0.000007771824,0.00006576393,0.000086353764,0.00003346321],"domain_scores_gemma":[0.9991743,0.00029236605,0.00014944849,0.000095542106,0.00010776831,0.00018049362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051646325,0.0004340595,0.000698995,0.0014306416,0.00060686644,0.0014001123,0.00091949274,0.0014730694,0.0049646497],"category_scores_gemma":[0.0021803023,0.00046804646,0.0006015406,0.0010174302,0.00041306383,0.0015154032,0.001163337,0.001014483,0.001628631],"study_design_candidate":"observational","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.0018284514,0.00039423557,0.01850156,0.00054739276,0.00027322955,0.0015577018,0.0006021806,0.0076535284,0.5146048,0.02294964,0.008591035,0.42249632],"study_design_scores_gemma":[0.0008691967,0.0027322685,0.12775326,0.00016334822,0.00096501596,0.010088014,0.0019903644,0.4546238,0.27494374,0.08214884,0.043466408,0.00025579694],"about_ca_topic_score_codex":0.00019700556,"about_ca_topic_score_gemma":0.00044430242,"teacher_disagreement_score":0.0049646497,"about_ca_system_score_codex":0.00018197093,"about_ca_system_score_gemma":0.00021582058,"threshold_uncertainty_score":0.016608417},"labels":[],"label_agreement":null},{"id":"W61204195","doi":"","title":"Properties for a Certain Family of Knot Diagrams.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Knot (papermaking); Mathematics; Combinatorics; Materials science; Composite material","score_opus":0.026932256183836663,"score_gpt":0.2576191893182353,"score_spread":0.23068693313439864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61204195","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.429994,0.0011305998,0.35531124,0.0018050529,0.000492201,0.00014448556,0.001961058,0.0018568563,0.20730457],"genre_scores_gemma":[0.94589454,0.0007803112,0.026577726,0.00034265325,0.00022947528,0.00011901309,0.0016305129,0.00028645783,0.024139257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917454,0.00011647269,0.00006199093,0.000245131,0.00023904252,0.00016282748],"domain_scores_gemma":[0.99579006,0.0017911,0.0006135308,0.00060286385,0.000707648,0.0004948469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009704927,0.00041091983,0.0004246281,0.0029019185,0.002099445,0.0028138757,0.000662169,0.0012449565,0.017724672],"category_scores_gemma":[0.006601907,0.0003822977,0.0009570655,0.0016774924,0.0013499375,0.0044720173,0.0011689378,0.001487807,0.0025142843],"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.00008327014,0.000048940597,0.0024400973,0.00012273663,0.000020435067,0.0005320526,0.00046409684,0.00093745673,0.0026311916,0.97114545,0.0053151096,0.016259018],"study_design_scores_gemma":[0.000040416464,0.00006664343,0.0025329695,0.00008468645,0.000051725747,0.0037632252,0.00042667068,0.007744366,0.003075155,0.9368254,0.045344185,0.0000446537],"about_ca_topic_score_codex":0.0006395135,"about_ca_topic_score_gemma":0.000509082,"teacher_disagreement_score":0.017724672,"about_ca_system_score_codex":0.0007479407,"about_ca_system_score_gemma":0.00040800462,"threshold_uncertainty_score":0.05929488},"labels":[],"label_agreement":null},{"id":"W6907885124","doi":"10.25318/3610028601-fra","title":"Bénéfices et autres revenus de placements, par activité économique, annuel, 1926 - 1989","year":2019,"lang":"fr","type":"dataset","venue":"Statistics Canada Dissemination","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Limiting; General interest; Subject (documents)","score_opus":0.01833008959358421,"score_gpt":0.2936626607548954,"score_spread":0.27533257116131116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907885124","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031840985,0.00046390144,0.000060692637,0.00012391053,0.000022798233,0.0000073979036,0.993683,0.00004989251,0.0024043915],"genre_scores_gemma":[0.015603559,0.0013074297,0.00039782625,0.00007124059,0.000032850163,0.000082657556,0.9766248,0.000043344233,0.0058363825],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987489,0.00009776208,0.00018378631,0.00028561833,0.00046869845,0.00021516817],"domain_scores_gemma":[0.9959337,0.00094196876,0.00063567434,0.00034847693,0.0019015739,0.00023854912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007745819,0.0008848892,0.0009449701,0.006944844,0.0007451138,0.0020460568,0.00116746,0.00063763716,0.017274367],"category_scores_gemma":[0.00830143,0.00040794318,0.0007116392,0.016812244,0.00039974414,0.0012369662,0.0009785444,0.0013681641,0.010946998],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028749922,0.000043374024,0.0631911,0.001551672,0.00017327767,0.00007167376,0.00041131335,0.0011876553,0.00023071223,0.002835584,0.90475494,0.025261218],"study_design_scores_gemma":[0.00009057734,0.000023252203,0.27308542,0.00055139785,0.0000701128,0.00013181427,0.0011032075,0.00049244193,0.0003992022,0.0007189917,0.723276,0.00005761851],"about_ca_topic_score_codex":0.60564864,"about_ca_topic_score_gemma":0.69373477,"teacher_disagreement_score":0.39435136,"about_ca_system_score_codex":0.004479847,"about_ca_system_score_gemma":0.00509114,"threshold_uncertainty_score":0.79334754},"labels":[],"label_agreement":null},{"id":"W6926084589","doi":"10.22055/jacm.2022.40173.3534","title":"Neural Networks with Input Dimensionality Reduction for Efficient Temperature Distribution Prediction in a Warm Stamping Process","year":2022,"lang":"en","type":"article","venue":"TSpace","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial neural network; Process (computing); Blank; Dimensionality reduction; Finite element method; Principal component analysis; Reduction (mathematics); Curse of dimensionality","score_opus":0.013093419998478649,"score_gpt":0.2905239470666673,"score_spread":0.27743052706818866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926084589","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.27690595,0.0004491722,0.71887094,0.00026180636,0.000050086914,0.000042998257,0.00010681357,0.0012800533,0.0020322157],"genre_scores_gemma":[0.89742666,0.00012696469,0.10095031,0.00004897311,0.0000140331185,0.00006349073,0.00013288565,0.00003985946,0.0011968437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997749,0.00008807865,0.000012538973,0.000043703505,0.000054240605,0.000026615855],"domain_scores_gemma":[0.99947923,0.00031334846,0.00004961795,0.000051645802,0.00009337694,0.0000127727035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064342463,0.0005027288,0.0004887757,0.00022240172,0.00023185193,0.00045228438,0.00037686466,0.0005080025,0.0006525388],"category_scores_gemma":[0.0017651435,0.00032344295,0.00039637525,0.0002695691,0.00030079868,0.00059962354,0.00037133077,0.0008158688,0.00013062112],"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.00008355271,0.000028003364,0.0004312246,0.000018978659,0.000018795261,0.0000224555,0.000025212847,0.9563849,0.003553009,0.0007529963,0.00025710824,0.03842383],"study_design_scores_gemma":[8.125908e-7,0.0000053071835,0.000056005312,6.148693e-7,0.000001051651,0.0000011004413,0.0000010670534,0.9991296,0.00062539184,0.0001520522,0.000025955995,0.0000011276544],"about_ca_topic_score_codex":0.0055447663,"about_ca_topic_score_gemma":0.0051583042,"teacher_disagreement_score":0.0055447663,"about_ca_system_score_codex":0.0005375361,"about_ca_system_score_gemma":0.00047857975,"threshold_uncertainty_score":0.011024952},"labels":[],"label_agreement":null},{"id":"W6926347475","doi":"10.25316/ir-13853","title":"The Nanaimo Free Press [Tuesday, November 3, 1891]","year":2019,"lang":"en","type":"other","venue":"VIUSpace (Vancouver Island University Library)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.007222410508857676,"score_gpt":0.18859879843458033,"score_spread":0.18137638792572267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926347475","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.00071203185,0.01676312,0.00017351368,0.0030850507,0.005733074,0.000034407432,0.002580303,0.00014597083,0.97077256],"genre_scores_gemma":[0.00126673,0.002281477,0.000060103313,0.00013854759,0.00017765074,0.000009334475,0.00025128314,0.000064244516,0.99575067],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999571,0.000028302593,0.00001554123,0.000070658745,0.00022607176,0.00008847991],"domain_scores_gemma":[0.9997359,0.000033820284,0.000014839408,0.000018889135,0.00013292709,0.000063605155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034009214,0.0011637732,0.00066406524,0.002547664,0.0050076367,0.006138168,0.0008664213,0.0017469566,0.29108384],"category_scores_gemma":[0.0014079242,0.0005008357,0.000336415,0.004219457,0.00087669486,0.0019626848,0.0015871244,0.0028701322,0.100477405],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024399935,0.000008516028,0.00016379099,0.00009296057,0.0000034907969,0.00008253226,0.00012842401,0.00005942773,0.000078019715,0.010202781,0.9530513,0.036104392],"study_design_scores_gemma":[0.0000014656291,0.00000197406,0.00036492717,0.000055262735,7.690829e-7,0.000017300299,0.000042675194,0.000011984218,0.000029118193,0.00029756778,0.9991743,0.0000027098451],"about_ca_topic_score_codex":0.17630796,"about_ca_topic_score_gemma":0.5839876,"teacher_disagreement_score":0.823692,"about_ca_system_score_codex":0.0050398996,"about_ca_system_score_gemma":0.0036070838,"threshold_uncertainty_score":0.97377247},"labels":[],"label_agreement":null},{"id":"W6930664602","doi":"10.5281/zenodo.15218015","title":"FIGURES 112–118 in Revision of the western Nearctic species of Empis subgenus Enoplempis (Diptera: Empididae)","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Food Inspection Agency","funders":"","keywords":"Tibia; Femur; Hindlimb; Forelimb; Subgenus","score_opus":0.027756408961961302,"score_gpt":0.2621863293589449,"score_spread":0.23442992039698363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930664602","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.02971164,0.012911462,0.017817758,0.0018616235,0.023872407,0.0011328453,0.025039556,0.002355403,0.8852973],"genre_scores_gemma":[0.1918532,0.015539704,0.07119503,0.0014869169,0.0041385735,0.0016559701,0.064262204,0.0025883508,0.64728004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996984,0.000040974584,0.000042330612,0.000076922806,0.0001108683,0.000030535513],"domain_scores_gemma":[0.9995697,0.000033208667,0.000048957216,0.000063867345,0.000248999,0.000035212888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035143964,0.0007722692,0.00041763735,0.0031201583,0.0013805882,0.00081355654,0.0008314308,0.00047455198,0.07388444],"category_scores_gemma":[0.0010671959,0.00028666435,0.0003531826,0.0021091276,0.0007726538,0.001462351,0.00071897433,0.0013105414,0.02976141],"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.00035450226,0.000054752993,0.0053211693,0.0009779499,0.000045995923,0.0007621812,0.0015321517,0.00047183805,0.007136456,0.010105859,0.52333647,0.44990063],"study_design_scores_gemma":[0.0000068349477,0.000017053615,0.01253056,0.00015753292,0.000017611404,0.0005778998,0.00026371135,0.00012067323,0.00044089864,0.00050303654,0.9853555,0.000008737738],"about_ca_topic_score_codex":0.010124589,"about_ca_topic_score_gemma":0.026092365,"teacher_disagreement_score":0.07388444,"about_ca_system_score_codex":0.0006562286,"about_ca_system_score_gemma":0.00063245295,"threshold_uncertainty_score":0.24716806},"labels":[],"label_agreement":null},{"id":"W6931063258","doi":"10.5281/zenodo.4349108","title":"Dentachipteria Nevin 1977","year":2019,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Balsam; Genus; Square (algebra); Cape","score_opus":0.024560873964228274,"score_gpt":0.2470365280256578,"score_spread":0.22247565406142952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931063258","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.2716184,0.009737823,0.007900925,0.0006690311,0.0008257899,0.00039136835,0.008859859,0.0005180967,0.69947875],"genre_scores_gemma":[0.8539122,0.003447372,0.00660266,0.00080987747,0.00012408325,0.00013907469,0.0051944815,0.00007753522,0.12969273],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998692,0.0000067711035,0.000008794825,0.000049252907,0.000051766663,0.000014143085],"domain_scores_gemma":[0.9998264,0.000038201193,0.000053259362,0.000021954387,0.000040090246,0.000020183112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073183764,0.00049342855,0.00029933196,0.0013703757,0.0017909849,0.0005784183,0.0005480993,0.00053826335,0.01845657],"category_scores_gemma":[0.0004732449,0.0003389912,0.00015697727,0.0005937611,0.00035998123,0.00091542664,0.0008786141,0.00055656215,0.005251104],"study_design_candidate":"observational","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.0005210771,0.00017850874,0.0652951,0.00085667474,0.00009915109,0.002742872,0.0014852219,0.0017296175,0.035133224,0.005275332,0.04129671,0.8453865],"study_design_scores_gemma":[0.000071394534,0.00016325702,0.28526047,0.000634174,0.00011829814,0.009788316,0.0018090674,0.0012344465,0.0054784794,0.0027007197,0.69269603,0.000045302942],"about_ca_topic_score_codex":0.0170482,"about_ca_topic_score_gemma":0.055251442,"teacher_disagreement_score":0.01845657,"about_ca_system_score_codex":0.0004892722,"about_ca_system_score_gemma":0.0003834939,"threshold_uncertainty_score":0.06174338},"labels":[],"label_agreement":null},{"id":"W7042595576","doi":"","title":"PFA reconstruction with Directed Tree Clustering","year":2007,"lang":"en","type":"other","venue":"International Linear Collider","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Crosslight Software (Canada)","funders":"","keywords":"Cluster analysis; Fuzzy clustering; Pattern recognition (psychology); Tree (set theory); Feature (linguistics)","score_opus":0.014230687048761102,"score_gpt":0.2706997940369743,"score_spread":0.2564691069882132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042595576","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.0034962744,0.00009505209,0.9927159,0.00007773004,0.000055239143,0.000036811944,0.00014542227,0.0011280597,0.0022496083],"genre_scores_gemma":[0.032212473,0.0001313979,0.96400404,0.00007891514,0.000043812608,0.000053867872,0.00058619893,0.00051149743,0.0023778218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989379,0.00025403043,0.000051439056,0.00020757478,0.00048218368,0.00006693956],"domain_scores_gemma":[0.9972053,0.0007654493,0.00012921811,0.0011837638,0.00059181446,0.00012448942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012877004,0.001164788,0.0013825459,0.0021923566,0.0012303864,0.002226675,0.0024471309,0.0022565653,0.007886811],"category_scores_gemma":[0.0068677054,0.0007769127,0.0013335916,0.0026885683,0.00095896714,0.0030647423,0.002068408,0.0021660887,0.0042305687],"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.00035747743,0.00017838358,0.0018367164,0.0003799248,0.0003004073,0.00036176058,0.00034539888,0.3486487,0.026959796,0.073748365,0.016970865,0.5299123],"study_design_scores_gemma":[0.000028899378,0.000034512635,0.00032848676,0.000020162475,0.00002943148,0.000251977,0.000038072456,0.95238316,0.009324973,0.025956878,0.01155418,0.000049357786],"about_ca_topic_score_codex":0.0046982,"about_ca_topic_score_gemma":0.005194809,"teacher_disagreement_score":0.007886811,"about_ca_system_score_codex":0.0008262348,"about_ca_system_score_gemma":0.0011747977,"threshold_uncertainty_score":0.026383936},"labels":[],"label_agreement":null},{"id":"W7066362087","doi":"","title":"Hawkins, Alden Alberta (Birth, 1910-08-27)","year":2012,"lang":"en","type":"other","venue":"Spectrum Research Repository (Concordia University)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Work (physics); Natural (archaeology); Population","score_opus":0.02601619034415703,"score_gpt":0.26983373626597634,"score_spread":0.2438175459218193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066362087","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.0055921,0.0035683527,0.00047289857,0.0039450536,0.0042155404,0.00011972461,0.008106286,0.00069072936,0.9732894],"genre_scores_gemma":[0.0014102265,0.0003704948,0.000100452664,0.00014160192,0.000041691637,0.0000036265994,0.0002557237,0.00005372994,0.99762243],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999772,0.000007961376,0.0000063392495,0.00006203925,0.00007316705,0.00007844104],"domain_scores_gemma":[0.9996208,0.000020742556,0.000009542154,0.000017121025,0.000158141,0.00017367465],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033435252,0.00069869333,0.00040690112,0.00106071,0.0041467515,0.0015791444,0.000982423,0.0010311621,0.6023184],"category_scores_gemma":[0.000598941,0.0003569589,0.00034104346,0.0011527005,0.0005597547,0.000656436,0.0012164372,0.0023134395,0.24982926],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014294015,0.00006589398,0.0016121872,0.00006687233,0.000008415902,0.00073939085,0.00020408792,0.0001646708,0.0005682527,0.0033154914,0.85246503,0.14064683],"study_design_scores_gemma":[0.000010354391,0.000029476583,0.0035716605,0.00006183706,0.0000057119096,0.00024656372,0.0003034539,0.000045034507,0.0002441369,0.00028753516,0.99518603,0.0000082582865],"about_ca_topic_score_codex":0.33122516,"about_ca_topic_score_gemma":0.76489055,"teacher_disagreement_score":0.66877484,"about_ca_system_score_codex":0.0030919693,"about_ca_system_score_gemma":0.0043614046,"threshold_uncertainty_score":0.6585944},"labels":[],"label_agreement":null},{"id":"W7098127291","doi":"","title":"Aproximity Compatibility Function Among 3-D Surfaces For Environment Modelling","year":2007,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compatibility (geochemistry); Computation; Segmentation; Euclidean geometry; Euclidean distance; Image segmentation","score_opus":0.03286511483565406,"score_gpt":0.24908361481703856,"score_spread":0.21621849998138448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098127291","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.00998904,0.00010708589,0.9883768,0.000052350406,0.00001540879,0.000023155722,0.000060255523,0.00039507324,0.0009809015],"genre_scores_gemma":[0.17818253,0.00024912757,0.818567,0.000034793,0.00004060594,0.00006775293,0.0003867637,0.00023828252,0.0022331108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903226,0.00014150955,0.000041935757,0.00011809097,0.0006014515,0.00006477797],"domain_scores_gemma":[0.9990125,0.00038240472,0.000090969,0.0001758982,0.0002736324,0.00006456891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008397215,0.0008984546,0.00063691684,0.0014581131,0.0005594802,0.0017366094,0.0010700709,0.00090069894,0.003971438],"category_scores_gemma":[0.0023646047,0.0003826474,0.0010539438,0.001128237,0.0007397795,0.0014817937,0.0012810663,0.0009004424,0.0010468459],"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.00021834306,0.0001192053,0.0070962696,0.00029616614,0.00006369814,0.00027196063,0.0004407664,0.17210725,0.072074905,0.09682143,0.00407197,0.64641804],"study_design_scores_gemma":[0.00001231516,0.00012728882,0.0031967585,0.000031712505,0.00001639933,0.00045958004,0.00014939858,0.91137606,0.030624496,0.037651416,0.016307782,0.000046733738],"about_ca_topic_score_codex":0.0018531503,"about_ca_topic_score_gemma":0.0014567329,"teacher_disagreement_score":0.003971438,"about_ca_system_score_codex":0.0005581577,"about_ca_system_score_gemma":0.0005521044,"threshold_uncertainty_score":0.013285756},"labels":[],"label_agreement":null},{"id":"W7118018121","doi":"10.1007/979-8-8688-2148-6_2","title":"Line","year":2025,"lang":"en","type":"book-chapter","venue":"Apress eBooks","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rockyview General Hospital","funders":"","keywords":"Pixel; Coordinate system; Computer graphics; Line (geometry); Graphics; Coordinate space","score_opus":0.024146792062821738,"score_gpt":0.2568921359554763,"score_spread":0.23274534389265453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118018121","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.00048870133,0.0011124774,0.010359985,0.000804737,0.0011031749,0.000053240008,0.0013859912,0.0025324349,0.9821593],"genre_scores_gemma":[0.0028678451,0.0006287318,0.0032869112,0.00038095616,0.00012355857,0.000029406036,0.0013050749,0.0006011981,0.99077636],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997043,0.000024302657,0.000011855798,0.00008008225,0.0001495195,0.000029923442],"domain_scores_gemma":[0.99957913,0.00004692386,0.000017161046,0.00010639305,0.00020541738,0.000044945118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019415817,0.0008110513,0.0003864762,0.0014194801,0.0013702764,0.0034940555,0.0012647809,0.001338017,0.5412958],"category_scores_gemma":[0.0009914171,0.00034029922,0.0003810439,0.0018598904,0.0005589363,0.0034280368,0.0013025637,0.0012622079,0.3984532],"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.000059613005,0.000028406284,0.000099383105,0.00016022583,0.0000043455516,0.000102146,0.0001992134,0.00020519047,0.0014232958,0.07153742,0.7019108,0.22427002],"study_design_scores_gemma":[0.0000022956085,0.0000048022644,0.000037113892,0.000018221823,8.543325e-7,0.000059684415,0.000021383627,0.00006498861,0.0002706671,0.0020009477,0.99751675,0.0000022356812],"about_ca_topic_score_codex":0.0020943168,"about_ca_topic_score_gemma":0.0033901588,"teacher_disagreement_score":0.5412958,"about_ca_system_score_codex":0.0009713771,"about_ca_system_score_gemma":0.000527544,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W7132876426","doi":"","title":"Implementation of an affine-invariant feature detector in field-programmable gate arrays","year":2006,"lang":"","type":"dissertation","venue":"TSpace","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Stratix; Field-programmable gate array; Feature (linguistics); Detector; Porting; Process (computing); Software; Electronic circuit","score_opus":0.014847490464951303,"score_gpt":0.35410493581290986,"score_spread":0.33925744534795854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132876426","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.12627688,0.00031799055,0.844243,0.00023044254,0.00022756893,0.0003969866,0.00031949146,0.013268625,0.014718923],"genre_scores_gemma":[0.5635593,0.00019500237,0.42391774,0.00017384473,0.000032059135,0.00019532024,0.00033666953,0.00015105074,0.011439059],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981195,0.00001752098,0.000010642408,0.00003591775,0.00008476185,0.00003934108],"domain_scores_gemma":[0.9998171,0.000043137337,0.000018744913,0.000026624139,0.0000807411,0.0000137922425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019855416,0.00034271742,0.0002496035,0.00041497248,0.00025892336,0.00046850086,0.0009274137,0.0003588466,0.004567026],"category_scores_gemma":[0.0004952156,0.00019906598,0.00016065715,0.00031364724,0.00016310862,0.00039834977,0.00016948588,0.00030967733,0.0012592258],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0006700473,0.00029584265,0.0032766291,0.00030052353,0.000086266984,0.0009127712,0.00023624836,0.03747024,0.48938107,0.0114598,0.014021789,0.4418889],"study_design_scores_gemma":[0.00026104238,0.0011147729,0.0036971609,0.00004371427,0.000076335586,0.00097072014,0.00006365079,0.29131645,0.66289645,0.001871553,0.037617084,0.000071051414],"about_ca_topic_score_codex":0.0026389507,"about_ca_topic_score_gemma":0.003228468,"teacher_disagreement_score":0.004567026,"about_ca_system_score_codex":0.0005041074,"about_ca_system_score_gemma":0.00059913256,"threshold_uncertainty_score":0.01527822},"labels":[],"label_agreement":null},{"id":"W812453981","doi":"10.1007/978-3-642-53845-2_5","title":"Edges, Lines, Ridges, and Nearness Structures","year":2014,"lang":"en","type":"book-chapter","venue":"Intelligent systems reference library","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Ridge; Watershed; Enhanced Data Rates for GSM Evolution; Geology; Geography; Geometry; Topology (electrical circuits); Computer science; Mathematics; Computer vision; Cartography; Combinatorics","score_opus":0.042645770104894974,"score_gpt":0.2449280137420972,"score_spread":0.2022822436372022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W812453981","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013856944,0.11834273,0.3027665,0.0010943591,0.0020162645,0.000083068815,0.0010462733,0.0030934091,0.55770046],"genre_scores_gemma":[0.116404586,0.094892465,0.24204215,0.0010888376,0.002274693,0.00012292652,0.002261039,0.0015254929,0.5393879],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983656,0.000011689488,0.0000077287705,0.000050704915,0.00008198516,0.000011225344],"domain_scores_gemma":[0.99982905,0.000061324405,0.000015600805,0.000034530232,0.00004457248,0.0000148927675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016157568,0.00086472894,0.0005319724,0.0017550939,0.00045623412,0.0027291884,0.0010099915,0.00084932416,0.018902652],"category_scores_gemma":[0.0006597755,0.0005006121,0.00045076245,0.002606359,0.0012526284,0.00303444,0.0006408072,0.0014523565,0.007864078],"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.000049984403,0.000034099372,0.0004896937,0.00060798414,0.000016459575,0.00013205633,0.00034128997,0.0032473062,0.006273591,0.2186178,0.059717886,0.71047187],"study_design_scores_gemma":[0.000016107417,0.00007766277,0.0036139456,0.00060852646,0.000048975275,0.0020978171,0.0005067641,0.013989429,0.0036977662,0.34680533,0.6284696,0.00006805421],"about_ca_topic_score_codex":0.0009874814,"about_ca_topic_score_gemma":0.002049253,"teacher_disagreement_score":0.018902652,"about_ca_system_score_codex":0.00031853115,"about_ca_system_score_gemma":0.0002933239,"threshold_uncertainty_score":0.0632357},"labels":[],"label_agreement":null},{"id":"W830378138","doi":"","title":"A monocular approach to 3-D reconstruction based on bilateral symmetry","year":2000,"lang":"en","type":"article","venue":"Machine Graphics and Vision","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Monocular; Artificial intelligence; Symmetry (geometry); Computer vision; Computer science; Mathematics; Geometry","score_opus":0.009264412665214734,"score_gpt":0.26136505484797456,"score_spread":0.25210064218275985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W830378138","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.0015688696,0.00008793224,0.9968592,0.00003576164,0.00002263215,0.000016668784,0.00002083926,0.0001634932,0.0012246997],"genre_scores_gemma":[0.04589287,0.00034597074,0.9502473,0.00006913835,0.000045440254,0.000047249578,0.00008525031,0.00009338667,0.0031734258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994974,0.000070807946,0.000019259835,0.00006260148,0.00031767195,0.000032216183],"domain_scores_gemma":[0.999764,0.00005855964,0.000016678454,0.000061046245,0.00008111095,0.000018534203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045455873,0.0004672788,0.00070594327,0.0008067068,0.00042425992,0.00083515036,0.0009099546,0.0006151308,0.0045467895],"category_scores_gemma":[0.0009013454,0.00047109445,0.0007658986,0.0008654428,0.00048310796,0.001080988,0.0011670692,0.00073520106,0.0012584302],"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.00021184048,0.000099355544,0.0004697619,0.00024853958,0.00009774291,0.00021368347,0.00021338939,0.06966257,0.10776077,0.10584735,0.007133111,0.7080417],"study_design_scores_gemma":[0.000036487356,0.000104597115,0.00058863015,0.00002452946,0.00004169062,0.00074600644,0.000050878356,0.9137265,0.033828206,0.034267083,0.016523419,0.00006197528],"about_ca_topic_score_codex":0.0019292955,"about_ca_topic_score_gemma":0.002990606,"teacher_disagreement_score":0.0045467895,"about_ca_system_score_codex":0.00036312937,"about_ca_system_score_gemma":0.0006078928,"threshold_uncertainty_score":0.015210509},"labels":[],"label_agreement":null},{"id":"W868478150","doi":"10.1007/s00373-015-1604-8","title":"Generating and Enumerating Digitally Convex Sets of Trees","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Convex set; Regular polygon; Convex combination; Subderivative; Convex polytope; Discrete mathematics; Graph; Convex optimization","score_opus":0.022965215779435815,"score_gpt":0.2469225674137485,"score_spread":0.22395735163431268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W868478150","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.23211503,0.00027605428,0.7472559,0.00069042173,0.000055337736,0.00015105853,0.001164237,0.00065784104,0.01763416],"genre_scores_gemma":[0.5237388,0.00040307897,0.45950383,0.00019886151,0.0000652228,0.00017918533,0.0027465601,0.00036821605,0.012796201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905294,0.00018759235,0.00007632418,0.0001755137,0.00036853214,0.00013908914],"domain_scores_gemma":[0.9939645,0.0039331815,0.0003498424,0.0009097547,0.000616455,0.00022622381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006513852,0.0004635356,0.00074980577,0.0017525561,0.0009289051,0.0026484923,0.0017687391,0.0008938245,0.0046053864],"category_scores_gemma":[0.007648157,0.0005943652,0.0010321814,0.0022486965,0.0014838086,0.003313613,0.002053633,0.0017124679,0.00073671277],"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.00018345367,0.00019172224,0.0035352046,0.00031555875,0.00004514552,0.00027888452,0.0007379116,0.13472414,0.011638572,0.69135505,0.006101436,0.15089291],"study_design_scores_gemma":[0.000025261064,0.000032351047,0.0006615048,0.00005383551,0.000031147203,0.0002141001,0.00024645,0.36291754,0.011038554,0.6200498,0.0047103576,0.000019048768],"about_ca_topic_score_codex":0.0017766342,"about_ca_topic_score_gemma":0.0043464596,"teacher_disagreement_score":0.0046053864,"about_ca_system_score_codex":0.0014532655,"about_ca_system_score_gemma":0.0010146893,"threshold_uncertainty_score":0.015406549},"labels":[],"label_agreement":null},{"id":"W87963164","doi":"","title":"Plane Triangulations in Product Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","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":"Mathematics; Plane (geometry); Product (mathematics); Combinatorics; Geometry","score_opus":0.014243543009763179,"score_gpt":0.2553033681488159,"score_spread":0.2410598251390527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87963164","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.21862932,0.00438417,0.63332623,0.0011967858,0.00048472808,0.00012730906,0.0013313761,0.00090934976,0.13961071],"genre_scores_gemma":[0.7637366,0.0043562856,0.16669545,0.00030726902,0.00028443252,0.00011254272,0.0018185957,0.0005103368,0.062178493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953437,0.0001291553,0.00002905511,0.00009757312,0.00014209768,0.00006768529],"domain_scores_gemma":[0.9987785,0.00050796353,0.00023012301,0.00020413332,0.00016466128,0.0001145662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033775796,0.00037876877,0.0004464886,0.0019119167,0.000958373,0.0022272503,0.0006424467,0.00073800364,0.013747364],"category_scores_gemma":[0.0022750718,0.00052753976,0.0005713571,0.002046025,0.0014718904,0.0029119735,0.0015858164,0.001407823,0.0030418122],"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.00008075257,0.000020655325,0.0008864356,0.00013772705,0.00002335449,0.00025416721,0.0003198758,0.0057319524,0.0021662465,0.92282706,0.008270672,0.05928107],"study_design_scores_gemma":[0.000023214467,0.000033301836,0.0008796492,0.00006559839,0.000026760057,0.0007703939,0.00044489518,0.023324957,0.0018190566,0.93282956,0.03976261,0.00002000903],"about_ca_topic_score_codex":0.001899531,"about_ca_topic_score_gemma":0.0030682525,"teacher_disagreement_score":0.013747364,"about_ca_system_score_codex":0.0006926222,"about_ca_system_score_gemma":0.00033133515,"threshold_uncertainty_score":0.045989513},"labels":[],"label_agreement":null},{"id":"W99117189","doi":"","title":"An Extremal Problem on the Potentially Kr+1-e Graphic Sequences.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":16,"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":"Mathematics; Combinatorics","score_opus":0.01580827587581085,"score_gpt":0.25106317054749977,"score_spread":0.23525489467168892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99117189","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.4701637,0.0035929875,0.26728067,0.008276111,0.0007924189,0.00015142659,0.001735439,0.0007574402,0.24724971],"genre_scores_gemma":[0.89569145,0.0013939512,0.055039093,0.0008339789,0.00044529504,0.00013023843,0.0015435851,0.00023327464,0.044689156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949384,0.00013603033,0.000029837474,0.00010434742,0.00010549902,0.00013052612],"domain_scores_gemma":[0.99864846,0.00080036063,0.00016190195,0.00013434078,0.000102283564,0.00015271253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004898125,0.0006882938,0.0008465004,0.0015051184,0.0016400184,0.0027194396,0.0009314429,0.0020018923,0.020650053],"category_scores_gemma":[0.0051136278,0.00044203617,0.0005282893,0.0012795664,0.001601523,0.003003983,0.0021222623,0.002730158,0.002302349],"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.0003287028,0.00007389154,0.0007192626,0.00022499282,0.00003185321,0.000595085,0.00023789691,0.00966549,0.0020279502,0.9236234,0.019152014,0.04331952],"study_design_scores_gemma":[0.00005718683,0.000056246245,0.00058929174,0.00006434909,0.00001930248,0.00066735427,0.00023290221,0.024376655,0.0013155456,0.95862967,0.013965014,0.00002655861],"about_ca_topic_score_codex":0.000641432,"about_ca_topic_score_gemma":0.0008612481,"teacher_disagreement_score":0.020650053,"about_ca_system_score_codex":0.0007407438,"about_ca_system_score_gemma":0.00041490563,"threshold_uncertainty_score":0.06908131},"labels":[],"label_agreement":null}]}