{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17865925,0.0130515415,0.7594287,0.00012201506,0.00043226717,0.00026146427,0.000021819187,0.00014004801,0.047882933],"genre_scores_gemma":[0.7008891,0.0016925499,0.29635304,0.000026645997,0.000026236608,8.5219085e-7,0.0000032704984,0.000012584302,0.000995691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982153,0.0002461682,0.00038311185,0.00043477444,0.00036084428,0.00035979072],"domain_scores_gemma":[0.99823,0.00009994404,0.00025999878,0.00054564595,0.0007220948,0.00014234669],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003771642,0.0003426644,0.0003727272,0.0002797325,0.00066517893,0.00011572247,0.0018013907,0.00025699782,0.00004164944],"category_scores_gemma":[0.00023096293,0.0003379275,0.000330608,0.00079469953,0.005956813,0.0033942729,0.0010630256,0.00034996076,0.000012196794],"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.0003940987,0.002306428,0.055279367,0.01738523,0.00071945006,0.00018051954,0.15521783,0.009360285,0.15191443,0.44358382,0.0057914546,0.15786707],"study_design_scores_gemma":[0.00048048265,0.0002570518,0.43680033,0.008585394,0.00020929586,0.00020283619,0.00032205132,0.0101080295,0.43265876,0.10717977,0.0026372322,0.000558758],"about_ca_topic_score_codex":0.0053741927,"about_ca_topic_score_gemma":0.010446759,"teacher_disagreement_score":0.5222299,"about_ca_system_score_codex":0.00066793826,"about_ca_system_score_gemma":0.0005242867,"threshold_uncertainty_score":0.99990726},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97209275,0.00048171086,0.01978714,0.00036654924,0.00031236964,0.00025086023,0.00009951044,0.0004112942,0.006197811],"genre_scores_gemma":[0.9356445,0.000013087712,0.06418129,0.000062347965,0.0000018494486,0.000012825814,0.000008522856,0.000012623742,0.000062953266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987509,0.000023807239,0.00033470415,0.00028907615,0.00036342564,0.0002380693],"domain_scores_gemma":[0.9987679,0.00014407535,0.00024020573,0.00043035668,0.00033197895,0.00008547224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015177099,0.00015833657,0.000260791,0.000056958645,0.00009929264,0.00006705068,0.00058257347,0.000045311026,0.0000071540676],"category_scores_gemma":[0.00007779691,0.0001377328,0.00004227862,0.00054013723,0.00033349014,0.0004943635,0.00024977283,0.00010393205,0.0000024789972],"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.000023048646,0.00075360184,0.0059218295,0.000059113565,0.000054716005,0.00001839714,0.00027619587,0.00005043747,0.041125804,0.9490019,0.0018616864,0.00085323857],"study_design_scores_gemma":[0.0012347295,0.0002948468,0.00012045907,0.00030213068,0.000019486197,0.000029976236,0.000014267264,0.00013926844,0.37717265,0.6201415,0.00029326454,0.00023738675],"about_ca_topic_score_codex":0.00004529466,"about_ca_topic_score_gemma":0.00002037301,"teacher_disagreement_score":0.33604684,"about_ca_system_score_codex":0.000060444858,"about_ca_system_score_gemma":0.0001932701,"threshold_uncertainty_score":0.5616581},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94527143,0.00043666668,0.02319608,0.0073660607,0.00010137407,0.000886103,0.000002556817,0.001327777,0.021411955],"genre_scores_gemma":[0.9672411,0.00000777056,0.032548822,0.00012942715,0.0000075456373,0.000018721075,6.71854e-8,0.000006962798,0.00003955346],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990856,0.0000063320967,0.00028462757,0.00014574156,0.00030470223,0.00017300175],"domain_scores_gemma":[0.9988521,0.000081698396,0.00031498467,0.0001568174,0.000559423,0.000034991084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002873771,0.00009891129,0.00014099403,0.00005824798,0.00013007598,0.00041814207,0.001219122,0.000038992832,0.0000019227678],"category_scores_gemma":[0.00045616686,0.000056402794,0.000048374048,0.00043106318,0.00021959354,0.0019573974,0.00055293355,0.00011799854,0.000002144267],"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.000016889839,0.0003788219,0.03418295,0.001103177,0.00017046435,4.9717295e-7,0.022559958,0.00004154472,0.44423547,0.16996877,0.015277802,0.31206366],"study_design_scores_gemma":[0.00029964108,0.00007643119,0.030811317,0.00057310524,0.00002732361,0.00005064323,0.0005171912,0.14373258,0.7273661,0.09597893,0.00028284357,0.00028390638],"about_ca_topic_score_codex":0.00002244742,"about_ca_topic_score_gemma":2.2100994e-7,"teacher_disagreement_score":0.31177974,"about_ca_system_score_codex":0.000018155424,"about_ca_system_score_gemma":0.000029274035,"threshold_uncertainty_score":0.40321535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94232136,0.00009749614,0.009772506,0.00026802058,0.00075011916,0.00012523246,0.0000025901668,0.0006647772,0.045997903],"genre_scores_gemma":[0.9840005,0.000006701165,0.015640998,0.00017962647,0.0000015512597,0.0000068973236,0.000001280364,0.000009369016,0.00015308784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990306,0.000022373632,0.00018678619,0.00024872026,0.00033113602,0.00018036482],"domain_scores_gemma":[0.99914104,0.00008342058,0.00009109661,0.00049515825,0.00012625974,0.00006304923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012037635,0.0001112679,0.0001518902,0.00009626678,0.000067252455,0.000045823377,0.0008107279,0.000046219644,0.000005213898],"category_scores_gemma":[0.00009641455,0.000106913954,0.000053218235,0.00034130638,0.00010563866,0.0005628574,0.00022205518,0.000103100785,0.000044799748],"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.000004034692,0.00018571291,0.00069337763,0.000009432234,0.000006139058,0.000041473144,0.00012480572,0.0000017364694,0.0002816397,0.9847797,0.006222304,0.0076496317],"study_design_scores_gemma":[0.00024364961,0.00020066193,0.0023914853,0.000038167087,0.0000014390596,0.000037812522,0.0000010565633,0.0011050786,0.03475415,0.96067077,0.00041029367,0.00014546621],"about_ca_topic_score_codex":0.000003825792,"about_ca_topic_score_gemma":1.5796557e-7,"teacher_disagreement_score":0.045844816,"about_ca_system_score_codex":0.000024218258,"about_ca_system_score_gemma":0.00009102429,"threshold_uncertainty_score":0.43598247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96069753,0.0005374815,0.0063404646,0.0013911503,0.006890867,0.0008897219,0.000086342225,0.0051572174,0.018009203],"genre_scores_gemma":[0.94960105,0.00006681041,0.04880248,0.0011648199,0.000018691098,0.00003978178,0.000041844185,0.00008332478,0.00018121944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552006,0.00014970962,0.0009326851,0.00139253,0.0007154546,0.0012895527],"domain_scores_gemma":[0.99585253,0.00036581693,0.00087787973,0.0017770003,0.00062561507,0.0005011499],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001175702,0.0006693627,0.00073080725,0.0009074424,0.00029459476,0.0010890209,0.0026263476,0.0003849295,0.000033716664],"category_scores_gemma":[0.00037460917,0.00071896,0.00027666683,0.0022855885,0.00042363026,0.002936526,0.0007357183,0.00071545003,0.00010147947],"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.000077680714,0.00041003406,0.06443252,0.00022313328,0.0003571698,0.0006958915,0.0011424087,0.0000022189554,0.0016966115,0.83441406,0.052780226,0.043768063],"study_design_scores_gemma":[0.0010050647,0.00017769761,0.0040460373,0.00027504232,0.000037188645,0.00055493985,0.00028457487,0.00027050998,0.027646875,0.9597107,0.0049822014,0.001009127],"about_ca_topic_score_codex":0.00009441378,"about_ca_topic_score_gemma":0.00005485111,"teacher_disagreement_score":0.1252967,"about_ca_system_score_codex":0.00017643964,"about_ca_system_score_gemma":0.00016417154,"threshold_uncertainty_score":0.99994797},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024916136,0.00040355063,0.9849518,0.00041552354,0.0005068222,0.00023708654,0.0000049354026,0.00025821902,0.012972892],"genre_scores_gemma":[0.3180933,0.00005346619,0.67996556,0.0011896644,0.00013115382,0.000009042996,0.000002391202,0.00003757798,0.00051785173],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644625,0.000015892527,0.00058337476,0.0012886266,0.0011467872,0.0005190826],"domain_scores_gemma":[0.9975294,0.00030539787,0.00038278487,0.0013929735,0.00025705958,0.0001323813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003642324,0.00049737265,0.0005542466,0.0010682232,0.000111484485,0.0003320296,0.0038531164,0.00022826601,0.0000072861726],"category_scores_gemma":[0.00009538273,0.00043566505,0.00013488083,0.00053431845,0.0010919166,0.0007704649,0.0015191427,0.00050156255,0.000022220667],"study_design_candidate":"design_other","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.000012759194,0.00010230831,0.000020496356,0.00005905623,0.000010549572,0.00013637343,0.0006278052,0.0013101253,0.0006520725,0.024125276,0.00030661633,0.9726366],"study_design_scores_gemma":[0.00069673173,0.0022287872,0.0003484804,0.0028302271,0.000015804852,0.00035721928,1.39381e-7,0.24430773,0.15847665,0.58388245,0.0044225124,0.002433286],"about_ca_topic_score_codex":0.00001085206,"about_ca_topic_score_gemma":0.0000047118556,"teacher_disagreement_score":0.9702033,"about_ca_system_score_codex":0.00020898762,"about_ca_system_score_gemma":0.00050995627,"threshold_uncertainty_score":0.9998095},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000058889955,0.0002333086,0.91782737,0.000105749285,0.00006216934,0.00064863334,0.00006978773,0.00051615713,0.080530934],"genre_scores_gemma":[0.00082139997,0.000005948441,0.9854914,0.0005051021,0.00011343273,0.00006153729,0.00020054508,0.000057740996,0.012742916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977114,0.000011986124,0.0005842913,0.00078618363,0.00059085136,0.0003152399],"domain_scores_gemma":[0.9974284,0.00037731908,0.0004950668,0.00043649832,0.0011230335,0.00013964968],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047695157,0.00040684157,0.0006301978,0.00052126613,0.0000820552,0.0015738844,0.0010715717,0.00024385695,0.0000033461715],"category_scores_gemma":[0.000065955304,0.00038303155,0.00010869082,0.00027305586,0.00037276364,0.0016601383,0.000792847,0.00020944502,0.0000039625634],"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.000022790446,0.00012337112,0.0000074829554,0.0015208132,0.00007972345,0.0000044838566,0.00023295166,0.000017897233,0.000026043928,0.34567082,0.20212966,0.45016396],"study_design_scores_gemma":[0.0006664382,0.00022057857,0.000050976592,0.00039153997,0.00003941643,0.00004097428,0.0000042699003,0.060245078,0.0002712976,0.882809,0.05444458,0.0008158683],"about_ca_topic_score_codex":0.0000030960641,"about_ca_topic_score_gemma":0.0000013510655,"teacher_disagreement_score":0.53713816,"about_ca_system_score_codex":0.00007349574,"about_ca_system_score_gemma":0.00081897044,"threshold_uncertainty_score":0.99986213},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19694343,0.0016331772,0.20423228,0.008307837,0.008488766,0.0009803204,0.0000070987226,0.010211415,0.5691957],"genre_scores_gemma":[0.97129095,0.000021647857,0.027300578,0.0007036912,0.0000045825755,0.000017035607,8.169622e-7,0.000015518968,0.0006451541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985912,0.000038426944,0.00019908311,0.00043661395,0.0004101846,0.00032451257],"domain_scores_gemma":[0.99891,0.00006219426,0.00009087341,0.00071918074,0.00010934177,0.00010840675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017015844,0.00017474804,0.00015201274,0.00017363823,0.00012315989,0.0005622668,0.0014446169,0.000072263494,0.000028634566],"category_scores_gemma":[0.00009166926,0.00016854894,0.00007539298,0.0006596268,0.00009524399,0.0011278341,0.00023888516,0.0001796125,0.00032576907],"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":[9.686802e-7,0.00015193605,0.000050032737,0.000006959141,0.000007648609,0.000056402187,0.000065366425,0.0000016692011,0.0003356889,0.93648314,0.010165742,0.05267442],"study_design_scores_gemma":[0.00021994008,0.00018083522,0.000092150876,0.00004557702,0.0000031050968,0.000019389383,0.0000014923488,0.0029249662,0.0059443587,0.98759896,0.0027271307,0.00024208454],"about_ca_topic_score_codex":0.0000064031397,"about_ca_topic_score_gemma":4.8316844e-7,"teacher_disagreement_score":0.77434754,"about_ca_system_score_codex":0.000041039966,"about_ca_system_score_gemma":0.000023565697,"threshold_uncertainty_score":0.6873226},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042796647,0.0014656225,0.42740402,0.0038898378,0.00076607784,0.0004998812,0.0000022505092,0.0025870516,0.5591056],"genre_scores_gemma":[0.73643875,0.000054772256,0.25846407,0.0011580208,0.000069288966,0.00007008435,9.5247447e-7,0.00003096676,0.003713126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987061,0.000054569253,0.00019581533,0.00035643514,0.00032934468,0.00035772342],"domain_scores_gemma":[0.99889094,0.00016766971,0.000086937245,0.00068705523,0.000099696605,0.00006768888],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00044162237,0.00015820801,0.00010787895,0.00005330792,0.00031863982,0.0010970786,0.0011405022,0.000052579468,0.0000034495497],"category_scores_gemma":[0.00017186263,0.00010468652,0.000052185926,0.00033911163,0.00008054533,0.0006663977,0.00016328413,0.00018813409,0.0001260615],"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.000004288646,0.00011533914,0.00013065671,0.000017375723,0.000014042419,0.000017834303,0.0002885035,0.00002501555,0.0011136152,0.6829097,0.012631738,0.3027319],"study_design_scores_gemma":[0.00040311075,0.00033715498,0.000200859,0.00023004386,0.000009077625,0.00005967144,0.000049117873,0.0040751346,0.13987537,0.51557875,0.3384613,0.0007204009],"about_ca_topic_score_codex":0.0000038565317,"about_ca_topic_score_gemma":0.000004828837,"teacher_disagreement_score":0.7321591,"about_ca_system_score_codex":0.00003938939,"about_ca_system_score_gemma":0.000073941505,"threshold_uncertainty_score":0.99993986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062226536,0.00049092417,0.9753638,0.00071792374,0.0011597872,0.00028742984,0.000007937191,0.000788571,0.021121427],"genre_scores_gemma":[0.13350907,0.00006810893,0.86351424,0.002040772,0.00033378936,0.000013226422,0.00000786877,0.00005272384,0.00046021756],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954056,0.000027489268,0.0005425955,0.0017918883,0.0014549237,0.0007774947],"domain_scores_gemma":[0.99733067,0.00036744832,0.0002665088,0.0015541457,0.00025727027,0.00022398013],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00067319954,0.00063485204,0.00054453994,0.00090947835,0.00024549817,0.001486251,0.006193891,0.00034270596,0.000077680255],"category_scores_gemma":[0.000099445526,0.00058439013,0.0001514766,0.0008003716,0.0012917254,0.00149631,0.0013118667,0.0007228599,0.00012558505],"study_design_candidate":"design_other","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.000006289976,0.00003760839,0.000050905026,0.00003132036,0.0000048485263,0.00014758024,0.00019125384,0.0089776255,0.00010817302,0.0052507296,0.00008848328,0.98510516],"study_design_scores_gemma":[0.00021226992,0.00021316242,0.000054891054,0.0006156561,0.0000073789924,0.000036229925,2.3150562e-8,0.4076877,0.011786391,0.573913,0.0043641706,0.0011091931],"about_ca_topic_score_codex":0.00002102198,"about_ca_topic_score_gemma":0.000033351324,"teacher_disagreement_score":0.983996,"about_ca_system_score_codex":0.00024594765,"about_ca_system_score_gemma":0.0010693118,"threshold_uncertainty_score":0.99966073},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012846951,0.000039190094,0.9695645,0.0005135983,0.0003295341,0.00038902435,0.0000051255442,0.0018657671,0.014446327],"genre_scores_gemma":[0.43950263,0.0000020036987,0.5593389,0.0002174285,0.000054252218,0.00007397293,0.0000037759173,0.000017255328,0.0007897317],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829173,0.0000050931476,0.0003116694,0.0005935171,0.00032440576,0.00047360582],"domain_scores_gemma":[0.9985443,0.00018845152,0.00014488526,0.0007049275,0.00025753654,0.00015990707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047569486,0.0002237682,0.00019843626,0.0003938772,0.0001358562,0.0008801617,0.0018738991,0.00013730874,0.000025320884],"category_scores_gemma":[0.00066888967,0.00018789168,0.00009606757,0.0010234794,0.00008874403,0.002058053,0.00033842388,0.0002845032,0.00006376521],"study_design_candidate":"design_other","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.0000055295704,0.00030393832,0.0001681791,0.00007109919,0.000015101879,0.0000060023995,0.000089297646,0.0000013757159,0.014222421,0.02370769,0.0022485913,0.95916075],"study_design_scores_gemma":[0.0009469102,0.00023245267,0.008540613,0.00003202913,0.000012912095,0.000058641766,0.000012523344,0.060776297,0.75693923,0.13853787,0.032868154,0.0010423269],"about_ca_topic_score_codex":0.000013840667,"about_ca_topic_score_gemma":0.000005048415,"teacher_disagreement_score":0.95811844,"about_ca_system_score_codex":0.000018582035,"about_ca_system_score_gemma":0.00008005189,"threshold_uncertainty_score":0.84874195},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000039547704,0.0003576947,0.3899457,0.00087365974,0.00043864,0.0006376593,0.00017702213,0.0007747112,0.60679096],"genre_scores_gemma":[0.00022775994,0.00006198426,0.2986758,0.0030609453,0.00066703936,0.0001053406,0.00023690639,0.00009443402,0.6968698],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99509114,0.000013182087,0.0009922857,0.001608999,0.0013465589,0.00094786135],"domain_scores_gemma":[0.9963164,0.00012736439,0.00070721336,0.00072725565,0.0017479946,0.000373784],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003504827,0.0009901287,0.0009501377,0.0006134382,0.00019225973,0.0028827589,0.0030262696,0.0004616172,0.00027640833],"category_scores_gemma":[0.000050447343,0.000911916,0.00032802759,0.00031981457,0.00017509302,0.0026469005,0.001128101,0.0006701132,0.0000983342],"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.000009787397,0.000058247573,0.000016382803,0.00009788474,0.00009637116,0.000034009216,0.000024097835,0.0000034377924,0.00001033705,0.024366098,0.9434592,0.03182414],"study_design_scores_gemma":[0.0004156771,0.00015372725,0.00008797241,0.00049004494,0.000046820325,0.000103259204,0.00000488406,0.025643967,0.0003678985,0.037544675,0.9337471,0.0013939386],"about_ca_topic_score_codex":0.006918718,"about_ca_topic_score_gemma":0.008915167,"teacher_disagreement_score":0.09126989,"about_ca_system_score_codex":0.0007295352,"about_ca_system_score_gemma":0.0026259436,"threshold_uncertainty_score":0.9996943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74314713,0.14932041,0.03462555,0.005251812,0.016727598,0.0024032507,0.000015702182,0.0016260836,0.04688247],"genre_scores_gemma":[0.6701832,0.00025308074,0.32920152,0.00024030576,0.00006108982,0.000017311086,0.0000014328011,0.0000071483246,0.000034943783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99384296,0.00018778241,0.0009861133,0.0015467815,0.0023206586,0.0011156991],"domain_scores_gemma":[0.9972339,0.0007436557,0.0006898947,0.00056977716,0.00052424887,0.00023847794],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0042659626,0.00045228767,0.00056128355,0.0013853862,0.00036501558,0.0005899451,0.0050426284,0.0001030332,0.0000017749869],"category_scores_gemma":[0.0032587291,0.00033245815,0.00008867179,0.010310511,0.003472054,0.027070493,0.0008852342,0.0005906692,0.000004100085],"study_design_candidate":"design_other","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.000047781752,0.000042331685,0.015802916,0.000067938905,0.000001968464,0.000020230495,0.0011487667,0.008130752,0.0066488674,0.08469696,0.000024524968,0.88336694],"study_design_scores_gemma":[0.0010139195,0.0007665249,0.0045790556,0.00090073165,0.000004298542,0.000086950335,0.0007271647,0.23246233,0.19649394,0.55940324,0.002322297,0.001239546],"about_ca_topic_score_codex":0.00009391279,"about_ca_topic_score_gemma":0.00028370754,"teacher_disagreement_score":0.8821274,"about_ca_system_score_codex":0.00044175587,"about_ca_system_score_gemma":0.00075339974,"threshold_uncertainty_score":0.99991274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097416756,0.0010159526,0.9867745,0.00033479926,0.0005587925,0.0002903427,0.0000053292256,0.0007889425,0.010133926],"genre_scores_gemma":[0.21573979,0.000018419252,0.78239775,0.0011648096,0.00040973848,0.000003854945,0.000002031086,0.00004761151,0.0002160163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540555,0.000034054294,0.0006613139,0.0018629552,0.0011793749,0.000856723],"domain_scores_gemma":[0.9972481,0.00045965172,0.00046679482,0.0012569863,0.00035454714,0.00021388002],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074081356,0.00072754285,0.0007187282,0.0009642018,0.00038074396,0.002674086,0.005072782,0.0003646317,0.0000130927465],"category_scores_gemma":[0.00013470183,0.0006996627,0.00016652966,0.0006414906,0.0014131775,0.0028716945,0.00281627,0.00089926936,0.000025169164],"study_design_candidate":"design_other","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.000002498434,0.000034108343,0.000024831881,0.0000313683,0.000007473414,0.000086597276,0.0002498651,0.0134248575,0.0013863164,0.0057294792,0.000013138629,0.97900945],"study_design_scores_gemma":[0.00016026881,0.00007549247,0.000039149872,0.00093682174,0.0000098604805,0.00012268459,6.32785e-8,0.8347253,0.008801056,0.15249412,0.0017208838,0.00091425754],"about_ca_topic_score_codex":0.000026015006,"about_ca_topic_score_gemma":0.00004878919,"teacher_disagreement_score":0.97809523,"about_ca_system_score_codex":0.00051350833,"about_ca_system_score_gemma":0.0007455129,"threshold_uncertainty_score":0.99954545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044646877,0.00009659139,0.9678402,0.005470823,0.000032324504,0.00019778493,8.7490804e-7,0.0017035891,0.024211332],"genre_scores_gemma":[0.24100688,0.0000010602747,0.7542742,0.0016050708,0.00006955242,0.00006182845,9.762686e-7,0.000010213669,0.0029702196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991348,0.0000045379948,0.0001707836,0.00029716102,0.00014683373,0.0002459081],"domain_scores_gemma":[0.9993597,0.00005273916,0.000057878602,0.00029697025,0.00017285187,0.000059828173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019738333,0.00010643109,0.00010473228,0.00004724065,0.00010670257,0.00089936296,0.000833119,0.000038448667,0.0000071722825],"category_scores_gemma":[0.00013090241,0.00008730006,0.000041345338,0.00024308989,0.00003710087,0.0020214764,0.00019928899,0.000060542498,0.000038614344],"study_design_candidate":"design_other","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.0000066237694,0.00011664083,0.000028675227,0.000057200617,0.000007068689,0.0000021395113,0.00046209383,0.000039876104,0.0008567329,0.04608039,0.013151895,0.9391907],"study_design_scores_gemma":[0.00029967152,0.00016443289,0.000022556816,0.000053250053,0.0000039384695,0.0000189594,0.0000061142873,0.65330887,0.18700318,0.045509838,0.11329577,0.00031339726],"about_ca_topic_score_codex":0.000002233414,"about_ca_topic_score_gemma":0.00000244586,"teacher_disagreement_score":0.9388773,"about_ca_system_score_codex":0.000021987167,"about_ca_system_score_gemma":0.0000920413,"threshold_uncertainty_score":0.8672578},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11839141,0.000388418,0.8746306,0.0013898069,0.00015545663,0.0001264074,5.545978e-7,0.000069806956,0.004847542],"genre_scores_gemma":[0.92282575,0.000017157548,0.076758556,0.00028486465,0.00007841101,3.0333334e-7,8.657691e-8,0.000015472833,0.000019392066],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99803257,0.0001990387,0.0007427238,0.00015087887,0.00056457793,0.0003102295],"domain_scores_gemma":[0.9980451,0.00065818225,0.00048549552,0.00039379124,0.00035568766,0.00006177843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00320817,0.00018254227,0.00029664044,0.000103228806,0.0002853189,0.00016024582,0.0019092478,0.000038573806,0.0000014053156],"category_scores_gemma":[0.00035265763,0.000096829026,0.00014067108,0.00061399594,0.00018371723,0.00068185525,0.00007469502,0.0004943409,0.000002240692],"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.00023023078,0.0013179563,0.0024987299,0.0007459685,0.0003775937,0.00009946122,0.087960064,0.02235835,0.0345608,0.12384848,0.0015305025,0.72447187],"study_design_scores_gemma":[0.0018798613,0.0020030239,0.0009641377,0.004405222,0.0001441194,0.0026048294,0.004055973,0.11624691,0.7669827,0.09095759,0.0085943295,0.0011613118],"about_ca_topic_score_codex":0.000004916596,"about_ca_topic_score_gemma":0.0000012177463,"teacher_disagreement_score":0.80443436,"about_ca_system_score_codex":0.00004282419,"about_ca_system_score_gemma":0.00013666695,"threshold_uncertainty_score":0.39485732},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031670965,0.00063236087,0.95004773,0.0037167221,0.00003159327,0.00029170295,0.0000125730385,0.00048161682,0.013114714],"genre_scores_gemma":[0.5545631,0.00025502843,0.44481555,0.000039243518,0.000004556295,0.00002005761,0.000077797034,0.0000137307625,0.00021091392],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969124,0.0013653768,0.0004252617,0.0006832338,0.00039623282,0.00021746164],"domain_scores_gemma":[0.99550915,0.00037133324,0.00061670534,0.0015142839,0.0018845747,0.000103984115],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023058879,0.00026915577,0.00032001256,0.00021769767,0.00014562072,0.0010762732,0.0013672471,0.00015329852,0.000002978986],"category_scores_gemma":[0.00031084087,0.0002645195,0.00007338636,0.00031582412,0.00031988078,0.00073979504,0.0012672703,0.00028791875,0.0000024818676],"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.000040482133,0.0014288016,0.0020761217,0.00074881816,0.00012573188,0.000021732225,0.007827245,0.00022710771,0.053134833,0.23774596,0.0009574598,0.6956657],"study_design_scores_gemma":[0.00030652506,0.0000021669723,0.0027593414,0.0033263804,0.000032007654,0.00003001729,0.000012337433,0.014970779,0.9248772,0.053131077,0.00015097039,0.00040115224],"about_ca_topic_score_codex":0.00007666252,"about_ca_topic_score_gemma":0.00005646116,"teacher_disagreement_score":0.8717424,"about_ca_system_score_codex":0.000044351986,"about_ca_system_score_gemma":0.00020259636,"threshold_uncertainty_score":0.9999807},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23362257,0.000081343605,0.75592816,0.00029506045,0.000021476788,0.00041371505,0.0000016818285,0.00008250907,0.009553514],"genre_scores_gemma":[0.96510535,0.0000075364924,0.034402434,0.00038429024,0.000001283139,0.000068292116,0.0000028332056,0.000003337775,0.00002461467],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921,0.000034761055,0.00035745534,0.000118807584,0.00010153658,0.00017744649],"domain_scores_gemma":[0.9994519,0.00009901068,0.00011527817,0.0002510335,0.000035215664,0.000047582907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003431883,0.000085960935,0.00015522246,0.00017733836,0.000015971942,0.0001346208,0.00039109544,0.000050398932,0.000011241249],"category_scores_gemma":[0.000049557624,0.00008019992,0.0000121428275,0.00027168848,0.00015388669,0.0019439448,0.0002585546,0.00008661021,0.00003496288],"study_design_candidate":"design_other","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.000024839463,0.00017679246,0.019937223,0.00031308035,0.0000075049884,0.0000029142113,0.0048777196,0.000031503117,0.0014863351,0.09595075,0.0005069022,0.8766844],"study_design_scores_gemma":[0.002591917,0.0004478175,0.1018648,0.00056711934,0.00000814146,0.00011084007,0.0024088563,0.35579085,0.051810324,0.47976857,0.0037669623,0.000863782],"about_ca_topic_score_codex":0.00015628574,"about_ca_topic_score_gemma":0.000022778515,"teacher_disagreement_score":0.87582064,"about_ca_system_score_codex":0.000049576924,"about_ca_system_score_gemma":0.00005100073,"threshold_uncertainty_score":0.32704577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050911218,0.00039920476,0.982385,0.00021900111,0.00065386354,0.00026562426,0.000003619989,0.00040197273,0.015620804],"genre_scores_gemma":[0.1067276,0.000014938339,0.89245135,0.00054652715,0.00010490334,0.000002878576,0.0000019747106,0.00003216054,0.00011764259],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605954,0.0000193972,0.0007045034,0.0013036473,0.0012860884,0.0006268485],"domain_scores_gemma":[0.996911,0.0003098308,0.0004481314,0.0015275239,0.0006447566,0.00015876883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016138277,0.00048395206,0.0005939845,0.001095774,0.00012371804,0.00060708844,0.0042296425,0.0003189556,0.0000068346967],"category_scores_gemma":[0.0002782074,0.00046201056,0.00013919394,0.00081245345,0.0008990215,0.0012322015,0.002301541,0.0007741852,0.000014651489],"study_design_candidate":"design_other","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.0000045759543,0.000041955867,0.000028143668,0.00009643426,0.000007408992,0.00007792239,0.0003631537,0.00077987433,0.00026175985,0.0062597776,0.000012600954,0.9920664],"study_design_scores_gemma":[0.00026975927,0.00026019508,0.00010209995,0.0015497701,0.0000092902455,0.00015603812,1.1664231e-7,0.32269728,0.063204296,0.6098904,0.0007650712,0.0010956676],"about_ca_topic_score_codex":0.000027213382,"about_ca_topic_score_gemma":0.00004991969,"teacher_disagreement_score":0.99097073,"about_ca_system_score_codex":0.00023474841,"about_ca_system_score_gemma":0.000621378,"threshold_uncertainty_score":0.99978316},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010052201,0.00014801607,0.8487944,0.0012640321,0.00005023437,0.00006447034,0.0000055150085,0.0015877602,0.14708035],"genre_scores_gemma":[0.58220035,0.000012848719,0.4154219,0.000527693,0.000014166797,0.000011228402,0.000002245478,0.000007374303,0.001802202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991629,0.000008862937,0.00014964094,0.0003011934,0.00016664501,0.00021075337],"domain_scores_gemma":[0.99935704,0.000053746888,0.00002963295,0.00043820066,0.000049610448,0.00007175078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000037298018,0.000109813336,0.000109138695,0.000041438532,0.000058322075,0.00040835587,0.00083558285,0.000037601367,0.00018394878],"category_scores_gemma":[0.000027536707,0.00008867779,0.000038049402,0.00031546009,0.000054495016,0.001417554,0.000070878756,0.000077022334,0.00017756244],"study_design_candidate":"design_other","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.0000015228838,0.00016999767,0.00009020579,0.000008646038,0.000013390191,0.000028663888,0.0004943342,8.359047e-7,0.0024878553,0.100209296,0.01629059,0.8802047],"study_design_scores_gemma":[0.000795385,0.00018542986,0.0006005909,0.00012141831,0.000011961152,0.000024521552,0.00002227668,0.36205006,0.16154003,0.25920147,0.21423864,0.0012081983],"about_ca_topic_score_codex":0.00003426746,"about_ca_topic_score_gemma":0.000020298448,"teacher_disagreement_score":0.8789965,"about_ca_system_score_codex":0.000020524705,"about_ca_system_score_gemma":0.000008858107,"threshold_uncertainty_score":0.3937785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26900506,0.00006177877,0.6423065,0.0006585402,0.00017736472,0.0012989223,0.000025183668,0.0007207728,0.085745856],"genre_scores_gemma":[0.47916394,0.0000023208586,0.52009445,0.00058147294,0.000003618651,0.0000672079,0.0000138237465,0.000010004503,0.00006315809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809134,0.0000346666,0.0007251611,0.00023478041,0.0004494243,0.00046464827],"domain_scores_gemma":[0.99871343,0.000051819734,0.0002406827,0.00074145134,0.00011935337,0.00013328157],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040922724,0.00021551474,0.0003017969,0.00023141268,0.00009119703,0.0014414511,0.0013729177,0.000076552606,0.00008966199],"category_scores_gemma":[0.000081743834,0.00019281807,0.000085708976,0.0009523033,0.00025610506,0.0044919774,0.00063757907,0.00019236213,0.00024842276],"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.000047114576,0.0030802349,0.024286611,0.0022902316,0.00016465127,0.000019308716,0.07575471,0.00083814596,0.00043686703,0.095138125,0.037687976,0.76025605],"study_design_scores_gemma":[0.0006076416,0.00023068419,0.003637585,0.00014802415,0.0000052012456,0.000026778493,0.00037946348,0.9745401,0.0015587901,0.016320815,0.002150701,0.00039422183],"about_ca_topic_score_codex":0.00010212435,"about_ca_topic_score_gemma":0.0000012156885,"teacher_disagreement_score":0.97370195,"about_ca_system_score_codex":0.00006570462,"about_ca_system_score_gemma":0.00012595278,"threshold_uncertainty_score":0.99959517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002418192,0.00015766057,0.9970883,0.00028730085,0.00021108249,0.00051260216,0.000012717434,0.00028163812,0.0012068585],"genre_scores_gemma":[0.20272823,0.000007476939,0.7961898,0.0008519679,0.000104050305,0.000021792031,0.000022313763,0.00002534804,0.000049052484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965516,0.000023149654,0.00060178066,0.0016892252,0.000642124,0.00049213384],"domain_scores_gemma":[0.997465,0.0004491751,0.000423251,0.0011427777,0.0003425273,0.00017726494],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007333055,0.0004417412,0.00074531895,0.0013039792,0.00025965617,0.0018910081,0.0019415778,0.00022704634,0.000004018878],"category_scores_gemma":[0.00013826023,0.00043624977,0.00015967926,0.0011042235,0.0006080211,0.0016051242,0.0005360551,0.0003538814,0.0000021100186],"study_design_candidate":"design_other","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.000011555098,0.000080879996,0.0004493409,0.000056689154,0.000052748765,0.000015126204,0.0007330781,0.00513526,0.00040286002,0.014158194,0.000041143918,0.9788631],"study_design_scores_gemma":[0.00018149534,0.00022356788,0.00079187966,0.00009033156,0.000059091304,0.00002036163,3.7254958e-7,0.6372434,0.0038260585,0.35662448,0.00036081398,0.00057817553],"about_ca_topic_score_codex":0.000046044843,"about_ca_topic_score_gemma":0.00020104033,"teacher_disagreement_score":0.97828496,"about_ca_system_score_codex":0.0001559408,"about_ca_system_score_gemma":0.00018778094,"threshold_uncertainty_score":0.9998089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010198118,0.000102574435,0.9495856,0.00076762197,0.00010732683,0.00034422526,0.00004740025,0.0009829855,0.04704241],"genre_scores_gemma":[0.5800063,0.0000030602478,0.4192042,0.00027681433,0.0000315419,0.000066197426,0.000004276452,0.000016485435,0.00039113767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982831,0.000027211241,0.00043480357,0.0003988393,0.0003456301,0.0005104109],"domain_scores_gemma":[0.9979738,0.0001550052,0.00013945247,0.0010347774,0.00039106447,0.00030588312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037764423,0.00022739959,0.00032700357,0.00038567596,0.00017208455,0.00044713466,0.0015233306,0.000093719245,0.00003458122],"category_scores_gemma":[0.0016597722,0.0002001638,0.00011866346,0.001424955,0.00010445784,0.0008760829,0.0007313419,0.00015892915,0.00059444085],"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.0000029343241,0.0002789553,0.000039473023,0.00003517861,0.000029707806,0.00003146027,0.0012447658,4.4092968e-7,0.0005101069,0.9870689,0.0033911983,0.0073668715],"study_design_scores_gemma":[0.0004271071,0.00032473722,0.00064861216,0.00019554967,0.000050074872,0.00011933872,0.00010268007,0.0114258425,0.08547495,0.89549124,0.0049022096,0.0008376318],"about_ca_topic_score_codex":0.00000914685,"about_ca_topic_score_gemma":0.0000013997338,"teacher_disagreement_score":0.57898647,"about_ca_system_score_codex":0.00012787517,"about_ca_system_score_gemma":0.00011782448,"threshold_uncertainty_score":0.8162443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018951448,0.00007477565,0.9888495,0.0022026245,0.000016272359,0.00021721915,7.313347e-7,0.00014563468,0.008303702],"genre_scores_gemma":[0.21811482,0.000009528065,0.7797373,0.000267589,0.000030014164,0.00002469002,0.0000027094586,0.0000059444023,0.0018074086],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940026,0.000008924641,0.00016347632,0.00018430434,0.000112588416,0.00013047039],"domain_scores_gemma":[0.99951696,0.00005603323,0.00006226465,0.0002770283,0.000062772415,0.000024925259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020853564,0.00006996324,0.0000913575,0.000072259034,0.000028260132,0.00018386183,0.00067307655,0.000026490936,0.000003509238],"category_scores_gemma":[0.000031516174,0.000047511134,0.00003361292,0.00028108503,0.000031988453,0.0010767295,0.000109162975,0.000040432933,0.0000026277605],"study_design_candidate":"design_other","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.0000063130037,0.00009119781,0.00039596795,0.000028198068,0.000004888961,1.4203219e-7,0.0004047533,0.0000577373,0.0034629037,0.006612403,0.007324121,0.9816114],"study_design_scores_gemma":[0.00075605465,0.00008440251,0.0064406656,0.000051665575,0.000010534212,0.000010072901,0.00006653883,0.37115213,0.6027865,0.010618276,0.007657544,0.00036563483],"about_ca_topic_score_codex":0.000025442932,"about_ca_topic_score_gemma":0.0000065685676,"teacher_disagreement_score":0.98124576,"about_ca_system_score_codex":0.000017356044,"about_ca_system_score_gemma":0.000041668864,"threshold_uncertainty_score":0.19374478},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022786084,0.0008047047,0.59893286,0.00080315705,0.00007320086,0.00016609943,0.000012181613,0.0005173609,0.39866763],"genre_scores_gemma":[0.010085647,0.00009911803,0.8181839,0.0004470082,0.000057491106,0.0000060291413,0.000037039317,0.000042471715,0.1710413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998261,0.00001587186,0.00041421445,0.0007920899,0.00030606397,0.00021075613],"domain_scores_gemma":[0.99814314,0.000047373444,0.00035303744,0.0010057347,0.00039365035,0.000057043428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003369338,0.00030084088,0.0005458398,0.0006755588,0.00005153327,0.0004200068,0.0007062527,0.000058198366,0.00003129114],"category_scores_gemma":[0.0000614987,0.00027059927,0.000115399016,0.00024007645,0.00024070496,0.0009655307,0.0006624717,0.00015924539,0.0000125923],"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.000009609343,0.00004936891,0.00005705397,0.00043061082,0.0007430996,0.00006715726,0.000116205934,0.000004409518,0.02153223,0.54911417,0.023058403,0.40481767],"study_design_scores_gemma":[0.0008129067,0.00029772386,0.0011269897,0.001680459,0.004160687,0.00025047394,0.0000076331435,0.057011668,0.14422065,0.38982671,0.3957657,0.0048384042],"about_ca_topic_score_codex":0.000064013315,"about_ca_topic_score_gemma":0.0000073456604,"teacher_disagreement_score":0.39997926,"about_ca_system_score_codex":0.000040259118,"about_ca_system_score_gemma":0.000057238503,"threshold_uncertainty_score":0.9999746},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001960843,0.039097656,0.28748104,0.0015148985,0.009294888,0.0019706136,0.00014097609,0.0047467067,0.65555716],"genre_scores_gemma":[0.31737444,0.004517569,0.21888499,0.002128798,0.008930172,0.0003977933,0.00021136581,0.0011733503,0.44638154],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9923048,0.000112938294,0.001753102,0.002317988,0.0017759732,0.0017351778],"domain_scores_gemma":[0.9929579,0.00018210111,0.0014302066,0.0037796067,0.0007649587,0.00088522414],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0010806558,0.0016925673,0.0015186799,0.0008452149,0.00060829194,0.0024759742,0.004019553,0.0011935309,0.0011057166],"category_scores_gemma":[0.0001231715,0.0016795865,0.0006955099,0.00035948277,0.00059247826,0.0031638818,0.0036408838,0.0014613705,0.01008703],"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.00007934541,0.00043811984,0.00030851792,0.0019925644,0.00052277907,0.0005138096,0.001066715,0.000005508607,0.0046067056,0.328331,0.015481918,0.64665306],"study_design_scores_gemma":[0.00043531228,0.00022475453,0.00016482048,0.004691775,0.00021860964,0.00023275377,0.000009244931,0.0011966525,0.006701502,0.01827481,0.9652798,0.002569945],"about_ca_topic_score_codex":0.00003213748,"about_ca_topic_score_gemma":0.0000032074456,"teacher_disagreement_score":0.9497979,"about_ca_system_score_codex":0.0003541372,"about_ca_system_score_gemma":0.0003107752,"threshold_uncertainty_score":0.9998074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000026026544,0.00011072312,0.98795867,0.00033041596,0.00090581767,0.0003958022,0.000005699742,0.00036618856,0.00992407],"genre_scores_gemma":[0.012143397,0.0000040991986,0.9844989,0.0027115303,0.00025866186,0.0000033221686,0.0000029883279,0.00004406635,0.00033303173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957675,0.000016511443,0.0006601574,0.0015033511,0.0013447367,0.00070779206],"domain_scores_gemma":[0.9970571,0.00039524568,0.00034761225,0.0015579086,0.00031019695,0.00033194438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008751422,0.0005794551,0.0005832555,0.0017268239,0.0000947707,0.0006649024,0.004074933,0.0002601326,0.000011666223],"category_scores_gemma":[0.0001359781,0.00055153196,0.00014321486,0.00096696545,0.0002637213,0.0007651278,0.0014215226,0.000629338,0.000022143562],"study_design_candidate":"design_other","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.000008756159,0.000037435926,0.0000036401282,0.00003850864,0.0000030082974,0.00009091901,0.00018686563,0.010620602,0.00014677495,0.0003754968,0.000039565057,0.98844844],"study_design_scores_gemma":[0.0002470186,0.000650537,0.000025564847,0.0018622844,0.000004697263,0.000040386512,6.787707e-8,0.9421575,0.02632077,0.026795764,0.0011821293,0.00071327825],"about_ca_topic_score_codex":0.000028749162,"about_ca_topic_score_gemma":0.00004521867,"teacher_disagreement_score":0.98773515,"about_ca_system_score_codex":0.00030534304,"about_ca_system_score_gemma":0.00072933274,"threshold_uncertainty_score":0.99969363},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018308102,0.00011725263,0.981123,0.001178814,0.00002342208,0.00021022481,0.0000018915289,0.0008937709,0.014620834],"genre_scores_gemma":[0.5062754,6.4873416e-7,0.49145293,0.0008091568,0.000057194775,0.000032519707,9.56584e-7,0.000008057206,0.0013631263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988317,0.000008634122,0.00021723687,0.0004186198,0.0001995127,0.0003243067],"domain_scores_gemma":[0.9994039,0.00005832858,0.000066327775,0.0002560702,0.00013077274,0.000084592764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015975663,0.00015752373,0.00015752423,0.00009349013,0.0001124004,0.00034486502,0.0008920156,0.00006294263,0.000044772452],"category_scores_gemma":[0.00004993551,0.000116421856,0.000069778216,0.00026151334,0.00008555992,0.0002766807,0.00022230315,0.00011370835,0.00003399714],"study_design_candidate":"design_other","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.0000066703674,0.00019873929,0.000041822987,0.00004803715,0.0000032188786,0.000029873863,0.00015564167,0.00014522386,0.0023938082,0.0006763111,0.01292763,0.98337305],"study_design_scores_gemma":[0.0001765331,0.0001353344,0.000017857474,0.00002434943,0.000002566453,0.000077105215,0.0000026191437,0.95038414,0.02970404,0.01665263,0.0026219436,0.00020088255],"about_ca_topic_score_codex":0.000001831655,"about_ca_topic_score_gemma":4.8504467e-7,"teacher_disagreement_score":0.9831721,"about_ca_system_score_codex":0.00001410453,"about_ca_system_score_gemma":0.000018286932,"threshold_uncertainty_score":0.47475454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003046811,0.00011467063,0.9712786,0.008223908,0.00012466528,0.00088687375,0.00007750391,0.0013064393,0.014940509],"genre_scores_gemma":[0.7581951,0.0000052746836,0.24019998,0.0006297187,0.00005916169,0.0003134819,0.00001578922,0.000027664495,0.0005538071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766,0.000047604623,0.00057185645,0.00053469307,0.00047718795,0.0007086848],"domain_scores_gemma":[0.9972801,0.0002389178,0.00017193095,0.0012678035,0.00058199227,0.0004592211],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003158094,0.00033606638,0.00044075624,0.00028245978,0.0002707603,0.0015983498,0.0016601543,0.00013228283,0.00005738399],"category_scores_gemma":[0.0010009645,0.00028359235,0.00018658095,0.0010477228,0.00020905105,0.0016003543,0.000830416,0.0002398866,0.00094306027],"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.0000020143848,0.00018210236,0.00006216637,0.000067383095,0.000051778832,0.000016710277,0.0006342143,0.0000028510167,0.003143974,0.97758555,0.012764614,0.0054866173],"study_design_scores_gemma":[0.0004864825,0.00024996148,0.0006330779,0.00033125532,0.00004717966,0.0000960879,0.00014112942,0.04243757,0.025866495,0.92349863,0.0052227806,0.0009893195],"about_ca_topic_score_codex":0.000020865184,"about_ca_topic_score_gemma":0.0000034101554,"teacher_disagreement_score":0.7551483,"about_ca_system_score_codex":0.000111325215,"about_ca_system_score_gemma":0.00011824738,"threshold_uncertainty_score":0.9999616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014133198,0.00052972545,0.99117535,0.00028198888,0.00086345075,0.0003139066,0.000008672826,0.00068417104,0.0061285854],"genre_scores_gemma":[0.015208079,0.000005281652,0.9828775,0.0010216822,0.00033078942,0.0000082839615,0.000009494595,0.000053328342,0.00048555082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563074,0.000028589535,0.00065274397,0.0017503513,0.0011454893,0.0007921098],"domain_scores_gemma":[0.99762964,0.00016245864,0.00021321984,0.0013798372,0.00044328487,0.00017158358],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00068508624,0.0006483132,0.00055727083,0.0009691417,0.0004893486,0.0025419563,0.003953918,0.00036112795,0.0000072595094],"category_scores_gemma":[0.000041912903,0.0006224618,0.00014751658,0.00090778334,0.0013428193,0.0024019799,0.0020865954,0.0008732799,0.000022591286],"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":[7.804233e-7,0.000031223037,0.000005245489,0.000020011516,0.0000044104254,0.00009120717,0.0002276363,0.056959465,0.0001412098,0.0014882181,0.00007132862,0.9409593],"study_design_scores_gemma":[0.000096546755,0.000070528506,0.0000059749323,0.00046767047,0.0000075846,0.00017566024,1.2768096e-7,0.9040256,0.010076204,0.08365212,0.0007374257,0.0006845299],"about_ca_topic_score_codex":0.00012543525,"about_ca_topic_score_gemma":0.00007613131,"teacher_disagreement_score":0.9402747,"about_ca_system_score_codex":0.00049879187,"about_ca_system_score_gemma":0.00083681464,"threshold_uncertainty_score":0.99962264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028961892,0.00025894892,0.9708333,0.0015521002,0.000042839878,0.0000852578,7.304452e-7,0.0002142569,0.024116386],"genre_scores_gemma":[0.88912314,0.00007623741,0.1087208,0.00017855772,0.000019932944,0.000005361631,9.4095995e-8,0.000004986268,0.0018708558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952924,0.000008143783,0.00013843116,0.00009999005,0.00012365215,0.00010052085],"domain_scores_gemma":[0.9995641,0.00008234008,0.000046954,0.00020673178,0.00007150113,0.000028390397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009421694,0.000053128817,0.000075410884,0.000017438393,0.000045484936,0.00023586984,0.00035453137,0.000019372486,0.000013068498],"category_scores_gemma":[0.00013839733,0.00003241445,0.000011415227,0.00007138524,0.00007655878,0.00043843978,0.00022151653,0.000038032325,0.000024915616],"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":[7.741249e-7,0.00006964026,0.00003088346,0.000054562017,0.000004883818,0.0000030214376,0.00017846454,1.9550631e-8,0.00068998046,0.43688914,0.0006906597,0.56138796],"study_design_scores_gemma":[0.00021052019,0.0001916003,0.0010651412,0.00012802357,0.000008821729,0.00007009046,0.000012194186,0.59926707,0.05823948,0.33412284,0.0063277474,0.00035648711],"about_ca_topic_score_codex":6.264674e-7,"about_ca_topic_score_gemma":1.9415197e-7,"teacher_disagreement_score":0.886227,"about_ca_system_score_codex":0.000002965569,"about_ca_system_score_gemma":0.0000055126075,"threshold_uncertainty_score":0.22744983},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101974976,0.00022703526,0.9929664,0.0002083306,0.0010305231,0.00042024953,0.0000047936282,0.00042671172,0.0046139564],"genre_scores_gemma":[0.14428742,0.0000033168506,0.85446185,0.0008313805,0.0002891854,0.00001613453,0.0000046863256,0.00003878507,0.00006723332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618644,0.00002374699,0.00042558915,0.0018916309,0.0008935647,0.00057900796],"domain_scores_gemma":[0.9976143,0.00014939006,0.00018455328,0.0013816028,0.0003222056,0.00034795227],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007156822,0.0005636849,0.0005203857,0.0007705759,0.00022034183,0.0014080876,0.0035577363,0.0002800498,0.0000023024588],"category_scores_gemma":[0.00008630121,0.0004909339,0.00006767282,0.00051891216,0.00088498986,0.0015378708,0.0023029656,0.00057908165,0.000011926955],"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.000017512595,0.00015675327,0.00006551301,0.000071557864,0.0000121719895,0.0000578151,0.0006572765,0.0013203683,0.00020926824,0.16395855,0.000053593885,0.8334196],"study_design_scores_gemma":[0.00015139798,0.00037438868,0.00009130042,0.00023951373,0.0000064442174,0.000094055074,2.8468595e-8,0.2760037,0.0013855563,0.7207277,0.00024490748,0.0006810555],"about_ca_topic_score_codex":0.000034900422,"about_ca_topic_score_gemma":0.000017847755,"teacher_disagreement_score":0.8327386,"about_ca_system_score_codex":0.00009926731,"about_ca_system_score_gemma":0.00033979194,"threshold_uncertainty_score":0.99975425},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29853982,0.010400509,0.30433238,0.05371158,0.0134363035,0.002251622,0.000012353111,0.010060299,0.30725515],"genre_scores_gemma":[0.9739251,0.000119773365,0.024622377,0.0005444296,0.000018437559,0.00003567191,0.0000015446801,0.000020137197,0.00071251875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811417,0.00006179765,0.00028213937,0.00047695983,0.00053550984,0.0005294182],"domain_scores_gemma":[0.99829143,0.00016577801,0.00016336713,0.001059108,0.0001854503,0.00013485539],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00057339174,0.00024020055,0.00017969233,0.000105776104,0.0004581185,0.0014906669,0.0029650293,0.00011796246,0.00000566558],"category_scores_gemma":[0.00010489887,0.00018296891,0.00011640765,0.000552517,0.0002535262,0.0013840282,0.0006481704,0.00029445122,0.000080610764],"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.000004137755,0.00006789559,0.0011268522,0.000007847444,0.000023690667,0.00003023991,0.00013107334,0.000004112773,0.000318388,0.84122646,0.0067300927,0.15032923],"study_design_scores_gemma":[0.00036444646,0.00012628229,0.0020063748,0.00006825753,0.000012341112,0.00006527115,0.000025731375,0.0025872642,0.015885727,0.9543865,0.023980435,0.00049136765],"about_ca_topic_score_codex":0.000038311784,"about_ca_topic_score_gemma":0.000062739084,"teacher_disagreement_score":0.6753853,"about_ca_system_score_codex":0.00008749311,"about_ca_system_score_gemma":0.00019793764,"threshold_uncertainty_score":0.9995459},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94157803,0.0012877393,0.05581182,0.0003788803,0.00017339134,0.00009181597,0.0000061337732,0.00008786296,0.00058430474],"genre_scores_gemma":[0.61311764,0.000021378688,0.386766,0.00005324947,0.000009245315,5.6582974e-7,4.4019373e-7,0.0000058486958,0.000025655274],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988774,0.000050135466,0.0005942392,0.000099853234,0.00025369052,0.00012467816],"domain_scores_gemma":[0.99867415,0.000041657877,0.0006724534,0.00017144895,0.00038569278,0.000054581444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051603257,0.00009135071,0.0002542928,0.0002527077,0.000009334585,0.00009311898,0.0005884967,0.000026396641,0.0000025348174],"category_scores_gemma":[0.000109108085,0.00007796209,0.000058973437,0.00032206118,0.00007532227,0.0015787507,0.00011583512,0.00009769374,0.0000018188263],"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.000024918825,0.00013346644,0.0014770867,0.00004740888,0.000010885523,0.000022384545,0.0004845588,0.000017520624,0.98664325,0.000019976462,0.0065396912,0.004578876],"study_design_scores_gemma":[0.0005089135,0.0002576252,0.0012484537,0.0002802377,0.0000053523595,0.00010684172,0.00006420122,0.00027008567,0.9953764,0.0016842687,0.00012829041,0.00006933474],"about_ca_topic_score_codex":0.000019372654,"about_ca_topic_score_gemma":0.0000012165033,"teacher_disagreement_score":0.33095416,"about_ca_system_score_codex":0.000055718614,"about_ca_system_score_gemma":0.00021574863,"threshold_uncertainty_score":0.31792018},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24418435,0.0007165019,0.24783131,0.0012866998,0.0058207987,0.0006201007,0.000005192188,0.00570742,0.4938276],"genre_scores_gemma":[0.97621137,0.000005566034,0.02325,0.00021596739,0.0000018088185,0.000016272666,0.0000022855063,0.0000084917265,0.00028825036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991888,0.00003594371,0.00013404568,0.00023963039,0.00019130894,0.00021026503],"domain_scores_gemma":[0.99934965,0.000039361534,0.000056055876,0.00041414003,0.00006987146,0.00007094438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018993832,0.00009737122,0.00009589948,0.00005467126,0.000069452704,0.00028901352,0.00047824212,0.000043135387,0.00001048681],"category_scores_gemma":[0.00011761023,0.00009787594,0.000027362432,0.0002746231,0.000041117768,0.00085370283,0.00008331036,0.00008419737,0.00012723493],"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":[7.067359e-7,0.00006169836,0.00040886892,0.000005119984,0.0000028109025,0.000010639047,0.00004137425,3.0222742e-7,0.00030490433,0.98787194,0.0075047556,0.0037868496],"study_design_scores_gemma":[0.00016722371,0.00005788418,0.00024057167,0.000015595224,0.0000016163726,0.000014721719,0.000002219751,0.00019999438,0.053848773,0.9341658,0.011153555,0.00013205757],"about_ca_topic_score_codex":0.0000033760336,"about_ca_topic_score_gemma":4.1950062e-7,"teacher_disagreement_score":0.732027,"about_ca_system_score_codex":0.00003158512,"about_ca_system_score_gemma":0.000048405054,"threshold_uncertainty_score":0.3991265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96862376,0.0058268737,0.0113965655,0.0014102926,0.0006223326,0.0003969453,0.00000972158,0.0013068694,0.010406653],"genre_scores_gemma":[0.9362711,0.0001824329,0.06329701,0.00016905382,0.0000030287342,0.00002244308,0.0000018077159,0.000013349212,0.0000398257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983341,0.000052765652,0.00038537983,0.0004853084,0.00039852722,0.0003439323],"domain_scores_gemma":[0.99874336,0.00010487118,0.00022490625,0.00057351135,0.00021938278,0.00013397328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043814362,0.00022562401,0.00028949548,0.00036977718,0.00011673728,0.00030144834,0.0011923613,0.0001023333,0.0000032957912],"category_scores_gemma":[0.00006221355,0.00021234322,0.00009616743,0.001099744,0.0004943603,0.0019139851,0.0003022397,0.0001613939,0.00000538894],"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.0000038984026,0.00010336326,0.0054554394,0.000047522542,0.000021367248,0.000012805513,0.00023872004,0.0000014578854,0.0035279058,0.9241778,0.00072548486,0.06568419],"study_design_scores_gemma":[0.00030558722,0.00018519296,0.0013376087,0.000101450445,0.000011231579,0.000036865047,0.000019019108,0.00093430845,0.0635356,0.93270713,0.00054552057,0.00028046456],"about_ca_topic_score_codex":0.00005857368,"about_ca_topic_score_gemma":0.000017316179,"teacher_disagreement_score":0.06540373,"about_ca_system_score_codex":0.000020845155,"about_ca_system_score_gemma":0.00009308958,"threshold_uncertainty_score":0.86591053},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007559393,0.00044730838,0.98608667,0.0013779674,0.000092416565,0.0008947184,0.0000046766227,0.00078294124,0.0027539127],"genre_scores_gemma":[0.073143765,0.000011579571,0.92523885,0.00032513606,0.000043415097,0.00049097923,0.0000026338937,0.000038406997,0.000705229],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985295,0.000023518438,0.00035874397,0.0004733328,0.00022991914,0.00038500017],"domain_scores_gemma":[0.9986578,0.00023863546,0.00021407724,0.00056660204,0.00020825505,0.000114580755],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003038003,0.0002427442,0.00033009765,0.00009364813,0.00013160193,0.0011483794,0.0007773069,0.00012862714,0.000031622778],"category_scores_gemma":[0.00033799434,0.00020976053,0.00006726648,0.00021923406,0.0000815965,0.0013413911,0.00038480374,0.00016518073,0.00011690484],"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.000019038021,0.00082417286,0.00043810913,0.0023956713,0.00015843955,0.000028107197,0.009397068,0.000035199773,0.029150758,0.13886063,0.030814087,0.7878787],"study_design_scores_gemma":[0.000295642,0.00027827828,0.0000374109,0.00068478356,0.00001690213,0.00006584323,0.00006356534,0.15045846,0.014174475,0.8295793,0.0038043875,0.0005409635],"about_ca_topic_score_codex":0.000016270096,"about_ca_topic_score_gemma":9.930749e-7,"teacher_disagreement_score":0.7873378,"about_ca_system_score_codex":0.000015537375,"about_ca_system_score_gemma":0.000044835826,"threshold_uncertainty_score":0.99988854},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40720078,0.00008908363,0.5921039,0.00010501644,0.00008149798,0.000108968234,8.831957e-7,0.00009793911,0.00021189991],"genre_scores_gemma":[0.8089135,0.000012345538,0.19094336,0.00003230052,0.00007426767,0.00000137329,0.0000020424222,0.0000087034505,0.000012089402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797434,0.00014780016,0.0008843451,0.0003106223,0.00033434067,0.00034854817],"domain_scores_gemma":[0.998395,0.00029393737,0.00064998603,0.00017617409,0.0003208756,0.00016401881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010382022,0.00021423715,0.0004418008,0.00025109795,0.0001932626,0.000610378,0.0004651787,0.000058576825,0.0000014288877],"category_scores_gemma":[0.00013223603,0.00019565552,0.000074390926,0.0007599238,0.000047654277,0.0009857361,0.00034139183,0.00032434677,0.0000024098683],"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.00015281374,0.0024963324,0.10986905,0.00006880466,0.00017168686,0.12098155,0.008240925,0.06871217,0.00012004403,0.00032285985,0.0013826482,0.6874811],"study_design_scores_gemma":[0.002230425,0.0007230316,0.0079754675,0.00020215752,0.00002293189,0.08068379,0.0019949207,0.9024494,0.000010893653,0.0032790808,0.00004033453,0.00038756858],"about_ca_topic_score_codex":0.000121186196,"about_ca_topic_score_gemma":0.000008600934,"teacher_disagreement_score":0.83373725,"about_ca_system_score_codex":0.000083766994,"about_ca_system_score_gemma":0.00009791791,"threshold_uncertainty_score":0.7978601},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13684826,0.000182676,0.57355326,0.0009852956,0.00007268128,0.00032424097,0.000014293966,0.0003284853,0.28769082],"genre_scores_gemma":[0.7130695,0.0000011304389,0.28657487,0.00023598892,0.0000043008654,0.000003948172,4.7439505e-7,0.000008214314,0.000101551836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907863,0.000028049764,0.0002947808,0.00021086425,0.00017050223,0.00021714362],"domain_scores_gemma":[0.9987783,0.00005712826,0.000107774584,0.0006113199,0.00016600611,0.00027947474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029558595,0.000098363955,0.00020752139,0.00014930988,0.000025459509,0.00004427394,0.00086779497,0.000059914535,0.00041489676],"category_scores_gemma":[0.00019313012,0.000087957094,0.000042798183,0.0001684502,0.0001558124,0.0001979165,0.000069266935,0.0000618749,0.00027003544],"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.000008953817,0.00048073992,0.00014325272,0.00053097354,0.000022927105,0.00010027751,0.0027729226,6.8323186e-7,0.011078071,0.9146758,0.008401388,0.061784018],"study_design_scores_gemma":[0.00023002963,0.0005853881,0.0033784597,0.0006773578,0.00002641137,0.000049819868,0.00018654061,0.0061305906,0.09752761,0.88447446,0.006167795,0.0005655527],"about_ca_topic_score_codex":0.00092243165,"about_ca_topic_score_gemma":0.000083639185,"teacher_disagreement_score":0.5762213,"about_ca_system_score_codex":0.000018415896,"about_ca_system_score_gemma":0.0001351041,"threshold_uncertainty_score":0.45428285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08279225,0.000049900347,0.9152702,0.00024778844,0.00029057614,0.00010679046,0.000005524977,0.00029547347,0.0009415017],"genre_scores_gemma":[0.5542658,0.0000026699229,0.44551763,0.00012306114,0.000015970141,0.000002913285,0.000003537949,0.000008443366,0.00005998273],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986071,0.00011606457,0.00034645988,0.00035717853,0.0002857427,0.000287482],"domain_scores_gemma":[0.9991994,0.00004960294,0.00016192369,0.00033096317,0.00016911067,0.00008903491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023599304,0.00016293478,0.00029033658,0.000054577595,0.00012349627,0.0005316615,0.000503997,0.000090274436,0.00003526713],"category_scores_gemma":[0.00021586273,0.00014355843,0.00006586893,0.00058007264,0.00028279718,0.0009951191,0.00013403039,0.00011293325,0.00000832593],"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.000028453276,0.0008038733,0.00070012483,0.00007727966,0.000038695096,0.00005098521,0.0011626285,0.000011810673,0.8108838,0.057832245,0.00012786119,0.12828222],"study_design_scores_gemma":[0.0003897677,0.0003210335,0.0011534451,0.000055824414,0.000013950902,0.00010808584,0.00002829452,0.103776254,0.85288036,0.03083386,0.009876987,0.00056211825],"about_ca_topic_score_codex":0.000018606052,"about_ca_topic_score_gemma":5.9023318e-8,"teacher_disagreement_score":0.47147354,"about_ca_system_score_codex":0.000046569618,"about_ca_system_score_gemma":0.00015585528,"threshold_uncertainty_score":0.5854143},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010026801,0.00009448721,0.9171972,0.0002925749,0.00003402834,0.00014187788,0.0000024954372,0.00017576253,0.07203475],"genre_scores_gemma":[0.7099964,0.000007992267,0.28978768,0.00006193441,0.0000044175185,0.00001609052,2.5031252e-7,0.0000060104767,0.00011924696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994852,0.000018868139,0.00018303722,0.000101911915,0.000114316834,0.000096649266],"domain_scores_gemma":[0.9993078,0.00012025579,0.000105974286,0.00037980985,0.000058257647,0.000027870901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025195823,0.000072809446,0.00012533797,0.000032667478,0.000042913573,0.000093756695,0.00045768864,0.000020353822,0.000007170726],"category_scores_gemma":[0.00016439628,0.000043433058,0.000036140005,0.00014312203,0.0002779184,0.00038061236,0.00023522279,0.000056977282,0.0000075329094],"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.000002355702,0.000048321846,0.000044608878,0.00007864912,0.000013780262,0.0000011726394,0.0091737965,1.174845e-7,0.000053521737,0.98861915,0.00019907534,0.0017654774],"study_design_scores_gemma":[0.0001772489,0.000031052485,0.00015388506,0.00011176377,0.000021545027,0.000015058169,0.00022474244,0.01315447,0.010376333,0.97549456,0.00013085596,0.00010847715],"about_ca_topic_score_codex":0.000006820601,"about_ca_topic_score_gemma":0.0000010492871,"teacher_disagreement_score":0.6999696,"about_ca_system_score_codex":0.000003896392,"about_ca_system_score_gemma":0.000012282322,"threshold_uncertainty_score":0.17711487},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034482077,0.0000662654,0.92458016,0.000586533,0.00006176448,0.00016761149,0.000001656355,0.00080339826,0.03925054],"genre_scores_gemma":[0.8696446,0.0000054681223,0.1300321,0.00019663732,0.000013844819,0.000005477725,0.0000063029256,0.000007744691,0.00008781603],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989941,0.000011337914,0.00025032304,0.00015879341,0.00032200498,0.0002634415],"domain_scores_gemma":[0.9994708,0.00005119615,0.00007307492,0.00020839213,0.00013246089,0.00006411674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043724032,0.00012500866,0.00011763647,0.00013581557,0.00011175315,0.0004507775,0.00035674163,0.00004180433,0.0000066225425],"category_scores_gemma":[0.000008784624,0.00010303937,0.000028148757,0.00033674715,0.00006378104,0.004021269,0.000018761302,0.000098618126,0.00001699627],"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.00013671782,0.0004333168,0.00043725703,0.00025760118,0.000046647558,0.00004659724,0.013809369,0.0002504273,0.008168141,0.47029796,0.00052281335,0.5055931],"study_design_scores_gemma":[0.0028811756,0.0013125266,0.008513136,0.00043275554,0.000039143742,0.0003944178,0.0015284342,0.029012777,0.8526495,0.06921689,0.03238983,0.0016294208],"about_ca_topic_score_codex":0.000020076792,"about_ca_topic_score_gemma":0.000043736625,"teacher_disagreement_score":0.84448135,"about_ca_system_score_codex":0.00004191389,"about_ca_system_score_gemma":0.000033493216,"threshold_uncertainty_score":0.43468577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008929366,0.000012735054,0.9760572,0.0002712478,0.000007761962,0.00048817592,0.0000031074396,0.00044901937,0.013781411],"genre_scores_gemma":[0.5045495,5.878282e-7,0.49501553,0.00035780712,0.000004886343,0.000035079593,0.000007424113,0.00001587273,0.000013307556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986965,0.000015781256,0.00026841447,0.0004178029,0.00026255392,0.00033891914],"domain_scores_gemma":[0.99891126,0.000060256465,0.00014211163,0.00073267095,0.000041141633,0.00011255855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000355812,0.00020058257,0.00022570146,0.00012297792,0.00010186049,0.0003132408,0.00071204663,0.000066610315,0.0000010720053],"category_scores_gemma":[0.000028925679,0.00016485897,0.000018833403,0.00052780594,0.000035370045,0.00043185207,0.00008756692,0.00014837796,0.000017646355],"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.00000603145,0.00032687993,0.000120310746,0.00012326823,0.00001011634,0.0000086801465,0.007515716,0.0005009222,0.0018777446,0.98564,0.00043262166,0.0034377314],"study_design_scores_gemma":[0.0011861281,0.00034906997,0.0005878198,0.00051372417,0.000027080452,0.00008372349,0.003534551,0.18345448,0.031472173,0.7644255,0.012515802,0.0018499003],"about_ca_topic_score_codex":0.000004827218,"about_ca_topic_score_gemma":0.000029888211,"teacher_disagreement_score":0.49562013,"about_ca_system_score_codex":0.000037931593,"about_ca_system_score_gemma":0.000044403427,"threshold_uncertainty_score":0.67227536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035092179,0.00008118839,0.9805065,0.00032775186,0.0002121918,0.00028756636,0.000004501646,0.0017866452,0.013284445],"genre_scores_gemma":[0.2865224,0.0000015105221,0.71216846,0.00059990893,0.0001967667,0.0000031658765,0.000005440045,0.000022922737,0.00047945607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981313,0.000044321598,0.00036508258,0.0006375267,0.00022783154,0.0005939379],"domain_scores_gemma":[0.99871534,0.00034794875,0.00012871469,0.00047281958,0.00021627378,0.00011887345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045319056,0.00023869275,0.00027559948,0.00011792088,0.0004117708,0.0007108615,0.00097100344,0.0000728005,0.0000035279108],"category_scores_gemma":[0.000072043804,0.00025352748,0.0001319705,0.00044177036,0.000085274856,0.0006515121,0.00039318902,0.00017724327,0.00006307564],"study_design_candidate":"design_other","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":[9.871791e-7,0.000039413062,0.000010314628,0.0000124689295,0.000010856237,0.000013454514,0.0004032385,0.00012785174,0.000065042215,0.0014205362,0.0013652022,0.99653065],"study_design_scores_gemma":[0.00024791693,0.00007616133,0.00013770392,0.00012313531,0.0000057077086,0.000067149085,0.000019652982,0.9819975,0.004630409,0.0050562904,0.0072999583,0.00033844434],"about_ca_topic_score_codex":0.00000999049,"about_ca_topic_score_gemma":3.791785e-7,"teacher_disagreement_score":0.9961922,"about_ca_system_score_codex":0.00006314634,"about_ca_system_score_gemma":0.00007218698,"threshold_uncertainty_score":0.9999917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01955193,0.000068155714,0.9464372,0.00020515356,0.0000347907,0.00017192098,0.0000021997223,0.00018075865,0.0333479],"genre_scores_gemma":[0.8671532,0.0000033300762,0.13268556,0.00008513856,0.000015555783,0.0000058658284,9.808145e-7,0.000005480175,0.000044851142],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974321,0.00003068785,0.00033276912,0.00057267334,0.001258006,0.00037375526],"domain_scores_gemma":[0.9981742,0.00015158535,0.0001774193,0.00075788854,0.0006584185,0.00008051548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017154517,0.000121725556,0.00019436059,0.0005167612,0.00020246844,0.00030120532,0.0016603456,0.00004456933,0.0000016388343],"category_scores_gemma":[0.00033972756,0.00011415468,0.00003160452,0.0019733794,0.0008713675,0.0007429739,0.00026674237,0.0001710978,0.0000049644823],"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.0000044033477,0.00009372975,0.000018014067,0.000028198823,0.000001108062,0.0000012368879,0.00028252113,0.00021478321,0.91594195,0.03454992,0.000099482786,0.048764624],"study_design_scores_gemma":[0.00008231028,0.00007864884,0.0009783651,0.00008822444,0.0000014951693,0.0000033699732,0.000013392679,0.03517188,0.8323517,0.13106076,0.00003773264,0.00013213043],"about_ca_topic_score_codex":0.000004684817,"about_ca_topic_score_gemma":6.0212534e-7,"teacher_disagreement_score":0.8476013,"about_ca_system_score_codex":0.000052760344,"about_ca_system_score_gemma":0.00032225443,"threshold_uncertainty_score":0.4655093},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039913315,0.000045635552,0.89972097,0.00014756327,0.000029337392,0.00033920645,0.000007844941,0.00035860512,0.059437502],"genre_scores_gemma":[0.40874648,0.0000049009013,0.5911287,0.000024393285,0.000011498973,0.000038964605,0.0000014602049,0.000013180626,0.00003045226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986517,0.000009773127,0.00052972214,0.00032644442,0.00019323574,0.00028916885],"domain_scores_gemma":[0.99889517,0.000066313274,0.00025753558,0.0006542827,0.000060969956,0.00006570124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003173054,0.00019234385,0.00030199296,0.0002764996,0.000049295253,0.0002047881,0.000549631,0.00007002309,0.000008822605],"category_scores_gemma":[0.000034341243,0.00017700982,0.00008103629,0.00064497656,0.00015556697,0.0010607075,0.00025558547,0.00013769441,0.000015355256],"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.00001602359,0.00043545134,0.000057222423,0.0008199188,0.000044695327,0.00019824569,0.0049522244,0.00004635677,0.05292772,0.6550187,0.00044810644,0.28503537],"study_design_scores_gemma":[0.0007635754,0.00008605044,0.00002080264,0.0003977818,0.000030587125,0.0016833728,0.0009048255,0.14776208,0.30782837,0.5395028,0.00023809804,0.0007816585],"about_ca_topic_score_codex":0.00001240162,"about_ca_topic_score_gemma":0.000018085539,"teacher_disagreement_score":0.36883315,"about_ca_system_score_codex":0.00003473924,"about_ca_system_score_gemma":0.000034045952,"threshold_uncertainty_score":0.72182506},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010808536,0.0004556761,0.9188394,0.00033589161,0.002986564,0.002457825,0.0009145276,0.0008445483,0.07305751],"genre_scores_gemma":[0.001596157,0.00016616199,0.8498577,0.00026192033,0.00031675055,0.00060699205,0.00037458193,0.00033216347,0.14648756],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995332,0.000037113135,0.0014171903,0.0011684241,0.0010643012,0.0009809629],"domain_scores_gemma":[0.99485296,0.0002716107,0.001380113,0.0021804667,0.00090795284,0.0004068898],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005019386,0.001169487,0.0017900409,0.0003775867,0.00025256345,0.0029210914,0.003125785,0.0005294843,0.00002054994],"category_scores_gemma":[0.00078411103,0.0009777225,0.00054650614,0.00064326543,0.00063468184,0.0019733482,0.0018789285,0.0006126135,0.00022301471],"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.000009931739,0.00028733257,0.0000030705714,0.005455931,0.00019396994,0.0000054234256,0.0044879992,8.9255764e-7,0.000098551885,0.13349423,0.846908,0.009054678],"study_design_scores_gemma":[0.00046021826,0.00070657145,0.000006163346,0.003969709,0.00021976397,0.00006340106,0.00045916467,0.088235356,0.0014840781,0.8260158,0.07616512,0.0022147044],"about_ca_topic_score_codex":0.000011942918,"about_ca_topic_score_gemma":0.000003308608,"teacher_disagreement_score":0.7707429,"about_ca_system_score_codex":0.0000874746,"about_ca_system_score_gemma":0.0003215867,"threshold_uncertainty_score":0.99926734},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106370464,0.0057340437,0.77285606,0.09875428,0.00007453407,0.002183239,0.00007757358,0.00039043787,0.013559366],"genre_scores_gemma":[0.9965285,0.00013624459,0.0020757166,0.0004442493,0.00007130699,0.0001475935,0.0000022904762,0.000006899734,0.0005872219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994297,0.000035993373,0.00013910825,0.00017692643,0.000116225,0.00010202371],"domain_scores_gemma":[0.998887,0.0005306204,0.0001271676,0.00038445383,0.000051491013,0.00001925125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022837798,0.00008759797,0.0000968942,0.000022534152,0.0002588776,0.0002455073,0.0005213456,0.000022124603,0.0000016353479],"category_scores_gemma":[0.00004674711,0.000040642804,0.000024591654,0.00024980537,0.0002574662,0.00015615941,0.00014021287,0.0000914802,0.000006406797],"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.000010932322,0.000032062762,0.000033348744,0.000014666874,0.0000053833187,1.5179833e-7,0.00016678766,7.718166e-7,0.00039080615,0.98964727,0.0024415837,0.0072562196],"study_design_scores_gemma":[0.001982655,0.00020830469,0.017469192,0.00021208367,0.00014882586,0.00006392283,0.0002388105,0.08882574,0.029174829,0.5411942,0.3195541,0.00092731474],"about_ca_topic_score_codex":0.000019525281,"about_ca_topic_score_gemma":0.0000057166867,"teacher_disagreement_score":0.890158,"about_ca_system_score_codex":0.0000040622567,"about_ca_system_score_gemma":0.000014263928,"threshold_uncertainty_score":0.23674326},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15022321,0.00007353654,0.84687066,0.0012944688,0.00070996716,0.00006235792,0.0000038700737,0.000013397244,0.0007485315],"genre_scores_gemma":[0.8191519,0.0000031584912,0.18074375,0.000035450434,0.000043598193,6.802622e-7,1.8459056e-7,0.0000023589803,0.000018949198],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99789006,0.000030516589,0.00068368,0.00013048854,0.0011604757,0.0001047835],"domain_scores_gemma":[0.9956515,0.000053202817,0.0011159325,0.00030741768,0.002843344,0.00002864827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063069584,0.00007937564,0.00016542837,0.0003136745,0.000059572136,0.00024458737,0.003922811,0.000016977878,0.0000015635474],"category_scores_gemma":[0.00013796175,0.00005231437,0.000114499555,0.0005198226,0.0008032223,0.0023969077,0.00058233144,0.00007956548,4.6818934e-7],"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.000063913525,0.0012179123,0.011198625,0.000116456096,0.00016672962,0.000016453621,0.0022127314,0.006343548,0.36675274,0.36459962,0.0017004207,0.24561085],"study_design_scores_gemma":[0.0005630734,0.00029277243,0.034010388,0.0011594897,0.000015824242,0.00025014556,0.000021578371,0.08701527,0.7987954,0.07712934,0.00054265355,0.00020403795],"about_ca_topic_score_codex":0.00003720118,"about_ca_topic_score_gemma":0.000003046769,"teacher_disagreement_score":0.6689286,"about_ca_system_score_codex":0.00005152686,"about_ca_system_score_gemma":0.0006086025,"threshold_uncertainty_score":0.7289624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035056233,0.000400082,0.9632148,0.0004515492,0.0000022175652,0.000050875067,5.3842655e-7,0.000006456107,0.0008172374],"genre_scores_gemma":[0.9231384,0.00006299026,0.07672029,0.000030744406,0.000006539037,0.0000061413234,6.504513e-8,0.0000017206428,0.000033146123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993246,0.00003508669,0.00036741263,0.000071217175,0.00014664745,0.000055032662],"domain_scores_gemma":[0.9991073,0.000249386,0.00031368827,0.00018038818,0.000099486686,0.000049750844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058881857,0.000051482893,0.00027846405,0.00015747956,0.000048194142,0.00012618437,0.00023932448,0.000018136192,0.000006884865],"category_scores_gemma":[0.00012996487,0.000027212582,0.000111570815,0.0005862455,0.00015697433,0.00015675498,0.000056007764,0.00005563137,5.291494e-7],"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.0000014086687,0.000114413575,0.0008071187,0.00003090678,0.00024249441,2.3332153e-7,0.00009486423,0.0000012115629,0.00023799352,0.98712105,0.000036248526,0.01131208],"study_design_scores_gemma":[0.00029719961,0.000025446143,0.0010698881,0.00002482471,0.0006500542,0.000047030724,0.00007309052,0.0041689323,0.00650669,0.9866859,0.0003706863,0.00008030745],"about_ca_topic_score_codex":6.486476e-7,"about_ca_topic_score_gemma":1.6372293e-7,"teacher_disagreement_score":0.88808215,"about_ca_system_score_codex":0.0000032956154,"about_ca_system_score_gemma":0.000012575792,"threshold_uncertainty_score":0.12167987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001528799,0.0005558345,0.9976352,0.00013440796,0.0007831445,0.00024811004,0.000004788499,0.0004655277,0.00002013291],"genre_scores_gemma":[0.025133407,0.000032368047,0.9746008,0.000059075726,0.0000816878,0.00004350612,0.000008171767,0.000027526215,0.000013495974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982323,0.000050922066,0.0005514472,0.00046352253,0.00029208357,0.00040970693],"domain_scores_gemma":[0.9987467,0.00039828554,0.00013243595,0.00046631682,0.00011693897,0.00013933762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010244676,0.00021311874,0.0003527025,0.0012775987,0.000028114675,0.00012907373,0.0011274077,0.0001718778,0.0000035229023],"category_scores_gemma":[0.00035145416,0.00021333911,0.00013377967,0.0038605244,0.000044806657,0.00044692153,0.0004508193,0.000139315,0.0000020925074],"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":[9.516661e-7,0.00015629735,0.0000033440679,0.0001587807,0.000015031636,0.0000046146934,0.00009457729,0.00006264829,0.039590277,0.011153816,0.00021312617,0.9485465],"study_design_scores_gemma":[0.0002569999,0.00018124796,0.000012434459,0.00011397277,0.0000051825587,0.0000116392075,8.7355846e-7,0.9689055,0.019619565,0.0044389875,0.00623215,0.00022143361],"about_ca_topic_score_codex":0.0000031541213,"about_ca_topic_score_gemma":6.91581e-8,"teacher_disagreement_score":0.96884286,"about_ca_system_score_codex":0.0000717721,"about_ca_system_score_gemma":0.000015883505,"threshold_uncertainty_score":0.86997163},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2047607,0.00018035075,0.7868379,0.00042160417,0.0037681013,0.00010307487,0.0000016909933,0.0001506971,0.0037759151],"genre_scores_gemma":[0.97209775,0.00008458432,0.02722057,0.000042772757,0.00023799772,7.3686004e-7,4.898422e-7,0.000010978223,0.00030412563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988432,0.000087864,0.0004820723,0.00009628303,0.00036289336,0.00012767375],"domain_scores_gemma":[0.9985344,0.00006446752,0.00065563427,0.00024801458,0.00040687702,0.000090630354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048539747,0.000110745255,0.00027596898,0.00021217689,0.00006080108,0.00009434373,0.0008625199,0.000055861376,0.000010621731],"category_scores_gemma":[0.0001938655,0.00009615827,0.00011712949,0.0004350566,0.00011434222,0.0029454816,0.00009824306,0.00013991541,0.0000015242404],"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.00021349717,0.00010018114,0.00018910007,0.000019270556,0.000030588904,0.00004574695,0.00064115337,4.014562e-7,0.07129585,0.9182438,0.00044599033,0.008774377],"study_design_scores_gemma":[0.00038049687,0.00082412804,0.0005636515,0.00009009508,0.000008563912,0.00051087566,0.000010700573,0.000007975325,0.17723954,0.8175728,0.0026764418,0.00011477358],"about_ca_topic_score_codex":7.2905635e-7,"about_ca_topic_score_gemma":2.4038767e-8,"teacher_disagreement_score":0.767337,"about_ca_system_score_codex":0.000020907064,"about_ca_system_score_gemma":0.00026523563,"threshold_uncertainty_score":0.39212206},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014142071,0.000017152099,0.94537246,0.00032670394,0.00004339336,0.00014740584,5.3761767e-7,0.0001528763,0.039797407],"genre_scores_gemma":[0.9782513,0.000003604399,0.021491105,0.00013522495,0.00003647898,0.00003516608,3.8889652e-7,0.000006811245,0.000039922703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999462,0.000014541833,0.00008584067,0.0001526075,0.00016128847,0.00012369246],"domain_scores_gemma":[0.9991304,0.00018867143,0.00008997169,0.00050740805,0.00006670999,0.000016799306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016583847,0.000076437565,0.00007420819,0.00000935161,0.00013700667,0.00019053755,0.00057714654,0.000013836123,1.9353256e-7],"category_scores_gemma":[0.0000071512945,0.000038843595,0.00002269905,0.00021609651,0.00017489336,0.00019228795,0.00012391343,0.00007709035,0.00000614084],"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.000004388057,0.000018752215,0.000013253884,0.0000065359022,0.000008705101,9.830202e-8,0.000310659,0.000053525884,0.003853285,0.42182767,0.00014032656,0.5737628],"study_design_scores_gemma":[0.00030439394,0.00017422347,0.00035416457,0.00006202359,0.000017597638,0.0000126672385,0.00016936954,0.03972447,0.29576215,0.6578073,0.0052965456,0.00031510068],"about_ca_topic_score_codex":0.0000034223401,"about_ca_topic_score_gemma":0.0000022018373,"teacher_disagreement_score":0.96410924,"about_ca_system_score_codex":0.000007250789,"about_ca_system_score_gemma":0.000028082837,"threshold_uncertainty_score":0.1837358},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010191693,0.00044575197,0.9977084,0.00025940916,0.000015822872,0.00020300057,0.00004544557,0.00010446472,0.00019852968],"genre_scores_gemma":[0.7727058,0.000034901983,0.22644454,0.00017423838,0.00009967078,0.00042303372,0.000048349983,0.000005675739,0.00006377119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999248,0.000010482188,0.00018554747,0.0002708974,0.00010956932,0.0001755053],"domain_scores_gemma":[0.999253,0.00011402754,0.00012566152,0.0003271212,0.000086712425,0.00009348179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019289654,0.00009238255,0.00016209192,0.00029287476,0.00011899301,0.00029109587,0.00026864812,0.000033605447,0.0000144456035],"category_scores_gemma":[0.000010946965,0.00008238523,0.00009948726,0.0009771571,0.000021383084,0.0006967016,0.00009013666,0.00004336163,0.000015040189],"study_design_candidate":"design_other","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":[2.0465188e-7,0.00008645954,0.0027776957,0.0000027986007,0.000073899326,8.059948e-8,0.000032685544,3.2051784e-7,0.0005736597,0.00028855415,0.00012673817,0.9960369],"study_design_scores_gemma":[0.0005163247,0.000054943644,0.09331124,0.000019078547,0.0011830351,0.000009203433,0.00009321655,0.79097754,0.059296615,0.015941016,0.037819818,0.0007779459],"about_ca_topic_score_codex":0.00013788993,"about_ca_topic_score_gemma":0.000009445469,"teacher_disagreement_score":0.995259,"about_ca_system_score_codex":0.000020676143,"about_ca_system_score_gemma":0.000006743851,"threshold_uncertainty_score":0.33595723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098179905,0.00030782135,0.9643773,0.02377514,0.000055859986,0.0002529876,0.0000019166298,0.0006378048,0.0007731983],"genre_scores_gemma":[0.7128463,0.0000086131795,0.2785361,0.008411237,0.0000514058,0.000079140504,0.000004022758,0.000022856073,0.000040365623],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988709,0.0000076270176,0.00014569839,0.00031287232,0.00016532153,0.0004976009],"domain_scores_gemma":[0.99950343,0.000060666884,0.000044773376,0.00031271527,0.000027736565,0.00005069701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013658556,0.00014704092,0.00011789775,0.00011131596,0.000093577735,0.00025595183,0.0008129184,0.000037184273,6.049763e-7],"category_scores_gemma":[0.000032598262,0.00014020191,0.000095836556,0.00021974111,0.00004525053,0.00023634292,0.000041845422,0.00016562075,0.0000060359457],"study_design_candidate":"design_other","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.0000602623,0.00019973972,0.000012016264,0.00012839586,0.00007564473,0.000029515979,0.0016969416,0.0064423815,0.10397937,0.16666514,0.004122161,0.71658844],"study_design_scores_gemma":[0.0007987303,0.0003628964,0.0000164,0.00004074166,0.000008585102,0.000035395362,0.000001508872,0.0039703907,0.5057928,0.45996264,0.028584922,0.00042503144],"about_ca_topic_score_codex":0.0000037624134,"about_ca_topic_score_gemma":0.000007737532,"teacher_disagreement_score":0.7161634,"about_ca_system_score_codex":0.00012838696,"about_ca_system_score_gemma":0.00011032227,"threshold_uncertainty_score":0.5717268},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030445019,0.000055077584,0.96857554,0.00027798282,0.00022036447,0.0001230359,0.000029469655,0.000073259194,0.00020026238],"genre_scores_gemma":[0.5541748,0.000012340655,0.44566107,0.00004147657,0.00007420622,0.00000568821,0.0000016894786,0.000009975469,0.000018794364],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987781,0.000030477142,0.00043488506,0.00020073514,0.0003290065,0.00022677341],"domain_scores_gemma":[0.99776894,0.00020161417,0.00062012905,0.00031346298,0.0010038827,0.000091979455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017347667,0.00020103616,0.00039824576,0.00010761054,0.00008830035,0.00027793852,0.0009242119,0.00005773121,0.0000022050285],"category_scores_gemma":[0.00007571791,0.00016296854,0.00015550212,0.00015564448,0.00025525276,0.0005519558,0.00009931587,0.00029728393,6.124213e-7],"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.00007175751,0.00028163235,0.000029866835,0.000050572573,0.000044661207,0.000014712601,0.0006703014,0.000078563186,0.19729422,0.01556293,0.000101563215,0.7857992],"study_design_scores_gemma":[0.0003461558,0.0007206351,0.00008291971,0.00013769277,0.00001560363,0.000081309656,0.000035260513,0.012156574,0.84248954,0.14357354,0.00018411594,0.00017666935],"about_ca_topic_score_codex":0.0000072526755,"about_ca_topic_score_gemma":0.000006649489,"teacher_disagreement_score":0.78562254,"about_ca_system_score_codex":0.000011024529,"about_ca_system_score_gemma":0.00016586929,"threshold_uncertainty_score":0.66456646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99537873,0.000092297385,0.0037039472,0.0003780546,0.000053528143,0.0001507102,7.532038e-7,0.000004513956,0.00023745302],"genre_scores_gemma":[0.9657043,0.000006281793,0.034157112,0.000025442776,0.00009954674,0.0000016713698,5.0373078e-8,0.0000035716457,0.000002015098],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988342,0.0000419519,0.0006582879,0.000059053633,0.00029531057,0.00011122698],"domain_scores_gemma":[0.9982501,0.00030140328,0.001137336,0.00019950749,0.00008959259,0.000022039465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010594714,0.00008289687,0.00022055236,0.000024388442,0.000064796324,0.00008235747,0.0007888465,0.00005393965,4.4870438e-7],"category_scores_gemma":[0.00012680031,0.000038439808,0.000054028314,0.00024277926,0.0002361862,0.00021303615,0.00015434946,0.00021513709,3.927704e-8],"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.0001904641,0.00024958493,0.021526761,0.00041091422,0.00020680431,0.000001617041,0.023541186,0.0036613264,0.042418085,0.3129656,0.0020780435,0.5927496],"study_design_scores_gemma":[0.0014541165,0.00033583856,0.004449187,0.0012196437,0.00007547844,0.000101735575,0.0025325338,0.008653465,0.64853853,0.3322377,0.00015903826,0.00024276724],"about_ca_topic_score_codex":0.0000028135937,"about_ca_topic_score_gemma":0.000008674411,"teacher_disagreement_score":0.6061204,"about_ca_system_score_codex":0.00001370214,"about_ca_system_score_gemma":0.00007077607,"threshold_uncertainty_score":0.15675299},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08356915,0.00066043815,0.9138452,0.0010417064,0.00008383455,0.00016358578,7.7537703e-7,0.00005655676,0.0005787929],"genre_scores_gemma":[0.9168137,0.0001752841,0.08288333,0.000024470497,0.00005127639,0.0000079552465,0.0000067396304,0.000010080066,0.000027191669],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99802214,0.00015324203,0.0008673013,0.0001979507,0.000538078,0.00022126133],"domain_scores_gemma":[0.9972318,0.00024307067,0.0013682971,0.0002933809,0.0007706265,0.00009287094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035045093,0.00011556298,0.00019363349,0.0007960386,0.00012562511,0.00041237846,0.00061432755,0.000069468144,7.1452985e-7],"category_scores_gemma":[0.0005731937,0.000092612296,0.000056540026,0.0028940116,0.00009355736,0.00297307,0.000049866885,0.00019858066,0.0000012764251],"study_design_candidate":"design_other","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.00027548452,0.0016421934,0.0333352,0.00019057185,0.000073354975,0.000022336602,0.004578991,0.0018827956,0.19439252,0.10706688,0.006054845,0.6504848],"study_design_scores_gemma":[0.002050924,0.0017640484,0.3508917,0.0006947368,0.00009008787,0.00014188465,0.0006725619,0.21252547,0.35107842,0.073940225,0.0054174974,0.00073240756],"about_ca_topic_score_codex":0.000049759587,"about_ca_topic_score_gemma":0.00006272179,"teacher_disagreement_score":0.8332445,"about_ca_system_score_codex":0.00021351034,"about_ca_system_score_gemma":0.00013507438,"threshold_uncertainty_score":0.39765748},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020052772,0.00014794493,0.95889133,0.00018434032,0.000025551608,0.000114341485,0.000009324671,0.00030159857,0.020272825],"genre_scores_gemma":[0.8750825,0.0000121018265,0.12471423,0.0001241485,0.00000772098,0.000017612287,0.0000053964873,0.000007433409,0.000028888511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991758,0.000028799048,0.00019586884,0.0002768689,0.00017056437,0.00015212079],"domain_scores_gemma":[0.9993294,0.00013807013,0.00009034323,0.0003176591,0.000082128994,0.00004238774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089205285,0.00011639798,0.00013560362,0.0003090595,0.00007590848,0.0002500981,0.0003448518,0.000036938767,0.0000030316928],"category_scores_gemma":[0.000020417248,0.000103838625,0.000078066776,0.0006660651,0.00017367421,0.0004956321,0.00008407146,0.000055641245,0.0000021507476],"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.0000297312,0.00042484037,0.0019868482,0.000051904466,0.000032445845,0.000024659916,0.00016791724,0.00008294693,0.034884464,0.89962876,0.01643469,0.046250787],"study_design_scores_gemma":[0.00028968081,0.00056336605,0.0020953682,0.00009910189,0.000013858005,0.0000108087415,0.000037214864,0.0027408986,0.12966356,0.86315805,0.0009913045,0.00033678088],"about_ca_topic_score_codex":0.000039196995,"about_ca_topic_score_gemma":0.0000015229684,"teacher_disagreement_score":0.8550297,"about_ca_system_score_codex":0.000004684289,"about_ca_system_score_gemma":0.00001697658,"threshold_uncertainty_score":0.42344162},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056568533,0.0002755564,0.93736786,0.00085314794,0.000079672245,0.00013780686,0.0000028093305,0.00030785953,0.0044067637],"genre_scores_gemma":[0.87644017,0.00006574799,0.12308397,0.00023740035,0.000024732444,0.000002446324,0.000004757826,0.000011330366,0.00012942549],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987119,0.00003336297,0.00024785352,0.0005362097,0.00021659557,0.00025411128],"domain_scores_gemma":[0.99948066,0.000096594216,0.0000514004,0.00023107207,0.0000302668,0.000109993955],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00014361255,0.00017811301,0.00017827995,0.0002770363,0.00014540904,0.0018909491,0.0002462524,0.00004563972,0.000013454565],"category_scores_gemma":[0.000015272222,0.00016288958,0.000037101476,0.00037426097,0.00018125001,0.004453631,0.00032242478,0.00012457801,0.000007652835],"study_design_candidate":"design_other","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.000058082136,0.00019627294,0.002196147,0.00005774719,0.00001493428,0.00028660396,0.0009559231,0.000015206996,0.0038694176,0.015738724,0.0050084004,0.97160256],"study_design_scores_gemma":[0.0031992423,0.00094117946,0.022329187,0.0009930683,0.000013278078,0.0011287461,0.00024446592,0.36968914,0.00528695,0.59411764,0.00052774284,0.0015293839],"about_ca_topic_score_codex":0.000008561515,"about_ca_topic_score_gemma":0.0000010657104,"teacher_disagreement_score":0.97007316,"about_ca_system_score_codex":0.000055849305,"about_ca_system_score_gemma":0.000020583979,"threshold_uncertainty_score":0.9991452},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009353807,0.000013243573,0.8007136,0.000112798996,0.000058535195,0.00014120108,0.0000073239944,0.00095883314,0.18864065],"genre_scores_gemma":[0.45889893,0.0000012048222,0.5408374,0.00013979292,0.000025027966,0.000021315307,0.000008246756,0.00002013702,0.000047902508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985524,0.000009973173,0.00039798944,0.00042726696,0.00030464496,0.00030775822],"domain_scores_gemma":[0.9984542,0.00029025602,0.00024930463,0.00084679335,0.00005431436,0.00010509292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022644764,0.0002372654,0.00032439953,0.00007109788,0.00009517519,0.00095885206,0.0011563641,0.00007734189,0.000010031877],"category_scores_gemma":[0.00014070365,0.00021151137,0.00006599822,0.0001961097,0.00011709871,0.0007603771,0.00046415234,0.0001313465,0.0001202841],"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.0000029957964,0.00008982258,0.00008573569,0.000108726155,0.000042519616,0.0000049671917,0.0018369252,0.000006726026,0.007175886,0.6946823,0.0007903566,0.29517305],"study_design_scores_gemma":[0.00019614058,0.000025173977,0.000027334805,0.00010552881,0.000012127163,0.000013133861,0.00013473876,0.07221486,0.03240216,0.89358854,0.0008816509,0.0003986351],"about_ca_topic_score_codex":0.0000033331182,"about_ca_topic_score_gemma":0.0000014392696,"teacher_disagreement_score":0.44954515,"about_ca_system_score_codex":0.000022582997,"about_ca_system_score_gemma":0.000030976214,"threshold_uncertainty_score":0.92462325},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8095218,0.00023465088,0.18853846,0.0008791795,0.000050271545,0.000040196515,0.0000016632865,0.00002312468,0.0007106604],"genre_scores_gemma":[0.94996125,0.000025090676,0.049820255,0.00015513298,0.000010173874,6.3989336e-7,3.3144696e-7,0.0000020294242,0.000025109386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860275,0.000031204338,0.0003414718,0.0002521498,0.00059919927,0.00017323515],"domain_scores_gemma":[0.99892277,0.0001873082,0.00026881424,0.00014809736,0.00034602918,0.00012697725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079870794,0.00010005278,0.00027371797,0.0008034534,0.00012256432,0.0002647952,0.00048212887,0.000046573416,0.000044327244],"category_scores_gemma":[0.0004911588,0.000070358605,0.000052372256,0.0031325638,0.00060230965,0.0009775772,0.000110804256,0.00014213032,6.776754e-7],"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.00095540076,0.0031854305,0.09311912,0.00011188456,0.00043703357,0.0004710988,0.0018311057,0.13328196,0.31254253,0.020911839,0.002268192,0.4308844],"study_design_scores_gemma":[0.00076608965,0.0032279165,0.103343695,0.0002668557,0.00016115732,0.0006691067,0.000050561262,0.7309464,0.1506355,0.009322812,0.00018678293,0.0004231006],"about_ca_topic_score_codex":0.000004360678,"about_ca_topic_score_gemma":0.0000021170977,"teacher_disagreement_score":0.5976645,"about_ca_system_score_codex":0.00003895998,"about_ca_system_score_gemma":0.000115502844,"threshold_uncertainty_score":0.28691408},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030183515,0.0000659936,0.9655307,0.0027697901,0.000057207035,0.00016516817,0.0000045266197,0.00095684896,0.0002662754],"genre_scores_gemma":[0.66765726,0.000031536285,0.33162493,0.0005769477,0.000009760573,0.000048447757,9.084535e-7,0.000017759847,0.00003241441],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866414,0.00001556666,0.00021166306,0.00044950828,0.00035655807,0.00030254276],"domain_scores_gemma":[0.99869245,0.000041576983,0.000061001367,0.0009685766,0.00012399086,0.000112401125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115250405,0.00020233187,0.00015196769,0.00024113429,0.00028802146,0.00037647013,0.0011186211,0.00007640439,0.0000018886439],"category_scores_gemma":[0.000026519014,0.00015976417,0.000076592056,0.00088841555,0.00025062982,0.0011600453,0.000021101356,0.00041588466,0.000009416397],"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.00044942388,0.0047630086,0.0015884384,0.0005032098,0.00042170865,0.00033817117,0.0092827715,0.029691815,0.01800783,0.19323383,0.00011763503,0.7416021],"study_design_scores_gemma":[0.0029914088,0.00282782,0.0026975505,0.0017963253,0.00011702623,0.0008041692,0.00025556755,0.0073624793,0.36233667,0.61268157,0.0032111255,0.002918279],"about_ca_topic_score_codex":0.00001663626,"about_ca_topic_score_gemma":0.000054889188,"teacher_disagreement_score":0.7386839,"about_ca_system_score_codex":0.000044955857,"about_ca_system_score_gemma":0.00015599448,"threshold_uncertainty_score":0.65149933},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034704845,0.000044770964,0.9211536,0.00023728397,0.00004579027,0.000053266223,4.306719e-7,0.00040554634,0.07771223],"genre_scores_gemma":[0.77931947,0.0000068589366,0.22010733,0.00023548471,0.000013672304,0.0000037091622,0.0000019614051,0.0000042647066,0.00030724957],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995274,0.000007382865,0.000113096976,0.0000991515,0.00013950784,0.00011346957],"domain_scores_gemma":[0.99966466,0.000021175023,0.000057953515,0.00014039256,0.00008048918,0.000035311943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009724428,0.000057413603,0.00006062009,0.00007078177,0.00001774119,0.00013266795,0.00021252585,0.000020245972,0.000008743249],"category_scores_gemma":[0.000071676644,0.000048400103,0.000020611787,0.00026528383,0.000018599983,0.0035045831,0.000086111744,0.000033204502,0.0000125156685],"study_design_candidate":"design_other","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.0000223224,0.0020912136,0.009537138,0.00039595028,0.000041780935,0.0000012521169,0.00090231554,0.003144681,0.0023901947,0.295931,0.047397256,0.6381449],"study_design_scores_gemma":[0.00029109087,0.0007471638,0.0016309976,0.0006045872,0.000009594428,0.00005398966,0.000019474895,0.36361402,0.60944843,0.02073041,0.0021440298,0.0007062133],"about_ca_topic_score_codex":0.0000027435217,"about_ca_topic_score_gemma":1.1654083e-7,"teacher_disagreement_score":0.77897245,"about_ca_system_score_codex":0.000017319004,"about_ca_system_score_gemma":0.000015674632,"threshold_uncertainty_score":0.25407383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15531914,0.000003177961,0.8384771,0.002391842,0.00005231947,0.0000945037,6.7513116e-7,0.00028847542,0.003372791],"genre_scores_gemma":[0.77963895,6.6974465e-8,0.21790102,0.0024196468,0.000012170393,0.000009624698,0.000007973747,0.000004398406,0.0000061594014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894327,0.000039795093,0.00045304224,0.000102329344,0.0002860363,0.0001755074],"domain_scores_gemma":[0.99914837,0.00008253626,0.00035093407,0.00024741108,0.00014593267,0.000024825224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005444628,0.00010320878,0.00012988393,0.00013201918,0.00008431422,0.000559733,0.0007349932,0.00003218458,0.0000033082376],"category_scores_gemma":[0.00025780365,0.00008032112,0.000023776114,0.0005433405,0.000090130496,0.005294007,0.00013920416,0.00011937372,0.0000706769],"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.00002483956,0.00012842809,0.0072163604,0.0007848871,0.000017318664,0.000002574156,0.010189542,0.0058726673,0.017039659,0.0057922644,0.0041086455,0.9488228],"study_design_scores_gemma":[0.00022018146,0.000006844567,0.0015927234,0.00018793425,0.0000016736068,0.000015565249,0.0000072982934,0.99140793,0.0040800814,0.0018026107,0.0005528379,0.00012432037],"about_ca_topic_score_codex":0.000013237524,"about_ca_topic_score_gemma":1.5746267e-7,"teacher_disagreement_score":0.98553526,"about_ca_system_score_codex":0.000027709439,"about_ca_system_score_gemma":0.00003325659,"threshold_uncertainty_score":0.5397518},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009050578,0.00017042714,0.98582816,0.00025569473,0.00001691052,0.00015488373,0.0000016790599,0.00007197388,0.004449694],"genre_scores_gemma":[0.6485813,0.000014242447,0.35131449,0.000054013843,0.0000073175543,0.0000031992909,3.0774902e-7,0.0000055823166,0.000019566829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988118,0.000021206506,0.0005052768,0.00022005776,0.00024169925,0.00019995157],"domain_scores_gemma":[0.9986628,0.00027833672,0.00033124225,0.00041131643,0.00025067176,0.00006559416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014971996,0.00012243357,0.00023358462,0.00012489266,0.00004509591,0.000110471745,0.0005533408,0.00005046149,0.0000013564849],"category_scores_gemma":[0.00032579846,0.000099564895,0.00006903929,0.00031576876,0.0003373587,0.00041672905,0.00015702905,0.00007326289,0.0000011914954],"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.000010517745,0.00032281835,0.000011754657,0.00028278207,0.000008302942,0.0000027348608,0.0011029763,0.0000110589,0.0009145575,0.855635,0.000020179848,0.14167735],"study_design_scores_gemma":[0.000005129033,0.00007219624,0.0000048766074,0.0001185466,0.000003024745,0.0000035708479,0.00027014222,0.036461014,0.38173226,0.5812283,0.000019610774,0.000081293125],"about_ca_topic_score_codex":0.000005094817,"about_ca_topic_score_gemma":0.0000011206124,"teacher_disagreement_score":0.6395307,"about_ca_system_score_codex":0.0000025378508,"about_ca_system_score_gemma":0.000034409062,"threshold_uncertainty_score":0.40601388},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088681966,0.00021882323,0.9081303,0.00054933614,0.00016725321,0.00010617455,0.000008531182,0.0003191111,0.0018185055],"genre_scores_gemma":[0.54652905,0.0000012626068,0.4531101,0.00020233732,0.000060835628,0.0000015221435,0.000014266571,0.000008210247,0.00007237624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982661,0.000031661402,0.0005522616,0.00039830475,0.0004700087,0.0002816359],"domain_scores_gemma":[0.9989836,0.00018403352,0.00021786476,0.00025330804,0.0002857616,0.000075416014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040365534,0.00017058042,0.00025499953,0.0007200969,0.00006115951,0.00015488759,0.0008492308,0.000067007066,0.000018380906],"category_scores_gemma":[0.00011832119,0.00018359731,0.00007653361,0.001677838,0.00011451675,0.0011392464,0.00036833814,0.00019986535,0.00003582399],"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.000015486816,0.0008666275,0.0121639175,0.00018476407,0.000044110562,0.000039456307,0.00084918644,0.32489157,0.000542224,0.038495906,0.0034407694,0.618466],"study_design_scores_gemma":[0.00034467713,0.00008194905,0.016175065,0.00011013151,0.0000029874288,0.000026559908,0.000006281743,0.9551926,0.0013973297,0.025284203,0.0011253728,0.00025283947],"about_ca_topic_score_codex":0.000010221342,"about_ca_topic_score_gemma":0.000001740157,"teacher_disagreement_score":0.63030106,"about_ca_system_score_codex":0.00005340769,"about_ca_system_score_gemma":0.000117942356,"threshold_uncertainty_score":0.74868804},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081158895,0.00009244638,0.85228974,0.0012664483,0.00007596207,0.00021007522,2.9397637e-7,0.00073648564,0.13721266],"genre_scores_gemma":[0.811717,0.0000018105261,0.1871168,0.0004081269,0.0000507141,0.000005122311,6.570369e-7,0.000011076492,0.0006887156],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889344,0.00001640184,0.00016215834,0.00021949237,0.00032284923,0.000385659],"domain_scores_gemma":[0.99916774,0.00010281622,0.000058153928,0.00049165776,0.00008173457,0.00009791924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038881754,0.00013992176,0.00010835198,0.000045652378,0.0001852741,0.0008211864,0.0010600458,0.0000354663,0.000009700057],"category_scores_gemma":[0.000009826779,0.00007355523,0.000034542358,0.0003687714,0.00007300321,0.0027944995,0.0002057534,0.00013417056,0.000044453598],"study_design_candidate":"design_other","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.000029338327,0.00017402867,0.002073451,0.000017545417,0.000012123722,0.0000035593005,0.0015903576,0.000012302117,0.00018830139,0.079526715,0.002351523,0.9140208],"study_design_scores_gemma":[0.005396111,0.0022471102,0.053355012,0.0010676042,0.000090865884,0.0015184602,0.00066273566,0.17146333,0.47996107,0.04690027,0.23334904,0.0039883885],"about_ca_topic_score_codex":0.00004818758,"about_ca_topic_score_gemma":0.000015344945,"teacher_disagreement_score":0.9100324,"about_ca_system_score_codex":0.000026641794,"about_ca_system_score_gemma":0.000076838696,"threshold_uncertainty_score":0.79187196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009152979,0.0020387955,0.973476,0.0019567478,0.000017230259,0.00030969403,0.00000864476,0.00039444768,0.012645446],"genre_scores_gemma":[0.74571687,0.00043296805,0.25306937,0.00032994887,0.00005416581,0.00012146865,0.000011438907,0.000010380248,0.00025339564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929476,0.000014249103,0.00020446246,0.0002484356,0.00011206901,0.00012605073],"domain_scores_gemma":[0.9993608,0.000059844977,0.000073577525,0.00030864464,0.0001251528,0.0000719971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079504796,0.000090114874,0.00012287572,0.00007666592,0.00009300435,0.00008847662,0.00041962633,0.000031829084,0.00000771579],"category_scores_gemma":[0.00001414688,0.00008370482,0.00003272731,0.00043671613,0.000060992326,0.0005303812,0.0002053744,0.00007058005,0.000037775877],"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.00000601966,0.00057920715,0.0003280429,0.00010373651,0.000023020464,0.000008164861,0.00013000079,0.0000085345655,0.03740593,0.62743783,0.0011773908,0.3327921],"study_design_scores_gemma":[0.0015585083,0.00064810546,0.007100168,0.0003613802,0.00010504703,0.0006447744,0.000065700864,0.16377328,0.31687135,0.3523049,0.15489446,0.0016723302],"about_ca_topic_score_codex":0.0000024179508,"about_ca_topic_score_gemma":2.5911717e-7,"teacher_disagreement_score":0.73656386,"about_ca_system_score_codex":0.0000067243204,"about_ca_system_score_gemma":0.000026864082,"threshold_uncertainty_score":0.34133834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6199631,0.0011951772,0.15551616,0.10162501,0.0009870172,0.0033596999,0.000030405548,0.0021659727,0.11515743],"genre_scores_gemma":[0.8658566,0.000055782926,0.13049367,0.0019342802,0.00017676671,0.00004698796,2.457872e-7,0.000058375266,0.001377311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648035,0.00004534216,0.00072534283,0.0006665113,0.0012877878,0.0007946482],"domain_scores_gemma":[0.995733,0.001436601,0.0013289277,0.0006371032,0.00066400296,0.00020033547],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019215428,0.00047987205,0.00074051094,0.000025535486,0.00084197486,0.0010952472,0.003730964,0.00012162178,0.000009231977],"category_scores_gemma":[0.0020627857,0.00026057742,0.0008405398,0.0011013134,0.003961112,0.0005698858,0.0022404327,0.0007218175,0.000046817466],"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.00006507672,0.00080717617,0.0008594893,0.0016241437,0.0005309355,8.7743877e-7,0.006182283,0.000009736706,0.020024203,0.68237466,0.1292229,0.15829852],"study_design_scores_gemma":[0.00036657858,0.00063287443,0.00088655413,0.00090843876,0.00018328764,0.00014307113,0.00062915497,0.12959427,0.0281064,0.82741785,0.01032929,0.0008022578],"about_ca_topic_score_codex":0.000010135219,"about_ca_topic_score_gemma":3.2519924e-7,"teacher_disagreement_score":0.24589345,"about_ca_system_score_codex":0.00011069881,"about_ca_system_score_gemma":0.00013401179,"threshold_uncertainty_score":0.9999846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029142727,0.00033021232,0.98583144,0.009484292,0.00027193365,0.000060273436,0.0000041618564,0.00003170108,0.001071734],"genre_scores_gemma":[0.74400544,0.00032084354,0.2539976,0.0013662552,0.00024568327,0.0000017093491,0.0000011063571,0.000008187109,0.000053197964],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991407,0.000013724069,0.00029988412,0.00010714216,0.00031968,0.00011887787],"domain_scores_gemma":[0.9987775,0.00016298993,0.00021902921,0.000098279175,0.00069690205,0.000045274413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125418,0.00008330238,0.00010172229,0.00012259999,0.00009023047,0.0006504205,0.0009907034,0.000017960338,6.766501e-7],"category_scores_gemma":[0.0000812604,0.00005662344,0.00010081906,0.00014928597,0.00011123028,0.0012197961,0.00007447008,0.0001408709,2.9992617e-7],"study_design_candidate":"design_other","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.000053672204,0.000109994966,0.00078151893,0.000013263893,0.00011587049,0.0001757003,0.00081378577,0.00000821635,0.0006429751,0.10938312,0.0017997504,0.88610214],"study_design_scores_gemma":[0.0022979996,0.0004101577,0.001887267,0.00039871788,0.00004014333,0.0039303047,0.00016035704,0.121674344,0.008952891,0.76813227,0.09166535,0.00045021457],"about_ca_topic_score_codex":0.0000041601,"about_ca_topic_score_gemma":0.0000043978675,"teacher_disagreement_score":0.88565195,"about_ca_system_score_codex":0.000015077958,"about_ca_system_score_gemma":0.00003585834,"threshold_uncertainty_score":0.62720203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015847959,0.00022971266,0.9169419,0.00045533932,0.0003160382,0.00015290595,0.000007091322,0.00196423,0.07834801],"genre_scores_gemma":[0.19228308,0.000009484286,0.8054671,0.0016361793,0.000075246724,0.000028738597,0.0000017833115,0.000026726913,0.00047166078],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985207,0.000021900556,0.00023807914,0.0005173525,0.00029677677,0.0004052039],"domain_scores_gemma":[0.99879897,0.000028364182,0.00010537193,0.0008029629,0.0001372942,0.00012703317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018416603,0.00020125824,0.00018118562,0.00021922415,0.00010332976,0.0003790084,0.0015390067,0.00007811116,0.000047321682],"category_scores_gemma":[0.000026200902,0.0001934473,0.00012170002,0.00064333965,0.00010708652,0.0015040737,0.0004807513,0.00015597069,0.0002153155],"study_design_candidate":"design_other","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.0000048932206,0.00023291954,0.00068389793,0.000034023487,0.000054558113,0.00010049041,0.0028878483,5.0703687e-8,0.0011741013,0.02323813,0.030190114,0.941399],"study_design_scores_gemma":[0.0004945253,0.00040207533,0.0028300234,0.00019548344,0.000035194942,0.00028522802,0.000046962912,0.014045907,0.5486619,0.36096558,0.07048922,0.0015479305],"about_ca_topic_score_codex":0.000030883373,"about_ca_topic_score_gemma":5.0410233e-7,"teacher_disagreement_score":0.93985105,"about_ca_system_score_codex":0.000020892308,"about_ca_system_score_gemma":0.000042572923,"threshold_uncertainty_score":0.7888552},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7450059,0.00005467759,0.24556209,0.00059928023,0.0017369557,0.00006127881,0.000016272666,0.0006134102,0.0063501038],"genre_scores_gemma":[0.74104184,0.00001130335,0.2574851,0.00094825466,0.00035272856,0.000064703054,0.000009678903,0.00006877991,0.000017646573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99481344,0.0001222243,0.00083355594,0.0015032799,0.0013453236,0.0013821608],"domain_scores_gemma":[0.99599385,0.00079270534,0.00056909793,0.0017998494,0.00022343552,0.0006210871],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021531465,0.00048122692,0.0002967151,0.0002877844,0.0011168257,0.002883892,0.0042303605,0.00047803918,0.0001524799],"category_scores_gemma":[0.001059727,0.000576787,0.00037014912,0.0010370885,0.0047424342,0.0025513333,0.0034064925,0.0010207454,0.0004621323],"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.000054010066,0.00014515874,0.00002293221,0.00008557846,0.000038163907,0.00016631617,0.0007465828,0.000045699184,0.0050846506,0.96986586,0.00038529575,0.023359742],"study_design_scores_gemma":[0.00038295134,0.00035166988,0.000051400883,0.00024270905,0.000039948955,0.0006392489,0.000046572633,0.7739046,0.19738488,0.02625019,0.00016684378,0.0005389844],"about_ca_topic_score_codex":0.000063949905,"about_ca_topic_score_gemma":0.000020861473,"teacher_disagreement_score":0.9436157,"about_ca_system_score_codex":0.000020161484,"about_ca_system_score_gemma":0.00070221984,"threshold_uncertainty_score":0.99966836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05959402,0.00066907535,0.9275306,0.0047537754,0.00038965876,0.000032822587,0.000002998503,0.00007812461,0.0069489237],"genre_scores_gemma":[0.8889535,0.0010074783,0.108636424,0.0011579632,0.00012399464,8.7199686e-7,0.0000010960033,0.00000887904,0.00010979985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991091,0.000018130293,0.00027909188,0.000114112125,0.00037020596,0.00010935625],"domain_scores_gemma":[0.9989325,0.00007646527,0.00023136294,0.000091590686,0.0006030243,0.00006505875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034246835,0.00008336892,0.00010585394,0.00017525579,0.00004528146,0.0008191345,0.0008202552,0.000031336574,0.000004852545],"category_scores_gemma":[0.00014181255,0.00007139347,0.00006663972,0.0001699885,0.000064488966,0.0023981205,0.00015340203,0.00017012455,0.0000029537075],"study_design_candidate":"design_other","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.00005022304,0.00027724254,0.012147005,0.00001745969,0.00023990564,0.0012521375,0.0009047788,6.99398e-7,0.037366234,0.027382014,0.023854775,0.8965075],"study_design_scores_gemma":[0.0020547512,0.0004357065,0.00345038,0.0012050177,0.00005309363,0.015259993,0.0002266785,0.006349688,0.12535755,0.7450232,0.09956716,0.0010167933],"about_ca_topic_score_codex":0.000003706229,"about_ca_topic_score_gemma":3.64503e-7,"teacher_disagreement_score":0.8954907,"about_ca_system_score_codex":0.000015482543,"about_ca_system_score_gemma":0.000033367967,"threshold_uncertainty_score":0.7898933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08879035,0.000016506927,0.90436417,0.00048041603,0.0000648467,0.000103966246,0.000001040918,0.00027886758,0.005899819],"genre_scores_gemma":[0.58707416,0.0000013041704,0.41276497,0.0001336812,0.000010606502,0.000003823854,1.9929553e-7,0.0000045506627,0.0000067266574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978369,0.000034110046,0.0002614334,0.0005848533,0.0008428436,0.00043984663],"domain_scores_gemma":[0.9985877,0.000076758515,0.0000949853,0.0007814366,0.00025905587,0.00020003172],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00048873585,0.00017112898,0.0002164719,0.00017616925,0.00019707409,0.00020720194,0.0025086096,0.000028254317,0.0000063482557],"category_scores_gemma":[0.000032485408,0.00011871037,0.0000399963,0.0011624551,0.0055071265,0.0013628206,0.0011827084,0.00011378501,0.0000122942065],"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.000016141941,0.0000965741,0.00028053278,0.00001291328,0.000003979042,0.0000506672,0.0005692372,0.000026307634,0.0015755899,0.97225463,0.00008004327,0.025033357],"study_design_scores_gemma":[0.00059219653,0.002242883,0.0074033053,0.00022240961,0.000009403875,0.0007923251,0.00000682129,0.56805545,0.2360199,0.1836715,0.00018604225,0.0007977664],"about_ca_topic_score_codex":0.0000021666758,"about_ca_topic_score_gemma":1.12708e-7,"teacher_disagreement_score":0.78858316,"about_ca_system_score_codex":0.00003346668,"about_ca_system_score_gemma":0.00019293473,"threshold_uncertainty_score":0.9971993},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07068914,0.00016288391,0.91609335,0.0002595933,0.0009791767,0.00016713842,5.3954415e-7,0.00048792758,0.011160266],"genre_scores_gemma":[0.8794613,0.0000011202455,0.12031804,0.00008990987,0.000110296845,0.000007882544,1.4938212e-7,0.0000068780328,0.000004453842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99802434,0.000040076025,0.0002691142,0.00036351825,0.00072837283,0.00057454605],"domain_scores_gemma":[0.99862415,0.000050644616,0.00008890665,0.00070829573,0.00030208591,0.00022591623],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011760159,0.00015549765,0.00020476498,0.00016064025,0.00017841243,0.00044602822,0.0026216744,0.000044388995,0.000007187116],"category_scores_gemma":[0.00006667334,0.00011692611,0.000053369273,0.0009107905,0.003167966,0.0028717208,0.0015669374,0.00011981297,0.000031575633],"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.0000099820345,0.00014532685,0.00012978277,0.000023951787,0.0000017530883,7.338199e-7,0.00049591984,0.0000015884553,0.0043408675,0.97956175,0.000035549874,0.015252789],"study_design_scores_gemma":[0.0003162482,0.00020549784,0.00025636397,0.00012444286,0.000004102367,0.000029138162,0.0000070083306,0.03027565,0.69066054,0.2776846,0.00015164685,0.00028479713],"about_ca_topic_score_codex":0.0000027085412,"about_ca_topic_score_gemma":2.9431188e-8,"teacher_disagreement_score":0.80877215,"about_ca_system_score_codex":0.000038240043,"about_ca_system_score_gemma":0.00011749436,"threshold_uncertainty_score":0.99954486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9518248,0.0026910964,0.007828926,0.027220137,0.000045895526,0.000104421386,4.892759e-7,0.000028117385,0.010256124],"genre_scores_gemma":[0.9879544,0.00029282406,0.009381519,0.000891864,0.00006195801,7.8066074e-7,5.6523312e-8,0.0000031365919,0.001413487],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990167,0.00006736702,0.00018066376,0.00011038426,0.00042584585,0.00019903481],"domain_scores_gemma":[0.99926764,0.00018819733,0.00007085513,0.00013951537,0.00024289603,0.000090920184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014363655,0.00006111499,0.00012692134,0.00018340844,0.00010374988,0.0006807817,0.00027465916,0.000025513238,0.0000010340561],"category_scores_gemma":[0.00031782695,0.000034973982,0.000029792247,0.0001793268,0.00013743805,0.0006606728,0.00010666348,0.00031733644,0.0000013104546],"study_design_candidate":"design_other","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.000106893836,0.00013267453,0.00018708194,0.000020238424,0.000019506519,0.00039858202,0.0011936704,8.7419096e-7,0.049416427,0.020473357,0.076015815,0.85203487],"study_design_scores_gemma":[0.003087644,0.012622362,0.03959878,0.0016774242,0.000028582383,0.0037087416,0.00057485746,0.0074184993,0.050576743,0.7871863,0.092719935,0.0008001153],"about_ca_topic_score_codex":0.0000071601717,"about_ca_topic_score_gemma":0.00000111062,"teacher_disagreement_score":0.8512348,"about_ca_system_score_codex":0.000013685927,"about_ca_system_score_gemma":0.0000438437,"threshold_uncertainty_score":0.65647936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017515018,0.000018499408,0.93900794,0.005406387,0.00003183907,0.0007758246,0.000023684424,0.00062191894,0.053938758],"genre_scores_gemma":[0.2244027,0.0000015128566,0.77287406,0.0017602893,0.00010395574,0.00039382972,0.000008974226,0.000045970923,0.00040871324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834156,0.000014187369,0.0003611985,0.00042702127,0.0004311165,0.0004249064],"domain_scores_gemma":[0.99784005,0.00061585585,0.00020879043,0.0011815106,0.000066025445,0.00008779095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056739396,0.0003034822,0.0002658964,0.00008993261,0.00022523715,0.0005744304,0.0017844674,0.00007593999,0.000010678525],"category_scores_gemma":[0.00008838695,0.00018682821,0.00013957494,0.0002557795,0.00016585061,0.00036138954,0.00026799788,0.00014904463,0.00006109802],"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.000009066096,0.00009265318,6.316177e-7,0.00007617711,0.000015137735,8.8051223e-7,0.00063471106,0.00003478408,0.0008387677,0.9254235,0.0014721811,0.0714015],"study_design_scores_gemma":[0.0002534475,0.00007094855,0.000003204886,0.00007159348,0.000017756322,0.0000030926244,0.00008674114,0.5235572,0.04859624,0.4236578,0.0033490283,0.00033294968],"about_ca_topic_score_codex":0.0000017173093,"about_ca_topic_score_gemma":0.0000012968882,"teacher_disagreement_score":0.5235224,"about_ca_system_score_codex":0.000044625613,"about_ca_system_score_gemma":0.000051594016,"threshold_uncertainty_score":0.7618633},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21786138,0.00091283774,0.7729503,0.00037749004,0.00037989355,0.00006239741,0.0000028073973,0.00007449294,0.0073784264],"genre_scores_gemma":[0.9152763,0.000011544153,0.084547445,0.0000487246,0.000033536842,4.0054513e-8,0.0000018027969,0.000011050455,0.00006959129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987309,0.00009600377,0.000501696,0.00015422747,0.00039005151,0.0001271363],"domain_scores_gemma":[0.9984224,0.000117378586,0.0005266781,0.00046391223,0.00037575467,0.00009387667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021128478,0.000091931644,0.00015049089,0.0001907129,0.000041944826,0.00013120552,0.0011943913,0.000011056895,8.610643e-7],"category_scores_gemma":[0.00026444142,0.00007900969,0.000026640177,0.00035085357,0.00006798414,0.0012506201,0.0006387327,0.00014691254,0.0000020281213],"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.000091340844,0.0013018518,0.010420227,0.00022895863,0.000101513644,0.0010820575,0.001352173,0.00008456602,0.016965609,0.50087184,0.008490668,0.45900917],"study_design_scores_gemma":[0.008066662,0.0047688247,0.1993877,0.00318665,0.00015700984,0.0018240005,0.00016047989,0.05202783,0.13633882,0.5828805,0.009262339,0.0019391826],"about_ca_topic_score_codex":0.0000010111114,"about_ca_topic_score_gemma":2.0243615e-7,"teacher_disagreement_score":0.6974149,"about_ca_system_score_codex":0.000016599062,"about_ca_system_score_gemma":0.00006079029,"threshold_uncertainty_score":0.32219216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043656034,0.000081154794,0.98991543,0.0006724928,0.00005926648,0.00028793834,0.000009491515,0.0008941389,0.0037145116],"genre_scores_gemma":[0.053000737,0.000009888888,0.9461126,0.00017345647,0.000046705947,0.00006568755,0.000006672179,0.000026572277,0.0005576813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998571,0.000015890488,0.00035641648,0.0003540776,0.0003461486,0.0003564708],"domain_scores_gemma":[0.99886626,0.00019509898,0.00014411389,0.0005390732,0.00014842646,0.000107017986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002643655,0.00020090416,0.00027291192,0.00007407037,0.00029775567,0.00039055105,0.0010471479,0.00008249632,0.0000048228576],"category_scores_gemma":[0.00023604733,0.00016667396,0.00014176588,0.00037038064,0.0002625308,0.0009006389,0.00025982843,0.000115401905,0.000055257267],"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.000067328874,0.0027571712,0.00095904904,0.004296178,0.0006042578,0.0008065721,0.044929437,0.0002442687,0.034671135,0.5846953,0.040372953,0.28559637],"study_design_scores_gemma":[0.00016855751,0.00012066353,0.000020146243,0.0001245663,0.000011264181,0.00017113326,0.00002383428,0.80516464,0.010729731,0.18152002,0.0015693024,0.00037613866],"about_ca_topic_score_codex":0.0000028375218,"about_ca_topic_score_gemma":2.2815902e-7,"teacher_disagreement_score":0.8049204,"about_ca_system_score_codex":0.000021235106,"about_ca_system_score_gemma":0.00008977797,"threshold_uncertainty_score":0.67967665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034573833,0.00007810853,0.96418536,0.00036776866,0.000023252356,0.00008300559,0.0000020931743,0.00020380197,0.03159922],"genre_scores_gemma":[0.66908187,0.0000038633943,0.33048627,0.000059210415,0.0000029750736,0.0000037800469,3.4176185e-7,0.0000033750325,0.00035832272],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923027,0.000025187743,0.00023902665,0.00018541326,0.0002150336,0.00010509876],"domain_scores_gemma":[0.99914086,0.00011106538,0.0001532106,0.0003491305,0.00021832596,0.000027420856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012564508,0.00006879229,0.00015496198,0.00011910122,0.000017308606,0.00009606124,0.00047067244,0.000024256431,0.000022127197],"category_scores_gemma":[0.00014477997,0.00006281063,0.000034611658,0.0003935983,0.000085658845,0.0007468204,0.00010738863,0.00003622564,0.000004000541],"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.000015577856,0.0014217685,0.004912708,0.0006110675,0.000046373545,0.000040388986,0.0008354673,0.000039019535,0.3120309,0.077132374,0.012738646,0.5901757],"study_design_scores_gemma":[0.00024018451,0.00005581297,0.0002525281,0.000073608564,0.0000037436607,0.0000029902687,0.000011014788,0.19275148,0.8027166,0.0038010674,0.00001536519,0.00007558201],"about_ca_topic_score_codex":0.000035422243,"about_ca_topic_score_gemma":0.0000010427483,"teacher_disagreement_score":0.6656245,"about_ca_system_score_codex":0.000010157977,"about_ca_system_score_gemma":0.000014114132,"threshold_uncertainty_score":0.2561343},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031920718,0.00038242564,0.9887649,0.0026042447,0.00006446101,0.00080600445,0.0000065736494,0.0016864057,0.002492913],"genre_scores_gemma":[0.7855548,0.000056600773,0.21309066,0.00038780292,0.000043668235,0.0003495982,0.0000016085263,0.000065088025,0.00045013265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969807,0.000043931737,0.00048749027,0.0011432345,0.00062323664,0.0007213732],"domain_scores_gemma":[0.9983022,0.00005072232,0.00012999815,0.0005339979,0.00064719655,0.00033584147],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046613003,0.00042285354,0.0003163923,0.0005724258,0.00095102505,0.0024722917,0.0010000243,0.00012823286,0.000007609424],"category_scores_gemma":[0.000020788651,0.00043279488,0.00007054529,0.001869375,0.00015837098,0.0059180134,0.000030007785,0.000450075,0.000118024174],"study_design_candidate":"design_other","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.000027259388,0.00032868123,0.000008545419,0.00052633695,0.000008745152,0.00002122263,0.0014531143,0.00063740974,0.07778805,0.000051888575,0.000047359554,0.9191014],"study_design_scores_gemma":[0.00065304874,0.00028894708,0.00010223594,0.0011844543,0.000041329724,0.0004928103,0.00013079743,0.5459351,0.4464091,0.0020282133,0.0015753977,0.0011585569],"about_ca_topic_score_codex":0.000030830037,"about_ca_topic_score_gemma":0.00002662481,"teacher_disagreement_score":0.9179428,"about_ca_system_score_codex":0.00015480546,"about_ca_system_score_gemma":0.00021239718,"threshold_uncertainty_score":0.99981236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007906158,0.000053996166,0.89311945,0.00035588015,0.00006598214,0.00009187186,3.76399e-7,0.00082075986,0.09758554],"genre_scores_gemma":[0.7894207,0.0000018904628,0.20899856,0.0008378851,0.000024017738,0.0000017341929,7.412651e-7,0.0000072698585,0.0007071836],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903136,0.000014666479,0.0001710389,0.00031495333,0.00020857721,0.00025940937],"domain_scores_gemma":[0.9994245,0.00006772192,0.00004991138,0.00030993824,0.000059208036,0.000088731664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043020453,0.00012071871,0.00012433332,0.000113054884,0.00008776184,0.0005635571,0.00041099873,0.000039945655,0.000009767144],"category_scores_gemma":[0.000034815792,0.00010567476,0.000029940464,0.00018069662,0.000073189665,0.0008105893,0.0001750845,0.000078963145,0.000016565655],"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.000015961543,0.00014444486,0.0001690512,0.00004615077,0.000019679139,0.000154664,0.00047626198,0.000003744455,0.031321816,0.12553468,0.008993625,0.8331199],"study_design_scores_gemma":[0.00090788124,0.0006266616,0.008788103,0.00021878276,0.000013128615,0.0003154246,0.000107716114,0.025072873,0.8481578,0.09707414,0.017631667,0.0010858128],"about_ca_topic_score_codex":0.000026017458,"about_ca_topic_score_gemma":0.000014105744,"teacher_disagreement_score":0.8320341,"about_ca_system_score_codex":0.000028842936,"about_ca_system_score_gemma":0.000022544336,"threshold_uncertainty_score":0.5434394},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035662595,0.0005598115,0.9573858,0.0005200995,0.00020767731,0.00016721206,0.000048032914,0.000058850786,0.005389921],"genre_scores_gemma":[0.79334736,0.00003895698,0.20627578,0.000155347,0.000098922166,0.000021686794,0.000010177334,0.0000075086136,0.00004426187],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989159,0.00002395165,0.00042315124,0.00020801368,0.00032230836,0.00010665562],"domain_scores_gemma":[0.99880224,0.00021411882,0.00031663605,0.00009726369,0.00048952637,0.000080217076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019481173,0.00010604655,0.00014999317,0.0005129864,0.000063496256,0.00020261023,0.0004849451,0.000049005317,0.000035756846],"category_scores_gemma":[0.000049620186,0.00010992216,0.000037692273,0.0003515318,0.00014324921,0.0007944887,0.00015527479,0.00019406226,0.000012632016],"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.000046962665,0.00052433944,0.061664764,0.00002839796,0.00032061324,0.000048615842,0.001480768,0.0001427322,0.000469593,0.2588322,0.000696329,0.6757447],"study_design_scores_gemma":[0.0014470504,0.00014638499,0.08820517,0.000245306,0.00004408347,0.0022358987,0.00043692588,0.028419672,0.0015439121,0.85782194,0.018788017,0.0006656502],"about_ca_topic_score_codex":0.000018703737,"about_ca_topic_score_gemma":0.0000018812948,"teacher_disagreement_score":0.75768477,"about_ca_system_score_codex":0.0000504329,"about_ca_system_score_gemma":0.00017908502,"threshold_uncertainty_score":0.44824955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023661839,0.000019035995,0.88198847,0.00026839742,0.00004526668,0.00006195501,9.393551e-8,0.000095779214,0.09385919],"genre_scores_gemma":[0.80032307,0.0000016023959,0.19949497,0.000081490056,0.000004981224,0.0000016805753,5.208483e-8,0.0000010107126,0.00009114429],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995446,0.000015429669,0.00012863701,0.00010166735,0.00012038916,0.00008927055],"domain_scores_gemma":[0.99955875,0.00009800396,0.000042474512,0.00024543842,0.000044986682,0.000010363104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066086045,0.000033818418,0.00004101546,0.000066092885,0.000011742358,0.000070311886,0.00061597116,0.000016378435,0.0000017922879],"category_scores_gemma":[0.00008648095,0.0000221976,0.000012849352,0.00035611357,0.000055157983,0.00079537736,0.000078620054,0.000047491012,0.0000028013046],"study_design_candidate":"design_other","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.0000028044462,0.000058472076,0.005852071,0.000011587017,9.876468e-7,0.0000067240853,0.0006600833,0.0000014675248,0.0025014502,0.06090497,0.0006461024,0.9293533],"study_design_scores_gemma":[0.00024763902,0.0001617328,0.042673517,0.00015661737,0.0000020923476,0.00025048415,0.00034407622,0.018022064,0.6004353,0.33597696,0.0014262068,0.0003032885],"about_ca_topic_score_codex":0.000033214776,"about_ca_topic_score_gemma":0.000023900599,"teacher_disagreement_score":0.92904997,"about_ca_system_score_codex":0.000007138234,"about_ca_system_score_gemma":0.000015936143,"threshold_uncertainty_score":0.11446379},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023058952,0.0001775824,0.9944585,0.0001295963,0.00032122797,0.0004238906,0.000016183776,0.0020149364,0.0022275127],"genre_scores_gemma":[0.38632947,0.0000049900063,0.6130191,0.00021119992,0.000039226976,0.00017832546,0.0000011685906,0.000053897307,0.00016264225],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974686,0.000045337987,0.0005095166,0.00087766605,0.0003930136,0.00070587825],"domain_scores_gemma":[0.9984776,0.000115194845,0.0002303074,0.0005544541,0.0004443411,0.00017812532],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003634082,0.00041336202,0.0003271155,0.00039727855,0.00080470863,0.001106134,0.001154662,0.00012015346,0.00001881681],"category_scores_gemma":[0.000029513176,0.00042244262,0.00020351297,0.0006737453,0.00019724762,0.0050498475,0.000014616828,0.0003516248,0.000032365562],"study_design_candidate":"design_other","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.00001585189,0.0002544991,0.000003845803,0.00012106076,0.000022058888,0.000020057121,0.0010741873,0.0000218318,0.00712032,0.00007111228,0.00007527206,0.9911999],"study_design_scores_gemma":[0.00055044814,0.00019838639,0.000020996542,0.00040113574,0.000038629285,0.00010710034,0.00010760645,0.43126082,0.5594002,0.0069873957,0.00028529196,0.0006419495],"about_ca_topic_score_codex":0.000027632243,"about_ca_topic_score_gemma":0.0000072989606,"teacher_disagreement_score":0.99055797,"about_ca_system_score_codex":0.00011835913,"about_ca_system_score_gemma":0.00019773834,"threshold_uncertainty_score":0.9999308},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011480876,0.00014471784,0.97141016,0.00006958682,0.000007707876,0.000034074408,8.885662e-8,0.00019054816,0.016662266],"genre_scores_gemma":[0.66866845,0.0000042149836,0.33116025,0.00003431757,0.0000025936304,7.211625e-7,3.5861614e-8,0.0000018503995,0.00012754583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963695,0.000005413841,0.00009233763,0.00011420496,0.000084250314,0.0000668426],"domain_scores_gemma":[0.9997331,0.000049016282,0.000036472982,0.000117150004,0.00004543931,0.000018803468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000071932445,0.000040385854,0.0000554938,0.000057565583,0.000022803599,0.0001091613,0.00015412933,0.00001656424,0.0000035437151],"category_scores_gemma":[0.000015081876,0.000036818787,0.000009989102,0.00014692024,0.00001535502,0.0009014585,0.000079334095,0.000022448054,0.0000028160277],"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.0000024530398,0.00009629157,0.00067853153,0.00012368266,0.00001010431,0.0000052204155,0.0020634204,0.42724958,0.0008825807,0.026920032,0.00018504624,0.54178303],"study_design_scores_gemma":[0.00004018837,0.000010353239,0.0000048677866,0.000019614872,9.253807e-7,0.0000014717382,0.0000023127152,0.98951375,0.0033208835,0.0069549475,0.000086556785,0.000044097702],"about_ca_topic_score_codex":0.0000052450846,"about_ca_topic_score_gemma":1.9671079e-7,"teacher_disagreement_score":0.6571876,"about_ca_system_score_codex":0.0000048474735,"about_ca_system_score_gemma":0.0000022098725,"threshold_uncertainty_score":0.15014265},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46867552,0.00027813466,0.34918275,0.0005062585,0.0023469152,0.00008925112,0.00009673442,0.0004865062,0.17833793],"genre_scores_gemma":[0.8685398,0.00009062399,0.12904654,0.0007160537,0.00085022184,0.00037298657,0.0000693229,0.00025687425,0.000057586418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99231833,0.0002627807,0.0013267173,0.002093455,0.0018868453,0.0021118573],"domain_scores_gemma":[0.9947294,0.0011605993,0.0010951984,0.0018900323,0.00023998151,0.0008847608],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.0029916258,0.0007006718,0.00031350701,0.00054625754,0.001315036,0.0030858282,0.0032081096,0.0010747053,0.018151386],"category_scores_gemma":[0.0011097132,0.0011562512,0.00071893533,0.0015538353,0.0039583156,0.0031644204,0.004181802,0.00126948,0.00052169047],"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.000698012,0.00026009968,0.000004592538,0.0004713399,0.00019633734,0.0007460234,0.0032559496,0.00027922465,0.0013714484,0.96208274,0.0048042606,0.025829967],"study_design_scores_gemma":[0.0007488928,0.0014652503,0.000023193172,0.0007352664,0.00015913435,0.00113376,0.00020324973,0.5716051,0.42183653,0.0013095042,0.000100905425,0.00067922706],"about_ca_topic_score_codex":0.0005373493,"about_ca_topic_score_gemma":0.00011409494,"teacher_disagreement_score":0.9607732,"about_ca_system_score_codex":0.000024111521,"about_ca_system_score_gemma":0.0011585632,"threshold_uncertainty_score":0.9999851},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053644725,0.000033016157,0.96499807,0.00010994575,0.000067322915,0.000053383614,4.303447e-7,0.0005392808,0.028834073],"genre_scores_gemma":[0.7784902,6.1622626e-7,0.22114693,0.000049710707,0.00002654147,0.0000022995584,0.0000010510126,0.0000045423167,0.00027812953],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993918,0.000008956548,0.00015246618,0.00012064852,0.00016157932,0.00016455613],"domain_scores_gemma":[0.99956286,0.000023186478,0.000069715665,0.00018904789,0.00009324503,0.00006191811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010411522,0.000072982824,0.00008678866,0.00007204697,0.000027577671,0.00012343822,0.00033169443,0.000034055545,0.000008309352],"category_scores_gemma":[0.000031191335,0.000058589267,0.000030856794,0.00024501738,0.00003113668,0.003801433,0.00027172483,0.000056634915,0.000032842217],"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.000015626727,0.0010220547,0.02071778,0.00009452357,0.000021769765,0.0000015529268,0.0007475187,0.000012619169,0.08036673,0.034615885,0.009310806,0.8530731],"study_design_scores_gemma":[0.00012763515,0.0001321365,0.0012959113,0.000047531026,0.0000028577692,0.000044735578,0.000006626804,0.06344433,0.9126582,0.019443464,0.002577833,0.0002187378],"about_ca_topic_score_codex":0.0000054453294,"about_ca_topic_score_gemma":1.66552e-7,"teacher_disagreement_score":0.8528544,"about_ca_system_score_codex":0.000016050995,"about_ca_system_score_gemma":0.0000142719155,"threshold_uncertainty_score":0.2755947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056437373,0.00004558743,0.8377914,0.00033481215,0.000038555205,0.00007118685,2.1878031e-7,0.0005676806,0.104713194],"genre_scores_gemma":[0.5794643,0.000012239143,0.41990706,0.0003544662,0.000004145712,0.000007887775,0.0000012478961,0.000002218286,0.00024643424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948555,0.0000291164,0.00008333124,0.00022822204,0.00008430114,0.00008948149],"domain_scores_gemma":[0.99971884,0.000032534746,0.000026462618,0.00014204255,0.000045848923,0.000034271452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012727185,0.0000504196,0.00004948365,0.000039753082,0.000034165194,0.0002603519,0.00012441578,0.000029602017,0.00003277619],"category_scores_gemma":[0.00015192604,0.000042266056,0.000012261943,0.00016040221,0.000031874664,0.0009059671,0.000060499733,0.000038609636,0.00003417739],"study_design_candidate":"design_other","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.0000013855766,0.00004817081,0.0004798873,0.0000054436664,0.0000020676825,0.000031830987,0.00005040715,1.4414118e-7,0.005417125,0.031414323,0.0018686582,0.96068054],"study_design_scores_gemma":[0.00025131946,0.00016496179,0.002254628,0.000026361857,0.0000035984297,0.000529234,0.000023848004,0.012335163,0.25605655,0.7259377,0.002113429,0.00030316232],"about_ca_topic_score_codex":0.0000030050578,"about_ca_topic_score_gemma":2.844333e-7,"teacher_disagreement_score":0.9603774,"about_ca_system_score_codex":0.0000071043073,"about_ca_system_score_gemma":0.00000847928,"threshold_uncertainty_score":0.25105792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0087128,0.00026176634,0.98077023,0.006490401,0.000056450965,0.00026372584,0.0000015888731,0.00032347493,0.0031195513],"genre_scores_gemma":[0.8412785,0.000020607831,0.15803728,0.000493356,0.00008665567,0.000034479646,4.188701e-7,0.000008247856,0.000040441533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977995,0.00006703306,0.00029608546,0.0007026036,0.0005339862,0.00060077896],"domain_scores_gemma":[0.9982366,0.00044103668,0.0000711511,0.00095507124,0.00008990399,0.00020626116],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016205246,0.00019152884,0.00016447956,0.00020302615,0.00066848606,0.0015971635,0.0033978445,0.000041986354,0.000001930641],"category_scores_gemma":[0.000078614576,0.00012021854,0.00003879813,0.0013507286,0.0050985925,0.0024116419,0.002195514,0.00023487075,0.000019586667],"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.000001780047,0.000015650516,0.00008175388,0.0000028086433,9.88981e-7,0.0000012106187,0.00013102319,0.000006384033,0.000077844685,0.81248707,0.000009617469,0.18718386],"study_design_scores_gemma":[0.000085588945,0.000052719777,0.0011502632,0.00002193195,0.0000017093224,0.00001794265,0.0000059248955,0.21657395,0.0024495902,0.77855396,0.0008951566,0.00019123948],"about_ca_topic_score_codex":0.0000048939964,"about_ca_topic_score_gemma":0.0000024217297,"teacher_disagreement_score":0.8325657,"about_ca_system_score_codex":0.00006017593,"about_ca_system_score_gemma":0.00007440228,"threshold_uncertainty_score":0.9994393},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054621436,0.0026104997,0.9408397,0.00042008708,0.0000675383,0.00047111284,0.000016252525,0.0003010921,0.00065224816],"genre_scores_gemma":[0.53047013,0.0000877575,0.46926954,0.000032380965,0.00003681382,0.00003375871,0.000008395337,0.000033582124,0.000027640095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964362,0.000114569295,0.0011378955,0.00070098107,0.0005226354,0.0010877433],"domain_scores_gemma":[0.99800086,0.0002731581,0.00050274876,0.0009987493,0.000118357966,0.00010612919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095750904,0.0004610044,0.0006486703,0.0007927152,0.00009902923,0.00024923545,0.0014555386,0.00017770428,0.000013241672],"category_scores_gemma":[0.00021570337,0.00045050416,0.00021453733,0.0016602593,0.00031718973,0.0026137275,0.0006078718,0.0004917788,0.000008803993],"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.00016927658,0.0036569186,0.013939378,0.0029643443,0.00050535763,0.00022857999,0.0101422975,0.007429169,0.08288106,0.3874995,0.00045769208,0.49012643],"study_design_scores_gemma":[0.00065897737,0.00025323153,0.00065955793,0.00077448867,0.000029739627,0.00007457846,0.00007852894,0.71886396,0.053790856,0.22399761,0.00008710433,0.00073133816],"about_ca_topic_score_codex":0.00007088524,"about_ca_topic_score_gemma":0.000107110754,"teacher_disagreement_score":0.71143484,"about_ca_system_score_codex":0.0005311829,"about_ca_system_score_gemma":0.0002937097,"threshold_uncertainty_score":0.99979466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006155876,0.00006547828,0.96870494,0.0009059325,0.000045345183,0.00023220915,0.0000047860976,0.0009007049,0.029134475],"genre_scores_gemma":[0.04054256,0.0000036453714,0.95445335,0.00020667055,0.00002155827,0.00017162673,0.000004801591,0.000007692764,0.004588116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925905,0.000007832237,0.00015854984,0.0002646084,0.00014112574,0.00016880137],"domain_scores_gemma":[0.99933785,0.000046049732,0.00006041906,0.00037322412,0.00013862409,0.000043846125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008946831,0.00008888377,0.00008004378,0.00006458084,0.000095326315,0.00042535487,0.00057654956,0.00002881369,0.0000093045255],"category_scores_gemma":[0.00004094906,0.000082004284,0.00003628082,0.00028533107,0.00003854317,0.0015208321,0.00007782804,0.00003570021,0.000040128212],"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":[1.7283591e-7,0.00007681941,0.0000028597897,0.000010470765,0.0000021631015,3.5169091e-7,0.0001614363,0.0000030415472,0.00009271393,0.06764473,0.005791915,0.9262133],"study_design_scores_gemma":[0.00009415405,0.000030588883,0.0000057305,0.000013326056,0.0000016181257,0.0000040395053,0.000011184582,0.94510096,0.008629934,0.041809212,0.0041786972,0.00012056825],"about_ca_topic_score_codex":0.0000036861977,"about_ca_topic_score_gemma":0.0000046653427,"teacher_disagreement_score":0.9450979,"about_ca_system_score_codex":0.000033885055,"about_ca_system_score_gemma":0.000012944535,"threshold_uncertainty_score":0.4101707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015443115,0.000043642274,0.99274176,0.00009547413,0.000049790095,0.00015335612,0.000001446737,0.00057109876,0.004799093],"genre_scores_gemma":[0.15482248,9.591154e-7,0.8447566,0.00017261312,0.000017301907,0.000034981498,7.697304e-7,0.000008861181,0.00018543586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999133,0.000025330624,0.00017424852,0.00031334997,0.000100465295,0.00025360123],"domain_scores_gemma":[0.9995011,0.000067617846,0.000042290856,0.00025449702,0.00008118146,0.000053304273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042297406,0.00010639091,0.00011281107,0.000114773255,0.00005464454,0.00045855303,0.0005042041,0.000043845357,0.000004606882],"category_scores_gemma":[0.00009899942,0.00009588943,0.000027423097,0.00026571745,0.000027061855,0.0013615353,0.000048504447,0.00006201341,0.0000016674838],"study_design_candidate":"design_other","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.000001030892,0.00008205289,0.000028761771,0.000009275981,0.0000019308582,0.000006133532,0.00014053204,0.000036858884,0.0018110726,0.009781311,0.0000885443,0.9880125],"study_design_scores_gemma":[0.00017028418,0.00014703,0.00002111285,0.000020231484,8.8101336e-7,0.00001677296,0.000036608195,0.6624306,0.324127,0.0119307125,0.0009077277,0.00019106273],"about_ca_topic_score_codex":0.000005068363,"about_ca_topic_score_gemma":0.000013169839,"teacher_disagreement_score":0.98782146,"about_ca_system_score_codex":0.000020241694,"about_ca_system_score_gemma":0.000049390535,"threshold_uncertainty_score":0.44218373},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035427376,0.0003692675,0.9826975,0.005757574,0.00013970531,0.000067719986,1.3109776e-7,0.00007818635,0.0073471675],"genre_scores_gemma":[0.89564955,0.00023951248,0.10374951,0.00007474634,0.00005886122,0.0000050245253,2.2624747e-7,0.000004064676,0.00021849167],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905425,0.000045680907,0.00036984705,0.00008273739,0.0003452379,0.0001022318],"domain_scores_gemma":[0.9986346,0.000093532166,0.0005433877,0.00022844356,0.00045481455,0.000045242406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060369336,0.00005427385,0.00007802755,0.00013561983,0.00018044583,0.00023957247,0.0006153536,0.000026235391,7.0197905e-7],"category_scores_gemma":[0.00020164617,0.000034168996,0.000056169596,0.00051640015,0.00006676367,0.001448462,0.000039877406,0.00012237472,0.000012699469],"study_design_candidate":"design_other","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.000024377368,0.00027233767,0.0010521316,0.00001899695,0.000031953212,0.000030773866,0.00057616236,0.000022983724,0.014820426,0.14939128,0.04485361,0.78890496],"study_design_scores_gemma":[0.0008816865,0.0010304017,0.0931251,0.0002264542,0.000040164632,0.00336587,0.00012375465,0.05021715,0.14068408,0.48387274,0.22586611,0.0005664808],"about_ca_topic_score_codex":5.40837e-7,"about_ca_topic_score_gemma":2.4171936e-7,"teacher_disagreement_score":0.89210683,"about_ca_system_score_codex":0.000065695276,"about_ca_system_score_gemma":0.00012084407,"threshold_uncertainty_score":0.23102029},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04967744,0.000059817736,0.91609824,0.00030987256,0.00016251692,0.00013146637,0.000010086358,0.0011260561,0.0324245],"genre_scores_gemma":[0.9778997,0.000030981893,0.020701267,0.001027907,0.00006195099,0.00003806334,0.00003773855,0.000015785625,0.00018665983],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989632,0.000023361225,0.00019972885,0.00034245712,0.0002442194,0.0002270731],"domain_scores_gemma":[0.99934167,0.000040285577,0.00009775049,0.00029859736,0.00014546668,0.00007621509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009022336,0.0001378839,0.00012934153,0.000108516746,0.00010200942,0.00025812082,0.0004808257,0.000054328662,0.000025795387],"category_scores_gemma":[0.000051521038,0.0001400303,0.000057363184,0.00019156291,0.00007079896,0.0019102151,0.0001604875,0.00010436368,0.00069405715],"study_design_candidate":"design_other","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.000002415217,0.00009739307,0.0013997592,0.000024026114,0.0000067454494,0.00009234045,0.00019390688,1.1966391e-7,0.0005768654,0.000016560896,0.004645234,0.99294466],"study_design_scores_gemma":[0.0038928515,0.0015325972,0.062318634,0.0013011196,0.000053960674,0.005339554,0.00006229613,0.05020816,0.6390434,0.20312373,0.028202318,0.0049214074],"about_ca_topic_score_codex":0.000015845351,"about_ca_topic_score_gemma":0.0000014202517,"teacher_disagreement_score":0.9880232,"about_ca_system_score_codex":0.000034880337,"about_ca_system_score_gemma":0.000038361184,"threshold_uncertainty_score":0.89209324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033289227,0.0008192843,0.98831534,0.00042738943,0.0011167589,0.00021608181,0.0000011644789,0.00049864396,0.008572058],"genre_scores_gemma":[0.1266009,0.0004099651,0.87048,0.0012551066,0.0005592521,0.000014728724,0.000005348378,0.000047273064,0.0006274458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975918,0.000021673235,0.00035031117,0.0011906159,0.00045610813,0.00038947046],"domain_scores_gemma":[0.9986595,0.00012767795,0.00025079102,0.0006469889,0.00020072536,0.000114354385],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00036738394,0.00037465565,0.00031868837,0.0006660465,0.00024093765,0.0012006796,0.0010094999,0.0002898199,0.000007076775],"category_scores_gemma":[0.000035622168,0.00036594513,0.000058761332,0.00047232726,0.0006423769,0.0018725668,0.0006282602,0.00057918474,0.000007331394],"study_design_candidate":"design_other","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.0000014510526,0.000009513649,0.000021759,0.000014632575,0.0000035121352,0.000021180498,0.00008761845,0.00096601533,0.00005567164,0.0038935011,0.000028691782,0.9948965],"study_design_scores_gemma":[0.00009562348,0.00012931053,0.0000988429,0.00055996655,0.0000066432517,0.0006734392,2.7638167e-8,0.7954069,0.0012275565,0.20070148,0.00057963043,0.0005205991],"about_ca_topic_score_codex":0.000014166506,"about_ca_topic_score_gemma":0.000011806328,"teacher_disagreement_score":0.9943758,"about_ca_system_score_codex":0.00025099042,"about_ca_system_score_gemma":0.00009679083,"threshold_uncertainty_score":0.99987924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018711455,0.0000784146,0.9620082,0.000010165758,0.000027685435,0.000091062924,4.7467023e-7,0.00026259848,0.01880996],"genre_scores_gemma":[0.48908168,0.0000010179526,0.5108456,0.000020744348,0.0000051424117,0.0000026089886,0.0000012473525,0.0000028023553,0.00003915008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927485,0.00001279592,0.00019899171,0.00020101531,0.00019047534,0.00012188943],"domain_scores_gemma":[0.9996223,0.000013615601,0.00008578636,0.00020094382,0.00005664066,0.000020752093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010993959,0.00007769971,0.00008892992,0.00016728132,0.00003122877,0.00016845306,0.00046221953,0.000023507295,0.0000016489257],"category_scores_gemma":[0.0000050246786,0.00007156862,0.000045762154,0.00059011794,0.00007047335,0.0010125401,0.00013237532,0.000033671717,0.0000016963252],"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.000011911052,0.0014325919,0.013009709,0.00021944575,0.000041478397,0.000017537788,0.0009507358,0.0027761823,0.19354129,0.39353263,0.0011018382,0.39336467],"study_design_scores_gemma":[0.00004288475,0.000029583465,0.00016842713,0.000016983227,0.000003702715,0.000034926245,0.00005451314,0.16577679,0.80071855,0.03301801,0.000010799304,0.00012485193],"about_ca_topic_score_codex":0.00015110044,"about_ca_topic_score_gemma":0.0000018191391,"teacher_disagreement_score":0.60717726,"about_ca_system_score_codex":0.000023988398,"about_ca_system_score_gemma":0.000022185195,"threshold_uncertainty_score":0.29184836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028636197,0.00008687309,0.96781117,0.0015122001,0.00016912156,0.00023169164,0.000021235903,0.00029818676,0.027005892],"genre_scores_gemma":[0.78190297,0.000044787022,0.21684445,0.0006201536,0.00005676152,0.000020021484,0.000012744112,0.000015819951,0.00048230414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982092,0.00002984263,0.00037546063,0.0005979705,0.00046593326,0.00032162352],"domain_scores_gemma":[0.9989075,0.00011787771,0.00015932611,0.00016737159,0.00051668374,0.00013124352],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004348234,0.00026518843,0.00023407675,0.0001827456,0.00021040435,0.0011893365,0.0007330422,0.00012247213,0.00005183186],"category_scores_gemma":[0.00018925915,0.00022812832,0.000070284426,0.0001302782,0.00015831518,0.0010349193,0.00008115385,0.0002459739,0.0000078276935],"study_design_candidate":"design_other","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.00007040913,0.00025101576,0.000045253473,0.00008845064,0.000017687526,0.00006250589,0.00016735258,0.00003316851,0.03547152,0.09490722,0.00044843796,0.868437],"study_design_scores_gemma":[0.00082647376,0.0006903293,0.00007700418,0.0003553496,0.000018457105,0.00023590948,0.000069892645,0.57062507,0.035330433,0.38884428,0.0023612187,0.0005655838],"about_ca_topic_score_codex":0.0000053597378,"about_ca_topic_score_gemma":0.0000015658215,"teacher_disagreement_score":0.8678714,"about_ca_system_score_codex":0.00006294607,"about_ca_system_score_gemma":0.00014278173,"threshold_uncertainty_score":0.99984753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035248225,0.00018082322,0.99773943,0.0008392536,0.000018634428,0.0006076747,0.0000015515931,0.00017305429,0.00008707415],"genre_scores_gemma":[0.08559372,0.000008613357,0.9139658,0.0001800657,0.000014470752,0.00016138298,6.5744143e-7,0.000009252025,0.00006601824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991069,0.00007776837,0.000263757,0.0002875622,0.00013572769,0.0001283146],"domain_scores_gemma":[0.99887437,0.00036426933,0.00021020726,0.00024598144,0.00027480064,0.00003039243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011376874,0.00008746543,0.00016691786,0.00010845054,0.0000633397,0.00009715063,0.00046966778,0.000041839518,7.147709e-7],"category_scores_gemma":[0.00024348406,0.00006481017,0.000024238627,0.0003234594,0.000035793782,0.0007331996,0.00014905442,0.000039659397,0.000001134537],"study_design_candidate":"design_other","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.0000028440654,0.000030083354,0.0000037723003,0.00004670751,0.000008762761,9.529402e-8,0.0016883514,0.000046957208,0.03372463,0.0011255022,0.0000655473,0.9632568],"study_design_scores_gemma":[0.00007119465,0.00007577483,0.00001527464,0.000030197358,0.0000062300064,0.0000060151847,0.000021845297,0.5917441,0.40324646,0.004677295,0.000048937956,0.000056629713],"about_ca_topic_score_codex":0.00000555702,"about_ca_topic_score_gemma":9.903099e-8,"teacher_disagreement_score":0.9632001,"about_ca_system_score_codex":0.000010464119,"about_ca_system_score_gemma":0.000015610447,"threshold_uncertainty_score":0.26428822},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063370296,0.000011509922,0.688838,0.002731114,0.000119369164,0.00003146519,5.0475222e-8,0.0006274604,0.30700734],"genre_scores_gemma":[0.5390194,5.4226905e-7,0.45818633,0.001310144,0.000023950473,0.0000049648684,6.364898e-8,0.0000029807143,0.0014516145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995572,0.0000055547407,0.000065395674,0.000139474,0.000111148234,0.00012124023],"domain_scores_gemma":[0.99940014,0.000041910465,0.000021815327,0.00048014385,0.00003949113,0.000016480788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001110699,0.000050919745,0.00003673945,0.000011201037,0.00008427004,0.00058074686,0.0011076008,0.000021118363,0.000012158794],"category_scores_gemma":[0.000049687522,0.000028950079,0.000020968166,0.00015650733,0.000056703026,0.0013018071,0.00033398956,0.00012706913,0.00006640121],"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":[1.7633474e-7,0.000015843207,0.000055698016,0.0000023098503,0.000001896644,0.000003348761,0.0003459827,2.2821827e-7,0.0057102144,0.8086035,0.011862232,0.17339855],"study_design_scores_gemma":[0.00004536167,0.000018648374,0.0001661098,0.000006864052,0.0000012565118,0.000047784877,0.000013786274,0.008069454,0.15768415,0.64117986,0.19261158,0.00015516767],"about_ca_topic_score_codex":0.000017239208,"about_ca_topic_score_gemma":0.000008315254,"teacher_disagreement_score":0.5383857,"about_ca_system_score_codex":0.0000027288593,"about_ca_system_score_gemma":0.00002143971,"threshold_uncertainty_score":0.56001556},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017948478,0.00003215898,0.9017986,0.00004481454,0.000062370396,0.00007758291,1.228433e-7,0.0005833442,0.079452544],"genre_scores_gemma":[0.5652409,0.000001146498,0.43443653,0.00018381867,0.0000021885946,0.000002486628,1.9427216e-7,0.0000030138988,0.00012968702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999362,0.000032297692,0.000112238304,0.0002283005,0.00013785526,0.0001273382],"domain_scores_gemma":[0.9995094,0.000029584224,0.000044463693,0.0002995978,0.000077043245,0.000039942923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015225982,0.00006231473,0.00006681096,0.000060637838,0.000056197972,0.00036599633,0.00029481685,0.00002369396,0.000020245974],"category_scores_gemma":[0.00010547113,0.00005792045,0.000028498689,0.00037359193,0.00003625069,0.0015379479,0.00007938345,0.000038489805,0.000012435607],"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.0000014254383,0.00010792586,0.005021629,0.000025974352,0.000008663374,0.000024084977,0.0001868999,0.000013009391,0.021260645,0.84753364,0.0013183934,0.12449768],"study_design_scores_gemma":[0.00017876546,0.000038091974,0.00045396952,0.000061547275,0.000004211845,0.00007517491,0.000019163112,0.10588167,0.4617888,0.43074417,0.00044078092,0.00031364823],"about_ca_topic_score_codex":0.000014124976,"about_ca_topic_score_gemma":0.0000011099739,"teacher_disagreement_score":0.5472925,"about_ca_system_score_codex":0.000015408266,"about_ca_system_score_gemma":0.000045908728,"threshold_uncertainty_score":0.35293108},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032112098,0.000055703724,0.98972684,0.0044675996,0.000051879455,0.00026808772,0.000014440896,0.0006528937,0.00155133],"genre_scores_gemma":[0.22228374,0.000016260921,0.75486225,0.02193673,0.0002663737,0.00044532973,0.00008110151,0.000036723948,0.000071491406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988564,0.000032214346,0.00021244453,0.00044126136,0.00022308707,0.00023459332],"domain_scores_gemma":[0.99945086,0.00008239253,0.00011848451,0.00022370068,0.0000736029,0.000050951872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013689777,0.0001628354,0.00011482851,0.00015094364,0.00012037305,0.00048063975,0.0003262554,0.000046947353,0.000005994022],"category_scores_gemma":[0.000012517248,0.00016812858,0.00003431687,0.00019027575,0.000037132882,0.0008530632,0.00011273803,0.00014419894,0.00020094136],"study_design_candidate":"design_other","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.0000013603341,0.000044392506,0.000046135043,0.000021755795,0.00000359095,0.0000148520885,0.000049917955,0.0000068567656,0.0015369775,0.00006112116,0.0011475448,0.9970655],"study_design_scores_gemma":[0.004521782,0.0007052801,0.009910324,0.0018318951,0.00011638483,0.00079853815,0.000037910548,0.64539856,0.15078112,0.1319928,0.048277043,0.0056283437],"about_ca_topic_score_codex":0.000018012171,"about_ca_topic_score_gemma":0.0000010616686,"teacher_disagreement_score":0.99143714,"about_ca_system_score_codex":0.000033608645,"about_ca_system_score_gemma":0.000010869457,"threshold_uncertainty_score":0.68560845},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003905527,0.00033253606,0.94247293,0.0005665242,0.0000600279,0.00009067236,9.4176795e-7,0.000495811,0.052074995],"genre_scores_gemma":[0.45614251,0.0000036758206,0.54346925,0.00027939302,0.00001600716,0.000006686196,0.000001192329,0.000004298583,0.000076996745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987642,0.000066140754,0.00018081015,0.00023557943,0.0006515294,0.00010170974],"domain_scores_gemma":[0.9990595,0.00002478009,0.000081741244,0.00042959084,0.0003652331,0.0000391451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083377294,0.000070759605,0.000093593495,0.00005963801,0.00002808148,0.0001960438,0.0005930505,0.000028557433,0.00011892733],"category_scores_gemma":[0.00010093773,0.000061250495,0.000024771463,0.00019759928,0.000027843296,0.0018954533,0.00014684389,0.000048245296,0.00002986231],"study_design_candidate":"design_other","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":[1.4740084e-7,0.00006817447,0.000019145022,0.0000019372078,0.000004656375,8.693004e-7,0.0005457182,0.000011355455,0.0009742305,0.0029446369,0.0006681308,0.994761],"study_design_scores_gemma":[0.000085705404,0.000044548196,0.00019256567,0.000023364308,0.000008379619,0.0000019990568,0.000008680729,0.8455234,0.041768998,0.1121086,0.00015183262,0.00008192012],"about_ca_topic_score_codex":0.00006053454,"about_ca_topic_score_gemma":0.0000025592828,"teacher_disagreement_score":0.9946791,"about_ca_system_score_codex":0.000029536013,"about_ca_system_score_gemma":0.000022838918,"threshold_uncertainty_score":0.24977228},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007996637,0.0009700159,0.9950499,0.00035398864,0.0009470263,0.00082186173,0.000022313734,0.0004893098,0.0013376207],"genre_scores_gemma":[0.027889254,0.00002584383,0.97066367,0.000756002,0.0001597772,0.000026279577,0.00001095601,0.00004023632,0.0004280003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671584,0.000018922156,0.00051727623,0.0013195212,0.00068757986,0.0007408523],"domain_scores_gemma":[0.99769276,0.00032395707,0.00038955905,0.0010352464,0.00037593764,0.00018254454],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000917459,0.00052706234,0.00045204442,0.0003123028,0.00023033383,0.0011355694,0.0027894806,0.00024699993,0.0000063994826],"category_scores_gemma":[0.00011186997,0.000504444,0.00012878931,0.00035354917,0.0009878511,0.0019162162,0.0008767612,0.00042731446,0.000021591626],"study_design_candidate":"design_other","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.000004370477,0.000045855995,0.000029018809,0.000084122694,0.0000073986307,0.000010727304,0.0004158433,0.0012265309,0.00087435043,0.02654698,0.000035877805,0.9707189],"study_design_scores_gemma":[0.0005151316,0.00017484878,0.000027481676,0.0006737168,0.000014176985,0.00006781314,3.163697e-7,0.7498704,0.036422685,0.2078841,0.0031421385,0.0012071761],"about_ca_topic_score_codex":0.0000048465354,"about_ca_topic_score_gemma":0.000016911446,"teacher_disagreement_score":0.96951175,"about_ca_system_score_codex":0.0003861783,"about_ca_system_score_gemma":0.00042559922,"threshold_uncertainty_score":0.99990135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05562886,0.00032170044,0.9322491,0.0012869915,0.000043542328,0.0000707165,0.0000010422025,0.0004407524,0.009957254],"genre_scores_gemma":[0.7193052,0.000015587324,0.27969718,0.00030843716,0.000006906138,0.0000055451737,7.8178243e-7,0.000004916045,0.00065542705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993876,0.000014843033,0.00012772951,0.00021018554,0.00011289588,0.0001467065],"domain_scores_gemma":[0.9997494,0.000023659002,0.000026019838,0.00014484224,0.00001970776,0.000036369463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011640865,0.00007638607,0.000078790836,0.00007473057,0.00007039586,0.0007680625,0.00022824055,0.000036556572,0.000010074791],"category_scores_gemma":[0.000030831845,0.00007043314,0.00001186871,0.00020727255,0.000104247134,0.0012417706,0.00009877197,0.00006848179,0.000010765072],"study_design_candidate":"design_other","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.000019318586,0.0005306118,0.00425784,0.000100289224,0.000016033622,0.00008615649,0.010477851,0.0000065124204,0.016787969,0.077034265,0.053524163,0.837159],"study_design_scores_gemma":[0.0012885287,0.00042658203,0.0012150848,0.00018458813,0.0000042855154,0.000077155375,0.00020893225,0.6774091,0.05981978,0.17117693,0.087181844,0.0010071691],"about_ca_topic_score_codex":0.00006769103,"about_ca_topic_score_gemma":0.000037332462,"teacher_disagreement_score":0.83615184,"about_ca_system_score_codex":0.000020067617,"about_ca_system_score_gemma":0.000011639949,"threshold_uncertainty_score":0.74064445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13799165,0.0000136072495,0.85506696,0.00003547576,0.000022952352,0.00017710739,6.6055e-7,0.00013308472,0.006558511],"genre_scores_gemma":[0.6383429,0.0000019075646,0.36152536,0.000059153503,0.0000017365583,0.000018715013,0.0000013107934,0.0000024057908,0.000046477904],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99946904,0.0000118919,0.00014245404,0.00018512426,0.00008501703,0.00010645331],"domain_scores_gemma":[0.9997019,0.000053043786,0.000049553135,0.000102045684,0.00006465239,0.00002879448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017473211,0.00006402683,0.00008523549,0.000050264767,0.00003527325,0.00009726037,0.00011910795,0.000037107955,0.0000017435057],"category_scores_gemma":[0.00006209904,0.000050746807,0.000023705097,0.0001135644,0.000036208236,0.0008366806,0.000017286116,0.000024228322,2.3318478e-7],"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.00008245666,0.0002759172,0.0013128852,0.00028353513,0.000018366016,0.000014498435,0.0025096764,0.000008405644,0.18259607,0.12960735,0.00020189716,0.68308896],"study_design_scores_gemma":[0.000398195,0.0005759246,0.0014036031,0.00003906925,0.0000059737763,0.000069600224,0.000029081095,0.01140974,0.9152402,0.07061771,0.00006634669,0.00014449988],"about_ca_topic_score_codex":0.0000016418892,"about_ca_topic_score_gemma":5.225539e-7,"teacher_disagreement_score":0.7326442,"about_ca_system_score_codex":0.000010420504,"about_ca_system_score_gemma":0.000020731099,"threshold_uncertainty_score":0.20693947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40076968,0.00005589241,0.4960298,0.0001324203,0.00005029036,0.00034537568,0.0000054448305,0.0004081709,0.10220292],"genre_scores_gemma":[0.89489335,0.000008909885,0.104815714,0.000040509025,0.0000062781314,0.0000022824393,0.0000013244651,0.0000058311184,0.00022579233],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991607,0.000013022988,0.00030401142,0.00020099647,0.00015951353,0.00016172239],"domain_scores_gemma":[0.99932754,0.00013356953,0.00017919076,0.00019180164,0.00012694362,0.000040963656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004985011,0.00008327103,0.00016102321,0.00013906822,0.000029749977,0.00007431651,0.00019505483,0.000028511784,0.000018796462],"category_scores_gemma":[0.000046324887,0.00007686434,0.000025688809,0.00018039206,0.000028923681,0.00066063827,0.000036672467,0.00003826275,0.000002137084],"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.000025768986,0.000086718115,0.00052236137,0.00025951568,0.000025239053,0.000012028178,0.0029185007,0.000011785606,0.5158715,0.009153602,0.00049843895,0.47061452],"study_design_scores_gemma":[0.0001907974,0.00020735087,0.0012836024,0.00016909334,0.000003837888,0.0000065531262,0.00021351446,0.0023455992,0.9921322,0.0033444143,0.000010479416,0.00009256988],"about_ca_topic_score_codex":0.00025562485,"about_ca_topic_score_gemma":0.000031458163,"teacher_disagreement_score":0.49412367,"about_ca_system_score_codex":0.000020665666,"about_ca_system_score_gemma":0.000037545327,"threshold_uncertainty_score":0.31344366},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002635972,0.00052509113,0.95269734,0.04157766,0.00023664645,0.00048826617,0.00006409974,0.0015377532,0.0028468017],"genre_scores_gemma":[0.010774819,0.00018861415,0.79113317,0.19462402,0.0006973051,0.0004415949,0.000066488305,0.00026024767,0.0018137452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964622,0.00011703065,0.0006170271,0.0012964207,0.0007819739,0.0007253248],"domain_scores_gemma":[0.9986277,0.00013392876,0.0003499758,0.0005614326,0.00021080072,0.0001161114],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002583752,0.00073562434,0.00049994077,0.0006991971,0.00072467554,0.0028165907,0.0010105714,0.00034016807,0.000040447947],"category_scores_gemma":[0.000006424223,0.00073318364,0.00015708113,0.0006351321,0.00012501625,0.003747509,0.000015011579,0.0018733444,0.00006589663],"study_design_candidate":"design_other","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.000012480254,0.00008829683,1.5320995e-7,0.00026240977,0.000037352394,0.00014089757,0.00046562462,0.00014408666,0.00037498365,0.0000063982857,0.015440828,0.9830265],"study_design_scores_gemma":[0.0033930864,0.001165091,0.000008593319,0.0035888867,0.0004203065,0.00088206615,0.00010515689,0.8227591,0.09679232,0.016506374,0.049497012,0.0048819967],"about_ca_topic_score_codex":0.00004467804,"about_ca_topic_score_gemma":0.0000042507886,"teacher_disagreement_score":0.97814447,"about_ca_system_score_codex":0.00014513824,"about_ca_system_score_gemma":0.0002190705,"threshold_uncertainty_score":0.9995119},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077852845,0.000051538325,0.9533214,0.00096930406,0.000070614806,0.00015103527,0.000002284192,0.0012195957,0.043435723],"genre_scores_gemma":[0.42898813,0.0000038979792,0.56846446,0.00041907912,0.000027145761,0.00006093798,0.0000019547838,0.000006745395,0.002027686],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995269,0.0000043585646,0.00008979971,0.0001797917,0.00007044318,0.00012866163],"domain_scores_gemma":[0.999633,0.00005560507,0.000026911739,0.00017215902,0.00008103669,0.000031255146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060878352,0.000059834423,0.000057465415,0.000047247147,0.000045623245,0.0003217525,0.00032104814,0.000025015761,0.00003642916],"category_scores_gemma":[0.00006553788,0.000052150375,0.000029275254,0.00012541968,0.000014899678,0.001041886,0.000058726528,0.000024701381,0.00015599663],"study_design_candidate":"design_other","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.0000010760372,0.0000772998,0.000019470135,0.000025244983,0.0000048844076,0.000002040588,0.0001125616,9.924965e-8,0.00280084,0.008383283,0.048971687,0.93960154],"study_design_scores_gemma":[0.0004243056,0.00038060083,0.00012863064,0.00009648152,0.0000077483855,0.000052774147,0.000015420077,0.1648668,0.44810984,0.36269525,0.022605736,0.0006164269],"about_ca_topic_score_codex":0.0000017010876,"about_ca_topic_score_gemma":4.8409413e-7,"teacher_disagreement_score":0.9389851,"about_ca_system_score_codex":0.0000109792445,"about_ca_system_score_gemma":0.000004063443,"threshold_uncertainty_score":0.31026667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017036486,0.00015485565,0.9945526,0.0014365242,0.000102078324,0.0002855632,0.000010458989,0.0008004158,0.0009538329],"genre_scores_gemma":[0.21531159,0.000022654473,0.78377557,0.0002182657,0.000059694637,0.00013991016,0.000003820866,0.000022361259,0.00044615014],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865896,0.000020422138,0.00030914476,0.00049523293,0.00025761366,0.00025860444],"domain_scores_gemma":[0.9991961,0.000082195475,0.00014646314,0.00020209962,0.00029246823,0.000080664504],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024644242,0.00019506531,0.00013925438,0.00021800242,0.0005167759,0.0011926086,0.000241188,0.00006839607,0.000005001217],"category_scores_gemma":[0.000025044648,0.00020841784,0.000058888556,0.0003601969,0.00011074407,0.005042173,0.000003967211,0.00015902086,0.000009795842],"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.00002318425,0.00017006077,0.000002793409,0.00015785405,0.00001017926,0.0000013046813,0.0003412929,0.000086004315,0.27524084,0.00012313754,0.00036672383,0.72347665],"study_design_scores_gemma":[0.0004839547,0.000091811526,0.000009114359,0.00015234388,0.00001797906,0.000049934635,0.000044988068,0.20762898,0.7876416,0.00291274,0.0006651544,0.0003014306],"about_ca_topic_score_codex":0.0000050426274,"about_ca_topic_score_gemma":0.000011639011,"teacher_disagreement_score":0.7231752,"about_ca_system_score_codex":0.00011193442,"about_ca_system_score_gemma":0.00013787187,"threshold_uncertainty_score":0.99984425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007506943,0.00007813409,0.98462963,0.0017332023,0.00006176484,0.000103608254,0.000003985838,0.00068312325,0.005199624],"genre_scores_gemma":[0.69893444,6.615842e-7,0.30002555,0.00033791285,0.000023331286,0.000015145686,0.0000020550206,0.00000957668,0.0006513388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989575,0.000016959408,0.00015423034,0.0003332767,0.00031435068,0.00022365],"domain_scores_gemma":[0.9991752,0.00020200263,0.0000840306,0.00024401754,0.00020882409,0.000085909705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012797193,0.00012333346,0.00011693532,0.00024796542,0.00008513126,0.00026594513,0.0006108166,0.000031915257,0.000014625224],"category_scores_gemma":[0.000061357234,0.000079691075,0.000030885527,0.0006980886,0.00011865674,0.001168445,0.00022912578,0.000058092468,0.00014767493],"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.000025204548,0.00028072644,0.0046362253,0.00006771785,0.00007696253,0.00008582148,0.0003075048,0.00036576236,0.0022144443,0.3507881,0.008440273,0.6327113],"study_design_scores_gemma":[0.003362471,0.0008484786,0.028847128,0.0012519881,0.00002729495,0.0009751271,0.00003779926,0.060573146,0.02964513,0.8529101,0.019313186,0.002208122],"about_ca_topic_score_codex":0.0000013187079,"about_ca_topic_score_gemma":2.1511022e-7,"teacher_disagreement_score":0.69142747,"about_ca_system_score_codex":0.00004747619,"about_ca_system_score_gemma":0.00015612583,"threshold_uncertainty_score":0.32497075},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008078012,0.00046158422,0.97264504,0.0013229796,0.000024584595,0.00020841406,0.0000014509427,0.00063204544,0.01662587],"genre_scores_gemma":[0.6194386,0.000018490946,0.38026002,0.00012951011,0.000019148287,0.000021264426,0.0000013819143,0.00001475674,0.00009686079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983083,0.000024561268,0.00039064587,0.0003385142,0.00027852223,0.00065943255],"domain_scores_gemma":[0.9988669,0.0002231999,0.00012768764,0.00067046087,0.00004858768,0.00006313998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044714328,0.00021225313,0.00024243312,0.00018730765,0.00005129619,0.0002989773,0.0012086326,0.00007243346,0.00001579849],"category_scores_gemma":[0.0002846789,0.00019407718,0.00007623956,0.00055117643,0.00012736498,0.00089751923,0.00025147657,0.0002693633,0.000049860748],"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.000002749146,0.00020043699,0.00010537872,0.00007024292,0.00001808405,0.000011851815,0.0008508584,0.000028515455,0.0013981274,0.79813766,0.00015608004,0.19902003],"study_design_scores_gemma":[0.00037196797,0.00012574467,0.00004626869,0.0001491776,0.00000796747,0.00008580123,0.00001855773,0.10945557,0.048210792,0.8398911,0.0011597226,0.00047734004],"about_ca_topic_score_codex":0.00000410625,"about_ca_topic_score_gemma":0.000049272316,"teacher_disagreement_score":0.61136055,"about_ca_system_score_codex":0.00014544082,"about_ca_system_score_gemma":0.00016718639,"threshold_uncertainty_score":0.7914238},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48325062,0.00055166136,0.00016714401,0.00014420564,0.0044444446,0.0015716134,0.00095397775,0.0057784785,0.5031378],"genre_scores_gemma":[0.7996879,0.00005423716,0.15846246,0.00083331385,0.00016999751,0.0003888719,0.0013604228,0.00045192646,0.038590852],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9936426,0.00021650548,0.0012007189,0.0020723962,0.0016803048,0.0011874762],"domain_scores_gemma":[0.9957955,0.00026074096,0.0007335391,0.0017654654,0.0008882874,0.0005564726],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009992078,0.0011528883,0.0010291345,0.0008774295,0.00084847515,0.0011537353,0.0043248497,0.0008594583,0.000047388534],"category_scores_gemma":[0.00095050543,0.001241374,0.00037071516,0.0016688567,0.0000889919,0.0035209474,0.0007781788,0.0014256325,0.0008087326],"study_design_candidate":"design_other","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.0001025498,0.0005020429,0.000013609952,0.00044793732,0.000113296184,0.0003380592,0.000018695115,0.000050855135,0.06755418,0.14213598,0.0006913423,0.78803146],"study_design_scores_gemma":[0.00077526784,0.0004329867,0.00042635246,0.0011328117,0.000119244774,0.00006486624,0.000027279553,0.00045041862,0.640088,0.1960901,0.15719692,0.0031957035],"about_ca_topic_score_codex":0.0003094931,"about_ca_topic_score_gemma":0.0016214142,"teacher_disagreement_score":0.78483576,"about_ca_system_score_codex":0.0005628607,"about_ca_system_score_gemma":0.00016260732,"threshold_uncertainty_score":0.99996924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2274368,0.0012636731,0.73834,0.01274903,0.00016514213,0.00013805037,0.000015237828,0.00032723817,0.019564824],"genre_scores_gemma":[0.7606609,0.001063353,0.22529158,0.00015714468,0.000046991645,2.7984444e-7,0.0000035993462,0.000013668539,0.01276248],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846005,0.0001459331,0.00015269074,0.0004013582,0.0002615208,0.00057845155],"domain_scores_gemma":[0.99881554,0.0000632247,0.00020987657,0.0004516385,0.00022081341,0.00023888811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041568064,0.00019231309,0.00023976521,0.0002513454,0.00036246877,0.00035022935,0.0009839445,0.0001811637,0.00010153367],"category_scores_gemma":[0.000021114032,0.0002739521,0.00014834388,0.0009711996,0.0009322462,0.002498603,0.00035748704,0.00018326213,0.000051374675],"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.00022755034,0.0013803211,0.12570782,0.00068829244,0.00028551096,0.0022190697,0.024697471,0.00029871293,0.02038296,0.3018499,0.038214173,0.48404825],"study_design_scores_gemma":[0.0030074676,0.00232817,0.2420372,0.002225415,0.0006723066,0.0014420303,0.0076148617,0.103284284,0.03067753,0.2940548,0.3093792,0.0032767223],"about_ca_topic_score_codex":0.0014563713,"about_ca_topic_score_gemma":0.0002457552,"teacher_disagreement_score":0.5332241,"about_ca_system_score_codex":0.00014784491,"about_ca_system_score_gemma":0.0002928551,"threshold_uncertainty_score":0.9999713},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032107867,0.0003087707,0.9484377,0.000791246,0.00068789546,0.001444215,0.00017123159,0.0015498715,0.014501224],"genre_scores_gemma":[0.1936907,0.00003318188,0.8032421,0.0012202114,0.00017379044,0.00025819984,0.00014182676,0.00007906558,0.001160903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967392,0.000032630713,0.0010219311,0.00049621315,0.00076091813,0.00094909535],"domain_scores_gemma":[0.99725235,0.000096348595,0.0004462476,0.0010206685,0.00064071995,0.0005436423],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009908968,0.00054190296,0.00053637446,0.00034292348,0.0002679585,0.0019881586,0.0018428655,0.00025080482,0.0000031674367],"category_scores_gemma":[0.00025043904,0.0004910209,0.00015138178,0.00048703954,0.00027990554,0.0065771756,0.0014758683,0.00041771567,0.00009179355],"study_design_candidate":"design_other","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.0003275744,0.00197331,0.005836748,0.0025196706,0.00047867704,0.00014680914,0.058573805,0.00023265956,0.00030781026,0.040924527,0.13724591,0.7514325],"study_design_scores_gemma":[0.0066581587,0.0024304772,0.00037234987,0.0007946363,0.00009556692,0.0013411146,0.0023321228,0.59892833,0.01955982,0.019882083,0.34461907,0.0029862947],"about_ca_topic_score_codex":0.000010292764,"about_ca_topic_score_gemma":0.0000022398176,"teacher_disagreement_score":0.7484462,"about_ca_system_score_codex":0.00015999771,"about_ca_system_score_gemma":0.00021497576,"threshold_uncertainty_score":0.99975413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5919047,0.00085810554,0.36868936,0.00043788986,0.025415646,0.0004318719,0.000003970762,0.00031264845,0.011945796],"genre_scores_gemma":[0.81280714,0.000007099049,0.18681723,0.000016185943,0.00032558083,7.932191e-7,4.6575488e-7,0.0000226768,0.0000028181844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967125,0.00011045753,0.0015179506,0.0002597739,0.0010362569,0.00036306004],"domain_scores_gemma":[0.99505347,0.00057766977,0.0020330653,0.00041618323,0.0015921151,0.00032749228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002640284,0.00030470247,0.000915798,0.00030963047,0.000117218886,0.0005471861,0.001300458,0.00015641944,9.3976035e-7],"category_scores_gemma":[0.0015136318,0.00027619922,0.00017271376,0.0005582694,0.00019761237,0.0010679556,0.0008018189,0.00044861392,0.0000014743791],"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.000031248605,0.00037432488,0.0003451587,0.00018459799,0.000065286324,0.000041411968,0.0012815166,0.0000061531828,0.00024263575,0.97423136,0.0005020844,0.022694193],"study_design_scores_gemma":[0.0026982327,0.0009122233,0.00001733981,0.00055572204,0.000043250275,0.000488274,0.0004196469,0.011563373,0.007860003,0.9748676,0.00025516024,0.00031919027],"about_ca_topic_score_codex":0.000006879997,"about_ca_topic_score_gemma":1.251644e-7,"teacher_disagreement_score":0.22090244,"about_ca_system_score_codex":0.00012268728,"about_ca_system_score_gemma":0.00043101615,"threshold_uncertainty_score":0.999969},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022311945,0.0003901196,0.9526915,0.0006517646,0.0001386222,0.000072418945,0.0000040201135,0.00016336866,0.04566507],"genre_scores_gemma":[0.6326811,0.000015623662,0.36714816,0.00007731056,0.00001220534,0.000014879442,0.0000012172526,0.0000037086108,0.00004584628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991899,0.000029229446,0.00022761751,0.00019372873,0.000208704,0.00015083305],"domain_scores_gemma":[0.9992563,0.000058588936,0.00010681552,0.0003605859,0.00014953334,0.00006817259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025979418,0.00007533992,0.000119859295,0.00012516699,0.000027012848,0.000066642235,0.0006018273,0.000049343536,0.000002600157],"category_scores_gemma":[0.0003645056,0.000073143296,0.000026053036,0.00057028525,0.00007021921,0.0023941724,0.00015362876,0.0001093855,0.00001267031],"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.0000016839738,0.00013212026,0.000550092,0.000013346428,0.0000028422455,0.0000033467506,0.0006770024,0.00032175562,0.00012005788,0.95096815,0.00024499287,0.04696461],"study_design_scores_gemma":[0.0006115742,0.00017303832,0.0012375688,0.0001234564,0.0000070897345,0.000020369705,0.000056397057,0.12954564,0.014357729,0.826334,0.027129842,0.00040330066],"about_ca_topic_score_codex":0.000045687804,"about_ca_topic_score_gemma":0.000047989422,"teacher_disagreement_score":0.6324579,"about_ca_system_score_codex":0.00006118462,"about_ca_system_score_gemma":0.00010297805,"threshold_uncertainty_score":0.2982697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9607006,0.0001304564,0.03136331,0.0007571376,0.0010171839,0.00027863155,0.0000059185104,0.0010840108,0.0046627624],"genre_scores_gemma":[0.9872475,0.000017830735,0.012476353,0.00012337933,0.000007444399,0.000027152844,0.000010013914,0.000024182084,0.00006609739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829507,0.0000490595,0.0004257225,0.00042652554,0.00047959902,0.00032400934],"domain_scores_gemma":[0.99807554,0.00005679473,0.00030923192,0.00075449556,0.0006383245,0.00016562646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005685229,0.00021224878,0.00028395804,0.00044970223,0.00006013632,0.000333169,0.0012296808,0.00011650026,0.0000021533265],"category_scores_gemma":[0.00028761796,0.00021624593,0.000090092064,0.0023087214,0.00010106147,0.0016898295,0.0004114828,0.00016619124,0.000019293411],"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.000016278662,0.00031637654,0.0127805825,0.00009660007,0.00003313542,0.000010206558,0.0006373088,3.163929e-7,0.09683382,0.8835283,0.0011000562,0.0046470235],"study_design_scores_gemma":[0.00048520605,0.00046736805,0.0062894574,0.00027830302,0.000019800058,0.00003209552,0.000030812036,0.0015670507,0.13162404,0.8581543,0.0005584789,0.00049310934],"about_ca_topic_score_codex":0.00003224823,"about_ca_topic_score_gemma":0.0000018273868,"teacher_disagreement_score":0.034790225,"about_ca_system_score_codex":0.000029457871,"about_ca_system_score_gemma":0.00012623664,"threshold_uncertainty_score":0.8818253},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5633743,0.0006420859,0.046136286,0.002563235,0.0062472005,0.0011058844,0.000017305858,0.0056813755,0.37423232],"genre_scores_gemma":[0.9682237,0.0000035789712,0.030654917,0.00060839107,0.00001486691,0.000027794065,0.0000032361638,0.000024050853,0.0004394924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986427,0.0000419751,0.00015614758,0.00032531758,0.00037540076,0.0004584861],"domain_scores_gemma":[0.9988041,0.00007573759,0.000095083495,0.0007152004,0.00013762563,0.00017226748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025493058,0.00018441888,0.00017214053,0.000101087375,0.00009851454,0.0003336512,0.0009245641,0.0000612164,0.000008164404],"category_scores_gemma":[0.00007323149,0.00016167898,0.000038368908,0.00036090543,0.00007175287,0.0017321237,0.00025778034,0.00016369582,0.0005495715],"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.000021442853,0.00055310037,0.004394445,0.00003589224,0.000025774172,0.000025992598,0.00040785334,2.581297e-7,0.00034401056,0.9554348,0.018549243,0.020207198],"study_design_scores_gemma":[0.0014153426,0.0012781541,0.01091974,0.00038683618,0.000019138828,0.0000991174,0.00001682577,0.00073540147,0.06662217,0.8806182,0.03668444,0.0012046469],"about_ca_topic_score_codex":0.0000066078755,"about_ca_topic_score_gemma":3.8569405e-7,"teacher_disagreement_score":0.40484938,"about_ca_system_score_codex":0.000058845275,"about_ca_system_score_gemma":0.00004998493,"threshold_uncertainty_score":0.70638126},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12957516,0.0001534109,0.6265801,0.0028284318,0.004735333,0.0004159232,0.0000020123525,0.004744276,0.23096532],"genre_scores_gemma":[0.9589207,0.000004136627,0.039979525,0.0008371502,0.000006251572,0.000015252354,0.0000014486466,0.000015147826,0.00022039909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986053,0.000062720384,0.00019417504,0.0004402172,0.00039014363,0.00030744073],"domain_scores_gemma":[0.9987941,0.00009920186,0.00009911052,0.00077452546,0.0001240575,0.00010903366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003725224,0.00017083877,0.00016294666,0.00015921475,0.00011737935,0.0005530192,0.0015081898,0.00007154322,0.000005069639],"category_scores_gemma":[0.00017824642,0.00016129983,0.00007060365,0.0005059485,0.00009447287,0.00091391994,0.000271328,0.00016617173,0.00015014652],"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.0000016194275,0.00007089757,0.000060205217,0.0000072796024,0.0000051226916,0.000008872725,0.000028239967,0.0000022045058,0.0004157002,0.9437325,0.0025026798,0.053164706],"study_design_scores_gemma":[0.00020195007,0.00020660338,0.00021067954,0.000043603606,0.0000027399594,0.000008908616,9.028762e-7,0.0018544993,0.008073835,0.98548657,0.003700368,0.00020936895],"about_ca_topic_score_codex":0.000010049533,"about_ca_topic_score_gemma":8.140057e-7,"teacher_disagreement_score":0.8293455,"about_ca_system_score_codex":0.000032131444,"about_ca_system_score_gemma":0.000054513763,"threshold_uncertainty_score":0.65776163},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7593499,0.00050163275,0.20581484,0.0036562234,0.007953758,0.001459228,0.0000107856185,0.0018008987,0.019452738],"genre_scores_gemma":[0.9494259,0.0000036863503,0.050269727,0.000111862595,0.000009916793,0.00005541992,6.986165e-7,0.00001539472,0.00010742634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895334,0.000016355487,0.00026076217,0.000274846,0.00023320096,0.00026146954],"domain_scores_gemma":[0.99830157,0.00045406263,0.00018186786,0.00079562695,0.00021457412,0.000052326122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057185075,0.0001319736,0.00015985638,0.00008682792,0.0001433982,0.0002522741,0.0016996448,0.00007155659,0.0000018861582],"category_scores_gemma":[0.00033474583,0.000100471996,0.000106391635,0.0004022502,0.00016932315,0.0006195998,0.0003483572,0.00021096405,0.0000045443408],"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.0000027766926,0.000055778233,0.0006157742,0.000030242398,0.000011210977,9.723934e-7,0.00012144038,2.728572e-7,0.007036924,0.96683496,0.001727161,0.023562482],"study_design_scores_gemma":[0.00021162281,0.0000849945,0.0010106674,0.000029572577,0.000009676921,0.000008779535,0.00001686393,0.0048677325,0.06256956,0.9283383,0.002699359,0.00015288193],"about_ca_topic_score_codex":0.000011732038,"about_ca_topic_score_gemma":0.0000038094977,"teacher_disagreement_score":0.19007598,"about_ca_system_score_codex":0.000009451625,"about_ca_system_score_gemma":0.000059310263,"threshold_uncertainty_score":0.4097129},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6222976,0.0014104424,0.09321367,0.0076442664,0.010195209,0.000775282,0.0000051265592,0.010391881,0.2540665],"genre_scores_gemma":[0.97401553,0.0000059864856,0.025262425,0.0005155215,0.000006648212,0.000020066705,0.0000020195944,0.0000132581945,0.00015852552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876904,0.000038810053,0.00019446088,0.0003496883,0.00034929885,0.0002986736],"domain_scores_gemma":[0.9988877,0.000029703657,0.0001005741,0.00058937137,0.00019849565,0.00019416508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040395884,0.00014770984,0.00015596129,0.00013487806,0.00006655301,0.00060518057,0.001307896,0.000059535083,0.000001512882],"category_scores_gemma":[0.00012789025,0.00014469083,0.00004517534,0.0006308447,0.0000797986,0.002260501,0.0003988125,0.00013935224,0.00010223575],"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.0000020323641,0.00007489826,0.0010562902,0.00001008964,0.0000080339305,0.000050439645,0.00045787197,2.3383912e-7,0.0019263853,0.9757762,0.003281679,0.017355848],"study_design_scores_gemma":[0.00023278105,0.00009144067,0.00033134455,0.000037390302,0.0000024423534,0.000033588927,0.000016987788,0.00097434275,0.019360138,0.9733866,0.005292452,0.0002404878],"about_ca_topic_score_codex":0.0000127253425,"about_ca_topic_score_gemma":4.0566454e-7,"teacher_disagreement_score":0.35171795,"about_ca_system_score_codex":0.00006061374,"about_ca_system_score_gemma":0.00014926701,"threshold_uncertainty_score":0.59003204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36466375,0.0027562522,0.45791945,0.002455949,0.009050839,0.0006453307,0.0000050263106,0.007233545,0.15526988],"genre_scores_gemma":[0.95066065,0.000008457401,0.048919957,0.00021655115,0.000014010819,0.000014645898,0.0000016395871,0.000013215723,0.00015089182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987107,0.00004173156,0.0001964415,0.00025578315,0.00033059402,0.0004647311],"domain_scores_gemma":[0.99899787,0.000045638197,0.00009202672,0.0005792535,0.00010289238,0.00018231063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039827183,0.00015111157,0.00015018454,0.00013188063,0.00010735211,0.0003783908,0.001247246,0.00007133133,0.0000059787726],"category_scores_gemma":[0.00006719677,0.00014613985,0.00006699334,0.0006033007,0.00008775488,0.0029803638,0.00038394882,0.00014246693,0.00013268934],"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":[5.738365e-7,0.00008748098,0.007844875,0.0000098162345,0.000010482831,0.0000064288515,0.00013452015,1.07615996e-7,0.0007525818,0.96286446,0.0019651563,0.026323518],"study_design_scores_gemma":[0.0001665943,0.000051354473,0.0043569487,0.00002744311,0.0000071017575,0.000025654737,0.000005918751,0.00011282271,0.019700017,0.97033703,0.0049106767,0.0002984245],"about_ca_topic_score_codex":0.000008323851,"about_ca_topic_score_gemma":2.0374424e-7,"teacher_disagreement_score":0.5859969,"about_ca_system_score_codex":0.00003646632,"about_ca_system_score_gemma":0.000058507154,"threshold_uncertainty_score":0.595941},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18189187,0.0019052089,0.49097535,0.01530236,0.0060409214,0.000999962,0.0000047151534,0.012326784,0.29055282],"genre_scores_gemma":[0.94374996,0.000015326546,0.055059664,0.0009316355,0.0000056492213,0.0000067027495,0.0000015966448,0.000008779068,0.00022069708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985838,0.000034215715,0.00022938335,0.0004285197,0.00036758592,0.00035652204],"domain_scores_gemma":[0.99889517,0.000025979863,0.00010057693,0.0007010456,0.00015648296,0.000120747965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024836813,0.00017658036,0.00017095885,0.00016118052,0.00012165892,0.0006727571,0.0016746747,0.000076574666,0.0000043810082],"category_scores_gemma":[0.000064381136,0.00017249491,0.0000812524,0.00075858994,0.00007443799,0.0017550021,0.00018698792,0.00016316042,0.000065084656],"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.0000014760252,0.00010047003,0.0001090855,0.0000042234064,0.000005324636,0.00005245793,0.00006314636,7.987057e-7,0.0020193544,0.9158599,0.0025511442,0.07923263],"study_design_scores_gemma":[0.00018056248,0.00016190408,0.0010459091,0.000030954518,0.000003572052,0.000028605124,0.0000026617347,0.0006624942,0.012118396,0.9841599,0.0013735272,0.00023151493],"about_ca_topic_score_codex":0.0000070209976,"about_ca_topic_score_gemma":4.9894476e-7,"teacher_disagreement_score":0.7618581,"about_ca_system_score_codex":0.00003790868,"about_ca_system_score_gemma":0.000097959666,"threshold_uncertainty_score":0.70341384},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3082239,0.00051706686,0.39893708,0.004247366,0.0070473203,0.00065647013,0.0000051371535,0.0070189796,0.2733467],"genre_scores_gemma":[0.9582465,0.0000022396816,0.041145418,0.0003794343,0.000005623959,0.000012178261,0.0000016952416,0.000012697501,0.00019416626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998669,0.000044865974,0.00017869208,0.00036593943,0.0004718245,0.00026963738],"domain_scores_gemma":[0.998843,0.00005327908,0.00008466763,0.0006259264,0.0001996292,0.00019345674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003688941,0.00014895243,0.00014935213,0.00015249247,0.0000620432,0.00050215574,0.0013735984,0.0000659022,0.0000016457757],"category_scores_gemma":[0.00017984869,0.00014018109,0.0000511975,0.00058111566,0.00008273761,0.0011164767,0.00028849966,0.00015273251,0.00015985922],"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.0000022325378,0.000068533474,0.0002131282,0.0000039939064,0.0000066060175,0.000036631474,0.00007001552,0.0000019750235,0.000088494984,0.96800804,0.007211599,0.024288734],"study_design_scores_gemma":[0.0002650486,0.00020889344,0.00012927224,0.00002904566,0.0000026652322,0.000009854013,0.0000034564337,0.00029538223,0.0051544956,0.99166965,0.0020500375,0.00018219624],"about_ca_topic_score_codex":0.000011620462,"about_ca_topic_score_gemma":4.575783e-7,"teacher_disagreement_score":0.6500226,"about_ca_system_score_codex":0.000058011494,"about_ca_system_score_gemma":0.00016164576,"threshold_uncertainty_score":0.5716419},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65441954,0.00013057658,0.29751104,0.015205281,0.0014449345,0.0007441896,0.000006059631,0.001495586,0.029042784],"genre_scores_gemma":[0.9947602,0.000007112594,0.0046374598,0.0005472609,0.0000036119336,0.0000053863473,0.0000016729559,0.0000050409685,0.000032249576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991071,0.000044589862,0.00019165104,0.00021580544,0.00028558684,0.00015522327],"domain_scores_gemma":[0.9991683,0.00004865498,0.00014025769,0.00048125722,0.00012768983,0.000033844008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024770427,0.00010665885,0.00012023008,0.00009403238,0.000076685355,0.00021712534,0.0010049263,0.000045544723,0.0000019033891],"category_scores_gemma":[0.00006881084,0.00007776561,0.00004624849,0.00057876325,0.000067524306,0.0005865872,0.00007744944,0.00009131847,0.000012075828],"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.0000022994868,0.000060328428,0.00008356776,0.0000042443703,0.0000034982636,0.000003892622,0.00011742651,0.0000014521253,0.01668193,0.9574252,0.00024005459,0.025376126],"study_design_scores_gemma":[0.000089439316,0.00020882499,0.001646319,0.00005266643,0.0000028138068,0.0000022929055,0.000001620111,0.0007669903,0.16608603,0.8309358,0.00011001273,0.00009722508],"about_ca_topic_score_codex":0.0000028437737,"about_ca_topic_score_gemma":1.0141752e-7,"teacher_disagreement_score":0.34034064,"about_ca_system_score_codex":0.000016703558,"about_ca_system_score_gemma":0.000053260683,"threshold_uncertainty_score":0.31711894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04664003,0.00006190548,0.74004495,0.0010133908,0.00003599425,0.00056929584,0.000020406987,0.0013160977,0.21029794],"genre_scores_gemma":[0.57482785,0.0000021883343,0.42480555,0.00013702869,0.0000062795343,0.000039900173,0.0000011383556,0.0000139069525,0.00016613379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858004,0.00003617545,0.000315225,0.00034556168,0.00042565176,0.00029735846],"domain_scores_gemma":[0.99873996,0.00013244167,0.0002247919,0.00062690896,0.00014989836,0.00012598018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104870625,0.00018768893,0.0003683357,0.00011800579,0.00009696004,0.00008239219,0.0007371169,0.000029464712,0.000009720007],"category_scores_gemma":[0.00015486823,0.00013860514,0.000063373554,0.0007442582,0.0007325518,0.00065769244,0.000194372,0.00013055169,0.000037067246],"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.0002424017,0.007539489,0.0061449716,0.0013706863,0.0006206616,0.0009975809,0.04816537,0.0002937978,0.0041037663,0.7611455,0.04357559,0.12580022],"study_design_scores_gemma":[0.0011077882,0.005499223,0.0060739378,0.0013039042,0.00010910516,0.0010252383,0.0012832046,0.20571092,0.041372593,0.73255837,0.0015458578,0.002409846],"about_ca_topic_score_codex":0.00023877773,"about_ca_topic_score_gemma":0.000012496344,"teacher_disagreement_score":0.5281878,"about_ca_system_score_codex":0.000040248404,"about_ca_system_score_gemma":0.00012365135,"threshold_uncertainty_score":0.5652154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7903169,0.000024050527,0.18743166,0.0023228987,0.0014279225,0.00055519445,0.0000026758782,0.0021794972,0.0157392],"genre_scores_gemma":[0.98273003,0.000005737631,0.016419522,0.0005222427,0.0000070518654,0.000058999627,0.000010141165,0.00001398334,0.00023229542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884784,0.000037998496,0.00020050736,0.00035445605,0.00030649162,0.0002526845],"domain_scores_gemma":[0.9990662,0.000032662236,0.000115145165,0.00051292777,0.00017933869,0.00009377746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013139048,0.00014896426,0.00013679413,0.00016254255,0.00009386059,0.0008575331,0.0009794335,0.000067315545,0.00001363141],"category_scores_gemma":[0.00005095782,0.0001407164,0.000048218906,0.0005375044,0.00005776758,0.002224624,0.00018504186,0.00012613543,0.00035671407],"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.0000011370405,0.000114877635,0.0007530274,0.000014061727,0.000011627145,0.000010465957,0.000089050314,3.0197774e-7,0.037691027,0.7886602,0.00075307395,0.17190114],"study_design_scores_gemma":[0.00019704098,0.0001680088,0.009517433,0.00006147608,0.0000032830806,0.000006785196,0.00000210641,0.0008468201,0.04445004,0.94313,0.0013370613,0.0002799244],"about_ca_topic_score_codex":0.000014605387,"about_ca_topic_score_gemma":1.8116293e-7,"teacher_disagreement_score":0.19241312,"about_ca_system_score_codex":0.000033571334,"about_ca_system_score_gemma":0.000052060175,"threshold_uncertainty_score":0.8269211},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33140528,0.000011876068,0.66160154,0.0026802688,0.0012182299,0.00075109187,0.000020095335,0.0011641845,0.0011474114],"genre_scores_gemma":[0.9594212,0.0000013149076,0.038608328,0.0016523376,0.000008856052,0.00015437904,0.000027091484,0.000023474577,0.00010299028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853706,0.000035086923,0.00023161041,0.00048776556,0.000392664,0.00031579577],"domain_scores_gemma":[0.9985673,0.00006285301,0.000115001174,0.00059319567,0.00041707873,0.0002445706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040602416,0.0001839341,0.00018784778,0.0002971571,0.000094539224,0.0006108617,0.0010980151,0.000076072836,5.3573217e-7],"category_scores_gemma":[0.00031280497,0.00018836351,0.000068552516,0.0009214119,0.00003716025,0.0011360532,0.00022812012,0.000095650386,0.000020683576],"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.000021568007,0.00013062274,0.0001099043,0.00001747939,0.000011583014,0.000008588109,0.00047425003,0.0000016553155,0.0076093026,0.968302,0.0018587016,0.02145434],"study_design_scores_gemma":[0.0005288933,0.0007266212,0.00038308642,0.00006537828,0.0000070638303,0.0000065153577,0.000011768205,0.0013330703,0.013554816,0.9805751,0.0024871018,0.0003205785],"about_ca_topic_score_codex":0.0000031556067,"about_ca_topic_score_gemma":0.0000011036135,"teacher_disagreement_score":0.62801594,"about_ca_system_score_codex":0.000056945206,"about_ca_system_score_gemma":0.0001306795,"threshold_uncertainty_score":0.7681241},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069717506,0.00031866253,0.98040277,0.0010121957,0.00027585478,0.00023078706,0.0000052265646,0.00023908574,0.017445702],"genre_scores_gemma":[0.15011792,0.000052227308,0.8476474,0.0015001273,0.0001734974,0.000004834743,0.0000015750173,0.00003023698,0.0004721687],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693066,0.000016233638,0.00048222768,0.0012952967,0.0008460601,0.00042950746],"domain_scores_gemma":[0.99765354,0.00038610038,0.00032713392,0.0012664874,0.00024122633,0.00012550308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055973895,0.0004358615,0.0004814274,0.00082732836,0.00010275824,0.0006170961,0.002716553,0.0002425682,0.0000027844258],"category_scores_gemma":[0.0001743954,0.00038340964,0.00007419981,0.0004810248,0.0009935946,0.0010027809,0.0015583644,0.00056168006,0.000010206178],"study_design_candidate":"design_other","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.0000075510134,0.000025882175,0.0000064495557,0.000039360326,0.0000030628369,0.00003658178,0.00034817788,0.0004684886,0.0004365717,0.020983351,0.000036528483,0.97760797],"study_design_scores_gemma":[0.00046679133,0.00084133557,0.00010279025,0.0024610036,0.000010406361,0.00018010223,8.9162825e-8,0.30259424,0.05421184,0.6328221,0.005013787,0.0012954838],"about_ca_topic_score_codex":0.00000787917,"about_ca_topic_score_gemma":0.00001623388,"teacher_disagreement_score":0.9763125,"about_ca_system_score_codex":0.00014781501,"about_ca_system_score_gemma":0.0003308789,"threshold_uncertainty_score":0.9998618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00907032,0.00050145376,0.9863839,0.0008440034,0.00020488065,0.0000559577,0.0000039179795,0.00012943168,0.0028061133],"genre_scores_gemma":[0.22102596,0.000061864564,0.7786182,0.000050680348,0.00011173476,0.000001152408,1.1862827e-7,0.0000131597435,0.00011714801],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860597,0.000042322226,0.00046898634,0.000205479,0.00041133983,0.00026588433],"domain_scores_gemma":[0.99840957,0.00016411293,0.0006971674,0.00024782275,0.00034613613,0.00013517594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004180031,0.0001561881,0.00026634193,0.00027945125,0.000074910065,0.00039694837,0.00090301683,0.000043972195,0.00001535058],"category_scores_gemma":[0.00012187041,0.00008399324,0.00009008165,0.0003845455,0.00022925547,0.003733063,0.000160209,0.00015323158,0.000009520813],"study_design_candidate":"design_other","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.000014706205,0.000029082918,0.0007706952,0.000014594264,0.00006022205,0.00023066904,0.00006329188,0.0000019205588,0.0068168165,0.00097487494,0.00037818003,0.99064493],"study_design_scores_gemma":[0.013378491,0.010438483,0.0042195744,0.017953712,0.0005467354,0.09624629,0.0016080654,0.023721604,0.5499816,0.2594145,0.016863206,0.005627768],"about_ca_topic_score_codex":0.0000015897867,"about_ca_topic_score_gemma":1.5684009e-7,"teacher_disagreement_score":0.9850172,"about_ca_system_score_codex":0.00004787381,"about_ca_system_score_gemma":0.0001846911,"threshold_uncertainty_score":0.3827782},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.2806164e-7,0.00024501426,0.11249916,0.000025943807,0.00014844496,0.00023040046,0.000046490906,0.0012711481,0.88553244],"genre_scores_gemma":[0.00015137032,0.000020527988,0.014216517,0.00006655606,0.00005148757,5.927114e-7,0.000011679201,0.000039682483,0.98544157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983871,0.000020302146,0.0001635163,0.0006985483,0.0004359335,0.00029457643],"domain_scores_gemma":[0.99792755,0.00003116238,0.00022909291,0.0011673013,0.00040049746,0.0002444198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013436185,0.00037926118,0.0003437528,0.000202067,0.00010071902,0.00032298444,0.002485178,0.0003065056,8.250212e-7],"category_scores_gemma":[0.00001575214,0.00045097648,0.00014237291,0.00001314001,0.00021385557,0.0006847298,0.0019917185,0.00040255164,0.000047038153],"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.0000068817812,0.000005771678,8.202918e-8,0.00003366714,0.000027541471,0.000233924,0.000019853293,3.7641277e-7,0.000012073933,0.8129484,0.17661823,0.010093213],"study_design_scores_gemma":[0.00017624993,0.00005244959,4.1631571e-7,0.00015269428,0.000034292385,0.000031448635,0.0000018051268,0.0002785926,0.0007603952,0.0007386263,0.99728364,0.0004893794],"about_ca_topic_score_codex":0.000022886536,"about_ca_topic_score_gemma":2.8924117e-7,"teacher_disagreement_score":0.8206654,"about_ca_system_score_codex":0.00026193954,"about_ca_system_score_gemma":0.00029339897,"threshold_uncertainty_score":0.9997942},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018520547,0.00004750422,0.9764231,0.0008079363,0.00007865069,0.00010115845,0.000019200306,0.00027713407,0.0037248041],"genre_scores_gemma":[0.66708195,0.0000023344194,0.3325861,0.00015857173,0.000010475866,0.0000074312356,0.000008474804,0.000008195471,0.00013646914],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987136,0.000048571357,0.00031164123,0.00031626807,0.00042458044,0.00018534447],"domain_scores_gemma":[0.99862456,0.00042309222,0.00020893017,0.00028490947,0.00038764812,0.000070872295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026307916,0.00013348757,0.00016745257,0.00030251188,0.000050071543,0.00011471802,0.0006689629,0.000056165685,0.000017372844],"category_scores_gemma":[0.00020374959,0.00010259656,0.0000644434,0.0006053008,0.00013230223,0.001396686,0.00026269213,0.00005705594,0.000034804085],"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.000014596909,0.00012731133,0.002923741,0.00010224808,0.000027658594,0.000020321837,0.00023574122,0.00008044389,0.0030585418,0.25685462,0.0005838288,0.735971],"study_design_scores_gemma":[0.0007628301,0.0002550647,0.029471248,0.0003763962,0.000015268419,0.00007175834,0.000016346034,0.10682425,0.043180145,0.8171672,0.0012450616,0.0006143888],"about_ca_topic_score_codex":0.000003904643,"about_ca_topic_score_gemma":3.5821796e-7,"teacher_disagreement_score":0.73535657,"about_ca_system_score_codex":0.00004408387,"about_ca_system_score_gemma":0.00010014149,"threshold_uncertainty_score":0.41837662},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077273664,0.00006420978,0.98151076,0.009024132,0.000031033505,0.00051116257,0.000002298285,0.00004012929,0.0010889131],"genre_scores_gemma":[0.8583479,0.0000016790169,0.14087585,0.00067004224,0.0000057614175,0.000026211523,1.9217003e-7,0.0000032999903,0.000069050555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953854,0.00003846089,0.00013083973,0.00010067973,0.00011789964,0.000073549454],"domain_scores_gemma":[0.9989837,0.0005064661,0.00010434713,0.00028456454,0.00011089414,0.000010057604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023257795,0.000057121404,0.000083984734,0.000018331075,0.00005240284,0.00014804515,0.0006215681,0.000016326601,0.0000011532222],"category_scores_gemma":[0.000118007534,0.000020490324,0.000047652924,0.00012454588,0.00029716815,0.00021599108,0.0002067968,0.00004667432,6.0309105e-7],"study_design_candidate":"design_other","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.000023618653,0.00007260176,0.00051086146,0.00015549576,0.00005750146,1.0668194e-7,0.004887984,0.00008710383,0.002676375,0.07447049,0.010369413,0.90668845],"study_design_scores_gemma":[0.00060963625,0.00009362574,0.0062246085,0.00007831763,0.00001738155,0.000013760843,0.00007467994,0.15472636,0.06328502,0.7743476,0.00041946094,0.00010954546],"about_ca_topic_score_codex":0.000053605672,"about_ca_topic_score_gemma":0.0000069513967,"teacher_disagreement_score":0.9065789,"about_ca_system_score_codex":0.0000025133693,"about_ca_system_score_gemma":0.000015576832,"threshold_uncertainty_score":0.14276028},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91965497,0.00013136839,0.0039327163,0.005166588,0.0040270425,0.00033607206,0.0000044059398,0.000537509,0.066209316],"genre_scores_gemma":[0.9922432,0.0000027037047,0.0069758967,0.00026330195,0.0000036641702,0.0000072882235,2.4248885e-7,0.000010501048,0.0004932362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897206,0.000028106968,0.00018603838,0.0002593216,0.000361476,0.00019301656],"domain_scores_gemma":[0.9977821,0.000099561905,0.0002944416,0.0016293221,0.00014661369,0.00004797729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027453006,0.000121416604,0.00014448099,0.000038211405,0.00033186466,0.00048222338,0.0033186246,0.0000566969,0.0000030418623],"category_scores_gemma":[0.0005351885,0.00008905138,0.000074196025,0.000113159884,0.00020279162,0.00079882034,0.0009077282,0.00016836064,0.000027317099],"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.0000035326889,0.000106749925,0.0007209338,0.000010123043,0.000008049429,0.0000027640317,0.0000749817,3.7739593e-7,0.0006127948,0.98917025,0.0024581582,0.0068313093],"study_design_scores_gemma":[0.00032445323,0.000075642776,0.004889426,0.00010854205,0.0000042255424,0.0000031139152,0.0000013215573,0.0007386188,0.03950146,0.9537314,0.00050823967,0.0001135575],"about_ca_topic_score_codex":0.000018541994,"about_ca_topic_score_gemma":8.5799917e-7,"teacher_disagreement_score":0.07258818,"about_ca_system_score_codex":0.00002809522,"about_ca_system_score_gemma":0.00008092432,"threshold_uncertainty_score":0.61668855},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014896427,0.00026421124,0.9696927,0.00052334066,0.00009884541,0.00012659923,0.0000026395924,0.00037324918,0.014021979],"genre_scores_gemma":[0.5633749,0.000003158757,0.436439,0.000057704972,0.00003398542,0.000005584618,0.0000012554401,0.000008198732,0.00007620277],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986535,0.000039845716,0.00030036757,0.00042463333,0.00032428856,0.0002573856],"domain_scores_gemma":[0.99818105,0.000044014647,0.0005015392,0.00083897973,0.0003739012,0.000060510432],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00031848165,0.00015771003,0.00021052086,0.00011713195,0.0006277874,0.0021038407,0.0013766169,0.00008111934,0.000004921878],"category_scores_gemma":[0.00071927794,0.00014283526,0.0000634281,0.00018739233,0.00046678085,0.00501211,0.00055529794,0.00015440157,0.0000034348975],"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.000027718406,0.00034965988,0.0072119627,0.00050522195,0.000031549844,0.00010661425,0.0023914769,0.00009717828,0.19539648,0.0073465006,0.0008428661,0.78569275],"study_design_scores_gemma":[0.0005848732,0.00012965432,0.022597728,0.000705166,0.000048060596,0.00025526402,0.00020528132,0.16723858,0.70163167,0.10564997,0.00015471382,0.0007990761],"about_ca_topic_score_codex":0.00008544132,"about_ca_topic_score_gemma":0.0000036069252,"teacher_disagreement_score":0.7848937,"about_ca_system_score_codex":0.000039114544,"about_ca_system_score_gemma":0.00016287273,"threshold_uncertainty_score":0.99893206},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008648775,0.006808777,0.13382567,0.0012836054,0.00039281996,0.0016529023,0.000025027604,0.0011125171,0.8540338],"genre_scores_gemma":[0.074413866,0.014562391,0.8071292,0.00047527553,0.000083687395,0.00033282052,0.0000074089335,0.00019896166,0.102796376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860686,0.000013486044,0.0005233918,0.00037765395,0.00030811445,0.00017051554],"domain_scores_gemma":[0.99722666,0.0011700949,0.00055498065,0.0007733111,0.00025171562,0.00002321772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023408397,0.0003199954,0.00054183364,0.00014886905,0.000070613474,0.00005589087,0.0006922502,0.000105059575,0.0000045478873],"category_scores_gemma":[0.0004919265,0.00022759197,0.0000504217,0.00010850989,0.0003534082,0.00025388072,0.00049619225,0.00023198266,0.00001199448],"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.0000017199459,0.0000844975,6.786986e-7,0.00054508616,0.000054091408,0.0000059385584,0.0020107615,0.0000040179157,0.0000452173,0.9754654,0.00071861566,0.021063944],"study_design_scores_gemma":[0.00016322496,0.00013030943,0.0000060378848,0.0023829516,0.000028668908,0.000013550219,0.00019532592,0.0053969817,0.00061659125,0.9883345,0.0023965433,0.000335336],"about_ca_topic_score_codex":1.6196263e-7,"about_ca_topic_score_gemma":0.0000021554633,"teacher_disagreement_score":0.75123745,"about_ca_system_score_codex":0.000086333006,"about_ca_system_score_gemma":0.000019043533,"threshold_uncertainty_score":0.9280931},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03499926,0.00007502601,0.930925,0.022618497,0.0012147909,0.00051779096,0.000046602705,0.0013222664,0.008280725],"genre_scores_gemma":[0.9600159,0.000017067709,0.033117015,0.0065332665,0.0001137011,0.000019337554,0.000017075963,0.000031403382,0.0001352485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976753,0.00008403665,0.00035720866,0.00066851143,0.0005394246,0.00067552336],"domain_scores_gemma":[0.9964148,0.00024947588,0.00038098873,0.0025445628,0.00023125026,0.00017893895],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000464572,0.00035341474,0.00029206235,0.00023001296,0.0011180006,0.0031487204,0.004537355,0.00009883281,0.000009415135],"category_scores_gemma":[0.000094394745,0.00025880625,0.00021953453,0.0002710609,0.00044587816,0.0015857213,0.0015561444,0.0003901421,0.000061564475],"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.000020785623,0.0003949168,0.0063566132,0.000032468826,0.000088427274,0.00013237182,0.00011036829,0.0000011867708,0.00020617503,0.8812308,0.06701766,0.044408232],"study_design_scores_gemma":[0.0013868929,0.0011649582,0.076624,0.0007225046,0.000050825445,0.00023537627,0.000019289311,0.52782524,0.022832908,0.2718353,0.09549246,0.001810254],"about_ca_topic_score_codex":0.000022490685,"about_ca_topic_score_gemma":0.000011614884,"teacher_disagreement_score":0.92501664,"about_ca_system_score_codex":0.000025163901,"about_ca_system_score_gemma":0.00009080421,"threshold_uncertainty_score":0.9999864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9563453,0.00003626329,0.0069977893,0.00027448332,0.0009104644,0.00022848895,0.0000029365515,0.0006621609,0.03454208],"genre_scores_gemma":[0.9614481,0.0000066796742,0.038336135,0.00001912579,0.0000015919866,0.0000144846745,0.0000016415396,0.000015132189,0.00015715789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988203,0.000041008585,0.00023263606,0.0003435135,0.00032782764,0.00023469064],"domain_scores_gemma":[0.997794,0.000035156096,0.0005391883,0.0011812536,0.0003815242,0.00006887587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030890427,0.00015813373,0.0002396041,0.000090097565,0.00027068256,0.00048292257,0.0013952545,0.000093329356,0.0000032302935],"category_scores_gemma":[0.00020551104,0.00014280957,0.000068859685,0.00028638064,0.00030923286,0.0020429504,0.00026364182,0.00012896233,0.000006999098],"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.000015588595,0.00018856714,0.0715255,0.000025824,0.00007616738,0.000020973423,0.000109758366,1.6995602e-7,0.0007150662,0.8746922,0.00073336257,0.051896844],"study_design_scores_gemma":[0.00054835895,0.00010565395,0.021960106,0.00016571392,0.000012562196,0.00004355046,0.0000053828685,0.00016918777,0.02465572,0.95209926,0.000034849065,0.0001996618],"about_ca_topic_score_codex":0.00005456592,"about_ca_topic_score_gemma":0.00000797266,"teacher_disagreement_score":0.07740708,"about_ca_system_score_codex":0.00003430262,"about_ca_system_score_gemma":0.000076982054,"threshold_uncertainty_score":0.5823605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034230385,0.0017615565,0.904216,0.006849922,0.000046265115,0.00030960594,0.000008678267,0.0005187974,0.05205882],"genre_scores_gemma":[0.9117549,0.000055272587,0.0869984,0.0007563043,0.000041652944,0.000038505146,0.0000013726445,0.0000027659203,0.00035084737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994852,0.000014814705,0.00008403691,0.00025246368,0.000037238002,0.00012623276],"domain_scores_gemma":[0.99959844,0.000055522916,0.00004207755,0.00019126033,0.00006248579,0.000050239178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000456544,0.000071721486,0.000081859085,0.000038584443,0.00022488323,0.000119412005,0.00029719228,0.00005676763,0.000017243874],"category_scores_gemma":[0.000013972373,0.00005930994,0.000007724667,0.000099230085,0.00044635785,0.00020908401,0.00025092272,0.000059304475,0.000018459767],"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.0000011442323,0.00001535483,0.00009136735,0.0000074969535,0.0000022480228,4.7004508e-7,0.00012282736,2.7999524e-8,0.003814542,0.97606134,0.0007755776,0.019107616],"study_design_scores_gemma":[0.000119417775,0.00019755849,0.0036263342,0.0000032206149,0.0000065359254,0.00006618442,0.000033385422,0.0010713148,0.0184569,0.8908344,0.08539402,0.00019075768],"about_ca_topic_score_codex":0.0000050176723,"about_ca_topic_score_gemma":0.0000026939028,"teacher_disagreement_score":0.8775245,"about_ca_system_score_codex":0.0000030713834,"about_ca_system_score_gemma":0.000012036735,"threshold_uncertainty_score":0.2418589},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39434338,0.0013566485,0.42692232,0.0064282687,0.006164282,0.00096128037,0.00000647986,0.0027906066,0.16102673],"genre_scores_gemma":[0.9928119,0.00000631974,0.006940906,0.00010456376,0.0000070945694,0.000015068616,3.0309891e-7,0.0000071146947,0.000106698135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989904,0.000054849068,0.0002248779,0.00025071864,0.00025815467,0.00022101108],"domain_scores_gemma":[0.998353,0.00031337095,0.00009703041,0.00088839384,0.0002760366,0.000072169256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049219246,0.00009942132,0.00012037665,0.000028378008,0.00016090184,0.00018320399,0.0015028444,0.000044754903,0.0000053941394],"category_scores_gemma":[0.00041610363,0.00007232123,0.000049110786,0.00035945664,0.0007769582,0.00062698656,0.0005847891,0.00009805218,0.00006413046],"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.000004950859,0.00011721554,0.00094181317,0.000010526129,0.000007561262,0.0000025563818,0.00014643387,8.823256e-8,0.00010410937,0.8473827,0.009804964,0.14147708],"study_design_scores_gemma":[0.00010642762,0.00018431192,0.0014053839,0.00002013871,0.0000020025857,0.0000036095646,0.000008905394,0.00140002,0.053996243,0.9358476,0.0069320216,0.00009334274],"about_ca_topic_score_codex":0.000020213869,"about_ca_topic_score_gemma":0.0000037245957,"teacher_disagreement_score":0.59846854,"about_ca_system_score_codex":0.000035952482,"about_ca_system_score_gemma":0.00010196414,"threshold_uncertainty_score":0.2949174},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004882703,0.0000799766,0.99215186,0.0005024648,0.00032370276,0.00012976553,0.0000064741275,0.000556054,0.0013669806],"genre_scores_gemma":[0.6376486,0.000005142853,0.36197025,0.00024402601,0.0000816939,0.0000053269796,0.000008527505,0.000010825398,0.00002564799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841744,0.00003131737,0.00038385353,0.00043316933,0.00041084495,0.00032339885],"domain_scores_gemma":[0.9983708,0.00006988911,0.00023666144,0.0005212375,0.0007197954,0.00008158576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002679113,0.00017989126,0.00020394132,0.00040274658,0.00014369635,0.00037463693,0.0011845544,0.00006587282,0.0000026211],"category_scores_gemma":[0.00003406373,0.00018684623,0.000099284414,0.000907317,0.00025910485,0.0013470472,0.0007795418,0.00013458062,0.000020509024],"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.00000554302,0.00014203528,0.0032656675,0.000061136256,0.000040615258,0.000005050275,0.00025734483,0.00011176467,0.00028384067,0.65305734,0.013428575,0.3293411],"study_design_scores_gemma":[0.0003771776,0.0004350637,0.0121155195,0.00020469318,0.000010772305,0.00003408834,0.0000094579655,0.49684396,0.04824585,0.4373221,0.0039049843,0.0004963291],"about_ca_topic_score_codex":0.0000070074584,"about_ca_topic_score_gemma":0.0000012610805,"teacher_disagreement_score":0.6327659,"about_ca_system_score_codex":0.000027524473,"about_ca_system_score_gemma":0.00009676286,"threshold_uncertainty_score":0.76193684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00850067,0.000031845368,0.9468542,0.0010663379,0.00008803296,0.00032501563,0.000027401722,0.00021750298,0.042888995],"genre_scores_gemma":[0.9552819,0.0000013148781,0.0440924,0.00023956005,0.000031124517,0.000028212498,9.71745e-7,0.000013113347,0.00031137455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989885,0.00014660547,0.00024376423,0.0002064256,0.00021961168,0.000195062],"domain_scores_gemma":[0.9962279,0.0027711259,0.00016460521,0.0006083928,0.00016937117,0.00005858158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012334379,0.00015674611,0.00017622988,0.000027980865,0.00032381987,0.00042490347,0.00089302065,0.00004060491,0.0000067909873],"category_scores_gemma":[0.000751132,0.00007539427,0.00005015967,0.00022188558,0.00041206853,0.00023569739,0.0003656649,0.00008518534,0.0000644685],"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.00003279673,0.000028915,0.0000062863355,0.000046909216,0.000024722984,0.0000013222301,0.0028188387,3.8371002e-7,0.00031434183,0.98124695,0.00048767542,0.014990831],"study_design_scores_gemma":[0.00017947382,0.00050922896,0.000060140213,0.0012728573,0.00003891607,0.00006390807,0.0025768587,0.010550857,0.21629919,0.76732796,0.0007474376,0.00037316637],"about_ca_topic_score_codex":0.0000026761545,"about_ca_topic_score_gemma":0.0000013956541,"teacher_disagreement_score":0.9467813,"about_ca_system_score_codex":0.000020488851,"about_ca_system_score_gemma":0.000023524235,"threshold_uncertainty_score":0.40973538},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084725313,0.00009023564,0.98973,0.0012853615,0.000048918486,0.00017465846,0.0000036649042,0.00066198123,0.007157912],"genre_scores_gemma":[0.14352325,0.0000033469478,0.8557544,0.00038832784,0.00007490957,0.000016007098,0.0000074136406,0.000008489373,0.00022386393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990801,0.000009555639,0.00013303575,0.00049997953,0.00011810031,0.0001592216],"domain_scores_gemma":[0.9988297,0.000074095566,0.00006478579,0.0008239244,0.00016343613,0.00004403896],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00023500236,0.00008203947,0.000083044084,0.00006325279,0.00013279471,0.0011417664,0.0010213588,0.000039491337,0.0000032695987],"category_scores_gemma":[0.0003400307,0.00007155483,0.000009635237,0.00026974938,0.00014473332,0.004461662,0.0010485697,0.00004644713,0.000008837623],"study_design_candidate":"design_other","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.000013984973,0.000069921516,0.00020726414,0.00012395694,0.0000061430223,0.000005412946,0.00060959416,4.9341512e-8,0.005613537,0.023527984,0.02462263,0.94519955],"study_design_scores_gemma":[0.00019011459,0.00023272811,0.00047730637,0.00022292037,0.0000092290475,0.000040704945,0.000057572535,0.47436255,0.052187216,0.4663364,0.0055522555,0.0003309868],"about_ca_topic_score_codex":0.0000053689096,"about_ca_topic_score_gemma":0.0000010566656,"teacher_disagreement_score":0.94486856,"about_ca_system_score_codex":0.0000070962933,"about_ca_system_score_gemma":0.000042651838,"threshold_uncertainty_score":0.99989516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6662518,0.00064341014,0.27356017,0.0013139303,0.0028469153,0.00030790377,0.00000551664,0.0035037843,0.05156662],"genre_scores_gemma":[0.96412235,0.000029621064,0.035310898,0.00014251185,0.0000023849957,0.000019176952,0.0000034514844,0.000009034319,0.00036058988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992039,0.000024068915,0.00015601474,0.0002623241,0.00018577965,0.00016789607],"domain_scores_gemma":[0.99937534,0.000032020853,0.000070495225,0.0003377389,0.00012099888,0.00006342136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008531862,0.00009904032,0.00009627889,0.00009431008,0.0001867989,0.00014912142,0.0005182226,0.00004593551,0.0000045650568],"category_scores_gemma":[0.000050802806,0.00010486504,0.000040057075,0.00045533938,0.00011359281,0.0015335288,0.00010022917,0.00009440731,0.00004846656],"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.0000021862547,0.00015753736,0.0025281343,0.000009827308,0.000013567739,0.000027987324,0.00040727944,7.072067e-7,0.0023281898,0.8587923,0.06520718,0.07052508],"study_design_scores_gemma":[0.0001909985,0.00005300706,0.0004910335,0.000013881651,0.0000018879332,0.00024679513,0.0000064972255,0.0006680943,0.022130048,0.974505,0.0015173893,0.0001753554],"about_ca_topic_score_codex":0.00000934953,"about_ca_topic_score_gemma":1.7792476e-7,"teacher_disagreement_score":0.29787058,"about_ca_system_score_codex":0.000034467717,"about_ca_system_score_gemma":0.00005470019,"threshold_uncertainty_score":0.4276272},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003099852,0.0050332462,0.91771114,0.022750497,0.033869244,0.0036743383,0.0003925025,0.0006771357,0.015581924],"genre_scores_gemma":[0.003906061,0.0010848355,0.829185,0.020116026,0.008008624,0.0006321416,0.0007358718,0.0007186626,0.13561274],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99379265,0.00026628884,0.0019663644,0.0012442553,0.0015574795,0.0011729483],"domain_scores_gemma":[0.99216145,0.00036562595,0.0029188474,0.001627997,0.0023191867,0.0006068862],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031350001,0.0009900621,0.0015088598,0.0010490598,0.00045071723,0.0028738712,0.004134873,0.0008202685,0.00003712874],"category_scores_gemma":[0.0009367633,0.00077714917,0.00056130125,0.0011858423,0.00021979825,0.0029325234,0.00081973,0.0019153001,0.00012138914],"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.00009919253,0.00018545023,0.00000944268,0.0006293131,0.00016006928,0.000057478726,0.00024219607,0.000007182008,0.00010967712,0.0022903802,0.9248209,0.07138873],"study_design_scores_gemma":[0.0011529918,0.002074161,0.000097781834,0.0028377082,0.0002839709,0.0006434472,0.0000464766,0.0031328714,0.0030143408,0.12575826,0.85959446,0.0013635273],"about_ca_topic_score_codex":0.00005819593,"about_ca_topic_score_gemma":0.000043463133,"teacher_disagreement_score":0.123467885,"about_ca_system_score_codex":0.00035100206,"about_ca_system_score_gemma":0.0024487898,"threshold_uncertainty_score":0.99946797},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055044075,0.0000037276216,0.86297995,0.0047700047,0.00018108131,0.00021629906,0.000004699504,0.00028339843,0.1260564],"genre_scores_gemma":[0.6886742,0.000001301261,0.30945703,0.0010207014,0.000040502702,0.0000074230356,7.28246e-7,0.0000037561858,0.0007943071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991531,0.0000021685917,0.00017954141,0.00025814452,0.00025997622,0.00014707872],"domain_scores_gemma":[0.9993215,0.000029650004,0.000120610945,0.00018176816,0.0003157418,0.00003069522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014059486,0.000103527615,0.000111197885,0.00009264488,0.000043512628,0.00044062617,0.001219018,0.000030379108,0.000004214816],"category_scores_gemma":[0.000043501354,0.000066583976,0.00007462526,0.00022301111,0.00006525063,0.00096267887,0.0002532533,0.000072330105,0.0000029121395],"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.000014776208,0.00013452308,0.00033843445,0.000020382473,0.000010956859,3.973769e-7,0.00011747023,0.000002472207,0.009770131,0.8494423,0.022593955,0.11755417],"study_design_scores_gemma":[0.00053367886,0.00071750383,0.011027635,0.00038386625,0.000008418537,0.000031881224,0.000021871467,0.1601642,0.42729434,0.39644253,0.002875801,0.00049826154],"about_ca_topic_score_codex":0.000001101547,"about_ca_topic_score_gemma":1.2180568e-7,"teacher_disagreement_score":0.68316984,"about_ca_system_score_codex":0.000020709658,"about_ca_system_score_gemma":0.000029626188,"threshold_uncertainty_score":0.42489684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0212915,0.00026036246,0.97212684,0.0006786264,0.0034560065,0.000624804,0.0000053419703,0.0010198678,0.00053667586],"genre_scores_gemma":[0.5414189,0.0000010924321,0.4573956,0.0010087298,0.00013025028,0.000021321634,0.0000031726531,0.000017135062,0.0000037829764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947472,0.000089859146,0.0006708582,0.0024427702,0.0010740841,0.00097523676],"domain_scores_gemma":[0.99635047,0.00042504875,0.0004434021,0.0020403157,0.0005759867,0.00016479312],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016359775,0.0006075595,0.0005629754,0.0009844638,0.00023267837,0.0030033956,0.005151134,0.00036189036,0.000025064173],"category_scores_gemma":[0.00043482252,0.0005775085,0.00014601741,0.0025406892,0.00061587343,0.000745698,0.0071439245,0.0013418008,0.00005228308],"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.0000044884805,0.000089592766,0.00024188965,0.00016136741,0.000007958266,0.000021608028,0.00061398663,0.2942119,0.00090863224,0.00036496564,0.000019460971,0.7033542],"study_design_scores_gemma":[0.00018527245,0.00009975313,0.0006253253,0.00049341656,0.0000048114425,0.000038493155,4.1292475e-7,0.9545545,0.006660279,0.03666826,0.000043871594,0.00062562217],"about_ca_topic_score_codex":0.000017371938,"about_ca_topic_score_gemma":0.00001057476,"teacher_disagreement_score":0.70272857,"about_ca_system_score_codex":0.0003444923,"about_ca_system_score_gemma":0.0013857135,"threshold_uncertainty_score":0.99966764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047555834,0.000017044596,0.9327197,0.0002674908,0.000052001924,0.00016100556,0.0000057331795,0.00036137417,0.018859807],"genre_scores_gemma":[0.5554638,0.000002941512,0.44437096,0.000018669014,0.0000044943886,0.000001797817,0.0000014404703,0.000007928105,0.00012797893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988887,0.000029320188,0.00020053248,0.00033173498,0.00031379462,0.00023594293],"domain_scores_gemma":[0.9986369,0.0001144941,0.00024239188,0.0005707392,0.00036394174,0.00007150298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017449613,0.00014644263,0.00018850008,0.00027901863,0.00014809404,0.000157234,0.00083656906,0.0000425253,0.00003018139],"category_scores_gemma":[0.00007046466,0.00013158568,0.000048729173,0.00084747816,0.00035786675,0.0017982818,0.00026986562,0.000072745104,0.00002988434],"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.00012661348,0.000801068,0.0010771019,0.0009260808,0.00045571072,0.00010939361,0.024832657,0.000008457002,0.1426826,0.70109403,0.009680056,0.11820623],"study_design_scores_gemma":[0.0014903336,0.0029701681,0.0019690213,0.002770752,0.00025373834,0.00038582407,0.001808152,0.024448425,0.2702329,0.6875398,0.004482114,0.0016487652],"about_ca_topic_score_codex":0.000015971089,"about_ca_topic_score_gemma":0.0000112219395,"teacher_disagreement_score":0.5079079,"about_ca_system_score_codex":0.00004183792,"about_ca_system_score_gemma":0.000063086074,"threshold_uncertainty_score":0.5365908},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001870815,0.00020738323,0.93976605,0.000374834,0.0004208427,0.0007367263,0.0000056907757,0.0019094282,0.05656032],"genre_scores_gemma":[0.0055784886,0.000010547846,0.98962206,0.00031177088,0.0001643466,0.00015721931,0.000022649348,0.000032945914,0.0040999916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998059,0.0000197632,0.00042052753,0.00088639656,0.00027320872,0.00034110484],"domain_scores_gemma":[0.998503,0.00007955216,0.0003148068,0.00069438276,0.00027382126,0.00013443723],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00030829426,0.0003387714,0.00036108145,0.00020350507,0.00007486407,0.0014810293,0.0021570951,0.00027939116,0.000025274727],"category_scores_gemma":[0.00009864137,0.0003215241,0.00016407119,0.00014248508,0.00004745319,0.0012606048,0.0020578012,0.00023922462,0.000025242236],"study_design_candidate":"design_other","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.0000052660193,0.00007080745,0.0000043492,0.00036744887,0.0000339053,0.0000027807282,0.0006733036,0.0000042410834,0.00049099035,0.07673349,0.024193991,0.89741945],"study_design_scores_gemma":[0.00013183379,0.000058483158,0.000009050238,0.00022262144,0.000015172509,0.000007586505,0.000006979566,0.23650001,0.050391845,0.710043,0.0021427334,0.0004706892],"about_ca_topic_score_codex":0.000066703506,"about_ca_topic_score_gemma":0.0000014744015,"teacher_disagreement_score":0.89694875,"about_ca_system_score_codex":0.00006409401,"about_ca_system_score_gemma":0.00039602458,"threshold_uncertainty_score":0.9999237},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3819268,0.00025733229,0.60389316,0.002753632,0.00040839193,0.00043782665,0.000013265512,0.0012951948,0.0090143755],"genre_scores_gemma":[0.8777215,0.000024088018,0.12116254,0.00049158256,0.000048674163,0.00009294057,0.000018745613,0.000025058096,0.00041487798],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828786,0.00003926198,0.0003823839,0.0007174273,0.00025963978,0.00031342628],"domain_scores_gemma":[0.9985912,0.000046570472,0.0001717567,0.00094415154,0.00016263938,0.000083690014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023611494,0.00025573195,0.00027348124,0.00028382332,0.000059672253,0.0004735403,0.0017175244,0.00019923491,0.000007551321],"category_scores_gemma":[0.00020443847,0.00027570844,0.00009193168,0.00046415126,0.00009010585,0.00073334895,0.0018437926,0.0005696077,0.00023118118],"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.000041330713,0.0038500573,0.7897559,0.002180773,0.00024700238,0.0026597301,0.01680189,0.0099890195,0.0032445015,0.08875442,0.0069472096,0.07552815],"study_design_scores_gemma":[0.0011367594,0.00016847062,0.20771961,0.0026924154,0.000033389388,0.000084081745,0.000057922214,0.0383852,0.032417465,0.7116029,0.0033176173,0.0023841711],"about_ca_topic_score_codex":0.00012227986,"about_ca_topic_score_gemma":0.00003264022,"teacher_disagreement_score":0.6228485,"about_ca_system_score_codex":0.00023636293,"about_ca_system_score_gemma":0.0005648695,"threshold_uncertainty_score":0.9999695},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50783,0.00026661437,0.48199335,0.0005172018,0.00016601506,0.0002813142,0.0000107707565,0.0005717613,0.008362942],"genre_scores_gemma":[0.823305,0.000013234693,0.17609498,0.00017460184,0.000033622055,0.000032924447,0.000011876617,0.000027183,0.00030655364],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979152,0.000027193939,0.000450203,0.0007536727,0.00047721778,0.00037648933],"domain_scores_gemma":[0.9979145,0.000040721934,0.0004054808,0.0012899772,0.00023159501,0.0001177091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031373778,0.00034262534,0.00040117683,0.00021785578,0.000038431568,0.00020860563,0.0018644045,0.00017062887,0.0000048622674],"category_scores_gemma":[0.000035969537,0.00027877928,0.000099057026,0.00030565952,0.00019274921,0.0005641797,0.0026958687,0.00040986066,0.00002097332],"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.00030566438,0.0015081858,0.7526019,0.003102335,0.0007159374,0.00094654196,0.005092273,0.0003173205,0.013725486,0.00894043,0.008075619,0.20466831],"study_design_scores_gemma":[0.0013139931,0.0016344525,0.42669204,0.00468052,0.00016865152,0.00013648655,0.00007256923,0.01134668,0.5203425,0.021789739,0.00822597,0.0035963887],"about_ca_topic_score_codex":0.000048938025,"about_ca_topic_score_gemma":0.0000064383025,"teacher_disagreement_score":0.506617,"about_ca_system_score_codex":0.00007253377,"about_ca_system_score_gemma":0.00020563319,"threshold_uncertainty_score":0.99996644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009761167,0.000012150569,0.99450994,0.004131637,0.00011519062,0.00029333058,0.000024951645,0.0002950867,0.0006079646],"genre_scores_gemma":[0.012121708,0.000029027702,0.9836038,0.0036510685,0.00033501146,0.000020208934,0.00019316874,0.000015403197,0.000030599418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883854,0.000014610585,0.0003778582,0.00023338923,0.00035336678,0.00018222748],"domain_scores_gemma":[0.9985468,0.000096236785,0.0005041375,0.0003449866,0.000391814,0.00011603979],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004652444,0.00011498732,0.00012467049,0.00010313263,0.00022707392,0.0015073055,0.0011464494,0.000072818984,0.0000039383985],"category_scores_gemma":[0.00016631701,0.00009952594,0.00004336282,0.00036526215,0.000010103657,0.0053290613,0.00029759525,0.000171796,0.000019073994],"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.000031519998,0.000074008516,0.00006614988,0.00004250948,0.00003750731,0.0000026666062,0.00032926173,0.4289823,0.00007202595,0.002320087,0.03358624,0.5344557],"study_design_scores_gemma":[0.00023702589,0.00022290419,0.000012110473,0.000030695246,0.000005960733,0.000015847429,0.000002997131,0.96669495,0.00026743035,0.0016869555,0.030697454,0.00012566934],"about_ca_topic_score_codex":2.6059888e-7,"about_ca_topic_score_gemma":1.2345646e-7,"teacher_disagreement_score":0.53771263,"about_ca_system_score_codex":0.00012716898,"about_ca_system_score_gemma":0.0000706577,"threshold_uncertainty_score":0.99952924},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012368813,0.00015905417,0.981809,0.00018590078,0.000041613643,0.0003885783,0.00006507753,0.0003167167,0.0046652085],"genre_scores_gemma":[0.47021225,0.00001248858,0.52964836,0.000024050347,0.000006335567,0.000050396353,0.0000025542197,0.000008330508,0.00003523224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893034,0.000024271962,0.00038666948,0.00026099753,0.000161981,0.00023576392],"domain_scores_gemma":[0.9987301,0.000051998395,0.00018963081,0.0005311793,0.0003778676,0.00011921891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027829772,0.00014938056,0.00025312763,0.000169632,0.00010210056,0.00013415086,0.0005204359,0.00006729753,0.000005112622],"category_scores_gemma":[0.0002316352,0.0001350929,0.00005903146,0.00048247832,0.00016449686,0.000562437,0.00031583128,0.00007163347,0.000009400052],"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.000012346944,0.00027406603,0.0004024103,0.0003008147,0.000065430555,0.0000139905,0.0033150795,0.0000021287403,0.0052438583,0.92811704,0.0004765549,0.061776254],"study_design_scores_gemma":[0.00026204746,0.00017116821,0.0002382672,0.0003457536,0.000037847385,0.00030357466,0.00007282631,0.0041051838,0.069603644,0.9243619,0.00018106439,0.0003167663],"about_ca_topic_score_codex":0.000014075463,"about_ca_topic_score_gemma":0.00000781471,"teacher_disagreement_score":0.45784345,"about_ca_system_score_codex":0.00003091851,"about_ca_system_score_gemma":0.000065086206,"threshold_uncertainty_score":0.55089283},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3180299,0.0000068539707,0.67771107,0.00289317,0.00016284174,0.00017965309,0.0000052852097,0.0004903231,0.0005208993],"genre_scores_gemma":[0.8816596,0.000001183107,0.11170581,0.006475282,0.00004033741,0.000034903413,0.000053931264,0.000020941463,0.000008001876],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986474,0.000076110024,0.0002415338,0.00046412417,0.00028601385,0.00028481864],"domain_scores_gemma":[0.99917006,0.00006343768,0.0001560809,0.00042095635,0.000119745746,0.000069685615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020236571,0.00016672797,0.00013684147,0.00025016314,0.00009471589,0.0005728707,0.00041485837,0.00005317057,0.00006264691],"category_scores_gemma":[0.000023173114,0.00018369839,0.00008364656,0.00039986652,0.000047504254,0.0015953036,0.0000661813,0.00013268848,0.00040401414],"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.000015566386,0.00022889496,0.047485594,0.00025963376,0.000037622274,0.00003093487,0.00034812224,0.00029877445,0.50820106,0.0002159999,0.0018669722,0.44101083],"study_design_scores_gemma":[0.0012650421,0.00011444605,0.010663644,0.0007754712,0.000032465225,0.0000384504,0.000050418046,0.75157845,0.22809498,0.0056426143,0.00055141276,0.0011925767],"about_ca_topic_score_codex":0.000026047377,"about_ca_topic_score_gemma":0.000001493825,"teacher_disagreement_score":0.7512797,"about_ca_system_score_codex":0.00007197595,"about_ca_system_score_gemma":0.00003457016,"threshold_uncertainty_score":0.74910027},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058543514,0.00025975375,0.38668153,0.007737131,0.0000686618,0.0010570646,0.000007865709,0.0003784035,0.5452661],"genre_scores_gemma":[0.7273779,0.000012240397,0.27237317,0.00008776464,0.0000012997308,0.000027717742,7.8565824e-7,0.0000032209862,0.000115910814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881876,0.00005251982,0.00032740535,0.00024780963,0.0003414586,0.00021203134],"domain_scores_gemma":[0.9966401,0.0013974081,0.00014900189,0.0017241604,0.000055238575,0.000034129454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006857561,0.00010593381,0.00018450666,0.00009301866,0.00013914045,0.0003158902,0.004832315,0.000028211802,0.000011408664],"category_scores_gemma":[0.00046753653,0.00006663937,0.000036665893,0.00090432464,0.0007739863,0.0013130939,0.001257559,0.00017155435,0.00008538703],"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.0000014002006,0.0002735359,0.00021933408,0.000025097177,0.000001583801,1.9804234e-7,0.00018742293,0.00018797856,0.00023142906,0.97507304,0.000034441877,0.023764538],"study_design_scores_gemma":[0.00009454057,0.00013000196,0.00011874623,0.00029291614,9.901636e-7,0.0000055135206,0.00012659004,0.10876216,0.003893371,0.8856561,0.00078287954,0.00013614669],"about_ca_topic_score_codex":0.0000012746796,"about_ca_topic_score_gemma":0.0000011156056,"teacher_disagreement_score":0.6688344,"about_ca_system_score_codex":0.000029431505,"about_ca_system_score_gemma":0.000060898732,"threshold_uncertainty_score":0.89797235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15735373,0.0074784546,0.72593415,0.0036277133,0.0003029079,0.00040186167,0.00001727929,0.00017973583,0.10470418],"genre_scores_gemma":[0.918106,0.002083147,0.07211844,0.00006541264,0.00006929855,0.0000010304228,0.000005222792,0.000015079956,0.0075363405],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816597,0.00033920933,0.00035114205,0.00043752068,0.00036729596,0.00033885578],"domain_scores_gemma":[0.99879295,0.00016575945,0.00014902484,0.0004439549,0.0002716798,0.00017664864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042513266,0.00028895418,0.00036668952,0.00011727643,0.00068069535,0.00012795332,0.0015116727,0.00032624614,0.000114920775],"category_scores_gemma":[0.00006171171,0.00029652115,0.00033028057,0.0004973557,0.0021322875,0.0015647305,0.00024798655,0.00032564928,0.000042459164],"study_design_candidate":"design_other","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.0007855558,0.003747929,0.004613654,0.0065258523,0.00040949837,0.00021370078,0.034541152,0.015463919,0.17013289,0.055829246,0.028336996,0.6793996],"study_design_scores_gemma":[0.0015187139,0.00022722446,0.031381343,0.008573355,0.00024584515,0.0003557755,0.000072872,0.21961614,0.348548,0.0067121964,0.38217455,0.000573996],"about_ca_topic_score_codex":0.0024165933,"about_ca_topic_score_gemma":0.000946972,"teacher_disagreement_score":0.7607523,"about_ca_system_score_codex":0.0008218669,"about_ca_system_score_gemma":0.00075288466,"threshold_uncertainty_score":0.9999487},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021518912,0.000026780102,0.9519386,0.0028679015,0.00010721961,0.0003005776,0.00001601562,0.0021676545,0.02105634],"genre_scores_gemma":[0.69772905,0.0000065405584,0.28971282,0.008665969,0.00004576848,0.000008480345,0.000014113743,0.000013560505,0.0038036758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983712,0.00004823004,0.00029032415,0.00051631103,0.00032753288,0.00044644656],"domain_scores_gemma":[0.99878615,0.000033092343,0.000089613844,0.0007570891,0.00014783959,0.00018619267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042686914,0.0002053089,0.0002141129,0.00011926268,0.00012109514,0.00088012544,0.0012114802,0.00007211475,0.0000871553],"category_scores_gemma":[0.00007378464,0.00016056572,0.00006090101,0.00036231676,0.000033642435,0.0034253849,0.00028929432,0.00013052527,0.00012917009],"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.0004343473,0.005062838,0.0026566512,0.00011777778,0.00007869039,0.0017362565,0.003996008,0.0000058995297,0.013243374,0.47444388,0.25740612,0.24081816],"study_design_scores_gemma":[0.004370855,0.006457458,0.01640111,0.0003335824,0.000039499915,0.0008524409,0.00060121046,0.22158015,0.3897579,0.2828801,0.07333311,0.0033925858],"about_ca_topic_score_codex":0.000017970498,"about_ca_topic_score_gemma":0.000027472575,"teacher_disagreement_score":0.67621017,"about_ca_system_score_codex":0.000074160576,"about_ca_system_score_gemma":0.00012354576,"threshold_uncertainty_score":0.848707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70012224,0.0074639423,0.28402734,0.0014977229,0.00026221317,0.0018247471,0.0002000193,0.0003481498,0.0042536575],"genre_scores_gemma":[0.9200329,0.00010861169,0.07974185,0.00002450908,0.000004250285,0.00003498348,0.00001089814,0.000026109945,0.000015880558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975895,0.00025765077,0.0008636066,0.00060249993,0.00046202837,0.00022466405],"domain_scores_gemma":[0.99676204,0.00052095164,0.0010169069,0.001265411,0.00036135502,0.00007333562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011084789,0.00036047687,0.00086977147,0.00024069814,0.00009482432,0.0002798641,0.0010399938,0.000121051264,0.0000025616935],"category_scores_gemma":[0.00057613815,0.00020936929,0.00017471702,0.00039085074,0.0012280982,0.0004663841,0.0020951254,0.0002504582,1.5113223e-7],"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.000031863565,0.00058516697,0.00065218407,0.012870267,0.0004044644,0.000018119725,0.035775367,0.000007538662,0.023734668,0.85094017,0.000054073214,0.07492613],"study_design_scores_gemma":[0.00012208207,0.00006565571,0.0010953997,0.0031904927,0.000068617206,0.000034811557,0.0019743203,0.00083679234,0.025094336,0.9672223,0.0000026235946,0.00029259056],"about_ca_topic_score_codex":0.0000050064464,"about_ca_topic_score_gemma":0.000001002616,"teacher_disagreement_score":0.2199107,"about_ca_system_score_codex":0.0000052116993,"about_ca_system_score_gemma":0.00011722081,"threshold_uncertainty_score":0.8537832},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9119611,0.000038170707,0.011117068,0.0005880771,0.0000661852,0.0005543547,0.0000014727641,0.0005009329,0.07517265],"genre_scores_gemma":[0.9449978,0.000015197475,0.05347624,0.000050721228,0.00005200608,0.0000017079878,4.2767206e-7,0.00001604113,0.0013898556],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.996968,0.00007308333,0.0001932798,0.00075661973,0.0011612826,0.0008477774],"domain_scores_gemma":[0.9982997,0.000064420245,0.00008338948,0.0002716142,0.0010891933,0.00019165727],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021241223,0.00018786556,0.0002180408,0.0009931957,0.00065784954,0.0013989101,0.0030648657,0.000090860405,0.00001403685],"category_scores_gemma":[0.00015942327,0.00020994533,0.000040180093,0.002671039,0.00054391596,0.003509603,0.0037622144,0.00045328666,0.000048106052],"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.00036423432,0.0026284717,0.5021311,0.0007705356,0.00020197003,0.0015208905,0.106324226,0.000020085994,0.091105096,0.20657931,0.018925978,0.06942809],"study_design_scores_gemma":[0.007788091,0.0046646767,0.1877889,0.004507519,0.0000614362,0.0002390642,0.07619875,0.22285141,0.15980144,0.026247177,0.30411634,0.005735201],"about_ca_topic_score_codex":0.0003906848,"about_ca_topic_score_gemma":0.00008698789,"teacher_disagreement_score":0.3143422,"about_ca_system_score_codex":0.00056476676,"about_ca_system_score_gemma":0.00019773172,"threshold_uncertainty_score":0.9996377},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27186254,0.000020240266,0.7262743,0.00047093342,0.000048966394,0.00021115836,0.0000039070733,0.00009620835,0.0010117693],"genre_scores_gemma":[0.88794935,9.761458e-7,0.11127824,0.00075726456,0.000004509183,0.0000028651355,9.885063e-7,0.0000046534533,0.0000011611556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991132,0.000032133026,0.0002924058,0.00012730509,0.00027965792,0.00015529613],"domain_scores_gemma":[0.9994097,0.000034789533,0.00020208526,0.00018351187,0.000110735135,0.00005922818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016710858,0.00010444199,0.00013003836,0.000057684847,0.00013176129,0.00018265785,0.0003588056,0.000028748464,0.0000019776278],"category_scores_gemma":[0.0000856599,0.00007463895,0.000031839987,0.0005572908,0.00016725504,0.0005432758,0.0006302261,0.00009380353,0.0000037603625],"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.000094797244,0.00087830896,0.0074349227,0.0024562771,0.00021926584,0.000008536129,0.17232944,0.016637288,0.019427717,0.6649552,0.0011334614,0.114424795],"study_design_scores_gemma":[0.00025805127,0.000092856775,0.00036169591,0.00012888823,0.000011920725,0.000008011436,0.00043046204,0.9808925,0.0087662265,0.008850143,0.00007842644,0.000120825265],"about_ca_topic_score_codex":0.0000045418465,"about_ca_topic_score_gemma":2.6395958e-7,"teacher_disagreement_score":0.9642552,"about_ca_system_score_codex":0.000026592908,"about_ca_system_score_gemma":0.0000431882,"threshold_uncertainty_score":0.3043688},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9716002,0.00034314417,0.022913506,0.004725095,0.00012851821,0.00003966153,0.000001663233,0.000009006088,0.0002392071],"genre_scores_gemma":[0.9255525,0.0000037127504,0.07401997,0.00017272466,0.000038638733,1.6804869e-7,2.5307525e-8,0.000003839357,0.00020846506],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99930817,0.000017157136,0.00023126681,0.000087813634,0.0002208094,0.00013476882],"domain_scores_gemma":[0.999419,0.000041905674,0.00023833259,0.00012213101,0.00006867226,0.00010998844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016218246,0.00007430599,0.00016850678,0.000007978379,0.00009626279,0.000051426454,0.0005193899,0.00002532038,0.0000015143081],"category_scores_gemma":[0.000025454714,0.000051210118,0.00008547155,0.000043404216,0.00017513621,0.00023306938,0.00030065887,0.0001627832,4.312117e-8],"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.00009134022,0.00028356104,0.14998701,0.00020054962,0.0005156329,0.000015486887,0.0019034377,0.0032126978,0.0026319975,0.0015234542,0.72119594,0.118438914],"study_design_scores_gemma":[0.0027690413,0.0008595382,0.7145587,0.0005397629,0.0000947508,0.00048679512,0.00033856812,0.17913067,0.025287801,0.0082253255,0.06666417,0.0010448493],"about_ca_topic_score_codex":0.0039031804,"about_ca_topic_score_gemma":0.00059841014,"teacher_disagreement_score":0.6545318,"about_ca_system_score_codex":0.000083972845,"about_ca_system_score_gemma":0.0005567939,"threshold_uncertainty_score":0.5900467},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0459934,0.0001517516,0.950493,0.00034709182,0.000050548562,0.00004697711,0.000050944163,0.000088456196,0.0027778414],"genre_scores_gemma":[0.64042115,0.000043694352,0.35833746,0.000635901,0.000009647148,0.000008668767,0.000020331398,0.0000025989177,0.00052053505],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937236,0.000029292172,0.000112918475,0.00024009241,0.000097827244,0.00014750572],"domain_scores_gemma":[0.999715,0.00008760638,0.0000333782,0.00009522852,0.000005249784,0.000063543805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043684973,0.00008144384,0.00008882939,0.000009432458,0.00011234161,0.00028923174,0.00010286945,0.000037768717,0.00025974982],"category_scores_gemma":[0.000035991423,0.00006860388,0.000012334636,0.000030623556,0.000112838774,0.0003108867,0.00033230506,0.00008128323,0.000060890008],"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.000013151716,0.0016046767,0.06128164,0.00006221093,0.00005602323,0.0017910853,0.0013821116,0.000027666554,0.011482952,0.2839091,0.008925124,0.62946427],"study_design_scores_gemma":[0.0005087013,0.0007229246,0.31757542,0.000041024105,0.000018529525,0.00021900475,0.00019087356,0.02561318,0.029190607,0.60334647,0.021806892,0.0007663681],"about_ca_topic_score_codex":4.4349193e-7,"about_ca_topic_score_gemma":0.0000010285653,"teacher_disagreement_score":0.6286979,"about_ca_system_score_codex":0.000026547965,"about_ca_system_score_gemma":0.0000062260647,"threshold_uncertainty_score":0.28440785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01898843,0.0019810763,0.9605246,0.010762741,0.00015377426,0.0012934499,0.00007283923,0.0007373415,0.005485736],"genre_scores_gemma":[0.7492599,0.00023160689,0.2455107,0.0010218263,0.0011499756,0.0005781227,0.00006954362,0.000062359315,0.0021159856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955731,0.00037892445,0.0009682115,0.0010757465,0.0009655644,0.0010384574],"domain_scores_gemma":[0.99787307,0.00042925123,0.00040482925,0.00055471854,0.00034375826,0.00039434608],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012074616,0.0006518665,0.00046003697,0.0003140784,0.0005272722,0.0012183819,0.0016477351,0.00028146326,0.001506305],"category_scores_gemma":[0.000047093094,0.000661611,0.0002927797,0.0006659161,0.0004522841,0.0010835605,0.0004317808,0.000502109,0.0001314563],"study_design_candidate":"design_other","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.00010509352,0.0016168966,0.0008487338,0.00018818666,0.00010317754,0.00010716432,0.0028693825,0.012117422,0.012976594,0.015369221,0.011763322,0.9419348],"study_design_scores_gemma":[0.003219912,0.0020244957,0.007777917,0.0013344974,0.00030397353,0.00080762233,0.00052938506,0.55418336,0.03786378,0.07274372,0.31683022,0.0023811217],"about_ca_topic_score_codex":0.00010319392,"about_ca_topic_score_gemma":0.000020721931,"teacher_disagreement_score":0.9395537,"about_ca_system_score_codex":0.00045776967,"about_ca_system_score_gemma":0.0004481075,"threshold_uncertainty_score":0.99981844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003889525,0.00003424585,0.9881666,0.002424991,0.000055582437,0.00023684787,9.4649243e-7,0.0000950738,0.005096218],"genre_scores_gemma":[0.66648597,0.0000031728944,0.33340964,0.00007925929,0.000008872466,0.0000050947656,1.9826349e-7,0.00000557766,0.0000022481863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789953,0.000058441627,0.0005821331,0.00039971553,0.0007232355,0.00033691936],"domain_scores_gemma":[0.99820364,0.0004754881,0.00027820846,0.0006507213,0.00025773837,0.00013420336],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011428951,0.00016269392,0.00031354264,0.00010201543,0.00010824306,0.00040828384,0.0027188195,0.00003557373,0.0000036118618],"category_scores_gemma":[0.0006061415,0.00010915319,0.00007092296,0.0013977347,0.00274328,0.0006997889,0.0008907321,0.0001457839,0.000005449723],"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.0000045540482,0.000070397175,0.00000897036,0.00007893161,0.0000029012058,0.0000028266393,0.0027140595,0.00012644062,0.004056459,0.9888151,0.0000102767235,0.004109074],"study_design_scores_gemma":[0.000071756665,0.00015304035,0.000026995413,0.00010151954,0.0000027933088,0.0000042630854,0.000041145402,0.5573185,0.033550467,0.40864244,0.0000031246627,0.00008395388],"about_ca_topic_score_codex":0.000001572402,"about_ca_topic_score_gemma":4.4795846e-7,"teacher_disagreement_score":0.6625964,"about_ca_system_score_codex":0.00001979643,"about_ca_system_score_gemma":0.00014272962,"threshold_uncertainty_score":0.9999707},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002810302,0.00043768785,0.99320483,0.0017886871,0.000047359936,0.000413347,0.00027344012,0.00020186318,0.00082249666],"genre_scores_gemma":[0.722088,0.000028122633,0.27742422,0.00010812196,0.000017639519,0.000075679534,0.000053117426,0.0000120285695,0.00019313689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998975,0.000034280136,0.00039027596,0.0002518929,0.00013693687,0.00021161466],"domain_scores_gemma":[0.99814427,0.00031509827,0.00018019511,0.00042756152,0.0008434349,0.0000894413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030748692,0.00013877841,0.00029826004,0.00009023633,0.00010957901,0.00029315503,0.00035555993,0.000062725,0.000003441526],"category_scores_gemma":[0.0015505982,0.00011387741,0.000069516616,0.00046792746,0.000094196825,0.00043820005,0.00025293246,0.00004139781,0.0000015019245],"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.0000081410435,0.00013946727,0.000027711967,0.00033489842,0.00006444963,0.000004041346,0.0014681078,0.000012457981,0.0346129,0.9450307,0.0009888912,0.017308252],"study_design_scores_gemma":[0.00050765014,0.00016726922,0.000074027565,0.00042039936,0.000040567174,0.000043816464,0.00032115864,0.059144937,0.43980965,0.49771076,0.0014699878,0.00028978704],"about_ca_topic_score_codex":0.000002966504,"about_ca_topic_score_gemma":0.0000043781947,"teacher_disagreement_score":0.7192776,"about_ca_system_score_codex":0.000046252117,"about_ca_system_score_gemma":0.00017980071,"threshold_uncertainty_score":0.4643786},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1379586,0.0032872437,0.7644253,0.00044843537,0.00020490738,0.00057335285,0.000029048362,0.0010404167,0.09203273],"genre_scores_gemma":[0.76408595,0.0000062395848,0.23564322,0.00009530663,0.00001894698,0.000019519726,0.0000012853777,0.000011670553,0.000117854346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862194,0.000038767892,0.0003844581,0.0002484362,0.00035685117,0.00034953633],"domain_scores_gemma":[0.99872535,0.00018377505,0.00015075505,0.00068942324,0.00012428853,0.00012640303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007796759,0.00017283199,0.00030801818,0.000086060136,0.00005945069,0.0001510301,0.0007267585,0.00004545953,0.000024629215],"category_scores_gemma":[0.00027774923,0.00014648373,0.000044543995,0.00025481265,0.000219908,0.0013346522,0.00045344312,0.00008382178,0.00003995322],"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.000010489854,0.0010404724,0.0023981892,0.0018779227,0.00006332539,0.000008681106,0.007734449,6.3375745e-7,0.0052007297,0.90407157,0.0034709503,0.07412261],"study_design_scores_gemma":[0.00083919195,0.00018388614,0.0044041085,0.0008049515,0.00007345901,0.00039002227,0.00048264573,0.023682687,0.0490087,0.9144102,0.0046716705,0.0010485029],"about_ca_topic_score_codex":0.000015548057,"about_ca_topic_score_gemma":0.0000012180559,"teacher_disagreement_score":0.62612736,"about_ca_system_score_codex":0.000023452534,"about_ca_system_score_gemma":0.00004814474,"threshold_uncertainty_score":0.5973433},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6801992,0.0041168653,0.30519283,0.008529195,0.00023783899,0.00017623027,0.0000040906207,0.00007160455,0.0014721106],"genre_scores_gemma":[0.7764345,0.000573713,0.22291026,0.000025245896,0.0000022820477,5.3734148e-8,5.602344e-8,0.0000012605506,0.00005263979],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993512,0.000011939727,0.00015006609,0.0001325694,0.00022630692,0.00012790476],"domain_scores_gemma":[0.9985601,0.000062433166,0.00027634372,0.00012037749,0.0009491468,0.000031603646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010373396,0.000045361467,0.00016959643,0.0013709917,0.00005487298,0.000027963477,0.0009163745,0.000047703503,7.7284983e-7],"category_scores_gemma":[0.00055643346,0.000044357854,0.000021454602,0.002628121,0.00056410494,0.0012118598,0.00041518762,0.000073756964,1.1194402e-7],"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.00003749357,0.00022843307,0.002654932,0.00007130201,0.000022407345,0.00009605051,0.0006397797,0.0000019788054,0.04299769,0.2706982,0.00015155457,0.68240017],"study_design_scores_gemma":[0.00087763194,0.0005800083,0.0035155518,0.00027466897,0.000015176408,0.00019191291,0.0024532015,0.00033812848,0.5733269,0.41340277,0.004856407,0.00016766669],"about_ca_topic_score_codex":0.0000016165981,"about_ca_topic_score_gemma":0.000003007714,"teacher_disagreement_score":0.6822325,"about_ca_system_score_codex":0.000057404057,"about_ca_system_score_gemma":0.0006014728,"threshold_uncertainty_score":0.20784682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01389478,0.00013098445,0.9831591,0.0015586028,0.000016797521,0.00017902418,0.000051581144,0.000017932123,0.0009911571],"genre_scores_gemma":[0.92147547,0.000011416674,0.07831834,0.00009311287,0.000056788984,0.000013536731,0.000019503128,0.000002950666,0.000008885986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993026,0.000016368469,0.00020655885,0.00022630338,0.00017439452,0.000073772324],"domain_scores_gemma":[0.9979693,0.0008434351,0.0003570964,0.00070532,0.0001071401,0.000017661137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048535317,0.000073045085,0.00015911905,0.00007951671,0.00038427912,0.00027737618,0.0012268123,0.000019863428,0.000003637443],"category_scores_gemma":[0.000037987134,0.000044550135,0.00007015565,0.00022007582,0.00015415037,0.00030854146,0.00035229875,0.00004309357,8.0758565e-7],"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.00005670906,0.000117225005,0.0000496469,0.000034507833,0.00085777947,0.000009080979,0.00026167318,0.0015681052,0.000091154594,0.7339551,0.0008282613,0.26217076],"study_design_scores_gemma":[0.00028514667,0.000037896032,0.001556484,0.000011143083,0.0006002616,0.000015696534,0.0000688495,0.82127994,0.0011855365,0.17464747,0.00021400732,0.000097589],"about_ca_topic_score_codex":0.000030428704,"about_ca_topic_score_gemma":0.0000062148088,"teacher_disagreement_score":0.9075807,"about_ca_system_score_codex":0.000006063137,"about_ca_system_score_gemma":0.00003317077,"threshold_uncertainty_score":0.2955603},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041930783,0.00009592909,0.9584191,0.00071497605,0.00021072384,0.00005784297,0.000003173669,0.0004739114,0.0358313],"genre_scores_gemma":[0.6559038,9.4234974e-7,0.34324998,0.00022176513,0.000036473397,0.0000064982705,0.000004501705,0.0000055210717,0.0005705272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999112,0.000008467063,0.0001288713,0.0002757977,0.0002865147,0.00018833972],"domain_scores_gemma":[0.99892455,0.000058821395,0.00012863876,0.0006190389,0.0001967261,0.000072250994],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00016029223,0.00009305771,0.00009928304,0.00012897307,0.00042283162,0.0019006807,0.0016444357,0.000034216177,0.000009528706],"category_scores_gemma":[0.00020257325,0.00009446603,0.000038108454,0.00020291691,0.000101999816,0.0018116422,0.0006263259,0.00008134773,0.00012162652],"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.00000344545,0.0002018353,0.01005437,0.000043788743,0.000033592398,0.000061405415,0.00009981476,0.0020272704,0.0001418341,0.3290806,0.020220686,0.63803136],"study_design_scores_gemma":[0.00034489547,0.00007679534,0.060478516,0.00005414478,0.0000047493445,0.00006814208,0.0000047552057,0.19451275,0.0022425577,0.71611404,0.025639443,0.00045918292],"about_ca_topic_score_codex":0.000012319008,"about_ca_topic_score_gemma":5.6953223e-7,"teacher_disagreement_score":0.65171075,"about_ca_system_score_codex":0.000016107379,"about_ca_system_score_gemma":0.00008344387,"threshold_uncertainty_score":0.99913543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063951784,0.0051229782,0.5219109,0.01571679,0.0014643389,0.00005190986,0.0000022725987,0.00091564417,0.44842],"genre_scores_gemma":[0.85943025,0.000040998548,0.1284032,0.0021779286,0.0002648139,0.000015230308,0.00001729879,0.000020064701,0.009630232],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864423,0.000042421823,0.00033191295,0.00039671853,0.0003252982,0.00025941947],"domain_scores_gemma":[0.99903524,0.00007103133,0.00008260767,0.00057179277,0.0001396126,0.00009973864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022292508,0.00015424589,0.00023978314,0.000337227,0.000022006649,0.00010766405,0.00092898024,0.000047275484,0.00026339293],"category_scores_gemma":[0.00020688852,0.00012736348,0.00003840916,0.0011274545,0.00012519343,0.00054947106,0.00041939417,0.00022731296,0.00004541534],"study_design_candidate":"design_other","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.000008937617,0.00009598992,0.0029135258,0.000009389366,0.000032965065,0.0006369021,0.00070966175,0.0000015766178,0.0018041112,0.008827139,0.054896045,0.9300638],"study_design_scores_gemma":[0.0062976717,0.0014807261,0.048888322,0.006048634,0.00016619994,0.004934409,0.00021607881,0.01868069,0.08837639,0.2544159,0.5678026,0.0026923483],"about_ca_topic_score_codex":0.00013032915,"about_ca_topic_score_gemma":0.00011705848,"teacher_disagreement_score":0.9273714,"about_ca_system_score_codex":0.000038439084,"about_ca_system_score_gemma":0.000040091323,"threshold_uncertainty_score":0.51937324},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.5562737e-7,0.00012880043,0.12964576,0.00011105349,0.00029608863,0.00016074251,0.000021409156,0.0010414298,0.86859417],"genre_scores_gemma":[0.000057948186,0.000017157021,0.011454814,0.000044797867,0.0003084683,4.4035704e-7,0.000018115226,0.00002998675,0.9880683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986027,0.00001797044,0.00014410254,0.0006611686,0.00035103218,0.00022304516],"domain_scores_gemma":[0.99820405,0.000016122865,0.0002027104,0.0009948644,0.0004171207,0.0001651286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013756,0.00029820218,0.00027391835,0.00022290781,0.00009202888,0.00026765082,0.0015301367,0.00024504933,0.0000013064339],"category_scores_gemma":[0.000017838609,0.00036138797,0.00010992187,0.00001350645,0.00018085323,0.0007059964,0.0011705119,0.00035148978,0.000047917598],"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.0000055282244,0.0000037628959,2.4423553e-8,0.000018087341,0.00001681665,0.000084008185,0.000009484873,3.053345e-7,0.000014089111,0.6398511,0.3487608,0.011235992],"study_design_scores_gemma":[0.00012555326,0.000046520825,2.4101635e-7,0.000055441582,0.000030477882,0.000041088213,0.0000016248853,0.00020398607,0.0008097352,0.00068098423,0.99763477,0.00036955322],"about_ca_topic_score_codex":0.000015199015,"about_ca_topic_score_gemma":1.8022412e-7,"teacher_disagreement_score":0.648874,"about_ca_system_score_codex":0.0002775042,"about_ca_system_score_gemma":0.00018610264,"threshold_uncertainty_score":0.99988383},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009583365,0.0081909755,0.040871654,0.00062826683,0.00006060799,0.00028244377,0.0000037389325,0.0014487901,0.9485039],"genre_scores_gemma":[0.00024303758,0.000918996,0.13674365,0.0006580977,0.000026531374,0.000011553246,0.0000034143115,0.00014406312,0.86125064],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877703,0.000029449151,0.00016630208,0.0005608062,0.00023264531,0.00023378902],"domain_scores_gemma":[0.9990687,0.000035726716,0.00009654313,0.00072304625,0.000025602261,0.000050395432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017584575,0.00024273281,0.0003180338,0.00026911357,0.000011181476,0.000394232,0.0009913694,0.0001691646,0.000056219567],"category_scores_gemma":[0.00003658652,0.00020788937,0.000030407718,0.0002507397,0.000084582345,0.0005467375,0.0005770052,0.00013542527,0.00011561936],"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":[4.3568514e-7,0.000026494323,0.00015212478,0.00049167883,0.000008746691,0.000015514785,0.000047619284,0.0000014476061,0.0000075230623,0.0049630105,0.97547114,0.018814279],"study_design_scores_gemma":[0.00020814135,0.000066727116,0.00006224523,0.0036608067,0.0000066059756,0.000026821599,0.000012411671,0.009584009,0.00054463436,0.008051774,0.9769824,0.00079342484],"about_ca_topic_score_codex":0.0001342674,"about_ca_topic_score_gemma":0.000019253452,"teacher_disagreement_score":0.095872,"about_ca_system_score_codex":0.0000152520215,"about_ca_system_score_gemma":0.000062143285,"threshold_uncertainty_score":0.8477482},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.60585e-7,0.0017595508,0.14417233,0.000046007815,0.00049335917,0.00038812216,0.0008073565,0.00068511686,0.8516475],"genre_scores_gemma":[0.00029947553,0.0007519692,0.061319716,0.000051832176,0.00043482677,0.000022891134,0.0005952132,0.000098637276,0.93642545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99706274,0.000015772974,0.0008862547,0.000848995,0.00082578056,0.00036044672],"domain_scores_gemma":[0.99654096,0.000103914215,0.0007386129,0.0021223377,0.00030904636,0.00018513025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002728958,0.00054993277,0.00073994155,0.00037031184,0.0000507685,0.0007440726,0.0022877234,0.00023046717,0.00001654289],"category_scores_gemma":[0.000121569385,0.0005316242,0.00019336192,0.00010707404,0.00016075591,0.003807525,0.00087262475,0.0003692638,0.00034074875],"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.000008377214,0.00012290968,0.0000060872853,0.0009242076,0.00008617662,0.0005084576,0.000094997224,8.333713e-7,0.00011331167,0.42491868,0.15938947,0.4138265],"study_design_scores_gemma":[0.0001316787,0.00011689319,0.0000017178342,0.0014572445,0.000023625802,0.000101406345,0.0000033066517,0.0002559335,0.00014715425,0.011170078,0.9858936,0.0006973459],"about_ca_topic_score_codex":0.000010581197,"about_ca_topic_score_gemma":8.455723e-7,"teacher_disagreement_score":0.8265042,"about_ca_system_score_codex":0.00006991284,"about_ca_system_score_gemma":0.00025798293,"threshold_uncertainty_score":0.99971354},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.4032391e-8,0.000074867254,0.4779567,0.00005945177,0.00012645699,0.00007494503,0.0000031144746,0.0031586322,0.5185458],"genre_scores_gemma":[0.0000024605201,0.000010306211,0.4621895,0.0002797379,0.00009701918,0.0000043966425,0.000005796103,0.000027510623,0.53738326],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998529,0.000004267723,0.00025478957,0.0006137561,0.0003479504,0.0002502016],"domain_scores_gemma":[0.9984618,0.00003635852,0.0001519617,0.0009333297,0.00031901404,0.00009753461],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010738707,0.00032289056,0.00027281384,0.0001955391,0.000058241723,0.00065279024,0.0016331133,0.000250743,0.0004426713],"category_scores_gemma":[0.000020509862,0.00028910363,0.00011249229,0.00004197024,0.00013864484,0.0008030368,0.00081360486,0.00018752289,0.0012174516],"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":[4.7733045e-7,0.000008321923,5.0678306e-8,0.000013360803,0.000021289357,0.000030848936,0.000037355287,5.9766667e-9,0.000009506548,0.17653385,0.14976722,0.6735777],"study_design_scores_gemma":[0.000038479204,0.000069176516,2.1968033e-7,0.000110375586,0.000005783962,0.000031641932,1.9067897e-7,0.0064436942,0.0016977369,0.5914376,0.3997924,0.00037268302],"about_ca_topic_score_codex":0.0000033290646,"about_ca_topic_score_gemma":0.0000023201867,"teacher_disagreement_score":0.673205,"about_ca_system_score_codex":0.00005433994,"about_ca_system_score_gemma":0.000106936066,"threshold_uncertainty_score":0.99995613},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009712172,0.0000072118496,0.985004,0.0009512955,0.000048731028,0.00012269038,7.7168835e-7,0.00008666108,0.012807391],"genre_scores_gemma":[0.43405634,4.473066e-7,0.5657948,0.00003506347,0.0000039178944,0.0000018083496,1.10734085e-7,0.000003400859,0.00010408685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912846,0.000013008533,0.00028435042,0.00017831277,0.00028060807,0.000115258095],"domain_scores_gemma":[0.99830407,0.000022799473,0.0003354475,0.0011081717,0.00019538427,0.000034128516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001774092,0.000084146996,0.00016776202,0.000016621254,0.00009802907,0.00027265036,0.001751589,0.000044278262,0.0000063867788],"category_scores_gemma":[0.00042472858,0.000054523705,0.00006620531,0.00009371325,0.00031829783,0.0006579169,0.0007990873,0.00005922262,6.661291e-7],"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.000028041293,0.0017759524,0.0019472953,0.000391181,0.00005339973,0.0000065235367,0.0003451985,0.011273779,0.024685891,0.93768823,0.0007501296,0.021054382],"study_design_scores_gemma":[0.00032139185,0.00007166668,0.002879384,0.00018432942,0.000011082355,0.000016349246,0.0000047724716,0.91495425,0.042581107,0.03877519,0.000033759363,0.00016671489],"about_ca_topic_score_codex":0.000042946715,"about_ca_topic_score_gemma":0.0000030074484,"teacher_disagreement_score":0.9036805,"about_ca_system_score_codex":0.000012906325,"about_ca_system_score_gemma":0.00007014325,"threshold_uncertainty_score":0.32549173},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011875626,0.0012612221,0.37883452,0.00043518044,0.0033103803,0.00023070654,0.000040575444,0.00076962705,0.6151059],"genre_scores_gemma":[0.0005202225,0.00014592591,0.212084,0.0016731722,0.0013064949,0.000076997756,0.00010416681,0.00010647471,0.7839826],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966749,0.0000869815,0.00051392196,0.0012802263,0.0006694282,0.00077457546],"domain_scores_gemma":[0.99667823,0.000062164094,0.00042724042,0.0020380083,0.00056666404,0.00022768813],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003218522,0.00064801547,0.0006332464,0.00033005327,0.00017971675,0.0024173069,0.0039276574,0.00053134304,0.0046880143],"category_scores_gemma":[0.0001388423,0.0006472958,0.00020927009,0.000628927,0.000412084,0.002090543,0.0015837781,0.0005754316,0.32751787],"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.0000035026155,0.000059606395,8.316722e-7,0.00012927654,0.00002420841,0.000041874704,0.000083466904,5.5925574e-7,0.000103106795,0.00012161256,0.9349838,0.06444817],"study_design_scores_gemma":[0.00013240328,0.0001509028,0.0000057593434,0.00027626663,0.000014509164,0.00007288846,0.0000017368741,0.0013203648,0.0029580917,0.014151342,0.9801451,0.000770657],"about_ca_topic_score_codex":0.000025121195,"about_ca_topic_score_gemma":0.0000011084329,"teacher_disagreement_score":0.32282984,"about_ca_system_score_codex":0.0001707312,"about_ca_system_score_gemma":0.00050927955,"threshold_uncertainty_score":0.99959785},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0483772,0.00006529799,0.93848276,0.0013425548,0.00002083914,0.00011057303,3.5252546e-7,0.0012272128,0.010373216],"genre_scores_gemma":[0.5236955,0.0000015892224,0.4756284,0.00039644615,0.0000131844,0.000014583917,3.37949e-7,0.000007913534,0.00024202693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99896926,0.000006216024,0.00015636832,0.00035891854,0.0002466116,0.00026264775],"domain_scores_gemma":[0.9993389,0.000010085337,0.00004546663,0.0004329686,0.00008666783,0.0000859027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009080413,0.00013442864,0.000116555275,0.0000617192,0.00008530106,0.00057974725,0.0007559555,0.000030908708,0.000002567533],"category_scores_gemma":[0.000028836204,0.00008803124,0.00002479294,0.00028594313,0.00013201415,0.0014300882,0.0002351075,0.00012621263,0.000022498429],"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.00009634243,0.0009704217,0.0050531724,0.0002459873,0.000066708104,0.00033375222,0.004940378,0.0023523262,0.04374995,0.5794587,0.00060353044,0.3621287],"study_design_scores_gemma":[0.0014999942,0.0010454931,0.0025089786,0.00092596584,0.000014342363,0.00068878656,0.00014628838,0.01242433,0.7664214,0.20891511,0.0035151727,0.001894169],"about_ca_topic_score_codex":0.000017062705,"about_ca_topic_score_gemma":0.000015310048,"teacher_disagreement_score":0.7226714,"about_ca_system_score_codex":0.000042525793,"about_ca_system_score_gemma":0.00015337067,"threshold_uncertainty_score":0.5590516},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010052214,0.00010309983,0.17971504,0.000010599622,0.000136518,0.00017006895,0.000031289346,0.0011615518,0.8186708],"genre_scores_gemma":[0.00025578038,0.000039013994,0.017373204,0.00009636233,0.000046051377,6.138717e-7,0.000007892413,0.000043283304,0.9821378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985545,0.000015843389,0.00017105803,0.00067710853,0.0002758004,0.0003056781],"domain_scores_gemma":[0.9982026,0.00002542163,0.00022780335,0.0011672772,0.00020448459,0.00017240977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008242602,0.000384412,0.00033373456,0.0002450113,0.00012264102,0.0002518335,0.0025577757,0.0003055826,0.000002276728],"category_scores_gemma":[0.000006275052,0.0004612271,0.00019681509,0.000011070854,0.00024301089,0.0006110446,0.0017809167,0.00039263364,0.000060982922],"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.000007644883,0.000007018696,1.8272694e-7,0.000042259806,0.000035100034,0.0003374378,0.000024199559,2.4174254e-8,0.00001908968,0.93409693,0.050090615,0.015339471],"study_design_scores_gemma":[0.00013562742,0.00005637846,0.0000016066612,0.00016259198,0.00004311055,0.000042920718,0.0000010287382,0.00006233817,0.001965151,0.0015335121,0.99545825,0.0005375093],"about_ca_topic_score_codex":0.00003828438,"about_ca_topic_score_gemma":2.5684125e-7,"teacher_disagreement_score":0.94536763,"about_ca_system_score_codex":0.00013585851,"about_ca_system_score_gemma":0.0001376811,"threshold_uncertainty_score":0.99978393},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007944226,0.0004986905,0.94319624,0.00047679892,0.00087442365,0.00035525288,0.0000023924863,0.0007938688,0.053794373],"genre_scores_gemma":[0.025223687,0.000028440214,0.9691784,0.0017158265,0.0002570948,0.000025449812,0.0000040320742,0.000051575873,0.0035154973],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602574,0.000014644004,0.00047386382,0.0016522976,0.0010164899,0.000816945],"domain_scores_gemma":[0.997074,0.00019114575,0.00026545103,0.0018396174,0.00041758068,0.00021217037],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00053440727,0.0005685614,0.00050817174,0.0007286586,0.0001951867,0.0027190596,0.0054984884,0.00031220625,0.000038684062],"category_scores_gemma":[0.00009351351,0.0005161359,0.000108165616,0.0008116628,0.0008738191,0.0023509122,0.0024988437,0.00073915976,0.00026049378],"study_design_candidate":"design_other","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":[5.993306e-7,0.000019843208,0.000009752342,0.000028757242,0.0000041760686,0.000051077503,0.00014503623,0.00047218116,0.000116134506,0.023376523,0.00024129158,0.9755346],"study_design_scores_gemma":[0.00012001171,0.00016252547,0.000014931067,0.0005228331,0.0000048638435,0.00010888367,4.0411095e-8,0.22430484,0.0067750863,0.75297546,0.014039389,0.000971154],"about_ca_topic_score_codex":0.000049189857,"about_ca_topic_score_gemma":0.000022126957,"teacher_disagreement_score":0.9745635,"about_ca_system_score_codex":0.00019168788,"about_ca_system_score_gemma":0.0005880025,"threshold_uncertainty_score":0.9998822},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.3477396e-8,0.00017125721,0.4230861,0.00014897736,0.00006663456,0.00008846925,0.0000051703446,0.0014950972,0.57493824],"genre_scores_gemma":[0.00007685603,0.0000061366677,0.18147783,0.00014724006,0.00011881365,0.000011399815,0.000019243793,0.000046374877,0.8180961],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816483,0.0000038278445,0.00027815552,0.0007453154,0.000458103,0.0003497519],"domain_scores_gemma":[0.9976041,0.000024957375,0.00040045267,0.001569818,0.00028148197,0.000119213735],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00011589289,0.00038946158,0.0003512238,0.00017474777,0.00021510273,0.014963725,0.0043531144,0.00022988048,0.000013380941],"category_scores_gemma":[0.00011012555,0.00034679673,0.00013396479,0.000046945912,0.0002611853,0.008866773,0.0016684757,0.0003320269,0.0005521749],"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":[4.8355156e-7,0.00001662697,5.3348714e-7,0.000097325224,0.0000059651998,0.0000741001,0.0000171069,6.9420136e-9,0.000008167006,0.0114704035,0.2183172,0.76999205],"study_design_scores_gemma":[0.00006236912,0.00003541273,0.0000015598176,0.00049869757,0.0000062785834,0.000068256006,4.86429e-7,0.0009290485,0.0005473139,0.25723666,0.74000347,0.00061046315],"about_ca_topic_score_codex":5.6203646e-7,"about_ca_topic_score_gemma":3.933654e-7,"teacher_disagreement_score":0.76938164,"about_ca_system_score_codex":0.00011928928,"about_ca_system_score_gemma":0.0010017124,"threshold_uncertainty_score":0.9998984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009258136,0.000022035521,0.98213816,0.0009294785,0.0000035831617,0.00034135667,0.000020299987,0.00005571672,0.007231263],"genre_scores_gemma":[0.94024545,0.0000018244406,0.059043437,0.000095641466,0.000006368989,0.0005557396,0.0000030748786,0.0000039709626,0.000044503162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958336,0.000009517907,0.00008734087,0.00012648678,0.00013740505,0.000055886878],"domain_scores_gemma":[0.9994516,0.00013274101,0.00009902918,0.00025639537,0.0000442472,0.000015980988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014929008,0.000055161247,0.00006660121,0.00002395599,0.00021946382,0.00008803317,0.00024981488,0.000007914306,0.000008696725],"category_scores_gemma":[0.000018831714,0.000035301928,0.000011916497,0.00015690745,0.000118266275,0.00008122033,0.00012694181,0.00006455494,7.575536e-7],"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":[4.810255e-7,0.0000706185,0.0000049209093,0.00001528713,0.0000057194006,1.7564341e-7,0.0002996572,0.000028096048,0.0009063222,0.9923744,0.00033360993,0.005960704],"study_design_scores_gemma":[0.0001225155,0.00017424655,0.000054391294,0.00003338298,0.000016187141,0.000033959735,0.00034795402,0.07194523,0.028724333,0.89732516,0.0010467545,0.00017591355],"about_ca_topic_score_codex":8.6971835e-7,"about_ca_topic_score_gemma":5.8831495e-7,"teacher_disagreement_score":0.9309873,"about_ca_system_score_codex":0.0000087660455,"about_ca_system_score_gemma":0.00002216671,"threshold_uncertainty_score":0.16879605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5119278,0.00039548575,0.48316985,0.00047928028,0.00039841622,0.00026494148,0.00013128378,0.00040359146,0.002829384],"genre_scores_gemma":[0.86087036,0.0000018038669,0.13905941,0.000041582767,0.0000035473324,0.000003999769,0.000002827904,0.0000041989365,0.000012245977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932986,0.000031591968,0.00016275154,0.00018788445,0.00019592175,0.00009199758],"domain_scores_gemma":[0.99951684,0.000020656347,0.00012583093,0.00024516947,0.00006620782,0.00002527859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008898073,0.00007013253,0.00013575799,0.00014549473,0.00006522304,0.000027427885,0.0004325334,0.000016931255,0.00001028944],"category_scores_gemma":[0.0000117208465,0.00007089562,0.00003963666,0.00040467232,0.00019681115,0.00028474448,0.0004774351,0.00009489726,8.8662695e-8],"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.000033091095,0.00030083692,0.0015086462,0.00016856854,0.00008876467,0.000012240152,0.0017494607,0.000022635788,0.09715386,0.45072123,0.0014555232,0.44678515],"study_design_scores_gemma":[0.00023995737,0.00041940843,0.002333393,0.000018748146,0.000009666272,0.00010636797,0.00008430236,0.023463575,0.25517407,0.7175749,0.00039232455,0.0001832882],"about_ca_topic_score_codex":0.00005740211,"about_ca_topic_score_gemma":0.0000018504145,"teacher_disagreement_score":0.44660187,"about_ca_system_score_codex":0.000012819513,"about_ca_system_score_gemma":0.00002183628,"threshold_uncertainty_score":0.28910396},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053389102,0.000039258135,0.8866123,0.0068679173,0.0005340345,0.00095649576,0.00001910464,0.00087160897,0.050710205],"genre_scores_gemma":[0.98774534,0.000005638802,0.011173193,0.0002391641,0.000021848473,0.000049885293,8.671546e-7,0.000018008694,0.0007460434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805677,0.000016778275,0.0003620978,0.0004833233,0.0007867766,0.00029423652],"domain_scores_gemma":[0.99874395,0.000043858367,0.00037832002,0.00032889209,0.00044299653,0.00006197208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033557304,0.0002068437,0.00019112538,0.00015539868,0.00035112377,0.0005482562,0.002524733,0.000037935293,0.00007123298],"category_scores_gemma":[0.00011760964,0.00015457153,0.000068385496,0.0009933867,0.00019452185,0.0010175866,0.0009333263,0.00032280016,0.000022804703],"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.00005364965,0.00015721114,0.00024713395,0.000028780856,0.000010206839,9.995272e-7,0.000742768,0.00010903777,0.017500963,0.94344497,0.0003004715,0.03740378],"study_design_scores_gemma":[0.000026316375,0.0004735898,0.00007685618,0.000094447125,0.000009786992,0.000018067773,0.00048742263,0.022119548,0.52895004,0.44690734,0.0005396799,0.0002969238],"about_ca_topic_score_codex":0.00002129503,"about_ca_topic_score_gemma":0.0000024847845,"teacher_disagreement_score":0.9343563,"about_ca_system_score_codex":0.00011091129,"about_ca_system_score_gemma":0.00014933187,"threshold_uncertainty_score":0.6303244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18816939,0.00018290742,0.78260976,0.00010925183,0.00019161293,0.00024474674,0.000008665151,0.0010543122,0.027429353],"genre_scores_gemma":[0.966399,0.000105864,0.032242935,0.00014088325,0.0000313094,4.9728e-7,0.0000061550936,0.000018820396,0.0010545119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998184,0.00005946174,0.00026742008,0.0010185635,0.00013364681,0.0003368666],"domain_scores_gemma":[0.9976354,0.000053959,0.00039126448,0.0014995317,0.00028293743,0.00013687674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023086235,0.00033223757,0.00044013263,0.0003721617,0.00006645484,0.00023018991,0.0033579934,0.0002786586,0.000008269118],"category_scores_gemma":[0.00006314661,0.00039338667,0.00023294365,0.0007005946,0.0001907416,0.00089458266,0.0025374708,0.0004724491,0.000042170148],"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.000048937243,0.0007234424,0.0021818404,0.0005565532,0.00014333572,0.0007585972,0.0005678137,0.0061931023,0.0017170896,0.9351313,0.0021462513,0.049831714],"study_design_scores_gemma":[0.00032136415,0.00014306637,0.0014324924,0.00040471085,0.00006324468,0.000015901353,0.000016711598,0.09920408,0.016810693,0.87999296,0.0007615245,0.00083326333],"about_ca_topic_score_codex":0.000051875322,"about_ca_topic_score_gemma":0.0000040974683,"teacher_disagreement_score":0.77822965,"about_ca_system_score_codex":0.00010689522,"about_ca_system_score_gemma":0.0002675274,"threshold_uncertainty_score":0.9998518},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20336579,0.00014182758,0.7947742,0.0009047094,0.00041060126,0.00013942184,0.000008045346,0.00016841026,0.00008700519],"genre_scores_gemma":[0.7258904,0.000099270335,0.27336735,0.00046916908,0.000091269954,0.000008486722,0.000052631167,0.000015905449,0.0000055512664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978223,0.00008001851,0.0005397718,0.0008871609,0.00032567827,0.0003450697],"domain_scores_gemma":[0.9988168,0.00031585403,0.00014840046,0.00039110362,0.00015508191,0.00017275743],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00057478016,0.00033785464,0.0003553729,0.001737608,0.00031246405,0.0016652367,0.0003943083,0.00019628547,0.00000343616],"category_scores_gemma":[0.000007752519,0.00031452862,0.00006383481,0.0014838353,0.00036159452,0.0016780371,0.000848271,0.00056396105,0.000001653844],"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.000008065326,0.0002698724,0.009427996,0.000040412313,0.000012446131,0.000024704284,0.00024028869,0.00006926484,0.000010566432,0.3081926,0.000375928,0.6813278],"study_design_scores_gemma":[0.00066303945,0.00030600588,0.15745293,0.00013112873,0.0000051219686,0.00009285547,0.0000012617055,0.76214004,0.0000049292103,0.07797355,0.0009297206,0.0002994145],"about_ca_topic_score_codex":0.00007994398,"about_ca_topic_score_gemma":0.00020267193,"teacher_disagreement_score":0.7620708,"about_ca_system_score_codex":0.000014694272,"about_ca_system_score_gemma":0.00003015683,"threshold_uncertainty_score":0.9999307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14680983,0.000081430204,0.8421365,0.000095456475,0.00010192035,0.00011221462,0.000011714669,0.00053663866,0.010114304],"genre_scores_gemma":[0.978893,0.00000788439,0.020708377,0.00004840474,0.000007130553,7.696567e-7,0.000002391138,0.000009972067,0.00032209582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990009,0.000054505526,0.00013773047,0.000436039,0.00011540238,0.0002553953],"domain_scores_gemma":[0.99905765,0.00003868967,0.00013759846,0.0006164697,0.00007565362,0.00007394204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018055945,0.000119449614,0.00014077293,0.00018987115,0.00018282239,0.00008969614,0.0017543747,0.000026236163,0.00003700406],"category_scores_gemma":[0.000016345859,0.00014587393,0.00007968114,0.0008914238,0.00007325123,0.0011049989,0.0014078508,0.00015964995,0.0000125325405],"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.00013412198,0.0012344461,0.016793905,0.0002538505,0.00015995266,0.0015887283,0.0011998848,0.027705437,0.015095064,0.8634857,0.004312714,0.06803619],"study_design_scores_gemma":[0.0010316722,0.00073212077,0.0025371395,0.000072996874,0.00005776822,0.00010236229,0.0007316653,0.49174452,0.020500077,0.478182,0.0032643988,0.0010432897],"about_ca_topic_score_codex":0.00004959424,"about_ca_topic_score_gemma":0.0000063092652,"teacher_disagreement_score":0.83208317,"about_ca_system_score_codex":0.00008652594,"about_ca_system_score_gemma":0.0000998018,"threshold_uncertainty_score":0.5948566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073089777,0.000856987,0.9795304,0.0026545965,0.00036664348,0.00215588,0.00024048984,0.003621656,0.009842469],"genre_scores_gemma":[0.7881167,0.00005342014,0.20797192,0.00005092335,0.00020881985,0.0015707418,0.00016611807,0.00013575159,0.0017256221],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946348,0.00037490114,0.00054030964,0.0015913071,0.0014893841,0.001369314],"domain_scores_gemma":[0.9941473,0.0018431674,0.0002227516,0.0017553886,0.0017441381,0.0002872254],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027671137,0.00045619396,0.00056102517,0.0011593195,0.00061750686,0.005935361,0.0041045328,0.0003782084,0.0000046675596],"category_scores_gemma":[0.0013153511,0.0004580112,0.00030891126,0.0011225556,0.00040968604,0.000966898,0.0047783335,0.0015341815,0.000058359325],"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.000303524,0.0019529621,0.0021282176,0.047186892,0.00034281498,0.0014308771,0.0017668064,0.018963473,0.018823635,0.05798079,0.29856664,0.5505534],"study_design_scores_gemma":[0.0007901007,0.0006002584,0.0006869159,0.00840538,0.000017356811,0.000009501587,0.00017352124,0.2813988,0.08055999,0.62246317,0.0035432957,0.0013517381],"about_ca_topic_score_codex":0.00017857029,"about_ca_topic_score_gemma":0.000024712093,"teacher_disagreement_score":0.78738576,"about_ca_system_score_codex":0.00030920975,"about_ca_system_score_gemma":0.0017305257,"threshold_uncertainty_score":0.99978715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6026968,0.00012320845,0.3824596,0.0005267762,0.0005430321,0.0005991466,0.00005429766,0.002603087,0.010394039],"genre_scores_gemma":[0.99488884,0.00004855364,0.0020584248,0.000051627216,0.000021926473,0.0000028060415,0.000019511419,0.000021681575,0.0028866308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982767,0.000053549797,0.00021660695,0.0010274218,0.000072252056,0.00035345016],"domain_scores_gemma":[0.99880975,0.00012766996,0.00018144373,0.00066165376,0.00012369083,0.00009577336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018200488,0.00028373764,0.0003801031,0.00042633354,0.000059642218,0.0007598378,0.0014157998,0.00026623337,0.000002080631],"category_scores_gemma":[0.00012731813,0.0003354448,0.000072432165,0.0005167319,0.00039599882,0.0013791079,0.0049693906,0.00045002112,0.000022830838],"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.00005428207,0.00030664404,0.19056945,0.000580348,0.000097351825,0.003695499,0.0012811911,0.0007251704,0.000026707858,0.79219055,0.0014948592,0.008977949],"study_design_scores_gemma":[0.00046795522,0.0000891973,0.0053518363,0.00030338854,0.000014679356,0.00002397341,0.00018551704,0.061435133,0.00020867471,0.9307469,0.0004450289,0.00072770147],"about_ca_topic_score_codex":0.00022195198,"about_ca_topic_score_gemma":0.00018615989,"teacher_disagreement_score":0.39219204,"about_ca_system_score_codex":0.000106982414,"about_ca_system_score_gemma":0.0001949704,"threshold_uncertainty_score":0.99990976},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6474947e-7,0.0003321458,0.0065165446,0.00015051925,0.00047449025,0.0002717463,0.000010147774,0.0030966233,0.9891476],"genre_scores_gemma":[0.00003095708,0.00005234241,0.027142692,0.0005194571,0.0001216607,0.000040537532,0.000007439483,0.000116551964,0.97196835],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979173,0.000011351521,0.00039443962,0.00077870407,0.0005228364,0.00037537262],"domain_scores_gemma":[0.9980835,0.00006003163,0.00024114951,0.0013163092,0.00015845416,0.00014056671],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024060464,0.00044981425,0.00042776662,0.00039498412,0.000098115685,0.0006253154,0.0020660302,0.0002831826,0.000011678751],"category_scores_gemma":[0.000025980957,0.00044076992,0.00025775982,0.000050273942,0.0001628558,0.00033758895,0.0011039602,0.00044714633,0.0012053419],"study_design_candidate":"design_other","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":[6.027345e-7,0.0000028576526,2.4086611e-7,0.000045118988,0.000023353923,0.000105710766,0.000054153046,3.4687485e-8,0.000007822892,0.13926357,0.0022179687,0.8582786],"study_design_scores_gemma":[0.000031675136,0.000024919533,8.087071e-7,0.00031138526,0.0000099070585,0.000017155027,1.9548787e-7,0.000019232148,0.00014711652,0.45174628,0.5473824,0.00030890634],"about_ca_topic_score_codex":1.7247787e-7,"about_ca_topic_score_gemma":0.000003152992,"teacher_disagreement_score":0.85796964,"about_ca_system_score_codex":0.000049525926,"about_ca_system_score_gemma":0.00015244579,"threshold_uncertainty_score":0.99980444},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000058708115,0.0004477705,0.4195123,0.000031591746,0.00026999286,0.00035645548,0.000025492349,0.0011245852,0.578226],"genre_scores_gemma":[0.0011513274,0.00005624292,0.027023988,0.0002985188,0.00010363552,0.000057701138,0.000007728774,0.000106555686,0.9711943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834824,0.00001491805,0.00025522299,0.000774181,0.0003513707,0.0002560822],"domain_scores_gemma":[0.9986631,0.00021196071,0.0001300149,0.00069652585,0.000094422896,0.00020395867],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00020674888,0.0003407729,0.00036239502,0.00023643915,0.00007739794,0.0010765718,0.00082419266,0.0002480562,0.0000016494066],"category_scores_gemma":[0.000048759102,0.00036125968,0.00003893174,0.000021568423,0.000115039365,0.00026520836,0.0013650865,0.00029271594,0.000043450014],"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.0000054492966,0.000008959486,0.0000014719309,0.00008133678,0.000070989634,0.00016808379,0.00073465257,5.1900656e-7,0.00015009672,0.71743554,0.034744654,0.24659824],"study_design_scores_gemma":[0.0001181906,0.000099742516,0.000007889402,0.00036146547,0.000020697638,0.000014546492,9.759207e-7,0.00027773733,0.0027836463,0.85121584,0.14458734,0.00051195035],"about_ca_topic_score_codex":0.000036875907,"about_ca_topic_score_gemma":0.0000010654226,"teacher_disagreement_score":0.39296836,"about_ca_system_score_codex":0.000038850754,"about_ca_system_score_gemma":0.000058050635,"threshold_uncertainty_score":0.9999604},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.727489,0.001958685,0.18606669,0.0013646414,0.0034136756,0.00026235866,0.000021970536,0.0007383208,0.07868463],"genre_scores_gemma":[0.9821236,0.000073939336,0.01741433,0.000048422422,0.000032466112,2.4417696e-7,0.0000014520799,0.000028268354,0.00027725505],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981056,0.00021010695,0.0007335313,0.00015165904,0.000594446,0.00020469564],"domain_scores_gemma":[0.9976771,0.00015469962,0.0008897352,0.00041279843,0.0007556024,0.00011005101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011397968,0.00014235933,0.00032055136,0.00031050312,0.000051904983,0.0000790838,0.0015457458,0.000018661452,0.000004231206],"category_scores_gemma":[0.00033581897,0.00012791964,0.00010627188,0.0013009837,0.0001065243,0.00081438787,0.00071217347,0.0001887629,0.000018575638],"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.00025743316,0.0024319754,0.01734814,0.0012332443,0.0005246102,0.010197818,0.0041341875,0.00065750006,0.035540074,0.11290292,0.47192755,0.34284455],"study_design_scores_gemma":[0.009374385,0.008573849,0.04677948,0.0032512061,0.00018165616,0.0029460725,0.00030591656,0.013128768,0.33845943,0.5197904,0.055158217,0.0020506207],"about_ca_topic_score_codex":0.0000012224523,"about_ca_topic_score_gemma":2.773376e-7,"teacher_disagreement_score":0.41676936,"about_ca_system_score_codex":0.000045918398,"about_ca_system_score_gemma":0.00013398194,"threshold_uncertainty_score":0.52164114},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022427281,0.000032553067,0.9751754,0.0010524752,0.00003217358,0.000053564767,0.00003426626,0.0006796005,0.0005127184],"genre_scores_gemma":[0.9813551,0.00014625344,0.018374918,0.000044633256,0.000002153096,0.000019627101,0.0000016283017,0.0000063150383,0.000049399147],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991675,0.000016133627,0.00017346037,0.00026737567,0.0002310586,0.0001444415],"domain_scores_gemma":[0.9988733,0.00037039767,0.00005916062,0.00057306536,0.00006938739,0.000054722655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014837304,0.00009953678,0.00016558425,0.0010177605,0.00009740047,0.00025835948,0.0006689441,0.000049717342,0.0000020376522],"category_scores_gemma":[0.00009488807,0.00009298603,0.0001247066,0.004391503,0.00018279167,0.0009975198,0.000022054333,0.00008973268,0.0000060295265],"study_design_candidate":"design_other","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.000008932606,0.00027704367,0.0062072854,0.00009453956,0.0007009722,0.00002556994,0.00046231426,0.00016746466,0.0005338156,0.0072076637,0.00008809528,0.9842263],"study_design_scores_gemma":[0.00040631666,0.0005992665,0.027413804,0.00028310923,0.001154678,0.000052637213,0.00027988263,0.0817252,0.19950044,0.6865384,0.00067553006,0.0013707341],"about_ca_topic_score_codex":0.000013931887,"about_ca_topic_score_gemma":0.000011376867,"teacher_disagreement_score":0.98285556,"about_ca_system_score_codex":0.000006894817,"about_ca_system_score_gemma":0.000026365018,"threshold_uncertainty_score":0.37918603},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22273275,0.00004961614,0.7612244,0.002500482,0.00019183221,0.00028312317,0.000044265213,0.0011020197,0.011871503],"genre_scores_gemma":[0.90669507,0.0000014560669,0.092575,0.00032759167,0.000023161878,0.000023798153,0.000037952184,0.000015547468,0.00030039967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987737,0.000040300383,0.0002640756,0.00029453382,0.00040543766,0.00022194094],"domain_scores_gemma":[0.9983496,0.0009276989,0.00013786281,0.00034939044,0.00018699442,0.000048445272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034260194,0.00015327382,0.00016759826,0.00023459074,0.00011584095,0.00029773367,0.0008911049,0.00004076247,0.000036464142],"category_scores_gemma":[0.00033162456,0.00010791669,0.000099338846,0.0016126622,0.00014014484,0.00045801935,0.00035494263,0.000115933915,0.00016295882],"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.00008361188,0.00035397027,0.009975358,0.00020180459,0.0002763479,0.000044739518,0.0012465299,0.007469628,0.003386969,0.82328224,0.01047088,0.14320794],"study_design_scores_gemma":[0.00035011448,0.00013598787,0.025523264,0.00011217301,0.000012002796,0.000019246352,0.00007711197,0.62310046,0.014100082,0.3356779,0.00052350573,0.00036816683],"about_ca_topic_score_codex":0.000008119896,"about_ca_topic_score_gemma":1.3961184e-7,"teacher_disagreement_score":0.68396235,"about_ca_system_score_codex":0.0000147388055,"about_ca_system_score_gemma":0.000066045446,"threshold_uncertainty_score":0.4400715},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027075259,0.000012592059,0.9703554,0.000083664105,0.00037916042,0.0001585002,0.000004432523,0.0018308191,0.00010020111],"genre_scores_gemma":[0.98204374,0.00014599008,0.01715865,0.00046642637,0.000033563047,0.000034660432,0.0000075464195,0.000027883407,0.000081551625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988167,0.000049613474,0.00022415248,0.00044105382,0.0002470141,0.00022142967],"domain_scores_gemma":[0.999287,0.00008622312,0.00007021545,0.0002779828,0.00018150886,0.00009705248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017538117,0.0001849879,0.00015788518,0.0005714397,0.00032163356,0.00054549857,0.00024694405,0.000088075845,0.0000025594597],"category_scores_gemma":[0.0000018417248,0.00017547714,0.00004892693,0.0016173198,0.00012716887,0.0010792986,0.0000059664976,0.00014975308,0.000011790924],"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.00005856382,0.00034913453,0.00034253125,0.0001735716,0.00012819475,0.000026625854,0.0022260798,0.0011613679,0.0005510228,0.6761656,0.00056951697,0.31824782],"study_design_scores_gemma":[0.00038992512,0.00025503951,0.0002347416,0.00012440878,0.000013941337,0.00009434304,0.000048676615,0.98600376,0.009619508,0.00258923,0.00032320037,0.00030322745],"about_ca_topic_score_codex":0.0000072709286,"about_ca_topic_score_gemma":0.0000096022795,"teacher_disagreement_score":0.9848424,"about_ca_system_score_codex":0.00001835459,"about_ca_system_score_gemma":0.00004617086,"threshold_uncertainty_score":0.715575},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069658404,0.00001106768,0.97698355,0.00061392353,0.00023148804,0.0013745708,0.000048904505,0.00083481136,0.019894745],"genre_scores_gemma":[0.00001084143,0.000008489873,0.8743543,0.00021034066,0.0013446657,0.0002763399,0.00007394832,0.00007771112,0.12364334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984734,0.000004345114,0.0003744737,0.0006425505,0.000254412,0.00025079],"domain_scores_gemma":[0.9989305,0.000116192336,0.00023553155,0.00042906895,0.00013036976,0.00015833738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005804423,0.00030855226,0.00042708876,0.000075100674,0.00022269327,0.0008486839,0.00045693666,0.00047368527,9.816649e-7],"category_scores_gemma":[0.000041337826,0.00030074222,0.000105704996,0.00007745925,0.0001625967,0.00017107296,0.0004197457,0.00027451545,0.0000025420015],"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.0000087095605,0.0000620977,5.335154e-8,0.00064144237,0.00014352577,6.3597616e-7,0.0031178454,0.000094327224,0.00020119328,0.57933223,0.26407292,0.15232499],"study_design_scores_gemma":[0.0007469457,0.00026688515,2.904749e-8,0.00018673683,0.000110171335,0.000012538518,0.00016785595,0.04587262,0.0022598528,0.9013068,0.048267264,0.0008022863],"about_ca_topic_score_codex":5.443168e-7,"about_ca_topic_score_gemma":2.7361673e-7,"teacher_disagreement_score":0.32197458,"about_ca_system_score_codex":0.000060770493,"about_ca_system_score_gemma":0.00019610833,"threshold_uncertainty_score":0.99994445},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037575928,0.0008784033,0.98025894,0.00046080124,0.0005976984,0.00031867932,0.0000046753817,0.00079218316,0.016684832],"genre_scores_gemma":[0.002860191,0.000027451919,0.995157,0.00060935935,0.00022144923,0.000022796572,0.000003406397,0.000043440396,0.0010548871],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966252,0.000008934259,0.0004233137,0.0015350175,0.00083603617,0.00057150953],"domain_scores_gemma":[0.99813867,0.00029006245,0.00016323476,0.0011499252,0.00010812376,0.00014996198],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006710045,0.00049768004,0.00048092764,0.0007314598,0.00013101111,0.0031677366,0.0032086188,0.00023882337,0.0000015462281],"category_scores_gemma":[0.00006543476,0.00041861064,0.000065730244,0.0010730289,0.0009315727,0.0008769263,0.00338375,0.0007350892,0.0000419789],"study_design_candidate":"design_other","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":[5.6334017e-7,0.000020565914,7.5861846e-7,0.0002943451,0.0000071717354,0.00008291297,0.00095923326,0.00014294208,0.00013463816,0.01992425,0.00033535276,0.97809726],"study_design_scores_gemma":[0.00004796519,0.000045901135,0.0000020215134,0.00056004623,0.0000061480414,0.00009085538,9.6734354e-8,0.3876682,0.0019336712,0.6082064,0.0010198428,0.00041888026],"about_ca_topic_score_codex":0.00000233499,"about_ca_topic_score_gemma":0.0000036410513,"teacher_disagreement_score":0.97767836,"about_ca_system_score_codex":0.00024415037,"about_ca_system_score_gemma":0.0007343409,"threshold_uncertainty_score":0.99982655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053917165,0.00051283714,0.9888623,0.0046865633,0.000028322356,0.00004000512,0.000011946738,0.0000255423,0.0004407658],"genre_scores_gemma":[0.9567413,0.000119451215,0.04300504,0.000063325795,0.00003911639,0.000006529135,0.0000051300412,0.0000019054398,0.000018249568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926996,0.000014520077,0.00033993335,0.00010728543,0.00021893172,0.00004939007],"domain_scores_gemma":[0.9994626,0.00006685212,0.00014050769,0.00007787507,0.00021083419,0.000041337084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029116258,0.000054531836,0.00012938531,0.0003783133,0.00002461836,0.0003270496,0.00032881516,0.000024782727,0.000008307683],"category_scores_gemma":[0.000010564353,0.0000413531,0.00009676161,0.00030225984,0.000060199178,0.00072849344,0.00006926756,0.000071276605,0.0000010408395],"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.000008047756,0.000096089105,0.0004154182,0.00003453162,0.00074122654,0.000013230797,0.0006192962,0.000028011886,0.004484716,0.8293534,0.00018697075,0.1640191],"study_design_scores_gemma":[0.00058682717,0.00040076155,0.013058206,0.00029286806,0.0009838608,0.00070652616,0.00035379417,0.20944564,0.0136641525,0.73373353,0.026344046,0.00042977766],"about_ca_topic_score_codex":0.00000823229,"about_ca_topic_score_gemma":0.0000022379918,"teacher_disagreement_score":0.95134956,"about_ca_system_score_codex":0.00001611393,"about_ca_system_score_gemma":0.000021662932,"threshold_uncertainty_score":0.31537467},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004202828,0.00033489044,0.5491862,0.01442607,0.00041158567,0.00045396533,0.000045558074,0.0035805074,0.43151912],"genre_scores_gemma":[0.004946309,0.0006594027,0.23377626,0.0012069355,0.00016825153,0.00007360406,0.00011107947,0.0001275286,0.7589306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962732,0.00028075094,0.0007590968,0.0012382333,0.00068730814,0.00076137466],"domain_scores_gemma":[0.9963855,0.00093165174,0.00042160455,0.0011476701,0.00082522695,0.0002883131],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00075085566,0.00075814815,0.00063678116,0.00087803253,0.00032666035,0.0026866898,0.0013094553,0.0006762719,0.00010269403],"category_scores_gemma":[0.0004986046,0.0007484046,0.00038518631,0.0014826101,0.0007649504,0.0025093378,0.0012880665,0.0008667669,0.0009306934],"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.0000024077444,0.00010249691,0.0002055491,0.00025302026,0.00008340104,0.00025668787,0.00031711676,0.00014379226,0.00014767739,0.8650045,0.10208882,0.031394567],"study_design_scores_gemma":[0.00017804287,0.00015780539,0.0005216272,0.001987347,0.00007912923,0.00019607617,0.000044398126,0.03371038,0.004827941,0.62226355,0.33457765,0.0014560696],"about_ca_topic_score_codex":0.00030730292,"about_ca_topic_score_gemma":0.001352938,"teacher_disagreement_score":0.3274115,"about_ca_system_score_codex":0.00021420463,"about_ca_system_score_gemma":0.0012902393,"threshold_uncertainty_score":0.9998472},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016889194,0.00049259426,0.91113997,0.00038641843,0.0009817829,0.00024151796,0.000021036083,0.0039521367,0.06589536],"genre_scores_gemma":[0.9755785,0.00007995696,0.015452051,0.00010451308,0.000071353075,0.0000018377601,0.000010195172,0.00003339809,0.008668227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979921,0.000043318276,0.00018879712,0.0012923995,0.00011012025,0.00037324597],"domain_scores_gemma":[0.99808294,0.000043927088,0.00014701679,0.0014152948,0.00017058493,0.00014025686],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00017275248,0.00036955523,0.0003042135,0.00036445388,0.00009689702,0.0011572115,0.0029371064,0.00025166554,0.000011472585],"category_scores_gemma":[0.000028317032,0.00041043348,0.00021257026,0.00072797644,0.00018461214,0.0007659283,0.0077052894,0.0007535024,0.00050150097],"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.000007077182,0.00006402652,0.00010982895,0.00037459936,0.00007709997,0.0012213341,0.00021877985,0.0016569865,0.00005842005,0.9860214,0.006619495,0.0035709818],"study_design_scores_gemma":[0.000062978565,0.000029028643,0.0000211431,0.00016478015,0.00004184801,0.000016085032,0.000015843329,0.09303063,0.0017246184,0.9017413,0.0026798458,0.00047186014],"about_ca_topic_score_codex":0.00008218356,"about_ca_topic_score_gemma":0.000010877162,"teacher_disagreement_score":0.9586893,"about_ca_system_score_codex":0.000216109,"about_ca_system_score_gemma":0.00035010563,"threshold_uncertainty_score":0.99987966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039381132,0.0018915955,0.9747507,0.0004444249,0.00046138093,0.00022257265,0.000017099792,0.00061379466,0.021204647],"genre_scores_gemma":[0.32773024,0.000078287405,0.6707421,0.0002822484,0.00004522644,0.00009023765,0.000017923277,0.000023318335,0.0009904485],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989389,0.000008714838,0.00021121954,0.00038855828,0.00020734782,0.00024521336],"domain_scores_gemma":[0.99948144,0.00015740536,0.000026821252,0.00018317065,0.00010025883,0.000050913593],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002341364,0.00012350468,0.000119267934,0.00052538817,0.00003094723,0.0017809385,0.0005270876,0.000048873146,0.0000010856689],"category_scores_gemma":[0.0002842137,0.000111914225,0.00003769148,0.0019866014,0.000022892802,0.002095589,0.00026293754,0.00010497362,0.000033097538],"study_design_candidate":"design_other","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.0000015128994,0.000038495476,0.0001458069,0.000036257534,0.0000095504165,0.000024966199,0.00021580914,1.7483161e-7,0.000015669051,0.015840705,0.0016709144,0.9820001],"study_design_scores_gemma":[0.00051725516,0.0003449738,0.0006911464,0.0007103133,0.000007899654,0.000059507478,0.000071481765,0.0903207,0.03823122,0.26430613,0.60370517,0.0010341941],"about_ca_topic_score_codex":8.5942645e-7,"about_ca_topic_score_gemma":3.8050425e-7,"teacher_disagreement_score":0.980966,"about_ca_system_score_codex":0.00014826065,"about_ca_system_score_gemma":0.00013840517,"threshold_uncertainty_score":0.9992553},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010847608,0.0007038836,0.89189154,0.006590766,0.00020832085,0.00031705826,0.000010892527,0.0033059996,0.0958868],"genre_scores_gemma":[0.8074873,0.000010730695,0.18779531,0.0015442552,0.000028168872,0.00007130299,0.0000023603623,0.00003831332,0.0030222295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982711,0.000029527217,0.0004116008,0.0005525604,0.00041984828,0.00031534568],"domain_scores_gemma":[0.9986668,0.00022711836,0.00007649805,0.00084191567,0.00007459958,0.00011305768],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051979185,0.00023584493,0.0002834352,0.00017481149,0.00007042683,0.0015815545,0.0011719518,0.00007194516,0.00004958055],"category_scores_gemma":[0.00010643778,0.00019851244,0.00014120092,0.0004881867,0.00010174192,0.0015611683,0.00034003606,0.00016905382,0.0011532527],"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.0000058850446,0.00018954121,0.000008496099,0.0009718635,0.000079042686,0.00037309207,0.0034939623,8.2809926e-8,0.0060034464,0.8236175,0.063087374,0.10216967],"study_design_scores_gemma":[0.00021408383,0.00012749365,0.0000057220236,0.0011104711,0.000021404052,0.0002135771,0.00004193204,0.05480632,0.034213956,0.8355795,0.073069476,0.0005960753],"about_ca_topic_score_codex":0.000006008725,"about_ca_topic_score_gemma":6.675761e-7,"teacher_disagreement_score":0.80640256,"about_ca_system_score_codex":0.000036466598,"about_ca_system_score_gemma":0.00008155776,"threshold_uncertainty_score":0.9996245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89137733,0.0031057915,0.10350311,0.00058035477,0.00011294643,0.00023201149,0.00006366659,0.00023473054,0.00079005957],"genre_scores_gemma":[0.990442,0.0027472642,0.006657842,0.000049588278,0.000018130002,0.000031304848,0.000031269858,0.000009928984,0.000012719317],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842095,0.000043715834,0.0005795886,0.00048628275,0.00026905752,0.00020039255],"domain_scores_gemma":[0.99879426,0.00028839376,0.000261537,0.0003253236,0.0002549498,0.000075545555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003218733,0.0001813391,0.00042075984,0.0022103495,0.00014694985,0.00015077417,0.00026277633,0.00009173846,0.0000058396986],"category_scores_gemma":[0.0001437807,0.00016925595,0.00015093705,0.0060453783,0.00060350954,0.0014746574,0.00022668691,0.00013889343,5.1295018e-8],"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.00009083653,0.0014480663,0.028203843,0.0015134697,0.0029419796,0.000011419873,0.0028468128,0.00055901473,0.5024981,0.035571605,0.00068902416,0.42362586],"study_design_scores_gemma":[0.0029133507,0.006859465,0.051325195,0.0015712443,0.0043560825,0.00022169495,0.0018880079,0.19886285,0.12033441,0.17081197,0.4376503,0.0032054423],"about_ca_topic_score_codex":0.000026061023,"about_ca_topic_score_gemma":0.000033281158,"teacher_disagreement_score":0.43696126,"about_ca_system_score_codex":0.000013167388,"about_ca_system_score_gemma":0.000041960047,"threshold_uncertainty_score":0.69020575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7505733,0.0006658558,0.24710822,0.0010078232,0.000117539945,0.000049128084,0.000010086322,0.00037154506,0.00009651579],"genre_scores_gemma":[0.99654514,0.0000804993,0.003248138,0.000026391164,0.000045435554,0.000020213132,0.000015453224,0.0000066772295,0.0000120274135],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993343,0.000012772583,0.0001394505,0.00028544365,0.00010482491,0.00012321054],"domain_scores_gemma":[0.99965924,0.000068356116,0.000051489053,0.00016945893,0.000014624823,0.00003681289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007314411,0.0001138688,0.00011769791,0.000035269743,0.000022698896,0.00028885974,0.0002985343,0.000034923454,0.00000422782],"category_scores_gemma":[0.000023029703,0.00010018834,0.000038472896,0.00013455062,0.00012688363,0.00053948094,0.00018373632,0.00009403343,0.0000020305943],"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.0000014244813,0.000023590143,0.00010150306,0.00031496017,0.0000058507107,0.000004318838,0.0000661223,4.9879166e-8,0.886864,0.000117745134,0.00012903522,0.11237136],"study_design_scores_gemma":[0.000022173792,0.0000017856693,0.000124676,0.0002998983,0.000004460255,0.00001493227,0.0000013558152,0.0012162395,0.99654937,0.00010732403,0.0015410192,0.000116742776],"about_ca_topic_score_codex":3.2601105e-7,"about_ca_topic_score_gemma":3.2751857e-9,"teacher_disagreement_score":0.24597189,"about_ca_system_score_codex":0.000020998816,"about_ca_system_score_gemma":0.000017322982,"threshold_uncertainty_score":0.4085562},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003715339,0.0005358513,0.9835706,0.0018249842,0.00048139418,0.0003297528,0.00005146586,0.0011953827,0.008295274],"genre_scores_gemma":[0.6407712,0.0000033779356,0.35789874,0.00038879318,0.00010463135,0.00003888411,0.000096932614,0.000030240473,0.0006672182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980491,0.000030439176,0.00034928657,0.000691256,0.0004898285,0.00039013376],"domain_scores_gemma":[0.99854493,0.00042096688,0.00009199065,0.00054235134,0.0002806959,0.00011905703],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035626953,0.00023991938,0.00023203535,0.00034624824,0.00026764226,0.0033887625,0.0013835748,0.000063814216,0.000031875305],"category_scores_gemma":[0.00013761615,0.00022229512,0.00015855841,0.00087274745,0.0001556603,0.0019343514,0.0007045829,0.00014299771,0.00010694714],"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.000029964054,0.00008584688,0.00059020356,0.0003600494,0.00013250402,0.000039732164,0.00023071437,0.0028937175,0.0008573838,0.921793,0.021601476,0.05138543],"study_design_scores_gemma":[0.00016841438,0.00011458789,0.002505425,0.00011067568,0.000013204238,0.0000459237,0.000015860598,0.5158618,0.0004976441,0.47258443,0.0077810735,0.00030094947],"about_ca_topic_score_codex":0.000011264529,"about_ca_topic_score_gemma":6.9948925e-7,"teacher_disagreement_score":0.6370559,"about_ca_system_score_codex":0.00007074244,"about_ca_system_score_gemma":0.0001578161,"threshold_uncertainty_score":0.9976458},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007547323,0.012318944,0.34740353,0.0029398792,0.16110238,0.00043919327,0.000029001209,0.001623293,0.4740683],"genre_scores_gemma":[0.22104536,0.004388487,0.07988401,0.004912682,0.009867373,0.000014332006,0.00010590104,0.0024847912,0.67729706],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9922219,0.0014166874,0.0022514637,0.0011130455,0.0019593532,0.0010375456],"domain_scores_gemma":[0.9939008,0.00007677615,0.0018163297,0.0018326183,0.0014504687,0.0009230106],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0046428256,0.0010830078,0.0012782698,0.0016623575,0.00028705673,0.0042631943,0.008585733,0.00018047073,0.000014622059],"category_scores_gemma":[0.000624586,0.0010232662,0.00081298494,0.0027058334,0.00020826413,0.001652877,0.003077238,0.0042520794,0.0011713736],"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.000012292225,0.00030409876,0.000008464684,0.00026727095,0.00013240897,0.008882632,0.000503397,0.0000020090479,0.000073934294,0.019077435,0.94940627,0.0213298],"study_design_scores_gemma":[0.00048816003,0.0022601122,0.00010665017,0.004000907,0.00015395049,0.0017910961,0.000055146058,0.00035952256,0.00011796254,0.024967562,0.96437836,0.0013206005],"about_ca_topic_score_codex":0.0000020730313,"about_ca_topic_score_gemma":5.133256e-7,"teacher_disagreement_score":0.2675195,"about_ca_system_score_codex":0.0003977047,"about_ca_system_score_gemma":0.00071485015,"threshold_uncertainty_score":0.9996063},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4556323,0.0009790144,0.53070223,0.0001518038,0.00026711673,0.0002235335,0.000013988785,0.0010362808,0.010993737],"genre_scores_gemma":[0.9894431,0.00014665966,0.009491909,0.000050074876,0.000021213848,8.6562625e-7,0.00000528379,0.000013713371,0.0008271572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860406,0.000050375715,0.00017372577,0.00087843376,0.00007712045,0.00021626572],"domain_scores_gemma":[0.9988327,0.000095041854,0.00015298044,0.00065907405,0.00015836302,0.00010183647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017962622,0.00025300303,0.00033345364,0.00022966765,0.000044267166,0.00026110705,0.0011923648,0.00024587108,0.000003759925],"category_scores_gemma":[0.000068809335,0.00025301334,0.00011065561,0.00042209757,0.0003525647,0.00031970633,0.005681932,0.00046345606,0.00001781375],"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.000014626522,0.000102089296,0.0011125837,0.00060587516,0.00006756701,0.0008978202,0.0002090916,0.0007043447,0.00020189155,0.99263275,0.00039453953,0.0030568405],"study_design_scores_gemma":[0.00009155499,0.00010701626,0.00020330779,0.00018259141,0.000054464555,0.00001974185,0.00001182902,0.0437396,0.0046364334,0.9505625,0.00009313379,0.0002978386],"about_ca_topic_score_codex":0.00006528626,"about_ca_topic_score_gemma":0.000013294033,"teacher_disagreement_score":0.5338108,"about_ca_system_score_codex":0.000055448036,"about_ca_system_score_gemma":0.00016251189,"threshold_uncertainty_score":0.9999922},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002594627,0.0017373214,0.9822288,0.0010991179,0.0048776334,0.00116395,0.0004553283,0.000893414,0.004949806],"genre_scores_gemma":[0.6387293,0.00016619402,0.34091637,0.001670089,0.0010054484,0.0015618481,0.0005300419,0.00007504942,0.015345667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979374,0.000028759272,0.00067969837,0.00037402444,0.00041186318,0.0005682695],"domain_scores_gemma":[0.9975996,0.0006760235,0.00026925004,0.00032475873,0.0009953927,0.00013495234],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00080672913,0.0003458185,0.00027600868,0.00046971597,0.00047568444,0.0061983163,0.0005971062,0.00020112627,0.00006855419],"category_scores_gemma":[0.0009160269,0.00035977783,0.00023234347,0.000742883,0.0003855203,0.025836332,0.0002570346,0.00015461509,0.00025874985],"study_design_candidate":"design_other","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.00011591403,0.00004175366,0.000037318434,0.004405516,0.000056598,0.000006332527,0.0040169153,0.00017959975,0.00016006234,0.085839614,0.10029821,0.8048422],"study_design_scores_gemma":[0.00026250843,0.0003765762,0.00014208016,0.0019786493,0.00004968021,0.00009665439,0.00042832023,0.66419315,0.0035162205,0.042818643,0.28572747,0.00041005545],"about_ca_topic_score_codex":0.00004277007,"about_ca_topic_score_gemma":0.000006962612,"teacher_disagreement_score":0.8044321,"about_ca_system_score_codex":0.00043446725,"about_ca_system_score_gemma":0.0007153915,"threshold_uncertainty_score":0.99988544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004218027,0.000031963795,0.9619134,0.0012747938,0.000007653641,0.00023828133,0.000014732976,0.00013151395,0.032169603],"genre_scores_gemma":[0.96417975,0.000010339388,0.035421204,0.00025006876,0.000012916215,0.00010165425,0.000004286092,0.000003977764,0.00001578443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950653,0.000013291789,0.0001701599,0.00008990082,0.00013294476,0.00008714691],"domain_scores_gemma":[0.9992594,0.00034715454,0.00004292297,0.00026324074,0.000050513197,0.00003673747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002139719,0.00007656623,0.00007511423,0.000037180762,0.000090235706,0.00038328278,0.00023398163,0.000026433803,0.000010004364],"category_scores_gemma":[0.000037605594,0.000041833737,0.000019937053,0.00018587681,0.00079591305,0.00030059324,0.00007509706,0.0000913156,0.000007871648],"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":[8.665344e-7,0.00001310978,0.0000010038677,0.000037275477,0.0000068187815,1.5380111e-7,0.00020789447,0.000010700539,0.00011840937,0.96270186,0.00024189407,0.03666004],"study_design_scores_gemma":[0.000036656544,0.0000693144,0.000006890819,0.00007490117,0.0000070509145,0.000012014421,0.000039774153,0.34522152,0.0073382715,0.6462799,0.00083440635,0.000079367914],"about_ca_topic_score_codex":3.4851544e-7,"about_ca_topic_score_gemma":1.7399204e-7,"teacher_disagreement_score":0.9599618,"about_ca_system_score_codex":0.000007127553,"about_ca_system_score_gemma":0.00003404228,"threshold_uncertainty_score":0.36960047},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008069842,0.00065298117,0.98839885,0.0002169168,0.00042858504,0.00034255142,0.0000028049456,0.0015569167,0.00033054614],"genre_scores_gemma":[0.45209405,0.0000039604706,0.5474182,0.00014991457,0.000025490546,0.000031078165,0.0000036292306,0.000013643473,0.0002600253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878937,0.000017172284,0.00026218613,0.0004926674,0.0001918444,0.0002467599],"domain_scores_gemma":[0.99923575,0.00019469221,0.000041772968,0.00034369313,0.00012411416,0.0000599682],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027882325,0.00015716559,0.00013486846,0.00022429755,0.00013653249,0.0020256585,0.0005553553,0.000069069305,0.0000039608267],"category_scores_gemma":[0.00013101315,0.0001353178,0.00009098789,0.00045793704,0.000032378903,0.002743716,0.00027068894,0.00008229266,0.000024524366],"study_design_candidate":"design_other","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.0000046092646,0.000069946334,0.000033230837,0.00009056502,0.000012915068,0.000017567529,0.0004963336,0.000045274493,0.046638615,0.01112878,0.0035506468,0.9379115],"study_design_scores_gemma":[0.0001390039,0.000044994853,0.000036411962,0.0002768054,0.000003586009,0.000013420753,0.00001795875,0.9240482,0.047085814,0.023916049,0.004226039,0.00019170884],"about_ca_topic_score_codex":0.000019601268,"about_ca_topic_score_gemma":0.000003968843,"teacher_disagreement_score":0.9377198,"about_ca_system_score_codex":0.00006209376,"about_ca_system_score_gemma":0.000076167016,"threshold_uncertainty_score":0.9990103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03100287,0.0019810142,0.9363604,0.00031961533,0.00037334373,0.00015645391,0.000030970485,0.0018003528,0.027974935],"genre_scores_gemma":[0.93907315,0.000048775393,0.059420973,0.00004555458,0.000017624427,0.000011981688,0.0000078744515,0.000011698123,0.001362374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999244,0.000018166207,0.00017646069,0.00022732945,0.00020054987,0.00013353355],"domain_scores_gemma":[0.9993981,0.00008993763,0.00004171286,0.00036508284,0.00006960237,0.000035531048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013802688,0.000082266706,0.00010720176,0.0003091555,0.00003159436,0.00039538988,0.0005254223,0.000038405648,0.000037265167],"category_scores_gemma":[0.00010666192,0.00007275906,0.00004593102,0.0016358887,0.000038834707,0.0009714727,0.00021729215,0.00005399836,0.000040711253],"study_design_candidate":"design_other","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.0000028397394,0.0003699878,0.006684943,0.0013114089,0.000097638935,0.00015771507,0.001445116,0.00007366963,0.007132252,0.28612107,0.10951868,0.58708465],"study_design_scores_gemma":[0.00041199045,0.00043865986,0.049619995,0.0013380982,0.00004954645,0.0001011749,0.000026038882,0.30161637,0.18633376,0.29867253,0.16009764,0.0012942043],"about_ca_topic_score_codex":0.000025846854,"about_ca_topic_score_gemma":0.0000016730373,"teacher_disagreement_score":0.90807027,"about_ca_system_score_codex":0.000020234063,"about_ca_system_score_gemma":0.00005532549,"threshold_uncertainty_score":0.38127536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015092817,0.00033980602,0.99413675,0.0006313315,0.00047062695,0.0003969923,0.00001060517,0.0033550875,0.0005078631],"genre_scores_gemma":[0.4384749,0.000007750429,0.5606694,0.00016483429,0.000040223884,0.00030241307,0.0000016314087,0.000046567657,0.0002922553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788266,0.00003577528,0.0004431422,0.0008207007,0.00029458568,0.00052311143],"domain_scores_gemma":[0.99903405,0.00014547173,0.000109382214,0.00037642877,0.00022286475,0.00011178022],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00041370932,0.00031062096,0.00025000778,0.00035367784,0.000541742,0.0039828955,0.0006501194,0.00009667088,0.000009049446],"category_scores_gemma":[0.000027312439,0.00030919828,0.00019526768,0.0006446038,0.00010393798,0.0039345147,0.000010940562,0.00035111906,0.00003839177],"study_design_candidate":"design_other","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.000010745761,0.00017700945,0.0000019481024,0.00058035774,0.000030856907,0.000031988653,0.0007402378,0.0010566475,0.0074951565,0.000101681006,0.000084300445,0.98968905],"study_design_scores_gemma":[0.0003460629,0.000052645202,0.0000049664977,0.00091888313,0.00003006854,0.000045237462,0.000028798348,0.7954145,0.20075403,0.0014474476,0.00060257735,0.00035474673],"about_ca_topic_score_codex":0.00000513114,"about_ca_topic_score_gemma":0.0000019513343,"teacher_disagreement_score":0.98933434,"about_ca_system_score_codex":0.00010975938,"about_ca_system_score_gemma":0.00018802246,"threshold_uncertainty_score":0.999936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015363881,0.00039854454,0.9812349,0.000863465,0.000021736421,0.00010833184,0.0000037657205,0.0005723912,0.0014329894],"genre_scores_gemma":[0.77429765,0.00000825821,0.22543202,0.000084287116,0.00001837152,0.00002837815,0.000061403734,0.000006772459,0.0000628802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998759,0.000021761203,0.00022273004,0.0005021886,0.00035772132,0.000136616],"domain_scores_gemma":[0.99951583,0.000082917104,0.00006579833,0.00017672693,0.000107609136,0.00005114264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024031158,0.00014403148,0.00019636132,0.0003195042,0.00014224695,0.0006773364,0.00019225504,0.000039556835,0.0000033016784],"category_scores_gemma":[0.000003755353,0.000115248564,0.000074184965,0.0015846372,0.00008651468,0.00061222195,0.00009098443,0.00010482926,0.000012728448],"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.000055446555,0.00016438108,0.000045694153,0.00014325925,0.0016256513,0.00002028053,0.0005351406,0.02323962,0.003545388,0.81149393,0.00039011374,0.1587411],"study_design_scores_gemma":[0.00012625539,0.000023042983,0.00040801102,0.000022817298,0.00021444747,0.00001746172,0.000033772318,0.8584717,0.0012847607,0.13909876,0.00013213442,0.00016686285],"about_ca_topic_score_codex":0.000008178693,"about_ca_topic_score_gemma":5.379787e-7,"teacher_disagreement_score":0.8352321,"about_ca_system_score_codex":0.00003812349,"about_ca_system_score_gemma":0.00008420767,"threshold_uncertainty_score":0.65315706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009277003,0.00030126466,0.9870292,0.002710829,0.00016675836,0.0006946423,0.00046733892,0.0016996998,0.0060025477],"genre_scores_gemma":[0.07932033,0.0000019657973,0.91870284,0.0003271255,0.00009755689,0.00029073952,0.000098002805,0.000046342648,0.0011150759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792385,0.000031668056,0.0004757853,0.0006568209,0.0004361379,0.00047571657],"domain_scores_gemma":[0.99840957,0.00014188488,0.0000714306,0.00075550826,0.00030064906,0.00032098067],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046933308,0.0002983508,0.00032735334,0.00037723937,0.0002211406,0.0011148602,0.0008789795,0.00010759996,0.000014123179],"category_scores_gemma":[0.00032277155,0.00025772944,0.0001791469,0.0016308818,0.00010258079,0.0010206788,0.0005426618,0.00021348133,0.0005459976],"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.000028962588,0.0007751088,0.00002689778,0.00067760644,0.00043054039,0.00003890467,0.0019127438,0.00043302277,0.03379414,0.6321691,0.24084722,0.08886574],"study_design_scores_gemma":[0.00018145575,0.0001928523,0.000010723336,0.000767403,0.00006345552,0.00022707228,0.000018653778,0.8098752,0.013437072,0.16182822,0.01259638,0.00080152793],"about_ca_topic_score_codex":0.0000052341493,"about_ca_topic_score_gemma":9.587736e-7,"teacher_disagreement_score":0.80944216,"about_ca_system_score_codex":0.00014014596,"about_ca_system_score_gemma":0.000114827104,"threshold_uncertainty_score":0.9999875},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873512,0.0022482644,0.01001217,0.00013795483,0.000051968236,0.00011872977,0.000014146842,0.000048947575,0.000016657763],"genre_scores_gemma":[0.96733266,0.00011039491,0.032414928,0.00012040481,0.000005079742,0.000005104131,0.0000010317709,0.0000070140263,0.0000033709728],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99891776,0.00013804613,0.00033837731,0.00024201325,0.00017693787,0.00018689063],"domain_scores_gemma":[0.99914974,0.0002462305,0.00024511994,0.0002510642,0.00007986788,0.000027987066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004722355,0.00016356964,0.0002998695,0.00013517686,0.00020335766,0.00049792003,0.00029688334,0.000043301243,9.134856e-7],"category_scores_gemma":[0.000034746638,0.00008722167,0.00004425554,0.0003461077,0.00065822795,0.00046925058,0.00016906677,0.000051558185,8.611308e-9],"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.00014164306,0.000009311399,0.00032189718,0.00016857828,0.00004847865,6.4898217e-7,0.00044968782,0.000018176306,0.98589164,0.003185127,0.000027452787,0.009737385],"study_design_scores_gemma":[0.0004129732,0.000044933357,0.0012623628,0.0003249135,0.00005368602,0.0000057250127,0.00018773373,0.00030137989,0.99452406,0.0027435862,0.000025585656,0.000113039714],"about_ca_topic_score_codex":0.0004611602,"about_ca_topic_score_gemma":0.000009526774,"teacher_disagreement_score":0.02240276,"about_ca_system_score_codex":0.0000033765252,"about_ca_system_score_gemma":0.000018713334,"threshold_uncertainty_score":0.48014542},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004812596,0.00010609875,0.9960168,0.0013871323,0.000516694,0.0003293403,0.000031000265,0.0007698644,0.0003617867],"genre_scores_gemma":[0.14205149,0.000032327513,0.85698384,0.00040949706,0.000050658327,0.00013679935,0.0000081851695,0.000010044845,0.0003171513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868995,0.000045405264,0.00036227328,0.000521919,0.00013752795,0.00024293382],"domain_scores_gemma":[0.99916005,0.00020089619,0.000057845045,0.00038772213,0.00015022735,0.00004324316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020634047,0.00017864081,0.00022286002,0.00035498108,0.00015984123,0.0003128487,0.00055836537,0.00013461405,0.0000104813535],"category_scores_gemma":[0.000018243025,0.00016973878,0.00012877808,0.0008895715,0.00009929977,0.0008885783,0.000044041528,0.0002043481,0.0000036073347],"study_design_candidate":"design_other","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.000012017919,0.00020575534,0.0000047296667,0.000014134788,0.00001351301,0.00000626066,0.000045009787,0.0010669664,0.0017652971,0.00013560355,0.00041661452,0.9963141],"study_design_scores_gemma":[0.00081885,0.000248699,0.0001890221,0.00012592692,0.000023570841,0.000013387641,0.000010862596,0.8279981,0.1232433,0.044470254,0.0025748133,0.00028323242],"about_ca_topic_score_codex":0.00019340788,"about_ca_topic_score_gemma":0.00009287217,"teacher_disagreement_score":0.99603087,"about_ca_system_score_codex":0.00007388896,"about_ca_system_score_gemma":0.00004757015,"threshold_uncertainty_score":0.6921746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021445998,0.00006325265,0.96888924,0.0012948328,0.00005045287,0.00011032249,0.0000013840305,0.00017400166,0.027271938],"genre_scores_gemma":[0.45327523,0.0000059986696,0.5460215,0.00007921518,0.000008815881,0.000009570798,7.8760047e-7,0.0000037036841,0.0005951683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994222,0.00001666309,0.00022434686,0.00015751096,0.000087154025,0.00009210973],"domain_scores_gemma":[0.99918246,0.0002621248,0.000113066235,0.0002866247,0.00012398582,0.00003170707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013406234,0.00008403247,0.00014820218,0.00010566656,0.00005595201,0.00012944758,0.00026474224,0.00002978035,0.000009025683],"category_scores_gemma":[0.00036282153,0.00007058542,0.000027395958,0.0004570299,0.00007599293,0.00055119186,0.00014842904,0.00004273758,0.000009275763],"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":[6.653855e-7,0.000016921416,0.00014879539,0.00006259238,0.00001196772,2.1077882e-7,0.0006678256,5.195472e-7,0.00036395722,0.9195523,0.0006542748,0.07851997],"study_design_scores_gemma":[0.00007717525,0.00000762944,0.00018654768,0.0002035666,0.000005093671,0.000015801288,0.00007328788,0.0035099424,0.020507233,0.9751883,0.00016040565,0.00006502456],"about_ca_topic_score_codex":0.000007362203,"about_ca_topic_score_gemma":0.0000017648254,"teacher_disagreement_score":0.45113066,"about_ca_system_score_codex":0.000018257237,"about_ca_system_score_gemma":0.00015616244,"threshold_uncertainty_score":0.287839},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022253706,0.00053984526,0.9860309,0.010476743,0.00026905516,0.000215157,0.0000027609742,0.00018072878,0.000059455087],"genre_scores_gemma":[0.2627817,0.0000121943995,0.73464656,0.0022836355,0.0001254275,0.000012395775,0.000017472625,0.000022926144,0.000097704295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985505,0.000118772296,0.0005076391,0.00019019369,0.00032423617,0.00030867648],"domain_scores_gemma":[0.99794775,0.00068623846,0.00044067873,0.00022188445,0.00060327904,0.000100183344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032306497,0.0001599277,0.00025024195,0.0003569004,0.0003574322,0.0004563604,0.0011033041,0.00003690429,0.0000020579919],"category_scores_gemma":[0.0013826705,0.00011211855,0.00013105899,0.00037782083,0.00021908992,0.0012863349,0.00017735237,0.00042459613,0.0000010241645],"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.0002708567,0.00022140692,0.0005423191,0.00026056985,0.00007014731,0.000016053262,0.00047826054,0.0007645815,0.05172096,0.00086952455,0.003289079,0.94149625],"study_design_scores_gemma":[0.0010413763,0.00031897932,0.000043290533,0.00032044674,0.000074106305,0.00009406867,0.00008054056,0.95514727,0.015424857,0.01981831,0.0074862945,0.00015045796],"about_ca_topic_score_codex":0.000016670945,"about_ca_topic_score_gemma":7.1315225e-7,"teacher_disagreement_score":0.9543827,"about_ca_system_score_codex":0.000075556345,"about_ca_system_score_gemma":0.00018748049,"threshold_uncertainty_score":0.45720616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.850938,0.0011742689,0.12355103,0.007991731,0.00011742705,0.00068156613,0.000008208475,0.00073795114,0.014799778],"genre_scores_gemma":[0.7759553,0.000062447936,0.22306477,0.00016286242,0.000012198165,0.000021918777,0.000006776035,0.000016724523,0.00069697027],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99782056,0.00007754426,0.0005794482,0.0006892352,0.0004045196,0.00042868458],"domain_scores_gemma":[0.9982747,0.00021750903,0.0002092278,0.00083782733,0.0002712872,0.00018947996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047116325,0.00024654585,0.0003276047,0.0002406167,0.000089102934,0.0006786786,0.0012586919,0.00011404395,0.000071835435],"category_scores_gemma":[0.0002096765,0.0002229257,0.00005560323,0.00078804645,0.0003534711,0.0033787577,0.0008636791,0.00017716149,0.000076925084],"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.000071432,0.002316294,0.25992504,0.0012234981,0.00020994921,0.00014018489,0.022154279,0.00026767934,0.13043152,0.048432793,0.15958413,0.37524322],"study_design_scores_gemma":[0.0033014906,0.0010754438,0.2697311,0.00089390867,0.000070517555,0.0001989456,0.0035527523,0.1776112,0.36503783,0.16946515,0.00564884,0.0034128143],"about_ca_topic_score_codex":0.005840058,"about_ca_topic_score_gemma":0.0007567289,"teacher_disagreement_score":0.3718304,"about_ca_system_score_codex":0.000035401412,"about_ca_system_score_gemma":0.000090321264,"threshold_uncertainty_score":0.9090646},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20059139,0.00015171566,0.33591518,0.00032883004,0.0003586053,0.00019091733,0.000008050513,0.0024581884,0.45999712],"genre_scores_gemma":[0.72765356,0.000001085669,0.269515,0.00012548939,0.000025223198,0.0000034412901,0.0000031495088,0.00000983795,0.0026632198],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998901,0.000011885249,0.00019106544,0.00045785183,0.00019742543,0.0002407677],"domain_scores_gemma":[0.9990574,0.00010844863,0.00007972954,0.0006189634,0.00006849586,0.00006693563],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00008424064,0.00014340461,0.00016053655,0.0000862983,0.00004186324,0.0015161991,0.0009409768,0.000046508227,0.00004000771],"category_scores_gemma":[0.0000691237,0.00012842222,0.00006160313,0.00023434327,0.000050439234,0.004781459,0.00056731445,0.000099006786,0.0004335516],"study_design_candidate":"design_other","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.0000100363095,0.00012071406,0.021099236,0.000035314242,0.000036931768,0.00008040939,0.0003868243,0.0000017700728,0.01611239,0.012203901,0.004401221,0.9455113],"study_design_scores_gemma":[0.00073974003,0.00029294103,0.0014055966,0.000260571,0.0000075023154,0.00024280345,0.00023686701,0.018367724,0.58967286,0.384346,0.0032728699,0.0011545415],"about_ca_topic_score_codex":0.0000149084,"about_ca_topic_score_gemma":3.7963866e-7,"teacher_disagreement_score":0.94435674,"about_ca_system_score_codex":0.000028109156,"about_ca_system_score_gemma":0.00006470711,"threshold_uncertainty_score":0.9995203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057448078,0.00002082482,0.93407536,0.0008101661,0.00017362104,0.00029832628,0.00012161751,0.0003163794,0.006735637],"genre_scores_gemma":[0.710104,0.000002057296,0.2897111,0.00001885232,0.0000052787027,0.000027274536,0.000004415127,0.0000075869725,0.00011944723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988519,0.000024623449,0.00038433057,0.00023851098,0.00023672619,0.00026392043],"domain_scores_gemma":[0.9977063,0.000103805025,0.00048034947,0.0011263397,0.00047255342,0.00011067452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039403012,0.00014508609,0.00028238774,0.00013301846,0.00035711026,0.00066756376,0.0010289914,0.00007880521,0.0000029490213],"category_scores_gemma":[0.0034147198,0.00013559381,0.000120545126,0.00020882754,0.00019718778,0.0010687953,0.00044140068,0.00009957757,0.000018772673],"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.000011832935,0.0005250202,0.0011971085,0.00015350993,0.0002565963,0.000016881628,0.001372426,0.00002621841,0.0083786445,0.7630411,0.0025294982,0.22249119],"study_design_scores_gemma":[0.0007231282,0.00028625721,0.005044261,0.0008732681,0.00008667143,0.00010595647,0.00009332125,0.043800775,0.10571063,0.8424964,0.00006954563,0.0007098016],"about_ca_topic_score_codex":0.00001340622,"about_ca_topic_score_gemma":0.000005237365,"teacher_disagreement_score":0.65265596,"about_ca_system_score_codex":0.00007963002,"about_ca_system_score_gemma":0.00006844008,"threshold_uncertainty_score":0.64373326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036268512,0.00012151405,0.9797434,0.0018759281,0.00017653477,0.00017178238,0.0000025468785,0.0012605195,0.01628505],"genre_scores_gemma":[0.010063303,0.0000041185453,0.9786464,0.0010844305,0.00002001897,0.000055226967,0.0000025081076,0.000008031485,0.010115936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990906,0.0000060861153,0.00017394552,0.00035291578,0.00011362011,0.0002628418],"domain_scores_gemma":[0.9993516,0.00010154009,0.0000418084,0.00033761453,0.000129003,0.000038416092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022378085,0.00011655107,0.00012185839,0.00020995062,0.00012097608,0.0005747002,0.00092429726,0.000052523395,0.0000037921316],"category_scores_gemma":[0.00008665777,0.00010689417,0.000057694644,0.0005164359,0.00003828887,0.0010699844,0.00050308683,0.00006893924,0.000015001685],"study_design_candidate":"design_other","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.0000025281504,0.000065001645,0.000025092866,0.000041804644,0.000012800759,0.000006112437,0.0000663911,0.000006027217,0.0022231569,0.038458288,0.029080972,0.9300118],"study_design_scores_gemma":[0.00042969777,0.0001949217,0.000056506662,0.00017793442,0.0000113266215,0.000009890708,0.00002554604,0.6468248,0.17079498,0.13262406,0.048428353,0.000422039],"about_ca_topic_score_codex":0.000006711581,"about_ca_topic_score_gemma":3.0899793e-7,"teacher_disagreement_score":0.9295898,"about_ca_system_score_codex":0.000035267458,"about_ca_system_score_gemma":0.000096736396,"threshold_uncertainty_score":0.55418473},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030690335,0.016027423,0.8741875,0.022574209,0.0012475186,0.00013020796,0.000021764412,0.000055464225,0.055065576],"genre_scores_gemma":[0.49161202,0.0004364414,0.49715453,0.0010892114,0.00006181129,0.000002451875,6.3953854e-7,0.000024193265,0.009618693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983285,0.00013395556,0.00072044873,0.00017064236,0.00021465764,0.00043180588],"domain_scores_gemma":[0.99780893,0.00036535625,0.00046767486,0.0003790646,0.0005699727,0.00040898373],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012332008,0.00023079112,0.0004098719,0.0005076485,0.00018258323,0.0010495449,0.0014789148,0.00019900763,0.000028243925],"category_scores_gemma":[0.0010963728,0.00021749975,0.00017213463,0.00062591315,0.00059586443,0.001054742,0.000088995024,0.00048775613,0.000008887764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0000014607028,0.000127621,0.0029519808,0.00065699406,0.000118195516,0.00065260666,0.007520394,0.0001129418,0.00016481944,0.92269933,0.028626634,0.036367036],"study_design_scores_gemma":[0.00026071357,0.00030431367,0.001466496,0.0056876037,0.00013343875,0.001301306,0.002448028,0.0070297355,0.011131899,0.9078374,0.06191177,0.0004873326],"about_ca_topic_score_codex":0.0035250422,"about_ca_topic_score_gemma":0.03497151,"teacher_disagreement_score":0.46092167,"about_ca_system_score_codex":0.00021766679,"about_ca_system_score_gemma":0.004253832,"threshold_uncertainty_score":0.9999875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018356851,0.004078137,0.9820169,0.0013019777,0.000021779335,0.00016788799,0.0000037556397,0.00014437293,0.010429492],"genre_scores_gemma":[0.99777174,0.00008961238,0.0015787614,0.000022444196,0.000018395462,0.00009466755,9.817073e-7,0.0000043553005,0.0004190147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954325,0.00003897857,0.00014244519,0.00011458033,0.00008375329,0.0000769894],"domain_scores_gemma":[0.9990258,0.00047810658,0.000057206886,0.0003607176,0.000064407446,0.000013742518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065897335,0.000057792608,0.00006934357,0.000025125302,0.000179566,0.00024238243,0.0005890464,0.00001557434,7.7514954e-7],"category_scores_gemma":[0.00003584023,0.00003060086,0.00002573357,0.00023912461,0.00062645547,0.00030830267,0.00016445456,0.00006182276,0.0000015805803],"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.0000035053774,0.0000036182391,0.0000046759023,0.000025588504,0.00000726733,9.9666586e-8,0.00052502373,4.981632e-7,0.00057639985,0.8431888,0.00003984215,0.15562467],"study_design_scores_gemma":[0.000014970679,0.00002563796,0.00003547246,0.000020770483,0.0000074780996,0.0000061529327,0.00041875883,0.0003268067,0.033624206,0.95469624,0.0107821375,0.00004139208],"about_ca_topic_score_codex":0.000004664312,"about_ca_topic_score_gemma":0.0000010075935,"teacher_disagreement_score":0.9959361,"about_ca_system_score_codex":0.0000034713723,"about_ca_system_score_gemma":0.000040401155,"threshold_uncertainty_score":0.23372994},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008517922,0.00061954826,0.4391166,0.0036433404,0.00072026515,0.00045608432,0.0000035526693,0.0020378279,0.54488486],"genre_scores_gemma":[0.97279525,0.000010335887,0.022711445,0.000531069,0.000006223899,0.000033462715,0.000002512945,0.000008135183,0.0039015512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877995,0.000042520907,0.00024793475,0.00040284332,0.00020170289,0.00032507154],"domain_scores_gemma":[0.9989509,0.00016751156,0.000053159354,0.0007110536,0.00006173896,0.000055623397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001868537,0.00014434085,0.00021567766,0.00018643033,0.0000769658,0.00041668513,0.0014736839,0.00005701364,0.000014485908],"category_scores_gemma":[0.00014902408,0.00015074239,0.00004117922,0.0010951789,0.000048500606,0.0007119845,0.0008162133,0.00017308258,0.000046330504],"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.000012901788,0.00063286076,0.011872954,0.000108738845,0.000018418179,0.00016192188,0.00020085985,0.000017019924,0.0022049295,0.84051156,0.11711853,0.027139278],"study_design_scores_gemma":[0.00089564134,0.00007693118,0.011770632,0.00010688997,0.0000033029028,0.000014732253,0.00001107948,0.009878316,0.016234318,0.8986458,0.061981287,0.0003810515],"about_ca_topic_score_codex":0.000052298736,"about_ca_topic_score_gemma":0.0000019762522,"teacher_disagreement_score":0.9642773,"about_ca_system_score_codex":0.0001344907,"about_ca_system_score_gemma":0.00008598416,"threshold_uncertainty_score":0.6147096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045490013,0.0010203217,0.98812664,0.005047828,0.00007850577,0.00049084664,0.00014237777,0.000029643776,0.00051486766],"genre_scores_gemma":[0.6775312,0.00020767453,0.321352,0.00042368617,0.00012857802,0.00021278417,0.000032019718,0.0000082985,0.00010380575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976773,0.000023748571,0.0010797394,0.0005434974,0.00041150505,0.00026417474],"domain_scores_gemma":[0.99662447,0.00055693666,0.0008502739,0.0004040353,0.0014407854,0.000123495],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00030776218,0.00027513827,0.000625183,0.0013885879,0.0001734182,0.0013262532,0.0016853397,0.00018843064,0.000016907055],"category_scores_gemma":[0.00018414158,0.00021866611,0.00033997552,0.001986922,0.0004268503,0.0008601757,0.00031784058,0.00034666577,4.8370066e-7],"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.00009353493,0.00059502566,0.0063971067,0.000023402265,0.0016128703,0.000004127013,0.00012294766,0.0005859827,0.000116462805,0.8876374,0.000058827565,0.10275235],"study_design_scores_gemma":[0.001098326,0.00019547915,0.006825575,0.00013090175,0.0009797327,0.00006976904,0.00022578987,0.0142206,0.0007961344,0.96323794,0.011864096,0.00035565297],"about_ca_topic_score_codex":0.000023767034,"about_ca_topic_score_gemma":0.000029898514,"teacher_disagreement_score":0.67298216,"about_ca_system_score_codex":0.00013444433,"about_ca_system_score_gemma":0.0002822341,"threshold_uncertainty_score":0.99971044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017507237,0.00006230044,0.94411314,0.0016546125,0.00007141511,0.00019243319,0.0000046262858,0.0008461936,0.051304556],"genre_scores_gemma":[0.14596796,0.0000023800658,0.8524852,0.00072602613,0.00001520726,0.000026899967,0.0000024899412,0.000012484582,0.00076135003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877167,0.000021779826,0.0003307555,0.00032075244,0.00027037816,0.00028467498],"domain_scores_gemma":[0.99894196,0.00015946655,0.000092267015,0.0006280589,0.00009006193,0.00008817604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023216254,0.0001795554,0.0002730484,0.0001155998,0.00011046913,0.00091630244,0.0013885574,0.000046911475,0.000010542007],"category_scores_gemma":[0.00019581908,0.00015424707,0.000068471745,0.0007794119,0.000053918553,0.00054046424,0.00082356506,0.00009609554,0.0000626264],"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.0000069759685,0.0003264408,0.0003656641,0.0008284217,0.000076609766,0.00003254301,0.003257927,0.00004134178,0.0067991395,0.88724804,0.033446558,0.06757035],"study_design_scores_gemma":[0.00030749897,0.00012259242,0.0004711075,0.00085089635,0.000044711378,0.000019000536,0.00037672409,0.2895054,0.030846268,0.6543385,0.022230621,0.0008866965],"about_ca_topic_score_codex":0.000005119104,"about_ca_topic_score_gemma":0.0000014837924,"teacher_disagreement_score":0.28946403,"about_ca_system_score_codex":0.000047310208,"about_ca_system_score_gemma":0.000045861092,"threshold_uncertainty_score":0.88359255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004101338,0.001118257,0.98901963,0.0020927964,0.00007422319,0.0002824863,0.000012467116,0.000030046162,0.0032687364],"genre_scores_gemma":[0.96961343,0.0010608773,0.028483417,0.00029419607,0.00010400305,0.00014748334,0.000008671604,0.000008028846,0.00027986834],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978859,0.00006934163,0.0010057446,0.000427119,0.00041842143,0.00019346747],"domain_scores_gemma":[0.9971079,0.00020694308,0.00076966075,0.00038801582,0.0014303118,0.00009713497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045978796,0.00021450673,0.00048625964,0.0025267224,0.0001455223,0.0006333817,0.0012940303,0.000112539434,0.000013886961],"category_scores_gemma":[0.00004625447,0.00018706992,0.00021555593,0.003766228,0.0003324291,0.000781297,0.00024770366,0.0003199862,0.000002632433],"study_design_candidate":"design_other","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.000105198764,0.0010009776,0.021465689,0.00004653364,0.0029359523,0.000015659605,0.00038512365,0.0009485937,0.0010965824,0.08756726,0.000087175475,0.88434523],"study_design_scores_gemma":[0.00702736,0.0011313884,0.098951004,0.0013118557,0.008398002,0.00051091914,0.0034382662,0.21209598,0.053089812,0.3120855,0.2996167,0.0023432188],"about_ca_topic_score_codex":0.00012219533,"about_ca_topic_score_gemma":0.00034041845,"teacher_disagreement_score":0.9655121,"about_ca_system_score_codex":0.00019143887,"about_ca_system_score_gemma":0.00029229678,"threshold_uncertainty_score":0.762849},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007523931,0.00065774063,0.9353375,0.00028058697,0.000114226306,0.00046847505,0.000029561308,0.00039388504,0.06271054],"genre_scores_gemma":[0.06761083,0.00046005563,0.9127354,0.0017034147,0.00163083,0.00017766439,0.00023823502,0.00027066804,0.01517292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983422,0.000014707015,0.00028282922,0.00066864764,0.00036702544,0.00032458603],"domain_scores_gemma":[0.9985215,0.00029422378,0.0001544907,0.0007287649,0.00025173233,0.00004929491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000121818055,0.0003809753,0.00038230792,0.00014343887,0.00008848791,0.00032393032,0.0009308067,0.0002907465,0.000002014452],"category_scores_gemma":[0.000046873927,0.00038018555,0.00016818127,0.00013003868,0.00013301786,0.00070780003,0.00027160704,0.0004844701,0.000028669081],"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.000019075987,0.00008304799,0.000008011935,0.00022089478,0.00003313798,0.000041802956,0.0007312162,0.00032675228,0.0006760204,0.104050465,0.0032455174,0.8905641],"study_design_scores_gemma":[0.00019503965,0.00015887449,0.0000023668917,0.00025311913,0.000010466781,0.000017478165,2.0290778e-7,0.0083655715,0.104550794,0.87014514,0.015715891,0.000585074],"about_ca_topic_score_codex":0.0000063604184,"about_ca_topic_score_gemma":0.0000037032028,"teacher_disagreement_score":0.889979,"about_ca_system_score_codex":0.00012009123,"about_ca_system_score_gemma":0.00021143511,"threshold_uncertainty_score":0.999865},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6778029,0.0031575253,0.2820392,0.005367346,0.0016914055,0.0019045164,0.000012027682,0.0027933666,0.025231674],"genre_scores_gemma":[0.9194551,0.0000066746193,0.07989324,0.000210028,0.000006627284,0.00008742164,0.0000010393718,0.000013504822,0.00032634838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990443,0.000019144758,0.00024364208,0.0002581633,0.00019620721,0.00023855144],"domain_scores_gemma":[0.9991246,0.000062032,0.00010403316,0.00044078915,0.00021510212,0.000053476255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002157331,0.00012555002,0.00018182152,0.000078983816,0.000055523018,0.00017245092,0.00091624074,0.000049856164,6.4060106e-7],"category_scores_gemma":[0.00014219814,0.0001101699,0.00007018353,0.00024176479,0.000077751145,0.0009500027,0.00022298966,0.000060988434,0.000009944229],"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.000011305486,0.00027462235,0.00015172648,0.00007619355,0.000014326752,0.0000012695114,0.00046649712,0.0000036685583,0.009378019,0.81590205,0.0066096056,0.16711074],"study_design_scores_gemma":[0.00055048603,0.0002901167,0.0002482949,0.000101061836,0.000006904705,0.0000033927108,0.000017848337,0.01113889,0.2473287,0.72536826,0.014667498,0.0002785475],"about_ca_topic_score_codex":0.000011043202,"about_ca_topic_score_gemma":0.0000014207139,"teacher_disagreement_score":0.24165218,"about_ca_system_score_codex":0.00003914982,"about_ca_system_score_gemma":0.00008337643,"threshold_uncertainty_score":0.44925982},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013423832,0.00043200687,0.24875398,0.0007372267,0.0010469714,0.000461625,0.7478485,0.00008009495,0.00050537137],"genre_scores_gemma":[0.00494172,0.00043067252,0.07403538,0.00087673956,0.00014973008,0.00013248758,0.9095849,0.00008120033,0.009767192],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965992,0.00026870111,0.00070576265,0.0009779688,0.0006712734,0.0007771009],"domain_scores_gemma":[0.995895,0.0011768821,0.001010903,0.0010186977,0.0006051244,0.00029337083],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006545234,0.00064694893,0.00058093877,0.00023592632,0.00025223082,0.0018644922,0.0016076298,0.00029872824,0.00012167471],"category_scores_gemma":[0.0014364363,0.0007852331,0.000048393165,0.00041939397,0.00017405741,0.0018598374,0.0005157548,0.0006050186,0.000045982495],"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.00001743272,0.00014773254,0.00015857047,0.00091145776,0.00006253961,0.00023862359,0.00012790458,0.00004745325,0.00005170359,0.005463581,0.92497724,0.06779574],"study_design_scores_gemma":[0.00024277552,0.00026312284,0.0075575113,0.0019423274,0.00016401174,0.00007198316,0.00005859904,0.009755852,0.0022593024,0.008067053,0.9682541,0.0013633826],"about_ca_topic_score_codex":0.117339216,"about_ca_topic_score_gemma":0.5282596,"teacher_disagreement_score":0.41092035,"about_ca_system_score_codex":0.001383609,"about_ca_system_score_gemma":0.0038476733,"threshold_uncertainty_score":0.99945986},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.422136,0.000076698794,0.5754844,0.0011270805,0.00017921964,0.00048677137,0.000013717016,0.00043916595,0.000056938665],"genre_scores_gemma":[0.99308467,5.7982226e-7,0.006275023,0.00005508886,0.000041594936,0.00033235594,0.00010137985,0.000010815047,0.00009850436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988134,0.000055350833,0.00015765979,0.00041398397,0.00031437055,0.0002452623],"domain_scores_gemma":[0.99944574,0.000026075666,0.00010717587,0.00023680471,0.00014166828,0.000042513188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004005008,0.00012154253,0.000113704984,0.000066712106,0.0003061754,0.0001867658,0.00028785184,0.00003668035,0.0000015896571],"category_scores_gemma":[0.0000350309,0.00011167022,0.000026173411,0.000779505,0.000038894894,0.00042205324,0.00018306736,0.00025574063,1.6201417e-7],"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.0003863448,0.0006910543,0.0007140031,0.0001451993,0.000015345864,0.00001681415,0.0037731857,0.9708476,0.00404836,0.0035550725,0.0026614484,0.013145572],"study_design_scores_gemma":[0.00035380787,0.00028405414,0.000547836,0.000053100433,0.0000050291756,0.00007478944,0.00031562702,0.9922843,0.004844519,0.0008191095,0.00024880454,0.0001690103],"about_ca_topic_score_codex":0.000014870814,"about_ca_topic_score_gemma":0.0000018882074,"teacher_disagreement_score":0.57094866,"about_ca_system_score_codex":0.0002490712,"about_ca_system_score_gemma":0.00008371431,"threshold_uncertainty_score":0.45537794},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.0569142e-7,0.00078213844,0.041892905,0.0014291831,0.0012511199,0.00041758828,0.00010775358,0.0021951045,0.9519238],"genre_scores_gemma":[0.000054749897,0.0005765015,0.017939327,0.00026950683,0.00014301148,0.0000017813527,0.0000035294388,0.00024466653,0.98076695],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791646,0.0000917241,0.00015625056,0.00080396666,0.00048738442,0.0005442041],"domain_scores_gemma":[0.99698675,0.0001435027,0.00034282927,0.0023351233,0.000044498556,0.00014730284],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00006274409,0.0004806301,0.00039335285,0.00027250597,0.0002245882,0.00092924136,0.0054538376,0.0003628574,0.000083496954],"category_scores_gemma":[0.000026063162,0.00038393636,0.00018553766,0.0005227993,0.000223343,0.0026418737,0.00320282,0.00042612336,0.00016503493],"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.000013043249,0.000041742598,0.0000060278176,0.000057815123,0.00006943291,0.000077245175,0.000080043326,0.0000013840839,0.0000015895935,0.008970024,0.9880826,0.0025990494],"study_design_scores_gemma":[0.00044823412,0.00005024318,0.0000032054768,0.00020970736,0.00002401754,0.0000026114933,0.0000316891,0.00030098893,0.00021733221,0.001711559,0.9964615,0.0005389025],"about_ca_topic_score_codex":0.00038866856,"about_ca_topic_score_gemma":0.046818215,"teacher_disagreement_score":0.04642955,"about_ca_system_score_codex":0.00005888481,"about_ca_system_score_gemma":0.00026672622,"threshold_uncertainty_score":0.9999271},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019454246,0.00077916094,0.023493081,0.00067394733,0.00015175635,0.00070410984,0.0001948387,0.00093084614,0.97287774],"genre_scores_gemma":[0.17144527,0.001160948,0.01016046,0.00044147577,0.00019265499,1.7987945e-7,0.0003627657,0.005024973,0.8112113],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997857,0.0003403141,0.00045144578,0.00050780305,0.0005566896,0.0002867521],"domain_scores_gemma":[0.9978794,0.000040688075,0.000404676,0.0011995559,0.00041755973,0.0000581131],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052713836,0.00022284062,0.00035028256,0.00059854885,0.00024772823,0.0006143314,0.0038112309,0.00012714196,0.0018225681],"category_scores_gemma":[0.0007425249,0.00019209612,0.00009770072,0.0012223009,0.00034134943,0.00030328738,0.0038148419,0.00031229874,0.00034397465],"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.000014942672,0.00018734617,0.000062832725,0.0009826841,0.000041744497,0.000011115949,0.0009996537,0.0000035908276,0.0007837565,0.0037403274,0.8272199,0.16595213],"study_design_scores_gemma":[0.0001728507,0.000096499025,0.0005390834,0.0013467759,0.000009390138,0.000011438206,0.000021107888,0.0000650403,0.0027995685,0.00036900933,0.9943983,0.00017093049],"about_ca_topic_score_codex":0.00010718539,"about_ca_topic_score_gemma":0.000003649051,"teacher_disagreement_score":0.17125072,"about_ca_system_score_codex":0.00009613829,"about_ca_system_score_gemma":0.000024863099,"threshold_uncertainty_score":0.9990899},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017092474,0.000076043616,0.32894856,0.0011260133,0.00023012309,0.0005053886,0.000028463286,0.0055460692,0.6464468],"genre_scores_gemma":[0.97646,0.000016070699,0.018791921,0.00044426988,0.000060008708,3.076179e-8,0.0001797183,0.00082325423,0.003224755],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986814,0.0001188427,0.00017101146,0.00042246096,0.0003097887,0.00029648314],"domain_scores_gemma":[0.9988125,0.000012210642,0.0000761262,0.00070074724,0.00028407076,0.000114357266],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00041419224,0.00011282839,0.0001060395,0.00017248068,0.0006117645,0.0029363504,0.0025226944,0.00003780248,0.002381413],"category_scores_gemma":[0.00017235494,0.0001180402,0.000037539776,0.0004995521,0.000065778484,0.0013051324,0.002563219,0.00015351576,0.019392354],"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.000022058135,0.00020434587,0.00003110571,0.00012778325,0.000026955706,0.00002826148,0.0008322115,0.000007719624,0.026989952,0.073118515,0.19615221,0.70245886],"study_design_scores_gemma":[0.0001963868,0.00016632471,0.00032828166,0.000036554888,0.0000021237884,0.00012195001,0.000021557678,0.0017328572,0.004427594,0.0023617097,0.9904221,0.00018254372],"about_ca_topic_score_codex":0.0000042644765,"about_ca_topic_score_gemma":3.6082803e-8,"teacher_disagreement_score":0.9593675,"about_ca_system_score_codex":0.00007705581,"about_ca_system_score_gemma":0.0000033923961,"threshold_uncertainty_score":0.99853057},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029342277,0.00005127131,0.4161666,0.00015686214,0.00056847796,0.00010532299,0.000009505838,0.0014232893,0.5815157],"genre_scores_gemma":[0.0003071948,0.000015294976,0.5663141,0.00016769,0.00031130319,0.000017300941,0.000020527339,0.00014149636,0.43270507],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986881,0.00001382455,0.00022484176,0.00044281175,0.00044598506,0.0001844344],"domain_scores_gemma":[0.9991355,0.000035662426,0.00024746667,0.00034652793,0.00017618148,0.0000586503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010516866,0.0002277865,0.0001849085,0.00062835315,0.000028792112,0.0003498226,0.0008894302,0.00016154716,0.0001786045],"category_scores_gemma":[0.0000505027,0.00020314885,0.000051228126,0.0003339223,0.000071558956,0.00042663145,0.00022874278,0.00018252991,0.0001212923],"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.00005614905,0.0001546235,0.0004684942,0.00007965929,0.00037677828,0.0002712073,0.000090753005,0.000035254634,0.000117717354,0.0051571336,0.46409446,0.5290978],"study_design_scores_gemma":[0.00033421582,0.00005809531,0.00006587137,0.00076907995,0.000011062766,0.0003466768,0.0000031595757,0.041703466,0.0012411732,0.00064557797,0.9543423,0.0004793281],"about_ca_topic_score_codex":0.000058154674,"about_ca_topic_score_gemma":0.00016414773,"teacher_disagreement_score":0.52861845,"about_ca_system_score_codex":0.00010723256,"about_ca_system_score_gemma":0.00008661021,"threshold_uncertainty_score":0.828417},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009064515,0.00082820765,0.010511399,0.00081690983,0.0010594659,0.00059439754,0.000013240726,0.0016626483,0.9844231],"genre_scores_gemma":[0.020250747,0.00023071025,0.0033075563,0.00003468452,0.000765318,0.0000057597695,0.000013680235,0.00036214234,0.9750294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947815,0.00054616365,0.00030399102,0.0014118421,0.0013152075,0.0016412904],"domain_scores_gemma":[0.9960028,0.00028645754,0.0003257528,0.0024717182,0.00020226327,0.00071103766],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057755987,0.00058333925,0.0006138669,0.0026758753,0.00043472162,0.0010969489,0.005514303,0.0005956739,0.00029061057],"category_scores_gemma":[0.00011330303,0.000647442,0.00027813573,0.0021284232,0.00076959626,0.0016460989,0.0029630456,0.001350562,0.001111048],"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.000039388156,0.00028322017,0.0034884564,0.00027820966,0.00025015834,0.0018408977,0.00017700296,2.9599443e-7,0.00051939423,0.06766016,0.9180358,0.0074270316],"study_design_scores_gemma":[0.00028797062,0.00016732658,0.00024397836,0.0002787397,0.000023158387,0.00010367832,0.00003198482,0.00006415439,0.0056605246,0.0016200617,0.9908171,0.00070130377],"about_ca_topic_score_codex":0.028144045,"about_ca_topic_score_gemma":0.007740926,"teacher_disagreement_score":0.07278133,"about_ca_system_score_codex":0.0007346587,"about_ca_system_score_gemma":0.0010889972,"threshold_uncertainty_score":0.99994004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0664423,0.00002724789,0.92766505,0.000066750996,0.000062114785,0.0002741616,8.360298e-7,0.00060446985,0.0048570493],"genre_scores_gemma":[0.5667983,0.0000010742518,0.43296596,0.00004994811,0.00000877259,0.00000770582,0.0000014449664,0.0000040502773,0.00016270195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989513,0.000010113361,0.00022747907,0.00037785002,0.00019232463,0.00024090367],"domain_scores_gemma":[0.9993181,0.00009379163,0.00007536874,0.00039481086,0.00005106817,0.000066812114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089599245,0.00010721315,0.00010603715,0.000046930265,0.00010220517,0.00022018739,0.00038934202,0.000045346187,0.0000043620216],"category_scores_gemma":[0.000014998361,0.00009583878,0.000048673726,0.00009438,0.000069512455,0.0012331594,0.0001519387,0.000059245034,0.000008083618],"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.00013379799,0.001256017,0.032529246,0.00025861117,0.000058464997,0.000005678846,0.0007614239,0.041241128,0.005084993,0.105433874,0.0019979542,0.8112388],"study_design_scores_gemma":[0.00009753218,0.000080988124,0.0032134703,0.0000077942805,0.0000034195393,5.906977e-7,0.0000098927885,0.86720866,0.03837772,0.09020319,0.00063943217,0.0001573271],"about_ca_topic_score_codex":0.000035292618,"about_ca_topic_score_gemma":0.0000094950165,"teacher_disagreement_score":0.8259675,"about_ca_system_score_codex":0.00005941487,"about_ca_system_score_gemma":0.000012565782,"threshold_uncertainty_score":0.3908192},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.9290056e-8,0.00033279302,0.26765376,0.00008534654,0.00016887211,0.00012832419,0.0000075644016,0.0010195209,0.73060375],"genre_scores_gemma":[0.0002202692,0.000011066864,0.07324147,0.00071470405,0.00007766481,0.000020734185,0.000005350087,0.000029192399,0.92567956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986811,0.000006040371,0.0002689005,0.0005547192,0.0002739404,0.0002152925],"domain_scores_gemma":[0.99843276,0.00006155178,0.0001509195,0.0011371967,0.00015015654,0.00006742946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008697598,0.00030935035,0.00029668908,0.00019832404,0.00006049836,0.00050262327,0.0019048877,0.00024429723,0.00000952208],"category_scores_gemma":[0.000022272558,0.0003071765,0.00012157038,0.000012733501,0.000104974424,0.00021746143,0.0012906272,0.00032332455,0.00006992114],"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":[9.852126e-7,0.0000034273694,4.1367283e-8,0.000048640923,0.00001624914,0.000026077218,0.000019844254,7.629266e-8,0.000029050741,0.66113055,0.012863196,0.32586184],"study_design_scores_gemma":[0.000042858992,0.000023262075,8.4871004e-8,0.00038183315,0.000011182453,0.0000063301213,7.7603154e-8,0.00022196636,0.0052091614,0.42618534,0.567671,0.00024687187],"about_ca_topic_score_codex":0.0000045615225,"about_ca_topic_score_gemma":0.0000015450352,"teacher_disagreement_score":0.55480784,"about_ca_system_score_codex":0.000033743912,"about_ca_system_score_gemma":0.00015109284,"threshold_uncertainty_score":0.999938},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6472276,0.0010531794,0.33316678,0.0011805142,0.0010558787,0.0027884592,0.000032115237,0.00093283923,0.01256267],"genre_scores_gemma":[0.73834974,0.000047262856,0.2552184,0.000106506544,0.00012820921,0.00018766864,0.00043850756,0.000089464214,0.005434267],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963818,0.00014991405,0.0008444187,0.0011378552,0.0007029057,0.0007831023],"domain_scores_gemma":[0.99718565,0.00009976358,0.0010503876,0.0010317903,0.00048409365,0.00014833189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005589257,0.000651034,0.00071323675,0.0006218368,0.00012770308,0.0009810275,0.0015199322,0.00051822956,0.00007575247],"category_scores_gemma":[0.000089153225,0.00071956945,0.00017576186,0.0014956174,0.00005937237,0.0019404946,0.00019140364,0.0006249751,0.000012625555],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"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.00025141312,0.0008338484,0.00064767874,0.0016675672,0.00006975188,0.00020762108,0.019799171,0.00022882191,0.065702714,0.0019072162,0.0015809935,0.9071032],"study_design_scores_gemma":[0.0010682453,0.0013731786,0.002834633,0.0009891263,0.00007260182,0.000022910992,0.0037950433,0.019271899,0.9637575,0.0046609296,0.0009844692,0.0011694496],"about_ca_topic_score_codex":0.006739571,"about_ca_topic_score_gemma":0.012511636,"teacher_disagreement_score":0.90593374,"about_ca_system_score_codex":0.00016236778,"about_ca_system_score_gemma":0.0005877936,"threshold_uncertainty_score":0.99987465},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017191607,0.01900429,0.3067956,0.00030212424,0.001262638,0.00069143786,0.000079400386,0.002571359,0.66927594],"genre_scores_gemma":[0.04030839,0.003174469,0.021505171,0.0006007243,0.0009841298,0.00008098136,0.00028899225,0.0002813672,0.9327758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968521,0.000063818145,0.00085723493,0.0012130939,0.0005713062,0.00044246778],"domain_scores_gemma":[0.99732876,0.00017030742,0.0005940707,0.0014731729,0.00014333881,0.0002903643],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00017422377,0.00076590216,0.00084043626,0.00041899114,0.00012541382,0.0027874957,0.0025198574,0.0006605275,0.000050357383],"category_scores_gemma":[0.00003596617,0.0006543089,0.000113550625,0.000102260776,0.0002465618,0.0018354142,0.0015308041,0.0007192543,0.00021185765],"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.000005696442,0.000007820142,0.000020393587,0.00049273804,0.000041525138,0.000043618897,0.000050812374,0.0000027289418,0.000012713249,0.7909419,0.02070201,0.18767807],"study_design_scores_gemma":[0.000050788505,0.00010140267,0.000013161888,0.0014045412,0.000017423536,0.00015670113,0.0000040460905,0.00097388454,0.0018016938,0.1567659,0.8379011,0.00080935186],"about_ca_topic_score_codex":0.000026908981,"about_ca_topic_score_gemma":9.944984e-7,"teacher_disagreement_score":0.8171991,"about_ca_system_score_codex":0.000040121602,"about_ca_system_score_gemma":0.00022227693,"threshold_uncertainty_score":0.9995908},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1686758,0.000120401324,0.8039859,0.0010621073,0.00008383723,0.00026547216,0.0000052805763,0.0004812563,0.025319971],"genre_scores_gemma":[0.79032373,0.000016922606,0.20857316,0.00098103,0.000012427444,0.000009285123,0.0000034834416,0.000008978405,0.000070951726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990992,0.00002928049,0.00013905964,0.00039769136,0.0001826326,0.00015213226],"domain_scores_gemma":[0.99948126,0.000017305278,0.000028143888,0.00034385352,0.00003098815,0.00009843552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002232111,0.00013095519,0.00011356389,0.0002866439,0.000119812255,0.0004362451,0.00027777973,0.000054295688,0.000003912203],"category_scores_gemma":[0.000011731631,0.00010684992,0.00004393408,0.0005563153,0.00003573046,0.00031703053,0.00006877538,0.0001246055,0.0000059846634],"study_design_candidate":"design_other","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.000017144339,0.0001064195,0.000527572,0.000016942811,0.000002736046,0.0000025215309,0.000031905718,0.00004294492,0.00024872768,0.0074416855,0.00011609546,0.9914453],"study_design_scores_gemma":[0.00019936479,0.00032112745,0.0017508356,0.000075474,0.0000031524332,0.00002663389,7.406515e-7,0.9747776,0.0009996283,0.019608317,0.0020431362,0.00019399359],"about_ca_topic_score_codex":0.000034310007,"about_ca_topic_score_gemma":5.868651e-7,"teacher_disagreement_score":0.9912513,"about_ca_system_score_codex":0.000009235089,"about_ca_system_score_gemma":0.000009502454,"threshold_uncertainty_score":0.43572134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8709478,0.0038942273,0.115593694,0.000221794,0.0002302612,0.00015159277,0.0000038058668,0.00045176738,0.008505105],"genre_scores_gemma":[0.9714803,0.000029974364,0.028368145,0.000070250004,0.0000030225945,0.000004517659,9.832924e-7,0.000006201951,0.000036566544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930215,0.000016313828,0.00017284103,0.0002040517,0.00017281846,0.0001318033],"domain_scores_gemma":[0.9994365,0.000038513354,0.000094152165,0.00017544112,0.00015327758,0.00010212238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019223242,0.00010168965,0.00015048699,0.00007419165,0.00006188003,0.00041671563,0.00022016783,0.000036965914,9.858264e-8],"category_scores_gemma":[0.00007771104,0.00009375673,0.000018123745,0.00025474912,0.00007770405,0.00078913156,0.00025748808,0.000060378803,2.2946101e-7],"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.0000033671724,0.00012302685,0.018618194,0.00007955545,0.000021548622,0.000019552659,0.0016783171,0.0000060386087,0.0011932686,0.7552536,0.00092980464,0.22207369],"study_design_scores_gemma":[0.0004996286,0.0003756818,0.0010981571,0.00007005022,0.000007486545,0.000049622504,0.00011209343,0.037460208,0.008356411,0.9512577,0.00040334975,0.0003095789],"about_ca_topic_score_codex":0.000008151534,"about_ca_topic_score_gemma":0.0000011998912,"teacher_disagreement_score":0.22176412,"about_ca_system_score_codex":0.0000064988303,"about_ca_system_score_gemma":0.000040444975,"threshold_uncertainty_score":0.40183985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9158916,0.0006746594,0.035163827,0.006533103,0.0026146374,0.0009796936,0.000003375088,0.0030648878,0.035074238],"genre_scores_gemma":[0.96584857,0.0000039213705,0.033940215,0.00010035955,0.0000026572752,0.000025488936,0.0000030755223,0.000008656196,0.00006706743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990678,0.000019600413,0.00019466568,0.0003132288,0.00018694473,0.00021776563],"domain_scores_gemma":[0.99932146,0.0000262513,0.000056708926,0.0004865748,0.00005721456,0.00005177279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020253652,0.000106397616,0.00012424319,0.00020357485,0.00005162898,0.00021819447,0.0006832535,0.000033990636,0.0000015276665],"category_scores_gemma":[0.000108475026,0.00010850746,0.00003117967,0.00086659665,0.000043701013,0.0010537469,0.00014780817,0.00011618396,0.00003182924],"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.0000019074002,0.00015452871,0.0008287276,0.000006424071,0.0000026748319,0.000019101144,0.00019725166,0.000012841717,0.00032129814,0.9908854,0.00036433476,0.007205526],"study_design_scores_gemma":[0.0005312857,0.000043385186,0.004514269,0.000034368622,0.0000011709299,0.000009212301,0.0000025880854,0.000071099676,0.014350766,0.97996783,0.0003391739,0.00013483076],"about_ca_topic_score_codex":0.0000513365,"about_ca_topic_score_gemma":0.000008273338,"teacher_disagreement_score":0.04995698,"about_ca_system_score_codex":0.00006693518,"about_ca_system_score_gemma":0.00009837755,"threshold_uncertainty_score":0.44248056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.628328,0.0006392507,0.14324832,0.036944363,0.0028539149,0.0020229926,0.000008391314,0.008428974,0.17752577],"genre_scores_gemma":[0.95322645,0.000007376703,0.045429163,0.0010947203,0.00001570981,0.000042835898,0.0000016008363,0.000018103361,0.00016405778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983382,0.000094457115,0.00024109057,0.0004854678,0.00046993524,0.0003708434],"domain_scores_gemma":[0.99854666,0.00007058244,0.00012117162,0.001002637,0.00014637788,0.00011256978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005283387,0.00020380951,0.00014350424,0.000118068965,0.00023481483,0.0009424022,0.0023535346,0.00007214585,0.000010846594],"category_scores_gemma":[0.000041351035,0.00014822712,0.00007122848,0.0005733738,0.00014395393,0.0019823574,0.00022738473,0.00023946309,0.0000910011],"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.0000027501774,0.00020181826,0.000105413776,0.0000049398636,0.000007482845,0.000013748498,0.00017200953,0.000010472589,0.0015730814,0.9450439,0.0018052125,0.051059134],"study_design_scores_gemma":[0.00017889334,0.00025554237,0.0002909867,0.000052206517,0.0000047494736,0.000022073622,0.000010614677,0.0048105842,0.018133836,0.9733248,0.002644001,0.00027171348],"about_ca_topic_score_codex":0.000011885673,"about_ca_topic_score_gemma":0.0000049020437,"teacher_disagreement_score":0.32489842,"about_ca_system_score_codex":0.000051534116,"about_ca_system_score_gemma":0.00010392497,"threshold_uncertainty_score":0.90876067},"labels":[],"label_agreement":null}]}