{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":8,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":8,"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":"811b3a9bd0ec","filters":{"venue":"Reliable Computing"}},"results":[{"id":"W181038668","doi":"10.1023/a:1014798618404","title":"An Effective High-Order Interval Method for Validating Existence and Uniqueness of the Solution of an IVP for an ODE","year":2001,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McMaster University","funders":"Information Technology Research Centre","keywords":"A priori and a posteriori; Interval (graph theory); Uniqueness; Ordinary differential equation; Mathematics; Initial value problem; Enclosure; Computer science; Mathematical optimization; Applied mathematics; Differential equation; Algorithm; Mathematical analysis; Combinatorics","authors":[{"name":"Nedialko S. Nedialkov","is_ca":true},{"name":"Kenneth R. Jackson","is_ca":true},{"name":"John D. Pryce","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03066109418581418,"gpt":0.3572135145938523,"spread":0.3265524204080381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00186451,0.0005299056,0.0007252041,0.0007274186,0.0006015647,0.0009241389,0.00148933,0.001110762,0.002400133],"category_scores_gemma":[0.005458275,0.0002791918,0.0006304113,0.0004104624,0.0012463,0.001085174,0.001213717,0.001467925,0.0003087985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004264119,"about_ca_system_score_gemma":0.0008832511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001374112,"about_ca_topic_score_gemma":0.0009644162,"domain_scores_codex":[0.9991873,0.0002680305,0.00003711384,0.00007522175,0.0003775581,0.00005475621],"domain_scores_gemma":[0.9977323,0.001259038,0.0001596249,0.0003622744,0.0003941947,0.00009260891],"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.0003085218,0.000155375,0.00159557,0.000388103,0.0000746643,0.0002479795,0.000284014,0.686672,0.03748213,0.1737099,0.001226782,0.09785501],"study_design_scores_gemma":[0.000007612843,0.00004918037,0.00009649935,0.000009422238,0.000006218763,0.00002081574,0.00000896075,0.9923366,0.002369498,0.004427173,0.0006599687,0.000008094145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01386938,0.00008717786,0.9831087,0.00003932811,0.0000525515,0.00003640733,0.00002012787,0.0001954444,0.002590775],"genre_scores_gemma":[0.4417913,0.0001704758,0.5557231,0.00007034423,0.00003981084,0.0001589358,0.00007341794,0.000113683,0.001859052],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002400133,"threshold_uncertainty_score":0.009860575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056331670","doi":"10.1007/s11155-006-9020-7","title":"Requirements Analysis for Engineering Computation: A Systematic Approach for Improving Reliability","year":2006,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Documentation; Computer science; Software requirements specification; Software engineering; Requirements engineering; System requirements specification; Requirements analysis; Reliability (semiconductor); Computation; Reliability engineering; Functional specification; Argument (complex analysis); Software; Software system; Systems engineering; Programming language; Software construction; Engineering","authors":[{"name":"Spencer Smith","is_ca":true},{"name":"Lei Lai","is_ca":true},{"name":"Ridha Khédri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02422770441222972,"gpt":0.278808969988708,"spread":0.2545812655764783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01029806,0.003098271,0.002271418,0.006372975,0.00175068,0.004177903,0.004089039,0.001860455,0.003128074],"category_scores_gemma":[0.04258114,0.001975577,0.003492882,0.002999874,0.002889107,0.004937381,0.003020371,0.004280911,0.001879822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002168106,"about_ca_system_score_gemma":0.008734155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004349703,"about_ca_topic_score_gemma":0.00559356,"domain_scores_codex":[0.9801959,0.008114326,0.001061332,0.001195284,0.009048245,0.0003848881],"domain_scores_gemma":[0.9702106,0.01549634,0.001455541,0.00611016,0.006488417,0.0002389278],"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.0001094893,0.0004673331,0.002282137,0.003477117,0.0003919406,0.0004189287,0.001881821,0.0767699,0.02251102,0.2498228,0.01085759,0.6310099],"study_design_scores_gemma":[0.0001351708,0.0003148129,0.001425031,0.002095142,0.0005067249,0.0006937684,0.0009274741,0.4657062,0.03778306,0.4190716,0.07109014,0.0002508419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001648223,0.0005680886,0.9941171,0.000478788,0.00002819207,0.0002931507,0.00008678519,0.0005386432,0.002241043],"genre_scores_gemma":[0.02208466,0.0008914241,0.975176,0.0001587888,0.00004437445,0.0003214591,0.0002276883,0.0002742938,0.0008212916],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01029806,"threshold_uncertainty_score":0.05446202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152750350","doi":"10.1023/a:1025888503247","title":"Dependable Handling of Uncertainty","year":2003,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Work (physics); Field (mathematics); Risk analysis (engineering); Engineering; Mathematics; Business","authors":[{"name":"Daniel Berleant","is_ca":false},{"name":"M.-P. Cheong","is_ca":false},{"name":"Chris Chu","is_ca":false},{"name":"Yong Guan","is_ca":false},{"name":"Ahmed E. Kamal","is_ca":false},{"name":"Gerald Shedblé","is_ca":false},{"name":"Scott Ferson","is_ca":false},{"name":"James F. Peters","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007072172241935242,"gpt":0.2046368574255798,"spread":0.1975646851836446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244603,0.000721874,0.0009078796,0.0007647864,0.0006723381,0.002261774,0.001596344,0.001099492,0.003433403],"category_scores_gemma":[0.007762729,0.0004610553,0.0006824782,0.0008662525,0.001627014,0.003447372,0.00243877,0.002558331,0.0007610632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007411127,"about_ca_system_score_gemma":0.0006875113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001051847,"about_ca_topic_score_gemma":0.0007006203,"domain_scores_codex":[0.9982266,0.0003162775,0.0000942425,0.000261045,0.0009400141,0.0001618575],"domain_scores_gemma":[0.996002,0.001796049,0.0002773747,0.00132133,0.0005126609,0.00009049934],"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.0002457867,0.00004864455,0.0004125681,0.0003093371,0.00008596652,0.0005023982,0.0004600451,0.1886498,0.01440451,0.6102688,0.006910625,0.1777015],"study_design_scores_gemma":[0.0000212447,0.00005617409,0.0002018407,0.00004315836,0.00002867905,0.0001250566,0.00004458781,0.5058117,0.00711413,0.4742106,0.01231761,0.00002517045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01279914,0.00162643,0.9731433,0.0006934993,0.0002276745,0.00003108244,0.000104021,0.0005438912,0.01083096],"genre_scores_gemma":[0.8694707,0.003059522,0.1134408,0.0003537015,0.0006988901,0.0001444882,0.0003819703,0.0003261944,0.01212368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003433403,"threshold_uncertainty_score":0.01148587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W136659167","doi":"10.1023/a:1009934225596","title":"Exact Computation of Delaunay and Power Triangulations","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Delaunay triangulation; Computation; Algorithm; Floating point; Sign (mathematics); Rounding; Mathematics; Computer science","authors":[{"name":"Marina L. Gavrilova","is_ca":true},{"name":"H. Ratschek","is_ca":false},{"name":"Jon Rokne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01164632325023962,"gpt":0.2538830938771656,"spread":0.2422367706269259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000886515,0.0004940376,0.0008946285,0.001202633,0.0008053795,0.001237584,0.001327271,0.0008223327,0.006144102],"category_scores_gemma":[0.01092472,0.00056298,0.0004274984,0.001137508,0.001366219,0.002459754,0.00190322,0.0006894991,0.0007616027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008727504,"about_ca_system_score_gemma":0.00070894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002588628,"about_ca_topic_score_gemma":0.004886491,"domain_scores_codex":[0.9992983,0.0001134723,0.00002776671,0.0000815692,0.0004066779,0.00007215599],"domain_scores_gemma":[0.9975712,0.001173865,0.000122149,0.0005515526,0.0004970217,0.00008429336],"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.0002183791,0.00002438869,0.001317326,0.000230294,0.00002942539,0.0002251482,0.0005100708,0.6103047,0.003156082,0.2212128,0.002883427,0.1598881],"study_design_scores_gemma":[0.00001500129,0.00001701315,0.0001891926,0.00001479991,0.000006485408,0.00007078591,0.00006388446,0.9328473,0.002028336,0.06238889,0.002348831,0.00000946268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05139966,0.0003688382,0.937351,0.0001517963,0.00007100715,0.00003443178,0.0001059509,0.0005451719,0.009972241],"genre_scores_gemma":[0.7207799,0.00033083,0.2737489,0.00003739813,0.00003906967,0.00006425811,0.0001561448,0.0003877441,0.004455748],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006144102,"threshold_uncertainty_score":0.02055407,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1544671383","doi":"10.1023/a:1009942122633","title":"Effective Computation of Rational Approximants and Interpolants","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"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":"Computation; Symbolic computation; Mathematics; Path (computing); Vandermonde matrix; Toeplitz matrix; Polynomial; Algorithm; Computer science; Pure mathematics","authors":[{"name":"Bernhard Beckermann","is_ca":false},{"name":"George Labahn","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006351138298687647,"gpt":0.2388861123183852,"spread":0.2325349740196976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00190304,0.0009684612,0.001285264,0.001606483,0.000842591,0.002512362,0.001536916,0.0009904904,0.00412814],"category_scores_gemma":[0.009361921,0.0005016061,0.0005427377,0.001487694,0.002474972,0.003216694,0.001727949,0.002248417,0.001008303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009883567,"about_ca_system_score_gemma":0.0007438585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008457341,"about_ca_topic_score_gemma":0.001195057,"domain_scores_codex":[0.998828,0.0003653424,0.00004663997,0.00009962858,0.0005550634,0.00010531],"domain_scores_gemma":[0.9979469,0.0009994111,0.0001106315,0.0004860289,0.0003546176,0.0001023535],"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.00008255195,0.00002040173,0.0001490161,0.0001024443,0.00002003109,0.00006596338,0.000130918,0.04506365,0.001804649,0.9163501,0.001472517,0.03473774],"study_design_scores_gemma":[0.00001987236,0.00002846069,0.00008035048,0.0000343868,0.00001716297,0.00004831161,0.00004445482,0.4171368,0.003995918,0.5742763,0.004298562,0.00001941261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03269437,0.001157103,0.951582,0.0003220589,0.0003312502,0.00002861349,0.00005115561,0.000447255,0.01338626],"genre_scores_gemma":[0.6994615,0.001495235,0.2876559,0.0001476597,0.0003448617,0.00008672406,0.0001337386,0.0005463609,0.01012807],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00412814,"threshold_uncertainty_score":0.01380998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W227382844","doi":"10.1023/a:1009950630139","title":"Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Hull; Correctness; Completeness (order theory); Computer science; Testbed; Java applet; Property (philosophy); Interval arithmetic; Java; Mathematics; Interval (graph theory); Algorithm; Calculus (dental); Discrete mathematics; Programming language; Combinatorics; Mathematical analysis","authors":[{"name":"Timothy J. Hickey","is_ca":false},{"name":"Zhe Qju","is_ca":true},{"name":"M. H. van Emden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03498348181789564,"gpt":0.3330606291159964,"spread":0.2980771472981008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001135324,0.001392564,0.001137182,0.001582931,0.0007706713,0.002414947,0.001946909,0.001253964,0.03574486],"category_scores_gemma":[0.009786787,0.0005713317,0.0006799431,0.001607871,0.0008804284,0.002251226,0.00403132,0.001779148,0.002099984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005227804,"about_ca_system_score_gemma":0.0007463856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002606807,"about_ca_topic_score_gemma":0.003843365,"domain_scores_codex":[0.9994439,0.0001640616,0.00003628116,0.00006766161,0.0002287747,0.00005925926],"domain_scores_gemma":[0.9938089,0.004878816,0.0001613695,0.0005796661,0.0003342858,0.0002369155],"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.00211808,0.0002389472,0.002197942,0.001956392,0.0001090599,0.001647203,0.004820456,0.0775024,0.05985531,0.1508134,0.05873417,0.6400067],"study_design_scores_gemma":[0.0002918872,0.0001520785,0.001049977,0.0003899611,0.000070801,0.0005092541,0.0005597603,0.7778536,0.0390454,0.1007128,0.07923105,0.0001334402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01460264,0.0001856774,0.9604747,0.0002683745,0.00006140644,0.00010995,0.0006466364,0.01661079,0.007039871],"genre_scores_gemma":[0.2019586,0.000419466,0.786027,0.0001926702,0.00006386551,0.0003741405,0.0009256392,0.006472318,0.003566345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03574486,"threshold_uncertainty_score":0.1195784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W204457991","doi":"10.1023/a:1009984921053","title":"Introduction to the Special Issue: What Can One Learn from Box-Plane Intersections?","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Wildlife-Road Interactions and Conservation","field":"Environmental Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mathematics","authors":[{"name":"H. Ratschek","is_ca":false},{"name":"Jon Rokne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008658628500872595,"gpt":0.2132866465933397,"spread":0.2046280180924671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002131772,0.001450751,0.001973127,0.001472758,0.001844784,0.005072786,0.001814607,0.005710454,0.02747805],"category_scores_gemma":[0.0147771,0.0005384473,0.0010671,0.001345175,0.001988506,0.007862731,0.002017601,0.008525511,0.01453675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009062212,"about_ca_system_score_gemma":0.001100907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00132378,"about_ca_topic_score_gemma":0.002610262,"domain_scores_codex":[0.9992535,0.0001935661,0.00008752207,0.0001612237,0.0002423037,0.00006186536],"domain_scores_gemma":[0.9863521,0.007660391,0.0003984593,0.0006131326,0.003661689,0.001314311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001946087,0.00001744308,0.0001758523,0.0001981585,0.000009228923,0.00006659835,0.00006063149,0.0001541917,0.00008944821,0.004791856,0.960294,0.03412305],"study_design_scores_gemma":[0.00001173286,0.00004173921,0.0005754619,0.000391303,0.00002423671,0.0003654035,0.0002510467,0.0007270466,0.0001147483,0.02422045,0.9732454,0.00003136398],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0007695353,0.07565924,0.01701482,0.2648095,0.6164606,0.00006899158,0.0005045679,0.0004287562,0.02428393],"genre_scores_gemma":[0.006995175,0.06271328,0.006326271,0.06391515,0.8065493,0.0000980995,0.0006505279,0.000474798,0.05227745],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.02747805,"threshold_uncertainty_score":0.09192318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W37962542","doi":"10.1023/a:1009942427413","title":"Removing Degeneracies by Perturbing the Problem or Perturbing the World","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 Hospital","funders":"","keywords":"Delaunay triangulation; Euclidean geometry; Triangulation; Computational geometry; Bowyer–Watson algorithm; Mathematics; Simple (philosophy); Computer science; Algorithm; Geometry","authors":[{"name":"Pierre Alliez","is_ca":false},{"name":"Olivier Devillers","is_ca":false},{"name":"Jack Snoeyink","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01349828443541153,"gpt":0.2410837018505813,"spread":0.2275854174151698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395853,0.001027051,0.001575644,0.001100847,0.001502384,0.001880099,0.001748218,0.001763823,0.009327163],"category_scores_gemma":[0.009495059,0.0007556846,0.0008757372,0.0008708535,0.00253477,0.004015755,0.00556536,0.002783308,0.001820992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000594956,"about_ca_system_score_gemma":0.0008157608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006463148,"about_ca_topic_score_gemma":0.0007484911,"domain_scores_codex":[0.9990909,0.0002302126,0.00006081849,0.0001946277,0.0003175921,0.0001057503],"domain_scores_gemma":[0.9978435,0.0004888633,0.0002074255,0.001157433,0.0001374828,0.0001652178],"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.0003668332,0.0002876414,0.002188842,0.0005728449,0.0001454892,0.0004811205,0.0005134584,0.2636477,0.03541937,0.5854529,0.005154348,0.1057695],"study_design_scores_gemma":[0.00006752297,0.000126573,0.0004392119,0.00008353079,0.00004958517,0.0003222391,0.0002342393,0.4221317,0.00671229,0.5520954,0.01769712,0.00004064786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07920422,0.0006623173,0.8844936,0.001833212,0.0006746365,0.0001427072,0.0002060005,0.0005623504,0.03222091],"genre_scores_gemma":[0.6114871,0.001321141,0.3722138,0.001241659,0.0002288129,0.0002959575,0.0003804609,0.001059388,0.01177165],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009327163,"threshold_uncertainty_score":0.0312025,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}