{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":246,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":246,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"ff566d36509f","filters":{"topic":"Digital Image Processing Techniques"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01892458715604498,"gpt":0.2752427621095399,"spread":0.2563181749534948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001158929,0.0003894616,0.0003512238,0.0001747478,0.0002151027,0.01496372,0.004353114,0.0002298805,0.00001338094],"category_scores_gemma":[0.0001101255,0.0003467967,0.0001339648,0.00004694591,0.0002611853,0.008866773,0.001668476,0.0003320269,0.0005521749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001192893,"about_ca_system_score_gemma":0.001001712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.620365e-7,"about_ca_topic_score_gemma":3.933654e-7,"domain_scores_codex":[0.9981648,0.000003827844,0.0002781555,0.0007453154,0.000458103,0.0003497519],"domain_scores_gemma":[0.9976041,0.00002495737,0.0004004527,0.001569818,0.000281482,0.0001192137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[4.835516e-7,0.00001662697,5.334871e-7,0.00009732522,0.0000059652,0.0000741001,0.0000171069,6.942014e-9,0.000008167006,0.0114704,0.2183172,0.7699921],"study_design_scores_gemma":[0.00006236912,0.00003541273,0.000001559818,0.0004986976,0.000006278583,0.00006825601,4.86429e-7,0.0009290485,0.0005473139,0.2572367,0.7400035,0.0006104631],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[2.34774e-8,0.0001712572,0.4230861,0.0001489774,0.00006663456,0.00008846925,0.000005170345,0.001495097,0.5749382],"genre_scores_gemma":[0.00007685603,0.000006136668,0.1814778,0.0001472401,0.0001188137,0.00001139981,0.00001924379,0.00004637488,0.8180961],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7693816,"threshold_uncertainty_score":0.9998984,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03435932168418605,"gpt":0.2575270295874086,"spread":0.2231677079032225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001152504,0.0002023319,0.0001519677,0.0002411343,0.0002880215,0.0003764701,0.001118621,0.00007640439,0.000001888644],"category_scores_gemma":[0.00002651901,0.0001597642,0.00007659206,0.0008884156,0.0002506298,0.001160045,0.00002110136,0.0004158847,0.000009416397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004495586,"about_ca_system_score_gemma":0.0001559945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001663626,"about_ca_topic_score_gemma":0.00005488919,"domain_scores_codex":[0.9986641,0.00001556666,0.0002116631,0.0004495083,0.0003565581,0.0003025428],"domain_scores_gemma":[0.9986925,0.00004157698,0.00006100137,0.0009685766,0.0001239909,0.0001124011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004494239,0.004763009,0.001588438,0.0005032098,0.0004217087,0.0003381712,0.009282771,0.02969182,0.01800783,0.1932338,0.000117635,0.7416021],"study_design_scores_gemma":[0.002991409,0.00282782,0.00269755,0.001796325,0.0001170262,0.0008041692,0.0002555675,0.007362479,0.3623367,0.6126816,0.003211125,0.002918279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03018351,0.0000659936,0.9655307,0.00276979,0.00005720703,0.0001651682,0.00000452662,0.000956849,0.0002662754],"genre_scores_gemma":[0.6676573,0.00003153628,0.3316249,0.0005769477,0.000009760573,0.00004844776,9.084535e-7,0.00001775985,0.00003241441],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7386839,"threshold_uncertainty_score":0.6514993,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01508185568121779,"gpt":0.2677446627628029,"spread":0.2526628070815851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007987079,0.0001000528,0.000273718,0.0008034534,0.0001225643,0.0002647952,0.0004821289,0.00004657342,0.00004432724],"category_scores_gemma":[0.0004911588,0.0000703586,0.00005237226,0.003132564,0.0006023097,0.0009775772,0.0001108043,0.0001421303,6.776754e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003895998,"about_ca_system_score_gemma":0.0001155028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004360678,"about_ca_topic_score_gemma":0.000002117098,"domain_scores_codex":[0.9986027,0.00003120434,0.0003414718,0.0002521498,0.0005991993,0.0001732352],"domain_scores_gemma":[0.9989228,0.0001873082,0.0002688142,0.0001480974,0.0003460292,0.0001269772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009554008,0.003185431,0.09311912,0.0001118846,0.0004370336,0.0004710988,0.001831106,0.133282,0.3125425,0.02091184,0.002268192,0.4308844],"study_design_scores_gemma":[0.0007660897,0.003227917,0.1033437,0.0002668557,0.0001611573,0.0006691067,0.00005056126,0.7309464,0.1506355,0.009322812,0.0001867829,0.0004231006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8095218,0.0002346509,0.1885385,0.0008791795,0.00005027154,0.00004019652,0.000001663287,0.00002312468,0.0007106604],"genre_scores_gemma":[0.9499612,0.00002509068,0.04982026,0.000155133,0.00001017387,6.398934e-7,3.31447e-7,0.000002029424,0.00002510939],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5976645,"threshold_uncertainty_score":0.2869141,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01454162845871684,"gpt":0.3143449622549541,"spread":0.2998033337962372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005747802,0.0003378546,0.0003553729,0.001737608,0.000312464,0.001665237,0.0003943083,0.0001962855,0.00000343616],"category_scores_gemma":[0.000007752519,0.0003145286,0.00006383481,0.001483835,0.0003615945,0.001678037,0.000848271,0.000563961,0.000001653844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001469427,"about_ca_system_score_gemma":0.00003015683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007994398,"about_ca_topic_score_gemma":0.0002026719,"domain_scores_codex":[0.9978223,0.00008001851,0.0005397718,0.0008871609,0.0003256783,0.0003450697],"domain_scores_gemma":[0.9988168,0.000315854,0.0001484005,0.0003911036,0.0001550819,0.0001727574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008065326,0.0002698724,0.009427996,0.00004041231,0.00001244613,0.00002470428,0.0002402887,0.00006926484,0.00001056643,0.3081926,0.000375928,0.6813278],"study_design_scores_gemma":[0.0006630394,0.0003060059,0.1574529,0.0001311287,0.000005121969,0.00009285547,0.000001261706,0.76214,0.00000492921,0.07797355,0.0009297206,0.0002994145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2033658,0.0001418276,0.7947742,0.0009047094,0.0004106013,0.0001394218,0.000008045346,0.0001684103,0.00008700519],"genre_scores_gemma":[0.7258904,0.00009927034,0.2733673,0.0004691691,0.00009126995,0.000008486722,0.00005263117,0.00001590545,0.000005551266],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7620708,"threshold_uncertainty_score":0.9999307,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0432920966998345,"gpt":0.2804801042245686,"spread":0.2371880075247341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003634082,0.000413362,0.0003271155,0.0003972785,0.0008047086,0.001106134,0.001154662,0.0001201535,0.00001881681],"category_scores_gemma":[0.00002951318,0.0004224426,0.000203513,0.0006737453,0.0001972476,0.005049848,0.00001461683,0.0003516248,0.00003236556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001183591,"about_ca_system_score_gemma":0.0001977383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002763224,"about_ca_topic_score_gemma":0.000007298961,"domain_scores_codex":[0.9974686,0.00004533799,0.0005095166,0.0008776661,0.0003930136,0.0007058783],"domain_scores_gemma":[0.9984776,0.0001151948,0.0002303074,0.0005544541,0.0004443411,0.0001781253],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001585189,0.0002544991,0.000003845803,0.0001210608,0.00002205889,0.00002005712,0.001074187,0.0000218318,0.00712032,0.00007111228,0.00007527206,0.9911999],"study_design_scores_gemma":[0.0005504481,0.0001983864,0.00002099654,0.0004011357,0.00003862928,0.0001071003,0.0001076065,0.4312608,0.5594002,0.006987396,0.000285292,0.0006419495],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002305895,0.0001775824,0.9944585,0.0001295963,0.000321228,0.0004238906,0.00001618378,0.002014936,0.002227513],"genre_scores_gemma":[0.3863295,0.000004990006,0.6130191,0.0002111999,0.00003922698,0.0001783255,0.000001168591,0.00005389731,0.0001626422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.990558,"threshold_uncertainty_score":0.9999308,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01786626978284251,"gpt":0.247951898910027,"spread":0.2300856291271845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006731995,0.000634852,0.0005445399,0.0009094783,0.0002454982,0.001486251,0.006193891,0.000342706,0.00007768026],"category_scores_gemma":[0.00009944553,0.0005843901,0.0001514766,0.0008003716,0.001291725,0.00149631,0.001311867,0.0007228599,0.0001255851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002459477,"about_ca_system_score_gemma":0.001069312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002102198,"about_ca_topic_score_gemma":0.00003335132,"domain_scores_codex":[0.9954056,0.00002748927,0.0005425955,0.001791888,0.001454924,0.0007774947],"domain_scores_gemma":[0.9973307,0.0003674483,0.0002665088,0.001554146,0.0002572703,0.0002239801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006289976,0.00003760839,0.00005090503,0.00003132036,0.000004848526,0.0001475802,0.0001912538,0.008977626,0.000108173,0.00525073,0.00008848328,0.9851052],"study_design_scores_gemma":[0.0002122699,0.0002131624,0.00005489105,0.0006156561,0.000007378992,0.00003622993,2.315056e-8,0.4076877,0.01178639,0.573913,0.004364171,0.001109193],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006222654,0.0004909242,0.9753638,0.0007179237,0.001159787,0.0002874298,0.000007937191,0.000788571,0.02112143],"genre_scores_gemma":[0.1335091,0.00006810893,0.8635142,0.002040772,0.0003337894,0.00001322642,0.00000786877,0.00005272384,0.0004602176],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.983996,"threshold_uncertainty_score":0.9996607,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.161922055152267,"gpt":0.3517597225894868,"spread":0.1898376674372198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014972,0.0001224336,0.0002335846,0.0001248927,0.00004509591,0.0001104717,0.0005533408,0.00005046149,0.000001356485],"category_scores_gemma":[0.0003257985,0.0000995649,0.00006903929,0.0003157688,0.0003373587,0.000416729,0.000157029,0.00007326289,0.000001191495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002537851,"about_ca_system_score_gemma":0.00003440906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005094817,"about_ca_topic_score_gemma":0.000001120612,"domain_scores_codex":[0.9988118,0.00002120651,0.0005052768,0.0002200578,0.0002416993,0.0001999516],"domain_scores_gemma":[0.9986628,0.0002783367,0.0003312422,0.0004113164,0.0002506718,0.00006559416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001051775,0.0003228183,0.00001175466,0.0002827821,0.000008302942,0.000002734861,0.001102976,0.0000110589,0.0009145575,0.855635,0.00002017985,0.1416773],"study_design_scores_gemma":[0.000005129033,0.00007219624,0.000004876607,0.0001185466,0.000003024745,0.000003570848,0.0002701422,0.03646101,0.3817323,0.5812283,0.00001961077,0.00008129312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009050578,0.0001704271,0.9858282,0.0002556947,0.00001691052,0.0001548837,0.00000167906,0.00007197388,0.004449694],"genre_scores_gemma":[0.6485813,0.00001424245,0.3513145,0.00005401384,0.000007317554,0.000003199291,3.07749e-7,0.000005582317,0.00001956683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6395307,"threshold_uncertainty_score":0.4060139,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.0438764992275604,"gpt":0.2354915018340215,"spread":0.1916150026064611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009022336,0.0001378839,0.0001293415,0.0001085167,0.0001020094,0.0002581208,0.0004808257,0.00005432866,0.00002579539],"category_scores_gemma":[0.00005152104,0.0001400303,0.00005736318,0.0001915629,0.00007079896,0.001910215,0.0001604875,0.0001043637,0.0006940571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003488034,"about_ca_system_score_gemma":0.00003836118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001584535,"about_ca_topic_score_gemma":0.000001420252,"domain_scores_codex":[0.9989632,0.00002336122,0.0001997288,0.0003424571,0.0002442194,0.0002270731],"domain_scores_gemma":[0.9993417,0.00004028558,0.00009775049,0.0002985974,0.0001454667,0.00007621509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000002415217,0.00009739307,0.001399759,0.00002402611,0.000006745449,0.00009234045,0.0001939069,1.196639e-7,0.0005768654,0.0000165609,0.004645234,0.9929447],"study_design_scores_gemma":[0.003892852,0.001532597,0.06231863,0.00130112,0.00005396067,0.005339554,0.00006229613,0.05020816,0.6390434,0.2031237,0.02820232,0.004921407],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04967744,0.00005981774,0.9160982,0.0003098726,0.0001625169,0.0001314664,0.00001008636,0.001126056,0.0324245],"genre_scores_gemma":[0.9778997,0.00003098189,0.02070127,0.001027907,0.00006195099,0.00003806334,0.00003773855,0.00001578562,0.0001866598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9880232,"threshold_uncertainty_score":0.8920932,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02204797197110572,"gpt":0.2892287018834429,"spread":0.2671807299123372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046613,0.0004228535,0.0003163923,0.0005724258,0.0009510251,0.002472292,0.001000024,0.0001282329,0.000007609424],"category_scores_gemma":[0.00002078865,0.0004327949,0.00007054529,0.001869375,0.000158371,0.005918013,0.00003000778,0.000450075,0.0001180242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001548055,"about_ca_system_score_gemma":0.0002123972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003083004,"about_ca_topic_score_gemma":0.00002662481,"domain_scores_codex":[0.9969807,0.00004393174,0.0004874903,0.001143235,0.0006232366,0.0007213732],"domain_scores_gemma":[0.9983022,0.00005072232,0.0001299982,0.0005339979,0.0006471965,0.0003358415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002725939,0.0003286812,0.000008545419,0.000526337,0.000008745152,0.00002122263,0.001453114,0.0006374097,0.07778805,0.00005188858,0.00004735955,0.9191014],"study_design_scores_gemma":[0.0006530487,0.0002889471,0.0001022359,0.001184454,0.00004132972,0.0004928103,0.0001307974,0.5459351,0.4464091,0.002028213,0.001575398,0.001158557],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003192072,0.0003824256,0.9887649,0.002604245,0.00006446101,0.0008060044,0.000006573649,0.001686406,0.002492913],"genre_scores_gemma":[0.7855548,0.00005660077,0.2130907,0.0003878029,0.00004366823,0.0003495982,0.000001608526,0.00006508802,0.0004501326],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9179428,"threshold_uncertainty_score":0.9998124,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0179829033841774,"gpt":0.2563476440346922,"spread":0.2383647406505148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003038003,0.0002427442,0.0003300977,0.00009364813,0.0001316019,0.001148379,0.0007773069,0.0001286271,0.00003162278],"category_scores_gemma":[0.0003379943,0.0002097605,0.00006726648,0.0002192341,0.0000815965,0.001341391,0.0003848037,0.0001651807,0.0001169048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001553737,"about_ca_system_score_gemma":0.00004483583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000162701,"about_ca_topic_score_gemma":9.930749e-7,"domain_scores_codex":[0.9985295,0.00002351844,0.000358744,0.0004733328,0.0002299191,0.0003850002],"domain_scores_gemma":[0.9986578,0.0002386355,0.0002140772,0.000566602,0.000208255,0.0001145808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001903802,0.0008241729,0.0004381091,0.002395671,0.0001584396,0.0000281072,0.009397068,0.00003519977,0.02915076,0.1388606,0.03081409,0.7878787],"study_design_scores_gemma":[0.000295642,0.0002782783,0.0000374109,0.0006847836,0.00001690213,0.00006584323,0.00006356534,0.1504585,0.01417448,0.8295793,0.003804388,0.0005409635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007559393,0.0004473084,0.9860867,0.001377967,0.00009241657,0.0008947184,0.000004676623,0.0007829412,0.002753913],"genre_scores_gemma":[0.07314377,0.00001157957,0.9252388,0.0003251361,0.0000434151,0.0004909792,0.000002633894,0.000038407,0.000705229],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7873378,"threshold_uncertainty_score":0.9998885,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01708169486323152,"gpt":0.2488686564979688,"spread":0.2317869616347373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001368978,0.0001628354,0.0001148285,0.0001509436,0.000120373,0.0004806397,0.0003262554,0.00004694735,0.000005994022],"category_scores_gemma":[0.00001251725,0.0001681286,0.00003431687,0.0001902758,0.00003713288,0.0008530632,0.000112738,0.0001441989,0.0002009414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003360865,"about_ca_system_score_gemma":0.00001086946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001801217,"about_ca_topic_score_gemma":0.000001061669,"domain_scores_codex":[0.9988564,0.00003221435,0.0002124445,0.0004412614,0.0002230871,0.0002345933],"domain_scores_gemma":[0.9994509,0.00008239253,0.0001184845,0.0002237007,0.0000736029,0.00005095187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001360334,0.00004439251,0.00004613504,0.0000217558,0.00000359095,0.00001485209,0.00004991796,0.000006856766,0.001536977,0.00006112116,0.001147545,0.9970655],"study_design_scores_gemma":[0.004521782,0.0007052801,0.009910324,0.001831895,0.0001163848,0.0007985382,0.00003791055,0.6453986,0.1507811,0.1319928,0.04827704,0.005628344],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00321121,0.00005570372,0.9897268,0.0044676,0.00005187945,0.0002680877,0.0000144409,0.0006528937,0.00155133],"genre_scores_gemma":[0.2222837,0.00001626092,0.7548622,0.02193673,0.0002663737,0.0004453297,0.00008110151,0.00003672395,0.00007149141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9914371,"threshold_uncertainty_score":0.6856084,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008117234693215418,"gpt":0.2514839127944663,"spread":0.2433666781012509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005888186,0.00005148289,0.0002784641,0.0001574796,0.00004819414,0.0001261844,0.0002393245,0.00001813619,0.000006884865],"category_scores_gemma":[0.0001299649,0.00002721258,0.0001115708,0.0005862455,0.0001569743,0.000156755,0.00005600776,0.00005563137,5.291494e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003295615,"about_ca_system_score_gemma":0.00001257579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.486476e-7,"about_ca_topic_score_gemma":1.637229e-7,"domain_scores_codex":[0.9993246,0.00003508669,0.0003674126,0.00007121717,0.0001466474,0.00005503266],"domain_scores_gemma":[0.9991073,0.000249386,0.0003136883,0.0001803882,0.00009948669,0.00004975084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001408669,0.0001144136,0.0008071187,0.00003090678,0.0002424944,2.333215e-7,0.00009486423,0.000001211563,0.0002379935,0.987121,0.00003624853,0.01131208],"study_design_scores_gemma":[0.0002971996,0.00002544614,0.001069888,0.00002482471,0.0006500542,0.00004703072,0.00007309052,0.004168932,0.00650669,0.9866859,0.0003706863,0.00008030745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03505623,0.000400082,0.9632148,0.0004515492,0.000002217565,0.00005087507,5.384265e-7,0.000006456107,0.0008172374],"genre_scores_gemma":[0.9231384,0.00006299026,0.07672029,0.00003074441,0.000006539037,0.000006141323,6.504513e-8,0.000001720643,0.00003314612],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8880821,"threshold_uncertainty_score":0.1216799,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02815468631986213,"gpt":0.2491840679292382,"spread":0.221029381609376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009080413,0.0001344286,0.0001165553,0.0000617192,0.00008530106,0.0005797473,0.0007559555,0.00003090871,0.000002567533],"category_scores_gemma":[0.0000288362,0.00008803124,0.00002479294,0.0002859431,0.0001320141,0.001430088,0.0002351075,0.0001262126,0.00002249843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004252579,"about_ca_system_score_gemma":0.0001533707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000170627,"about_ca_topic_score_gemma":0.00001531005,"domain_scores_codex":[0.9989693,0.000006216024,0.0001563683,0.0003589185,0.0002466116,0.0002626478],"domain_scores_gemma":[0.9993389,0.00001008534,0.00004546663,0.0004329686,0.00008666783,0.0000859027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009634243,0.0009704217,0.005053172,0.0002459873,0.0000667081,0.0003337522,0.004940378,0.002352326,0.04374995,0.5794587,0.0006035304,0.3621287],"study_design_scores_gemma":[0.001499994,0.001045493,0.002508979,0.0009259658,0.00001434236,0.0006887866,0.0001462884,0.01242433,0.7664214,0.2089151,0.003515173,0.001894169],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0483772,0.00006529799,0.9384828,0.001342555,0.00002083914,0.000110573,3.525255e-7,0.001227213,0.01037322],"genre_scores_gemma":[0.5236955,0.000001589222,0.4756284,0.0003964462,0.0000131844,0.00001458392,3.37949e-7,0.000007913534,0.0002420269],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7226714,"threshold_uncertainty_score":0.5590516,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02158412298409306,"gpt":0.2716150750199365,"spread":0.2500309520358435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001099396,0.00007769971,0.00008892992,0.0001672813,0.00003122877,0.0001684531,0.0004622195,0.00002350729,0.000001648926],"category_scores_gemma":[0.000005024679,0.00007156862,0.00004576215,0.0005901179,0.00007047335,0.00101254,0.0001323753,0.00003367172,0.000001696325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000239884,"about_ca_system_score_gemma":0.0000221852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001511004,"about_ca_topic_score_gemma":0.000001819139,"domain_scores_codex":[0.9992748,0.00001279592,0.0001989917,0.0002010153,0.0001904753,0.0001218894],"domain_scores_gemma":[0.9996223,0.0000136156,0.00008578636,0.0002009438,0.00005664066,0.00002075209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001191105,0.001432592,0.01300971,0.0002194457,0.0000414784,0.00001753779,0.0009507358,0.002776182,0.1935413,0.3935326,0.001101838,0.3933647],"study_design_scores_gemma":[0.00004288475,0.00002958347,0.0001684271,0.00001698323,0.000003702715,0.00003492624,0.00005451314,0.1657768,0.8007185,0.03301801,0.0000107993,0.0001248519],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01871146,0.0000784146,0.9620082,0.00001016576,0.00002768544,0.00009106292,4.746702e-7,0.0002625985,0.01880996],"genre_scores_gemma":[0.4890817,0.000001017953,0.5108456,0.00002074435,0.000005142412,0.000002608989,0.000001247353,0.000002802355,0.00003915008],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6071773,"threshold_uncertainty_score":0.2918484,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01432391065317591,"gpt":0.2790448373949305,"spread":0.2647209267417546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004036553,0.0001705804,0.0002549995,0.0007200969,0.00006115951,0.0001548876,0.0008492308,0.00006700707,0.00001838091],"category_scores_gemma":[0.0001183212,0.0001835973,0.00007653361,0.001677838,0.0001145167,0.001139246,0.0003683381,0.0001998653,0.00003582399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005340769,"about_ca_system_score_gemma":0.0001179424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001022134,"about_ca_topic_score_gemma":0.000001740157,"domain_scores_codex":[0.9982661,0.0000316614,0.0005522616,0.0003983047,0.0004700087,0.0002816359],"domain_scores_gemma":[0.9989836,0.0001840335,0.0002178648,0.000253308,0.0002857616,0.00007541601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001548682,0.0008666275,0.01216392,0.0001847641,0.00004411056,0.00003945631,0.0008491864,0.3248916,0.000542224,0.03849591,0.003440769,0.618466],"study_design_scores_gemma":[0.0003446771,0.00008194905,0.01617507,0.0001101315,0.000002987429,0.00002655991,0.000006281743,0.9551926,0.00139733,0.0252842,0.001125373,0.0002528395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08868197,0.0002188232,0.9081303,0.0005493361,0.0001672532,0.0001061745,0.000008531182,0.0003191111,0.001818505],"genre_scores_gemma":[0.5465291,0.000001262607,0.4531101,0.0002023373,0.00006083563,0.000001522144,0.00001426657,0.000008210247,0.00007237624],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6303011,"threshold_uncertainty_score":0.748688,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0506781376865385,"gpt":0.2940815072604516,"spread":0.2434033695739131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001272719,0.0000504196,0.00004948365,0.00003975308,0.00003416519,0.0002603519,0.0001244158,0.00002960202,0.00003277619],"category_scores_gemma":[0.000151926,0.00004226606,0.00001226194,0.0001604022,0.00003187466,0.0009059671,0.00006049973,0.00003860964,0.00003417739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007104307,"about_ca_system_score_gemma":0.00000847928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003005058,"about_ca_topic_score_gemma":2.844333e-7,"domain_scores_codex":[0.9994856,0.0000291164,0.00008333124,0.000228222,0.00008430114,0.00008948149],"domain_scores_gemma":[0.9997188,0.00003253475,0.00002646262,0.0001420426,0.00004584892,0.00003427145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001385577,0.00004817081,0.0004798873,0.000005443666,0.000002067683,0.00003183099,0.00005040715,1.441412e-7,0.005417125,0.03141432,0.001868658,0.9606805],"study_design_scores_gemma":[0.0002513195,0.0001649618,0.002254628,0.00002636186,0.00000359843,0.000529234,0.000023848,0.01233516,0.2560565,0.7259377,0.002113429,0.0003031623],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05643737,0.00004558743,0.8377914,0.0003348122,0.0000385552,0.00007118685,2.187803e-7,0.0005676806,0.1047132],"genre_scores_gemma":[0.5794643,0.00001223914,0.4199071,0.0003544662,0.000004145712,0.000007887775,0.000001247896,0.000002218286,0.0002464342],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9603774,"threshold_uncertainty_score":0.2510579,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007065804377029443,"gpt":0.2646758480864806,"spread":0.2576100437094512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001620525,0.0001915288,0.0001644796,0.0002030262,0.0006684861,0.001597164,0.003397844,0.00004198635,0.000001930641],"category_scores_gemma":[0.00007861458,0.0001202185,0.00003879813,0.001350729,0.005098592,0.002411642,0.002195514,0.0002348707,0.00001958667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006017593,"about_ca_system_score_gemma":0.00007440228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004893996,"about_ca_topic_score_gemma":0.00000242173,"domain_scores_codex":[0.9977995,0.00006703306,0.0002960855,0.0007026036,0.0005339862,0.000600779],"domain_scores_gemma":[0.9982366,0.0004410367,0.0000711511,0.0009550712,0.00008990399,0.0002062612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001780047,0.00001565052,0.00008175388,0.000002808643,9.88981e-7,0.000001210619,0.0001310232,0.000006384033,0.00007784468,0.8124871,0.000009617469,0.1871839],"study_design_scores_gemma":[0.00008558894,0.00005271978,0.001150263,0.00002193195,0.000001709322,0.00001794265,0.000005924896,0.216574,0.00244959,0.778554,0.0008951566,0.0001912395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0087128,0.0002617663,0.9807702,0.006490401,0.00005645096,0.0002637258,0.000001588873,0.0003234749,0.003119551],"genre_scores_gemma":[0.8412785,0.00002060783,0.1580373,0.000493356,0.00008665567,0.00003447965,4.188701e-7,0.000008247856,0.00004044153],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8325657,"threshold_uncertainty_score":0.9994393,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01542386974479558,"gpt":0.2578590586946326,"spread":0.242435188949837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008920528,0.000116398,0.0001356036,0.0003090595,0.00007590848,0.0002500981,0.0003448518,0.00003693877,0.000003031693],"category_scores_gemma":[0.00002041725,0.0001038386,0.00007806678,0.0006660651,0.0001736742,0.0004956321,0.00008407146,0.00005564125,0.000002150748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004684289,"about_ca_system_score_gemma":0.00001697658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000039197,"about_ca_topic_score_gemma":0.000001522968,"domain_scores_codex":[0.9991758,0.00002879905,0.0001958688,0.0002768689,0.0001705644,0.0001521208],"domain_scores_gemma":[0.9993294,0.0001380701,0.00009034323,0.0003176591,0.00008212899,0.00004238774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000297312,0.0004248404,0.001986848,0.00005190447,0.00003244585,0.00002465992,0.0001679172,0.00008294693,0.03488446,0.8996288,0.01643469,0.04625079],"study_design_scores_gemma":[0.0002896808,0.000563366,0.002095368,0.00009910189,0.00001385801,0.00001080874,0.00003721486,0.002740899,0.1296636,0.863158,0.0009913045,0.0003367809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02005277,0.0001479449,0.9588913,0.0001843403,0.00002555161,0.0001143415,0.000009324671,0.0003015986,0.02027282],"genre_scores_gemma":[0.8750825,0.00001210183,0.1247142,0.0001241485,0.00000772098,0.00001761229,0.000005396487,0.000007433409,0.00002888851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8550297,"threshold_uncertainty_score":0.4234416,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04651991246557205,"gpt":0.2835398940265273,"spread":0.2370199815609552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004769516,0.0004068416,0.0006301978,0.0005212661,0.0000820552,0.001573884,0.001071572,0.0002438569,0.000003346172],"category_scores_gemma":[0.0000659553,0.0003830316,0.0001086908,0.0002730559,0.0003727636,0.001660138,0.000792847,0.000209445,0.000003962563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007349574,"about_ca_system_score_gemma":0.0008189704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003096064,"about_ca_topic_score_gemma":0.000001351066,"domain_scores_codex":[0.9977114,0.00001198612,0.0005842913,0.0007861836,0.0005908514,0.0003152399],"domain_scores_gemma":[0.9974284,0.0003773191,0.0004950668,0.0004364983,0.001123033,0.0001396497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002279045,0.0001233711,0.000007482955,0.001520813,0.00007972345,0.000004483857,0.0002329517,0.00001789723,0.00002604393,0.3456708,0.2021297,0.450164],"study_design_scores_gemma":[0.0006664382,0.0002205786,0.00005097659,0.00039154,0.00003941643,0.00004097428,0.0000042699,0.06024508,0.0002712976,0.882809,0.05444458,0.0008158683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000005888995,0.0002333086,0.9178274,0.0001057493,0.00006216934,0.0006486333,0.00006978773,0.0005161571,0.08053093],"genre_scores_gemma":[0.0008214,0.000005948441,0.9854914,0.0005051021,0.0001134327,0.00006153729,0.0002005451,0.000057741,0.01274292],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5371382,"threshold_uncertainty_score":0.9998621,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02584135129234401,"gpt":0.3153706224222706,"spread":0.2895292711299266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001024468,0.0002131187,0.0003527025,0.001277599,0.00002811467,0.0001290737,0.001127408,0.0001718778,0.000003522902],"category_scores_gemma":[0.0003514542,0.0002133391,0.0001337797,0.003860524,0.00004480666,0.0004469215,0.0004508193,0.000139315,0.000002092507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000717721,"about_ca_system_score_gemma":0.0000158835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003154121,"about_ca_topic_score_gemma":6.91581e-8,"domain_scores_codex":[0.9982323,0.00005092207,0.0005514472,0.0004635225,0.0002920836,0.0004097069],"domain_scores_gemma":[0.9987467,0.0003982855,0.0001324359,0.0004663168,0.000116939,0.0001393376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.516661e-7,0.0001562973,0.000003344068,0.0001587807,0.00001503164,0.000004614693,0.00009457729,0.00006264829,0.03959028,0.01115382,0.0002131262,0.9485465],"study_design_scores_gemma":[0.0002569999,0.000181248,0.00001243446,0.0001139728,0.000005182559,0.00001163921,8.735585e-7,0.9689055,0.01961957,0.004438987,0.00623215,0.0002214336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001528799,0.0005558345,0.9976352,0.000134408,0.0007831445,0.00024811,0.000004788499,0.0004655277,0.00002013291],"genre_scores_gemma":[0.02513341,0.00003236805,0.9746008,0.00005907573,0.0000816878,0.00004350612,0.000008171767,0.00002752622,0.00001349597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9688429,"threshold_uncertainty_score":0.8699716,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Representation (politics); Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.05841028313042421,"gpt":0.3295015704646524,"spread":0.2710912873342282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001522598,0.00006231473,0.00006681096,0.00006063784,0.00005619797,0.0003659963,0.0002948169,0.00002369396,0.00002024597],"category_scores_gemma":[0.0001054711,0.00005792045,0.00002849869,0.0003735919,0.00003625069,0.001537948,0.00007938345,0.0000384898,0.00001243561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001540827,"about_ca_system_score_gemma":0.00004590873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001412498,"about_ca_topic_score_gemma":0.000001109974,"domain_scores_codex":[0.999362,0.00003229769,0.0001122383,0.0002283005,0.0001378553,0.0001273382],"domain_scores_gemma":[0.9995094,0.00002958422,0.00004446369,0.0002995978,0.00007704325,0.00003994292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000001425438,0.0001079259,0.005021629,0.00002597435,0.000008663374,0.00002408498,0.0001868999,0.00001300939,0.02126065,0.8475336,0.001318393,0.1244977],"study_design_scores_gemma":[0.0001787655,0.00003809197,0.0004539695,0.00006154727,0.000004211845,0.00007517491,0.00001916311,0.1058817,0.4617888,0.4307442,0.0004407809,0.0003136482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01794848,0.00003215898,0.9017986,0.00004481454,0.0000623704,0.00007758291,1.228433e-7,0.0005833442,0.07945254],"genre_scores_gemma":[0.5652409,0.000001146498,0.4344365,0.0001838187,0.000002188595,0.000002486628,1.942722e-7,0.000003013899,0.000129687],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5472925,"threshold_uncertainty_score":0.3529311,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01818290402632325,"gpt":0.2840745121671717,"spread":0.2658916081408484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006306958,0.00007937564,0.0001654284,0.0003136745,0.00005957214,0.0002445874,0.003922811,0.00001697788,0.000001563547],"category_scores_gemma":[0.0001379617,0.00005231437,0.0001144996,0.0005198226,0.0008032223,0.002396908,0.0005823314,0.00007956548,4.681893e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005152686,"about_ca_system_score_gemma":0.0006086025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003720118,"about_ca_topic_score_gemma":0.000003046769,"domain_scores_codex":[0.9978901,0.00003051659,0.00068368,0.0001304885,0.001160476,0.0001047835],"domain_scores_gemma":[0.9956515,0.00005320282,0.001115932,0.0003074177,0.002843344,0.00002864827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006391353,0.001217912,0.01119862,0.0001164561,0.0001667296,0.00001645362,0.002212731,0.006343548,0.3667527,0.3645996,0.001700421,0.2456108],"study_design_scores_gemma":[0.0005630734,0.0002927724,0.03401039,0.00115949,0.00001582424,0.0002501456,0.00002157837,0.08701527,0.7987954,0.07712934,0.0005426535,0.0002040379],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1502232,0.00007353654,0.8468707,0.001294469,0.0007099672,0.00006235792,0.000003870074,0.00001339724,0.0007485315],"genre_scores_gemma":[0.8191519,0.000003158491,0.1807438,0.00003545043,0.00004359819,6.802622e-7,1.845906e-7,0.00000235898,0.0000189492],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6689286,"threshold_uncertainty_score":0.7289624,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01005755423160053,"gpt":0.25722725958762,"spread":0.2471697053560195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003173054,0.0001923439,0.000301993,0.0002764996,0.00004929525,0.0002047881,0.000549631,0.00007002309,0.000008822605],"category_scores_gemma":[0.00003434124,0.0001770098,0.00008103629,0.0006449766,0.000155567,0.001060707,0.0002555855,0.0001376944,0.00001535526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003473924,"about_ca_system_score_gemma":0.00003404595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001240162,"about_ca_topic_score_gemma":0.00001808554,"domain_scores_codex":[0.9986517,0.000009773127,0.0005297221,0.0003264444,0.0001932357,0.0002891688],"domain_scores_gemma":[0.9988952,0.00006631327,0.0002575356,0.0006542827,0.00006096996,0.00006570124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001602359,0.0004354513,0.00005722242,0.0008199188,0.00004469533,0.0001982457,0.004952224,0.00004635677,0.05292772,0.6550187,0.0004481064,0.2850354],"study_design_scores_gemma":[0.0007635754,0.00008605044,0.00002080264,0.0003977818,0.00003058713,0.001683373,0.0009048255,0.1477621,0.3078284,0.5395028,0.000238098,0.0007816585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03991332,0.00004563555,0.899721,0.0001475633,0.00002933739,0.0003392065,0.000007844941,0.0003586051,0.0594375],"genre_scores_gemma":[0.4087465,0.000004900901,0.5911287,0.00002439328,0.00001149897,0.0000389646,0.000001460205,0.00001318063,0.00003045226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3688332,"threshold_uncertainty_score":0.7218251,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01166565185683686,"gpt":0.2427690775612038,"spread":0.2311034257043669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004416224,0.000158208,0.000107879,0.00005330792,0.0003186398,0.001097079,0.001140502,0.00005257947,0.00000344955],"category_scores_gemma":[0.0001718626,0.0001046865,0.00005218593,0.0003391116,0.00008054533,0.0006663977,0.0001632841,0.0001881341,0.0001260615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003938939,"about_ca_system_score_gemma":0.0000739415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003856532,"about_ca_topic_score_gemma":0.000004828837,"domain_scores_codex":[0.9987061,0.00005456925,0.0001958153,0.0003564351,0.0003293447,0.0003577234],"domain_scores_gemma":[0.9988909,0.0001676697,0.00008693725,0.0006870552,0.0000996966,0.00006768888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004288646,0.0001153391,0.0001306567,0.00001737572,0.00001404242,0.0000178343,0.0002885035,0.00002501555,0.001113615,0.6829097,0.01263174,0.3027319],"study_design_scores_gemma":[0.0004031108,0.000337155,0.000200859,0.0002300439,0.000009077625,0.00005967144,0.00004911787,0.004075135,0.1398754,0.5155787,0.3384613,0.0007204009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.004279665,0.001465622,0.427404,0.003889838,0.0007660778,0.0004998812,0.000002250509,0.002587052,0.5591056],"genre_scores_gemma":[0.7364388,0.00005477226,0.2584641,0.001158021,0.00006928897,0.00007008435,9.524745e-7,0.00003096676,0.003713126],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7321591,"threshold_uncertainty_score":0.9999399,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01660863708907274,"gpt":0.2659872466039845,"spread":0.2493786095149118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000559739,0.0004358615,0.0004814274,0.0008273284,0.0001027582,0.0006170961,0.002716553,0.0002425682,0.000002784426],"category_scores_gemma":[0.0001743954,0.0003834096,0.00007419981,0.0004810248,0.0009935946,0.001002781,0.001558364,0.0005616801,0.00001020618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000147815,"about_ca_system_score_gemma":0.0003308789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000787917,"about_ca_topic_score_gemma":0.00001623388,"domain_scores_codex":[0.9969307,0.00001623364,0.0004822277,0.001295297,0.0008460601,0.0004295075],"domain_scores_gemma":[0.9976535,0.0003861004,0.0003271339,0.001266487,0.0002412263,0.0001255031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007551013,0.00002588217,0.000006449556,0.00003936033,0.000003062837,0.00003658178,0.0003481779,0.0004684886,0.0004365717,0.02098335,0.00003652848,0.977608],"study_design_scores_gemma":[0.0004667913,0.0008413356,0.0001027902,0.002461004,0.00001040636,0.0001801022,8.916282e-8,0.3025942,0.05421184,0.6328221,0.005013787,0.001295484],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006971751,0.0003186625,0.9804028,0.001012196,0.0002758548,0.0002307871,0.000005226565,0.0002390857,0.0174457],"genre_scores_gemma":[0.1501179,0.00005222731,0.8476474,0.001500127,0.0001734974,0.000004834743,0.000001575017,0.00003023698,0.0004721687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9763125,"threshold_uncertainty_score":0.9998618,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1053539448644674,"gpt":0.3424969503739186,"spread":0.2371430055094512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008337729,0.0000707596,0.00009359349,0.00005963801,0.00002808148,0.0001960438,0.0005930505,0.00002855743,0.0001189273],"category_scores_gemma":[0.0001009377,0.0000612505,0.00002477146,0.0001975993,0.0000278433,0.001895453,0.0001468439,0.0000482453,0.00002986231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002953601,"about_ca_system_score_gemma":0.00002283892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006053454,"about_ca_topic_score_gemma":0.000002559283,"domain_scores_codex":[0.9987642,0.00006614075,0.0001808102,0.0002355794,0.0006515294,0.0001017097],"domain_scores_gemma":[0.9990595,0.00002478009,0.00008174124,0.0004295908,0.0003652331,0.0000391451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[1.474008e-7,0.00006817447,0.00001914502,0.000001937208,0.000004656375,8.693004e-7,0.0005457182,0.00001135546,0.0009742305,0.002944637,0.0006681308,0.994761],"study_design_scores_gemma":[0.0000857054,0.0000445482,0.0001925657,0.00002336431,0.000008379619,0.000001999057,0.000008680729,0.8455234,0.041769,0.1121086,0.0001518326,0.00008192012],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003905527,0.0003325361,0.9424729,0.0005665242,0.0000600279,0.00009067236,9.41768e-7,0.000495811,0.05207499],"genre_scores_gemma":[0.4561425,0.000003675821,0.5434693,0.000279393,0.00001600716,0.000006686196,0.000001192329,0.000004298583,0.00007699674],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9946791,"threshold_uncertainty_score":0.2497723,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01252798965915144,"gpt":0.2463268695536741,"spread":0.2337988798945227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005444628,0.0001032088,0.0001298839,0.0001320192,0.00008431422,0.000559733,0.0007349932,0.00003218458,0.000003308238],"category_scores_gemma":[0.0002578037,0.00008032112,0.00002377611,0.0005433405,0.0000901305,0.005294007,0.0001392042,0.0001193737,0.0000706769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002770944,"about_ca_system_score_gemma":0.00003325659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001323752,"about_ca_topic_score_gemma":1.574627e-7,"domain_scores_codex":[0.9989433,0.00003979509,0.0004530422,0.0001023293,0.0002860363,0.0001755074],"domain_scores_gemma":[0.9991484,0.00008253626,0.0003509341,0.0002474111,0.0001459327,0.00002482522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002483956,0.0001284281,0.00721636,0.0007848871,0.00001731866,0.000002574156,0.01018954,0.005872667,0.01703966,0.005792264,0.004108645,0.9488228],"study_design_scores_gemma":[0.0002201815,0.000006844567,0.001592723,0.0001879342,0.000001673607,0.00001556525,0.000007298293,0.9914079,0.004080081,0.001802611,0.0005528379,0.0001243204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1553191,0.000003177961,0.8384771,0.002391842,0.00005231947,0.0000945037,6.751312e-7,0.0002884754,0.003372791],"genre_scores_gemma":[0.7796389,6.697447e-8,0.217901,0.002419647,0.00001217039,0.000009624698,0.000007973747,0.000004398406,0.000006159401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9855353,"threshold_uncertainty_score":0.5397518,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02054997366559403,"gpt":0.3258167522426751,"spread":0.3052667785770811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125418,0.00008330238,0.0001017223,0.0001226,0.00009023047,0.0006504205,0.0009907034,0.00001796034,6.766501e-7],"category_scores_gemma":[0.0000812604,0.00005662344,0.0001008191,0.000149286,0.0001112303,0.001219796,0.00007447008,0.0001408709,2.999262e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001507796,"about_ca_system_score_gemma":0.00003585834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000041601,"about_ca_topic_score_gemma":0.000004397868,"domain_scores_codex":[0.9991407,0.00001372407,0.0002998841,0.0001071422,0.00031968,0.0001188779],"domain_scores_gemma":[0.9987775,0.0001629899,0.0002190292,0.00009827918,0.000696902,0.00004527441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000536722,0.000109995,0.0007815189,0.00001326389,0.0001158705,0.0001757003,0.0008137858,0.00000821635,0.0006429751,0.1093831,0.00179975,0.8861021],"study_design_scores_gemma":[0.002298,0.0004101577,0.001887267,0.0003987179,0.00004014333,0.003930305,0.000160357,0.1216743,0.008952891,0.7681323,0.09166535,0.0004502146],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002914273,0.0003302123,0.9858314,0.009484292,0.0002719336,0.00006027344,0.000004161856,0.00003170108,0.001071734],"genre_scores_gemma":[0.7440054,0.0003208435,0.2539976,0.001366255,0.0002456833,0.000001709349,0.000001106357,0.000008187109,0.00005319796],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8856519,"threshold_uncertainty_score":0.627202,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01580827587581085,"gpt":0.2510631705474998,"spread":0.2352548946716889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005283387,0.0002038095,0.0001435042,0.000118069,0.0002348148,0.0009424022,0.002353535,0.00007214585,0.00001084659],"category_scores_gemma":[0.00004135104,0.0001482271,0.00007122848,0.0005733738,0.0001439539,0.001982357,0.0002273847,0.0002394631,0.0000910011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005153412,"about_ca_system_score_gemma":0.000103925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001188567,"about_ca_topic_score_gemma":0.000004902044,"domain_scores_codex":[0.9983382,0.00009445711,0.0002410906,0.0004854678,0.0004699352,0.0003708434],"domain_scores_gemma":[0.9985467,0.00007058244,0.0001211716,0.001002637,0.0001463779,0.0001125698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002750177,0.0002018183,0.0001054138,0.000004939864,0.000007482845,0.0000137485,0.0001720095,0.00001047259,0.001573081,0.9450439,0.001805212,0.05105913],"study_design_scores_gemma":[0.0001788933,0.0002555424,0.0002909867,0.00005220652,0.000004749474,0.00002207362,0.00001061468,0.004810584,0.01813384,0.9733248,0.002644001,0.0002717135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.628328,0.0006392507,0.1432483,0.03694436,0.002853915,0.002022993,0.000008391314,0.008428974,0.1775258],"genre_scores_gemma":[0.9532264,0.000007376703,0.04542916,0.00109472,0.00001570981,0.0000428359,0.000001600836,0.00001810336,0.0001640578],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3248984,"threshold_uncertainty_score":0.9087607,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Completeness (order theory); Pencil (optics); Mathematics; Mathematics education; Statistics; Mathematical analysis; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03200131547370069,"gpt":0.295824030478002,"spread":0.2638227150043014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007796759,0.000172832,0.0003080182,0.00008606014,0.00005945069,0.0001510301,0.0007267585,0.00004545953,0.00002462921],"category_scores_gemma":[0.0002777492,0.0001464837,0.00004454399,0.0002548127,0.000219908,0.001334652,0.0004534431,0.00008382178,0.00003995322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002345253,"about_ca_system_score_gemma":0.00004814474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001554806,"about_ca_topic_score_gemma":0.000001218056,"domain_scores_codex":[0.9986219,0.00003876789,0.0003844581,0.0002484362,0.0003568512,0.0003495363],"domain_scores_gemma":[0.9987254,0.000183775,0.000150755,0.0006894232,0.0001242885,0.000126403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001048985,0.001040472,0.002398189,0.001877923,0.00006332539,0.000008681106,0.007734449,6.337575e-7,0.00520073,0.9040716,0.00347095,0.07412261],"study_design_scores_gemma":[0.000839192,0.0001838861,0.004404109,0.0008049515,0.00007345901,0.0003900223,0.0004826457,0.02368269,0.0490087,0.9144102,0.00467167,0.001048503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1379586,0.003287244,0.7644253,0.0004484354,0.0002049074,0.0005733529,0.00002904836,0.001040417,0.09203273],"genre_scores_gemma":[0.7640859,0.000006239585,0.2356432,0.00009530663,0.00001894698,0.00001951973,0.000001285378,0.00001167055,0.0001178543],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6261274,"threshold_uncertainty_score":0.5973433,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03504592307181569,"gpt":0.3151139292849893,"spread":0.2800680062131736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004348234,0.0002651884,0.0002340768,0.0001827456,0.0002104044,0.001189337,0.0007330422,0.0001224721,0.00005183186],"category_scores_gemma":[0.0001892592,0.0002281283,0.00007028443,0.0001302782,0.0001583152,0.001034919,0.00008115385,0.0002459739,0.000007827693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006294607,"about_ca_system_score_gemma":0.0001427817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005359738,"about_ca_topic_score_gemma":0.000001565822,"domain_scores_codex":[0.9982092,0.00002984263,0.0003754606,0.0005979705,0.0004659333,0.0003216235],"domain_scores_gemma":[0.9989075,0.0001178777,0.0001593261,0.0001673716,0.0005166837,0.0001312435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007040913,0.0002510158,0.00004525347,0.00008845064,0.00001768753,0.00006250589,0.0001673526,0.00003316851,0.03547152,0.09490722,0.000448438,0.868437],"study_design_scores_gemma":[0.0008264738,0.0006903293,0.00007700418,0.0003553496,0.00001845711,0.0002359095,0.00006989265,0.5706251,0.03533043,0.3888443,0.002361219,0.0005655838],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00286362,0.00008687309,0.9678112,0.0015122,0.0001691216,0.0002316916,0.0000212359,0.0002981868,0.02700589],"genre_scores_gemma":[0.781903,0.00004478702,0.2168445,0.0006201536,0.00005676152,0.00002002148,0.00001274411,0.00001581995,0.0004823041],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8678714,"threshold_uncertainty_score":0.9998475,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01965432484113771,"gpt":0.2762746626281617,"spread":0.256620337787024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004471433,0.0002122531,0.0002424331,0.0001873077,0.00005129619,0.0002989773,0.001208633,0.00007243346,0.00001579849],"category_scores_gemma":[0.0002846789,0.0001940772,0.00007623956,0.0005511764,0.000127365,0.0008975192,0.0002514766,0.0002693633,0.00004986075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001454408,"about_ca_system_score_gemma":0.0001671864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000410625,"about_ca_topic_score_gemma":0.00004927232,"domain_scores_codex":[0.9983083,0.00002456127,0.0003906459,0.0003385142,0.0002785222,0.0006594326],"domain_scores_gemma":[0.9988669,0.0002231999,0.0001276876,0.0006704609,0.00004858768,0.00006313998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002749146,0.000200437,0.0001053787,0.00007024292,0.00001808405,0.00001185181,0.0008508584,0.00002851545,0.001398127,0.7981377,0.00015608,0.19902],"study_design_scores_gemma":[0.000371968,0.0001257447,0.00004626869,0.0001491776,0.00000796747,0.00008580123,0.00001855773,0.1094556,0.04821079,0.8398911,0.001159723,0.00047734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008078012,0.0004615842,0.972645,0.00132298,0.00002458459,0.0002084141,0.000001450943,0.0006320454,0.01662587],"genre_scores_gemma":[0.6194386,0.00001849095,0.38026,0.0001295101,0.00001914829,0.00002126443,0.000001381914,0.00001475674,0.00009686079],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6113605,"threshold_uncertainty_score":0.7914238,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Class (philosophy); Combinatorics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01269752918145287,"gpt":0.2608860789319518,"spread":0.2481885497504989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005718507,0.0001319736,0.0001598564,0.00008682792,0.0001433982,0.0002522741,0.001699645,0.00007155659,0.000001886158],"category_scores_gemma":[0.0003347458,0.000100472,0.0001063916,0.0004022502,0.0001693231,0.0006195998,0.0003483572,0.000210964,0.000004544341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009451625,"about_ca_system_score_gemma":0.00005931026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001173204,"about_ca_topic_score_gemma":0.000003809498,"domain_scores_codex":[0.9989533,0.00001635549,0.0002607622,0.000274846,0.000233201,0.0002614695],"domain_scores_gemma":[0.9983016,0.0004540626,0.0001818679,0.000795627,0.0002145741,0.00005232612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002776693,0.00005577823,0.0006157742,0.0000302424,0.00001121098,9.723934e-7,0.0001214404,2.728572e-7,0.007036924,0.966835,0.001727161,0.02356248],"study_design_scores_gemma":[0.0002116228,0.0000849945,0.001010667,0.00002957258,0.000009676921,0.000008779535,0.00001686393,0.004867733,0.06256956,0.9283383,0.002699359,0.0001528819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7593499,0.0005016327,0.2058148,0.003656223,0.007953758,0.001459228,0.00001078562,0.001800899,0.01945274],"genre_scores_gemma":[0.9494259,0.00000368635,0.05026973,0.0001118626,0.000009916793,0.00005541992,6.986165e-7,0.00001539472,0.0001074263],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.190076,"threshold_uncertainty_score":0.4097129,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03567379679215091,"gpt":0.3173730342745842,"spread":0.2816992374824333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038202,0.0002142372,0.0004418008,0.000251098,0.0001932626,0.000610378,0.0004651787,0.00005857682,0.000001428888],"category_scores_gemma":[0.000132236,0.0001956555,0.00007439093,0.0007599238,0.00004765428,0.0009857361,0.0003413918,0.0003243468,0.000002409868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008376699,"about_ca_system_score_gemma":0.00009791791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001211862,"about_ca_topic_score_gemma":0.000008600934,"domain_scores_codex":[0.9979743,0.0001478002,0.0008843451,0.0003106223,0.0003343407,0.0003485482],"domain_scores_gemma":[0.998395,0.0002939374,0.000649986,0.0001761741,0.0003208756,0.0001640188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001528137,0.002496332,0.109869,0.00006880466,0.0001716869,0.1209816,0.008240925,0.06871217,0.000120044,0.0003228599,0.001382648,0.6874811],"study_design_scores_gemma":[0.002230425,0.0007230316,0.007975467,0.0002021575,0.00002293189,0.08068379,0.001994921,0.9024494,0.00001089365,0.003279081,0.00004033453,0.0003875686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4072008,0.00008908363,0.5921039,0.0001050164,0.00008149798,0.0001089682,8.831957e-7,0.00009793911,0.0002118999],"genre_scores_gemma":[0.8089135,0.00001234554,0.1909434,0.00003230052,0.00007426767,0.00000137329,0.000002042422,0.00000870345,0.0000120894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8337373,"threshold_uncertainty_score":0.7978601,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Mathematics; Algorithm; Combinatorics; Discrete mathematics; Time complexity","retraction":null,"screen_n_in":null,"score":{"opus":0.06133415210901777,"gpt":0.3142347807293254,"spread":0.2529006286203077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002643655,0.0002009042,0.0002729119,0.00007407037,0.0002977557,0.0003905511,0.001047148,0.00008249632,0.000004822858],"category_scores_gemma":[0.0002360473,0.000166674,0.0001417659,0.0003703806,0.0002625308,0.0009006389,0.0002598284,0.0001154019,0.00005525727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002123511,"about_ca_system_score_gemma":0.00008977797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002837522,"about_ca_topic_score_gemma":2.28159e-7,"domain_scores_codex":[0.998571,0.00001589049,0.0003564165,0.0003540776,0.0003461486,0.0003564708],"domain_scores_gemma":[0.9988663,0.000195099,0.0001441139,0.0005390732,0.0001484265,0.000107018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006732887,0.002757171,0.000959049,0.004296178,0.0006042578,0.0008065721,0.04492944,0.0002442687,0.03467114,0.5846953,0.04037295,0.2855964],"study_design_scores_gemma":[0.0001685575,0.0001206635,0.00002014624,0.0001245663,0.00001126418,0.0001711333,0.00002383428,0.8051646,0.01072973,0.18152,0.001569302,0.0003761387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004365603,0.00008115479,0.9899154,0.0006724928,0.00005926648,0.0002879383,0.000009491515,0.0008941389,0.003714512],"genre_scores_gemma":[0.05300074,0.000009888888,0.9461126,0.0001734565,0.00004670595,0.00006568755,0.000006672179,0.00002657228,0.0005576813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8049204,"threshold_uncertainty_score":0.6796767,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.016563136386097,"gpt":0.2343997822284719,"spread":0.2178366458423749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001701584,0.000174748,0.0001520127,0.0001736382,0.0001231599,0.0005622668,0.001444617,0.00007226349,0.00002863457],"category_scores_gemma":[0.00009166926,0.0001685489,0.00007539298,0.0006596268,0.00009524399,0.001127834,0.0002388852,0.0001796125,0.0003257691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004103997,"about_ca_system_score_gemma":0.0000235657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000640314,"about_ca_topic_score_gemma":4.831684e-7,"domain_scores_codex":[0.9985912,0.00003842694,0.0001990831,0.0004366139,0.0004101846,0.0003245126],"domain_scores_gemma":[0.99891,0.00006219426,0.00009087341,0.0007191807,0.0001093418,0.0001084067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[9.686802e-7,0.0001519361,0.00005003274,0.000006959141,0.000007648609,0.00005640219,0.00006536642,0.000001669201,0.0003356889,0.9364831,0.01016574,0.05267442],"study_design_scores_gemma":[0.0002199401,0.0001808352,0.00009215088,0.00004557702,0.000003105097,0.00001938938,0.000001492349,0.002924966,0.005944359,0.987599,0.002727131,0.0002420845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1969434,0.001633177,0.2042323,0.008307837,0.008488766,0.0009803204,0.000007098723,0.01021141,0.5691957],"genre_scores_gemma":[0.9712909,0.00002164786,0.02730058,0.0007036912,0.000004582575,0.00001703561,8.169622e-7,0.00001551897,0.0006451541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7743475,"threshold_uncertainty_score":0.6873226,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01246755266857683,"gpt":0.245877789669444,"spread":0.2334102370008672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001921543,0.000479872,0.0007405109,0.00002553549,0.0008419749,0.001095247,0.003730964,0.0001216218,0.000009231977],"category_scores_gemma":[0.002062786,0.0002605774,0.0008405398,0.001101313,0.003961112,0.0005698858,0.002240433,0.0007218175,0.00004681747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001106988,"about_ca_system_score_gemma":0.0001340118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001013522,"about_ca_topic_score_gemma":3.251992e-7,"domain_scores_codex":[0.9964803,0.00004534216,0.0007253428,0.0006665113,0.001287788,0.0007946482],"domain_scores_gemma":[0.995733,0.001436601,0.001328928,0.0006371032,0.000664003,0.0002003355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006507672,0.0008071762,0.0008594893,0.001624144,0.0005309355,8.774388e-7,0.006182283,0.000009736706,0.0200242,0.6823747,0.1292229,0.1582985],"study_design_scores_gemma":[0.0003665786,0.0006328744,0.0008865541,0.0009084388,0.0001832876,0.0001430711,0.000629155,0.1295943,0.0281064,0.8274179,0.01032929,0.0008022578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6199631,0.001195177,0.1555162,0.101625,0.0009870172,0.0033597,0.00003040555,0.002165973,0.1151574],"genre_scores_gemma":[0.8658566,0.00005578293,0.1304937,0.00193428,0.0001767667,0.00004698796,2.457872e-7,0.00005837527,0.001377311],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2458934,"threshold_uncertainty_score":0.9999846,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01458568626241752,"gpt":0.253904538952752,"spread":0.2393188526903345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009724428,0.0000574136,0.00006062009,0.00007078177,0.00001774119,0.0001326679,0.0002125258,0.00002024597,0.000008743249],"category_scores_gemma":[0.00007167664,0.0000484001,0.00002061179,0.0002652838,0.00001859998,0.003504583,0.00008611174,0.0000332045,0.00001251567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000017319,"about_ca_system_score_gemma":0.00001567463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002743522,"about_ca_topic_score_gemma":1.165408e-7,"domain_scores_codex":[0.9995274,0.000007382865,0.000113097,0.0000991515,0.0001395078,0.0001134696],"domain_scores_gemma":[0.9996647,0.00002117502,0.00005795352,0.0001403926,0.00008048918,0.00003531194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000223224,0.002091214,0.009537138,0.0003959503,0.00004178094,0.000001252117,0.0009023155,0.003144681,0.002390195,0.295931,0.04739726,0.6381449],"study_design_scores_gemma":[0.0002910909,0.0007471638,0.001630998,0.0006045872,0.000009594428,0.00005398966,0.0000194749,0.363614,0.6094484,0.02073041,0.00214403,0.0007062133],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003470485,0.00004477096,0.9211536,0.000237284,0.00004579027,0.00005326622,4.306719e-7,0.0004055463,0.07771223],"genre_scores_gemma":[0.7793195,0.000006858937,0.2201073,0.0002354847,0.0000136723,0.000003709162,0.000001961405,0.000004264707,0.0003072496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7789724,"threshold_uncertainty_score":0.2540738,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.05366047059780225,"gpt":0.3014340498397006,"spread":0.2477735792418984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001256451,0.00006879229,0.000154962,0.0001191012,0.00001730861,0.00009606124,0.0004706724,0.00002425643,0.0000221272],"category_scores_gemma":[0.00014478,0.00006281063,0.00003461166,0.0003935983,0.00008565884,0.0007468204,0.0001073886,0.00003622564,0.000004000541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001015798,"about_ca_system_score_gemma":0.00001411413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003542224,"about_ca_topic_score_gemma":0.000001042748,"domain_scores_codex":[0.9992303,0.00002518774,0.0002390266,0.0001854133,0.0002150336,0.0001050988],"domain_scores_gemma":[0.9991409,0.0001110654,0.0001532106,0.0003491305,0.000218326,0.00002742086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001557786,0.001421768,0.004912708,0.0006110675,0.00004637355,0.00004038899,0.0008354673,0.00003901953,0.3120309,0.07713237,0.01273865,0.5901757],"study_design_scores_gemma":[0.0002401845,0.00005581297,0.0002525281,0.00007360856,0.000003743661,0.000002990269,0.00001101479,0.1927515,0.8027166,0.003801067,0.00001536519,0.00007558201],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003457383,0.00007810853,0.9641854,0.0003677687,0.00002325236,0.00008300559,0.000002093174,0.000203802,0.03159922],"genre_scores_gemma":[0.6690819,0.000003863394,0.3304863,0.00005921042,0.000002975074,0.000003780047,3.417618e-7,0.000003375033,0.0003583227],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6656245,"threshold_uncertainty_score":0.2561343,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Square (algebra); Mathematics; Combinatorics; Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02192587794218105,"gpt":0.2611460789304941,"spread":0.239220200988313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001176016,0.0001554976,0.000204765,0.0001606403,0.0001784124,0.0004460282,0.002621674,0.00004438899,0.000007187116],"category_scores_gemma":[0.00006667334,0.0001169261,0.00005336927,0.0009107905,0.003167966,0.002871721,0.001566937,0.000119813,0.00003157563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003824004,"about_ca_system_score_gemma":0.0001174944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002708541,"about_ca_topic_score_gemma":2.943119e-8,"domain_scores_codex":[0.9980243,0.00004007603,0.0002691142,0.0003635183,0.0007283728,0.0005745461],"domain_scores_gemma":[0.9986241,0.00005064462,0.00008890665,0.0007082957,0.0003020859,0.0002259162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000009982034,0.0001453268,0.0001297828,0.00002395179,0.000001753088,7.338199e-7,0.0004959198,0.000001588455,0.004340868,0.9795617,0.00003554987,0.01525279],"study_design_scores_gemma":[0.0003162482,0.0002054978,0.000256364,0.0001244429,0.000004102367,0.00002913816,0.000007008331,0.03027565,0.6906605,0.2776846,0.0001516468,0.0002847971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07068914,0.0001628839,0.9160933,0.0002595933,0.0009791767,0.0001671384,5.395441e-7,0.0004879276,0.01116027],"genre_scores_gemma":[0.8794613,0.000001120246,0.120318,0.00008990987,0.0001102968,0.000007882544,1.493821e-7,0.000006878033,0.000004453842],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8087721,"threshold_uncertainty_score":0.9995449,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01860634326029394,"gpt":0.2641260744594521,"spread":0.2455197311991582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001734767,0.0002010362,0.0003982458,0.0001076105,0.00008830035,0.0002779385,0.0009242119,0.00005773121,0.000002205029],"category_scores_gemma":[0.00007571791,0.0001629685,0.0001555021,0.0001556445,0.0002552528,0.0005519558,0.00009931587,0.0002972839,6.124213e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001102453,"about_ca_system_score_gemma":0.0001658693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007252675,"about_ca_topic_score_gemma":0.000006649489,"domain_scores_codex":[0.9987781,0.00003047714,0.0004348851,0.0002007351,0.0003290065,0.0002267734],"domain_scores_gemma":[0.9977689,0.0002016142,0.0006201291,0.000313463,0.001003883,0.00009197945],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007175751,0.0002816324,0.00002986683,0.00005057257,0.00004466121,0.0000147126,0.0006703014,0.00007856319,0.1972942,0.01556293,0.0001015632,0.7857992],"study_design_scores_gemma":[0.0003461558,0.0007206351,0.00008291971,0.0001376928,0.00001560363,0.00008130966,0.00003526051,0.01215657,0.8424895,0.1435735,0.0001841159,0.0001766693],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03044502,0.00005507758,0.9685755,0.0002779828,0.0002203645,0.0001230359,0.00002946965,0.00007325919,0.0002002624],"genre_scores_gemma":[0.5541748,0.00001234066,0.4456611,0.00004147657,0.00007420622,0.00000568821,0.000001689479,0.000009975469,0.00001879436],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7856225,"threshold_uncertainty_score":0.6645665,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01742911554957724,"gpt":0.3170267182583194,"spread":0.2995976027087421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005160326,0.00009135071,0.0002542928,0.0002527077,0.000009334585,0.00009311898,0.0005884967,0.00002639664,0.000002534817],"category_scores_gemma":[0.0001091081,0.00007796209,0.00005897344,0.0003220612,0.00007532227,0.001578751,0.0001158351,0.00009769374,0.000001818826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005571861,"about_ca_system_score_gemma":0.0002157486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001937265,"about_ca_topic_score_gemma":0.000001216503,"domain_scores_codex":[0.9988774,0.00005013547,0.0005942392,0.00009985323,0.0002536905,0.0001246782],"domain_scores_gemma":[0.9986742,0.00004165788,0.0006724534,0.0001714489,0.0003856928,0.00005458144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002491883,0.0001334664,0.001477087,0.00004740888,0.00001088552,0.00002238455,0.0004845588,0.00001752062,0.9866433,0.00001997646,0.006539691,0.004578876],"study_design_scores_gemma":[0.0005089135,0.0002576252,0.001248454,0.0002802377,0.000005352359,0.0001068417,0.00006420122,0.0002700857,0.9953764,0.001684269,0.0001282904,0.00006933474],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.941578,0.001287739,0.05581182,0.0003788803,0.0001733913,0.00009181597,0.000006133773,0.00008786296,0.0005843047],"genre_scores_gemma":[0.6131176,0.00002137869,0.386766,0.00005324947,0.000009245315,5.658297e-7,4.401937e-7,0.000005848696,0.00002565527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3309542,"threshold_uncertainty_score":0.3179202,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009260047484923319,"gpt":0.2214877604574504,"spread":0.2122277129725271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004853975,0.0001107453,0.000275969,0.0002121769,0.00006080108,0.00009434373,0.0008625199,0.00005586138,0.00001062173],"category_scores_gemma":[0.0001938655,0.00009615827,0.0001171295,0.0004350566,0.0001143422,0.002945482,0.00009824306,0.0001399154,0.00000152424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002090706,"about_ca_system_score_gemma":0.0002652356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.290564e-7,"about_ca_topic_score_gemma":2.403877e-8,"domain_scores_codex":[0.9988432,0.000087864,0.0004820723,0.00009628303,0.0003628934,0.0001276737],"domain_scores_gemma":[0.9985344,0.00006446752,0.0006556343,0.0002480146,0.000406877,0.00009063035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002134972,0.0001001811,0.0001891001,0.00001927056,0.0000305889,0.00004574695,0.0006411534,4.014562e-7,0.07129585,0.9182438,0.0004459903,0.008774377],"study_design_scores_gemma":[0.0003804969,0.000824128,0.0005636515,0.00009009508,0.000008563912,0.0005108757,0.00001070057,0.000007975325,0.1772395,0.8175728,0.002676442,0.0001147736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2047607,0.0001803507,0.7868379,0.0004216042,0.003768101,0.0001030749,0.000001690993,0.0001506971,0.003775915],"genre_scores_gemma":[0.9720978,0.00008458432,0.02722057,0.00004277276,0.0002379977,7.3686e-7,4.898422e-7,0.00001097822,0.0003041256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.767337,"threshold_uncertainty_score":0.3921221,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005901363129197902,"gpt":0.2212384894735892,"spread":0.2153371263443913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000228378,0.00008759797,0.0000968942,0.00002253415,0.0002588776,0.0002455073,0.0005213456,0.0000221246,0.000001635348],"category_scores_gemma":[0.00004674711,0.0000406428,0.00002459165,0.0002498054,0.0002574662,0.0001561594,0.0001402129,0.0000914802,0.000006406797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004062257,"about_ca_system_score_gemma":0.00001426393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001952528,"about_ca_topic_score_gemma":0.000005716687,"domain_scores_codex":[0.9994297,0.00003599337,0.0001391082,0.0001769264,0.000116225,0.0001020237],"domain_scores_gemma":[0.998887,0.0005306204,0.0001271676,0.0003844538,0.00005149101,0.00001925125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001093232,0.00003206276,0.00003334874,0.00001466687,0.000005383319,1.517983e-7,0.0001667877,7.718166e-7,0.0003908061,0.9896473,0.002441584,0.00725622],"study_design_scores_gemma":[0.001982655,0.0002083047,0.01746919,0.0002120837,0.0001488259,0.00006392283,0.0002388105,0.08882574,0.02917483,0.5411942,0.3195541,0.0009273147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1063705,0.005734044,0.7728561,0.09875428,0.00007453407,0.002183239,0.00007757358,0.0003904379,0.01355937],"genre_scores_gemma":[0.9965285,0.0001362446,0.002075717,0.0004442493,0.00007130699,0.0001475935,0.000002290476,0.000006899734,0.0005872219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.890158,"threshold_uncertainty_score":0.2367433,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01670461533410773,"gpt":0.2694357382297246,"spread":0.2527311228956168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002679113,0.0001798913,0.0002039413,0.0004027466,0.0001436964,0.0003746369,0.001184554,0.00006587282,0.0000026211],"category_scores_gemma":[0.00003406373,0.0001868462,0.00009928441,0.000907317,0.0002591049,0.001347047,0.0007795418,0.0001345806,0.00002050902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002752447,"about_ca_system_score_gemma":0.00009676286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007007458,"about_ca_topic_score_gemma":0.00000126108,"domain_scores_codex":[0.9984174,0.00003131737,0.0003838535,0.0004331693,0.000410845,0.0003233989],"domain_scores_gemma":[0.9983708,0.00006988911,0.0002366614,0.0005212375,0.0007197954,0.00008158576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000554302,0.0001420353,0.003265667,0.00006113626,0.00004061526,0.000005050275,0.0002573448,0.0001117647,0.0002838407,0.6530573,0.01342858,0.3293411],"study_design_scores_gemma":[0.0003771776,0.0004350637,0.01211552,0.0002046932,0.00001077231,0.00003408834,0.000009457965,0.496844,0.04824585,0.4373221,0.003904984,0.0004963291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004882703,0.0000799766,0.9921519,0.0005024648,0.0003237028,0.0001297655,0.000006474128,0.000556054,0.001366981],"genre_scores_gemma":[0.6376486,0.000005142853,0.3619702,0.000244026,0.0000816939,0.00000532698,0.000008527505,0.0000108254,0.00002564799],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6327659,"threshold_uncertainty_score":0.7619368,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02395372269932123,"gpt":0.2807965282528208,"spread":0.2568428055534995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001436125,0.000178113,0.00017828,0.0002770363,0.000145409,0.001890949,0.0002462524,0.00004563972,0.00001345457],"category_scores_gemma":[0.00001527222,0.0001628896,0.00003710148,0.000374261,0.00018125,0.004453631,0.0003224248,0.000124578,0.000007652835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000558493,"about_ca_system_score_gemma":0.00002058398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008561515,"about_ca_topic_score_gemma":0.00000106571,"domain_scores_codex":[0.9987119,0.00003336297,0.0002478535,0.0005362097,0.0002165956,0.0002541113],"domain_scores_gemma":[0.9994807,0.00009659422,0.0000514004,0.0002310721,0.0000302668,0.000109994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005808214,0.0001962729,0.002196147,0.00005774719,0.00001493428,0.000286604,0.0009559231,0.000015207,0.003869418,0.01573872,0.0050084,0.9716026],"study_design_scores_gemma":[0.003199242,0.0009411795,0.02232919,0.0009930683,0.00001327808,0.001128746,0.0002444659,0.3696891,0.00528695,0.5941176,0.0005277428,0.001529384],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05656853,0.0002755564,0.9373679,0.0008531479,0.00007967225,0.0001378069,0.00000280933,0.0003078595,0.004406764],"genre_scores_gemma":[0.8764402,0.00006574799,0.123084,0.0002374004,0.00002473244,0.000002446324,0.000004757826,0.00001133037,0.0001294255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9700732,"threshold_uncertainty_score":0.9991452,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04848917196264458,"gpt":0.2817536667559093,"spread":0.2332644947932647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006036934,0.00005427385,0.00007802755,0.0001356198,0.0001804458,0.0002395725,0.0006153536,0.00002623539,7.01979e-7],"category_scores_gemma":[0.0002016462,0.000034169,0.0000561696,0.0005164001,0.00006676367,0.001448462,0.00003987741,0.0001223747,0.00001269947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006569528,"about_ca_system_score_gemma":0.0001208441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.40837e-7,"about_ca_topic_score_gemma":2.417194e-7,"domain_scores_codex":[0.9990543,0.00004568091,0.0003698471,0.00008273739,0.0003452379,0.0001022318],"domain_scores_gemma":[0.9986346,0.00009353217,0.0005433877,0.0002284436,0.0004548146,0.00004524241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002437737,0.0002723377,0.001052132,0.00001899695,0.00003195321,0.00003077387,0.0005761624,0.00002298372,0.01482043,0.1493913,0.04485361,0.788905],"study_design_scores_gemma":[0.0008816865,0.001030402,0.0931251,0.0002264542,0.00004016463,0.00336587,0.0001237547,0.05021715,0.1406841,0.4838727,0.2258661,0.0005664808],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003542738,0.0003692675,0.9826975,0.005757574,0.0001397053,0.00006771999,1.310978e-7,0.00007818635,0.007347167],"genre_scores_gemma":[0.8956496,0.0002395125,0.1037495,0.00007474634,0.00005886122,0.000005024525,2.262475e-7,0.000004064676,0.0002184917],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8921068,"threshold_uncertainty_score":0.2310203,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04104187514988752,"gpt":0.2895171130311445,"spread":0.248475237881257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001597566,0.0001575237,0.0001575242,0.00009349013,0.0001124004,0.000344865,0.0008920156,0.00006294263,0.00004477245],"category_scores_gemma":[0.00004993551,0.0001164219,0.00006977822,0.0002615133,0.00008555992,0.0002766807,0.0002223031,0.0001137084,0.00003399714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001410453,"about_ca_system_score_gemma":0.00001828693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001831655,"about_ca_topic_score_gemma":4.850447e-7,"domain_scores_codex":[0.9988317,0.000008634122,0.0002172369,0.0004186198,0.0001995127,0.0003243067],"domain_scores_gemma":[0.9994039,0.00005832858,0.00006632778,0.0002560702,0.0001307727,0.00008459276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006670367,0.0001987393,0.00004182299,0.00004803715,0.000003218879,0.00002987386,0.0001556417,0.0001452239,0.002393808,0.0006763111,0.01292763,0.983373],"study_design_scores_gemma":[0.0001765331,0.0001353344,0.00001785747,0.00002434943,0.000002566453,0.00007710521,0.000002619144,0.9503841,0.02970404,0.01665263,0.002621944,0.0002008826],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00183081,0.0001172526,0.981123,0.001178814,0.00002342208,0.0002102248,0.000001891529,0.0008937709,0.01462083],"genre_scores_gemma":[0.5062754,6.487342e-7,0.4914529,0.0008091568,0.00005719477,0.00003251971,9.56584e-7,0.000008057206,0.001363126],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9831721,"threshold_uncertainty_score":0.4747545,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01786933341249639,"gpt":0.2459524861509343,"spread":0.2280831527384379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.002991626,0.0007006718,0.000313507,0.0005462575,0.001315036,0.003085828,0.00320811,0.001074705,0.01815139],"category_scores_gemma":[0.001109713,0.001156251,0.0007189353,0.001553835,0.003958316,0.00316442,0.004181802,0.00126948,0.0005216905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002411152,"about_ca_system_score_gemma":0.001158563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005373493,"about_ca_topic_score_gemma":0.0001140949,"domain_scores_codex":[0.9923183,0.0002627807,0.001326717,0.002093455,0.001886845,0.002111857],"domain_scores_gemma":[0.9947294,0.001160599,0.001095198,0.001890032,0.0002399815,0.0008847608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000698012,0.0002600997,0.000004592538,0.0004713399,0.0001963373,0.0007460234,0.00325595,0.0002792247,0.001371448,0.9620827,0.004804261,0.02582997],"study_design_scores_gemma":[0.0007488928,0.00146525,0.00002319317,0.0007352664,0.0001591343,0.00113376,0.0002032497,0.5716051,0.4218365,0.001309504,0.0001009054,0.0006792271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4686755,0.0002781347,0.3491828,0.0005062585,0.002346915,0.00008925112,0.00009673442,0.0004865062,0.1783379],"genre_scores_gemma":[0.8685398,0.00009062399,0.1290465,0.0007160537,0.0008502218,0.0003729866,0.0000693229,0.0002568742,0.00005758642],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9607732,"threshold_uncertainty_score":0.9999851,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02198518174772196,"gpt":0.2553348456603041,"spread":0.2333496639125822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007156822,0.0005636849,0.0005203857,0.0007705759,0.0002203418,0.001408088,0.003557736,0.0002800498,0.000002302459],"category_scores_gemma":[0.00008630121,0.0004909339,0.00006767282,0.0005189122,0.0008849899,0.001537871,0.002302966,0.0005790817,0.00001192696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009926731,"about_ca_system_score_gemma":0.0003397919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003490042,"about_ca_topic_score_gemma":0.00001784775,"domain_scores_codex":[0.9961864,0.00002374699,0.0004255892,0.001891631,0.0008935647,0.000579008],"domain_scores_gemma":[0.9976143,0.0001493901,0.0001845533,0.001381603,0.0003222056,0.0003479523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000175126,0.0001567533,0.00006551301,0.00007155786,0.00001217199,0.0000578151,0.0006572765,0.001320368,0.0002092682,0.1639585,0.00005359389,0.8334196],"study_design_scores_gemma":[0.000151398,0.0003743887,0.00009130042,0.0002395137,0.000006444217,0.00009405507,2.846859e-8,0.2760037,0.001385556,0.7207277,0.0002449075,0.0006810555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000101975,0.0002270353,0.9929664,0.0002083306,0.001030523,0.0004202495,0.000004793628,0.0004267117,0.004613956],"genre_scores_gemma":[0.1442874,0.000003316851,0.8544618,0.0008313805,0.0002891854,0.00001613453,0.000004686326,0.00003878507,0.00006723332],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8327386,"threshold_uncertainty_score":0.9997543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}