{"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","author_layer_release":"2026-06-26"},"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)","authors":[{"name":"D. Sundararajan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023383,0.001559305,0.001152043,0.003059313,0.0006659631,0.00237592,0.001621785,0.0009649377,0.1813032],"category_scores_gemma":[0.0007482846,0.0005939054,0.0005393302,0.00267861,0.0006053798,0.002275125,0.001781042,0.001953418,0.1748669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004844483,"about_ca_system_score_gemma":0.0006631647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007056241,"about_ca_topic_score_gemma":0.001789487,"domain_scores_codex":[0.9994701,0.00001847733,0.0000152803,0.0000805032,0.0003892344,0.0000265144],"domain_scores_gemma":[0.9995539,0.00005965199,0.00001906163,0.0001078903,0.0002232273,0.00003627726],"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":[0.00002172713,0.00003555352,0.00007119671,0.0004283854,0.00001635165,0.00009554533,0.00004129424,0.0006279652,0.01083555,0.01356442,0.2860288,0.6882333],"study_design_scores_gemma":[0.000004696601,0.00002808319,0.0002604586,0.0001266767,0.00001417706,0.0005998152,0.00002694924,0.001922653,0.00619756,0.006453198,0.9843459,0.00001976898],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001485337,0.01935867,0.2195589,0.0008384196,0.003412922,0.0002532734,0.001118027,0.007122878,0.7468515],"genre_scores_gemma":[0.004826859,0.01028376,0.0371368,0.0005592789,0.0005509122,0.0001130155,0.001521333,0.0007989068,0.9442092],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1813032,"threshold_uncertainty_score":0.6065196,"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","authors":[{"name":"Victor Ostromoukhov","is_ca":true},{"name":"Charles Donohue","is_ca":true},{"name":"Pierre‐Marc Jodoin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009566038,0.0004588948,0.0005681263,0.000718787,0.0004794667,0.0005569378,0.0008868796,0.0004970618,0.001783109],"category_scores_gemma":[0.004224143,0.0004024938,0.0004423323,0.000600932,0.000664606,0.0009014532,0.00125357,0.0008099828,0.0004746226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006735025,"about_ca_system_score_gemma":0.0006451707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002322818,"about_ca_topic_score_gemma":0.003470874,"domain_scores_codex":[0.9992557,0.0001633836,0.00002612649,0.00007850587,0.0004108764,0.00006549866],"domain_scores_gemma":[0.9986466,0.0007348194,0.00009128541,0.0002340133,0.000217785,0.00007558305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000553393,0.0001109474,0.001770987,0.0002640072,0.00005647697,0.0002584494,0.0005326333,0.4575691,0.0751865,0.1325603,0.003657528,0.3274797],"study_design_scores_gemma":[0.00002219451,0.00002986564,0.0001615431,0.000005597883,0.000005912717,0.00004749142,0.00001089529,0.9806166,0.006934797,0.01060636,0.001550709,0.000008094499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01002744,0.00007231295,0.9885848,0.00003714114,0.00001717827,0.00002458103,0.00001616744,0.0002179357,0.001002336],"genre_scores_gemma":[0.294953,0.0001387766,0.7015011,0.0001091962,0.00004905657,0.0001599261,0.0001463257,0.0001723424,0.002770231],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002322818,"threshold_uncertainty_score":0.005965054,"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","authors":[{"name":"Zhifang Liang","is_ca":true},{"name":"Marios A. Ioannidis","is_ca":true},{"name":"Ioannis Chatzis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002602829,0.0002552312,0.0003887991,0.001364713,0.0003433017,0.0009320088,0.0004733029,0.0004425651,0.0007776531],"category_scores_gemma":[0.001159168,0.0002270774,0.0003999073,0.0007456384,0.0008245968,0.0009812345,0.0006272419,0.0002970202,0.0001568754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002925034,"about_ca_system_score_gemma":0.0004171976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007010641,"about_ca_topic_score_gemma":0.0007257253,"domain_scores_codex":[0.9998519,0.00003546451,0.000009735279,0.00002375989,0.00006154957,0.00001748067],"domain_scores_gemma":[0.9993698,0.0002306824,0.0001099688,0.00008186831,0.0001599305,0.00004783974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003361039,0.0001546169,0.005478968,0.000356304,0.00006783133,0.0003494138,0.0003992048,0.4071296,0.2597404,0.114274,0.001335913,0.2103776],"study_design_scores_gemma":[0.000006103223,0.00003469199,0.002446027,0.000006984299,0.00001044369,0.0002077016,0.00004331515,0.9653058,0.01782653,0.01323218,0.0008568788,0.00002334009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2619387,0.0001759546,0.7354625,0.000165474,0.00001496533,0.00003469066,0.0001096814,0.0002906367,0.001807402],"genre_scores_gemma":[0.8474333,0.0002023693,0.1512241,0.00001772179,0.00002031025,0.00003083928,0.000176823,0.00008099361,0.0008135587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001364713,"threshold_uncertainty_score":0.002601564,"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","authors":[{"name":"Yanxi Liu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001739035,0.000682605,0.0007489246,0.002003739,0.001114336,0.004104242,0.001252642,0.001484522,0.007549374],"category_scores_gemma":[0.00553835,0.0004602995,0.0007003386,0.002717009,0.004773607,0.007330925,0.001919378,0.002663793,0.001725032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001402778,"about_ca_system_score_gemma":0.001548137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001321346,"about_ca_topic_score_gemma":0.0009788801,"domain_scores_codex":[0.998493,0.0005015963,0.00009587834,0.0002696532,0.0005333673,0.0001066168],"domain_scores_gemma":[0.9978778,0.001237048,0.0001432314,0.0003607398,0.000305769,0.0000754759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001414791,0.000009896256,0.000189228,0.0001806515,0.00001234908,0.00004099721,0.0001067581,0.00285173,0.0005191254,0.9273345,0.007091051,0.06164953],"study_design_scores_gemma":[0.000006676666,0.00001866246,0.0002401354,0.00007789917,0.000006656684,0.0001291877,0.0000818628,0.01272569,0.0006479102,0.9376224,0.04842527,0.00001759121],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0112971,0.06756387,0.8297903,0.008839707,0.001314186,0.0001093023,0.0002818975,0.0005583582,0.08024528],"genre_scores_gemma":[0.4269926,0.08168343,0.4577159,0.002378835,0.004603174,0.0003743158,0.0009721753,0.0004888643,0.02479073],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007549374,"threshold_uncertainty_score":0.0252552,"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","authors":[{"name":"Bernadine Leung","is_ca":true},{"name":"Gwanggil Jeon","is_ca":true},{"name":"Éric Dubois","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008246176,0.0006647548,0.0005018043,0.0006147657,0.0003977221,0.0005759861,0.0006134947,0.0005975868,0.002906295],"category_scores_gemma":[0.001793668,0.0002755803,0.0003691686,0.0006324589,0.0003470757,0.0005797457,0.0005027106,0.0008466129,0.001453298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004834858,"about_ca_system_score_gemma":0.0008953256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001320548,"about_ca_topic_score_gemma":0.003084708,"domain_scores_codex":[0.9996989,0.00006135597,0.00001588235,0.00005570192,0.0001468708,0.00002139304],"domain_scores_gemma":[0.999359,0.0001958684,0.0000555329,0.0001248479,0.0002394314,0.00002538131],"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.0002790238,0.00008453163,0.0008792352,0.0002271406,0.00008157099,0.00008551387,0.0001581037,0.08417287,0.1735406,0.01429123,0.003802186,0.7223979],"study_design_scores_gemma":[0.00002802854,0.0001328005,0.001290788,0.00002348086,0.00004189392,0.0002951387,0.00004588509,0.8514584,0.1280486,0.004362978,0.01422503,0.0000469365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003104591,0.00008405393,0.995739,0.00002989294,0.00001466068,0.00002036539,0.00002648832,0.0003877507,0.0005932382],"genre_scores_gemma":[0.02877696,0.0001149778,0.9695033,0.00003048094,0.000013089,0.00003605215,0.00009323975,0.00005829022,0.001373505],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002906295,"threshold_uncertainty_score":0.009722531,"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","authors":[{"name":"Sylvain Bouix","is_ca":true},{"name":"Kaleem Siddiqi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004740416,0.0006329468,0.000743475,0.001727016,0.0005777379,0.001747563,0.001007339,0.0008743673,0.01025916],"category_scores_gemma":[0.001947678,0.0004718601,0.0004759482,0.0009168128,0.001120769,0.002129731,0.002248192,0.001678575,0.003500131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004480577,"about_ca_system_score_gemma":0.0002752088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004395537,"about_ca_topic_score_gemma":0.0006840723,"domain_scores_codex":[0.9996268,0.00004894012,0.00001986629,0.0000563986,0.0002261023,0.00002194879],"domain_scores_gemma":[0.999499,0.0001314398,0.00004065234,0.0001046659,0.0001534841,0.00007083467],"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.0001469666,0.00004166751,0.0003300898,0.0001692607,0.0000195231,0.0001491292,0.0003146563,0.01633679,0.02356896,0.6629621,0.00600056,0.2899602],"study_design_scores_gemma":[0.00003737694,0.0001110697,0.000374659,0.00005718697,0.00001807941,0.001224531,0.0001612095,0.2000666,0.01082575,0.7444063,0.04266416,0.00005299786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03117763,0.0008925374,0.9300942,0.00024218,0.0002327934,0.00004822283,0.0001111891,0.001143666,0.03605753],"genre_scores_gemma":[0.5073044,0.0013476,0.4255212,0.000150029,0.0001837488,0.00006187375,0.0005380755,0.001088926,0.0638042],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01025916,"threshold_uncertainty_score":0.03432029,"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","authors":[{"name":"Ivo Düntsch","is_ca":true},{"name":"Dimiter Vakarelov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002694912,0.0009613947,0.00188342,0.00392492,0.001179441,0.004721788,0.002825374,0.001774384,0.003534417],"category_scores_gemma":[0.007377644,0.0009687209,0.002003706,0.00353232,0.004460727,0.007819122,0.003860119,0.003746439,0.0006505068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001772032,"about_ca_system_score_gemma":0.0005717152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001021978,"about_ca_topic_score_gemma":0.0005491839,"domain_scores_codex":[0.9978818,0.0009345911,0.0001134462,0.0003876518,0.0005775475,0.0001048762],"domain_scores_gemma":[0.9957623,0.002445345,0.0003984713,0.0005181085,0.0006078128,0.0002680475],"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.000009174619,0.000009668811,0.00007601998,0.00005619288,0.00001923597,0.0000400002,0.0001263135,0.007264609,0.0003745451,0.9864211,0.0004153823,0.005187787],"study_design_scores_gemma":[0.000006621728,0.00003208944,0.0001085153,0.00002081789,0.00001677375,0.00008635854,0.00005518257,0.06506259,0.000233452,0.9293558,0.00500741,0.00001440746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00603497,0.002037478,0.9849871,0.0005960774,0.0001074696,0.0000149892,0.00004387902,0.00003669797,0.006141304],"genre_scores_gemma":[0.5357829,0.007733172,0.4365678,0.0005911881,0.001480688,0.000218266,0.0003111127,0.0001943037,0.01712065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004721788,"threshold_uncertainty_score":0.01425225,"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)","authors":[{"name":"Srečko Brlek","is_ca":true},{"name":"Jacques‐Olivier Lachaud","is_ca":false},{"name":"Xavier Provençal","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704598,0.001005178,0.0008066303,0.001484129,0.0009791576,0.002051449,0.0007509478,0.0009990979,0.04800044],"category_scores_gemma":[0.003441617,0.0003237462,0.0005159636,0.001632498,0.001653389,0.002744953,0.002452685,0.003126346,0.01810454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001690038,"about_ca_system_score_gemma":0.001243745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0023478,"about_ca_topic_score_gemma":0.001534403,"domain_scores_codex":[0.9993107,0.00007397561,0.00003471766,0.0001821245,0.0003291377,0.00006940629],"domain_scores_gemma":[0.9992332,0.000216033,0.00004742467,0.0001176753,0.0002963299,0.00008927032],"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.0000587777,0.00001218766,0.00007138679,0.0001229438,0.00000982066,0.00009586722,0.00004606116,0.001967142,0.0009169134,0.8177781,0.0663674,0.1125535],"study_design_scores_gemma":[0.0000293216,0.00003133768,0.0001701919,0.0001265745,0.00001628546,0.000423479,0.00004211147,0.009041082,0.003029458,0.4724457,0.5146024,0.00004224272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.009679507,0.01845748,0.2288766,0.01802991,0.01160787,0.00006789153,0.001041484,0.000952364,0.711287],"genre_scores_gemma":[0.1785192,0.03385028,0.0792478,0.003022704,0.004999142,0.0002195287,0.000916412,0.001375543,0.6978495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04800044,"threshold_uncertainty_score":0.1605775,"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","authors":[{"name":"J. Silvela","is_ca":true},{"name":"Javier Portillo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426137,0.0009047877,0.001129712,0.002071239,0.001081694,0.001477181,0.001067534,0.00137468,0.005102127],"category_scores_gemma":[0.006657714,0.0006786851,0.0009534608,0.003068843,0.001714559,0.002114904,0.001860816,0.001613292,0.0008491061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001265766,"about_ca_system_score_gemma":0.001216069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00645191,"about_ca_topic_score_gemma":0.005370087,"domain_scores_codex":[0.9991257,0.0003318409,0.00004697612,0.0001169117,0.0003004444,0.00007815303],"domain_scores_gemma":[0.9974741,0.002169208,0.00007144918,0.00008188815,0.000146987,0.00005630211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001462206,0.00008264702,0.0008038567,0.0007987017,0.0001094573,0.0003346927,0.0005610489,0.4204701,0.003190159,0.3219202,0.007946327,0.2436367],"study_design_scores_gemma":[0.00003647368,0.00005316798,0.0001614682,0.00007501706,0.00002271941,0.0001683106,0.00006165294,0.6212115,0.001002319,0.3636627,0.01352104,0.00002364094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005910293,0.003597231,0.981496,0.0007581747,0.00008086063,0.00005542559,0.00004545769,0.0004712436,0.007585241],"genre_scores_gemma":[0.1507776,0.00586698,0.8358294,0.0004360724,0.0002613717,0.0002008162,0.0001714919,0.0003298656,0.006126353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00645191,"threshold_uncertainty_score":0.01706833,"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","authors":[{"name":"Jing Yuan","is_ca":true},{"name":"Egil Bae","is_ca":false},{"name":"Xue‐Cheng Tai","is_ca":false},{"name":"Yuri Boykov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002777411,0.001401014,0.002126666,0.001971542,0.001172152,0.003123127,0.003956554,0.002478929,0.005816187],"category_scores_gemma":[0.00671725,0.001232498,0.001486212,0.002823123,0.002210673,0.004392322,0.003190094,0.004877423,0.0008030388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002850943,"about_ca_system_score_gemma":0.002257224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00512432,"about_ca_topic_score_gemma":0.004708127,"domain_scores_codex":[0.9987491,0.0005374988,0.0000457288,0.0002564467,0.000305725,0.0001054209],"domain_scores_gemma":[0.9976266,0.001411744,0.0001957261,0.000223632,0.0003195801,0.0002227219],"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.00009643904,0.00009980874,0.0002481004,0.0002414824,0.00003707328,0.00009137642,0.0001467572,0.3328704,0.001664463,0.5998646,0.00578332,0.05885611],"study_design_scores_gemma":[0.00001623298,0.00002962927,0.00009090773,0.00002995018,0.00001540768,0.00003341334,0.0000218855,0.7234898,0.0003887586,0.2719347,0.003933737,0.00001554502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002622475,0.0004971644,0.9942446,0.0003379306,0.00003862253,0.00003073511,0.00009474922,0.00009893864,0.00203474],"genre_scores_gemma":[0.1443282,0.00176459,0.8406357,0.000336964,0.000416165,0.0003880196,0.0004989626,0.0003818852,0.01124948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005816187,"threshold_uncertainty_score":0.0206852,"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","authors":[{"name":"Tao Wang","is_ca":true},{"name":"Anup Basu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001640381,0.001285839,0.0009135176,0.001115788,0.001237601,0.001938437,0.002938412,0.002799757,0.01316814],"category_scores_gemma":[0.005282541,0.0008795907,0.001230152,0.001747978,0.001577063,0.003492872,0.001445168,0.004112186,0.008897253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005921614,"about_ca_system_score_gemma":0.0009179386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001863101,"about_ca_topic_score_gemma":0.003536989,"domain_scores_codex":[0.9985955,0.0002295649,0.0001691319,0.0002076341,0.0007101299,0.00008800747],"domain_scores_gemma":[0.9974487,0.0007496519,0.00009303859,0.0005541077,0.001053891,0.0001006341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002998367,0.00006438695,0.0002931842,0.0007169637,0.0001067536,0.0007901315,0.0001538884,0.007927113,0.02544972,0.0838232,0.472782,0.4075928],"study_design_scores_gemma":[0.00002364283,0.00008142838,0.0006487397,0.00009973769,0.00004111121,0.001267372,0.0000298255,0.02043747,0.01931492,0.04905694,0.9088743,0.0001245242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"commentary","genre_scores_codex":[0.002116856,0.01595606,0.8733644,0.01518624,0.06433361,0.0001530423,0.000415642,0.002841257,0.02563281],"genre_scores_gemma":[0.01905491,0.01268201,0.8600752,0.008600792,0.02243704,0.0002099432,0.0008337982,0.001886304,0.07421996],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.01316814,"threshold_uncertainty_score":0.04405177,"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","authors":[{"name":"Rajesh Pereira","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006102863,0.0004911239,0.0005417474,0.001957343,0.0008899536,0.00252468,0.000584687,0.000682866,0.003977805],"category_scores_gemma":[0.003152281,0.000273924,0.0004829611,0.001085508,0.003074069,0.003508278,0.00169143,0.00213761,0.0005724034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001288274,"about_ca_system_score_gemma":0.0004556159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000977491,"about_ca_topic_score_gemma":0.0005384383,"domain_scores_codex":[0.9995896,0.0001187916,0.00001916883,0.00008479425,0.0001342635,0.00005334235],"domain_scores_gemma":[0.998952,0.0005291203,0.0001542389,0.00006626375,0.0001849477,0.0001134435],"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.00001001428,0.000002539075,0.00005740408,0.00001180699,0.000002089088,0.000023592,0.00007480987,0.0005693781,0.0003035251,0.9947174,0.0003958654,0.003831595],"study_design_scores_gemma":[0.000009711918,0.0000192753,0.0001567792,0.000008416917,0.000003702054,0.0001080849,0.00007414487,0.004517177,0.0002803893,0.9869195,0.007894691,0.00000811174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3021016,0.01510208,0.4922874,0.008666402,0.001334756,0.000042426,0.0004378608,0.0003183331,0.1797093],"genre_scores_gemma":[0.9372963,0.005471266,0.03061969,0.0004217203,0.0009968026,0.00002867096,0.000151593,0.00007439491,0.02493963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003977805,"threshold_uncertainty_score":0.01330709,"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","authors":[{"name":"Victor Ostromoukhov","is_ca":true},{"name":"Charles Donohue","is_ca":true},{"name":"Pierre‐Marc Jodoin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009269746,0.0004427938,0.0005477562,0.0006976291,0.0004710632,0.0005269857,0.0008379424,0.000473471,0.001661657],"category_scores_gemma":[0.004030249,0.0003809019,0.0004223098,0.0005785823,0.0006547556,0.0008665539,0.001170916,0.0007647506,0.0004327334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006499562,"about_ca_system_score_gemma":0.0006189558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002167294,"about_ca_topic_score_gemma":0.003317302,"domain_scores_codex":[0.9993112,0.0001508305,0.00002435473,0.00007274019,0.0003805539,0.00006027223],"domain_scores_gemma":[0.9987036,0.0007093183,0.00008843356,0.0002199927,0.0002056713,0.00007294611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005299941,0.000107537,0.001745376,0.000255011,0.00005455525,0.0002523919,0.0005141183,0.4555073,0.07746325,0.1332506,0.003467558,0.3268522],"study_design_scores_gemma":[0.00002156052,0.00003035363,0.0001676964,0.000005561442,0.000005962893,0.00004879973,0.00001081107,0.9800563,0.00741822,0.0106617,0.001564818,0.000008262409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01051039,0.00007066115,0.98813,0.0000368908,0.00001668248,0.00002340358,0.00001550915,0.0002080685,0.0009883433],"genre_scores_gemma":[0.2965725,0.0001351293,0.7000899,0.0001014495,0.00004615271,0.0001512436,0.0001376691,0.0001563534,0.002609547],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002167294,"threshold_uncertainty_score":0.005558789,"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","authors":[{"name":"Fazel Keshtkar","is_ca":true},{"name":"Wail Gueaieb","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003963505,0.0006055988,0.0007205877,0.001222797,0.0004277821,0.0008858087,0.0004922952,0.0007393524,0.0007547947],"category_scores_gemma":[0.0008796536,0.0004119847,0.0007380747,0.0005044434,0.0005385045,0.0007531587,0.0003935885,0.000381216,0.0002801292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005436502,"about_ca_system_score_gemma":0.0004701633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002689337,"about_ca_topic_score_gemma":0.002556953,"domain_scores_codex":[0.9997438,0.00005416283,0.00002189213,0.00005807078,0.0001028147,0.00001917281],"domain_scores_gemma":[0.9997235,0.0001302689,0.00004150111,0.00003066507,0.00006061426,0.00001342785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001543881,0.0001029869,0.002295474,0.0002774363,0.0001356275,0.0003917566,0.0005225334,0.4501302,0.1307159,0.01219389,0.001521386,0.4015585],"study_design_scores_gemma":[0.00001392159,0.00005423969,0.0007296368,0.00001545399,0.00003003475,0.000138008,0.00006839519,0.9786516,0.01267686,0.004366717,0.003236061,0.00001902408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01813467,0.0003091501,0.9795446,0.0001161722,0.00002938686,0.00005144812,0.00001544007,0.00041245,0.001386764],"genre_scores_gemma":[0.2350518,0.0004651904,0.7622992,0.00006203112,0.00003542789,0.00009650387,0.0000718841,0.00006623866,0.001851676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002689337,"threshold_uncertainty_score":0.005347431,"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","authors":[{"name":"Emilio Di Giacomo","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Henk Meijer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003713973,0.001348066,0.001408606,0.001605915,0.0006209739,0.002329745,0.001824288,0.001223948,0.01441163],"category_scores_gemma":[0.004670087,0.001024169,0.001035556,0.002473013,0.000660388,0.00237825,0.00159083,0.001264367,0.003358208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008662546,"about_ca_system_score_gemma":0.0008216324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007641212,"about_ca_topic_score_gemma":0.01814114,"domain_scores_codex":[0.999419,0.0001246938,0.00003730006,0.0001365444,0.0001931218,0.00008944492],"domain_scores_gemma":[0.9981847,0.001000313,0.0001464364,0.0002800153,0.0002693433,0.0001190372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006867443,0.0002245888,0.004637685,0.0006492163,0.0001478925,0.0005058458,0.0005497068,0.6137915,0.01032483,0.0304533,0.02067173,0.3173571],"study_design_scores_gemma":[0.00007277176,0.00007338072,0.0005082379,0.0000233741,0.00001964812,0.00008665513,0.0001983605,0.9586337,0.003450667,0.03392926,0.002987029,0.00001696095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1759157,0.000388645,0.8033105,0.0004546521,0.0000834957,0.0002229246,0.002576246,0.007799604,0.009248062],"genre_scores_gemma":[0.4491439,0.000418344,0.5403194,0.0001166786,0.00003173176,0.0001533808,0.004319406,0.001090946,0.004406256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01441163,"threshold_uncertainty_score":0.04821169,"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","authors":[{"name":"Ziheng Zhou","is_ca":true},{"name":"A.N. Venetsanopoulos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006324734,0.0006522373,0.0007421358,0.003228477,0.0004860687,0.002566723,0.001177544,0.001282465,0.01062816],"category_scores_gemma":[0.002187559,0.0004040264,0.001043593,0.003006883,0.001565913,0.002845306,0.001329518,0.0008990871,0.006502332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005596952,"about_ca_system_score_gemma":0.0005400592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000823312,"about_ca_topic_score_gemma":0.0007597936,"domain_scores_codex":[0.9991587,0.0001259893,0.00008201785,0.000234319,0.0003419729,0.00005694131],"domain_scores_gemma":[0.9993889,0.0001224396,0.00009475332,0.000181192,0.0001807036,0.00003201979],"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.00009014507,0.00003573491,0.0003533983,0.0003632185,0.00004079716,0.000388987,0.0001934831,0.02669893,0.05709976,0.3318838,0.009299784,0.573552],"study_design_scores_gemma":[0.00003283854,0.0001093273,0.001720783,0.0001264747,0.00004770494,0.002369592,0.000156568,0.4983793,0.05840573,0.3079617,0.1305865,0.0001033962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002677468,0.0005758542,0.9884183,0.0001511441,0.00006305169,0.00004273017,0.000129369,0.001350658,0.006591402],"genre_scores_gemma":[0.08825972,0.001640798,0.8940279,0.0001685986,0.0002251915,0.0001131848,0.001198311,0.0004049193,0.01396141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01062816,"threshold_uncertainty_score":0.03555477,"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","authors":[{"name":"Srečko Brlek","is_ca":true},{"name":"Gilbert Labelle","is_ca":true},{"name":"Annie Lacasse","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001865453,0.001178178,0.001684597,0.00327179,0.001446777,0.003045911,0.001202985,0.002104696,0.00403357],"category_scores_gemma":[0.00414738,0.0005539678,0.001470973,0.003371043,0.007030649,0.004854007,0.002233513,0.006141138,0.0006380812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001896609,"about_ca_system_score_gemma":0.0005889177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001328339,"about_ca_topic_score_gemma":0.0009494206,"domain_scores_codex":[0.9994543,0.0002339443,0.00003109931,0.00008696651,0.0001444292,0.00004932308],"domain_scores_gemma":[0.998253,0.001230886,0.0001154624,0.0001094531,0.0001523728,0.0001388187],"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.000008086353,0.000008629378,0.00005243783,0.00003652709,0.000007445605,0.0000332965,0.000044617,0.0008058384,0.0002030954,0.9937212,0.001025939,0.004052944],"study_design_scores_gemma":[0.000006690478,0.000005962853,0.00006001285,0.000008659104,0.000002779407,0.00003532983,0.00001686465,0.002992933,0.00005468126,0.9936812,0.003128937,0.000005978763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06282078,0.06859186,0.711337,0.02878171,0.004145493,0.0000605669,0.0004018605,0.0003239972,0.1235366],"genre_scores_gemma":[0.6839069,0.05177031,0.2021963,0.00597557,0.01236766,0.0002129976,0.0004652282,0.0004116619,0.04269342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00403357,"threshold_uncertainty_score":0.01376092,"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","authors":[{"name":"Nevine Ebeid","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881209,0.0008227963,0.0004471197,0.001838744,0.0005222271,0.002510503,0.0005621079,0.0009591093,0.005532171],"category_scores_gemma":[0.006584623,0.0002738284,0.0003457855,0.002962267,0.001513239,0.003297266,0.001495154,0.001482723,0.001969331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006359693,"about_ca_system_score_gemma":0.0005049442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004058499,"about_ca_topic_score_gemma":0.0004588545,"domain_scores_codex":[0.9990044,0.0002854703,0.00008727957,0.0001155453,0.0003973959,0.000109904],"domain_scores_gemma":[0.9982309,0.0008504793,0.0002384419,0.0003209309,0.0002967922,0.00006250451],"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.00007865459,0.00001472399,0.00009574969,0.0000668512,0.000003772983,0.00007025248,0.000127746,0.005702686,0.002199688,0.9125199,0.002969286,0.0761507],"study_design_scores_gemma":[0.00001793089,0.00006241852,0.0001051221,0.0001449943,0.000008246726,0.0002028878,0.00007690713,0.03587118,0.002802925,0.9380593,0.02261974,0.00002837957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05313645,0.004705862,0.8712491,0.001543986,0.001594916,0.00008164864,0.0003013224,0.0004958448,0.06689093],"genre_scores_gemma":[0.659357,0.0097847,0.2807689,0.001309015,0.001728138,0.0002455426,0.0008054103,0.0003257105,0.0456757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005532171,"threshold_uncertainty_score":0.01850694,"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","authors":[{"name":"Daniel Cohen‐Or","is_ca":false},{"name":"Chen Greif","is_ca":false},{"name":"Tao Ju","is_ca":false},{"name":"Niloy J. Mitra","is_ca":false},{"name":"Ariel Shamir","is_ca":false},{"name":"Olga Sorkine‐Hornung","is_ca":false},{"name":"Hao Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862532,0.001119774,0.0009052968,0.004342774,0.001422957,0.005991085,0.001246252,0.001075266,0.05577525],"category_scores_gemma":[0.002610981,0.0007655334,0.001090555,0.005661672,0.001882153,0.006889485,0.001956679,0.004112959,0.02586765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001892703,"about_ca_system_score_gemma":0.001288035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001369393,"about_ca_topic_score_gemma":0.002849633,"domain_scores_codex":[0.9991485,0.0001017559,0.00003279333,0.0001186919,0.0005535021,0.00004482462],"domain_scores_gemma":[0.9988862,0.0005139463,0.00003564934,0.0001405443,0.0003134834,0.0001102293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002496321,0.00004467109,0.0001441659,0.0004202207,0.0000155011,0.0001256137,0.0003205212,0.001566153,0.001633416,0.4056608,0.3641399,0.2259041],"study_design_scores_gemma":[0.000005070031,0.00001680039,0.0002548482,0.0002078565,0.000006041391,0.0003004162,0.00006126661,0.002133332,0.0004852339,0.1021349,0.894379,0.00001523782],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002940563,0.100368,0.2576346,0.009130223,0.01022908,0.000241327,0.001433929,0.003233772,0.6147885],"genre_scores_gemma":[0.01768816,0.06608451,0.1144976,0.003644079,0.006388261,0.000352576,0.002063122,0.00283001,0.7864516],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.05577525,"threshold_uncertainty_score":0.1865868,"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","authors":[{"name":"Dingrong Yi","is_ca":true},{"name":"Vincent Hayward","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006092617,0.0007889543,0.000562585,0.002473837,0.0003433568,0.001574408,0.000659312,0.0006055344,0.02483177],"category_scores_gemma":[0.003993048,0.0004881546,0.0005595621,0.001376879,0.0003239809,0.0009039397,0.001004897,0.000956181,0.006769193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002736974,"about_ca_system_score_gemma":0.000672136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006380056,"about_ca_topic_score_gemma":0.0008774315,"domain_scores_codex":[0.9997113,0.0000529799,0.00002805702,0.00004272766,0.0001308185,0.00003401988],"domain_scores_gemma":[0.9987584,0.0004339595,0.00007877265,0.0003813069,0.0002820682,0.00006547337],"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.0004981765,0.00008623509,0.0007363049,0.0003632806,0.00003962203,0.0005949456,0.0001810066,0.01311172,0.2325734,0.02149452,0.03214402,0.6981768],"study_design_scores_gemma":[0.0001694749,0.0002637161,0.007240438,0.0001678214,0.00006536557,0.003968205,0.0001413017,0.55702,0.2159306,0.04711774,0.1677671,0.0001480986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008511163,0.0001924554,0.9749326,0.0002275408,0.00009664417,0.0001301116,0.0008253098,0.01155583,0.003528339],"genre_scores_gemma":[0.07514611,0.0006953678,0.914281,0.0000980046,0.0001590565,0.0002331274,0.002423058,0.002969438,0.003994887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02483177,"threshold_uncertainty_score":0.08307058,"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","authors":[{"name":"O. El Badawy","is_ca":true},{"name":"Mohamed S. Kamel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004332601,0.0006387402,0.0006541683,0.003370629,0.0006793934,0.001972072,0.001438202,0.0008140675,0.003137749],"category_scores_gemma":[0.003069605,0.0005348705,0.0009172453,0.0030363,0.001007213,0.003599707,0.001639666,0.0011087,0.001607838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008566962,"about_ca_system_score_gemma":0.0007070128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004849992,"about_ca_topic_score_gemma":0.005114879,"domain_scores_codex":[0.9993078,0.0001270074,0.00005856312,0.0001770638,0.0002847552,0.0000449067],"domain_scores_gemma":[0.9986252,0.0003864995,0.0001792357,0.0004141264,0.0003301305,0.00006489061],"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.0003569239,0.00008847711,0.002749708,0.0004117255,0.00009264958,0.0003554653,0.0007088609,0.1131197,0.03035069,0.2643642,0.01399603,0.5734056],"study_design_scores_gemma":[0.00002682508,0.00009275173,0.001186232,0.00008062839,0.00004938538,0.000633059,0.0001823116,0.7664732,0.01731538,0.1624966,0.05135471,0.0001089792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007442356,0.0001619465,0.9886035,0.0001455898,0.00002953456,0.0000416419,0.0003944469,0.001281171,0.001899811],"genre_scores_gemma":[0.1711122,0.0006358471,0.8215862,0.0002468417,0.00006291892,0.0001840782,0.002421299,0.000552207,0.00319837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004849992,"threshold_uncertainty_score":0.0104968,"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","authors":[{"name":"Srečko Brlek","is_ca":true},{"name":"Gilbert Labelle","is_ca":true},{"name":"Annie Lacasse","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422132,0.0002813525,0.000314378,0.001370205,0.000964497,0.001977847,0.0005522805,0.0005355965,0.004463123],"category_scores_gemma":[0.002619584,0.0002264402,0.0003482547,0.0008832419,0.001898951,0.003057985,0.0008762443,0.0008751633,0.0003746693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000543933,"about_ca_system_score_gemma":0.0002201834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003163669,"about_ca_topic_score_gemma":0.0001918157,"domain_scores_codex":[0.9997868,0.0000281857,0.00001224641,0.00005736891,0.00007429195,0.00004114204],"domain_scores_gemma":[0.998861,0.0004680702,0.0002173381,0.0001068759,0.0001299995,0.0002167877],"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.00006103027,0.00002344728,0.001561147,0.00004071709,0.000005663268,0.0003020286,0.0003349145,0.002797088,0.004469532,0.9779007,0.0002918926,0.01221193],"study_design_scores_gemma":[0.00003524589,0.00009889924,0.001497409,0.00003422765,0.000008865461,0.0007931078,0.0002335245,0.02754143,0.004242914,0.9601904,0.005300715,0.00002331094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8628781,0.0003004467,0.1065622,0.0002096854,0.00007409925,0.00003908977,0.0001426378,0.0001204043,0.02967345],"genre_scores_gemma":[0.9767734,0.0002573459,0.01798277,0.0000386352,0.00004759168,0.00003903459,0.0001233448,0.0000485697,0.004689301],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004463123,"threshold_uncertainty_score":0.01493067,"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","authors":[{"name":"Martín Costa","is_ca":false},{"name":"D. de Werra","is_ca":false},{"name":"Christophe Picouleau","is_ca":false},{"name":"David Schindl","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001824903,0.0008150556,0.001386638,0.001269637,0.001911604,0.005634682,0.001780295,0.005180197,0.008204903],"category_scores_gemma":[0.01229715,0.0006314315,0.001459824,0.001288799,0.004191385,0.005485639,0.003328035,0.004069231,0.000682259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00097456,"about_ca_system_score_gemma":0.00106488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001699141,"about_ca_topic_score_gemma":0.00108677,"domain_scores_codex":[0.9982827,0.0005393754,0.000107407,0.0002996546,0.0005343943,0.0002364532],"domain_scores_gemma":[0.9957768,0.002356217,0.0005005735,0.000567728,0.0003269768,0.0004716533],"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.00005093977,0.00002635153,0.0002049457,0.00005953645,0.00001577943,0.0003569347,0.0001199619,0.00662727,0.0004764792,0.9877458,0.001605261,0.002710751],"study_design_scores_gemma":[0.00003350501,0.00001084198,0.00008069332,0.00001290697,0.000007462132,0.0003655597,0.00006863587,0.07259588,0.0004317804,0.9252004,0.001178951,0.00001337982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1558463,0.0008936923,0.7525695,0.008136125,0.0005060968,0.0001265785,0.0005764536,0.0004515343,0.08089355],"genre_scores_gemma":[0.895368,0.0006076656,0.07288618,0.0007367273,0.0005476443,0.000107606,0.0004661498,0.0002028006,0.02907716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008204903,"threshold_uncertainty_score":0.02744818,"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","authors":[{"name":"Gerard J. Chang","is_ca":false},{"name":"Sheng-Chyang Liaw","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001889852,0.001255943,0.002725795,0.001410573,0.00252051,0.004176461,0.003852738,0.00475799,0.01729222],"category_scores_gemma":[0.01006043,0.001385611,0.001392538,0.00424518,0.001942686,0.009711659,0.003202465,0.00408131,0.003081219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002679408,"about_ca_system_score_gemma":0.002227705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005677825,"about_ca_topic_score_gemma":0.007211782,"domain_scores_codex":[0.997673,0.0008497876,0.0001349511,0.0006725278,0.0003096011,0.00036011],"domain_scores_gemma":[0.9912086,0.006072513,0.0004765811,0.001386506,0.0004151236,0.0004407894],"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.001026967,0.000496426,0.002085752,0.001325522,0.0001101053,0.000447043,0.0008584863,0.1445739,0.004904601,0.39079,0.102773,0.3506084],"study_design_scores_gemma":[0.0002029139,0.000110509,0.0006056707,0.0001217504,0.00004486368,0.0002661638,0.0004515113,0.2746922,0.002969077,0.7050071,0.01548629,0.00004189894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1320839,0.001542697,0.8181316,0.00843117,0.0003457785,0.000370849,0.007326577,0.003059846,0.0287077],"genre_scores_gemma":[0.325614,0.001327066,0.6243357,0.001715223,0.0004837391,0.0006634859,0.01386871,0.001840604,0.03015149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01729222,"threshold_uncertainty_score":0.05784827,"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","authors":[{"name":"Srečko Brlek","is_ca":true},{"name":"Gilbert Labelle","is_ca":true},{"name":"Annie Lacasse","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004314297,0.002586246,0.00380362,0.005986353,0.006241478,0.004447075,0.004956478,0.004397582,0.01664651],"category_scores_gemma":[0.01487542,0.0009121668,0.005376494,0.007105785,0.00605588,0.01490456,0.01029056,0.009417997,0.008205194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003328513,"about_ca_system_score_gemma":0.002251896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004716045,"about_ca_topic_score_gemma":0.002883763,"domain_scores_codex":[0.9955592,0.001250876,0.000295411,0.0009461513,0.001465566,0.0004827783],"domain_scores_gemma":[0.9936548,0.003623893,0.0002245315,0.000951523,0.00119704,0.000348088],"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.0001731622,0.00007651588,0.0003471221,0.0007148206,0.000102293,0.0002570435,0.0004210447,0.0008283713,0.001080198,0.7737311,0.1771298,0.04513844],"study_design_scores_gemma":[0.00002758771,0.0000424899,0.0005649212,0.000170968,0.00009817763,0.0003184401,0.00006936197,0.001535513,0.0007184765,0.8145822,0.1818116,0.00006032079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.009512212,0.1309167,0.2164408,0.1738599,0.07476955,0.0001671383,0.00182433,0.001768521,0.3907408],"genre_scores_gemma":[0.2203903,0.1025511,0.206779,0.1096996,0.08786971,0.0008325237,0.00297499,0.004558827,0.264344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01664651,"threshold_uncertainty_score":0.05568808,"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","authors":[{"name":"Louisa Lam","is_ca":true},{"name":"Ching Y. Suen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003929154,0.001963051,0.00134999,0.002967464,0.0008383448,0.001553661,0.001214931,0.001370996,0.003682147],"category_scores_gemma":[0.01570695,0.000591597,0.0008274099,0.002389862,0.0005329591,0.001711451,0.0009256639,0.0006812672,0.001195594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009144433,"about_ca_system_score_gemma":0.0008436021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003390734,"about_ca_topic_score_gemma":0.003433391,"domain_scores_codex":[0.9961468,0.0006842241,0.0006012559,0.0006920051,0.001658086,0.0002176627],"domain_scores_gemma":[0.9870433,0.005906477,0.0009143791,0.001518172,0.004381454,0.0002361959],"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.001371081,0.0004754991,0.003417117,0.0005200161,0.0003740199,0.000135195,0.0001111296,0.08587211,0.04082813,0.001090199,0.002239769,0.8635658],"study_design_scores_gemma":[0.0002115573,0.002262746,0.0093993,0.0001092534,0.000431515,0.001283713,0.0002210409,0.7728691,0.2039374,0.001949198,0.007195888,0.0001292494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5490973,0.005414528,0.4224733,0.0003247368,0.0004678753,0.000878398,0.0008018888,0.008556847,0.01198517],"genre_scores_gemma":[0.4366632,0.001928031,0.5535706,0.0001134524,0.0001142723,0.0002019647,0.002173242,0.0008322736,0.004403027],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.003929154,"threshold_uncertainty_score":0.02077961,"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","authors":[{"name":"Petra Berenbrink","is_ca":true},{"name":"Bruce Krayenhoff","is_ca":true},{"name":"Frederik Mallmann-Trenn","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001300484,0.001482831,0.001497569,0.00180636,0.0006533422,0.002509498,0.00227248,0.002068693,0.007608073],"category_scores_gemma":[0.01860785,0.0009251358,0.0008790101,0.001605183,0.00114717,0.005762451,0.002234421,0.002351509,0.002260623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001514525,"about_ca_system_score_gemma":0.001515976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005634252,"about_ca_topic_score_gemma":0.01099523,"domain_scores_codex":[0.9987097,0.0003100809,0.0000852256,0.0003511937,0.0003845996,0.0001592318],"domain_scores_gemma":[0.9845752,0.01239443,0.0005740136,0.001330889,0.0007863949,0.0003390283],"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.002845688,0.0003397339,0.01200956,0.001042807,0.0003186058,0.0005445686,0.0003451257,0.3960838,0.04587388,0.04627703,0.02192025,0.4723989],"study_design_scores_gemma":[0.00004115086,0.00003404759,0.001256963,0.00001849357,0.00002610022,0.000095021,0.00004808024,0.9560732,0.003769272,0.03730865,0.0013157,0.00001343176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1129278,0.001604258,0.8713328,0.0022435,0.0002939887,0.0001441274,0.001253363,0.003766118,0.00643402],"genre_scores_gemma":[0.5433758,0.0007886179,0.438632,0.0004779689,0.0003574958,0.0002594733,0.003084279,0.0007886276,0.01223575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007608073,"threshold_uncertainty_score":0.0254516,"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","authors":[{"name":"Marina L. Gavrilova","is_ca":true},{"name":"Muhammad H. Alsuwaiyel","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001428968,0.001618463,0.001701792,0.002865486,0.0008759029,0.002635238,0.00284642,0.002010995,0.007389214],"category_scores_gemma":[0.01024217,0.0008768627,0.001325282,0.002786666,0.001312715,0.005248276,0.002729573,0.00267026,0.004975447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001176603,"about_ca_system_score_gemma":0.002322121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002428825,"about_ca_topic_score_gemma":0.003448756,"domain_scores_codex":[0.9965479,0.0004322562,0.0003161584,0.000735899,0.001626044,0.0003418991],"domain_scores_gemma":[0.9972638,0.0006862268,0.0002068608,0.0006275388,0.001080038,0.0001354922],"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.000331874,0.0001803858,0.000533864,0.0002481647,0.0000572311,0.0001004535,0.0001199278,0.03839707,0.009990929,0.09731311,0.01290371,0.8398232],"study_design_scores_gemma":[0.0004116713,0.0005085038,0.001386859,0.0000937291,0.00009048118,0.001424097,0.0002176691,0.7110367,0.04769943,0.1628637,0.07402254,0.0002446435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001281718,0.0002302494,0.9963506,0.0001177396,0.0001307731,0.00004768421,0.00006092839,0.0006120488,0.001168263],"genre_scores_gemma":[0.018192,0.0003048581,0.9785218,0.00006195813,0.0001186646,0.0002147442,0.0003679024,0.0001444703,0.00207359],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007389214,"threshold_uncertainty_score":0.02471942,"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","authors":[{"name":"Jian-Hua Yin","is_ca":false},{"name":"Jiong-Sheng Li","is_ca":false},{"name":"Rui Mao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004898125,0.0006882938,0.0008465004,0.001505118,0.001640018,0.00271944,0.0009314429,0.002001892,0.02065005],"category_scores_gemma":[0.005113628,0.0004420362,0.0005282893,0.001279566,0.001601523,0.003003983,0.002122262,0.002730158,0.002302349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007407438,"about_ca_system_score_gemma":0.0004149056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000641432,"about_ca_topic_score_gemma":0.0008612481,"domain_scores_codex":[0.9994938,0.0001360303,0.00002983747,0.0001043474,0.000105499,0.0001305261],"domain_scores_gemma":[0.9986485,0.0008003606,0.0001619019,0.0001343408,0.0001022836,0.0001527125],"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.0003287028,0.00007389154,0.0007192626,0.0002249928,0.00003185321,0.000595085,0.0002378969,0.00966549,0.00202795,0.9236234,0.01915201,0.04331952],"study_design_scores_gemma":[0.00005718683,0.00005624624,0.0005892917,0.00006434909,0.00001930248,0.0006673543,0.0002329022,0.02437665,0.001315546,0.9586297,0.01396501,0.00002655861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4701637,0.003592988,0.2672807,0.008276111,0.0007924189,0.0001514266,0.001735439,0.0007574402,0.2472497],"genre_scores_gemma":[0.8956915,0.001393951,0.05503909,0.0008339789,0.000445295,0.0001302384,0.001543585,0.0002332746,0.04468916],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02065005,"threshold_uncertainty_score":0.06908131,"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","authors":[{"name":"Ayaka Ishibashi","is_ca":false},{"name":"Yuichi Sato","is_ca":false},{"name":"Shigeki Iwata","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107069,0.0007640327,0.001563452,0.0008439219,0.004532503,0.004837022,0.001863397,0.003364729,0.01703447],"category_scores_gemma":[0.0115027,0.0008587087,0.002027462,0.001694464,0.003620239,0.01170695,0.003403256,0.005425832,0.001710169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002025196,"about_ca_system_score_gemma":0.002411363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005817235,"about_ca_topic_score_gemma":0.004844214,"domain_scores_codex":[0.9986691,0.0004312117,0.00008806871,0.0003846151,0.0001887567,0.0002381343],"domain_scores_gemma":[0.9929197,0.00549445,0.0002888388,0.0005800144,0.0004228997,0.0002940928],"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.0005099048,0.0001553022,0.001336166,0.0004463575,0.00006870316,0.0006386947,0.001733341,0.02231064,0.00115051,0.9140469,0.0277341,0.02986935],"study_design_scores_gemma":[0.00008715264,0.00002984574,0.0004225411,0.00005459348,0.00003609158,0.0001939332,0.0006309079,0.02067192,0.0007174825,0.9632652,0.0138583,0.00003190294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5435999,0.003460866,0.1607727,0.03076997,0.0008037325,0.0002401876,0.002498068,0.001431416,0.2564231],"genre_scores_gemma":[0.9286355,0.0009300906,0.03604785,0.001281085,0.0001568037,0.0001572938,0.001935694,0.0003892375,0.03046649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01703447,"threshold_uncertainty_score":0.05698597,"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","authors":[{"name":"Ziheng Zhou","is_ca":true},{"name":"A.N. Venetsanopoulos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005313276,0.0006720524,0.0005014166,0.001277481,0.0002235785,0.001049857,0.0007756356,0.0009920596,0.005099741],"category_scores_gemma":[0.00144881,0.0002798399,0.0005955299,0.002124631,0.0006318854,0.001617929,0.000584612,0.0008274032,0.003321912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004218575,"about_ca_system_score_gemma":0.0004475381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005644786,"about_ca_topic_score_gemma":0.000679864,"domain_scores_codex":[0.9995216,0.00009682826,0.00004148442,0.00008690487,0.0002331916,0.00002006643],"domain_scores_gemma":[0.9996054,0.00008664757,0.00004739648,0.00009483388,0.0001518211,0.00001398778],"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.00005610111,0.00002809756,0.0001929272,0.0003574961,0.00006394112,0.0001874757,0.00006471168,0.03249093,0.03292498,0.1507433,0.01293059,0.7699595],"study_design_scores_gemma":[0.00002495537,0.0001211177,0.0008305533,0.00007064094,0.00003881413,0.0009699684,0.00003384144,0.6933597,0.03071034,0.1365962,0.1371816,0.00006225794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001150856,0.001003797,0.9948632,0.0001671573,0.000129843,0.00001556,0.00005788547,0.0005849898,0.002026689],"genre_scores_gemma":[0.03691581,0.002478849,0.9531945,0.0001557054,0.0002550515,0.00007680929,0.000486972,0.0001771299,0.006259213],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005099741,"threshold_uncertainty_score":0.01706034,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Ketan Dalal","is_ca":true},{"name":"Bruce A. Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000264381,0.0005619295,0.0006475211,0.001013871,0.001264298,0.001674906,0.001047535,0.0007836575,0.03034837],"category_scores_gemma":[0.002239072,0.0004548951,0.0006299867,0.001422069,0.0007270631,0.002577242,0.001529733,0.001919934,0.002820861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000687154,"about_ca_system_score_gemma":0.0004546618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001049167,"about_ca_topic_score_gemma":0.001881812,"domain_scores_codex":[0.9996375,0.00007494703,0.00001393548,0.0001229968,0.00008250387,0.00006821213],"domain_scores_gemma":[0.9987007,0.0004785554,0.0001376048,0.0003382913,0.0001529596,0.000191784],"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.0001779682,0.00007935613,0.001216818,0.0002119734,0.00005303992,0.0003011176,0.0002686509,0.008811052,0.005203511,0.9172943,0.02585703,0.04052515],"study_design_scores_gemma":[0.00002996662,0.00001839141,0.001003307,0.00002586637,0.00003195118,0.0003580771,0.0001345015,0.01555837,0.002129253,0.957859,0.02284122,0.00001016107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4107027,0.001196475,0.2838908,0.004790829,0.0003806656,0.0004105484,0.007111854,0.001060098,0.2904561],"genre_scores_gemma":[0.8439028,0.0009448166,0.04998803,0.0008826132,0.000221372,0.0002862312,0.007319521,0.0005356858,0.09591893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03034837,"threshold_uncertainty_score":0.1015254,"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","authors":[{"name":"M. M. Shikare","is_ca":false},{"name":"B. N. Waphare","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004613588,0.0006321239,0.0005315347,0.001323204,0.001515218,0.003250468,0.0008124735,0.0008066649,0.01568358],"category_scores_gemma":[0.002245769,0.0004106207,0.0007984597,0.0008316142,0.001468492,0.002415878,0.001387332,0.001807742,0.002095867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008495564,"about_ca_system_score_gemma":0.0004679771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006423405,"about_ca_topic_score_gemma":0.0008785361,"domain_scores_codex":[0.9994975,0.0001063722,0.00003192039,0.0001116955,0.0001676751,0.0000848031],"domain_scores_gemma":[0.9983606,0.0006908196,0.0002669135,0.0002226425,0.0001551872,0.000303854],"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.0001790441,0.00009206702,0.001299035,0.0001059406,0.00002887061,0.0003896863,0.000428218,0.002094766,0.003648272,0.961918,0.009408877,0.0204072],"study_design_scores_gemma":[0.00004388058,0.0000510298,0.001160724,0.00002480728,0.00001549863,0.0008814616,0.0001638841,0.01189144,0.001305236,0.9697083,0.01473535,0.00001849563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6157422,0.00134415,0.234738,0.002263083,0.0004141744,0.0001781326,0.002086083,0.0008950207,0.1423391],"genre_scores_gemma":[0.9362171,0.0005020734,0.024957,0.0002861899,0.0004776256,0.0001378569,0.002309741,0.0002266424,0.03488574],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01568358,"threshold_uncertainty_score":0.05246687,"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","authors":[{"name":"Stefan D. Bruda","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002719095,0.0007508165,0.0006292063,0.0009364996,0.00296355,0.002508862,0.002359544,0.006131178,0.004372972],"category_scores_gemma":[0.02176135,0.0003815237,0.0006598661,0.002151087,0.001842426,0.002165828,0.001034065,0.001550779,0.0008900736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118838,"about_ca_system_score_gemma":0.001543313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00678619,"about_ca_topic_score_gemma":0.007579106,"domain_scores_codex":[0.9970299,0.001195989,0.0001628806,0.0003239718,0.001020097,0.0002671724],"domain_scores_gemma":[0.9752422,0.01673619,0.0009449031,0.003358335,0.003109579,0.0006088303],"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.002492111,0.001889065,0.03393139,0.001685583,0.0002297046,0.0645581,0.006676109,0.3133791,0.02152327,0.1340155,0.032309,0.3873111],"study_design_scores_gemma":[0.0005707201,0.001068096,0.006994089,0.0002068298,0.0002805076,0.0505698,0.00387708,0.690829,0.09371672,0.05712243,0.09454038,0.0002242552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5690624,0.001498657,0.3859501,0.005681025,0.000379511,0.0004820407,0.0003202423,0.002463322,0.03416277],"genre_scores_gemma":[0.8192135,0.000449497,0.1668403,0.0002351736,0.0001012962,0.0001022261,0.0001331016,0.0003746097,0.01255034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00678619,"threshold_uncertainty_score":0.01462907,"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","authors":[{"name":"Pavol Hell","is_ca":true},{"name":"David Kirkpatrick","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003235679,0.001544294,0.002198241,0.001639741,0.001410903,0.003374705,0.003320378,0.002406394,0.01060242],"category_scores_gemma":[0.03054054,0.0008438303,0.001708821,0.002260005,0.002526814,0.007183197,0.005273844,0.005606787,0.002520285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001830673,"about_ca_system_score_gemma":0.002695305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001220133,"about_ca_topic_score_gemma":0.001764538,"domain_scores_codex":[0.995456,0.001046634,0.0003584225,0.001215073,0.001367952,0.0005558844],"domain_scores_gemma":[0.9717876,0.01866377,0.001662006,0.004925051,0.002044175,0.0009173092],"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.001290678,0.0004324352,0.002074638,0.0007235325,0.0001406778,0.0002277372,0.0005748114,0.2064715,0.009926606,0.3266328,0.0162037,0.4353009],"study_design_scores_gemma":[0.0001577989,0.0002002217,0.0002457818,0.00004627506,0.00004470345,0.000220596,0.00009874321,0.4538575,0.005358718,0.5374016,0.00232917,0.00003898023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03717007,0.0002541652,0.9536961,0.0007684045,0.0001630602,0.0001576876,0.0002984232,0.002523664,0.004968463],"genre_scores_gemma":[0.5257197,0.0003898061,0.4621769,0.0006274426,0.0002955845,0.0003619205,0.001895149,0.0006738484,0.007859708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01060242,"threshold_uncertainty_score":0.03546864,"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","authors":[{"name":"Rong Luo","is_ca":false},{"name":"Morgan Warner","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004783488,0.001011324,0.0005626566,0.003025784,0.00160668,0.003281653,0.0008057035,0.0009101706,0.02868042],"category_scores_gemma":[0.00502865,0.0004158865,0.0005410639,0.00258956,0.001600136,0.003886822,0.00252317,0.001644767,0.006889008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009935295,"about_ca_system_score_gemma":0.0004845843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009022867,"about_ca_topic_score_gemma":0.002169232,"domain_scores_codex":[0.9991897,0.000169459,0.00006219404,0.000167462,0.0002309742,0.0001802783],"domain_scores_gemma":[0.9981037,0.0008849258,0.0002284961,0.0002907711,0.0002703985,0.0002216044],"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.0002605268,0.00005251212,0.0008015925,0.0002412735,0.00001691276,0.0008589251,0.000442224,0.002321793,0.005412998,0.9083534,0.009879198,0.07135861],"study_design_scores_gemma":[0.00002598858,0.00005059488,0.0007799721,0.000114473,0.00002190116,0.001153938,0.0002365828,0.01155325,0.004744114,0.9358172,0.04546333,0.0000386029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2247761,0.002997318,0.4046343,0.001561035,0.001121764,0.0001995723,0.001408044,0.001903415,0.3613986],"genre_scores_gemma":[0.7606117,0.002050202,0.09186827,0.000604498,0.0004118086,0.0001928406,0.001823768,0.0007225089,0.1417144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02868042,"threshold_uncertainty_score":0.09594554,"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","authors":[{"name":"Jeremy Levick","is_ca":true},{"name":"Rajesh Pereira","is_ca":true},{"name":"David W. Kribs","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009788148,0.0005825903,0.0006900122,0.001186432,0.00141614,0.002095226,0.001114077,0.0009697755,0.007778321],"category_scores_gemma":[0.006219267,0.0004076,0.0007074219,0.0007034557,0.00237314,0.002739744,0.002290125,0.00118783,0.0015265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009680649,"about_ca_system_score_gemma":0.0006924767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002025924,"about_ca_topic_score_gemma":0.001389481,"domain_scores_codex":[0.9987893,0.0002233039,0.00006960168,0.0002547405,0.0004112211,0.0002517715],"domain_scores_gemma":[0.9972962,0.0009062864,0.0004763476,0.000578476,0.0004534487,0.0002892784],"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.0001773035,0.00003415583,0.002689085,0.00007296778,0.00002051543,0.0001704903,0.0003362648,0.006556146,0.002346075,0.9768212,0.004043823,0.006732032],"study_design_scores_gemma":[0.00003545114,0.00003209563,0.0009857289,0.00001859794,0.00001045188,0.0001081532,0.0001829594,0.03344757,0.00219578,0.9607835,0.002176045,0.00002372076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.867803,0.0002672618,0.06093464,0.001900939,0.0001345185,0.0000244702,0.0006958533,0.0007317322,0.06750768],"genre_scores_gemma":[0.9887705,0.00008322311,0.005638845,0.0001514566,0.00007129619,0.00002436951,0.0004159049,0.00006442819,0.004780011],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007778321,"threshold_uncertainty_score":0.02602106,"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","authors":[{"name":"Rui Hu","is_ca":true},{"name":"Stephen M. Watt","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001026217,0.001076691,0.001690855,0.0008979175,0.0004404719,0.0008413037,0.001238698,0.001344122,0.003187954],"category_scores_gemma":[0.004722906,0.0005917955,0.0005575636,0.001136066,0.001015481,0.001381548,0.001119609,0.0008250292,0.0006028754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008716618,"about_ca_system_score_gemma":0.0006450296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002069696,"about_ca_topic_score_gemma":0.001200694,"domain_scores_codex":[0.9994147,0.0001610181,0.00003265877,0.0001285228,0.0001865545,0.00007660044],"domain_scores_gemma":[0.9981517,0.001260577,0.0001491309,0.0001155299,0.000225669,0.0000973916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002499558,0.00005501635,0.00055373,0.00009471839,0.00001752431,0.00006886114,0.00005294944,0.9469087,0.005045786,0.003531672,0.000658991,0.04276216],"study_design_scores_gemma":[0.00001464256,0.00005481483,0.0001278983,0.000007204487,0.000004566855,0.00001591005,0.00001611499,0.9948848,0.00223176,0.002271612,0.0003648394,0.000005831685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09389579,0.0002849052,0.9023303,0.0001844241,0.00002848464,0.00009794196,0.00009332007,0.0003226712,0.002762153],"genre_scores_gemma":[0.6383872,0.0003753595,0.3546628,0.00007096332,0.00003774945,0.0002991348,0.0002627611,0.0001527633,0.005751207],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003187954,"threshold_uncertainty_score":0.01066476,"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)","authors":[{"name":"Lilian Labelle","is_ca":true},{"name":"Daniel Lauzon","is_ca":true},{"name":"Janusz Konrad","is_ca":true},{"name":"Éric Dubois","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002478366,0.0004174121,0.0002063369,0.000631734,0.0002024365,0.0006384383,0.0006005426,0.0002930729,0.002014236],"category_scores_gemma":[0.0009846695,0.0001118225,0.0001645054,0.0005809003,0.000364181,0.001069427,0.00039301,0.0005105822,0.0005306643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003536884,"about_ca_system_score_gemma":0.0002943439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004935302,"about_ca_topic_score_gemma":0.0006522966,"domain_scores_codex":[0.9998443,0.00002436666,0.000007984565,0.00001831068,0.00009016245,0.00001490172],"domain_scores_gemma":[0.9996111,0.0001123088,0.00005263743,0.00008517579,0.0001251321,0.00001368248],"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.000598756,0.00008428161,0.0003830813,0.0001905506,0.00001778458,0.0002433342,0.0002113022,0.05875431,0.2994349,0.08027559,0.003509489,0.5562967],"study_design_scores_gemma":[0.00005150933,0.0002890016,0.0004459528,0.00005179404,0.00003652809,0.000372936,0.00004983636,0.7004088,0.2638715,0.01483927,0.01954245,0.00004035579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03928195,0.0002746705,0.9559822,0.0001281964,0.00008902111,0.00003919887,0.0001058327,0.0006641281,0.003434701],"genre_scores_gemma":[0.3281077,0.0005317035,0.6637427,0.0001214485,0.000113887,0.0001081916,0.0004435565,0.0001750391,0.006655776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002014236,"threshold_uncertainty_score":0.006738365,"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","authors":[{"name":"Alexandre Blondin Massé","is_ca":true},{"name":"A. Garon","is_ca":true},{"name":"Sebastien Labbé","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002467906,0.0004372679,0.0005180348,0.001329937,0.0008560234,0.003080249,0.0006612338,0.0004179817,0.007613126],"category_scores_gemma":[0.001398015,0.0005253742,0.0004902289,0.001178142,0.001414314,0.001497253,0.001303398,0.00108191,0.0006199804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005132061,"about_ca_system_score_gemma":0.0002179588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006980767,"about_ca_topic_score_gemma":0.0007225082,"domain_scores_codex":[0.9996505,0.00005433936,0.00002408105,0.00008047291,0.0001155907,0.00007509009],"domain_scores_gemma":[0.9990075,0.0004283401,0.000175853,0.0001187332,0.0001040596,0.000165431],"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.0002628496,0.00004631243,0.001666403,0.0001477963,0.00002244124,0.0005037027,0.0004278021,0.008074979,0.01290136,0.9536795,0.00232788,0.01993903],"study_design_scores_gemma":[0.0001063974,0.0001327387,0.003342834,0.00005695799,0.0000503157,0.001352328,0.0008147305,0.03213743,0.009151177,0.9339245,0.01888595,0.00004464178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7921432,0.0006449411,0.09632847,0.0004831035,0.0001313087,0.00005884804,0.0004353035,0.0001962721,0.1095786],"genre_scores_gemma":[0.9678439,0.0003135936,0.01835748,0.0001083851,0.00008659526,0.00007700723,0.0004829935,0.0001033103,0.01262674],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007613126,"threshold_uncertainty_score":0.02546841,"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","authors":[{"name":"Mehdi Niknam","is_ca":true},{"name":"Parimala Thulasiraman","is_ca":true},{"name":"Sergio Camorlinga","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003700991,0.001030923,0.0006876732,0.001186046,0.000970307,0.000823088,0.001639671,0.0006874216,0.006573853],"category_scores_gemma":[0.001158545,0.0005773181,0.0008585492,0.001510303,0.0004986374,0.001085771,0.0008743023,0.001047856,0.002097843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001019457,"about_ca_system_score_gemma":0.00189243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0093756,"about_ca_topic_score_gemma":0.01405311,"domain_scores_codex":[0.9996754,0.00003252584,0.00002309128,0.00007883715,0.0001492613,0.0000408509],"domain_scores_gemma":[0.9995134,0.00009367787,0.00003081771,0.0001044118,0.000220672,0.00003697176],"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.0002440459,0.0001185213,0.000502781,0.000305955,0.0001107382,0.0002487869,0.0002061381,0.09373923,0.06401504,0.02542997,0.02091356,0.7941651],"study_design_scores_gemma":[0.0001015196,0.00008794369,0.000408634,0.00001968925,0.00004489476,0.0002011424,0.00003770407,0.9300061,0.03045537,0.01878912,0.01979963,0.00004831521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003264963,0.00007023827,0.9921892,0.00006650558,0.00004806614,0.00008335347,0.0000512429,0.003165034,0.001061503],"genre_scores_gemma":[0.02370332,0.00006645377,0.9735737,0.00003211892,0.00001859214,0.0001488705,0.0002134611,0.0002658402,0.001977663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0093756,"threshold_uncertainty_score":0.02199173,"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","authors":[{"name":"Yash Sharma","is_ca":true},{"name":"A.B. Phillion","is_ca":true},{"name":"D. Mark Martinez","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006079085,0.0005224182,0.0004143114,0.002068916,0.0004077583,0.001119636,0.0007659824,0.000951246,0.001047014],"category_scores_gemma":[0.001183579,0.0004426242,0.0003905409,0.0009091828,0.0005825432,0.000697955,0.0003616616,0.0005465049,0.0005982218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004277509,"about_ca_system_score_gemma":0.0009481609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001989792,"about_ca_topic_score_gemma":0.005477077,"domain_scores_codex":[0.9996197,0.00003813026,0.00002906793,0.00009611945,0.0001689831,0.00004796744],"domain_scores_gemma":[0.999225,0.0002879746,0.0001089909,0.0001041367,0.0002445482,0.00002934048],"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.0001580273,0.00005641262,0.002278824,0.0002437147,0.00003846999,0.0003247903,0.0002623747,0.01430703,0.8085716,0.001382675,0.0006032129,0.171773],"study_design_scores_gemma":[0.00003235869,0.0001683296,0.02635035,0.00008957538,0.00006506906,0.001702234,0.0002604631,0.2620821,0.6983249,0.002377415,0.008446085,0.0001010113],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.139336,0.0006256458,0.8562203,0.00009530852,0.0000499728,0.0003236382,0.0002766043,0.001563796,0.001508623],"genre_scores_gemma":[0.194269,0.0004416287,0.8032716,0.00004476844,0.00001717223,0.0001358035,0.0003140108,0.0001837203,0.00132238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002068916,"threshold_uncertainty_score":0.003956378,"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","authors":[{"name":"John Mighton","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611453,0.001160177,0.0009533278,0.005003752,0.001495894,0.006082989,0.001603146,0.001542473,0.01246891],"category_scores_gemma":[0.00382027,0.0007436129,0.0009175293,0.004174413,0.002490832,0.006706328,0.002510316,0.003513369,0.001879907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001327436,"about_ca_system_score_gemma":0.0003501938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004566975,"about_ca_topic_score_gemma":0.0004786361,"domain_scores_codex":[0.9989214,0.0002152189,0.00008281363,0.0003015339,0.000330788,0.0001482921],"domain_scores_gemma":[0.9965521,0.001419305,0.0005898986,0.0004713494,0.0004657283,0.0005015405],"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.000058386,0.00005277372,0.0009511702,0.00008507095,0.00001504329,0.0001910409,0.0003789412,0.001791492,0.003150109,0.9634694,0.005713399,0.02414331],"study_design_scores_gemma":[0.00002365679,0.00006949942,0.001326047,0.0000512081,0.00002935604,0.001006349,0.0002464295,0.01975229,0.001539732,0.9541476,0.02177177,0.00003603345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.384307,0.002284104,0.4107734,0.005256337,0.000719886,0.0001871277,0.001913559,0.001053987,0.1935045],"genre_scores_gemma":[0.8837679,0.001708776,0.06814287,0.001270334,0.001789648,0.0002126828,0.00176861,0.0004974006,0.04084184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01246891,"threshold_uncertainty_score":0.04171264,"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","authors":[{"name":"Abdo Y. Alfakih","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001564735,0.001001627,0.0009517572,0.002230409,0.0009884264,0.003366211,0.001375558,0.001258148,0.003838241],"category_scores_gemma":[0.01034775,0.000457585,0.0006422605,0.002517253,0.005852007,0.01017881,0.002696244,0.003890269,0.0008148561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001073639,"about_ca_system_score_gemma":0.0009728256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001491841,"about_ca_topic_score_gemma":0.0008884417,"domain_scores_codex":[0.9988595,0.0003946461,0.00005191184,0.0002474503,0.0002996791,0.0001467285],"domain_scores_gemma":[0.9946412,0.003364636,0.0007046408,0.000355964,0.0005221436,0.000411306],"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.00005308696,0.00002038151,0.000207987,0.00004846409,0.000006510211,0.00004184313,0.0001823134,0.0043703,0.0005577328,0.9831024,0.00115685,0.01025213],"study_design_scores_gemma":[0.000007081896,0.00001857332,0.0001498749,0.00001293106,0.000002998223,0.00006206905,0.0000493763,0.01207971,0.0001251335,0.986352,0.0011259,0.00001434619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2435327,0.007094574,0.6943358,0.005762155,0.0004897792,0.00004972866,0.000647266,0.0001658957,0.04792211],"genre_scores_gemma":[0.9155344,0.007940884,0.05294463,0.0007992079,0.001783498,0.0001118097,0.0006605723,0.0001647885,0.02006016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003838241,"threshold_uncertainty_score":0.01284021,"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","authors":[{"name":"Michael Birsak","is_ca":false},{"name":"Florian Rist","is_ca":false},{"name":"Peter Wonka","is_ca":true},{"name":"Przemysław Musialski","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000439253,0.0005966671,0.0007021871,0.0006840462,0.0004914325,0.00131297,0.001571989,0.0008380648,0.007792911],"category_scores_gemma":[0.001251918,0.0005393611,0.001095326,0.0004777204,0.001432331,0.001488893,0.001577242,0.001207122,0.001323549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005091803,"about_ca_system_score_gemma":0.000466554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008471742,"about_ca_topic_score_gemma":0.001103034,"domain_scores_codex":[0.9995824,0.00006974323,0.00002060878,0.0001083752,0.0001843791,0.00003455907],"domain_scores_gemma":[0.9994488,0.0002081656,0.00004864796,0.0001897644,0.00007244495,0.00003215173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002102542,0.000143532,0.0006990915,0.0005964348,0.0001064694,0.0004010727,0.0003779467,0.4053487,0.09783816,0.192905,0.006834104,0.2945392],"study_design_scores_gemma":[0.00002481388,0.00005617658,0.0001816447,0.00002174289,0.00001167418,0.000116822,0.00004628307,0.9324134,0.02143148,0.0344735,0.01120328,0.00001910922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008295042,0.00006085293,0.9870515,0.00008196072,0.0000335032,0.00003879493,0.00003685321,0.0010339,0.003367686],"genre_scores_gemma":[0.1276011,0.000106112,0.8690811,0.0000719878,0.00002378574,0.00007948271,0.0001165953,0.0004018957,0.002518036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007792911,"threshold_uncertainty_score":0.02606994,"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","authors":[{"name":"Mohammed Khachan","is_ca":false},{"name":"Patrick Chenin","is_ca":false},{"name":"Hafsa Deddi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001332882,0.0003462376,0.0004573676,0.001917023,0.0005678185,0.001348366,0.0008619628,0.0006561836,0.00430134],"category_scores_gemma":[0.00119382,0.0002879839,0.0003710494,0.002375111,0.0006750134,0.001331096,0.0005977258,0.0007744782,0.0008816121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004411484,"about_ca_system_score_gemma":0.0003904717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005377029,"about_ca_topic_score_gemma":0.006093443,"domain_scores_codex":[0.9996791,0.00006273993,0.00002056852,0.0001016859,0.0001093539,0.00002653563],"domain_scores_gemma":[0.9995969,0.0001351532,0.0000877424,0.00005154746,0.00009558014,0.00003321106],"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.000145761,0.0001431689,0.001461298,0.0002602997,0.00002336595,0.0003882468,0.0003567763,0.193749,0.01228423,0.5042586,0.007865579,0.2790636],"study_design_scores_gemma":[0.00001216797,0.00004129476,0.001357449,0.00003518747,0.00001718766,0.0003342151,0.0002354803,0.7059991,0.002482635,0.2776967,0.01175942,0.00002916298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05254106,0.0003369852,0.9362974,0.0003088607,0.00009788627,0.00008000597,0.0006145434,0.000333515,0.009389705],"genre_scores_gemma":[0.5973217,0.001182097,0.3838293,0.0002228339,0.0001366983,0.0002893467,0.001576929,0.0001951535,0.0152459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005377029,"threshold_uncertainty_score":0.0143894,"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","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"Sacha Varone","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001765241,0.001107555,0.002576815,0.001850431,0.001270654,0.003276506,0.00274924,0.00369659,0.008422522],"category_scores_gemma":[0.01054899,0.0008081875,0.0009458452,0.002759542,0.002152262,0.005361264,0.003224429,0.003019236,0.001037732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001134002,"about_ca_system_score_gemma":0.001000671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001520186,"about_ca_topic_score_gemma":0.001156346,"domain_scores_codex":[0.9983087,0.0005187082,0.00008461423,0.0004709394,0.0004863954,0.0001306543],"domain_scores_gemma":[0.996614,0.002181519,0.0002577551,0.0004084478,0.0003078829,0.0002303529],"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.0005799057,0.0002583948,0.001965544,0.000796431,0.0002303725,0.000329171,0.0003819909,0.1497023,0.004288272,0.4680984,0.04196069,0.3314085],"study_design_scores_gemma":[0.0001160816,0.0001371741,0.0009507761,0.00008436309,0.00005497212,0.0003727798,0.0001534327,0.2998327,0.001617991,0.681016,0.01562874,0.00003502942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07263685,0.003308772,0.908535,0.00263903,0.0002398012,0.0002029311,0.001095084,0.000446252,0.0108963],"genre_scores_gemma":[0.5335919,0.003312802,0.4368418,0.0007972296,0.0009123866,0.0006278605,0.005113154,0.000560881,0.01824204],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008422522,"threshold_uncertainty_score":0.02817613,"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","authors":[{"name":"Alexander C. Loui","is_ca":true},{"name":"A.N. Venetsanopoulos","is_ca":true},{"name":"K.C. Smith","is_ca":true},{"name":"B. Benhabib","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002440501,0.0005175726,0.0002216502,0.0003979027,0.0003740232,0.0006072738,0.000917654,0.0004679652,0.006581093],"category_scores_gemma":[0.0004789855,0.0002712226,0.0003375008,0.0006204235,0.0003214559,0.001074175,0.0003982252,0.0004768196,0.002063845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005403839,"about_ca_system_score_gemma":0.000676164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005146509,"about_ca_topic_score_gemma":0.00160391,"domain_scores_codex":[0.9998302,0.00002540209,0.00001282555,0.00003127265,0.00007821478,0.00002195543],"domain_scores_gemma":[0.9997908,0.0000513641,0.00002714846,0.0000388322,0.00007923799,0.00001251389],"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.0003101689,0.0001217,0.0007610235,0.0007805228,0.00006226535,0.000471568,0.0001582989,0.02987524,0.3535203,0.1057791,0.01216768,0.4959922],"study_design_scores_gemma":[0.0001304896,0.0008792437,0.001848728,0.00008887162,0.0001069266,0.001507823,0.00006423197,0.6381539,0.2039895,0.04730762,0.1058513,0.00007137665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01201158,0.0005593602,0.9798694,0.0001841863,0.000094165,0.00009245992,0.00009191387,0.001088314,0.006008598],"genre_scores_gemma":[0.1940355,0.001186222,0.7870175,0.0001679327,0.0001082299,0.0002026003,0.0005242974,0.00012832,0.0166294],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006581093,"threshold_uncertainty_score":0.02201599,"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","authors":[{"name":"Srečko Brlek","is_ca":true},{"name":"Michel Koskas","is_ca":false},{"name":"Xavier Provençal","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451856,0.002438256,0.001627592,0.004410553,0.001977002,0.003759074,0.003543975,0.002177872,0.03090572],"category_scores_gemma":[0.006975184,0.0008403711,0.001692173,0.004383046,0.001331135,0.004295948,0.003043299,0.002445904,0.009595045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00219721,"about_ca_system_score_gemma":0.004750612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01496854,"about_ca_topic_score_gemma":0.02449514,"domain_scores_codex":[0.9975283,0.0003443405,0.0002203883,0.0007164224,0.0009158744,0.0002747233],"domain_scores_gemma":[0.9967435,0.001760095,0.0002346988,0.000553821,0.0005233071,0.0001846708],"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.0007734385,0.0004410012,0.001377075,0.0005828763,0.0001497763,0.0002001832,0.0002907709,0.03766296,0.01322587,0.02473342,0.04447063,0.876092],"study_design_scores_gemma":[0.0005495506,0.0005808696,0.001950969,0.0001211113,0.00016942,0.0009580388,0.0006823498,0.8407074,0.03062294,0.08581724,0.03767016,0.0001699622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008390922,0.000484069,0.9714149,0.0004904734,0.0001645422,0.0003271856,0.0008141331,0.01266779,0.00524603],"genre_scores_gemma":[0.04542562,0.0002298236,0.9443609,0.0001233167,0.00006954546,0.0003737082,0.002652686,0.0005542847,0.006210154],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03090572,"threshold_uncertainty_score":0.1033899,"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)","authors":[{"name":"Valérie Berthé","is_ca":false},{"name":"Sebastien Labbé","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002652816,0.0007405176,0.0004956899,0.001816023,0.001096874,0.003328619,0.001565426,0.0007129452,0.009827155],"category_scores_gemma":[0.0009986178,0.0004014259,0.0007211912,0.002127292,0.002938148,0.00279979,0.00113824,0.002949278,0.001765939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001143313,"about_ca_system_score_gemma":0.000388456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00113147,"about_ca_topic_score_gemma":0.001064218,"domain_scores_codex":[0.9997572,0.0000614304,0.00001535041,0.00004068713,0.0001003635,0.00002487814],"domain_scores_gemma":[0.9997695,0.00009777083,0.00002457161,0.00002986341,0.00005420215,0.00002406371],"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.000006925389,0.000006779507,0.00002398788,0.00002670822,0.000002292729,0.0000260578,0.00006960014,0.001735558,0.000337635,0.98349,0.001523938,0.01275054],"study_design_scores_gemma":[0.000005322429,0.000008162767,0.00005299806,0.00001138456,0.000003146019,0.00008375581,0.00004732587,0.007296261,0.000196449,0.9747791,0.01750904,0.000007124371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02518973,0.004335604,0.736797,0.002002127,0.001103746,0.00006153614,0.0003187007,0.0004588138,0.2297328],"genre_scores_gemma":[0.468488,0.006654772,0.4480754,0.0008493635,0.00166274,0.0002023386,0.0005035845,0.0003212676,0.0732426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009827155,"threshold_uncertainty_score":0.03287512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}