{"meta":{"query_hash":"40f29b27c88c","filters":{"venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)"},"cohort_total":463,"direct_labels_cover":0,"predictions_cover":463,"exported":463,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/40f29b27c88c","api":"https://metacan.xera.ac/api/v1/cohort?venue=DROPS+%28Schloss+Dagstuhl+%E2%80%93+Leibniz+Center+for+Informatics%29"},"results":[{"id":"W1484385501","doi":"10.4230/lipics.tqc.2013.80","title":"Dequantizing Read-once Quantum Formulas","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Toffoli gate; Qubit; Quantum circuit; Quantum gate; Quantum; Mathematics; Quantum computer; Quantum algorithm; Discrete mathematics; Quantum error correction; Computer science; Quantum mechanics; Physics","score_opus":0.018988195329939568,"score_gpt":0.26012099073690825,"score_spread":0.2411327954069687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484385501","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23240983,0.00088518934,0.7137057,0.002009888,0.00035493175,0.00010987223,0.00037268436,0.0008014354,0.049350433],"genre_scores_gemma":[0.88160175,0.0006194247,0.10580759,0.00082878734,0.00021435558,0.00016036052,0.00028550735,0.0002673689,0.010214856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983298,0.00035127965,0.00010788836,0.00030841058,0.00062551943,0.00027702356],"domain_scores_gemma":[0.99633896,0.0013830367,0.00030303746,0.0013427081,0.0005178023,0.00011444212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015281112,0.00055692776,0.0008950927,0.0008037665,0.0009647549,0.0035516177,0.0016867666,0.0013341316,0.004940894],"category_scores_gemma":[0.0060812677,0.00047587813,0.0010696974,0.00080203085,0.00390174,0.009700869,0.003555346,0.0041177026,0.00044452486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003990698,0.000026032683,0.00011815176,0.00004508768,0.000007813746,0.000071556744,0.000176583,0.0032856748,0.0030214058,0.98564106,0.00048725455,0.0070794416],"study_design_scores_gemma":[0.00002214374,0.000031051164,0.000072631534,0.000019407986,0.000014905164,0.00008495958,0.000081157654,0.034529384,0.0064630946,0.95556813,0.0030960904,0.000016991706],"about_ca_topic_score_codex":0.0010106383,"about_ca_topic_score_gemma":0.0013006738,"teacher_disagreement_score":0.004940894,"about_ca_system_score_codex":0.0013709442,"about_ca_system_score_gemma":0.0008198141,"threshold_uncertainty_score":0.016528964},"labels":[],"label_agreement":null},{"id":"W1499762049","doi":"10.4230/dfu.vol6.12191.21","title":"Pathfinding in Games","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Workgroup; Testbed; Computer science; Human–computer interaction; Toolbox; Artificial intelligence; World Wide Web; Shortest path problem; Theoretical computer science; Programming language","score_opus":0.020529046347228297,"score_gpt":0.2652369112787808,"score_spread":0.2447078649315525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499762049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04325051,0.005669332,0.70109147,0.008940444,0.00049610646,0.00041708976,0.0006656462,0.0015981207,0.23787121],"genre_scores_gemma":[0.55513173,0.005848275,0.38719705,0.00096992956,0.00017089296,0.0007793811,0.001197469,0.00049437216,0.04821096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987987,0.0005944091,0.00007458259,0.000237011,0.00018603916,0.00010937054],"domain_scores_gemma":[0.9987413,0.0006890683,0.00010400786,0.00014314249,0.00015696064,0.00016553923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082240516,0.0011389225,0.00066518993,0.0009697414,0.0019720956,0.0045330017,0.0014070187,0.001986162,0.015308424],"category_scores_gemma":[0.0056139156,0.0004782061,0.0007978475,0.0008599607,0.003664828,0.0066198753,0.004355549,0.001795332,0.002126207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007176461,0.000042748074,0.00054009905,0.00034974664,0.00003304566,0.00013132983,0.002056466,0.024182154,0.00074517354,0.9015218,0.010851072,0.059474546],"study_design_scores_gemma":[0.000048023034,0.00006713354,0.0005031612,0.00025263958,0.000027360406,0.00022518409,0.0017942254,0.057005364,0.0008488486,0.7255393,0.21365029,0.000038376977],"about_ca_topic_score_codex":0.008085561,"about_ca_topic_score_gemma":0.008027293,"teacher_disagreement_score":0.015308424,"about_ca_system_score_codex":0.0018361554,"about_ca_system_score_gemma":0.0018175079,"threshold_uncertainty_score":0.051211715},"labels":[],"label_agreement":null},{"id":"W1502375285","doi":"10.4230/lipics.stacs.2011.380","title":"A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times","year":2011,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; University of Waterloo","funders":"","keywords":"Preemption; Job shop scheduling; Computer science; Scheduling (production processes); Schedule; Algorithm; Processor scheduling; Computational complexity theory; Time complexity; Parallel computing; Mathematical optimization; Mathematics; Operating system","score_opus":0.029408539778234634,"score_gpt":0.2561213773527595,"score_spread":0.2267128375745249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502375285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003663323,0.00038630512,0.9931324,0.00018205556,0.00010832495,0.00010918101,0.00009423488,0.00089067995,0.0014335508],"genre_scores_gemma":[0.028930556,0.0002526096,0.96845466,0.00008022478,0.000077266726,0.0003416566,0.00032166913,0.00014016757,0.0014013124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989367,0.0002708101,0.000065029446,0.00023944418,0.00034248718,0.00014553513],"domain_scores_gemma":[0.9985709,0.0008235636,0.000085157866,0.00020365519,0.00024727383,0.000069483474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020084297,0.0018558388,0.0013492987,0.0012049956,0.0012271573,0.0015594874,0.0021597545,0.0023214226,0.0047554616],"category_scores_gemma":[0.004299118,0.0008695492,0.0010985761,0.0020483336,0.00083173305,0.0033479629,0.0017857042,0.0022757333,0.0019426588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046810866,0.00028082114,0.0005495139,0.0004875388,0.00012172602,0.00017298282,0.00018701208,0.29681537,0.009288555,0.055623487,0.017382286,0.6186226],"study_design_scores_gemma":[0.00042624885,0.0002314175,0.0003424065,0.000054113272,0.000042005347,0.00022167023,0.000043501972,0.8942625,0.004072484,0.081807494,0.018449804,0.0000463877],"about_ca_topic_score_codex":0.0019787806,"about_ca_topic_score_gemma":0.0026426506,"teacher_disagreement_score":0.0047554616,"about_ca_system_score_codex":0.0012681464,"about_ca_system_score_gemma":0.0028030335,"threshold_uncertainty_score":0.015908599},"labels":[],"label_agreement":null},{"id":"W1537398137","doi":"10.4230/lipics.rta.2011.21","title":"Automated Certified Proofs with CiME3","year":2011,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Mathematical proof; Proof assistant; Rewriting; Computer science; Programming language; Certification; Scripting language; Automated theorem proving; Automation; Confluence; Mathematics; Engineering","score_opus":0.0355182454461572,"score_gpt":0.25757044018515357,"score_spread":0.22205219473899637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537398137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035291852,0.00035206316,0.9307411,0.0005841316,0.00020381002,0.00016768857,0.00080739794,0.048058704,0.015555984],"genre_scores_gemma":[0.13672748,0.0005264686,0.8367413,0.0005966524,0.00018801252,0.00043710473,0.0025954414,0.00824276,0.013944762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935607,0.0019130122,0.00044985104,0.00096628483,0.0026400576,0.00047007887],"domain_scores_gemma":[0.98992133,0.0039619715,0.0004267832,0.0046367366,0.0008639101,0.0001892725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053136973,0.00081692915,0.00077651086,0.0015171343,0.00078122126,0.0034851148,0.0027271619,0.0014381072,0.024216307],"category_scores_gemma":[0.019089943,0.0012042996,0.002031514,0.0010954014,0.0021123406,0.0038666977,0.005336081,0.0029296055,0.0076600946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004884056,0.00019313749,0.0013106135,0.0011763633,0.00019665362,0.0010280999,0.00092944305,0.031885035,0.023341302,0.6444481,0.058450654,0.23655228],"study_design_scores_gemma":[0.00034267412,0.000092802,0.00046105793,0.00023519572,0.00009446501,0.0012710621,0.00007809043,0.17133062,0.065382384,0.2623306,0.4982189,0.00016211806],"about_ca_topic_score_codex":0.001517231,"about_ca_topic_score_gemma":0.0016967019,"teacher_disagreement_score":0.024216307,"about_ca_system_score_codex":0.0013761865,"about_ca_system_score_gemma":0.0015490405,"threshold_uncertainty_score":0.08101159},"labels":[],"label_agreement":null},{"id":"W1554455557","doi":"10.4230/lipics.ccc.2018.15","title":"Hardness of Function Composition for Semantic Read once Branching Programs","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tree (set theory); Branching (polymer chemistry); Bottleneck; Computer science; Argument (complex analysis); Upper and lower bounds; Discrete mathematics; Mathematics; Theoretical computer science; Tree traversal; Combinatorics; Algorithm","score_opus":0.03285590300738768,"score_gpt":0.2686928816787141,"score_spread":0.2358369786713264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554455557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46847695,0.0011573527,0.47993022,0.0073795873,0.00013094702,0.00030119295,0.0009816869,0.0044297944,0.03721228],"genre_scores_gemma":[0.87940794,0.0006614231,0.10291629,0.0009074635,0.00032287417,0.00043908917,0.0014305247,0.0014856716,0.012428686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915633,0.0019422893,0.0004148866,0.0018598442,0.0024150794,0.0018044837],"domain_scores_gemma":[0.96742666,0.026462445,0.0012903578,0.0028244022,0.0009848105,0.0010113221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004598851,0.0014292083,0.0025042621,0.0014408112,0.003336552,0.007527177,0.003195694,0.0033210183,0.01592088],"category_scores_gemma":[0.027231624,0.0012837254,0.0039771744,0.0018902824,0.0050929543,0.018488975,0.0054424694,0.008417338,0.0021472047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025845405,0.0007935484,0.007448905,0.0014145585,0.00025908567,0.0009191177,0.0025447549,0.1667967,0.03079724,0.7006916,0.008696602,0.0770534],"study_design_scores_gemma":[0.00015482823,0.00009184763,0.0007328376,0.000050337898,0.00012270521,0.00030291846,0.0002602168,0.28633818,0.013584223,0.6946903,0.0036213074,0.000050339433],"about_ca_topic_score_codex":0.0018324257,"about_ca_topic_score_gemma":0.0016627572,"teacher_disagreement_score":0.01592088,"about_ca_system_score_codex":0.004582772,"about_ca_system_score_gemma":0.0036092713,"threshold_uncertainty_score":0.053260624},"labels":[],"label_agreement":null},{"id":"W1558380859","doi":"10.4230/dagsemproc.07461.6","title":"Erlangian Approximation to Finite Time Ruin Probabilities in Perturbed Risk Models","year":2008,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov process; Mathematics; Risk model; Phase-type distribution; Markov chain; Applied mathematics; Type (biology); First-hitting-time model; Ruin theory; Work (physics); Risk process; Stochastic process; Mathematical economics; Mathematical optimization; Statistics; Engineering","score_opus":0.09017863011510477,"score_gpt":0.3135910623283894,"score_spread":0.22341243221328463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558380859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082743146,0.00051456277,0.9110178,0.00048205053,0.00005640788,0.000034288692,0.00008806993,0.00021732258,0.004846351],"genre_scores_gemma":[0.95182264,0.00053358194,0.03991104,0.000103146864,0.000063640815,0.000066187284,0.000091793314,0.00007912739,0.007328833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809605,0.00089002674,0.00006960526,0.00020200583,0.00045946267,0.00028281985],"domain_scores_gemma":[0.99319917,0.004702876,0.0008507179,0.00045605746,0.0005173602,0.00027377845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003355336,0.0008217315,0.0012394092,0.0012272648,0.0005784935,0.0020594853,0.0019801813,0.0014242355,0.0026741223],"category_scores_gemma":[0.017082114,0.0005588103,0.0009007423,0.0009833777,0.002278373,0.0033187114,0.0013672437,0.0022701002,0.00038324064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005414015,0.000030771174,0.00057887344,0.000026767164,0.00002040958,0.00011998569,0.00009503824,0.74991107,0.00048182943,0.24525683,0.000304628,0.0031196654],"study_design_scores_gemma":[0.0000024952378,0.0000043481837,0.00005371618,0.0000024241779,0.0000021485487,0.000010469658,0.000007890727,0.96109873,0.000086929926,0.038633186,0.000092836075,0.0000049535975],"about_ca_topic_score_codex":0.007242508,"about_ca_topic_score_gemma":0.0038859323,"teacher_disagreement_score":0.007242508,"about_ca_system_score_codex":0.0025575042,"about_ca_system_score_gemma":0.001369261,"threshold_uncertainty_score":0.018556058},"labels":[],"label_agreement":null},{"id":"W1567455550","doi":"10.4230/dagrep.4.2.38","title":"Graph Modification Problems (Dagstuhl Seminar 14071)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Universität Ulm; Université de Montpellier; Universität Rostock; Korea Advanced Institute of Science and Technology; Technische Universität Berlin; University of Haifa; National and Kapodistrian University of Athens; Goethe-Universität Frankfurt am Main; Magyar Tudományos Akadémia; Universität Trier; Durham University; University of Oregon; Universitetet i Bergen; University of Leeds; Uniwersytet Warszawski; Indian Institute of Science; University of Toronto; University of Ioannina; Universiteit Maastricht","keywords":"Graph; Computer science; Theoretical computer science","score_opus":0.023628448558856565,"score_gpt":0.2844284748760495,"score_spread":0.26080002631719296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567455550","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040072862,0.072481215,0.14116,0.17080782,0.03539886,0.0005496682,0.009631948,0.0033437116,0.526554],"genre_scores_gemma":[0.35538366,0.03471143,0.11172428,0.020161917,0.020372435,0.0012778989,0.021573802,0.0022889788,0.43250564],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814343,0.0005330469,0.00007262609,0.00035600283,0.00064956956,0.00024539445],"domain_scores_gemma":[0.9988734,0.00040658546,0.00007912823,0.00014127187,0.00018067122,0.00031883293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232301,0.0013395222,0.0010644074,0.0016251473,0.001637111,0.002818608,0.001487671,0.0022521,0.043565877],"category_scores_gemma":[0.00405857,0.000574113,0.0010178249,0.002231752,0.0012387666,0.0028458824,0.002746913,0.004651709,0.013612913],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002780871,0.0001647259,0.00023119945,0.00034866287,0.000039663515,0.00015908632,0.00017261511,0.0025878076,0.0014742225,0.27980098,0.6052328,0.10951023],"study_design_scores_gemma":[0.00016607466,0.00010472839,0.0013653408,0.00021694804,0.00004017332,0.00022857894,0.000103118495,0.003815101,0.0018742434,0.49769267,0.4943459,0.000047077017],"about_ca_topic_score_codex":0.0019309169,"about_ca_topic_score_gemma":0.0025751707,"teacher_disagreement_score":0.043565877,"about_ca_system_score_codex":0.0037267318,"about_ca_system_score_gemma":0.0020824603,"threshold_uncertainty_score":0.14574236},"labels":[],"label_agreement":null},{"id":"W1577042948","doi":"10.4230/lipics.ccc.2017.16","title":"Information complexity is computable","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computable general equilibrium; Computer science; Economics; Microeconomics","score_opus":0.05894242586725465,"score_gpt":0.29261671203688366,"score_spread":0.23367428616962901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577042948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0846924,0.004313908,0.81861025,0.016471406,0.00046747847,0.00016535968,0.0010061,0.0011606752,0.07311244],"genre_scores_gemma":[0.8406056,0.0037548165,0.13473591,0.0023969412,0.0010022568,0.00066299643,0.0010919909,0.0007607644,0.014988637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98692244,0.003127906,0.0006622506,0.003250799,0.0046670907,0.0013694606],"domain_scores_gemma":[0.9210544,0.058219723,0.0021047725,0.013415032,0.0040861834,0.0011199532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006573447,0.001370625,0.002131356,0.0022943998,0.0019525999,0.008679103,0.0023115065,0.002960141,0.006196249],"category_scores_gemma":[0.059173476,0.0009035781,0.0019845143,0.002702528,0.010504093,0.020811975,0.0058489987,0.011184394,0.0012895622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012395107,0.000024157938,0.00037798527,0.00020408284,0.00004067966,0.000045439865,0.00017847949,0.01280222,0.00084518985,0.97214,0.0018940023,0.011323829],"study_design_scores_gemma":[0.000018786282,0.000023586841,0.00026666987,0.000047971633,0.000016241343,0.00006126129,0.000030440207,0.03338086,0.0011822311,0.9604458,0.0045066834,0.000019501585],"about_ca_topic_score_codex":0.0020945498,"about_ca_topic_score_gemma":0.0008703542,"teacher_disagreement_score":0.008679103,"about_ca_system_score_codex":0.0058490406,"about_ca_system_score_gemma":0.002825144,"threshold_uncertainty_score":0.04243791},"labels":[],"label_agreement":null},{"id":"W1579882491","doi":"10.4230/dagrep.3.11.29","title":"Proxemics in Human-Computer Interaction (Dagstuhl Seminar 13452)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Proxemics; Interpersonal communication; Human–computer interaction; Context (archaeology); Computer science; Psychology; Social psychology; Geography","score_opus":0.018355246281505776,"score_gpt":0.27388411488478304,"score_spread":0.2555288686032773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579882491","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010256774,0.38816553,0.027943995,0.20486866,0.087403916,0.00035553714,0.0015706518,0.0011560123,0.27827895],"genre_scores_gemma":[0.1750531,0.1336759,0.02214345,0.022278726,0.04237264,0.0011530169,0.0016793899,0.0015654165,0.6000784],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99753726,0.00086919277,0.00011243669,0.0005216507,0.0005492868,0.0004101768],"domain_scores_gemma":[0.99920624,0.0002705942,0.000041710067,0.000050964027,0.00012206923,0.0003084559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003319483,0.0020584585,0.0012585903,0.0019926662,0.0017152448,0.0053411755,0.0010362451,0.00358957,0.045624495],"category_scores_gemma":[0.0044793556,0.00064520695,0.0008902764,0.0011160276,0.0024110419,0.004696954,0.0047621736,0.004467608,0.021580752],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024477253,0.00017395825,0.00022302514,0.00042404345,0.000027724856,0.00017456981,0.0012608597,0.0007425024,0.0012898293,0.09602149,0.71253026,0.18688692],"study_design_scores_gemma":[0.000036268477,0.00008064836,0.00096683437,0.0004381507,0.0000126329105,0.00014451149,0.0001875372,0.00053778343,0.00049491087,0.034157224,0.9629187,0.00002468253],"about_ca_topic_score_codex":0.0022468218,"about_ca_topic_score_gemma":0.0027281698,"teacher_disagreement_score":0.045624495,"about_ca_system_score_codex":0.0035812554,"about_ca_system_score_gemma":0.0019253807,"threshold_uncertainty_score":0.15262914},"labels":[],"label_agreement":null},{"id":"W1591207959","doi":"10.4230/lipics.fsttcs.2009.2319","title":"On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cover (algebra); Mathematics; Vertex (graph theory); Combinatorics; Upper and lower bounds; Vertex cover; Regular polygon; Inequality; Metric (unit); Discrete mathematics; Approximation algorithm; Mathematical analysis; Geometry; Graph","score_opus":0.01935012980026356,"score_gpt":0.27016689915421316,"score_spread":0.2508167693539496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591207959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1493679,0.0025676328,0.79164356,0.0051697134,0.0004848081,0.00042152204,0.0010257424,0.00072598987,0.048593167],"genre_scores_gemma":[0.6874385,0.002350427,0.29261932,0.002094529,0.00083445053,0.0008835048,0.0017222753,0.00067887927,0.011378015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99396497,0.0020664516,0.00027138588,0.0011033231,0.0013793302,0.0012146205],"domain_scores_gemma":[0.97110367,0.023075065,0.0011039829,0.0021508443,0.0011775374,0.0013888974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077589755,0.0025954293,0.0034401566,0.0023196803,0.0019495302,0.005421276,0.0041512693,0.0024775101,0.010214684],"category_scores_gemma":[0.035033904,0.0011962496,0.0027307111,0.0025958566,0.0043241787,0.008948369,0.007767376,0.010723198,0.001019358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007432153,0.0005038861,0.0025212453,0.0010161417,0.0002776013,0.00037831374,0.00057657436,0.37108696,0.0067165014,0.52013737,0.015112305,0.08092986],"study_design_scores_gemma":[0.000089796835,0.00021402186,0.00075924606,0.00013790526,0.000095855525,0.00021124419,0.00014861424,0.5938681,0.0025255724,0.3959558,0.0059528016,0.000041126776],"about_ca_topic_score_codex":0.0028678323,"about_ca_topic_score_gemma":0.0029612405,"teacher_disagreement_score":0.010214684,"about_ca_system_score_codex":0.0040854826,"about_ca_system_score_gemma":0.0026522698,"threshold_uncertainty_score":0.041033864},"labels":[],"label_agreement":null},{"id":"W1599413552","doi":"10.4230/lipics.stacs.2014.482","title":"An optimal quantum algorithm for the oracle identification problem","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum algorithm; Oracle; Algorithm; Mathematics; Matrix multiplication; Conjecture; Discrete mathematics; Reduction (mathematics); Quantum; Computer science","score_opus":0.014599000787750742,"score_gpt":0.2688054297050613,"score_spread":0.2542064289173106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599413552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020604556,0.00011191033,0.97075695,0.0010469236,0.00009562098,0.0001408856,0.00013767372,0.0014651875,0.005640261],"genre_scores_gemma":[0.27841297,0.00012072876,0.71237934,0.0005695114,0.00011122309,0.0003752924,0.0004891982,0.00037080725,0.007170861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972134,0.0006408812,0.00017741781,0.0008465188,0.0007820035,0.0003398098],"domain_scores_gemma":[0.99744225,0.0013156256,0.0001406754,0.0006253782,0.00033721075,0.00013890119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017502178,0.00071633613,0.0012387076,0.0007629512,0.0014606501,0.0017864795,0.0024922215,0.002533995,0.008709878],"category_scores_gemma":[0.007420434,0.0005214494,0.0010281369,0.001123489,0.0018510522,0.00501407,0.0040587727,0.0028521058,0.0019490153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087662047,0.00052232476,0.0010184499,0.0003025838,0.0000885072,0.00019378922,0.00044509547,0.079701915,0.017194303,0.5342183,0.017452542,0.3479856],"study_design_scores_gemma":[0.00023611297,0.000117473544,0.00024396907,0.000027288797,0.000034020424,0.00017802339,0.0000898244,0.56674147,0.010732412,0.41567957,0.0058690975,0.000050670853],"about_ca_topic_score_codex":0.0010908049,"about_ca_topic_score_gemma":0.0014917799,"teacher_disagreement_score":0.008709878,"about_ca_system_score_codex":0.0016497101,"about_ca_system_score_gemma":0.0034567511,"threshold_uncertainty_score":0.029137433},"labels":[],"label_agreement":null},{"id":"W1810597274","doi":"10.4230/lipics.approx-random.2015.915","title":"Separating Decision Tree Complexity from Subcube Partition Complexity","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Mathematics; Combinatorics; Partition (number theory); Computational complexity theory; Discrete mathematics; Randomized algorithm; Time complexity; Algorithm","score_opus":0.1036924692433647,"score_gpt":0.32258378775563157,"score_spread":0.21889131851226687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810597274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11933709,0.0009868573,0.84584135,0.004991753,0.00013155419,0.00020936308,0.00091276213,0.0006495976,0.026939709],"genre_scores_gemma":[0.8906458,0.0013219499,0.096881226,0.0011758883,0.00041188652,0.00058566534,0.0011115529,0.00047601343,0.007389992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9890832,0.0029494003,0.0004779776,0.002486361,0.0034305796,0.001572553],"domain_scores_gemma":[0.94590724,0.03955992,0.0020606485,0.009562601,0.0017266724,0.0011829619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004923667,0.00095898873,0.0020561335,0.0015956074,0.001925323,0.0071181087,0.0038213728,0.002643763,0.007686327],"category_scores_gemma":[0.03338387,0.00080780336,0.0024340658,0.0025737393,0.0050099753,0.016329708,0.0056244484,0.007925807,0.0010166042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021422298,0.00008497076,0.0013768618,0.00016374388,0.000052588748,0.00006475365,0.00025091317,0.059066597,0.0020832403,0.9133629,0.0031983852,0.020080758],"study_design_scores_gemma":[0.000023524923,0.000032395703,0.00044235148,0.000030208961,0.000029835213,0.0000764481,0.00005515006,0.19270816,0.0019594159,0.80171585,0.0029004365,0.000026245449],"about_ca_topic_score_codex":0.0025761386,"about_ca_topic_score_gemma":0.0025706491,"teacher_disagreement_score":0.007686327,"about_ca_system_score_codex":0.005780852,"about_ca_system_score_gemma":0.0033927953,"threshold_uncertainty_score":0.041943192},"labels":[],"label_agreement":null},{"id":"W1895441878","doi":"10.4230/dagsemproc.06301.7","title":"Detection of Plagiarism in University Projects Using Metrics-based Spectral Similarity","year":2007,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Plagiarism detection; Similarity (geometry); Computer science; Spectral analysis; Source code; Data mining; Clan; Information retrieval; Artificial intelligence; Programming language; Physics","score_opus":0.02642885969981242,"score_gpt":0.2678502540887758,"score_spread":0.24142139438896335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1895441878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5270267,0.0008200661,0.46379298,0.00020459338,0.00006234107,0.0002949605,0.0007783643,0.0040552183,0.0029647653],"genre_scores_gemma":[0.8299459,0.000194052,0.1675661,0.00002430027,0.000040336614,0.00017815502,0.0011107157,0.00016644067,0.000773883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939207,0.0009898143,0.0005598473,0.0008513083,0.0034076502,0.0002707743],"domain_scores_gemma":[0.9833477,0.0049860324,0.0034326422,0.0019278723,0.0055514807,0.0007542248],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025432282,0.00057959347,0.001066194,0.014273492,0.000858112,0.0017462083,0.0009041701,0.0008156213,0.0010187237],"category_scores_gemma":[0.020652397,0.00026733775,0.00054036995,0.008216036,0.0007084139,0.0024181895,0.0016114409,0.00063024973,0.00073709304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009378669,0.00040368555,0.09253872,0.0005399409,0.00028456835,0.00045471615,0.0016342521,0.013780389,0.09432578,0.0061482885,0.0032864208,0.78566533],"study_design_scores_gemma":[0.00011113052,0.0010977943,0.20393214,0.00011177677,0.00015985862,0.0049328757,0.0014655268,0.64205885,0.11590693,0.019033268,0.010872357,0.0003175608],"about_ca_topic_score_codex":0.0012220285,"about_ca_topic_score_gemma":0.0013265155,"teacher_disagreement_score":0.99918437,"about_ca_system_score_codex":0.00077122776,"about_ca_system_score_gemma":0.000704962,"threshold_uncertainty_score":0.0134500265},"labels":[],"label_agreement":null},{"id":"W1942339129","doi":"10.4230/dagsemproc.05151.9","title":"Temporal information extraction from legal documents","year":2005,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thomson Reuters (Canada)","funders":"","keywords":"Computer science; Information extraction; Statute; Transactional leadership; Information retrieval; Political science; Law","score_opus":0.010853852381888143,"score_gpt":0.26421046648498087,"score_spread":0.25335661410309274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942339129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07045128,0.010383602,0.81427336,0.0027713948,0.0009226154,0.0013260542,0.049608063,0.012345152,0.037918538],"genre_scores_gemma":[0.15142088,0.007547992,0.7575111,0.0002689926,0.0004172645,0.00065208954,0.07129454,0.0008623653,0.010024772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980375,0.0002658533,0.0003687103,0.00033189225,0.0008535737,0.00014254022],"domain_scores_gemma":[0.9944952,0.002353708,0.00065503665,0.00073317956,0.0016289959,0.00013378999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011931055,0.0008890683,0.00090458075,0.0148577355,0.0014515857,0.0027446358,0.0009843445,0.0009848526,0.00554033],"category_scores_gemma":[0.009090933,0.00062100915,0.0012008899,0.014624318,0.00060970866,0.00419993,0.0013601617,0.001395374,0.003344326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045979567,0.00019958771,0.00373068,0.00273183,0.00012604476,0.0024258825,0.0013067338,0.0044359067,0.03413846,0.04859794,0.037874777,0.8639723],"study_design_scores_gemma":[0.00014466455,0.0001731951,0.0116924,0.0016439286,0.0005800466,0.005510703,0.0028065802,0.08809011,0.14316489,0.10215423,0.6437433,0.00029593043],"about_ca_topic_score_codex":0.0062389052,"about_ca_topic_score_gemma":0.004880088,"teacher_disagreement_score":0.0148577355,"about_ca_system_score_codex":0.0012141451,"about_ca_system_score_gemma":0.0025754855,"threshold_uncertainty_score":0.018534303},"labels":[],"label_agreement":null},{"id":"W202943302","doi":"10.4230/dagsemproc.05321.11","title":"Iterated Belief Change and the Levi Identity","year":2005,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterated function; Belief revision; Identity (music); Mathematics; Computer science; Set (abstract data type); Epistemology; Mathematical economics; Artificial intelligence; Philosophy","score_opus":0.0285557793842919,"score_gpt":0.25975007583539717,"score_spread":0.23119429645110526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202943302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05187049,0.0032966346,0.79581577,0.009131705,0.00035166013,0.00013415237,0.00018697308,0.0005790717,0.13863352],"genre_scores_gemma":[0.8730744,0.0009123264,0.10855669,0.0011225275,0.00036739992,0.0002605775,0.0001401161,0.00016832686,0.01539772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927428,0.0027435492,0.000397902,0.0014683185,0.0019615267,0.00068589114],"domain_scores_gemma":[0.99244106,0.0037385095,0.0007089527,0.0013218734,0.0012817193,0.0005079536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00645542,0.0005960001,0.0010422118,0.0015414812,0.0021026684,0.0045504794,0.0017442236,0.0019156192,0.0048642675],"category_scores_gemma":[0.013143295,0.00046462077,0.0019182276,0.00101982,0.012956786,0.0072298576,0.004386202,0.003765607,0.00093766337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018110251,0.000010982119,0.00014893913,0.00002998497,0.000014820765,0.000051328658,0.0004121839,0.0013444056,0.00018280209,0.99079657,0.0005087303,0.0064810975],"study_design_scores_gemma":[0.0000123247555,0.0000179841,0.000097622025,0.0000144389205,0.0000076384395,0.000030602318,0.00005579597,0.0060110735,0.00028290224,0.99075717,0.0027015104,0.000010907335],"about_ca_topic_score_codex":0.002562924,"about_ca_topic_score_gemma":0.0014384586,"teacher_disagreement_score":0.00645542,"about_ca_system_score_codex":0.0042546983,"about_ca_system_score_gemma":0.0016035562,"threshold_uncertainty_score":0.03413993},"labels":[],"label_agreement":null},{"id":"W2070894968","doi":"10.4230/lipics.stacs.2014.300","title":"From Small Space to Small Width in Resolution","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Vetenskapsrådet; Kungliga Tekniska Högskolan; University of Toronto; European Commission","keywords":"Resolution (logic); Upper and lower bounds; Space (punctuation); Proof complexity; Mathematics; Simple (philosophy); Polynomial; Measure (data warehouse); PSPACE; Discrete mathematics; Product (mathematics); Calculus (dental); Algorithm; Computer science; Combinatorics; Computational complexity theory; Mathematical proof; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.022146874275755426,"score_gpt":0.23658082300295133,"score_spread":0.2144339487271959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070894968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07147561,0.0039811805,0.85307306,0.01966507,0.0005030505,0.00015735967,0.0005139095,0.0018433132,0.04878753],"genre_scores_gemma":[0.7745194,0.0022989428,0.20260602,0.0037236572,0.0011024276,0.00037605144,0.0004974357,0.0014587607,0.0134174125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9850476,0.004515257,0.00075108703,0.0031662323,0.0048598247,0.0016601059],"domain_scores_gemma":[0.91716266,0.061099485,0.0020147513,0.014951243,0.003170581,0.0016013563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010158436,0.0013573122,0.0020331184,0.0025926372,0.0035320192,0.008614518,0.00460908,0.0034889122,0.010312086],"category_scores_gemma":[0.054862943,0.0018707623,0.0035116787,0.0022178115,0.015638715,0.040577665,0.013632687,0.016021539,0.0018621791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014127254,0.000035982757,0.00052008324,0.0002010114,0.000043264965,0.00007445136,0.0005542401,0.0033934894,0.0012403438,0.9788633,0.0019894948,0.0129430955],"study_design_scores_gemma":[0.000028721384,0.000028167717,0.00014133197,0.00003675855,0.000028467883,0.00006078722,0.00008367998,0.0078811655,0.0019930082,0.98494536,0.004748041,0.000024483672],"about_ca_topic_score_codex":0.0015031784,"about_ca_topic_score_gemma":0.0012908059,"teacher_disagreement_score":0.010312086,"about_ca_system_score_codex":0.003665199,"about_ca_system_score_gemma":0.0018374772,"threshold_uncertainty_score":0.053723574},"labels":[],"label_agreement":null},{"id":"W2095921276","doi":"10.4230/lipics.socg.2020.33","title":"Finding Closed Quasigeodesics on Convex Polyhedra","year":2010,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geometry; Computer science; Computational geometry; Mathematics","score_opus":0.030150585440336095,"score_gpt":0.29114968372529654,"score_spread":0.26099909828496043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095921276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38967752,0.00030723898,0.60299456,0.00023127443,0.00006084951,0.000096755946,0.00035119045,0.00057172176,0.0057088654],"genre_scores_gemma":[0.66711414,0.000397439,0.32224652,0.00007312162,0.000048540336,0.00011089196,0.0011320742,0.00024886007,0.008628447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972254,0.000045619057,0.000019301555,0.00006573331,0.00009065679,0.000056137666],"domain_scores_gemma":[0.9992187,0.00041959644,0.000073543524,0.0001237887,0.000108366745,0.00005606605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002997995,0.00037714234,0.0005881885,0.00081721257,0.0005433865,0.0010256119,0.00064276974,0.0006086711,0.0029753805],"category_scores_gemma":[0.0019064306,0.0004300462,0.0005979215,0.00058973016,0.0012446601,0.0016579697,0.0014534212,0.0010202145,0.00058625836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005399105,0.0001323416,0.005876207,0.0005562606,0.0000571483,0.0008823129,0.0011292747,0.15489258,0.06257852,0.5138154,0.0053577204,0.25418228],"study_design_scores_gemma":[0.00009689679,0.00021185225,0.0013934169,0.00009163895,0.00001554184,0.00039521692,0.0005337469,0.305853,0.022121178,0.65789896,0.011355051,0.000033524884],"about_ca_topic_score_codex":0.0009704405,"about_ca_topic_score_gemma":0.001029113,"teacher_disagreement_score":0.0029753805,"about_ca_system_score_codex":0.0005343439,"about_ca_system_score_gemma":0.00040197853,"threshold_uncertainty_score":0.009953618},"labels":[],"label_agreement":null},{"id":"W2134543674","doi":"10.4230/lipics.stacs.2013.269","title":"Algorithms for Designing Pop-Up Cards","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Chemical, Bioengineering, Environmental, and Transport Systems; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; Deutsche Forschungsgemeinschaft; Division of Emerging Frontiers in Research and Innovation; National Science Foundation","keywords":"Polygon (computer graphics); Polyhedron; Simple polygon; Closing (real estate); Computer science; Simple (philosophy); Combinatorics; Linkage (software); Mathematics; Algorithm; Computer graphics (images); Regular polygon; Geometry","score_opus":0.025406681989880116,"score_gpt":0.2709988723429491,"score_spread":0.245592190353069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134543674","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00512157,0.00012949968,0.98569113,0.00009968326,0.000053437572,0.00018524214,0.0002400531,0.002403148,0.0060761822],"genre_scores_gemma":[0.04822853,0.00020689932,0.94587857,0.000061326835,0.000018413777,0.00026053752,0.0011130078,0.0005632808,0.0036694037],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853265,0.0002281802,0.0001320194,0.00039126165,0.0004788517,0.00023701228],"domain_scores_gemma":[0.99785787,0.0008405317,0.00012122768,0.0007928927,0.00026835484,0.00011918194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009898188,0.0017603156,0.0013115673,0.0012134156,0.0015248938,0.0027693573,0.0034790789,0.0017686322,0.025779128],"category_scores_gemma":[0.0047423583,0.0015286782,0.002436924,0.0017030126,0.0012608381,0.0041992143,0.0050852383,0.0023174745,0.00796932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033501638,0.00028647835,0.0017186283,0.00086186215,0.000088868175,0.00034186765,0.00062446424,0.15331642,0.0092287455,0.18580802,0.028580971,0.6188087],"study_design_scores_gemma":[0.0001776311,0.00014895474,0.0003393003,0.00013446984,0.00007008198,0.00034433702,0.0003953018,0.66426754,0.012487821,0.2608767,0.06068923,0.0000685564],"about_ca_topic_score_codex":0.0014695654,"about_ca_topic_score_gemma":0.0026140374,"teacher_disagreement_score":0.025779128,"about_ca_system_score_codex":0.0010824244,"about_ca_system_score_gemma":0.0012680963,"threshold_uncertainty_score":0.086239755},"labels":[],"label_agreement":null},{"id":"W2144243803","doi":"10.4230/dagsemproc.10291.12","title":"On the Notion of Genre in Digital Preservation","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Context (archaeology); Key (lock); Representation (politics); Open research; Digital preservation; Automation; World Wide Web; Data science; Information retrieval; Engineering; Computer security; History; Political science; Politics","score_opus":0.010652695654290995,"score_gpt":0.2503479191156682,"score_spread":0.23969522346137723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144243803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040782854,0.037292425,0.60661495,0.021297924,0.003197183,0.00027299635,0.0006101218,0.0004035213,0.2895281],"genre_scores_gemma":[0.674415,0.022773622,0.26273906,0.004218465,0.0057703564,0.00048074583,0.00096760783,0.00036671618,0.028268345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99430686,0.0030375032,0.00054327,0.0007630502,0.0010493008,0.00030002533],"domain_scores_gemma":[0.99141055,0.0052080043,0.0007012635,0.0013490783,0.0008191134,0.00051194563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062579466,0.0007566841,0.0008878629,0.007884935,0.004791266,0.009556505,0.0013854166,0.0022642305,0.0062364163],"category_scores_gemma":[0.011997003,0.00051847193,0.0012805064,0.007850832,0.018407578,0.027772363,0.0060571083,0.003919607,0.0012150974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021231295,0.000008590613,0.0002872223,0.00012115925,0.0000070924793,0.00007291118,0.0019066527,0.0003940552,0.00027898923,0.97211623,0.0015046078,0.023281228],"study_design_scores_gemma":[0.000012021534,0.000029207691,0.000601761,0.00028614135,0.000019895324,0.00033515587,0.0015185922,0.0027662744,0.0003513308,0.9256966,0.06835114,0.000031961266],"about_ca_topic_score_codex":0.0024714402,"about_ca_topic_score_gemma":0.0016401331,"teacher_disagreement_score":0.009556505,"about_ca_system_score_codex":0.003226064,"about_ca_system_score_gemma":0.0010170436,"threshold_uncertainty_score":0.0330956},"labels":[],"label_agreement":null},{"id":"W2145563891","doi":"10.4230/lipics.stacs.2010.2443","title":"The Tropical Double Description Method","year":2010,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministère des Transports","funders":"","keywords":"Polyhedron; Hypergraph; Extreme point; Representation (politics); Point (geometry); Component (thermodynamics); Mathematics; Algorithm; Linear inequality; Connected component; Computer science; Mathematical optimization; Combinatorics; Inequality; Geometry","score_opus":0.025458243914129684,"score_gpt":0.28781296830220876,"score_spread":0.26235472438807905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145563891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050780503,0.000083286875,0.98849154,0.00011287332,0.000040413528,0.00006294707,0.00024703555,0.0011458703,0.004738037],"genre_scores_gemma":[0.209403,0.00026040195,0.77904844,0.00022113962,0.00006701459,0.0003243601,0.0012550082,0.0011924942,0.0082281865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986498,0.00025907272,0.00007954537,0.00021644252,0.0005945053,0.0002006263],"domain_scores_gemma":[0.99811506,0.00051940646,0.00011833661,0.00078353955,0.00035779065,0.00010584757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011169135,0.00062043325,0.0008178693,0.0015261575,0.0007185445,0.0018570229,0.0025088356,0.00071041205,0.015403067],"category_scores_gemma":[0.0042153555,0.00066439697,0.0016033616,0.0014428631,0.0011917595,0.0033933744,0.0033419458,0.0018886727,0.002944079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003222201,0.0000815937,0.0014102707,0.0005806387,0.00009934987,0.00034666658,0.0003785812,0.06897863,0.013429205,0.5907178,0.01450147,0.3091536],"study_design_scores_gemma":[0.000110499954,0.00010525794,0.00032269608,0.000111688256,0.00007161476,0.00058299396,0.00014161089,0.6267296,0.018519046,0.30169368,0.051532134,0.00007917014],"about_ca_topic_score_codex":0.0016411329,"about_ca_topic_score_gemma":0.0021238886,"teacher_disagreement_score":0.015403067,"about_ca_system_score_codex":0.00079241,"about_ca_system_score_gemma":0.0017559455,"threshold_uncertainty_score":0.051528394},"labels":[],"label_agreement":null},{"id":"W2152199276","doi":"10.4230/dagsemproc.05382.3","title":"Attention Demands in Text Entry Interfaces","year":2006,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Argument (complex analysis); Perception; Text entry; Cognition; Interface (matter); Human–computer interaction; Cognitive load; Word (group theory); Natural language processing; Cognitive psychology; Linguistics; Psychology","score_opus":0.006460817766876849,"score_gpt":0.23667861803876267,"score_spread":0.23021780027188582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152199276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72243977,0.0056198286,0.12428179,0.00718245,0.00048527354,0.00038624846,0.0010698064,0.0010946901,0.13744009],"genre_scores_gemma":[0.98295987,0.00089510035,0.0050626327,0.00034665313,0.00021307162,0.00019710339,0.00032016388,0.00015775686,0.009847626],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99722666,0.00074538495,0.00021882448,0.00047428737,0.0010369134,0.00029792305],"domain_scores_gemma":[0.9822733,0.013039509,0.001019727,0.0008944487,0.0019949276,0.0007781421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021556858,0.000656406,0.00059872214,0.0010545528,0.0008423043,0.004639698,0.0014534234,0.0019779096,0.012513965],"category_scores_gemma":[0.03558537,0.00088144233,0.0003341362,0.0011714954,0.00089510967,0.004969469,0.001969491,0.0014410226,0.0019983717],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0064944257,0.0013477632,0.049898114,0.0036298814,0.00023196757,0.0022128057,0.017701676,0.03361201,0.19399036,0.2951467,0.020801226,0.3749331],"study_design_scores_gemma":[0.00060599064,0.0014087152,0.2555507,0.0005111408,0.00039753606,0.002159413,0.0063511487,0.17173082,0.040747516,0.48588562,0.03422868,0.00042279495],"about_ca_topic_score_codex":0.003918336,"about_ca_topic_score_gemma":0.0019328652,"teacher_disagreement_score":0.012513965,"about_ca_system_score_codex":0.0019474678,"about_ca_system_score_gemma":0.0006797564,"threshold_uncertainty_score":0.04186338},"labels":[],"label_agreement":null},{"id":"W2158382416","doi":"10.4230/lipics.swat.2016.30","title":"Time-Space Trade-offs for Triangulating a Simple Polygon","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Simple polygon; Workspace; Simple (philosophy); Polygon (computer graphics); Combinatorics; Binary logarithm; Space (punctuation); Computer science; SIMPLE algorithm; Algorithm; Mathematics; Time complexity; Monotone polygon; Discrete mathematics; Artificial intelligence; Geometry; Physics; Computer network","score_opus":0.015556284487119173,"score_gpt":0.2561525916758043,"score_spread":0.2405963071886851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158382416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35860774,0.0023156572,0.60034096,0.0030755016,0.00026283273,0.00029076234,0.0007624439,0.0084546255,0.02588949],"genre_scores_gemma":[0.64260256,0.0006061044,0.34873322,0.0002644535,0.00010932266,0.00033132784,0.001155556,0.0012031962,0.0049942657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559045,0.0015831797,0.00038161362,0.0008168563,0.0010460861,0.0005818719],"domain_scores_gemma":[0.98428106,0.010716152,0.00082929316,0.002838037,0.00076034054,0.000575142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003606614,0.0010311734,0.0012676917,0.0009339832,0.001156782,0.0020090817,0.00295754,0.0017889522,0.01213405],"category_scores_gemma":[0.018967312,0.0007877305,0.0013052305,0.0019373021,0.00168473,0.005888428,0.0030776863,0.0010336904,0.0026157459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007142662,0.0005781202,0.003877767,0.00087260455,0.0001624609,0.0004522801,0.0005953944,0.43384933,0.03753599,0.06523236,0.01739139,0.43230966],"study_design_scores_gemma":[0.0004515727,0.00063283404,0.0007400111,0.000059933896,0.00007185925,0.00028420857,0.00022298023,0.91693676,0.018648766,0.058864973,0.0030378497,0.000048217385],"about_ca_topic_score_codex":0.0011898568,"about_ca_topic_score_gemma":0.002946356,"teacher_disagreement_score":0.01213405,"about_ca_system_score_codex":0.0014433806,"about_ca_system_score_gemma":0.00191563,"threshold_uncertainty_score":0.040592432},"labels":[],"label_agreement":null},{"id":"W2158685441","doi":"10.4230/lipics.stacs.2012.601","title":"The Power of Local Search: Maximum Coverage over a Matroid","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Matroid; Power (physics); Matroid partitioning; Computer science; Mathematics; Combinatorics; Graphic matroid; Physics","score_opus":0.01917763530506628,"score_gpt":0.26032261563785397,"score_spread":0.2411449803327877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158685441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042024795,0.00042902867,0.9492443,0.00047563933,0.00001256074,0.00008904185,0.00007873353,0.0012668029,0.0063790716],"genre_scores_gemma":[0.4938725,0.0003152997,0.501862,0.0002062379,0.00004122263,0.00028447897,0.00023699181,0.0003263934,0.002854956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837995,0.00065285235,0.000047866157,0.00024902823,0.00046842164,0.00020190918],"domain_scores_gemma":[0.99679726,0.002059275,0.00023340719,0.00063224556,0.00017173756,0.00010621318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014639574,0.000803374,0.0012892134,0.0010003033,0.0006751566,0.0012627003,0.0022426385,0.0011503334,0.0032882064],"category_scores_gemma":[0.0075378357,0.0005965135,0.0012237238,0.0015715542,0.001244883,0.0030365356,0.0020477136,0.0015687174,0.00077290786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038128076,0.00023677273,0.0016016042,0.00027090605,0.00008035745,0.0002006986,0.00032042607,0.7586009,0.010903884,0.045869313,0.004959963,0.17657398],"study_design_scores_gemma":[0.000036923524,0.0000774161,0.0001327583,0.00001458228,0.000015760948,0.000086603584,0.000024952062,0.9810929,0.0029129423,0.014520271,0.0010759068,0.000008869407],"about_ca_topic_score_codex":0.003450392,"about_ca_topic_score_gemma":0.0039174594,"teacher_disagreement_score":0.003450392,"about_ca_system_score_codex":0.0014673022,"about_ca_system_score_gemma":0.0012226851,"threshold_uncertainty_score":0.011000156},"labels":[],"label_agreement":null},{"id":"W2164928349","doi":"10.4230/lipics.tqc.2013.270","title":"The Quantum Entropy Cone of Stabiliser States","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre for Quantum Technologies; Grantová Agentura České Republiky; National Science Foundation; National University of Singapore; National Research Foundation; European Commission; Banff International Research Station for Mathematical Innovation and Discovery; Leverhulme Trust","keywords":"Stabiliser; Von Neumann entropy; Subadditivity; Inequality; Mathematics; Quantum relative entropy; Entropy (arrow of time); Monotonic function; Pure mathematics; Quantum; Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics; Quantum discord; Quantum entanglement","score_opus":0.01021544677544756,"score_gpt":0.23883279442805475,"score_spread":0.2286173476526072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164928349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.770305,0.00044293268,0.18215787,0.00089256634,0.000047181467,0.000052747193,0.00024260352,0.00010343869,0.04575574],"genre_scores_gemma":[0.9910253,0.00012411963,0.005761523,0.000059947903,0.00003306514,0.000038582697,0.000076248034,0.000025609452,0.0028557098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919313,0.00020891428,0.000033111985,0.00009787404,0.00029748373,0.00016956465],"domain_scores_gemma":[0.9981943,0.0010432893,0.00028894088,0.00013693047,0.0001649875,0.00017149934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012716826,0.00042582615,0.00043864144,0.0009671269,0.0007284082,0.0019138604,0.00089110766,0.0006718692,0.004625207],"category_scores_gemma":[0.0038698872,0.0002400537,0.00035391233,0.00049298035,0.0025013243,0.003328718,0.0017125135,0.001495357,0.0002954829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059953505,0.000029580293,0.0005822229,0.00003948885,0.00000900265,0.00013439832,0.00015075415,0.017536756,0.0064634234,0.9716134,0.0002532714,0.0031278913],"study_design_scores_gemma":[0.000012112625,0.000052418567,0.0008473396,0.000015963313,0.000004373468,0.000054379325,0.000076108794,0.19083023,0.004663256,0.80289155,0.0005281337,0.000024060591],"about_ca_topic_score_codex":0.00062564446,"about_ca_topic_score_gemma":0.00047064805,"teacher_disagreement_score":0.004625207,"about_ca_system_score_codex":0.0008687927,"about_ca_system_score_gemma":0.0004104418,"threshold_uncertainty_score":0.015472829},"labels":[],"label_agreement":null},{"id":"W2169348983","doi":"10.4230/lipics.stacs.2014.149","title":"Palindrome Recognition In The Streaming Model","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Substring; Palindrome; String (physics); Mathematics; Sublinear function; Combinatorics; Square root; Algorithm; Discrete mathematics; Computer science; Data structure","score_opus":0.02455233136888209,"score_gpt":0.25154909241749424,"score_spread":0.22699676104861213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169348983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047973353,0.00037145248,0.9450714,0.00042853114,0.000057370686,0.0001161551,0.00043231412,0.0021833829,0.0033659781],"genre_scores_gemma":[0.43655777,0.00057164184,0.5495037,0.0003112694,0.00014711931,0.0003389955,0.0018869904,0.0004079718,0.0102746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885535,0.00022639494,0.00010090884,0.00038164,0.000278051,0.00015776527],"domain_scores_gemma":[0.9970855,0.0012755914,0.00025673228,0.0010297575,0.00025502537,0.0000973414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450045,0.000620987,0.0012150417,0.0006309274,0.0007386351,0.0015408025,0.0025517778,0.0015989168,0.004248059],"category_scores_gemma":[0.004465793,0.0004833724,0.0009577158,0.0013472935,0.0012429375,0.0048976704,0.0014425782,0.0014761398,0.0015181574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010563008,0.0003877155,0.0023404057,0.00040720953,0.000072152085,0.0008361201,0.00037153522,0.33090797,0.03683178,0.39254728,0.0107672345,0.22347431],"study_design_scores_gemma":[0.0000536006,0.00009369202,0.00021502902,0.000018125631,0.00001498046,0.00036674459,0.00007888493,0.7911986,0.00914888,0.19492842,0.0038527278,0.000030225712],"about_ca_topic_score_codex":0.0034197906,"about_ca_topic_score_gemma":0.0031784049,"teacher_disagreement_score":0.004248059,"about_ca_system_score_codex":0.0012663642,"about_ca_system_score_gemma":0.0014642292,"threshold_uncertainty_score":0.014211178},"labels":[],"label_agreement":null},{"id":"W2206671546","doi":"10.4230/lipics.cp.2022.8","title":"Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge Compilation","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Modulo; Preference; Preference elicitation; Psychology; Mathematical economics; Computer science; Mathematics; Discrete mathematics; Statistics","score_opus":0.057327003122854825,"score_gpt":0.297874918731804,"score_spread":0.24054791560894917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206671546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04930885,0.00047088362,0.9361725,0.00086209,0.00009303053,0.00018171465,0.00035878562,0.005680561,0.006871696],"genre_scores_gemma":[0.30378604,0.00036275623,0.6898373,0.0005760838,0.00008526935,0.00042239716,0.0016765889,0.0007937792,0.0024597347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796814,0.0009261618,0.00010207673,0.00042827512,0.0003733128,0.00020195798],"domain_scores_gemma":[0.9937874,0.004780603,0.00030114187,0.000635406,0.00036483127,0.00013052202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018865921,0.0023494298,0.0016860797,0.0018450534,0.00075872213,0.0020388928,0.0027232636,0.0020908248,0.0059374375],"category_scores_gemma":[0.01123017,0.0013346717,0.0028853195,0.0016504892,0.0016780355,0.0032276087,0.0026606368,0.0031500165,0.0012923232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012490015,0.00019652682,0.0017762586,0.00023420228,0.000119816126,0.00015049492,0.00012946529,0.82879454,0.0015536657,0.019784894,0.0042323954,0.14290294],"study_design_scores_gemma":[0.000031264553,0.00002954025,0.00010488681,0.00002700267,0.000026698492,0.000027878566,0.00003136325,0.97532743,0.0009692385,0.022421177,0.0009948441,0.000008644048],"about_ca_topic_score_codex":0.005851253,"about_ca_topic_score_gemma":0.011489856,"teacher_disagreement_score":0.0059374375,"about_ca_system_score_codex":0.0019209316,"about_ca_system_score_gemma":0.0026122772,"threshold_uncertainty_score":0.019862652},"labels":[],"label_agreement":null},{"id":"W2224071963","doi":"10.4230/lipics.tqc.2015.147","title":"Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Random oracle; Computer science; Schnorr signature; Oracle; Quantum; Theoretical computer science; Quantum computer; Signature (topology); Cryptography; Provable security; Algorithm; Digital signature; Mathematics; Hash function; Encryption; Blind signature; Public-key cryptography; Computer security; Programming language; Quantum mechanics; Physics","score_opus":0.06318378054687857,"score_gpt":0.3127094173486242,"score_spread":0.2495256368017456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224071963","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056091864,0.00016834708,0.92992985,0.0020587111,0.0001162645,0.00010602754,0.00017740174,0.0010560335,0.010295524],"genre_scores_gemma":[0.8091501,0.0006038346,0.17860158,0.0007239921,0.00022078281,0.00026202085,0.00035466164,0.00037302927,0.009709939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951332,0.0014594728,0.00030120366,0.0008212409,0.0016046364,0.0006802848],"domain_scores_gemma":[0.994669,0.0022985023,0.0004104056,0.002155404,0.0002816032,0.00018502469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003191773,0.00067546713,0.0009180575,0.0007300966,0.0010483824,0.0029379898,0.0016400793,0.001849527,0.003227478],"category_scores_gemma":[0.007891372,0.00057965866,0.0016924097,0.001232685,0.0066573676,0.01058572,0.004119613,0.0058485107,0.0008955085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007520649,0.000037830778,0.00013024567,0.000039650924,0.000015973585,0.000109737484,0.00020083392,0.012995051,0.0027983712,0.97518265,0.00065147993,0.007763056],"study_design_scores_gemma":[0.000046882895,0.00003611673,0.000097256336,0.000015308078,0.00002717004,0.00009917397,0.000029963187,0.06483987,0.0105034495,0.91942436,0.0048453836,0.000035086185],"about_ca_topic_score_codex":0.00064533984,"about_ca_topic_score_gemma":0.00039043243,"teacher_disagreement_score":0.003227478,"about_ca_system_score_codex":0.0015787933,"about_ca_system_score_gemma":0.0015825815,"threshold_uncertainty_score":0.016879916},"labels":[],"label_agreement":null},{"id":"W2234612416","doi":"10.4230/dagrep.4.8.1","title":"Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Uniwersytet Opolski; Universität Ulm; Goethe-Universität Frankfurt am Main; Clermont Université; Universidad de Chile; University of Waterloo; Technische Universität Wien; Technische Universität Darmstadt; Libera Università di Bolzano; Universität Bremen; Vienna Science and Technology Fund; University of Oxford; Technische Universität Dresden; Imperial College London; University of Washington; University of Pennsylvania","keywords":"Decidability; Computer science; Knowledge representation and reasoning; Representation (politics); Constraint (computer-aided design); Constraint satisfaction; Constraint satisfaction problem; Programming language; Artificial intelligence; Theoretical computer science; Political science; Mathematics","score_opus":0.011470493594912678,"score_gpt":0.24414770634958488,"score_spread":0.2326772127546722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234612416","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0315787,0.08325944,0.42712685,0.20969056,0.0508897,0.0015895305,0.013418897,0.010645843,0.17180055],"genre_scores_gemma":[0.2600637,0.044885833,0.30043563,0.015661664,0.023115734,0.0024990432,0.03007522,0.0109254215,0.3123377],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98644906,0.0048740897,0.0007947681,0.0015934164,0.004916749,0.0013718617],"domain_scores_gemma":[0.99208426,0.003276009,0.00026365253,0.0008042417,0.0017848174,0.0017870581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02203769,0.002307852,0.0025496352,0.0030220165,0.0021415122,0.009773492,0.0031280736,0.003723574,0.033599675],"category_scores_gemma":[0.02100921,0.0014622763,0.0022958477,0.0038916403,0.0028616742,0.005919562,0.007592553,0.007201379,0.018141665],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009091537,0.0005911625,0.00030497374,0.00068207365,0.00012434201,0.0004755733,0.0008996953,0.006489332,0.0039614146,0.1690419,0.6355084,0.18101195],"study_design_scores_gemma":[0.00050024304,0.0001924788,0.0013494944,0.0005318794,0.00006421888,0.00035948458,0.00026236445,0.012153062,0.0071284063,0.16961882,0.8077016,0.00013789607],"about_ca_topic_score_codex":0.007777967,"about_ca_topic_score_gemma":0.0067258435,"teacher_disagreement_score":0.033599675,"about_ca_system_score_codex":0.008341054,"about_ca_system_score_gemma":0.006796086,"threshold_uncertainty_score":0.11654782},"labels":[],"label_agreement":null},{"id":"W2244339006","doi":"10.4230/dagsemproc.10431.2","title":"10431 Report – Software Engineering for Self-Adaptive Systems","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Software engineering; Software system; Cover (algebra); Software; Adaptive system; Resource (disambiguation); Software development; Distributed computing; Engineering; Operating system; Artificial intelligence","score_opus":0.04869480189528133,"score_gpt":0.25725483047034836,"score_spread":0.20856002857506703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244339006","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022275945,0.0209555,0.34730875,0.059414804,0.013935256,0.0025716738,0.003704962,0.0069992356,0.5228339],"genre_scores_gemma":[0.14802565,0.032934714,0.23536694,0.0046789185,0.007557131,0.004169136,0.017546248,0.0059918924,0.54372936],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9918943,0.002152932,0.0007902667,0.0005244978,0.0041893576,0.00044872134],"domain_scores_gemma":[0.9895264,0.0037687276,0.000550555,0.0017080539,0.0036513237,0.00079501147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0104845045,0.0017086384,0.00080707547,0.0028915491,0.0014807901,0.0038783296,0.0017927344,0.0040432224,0.060625557],"category_scores_gemma":[0.014600186,0.0005226115,0.0008224777,0.001962758,0.0013186284,0.005421688,0.0032921156,0.004012324,0.036349062],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030669966,0.00067853136,0.0013651581,0.00067350303,0.000086055385,0.00053791236,0.00053458114,0.00861336,0.0074489512,0.21906433,0.53362185,0.22706908],"study_design_scores_gemma":[0.000097366996,0.000500563,0.0013557633,0.00042230816,0.00003574823,0.00048676302,0.0001745485,0.012445782,0.008643518,0.045756876,0.93001246,0.00006834753],"about_ca_topic_score_codex":0.002284087,"about_ca_topic_score_gemma":0.001650509,"teacher_disagreement_score":0.060625557,"about_ca_system_score_codex":0.002433524,"about_ca_system_score_gemma":0.003840927,"threshold_uncertainty_score":0.20281267},"labels":[],"label_agreement":null},{"id":"W2244997347","doi":"10.4230/lipics.csl.2012.9","title":"Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Proof complexity; Propositional variable; Computer science; Well-formed formula; Proof theory; Propositional calculus; Structural proof theory; Theoretical computer science; Calculus (dental); Mathematics; Programming language; Mathematical proof; Description logic; Intermediate logic; Medicine","score_opus":0.026254694933324902,"score_gpt":0.2601708381694452,"score_spread":0.23391614323612028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244997347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044001967,0.20159718,0.48811638,0.08764057,0.019415528,0.00010655025,0.0008483233,0.0014338993,0.15683967],"genre_scores_gemma":[0.63762903,0.0983347,0.09517962,0.018040337,0.039060198,0.00061818294,0.0017446165,0.0012884311,0.108104855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856323,0.0005798692,0.00006154856,0.00027685642,0.0003732564,0.00014524226],"domain_scores_gemma":[0.9968779,0.0024943727,0.00010101939,0.00014085874,0.00022698472,0.00015883944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026430315,0.0008488755,0.0009383355,0.0026513354,0.0015977406,0.005843021,0.00095762865,0.0021220148,0.015451644],"category_scores_gemma":[0.007351427,0.00090119475,0.00092294096,0.0027959119,0.0033095086,0.010120137,0.0042177364,0.0052030087,0.0025348088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005915855,0.000030813466,0.00023266579,0.0003068896,0.000045770415,0.00008492857,0.00045111484,0.001346074,0.00065491075,0.92307353,0.0396917,0.034022454],"study_design_scores_gemma":[0.000014494886,0.000014727401,0.0003002037,0.0001396563,0.000028335338,0.00008872109,0.00012566903,0.0014249018,0.00030165332,0.94277644,0.054762002,0.000023270855],"about_ca_topic_score_codex":0.0007547019,"about_ca_topic_score_gemma":0.00053037,"teacher_disagreement_score":0.015451644,"about_ca_system_score_codex":0.00298744,"about_ca_system_score_gemma":0.00080104783,"threshold_uncertainty_score":0.051690876},"labels":[],"label_agreement":null},{"id":"W2245114686","doi":"10.4230/lipics.stacs.2009.1835","title":"Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Bounded function; Steiner tree problem; Combinatorics; Planar graph; Pathwidth; Mathematics; Genus; Chordal graph; 1-planar graph; Indifference graph; Discrete mathematics; Time complexity; Treewidth; Clique-sum; Polynomial; Graph; Line graph","score_opus":0.01680353275891705,"score_gpt":0.24790817499607065,"score_spread":0.2311046422371536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245114686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18438798,0.0014498467,0.7960003,0.0023733317,0.00015474693,0.00038909793,0.0011710107,0.003478484,0.010595092],"genre_scores_gemma":[0.6457407,0.0009323612,0.34615874,0.00031601122,0.00015138934,0.00037224856,0.002337919,0.00041542575,0.003575115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795026,0.00045300843,0.00013429347,0.0004382321,0.0005414923,0.0004827327],"domain_scores_gemma":[0.9898122,0.006326037,0.0005910421,0.0024738412,0.000434682,0.0003621376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021505991,0.0015806345,0.0017805877,0.0009029055,0.0014798823,0.003593362,0.004500554,0.0019330712,0.0071701747],"category_scores_gemma":[0.012877305,0.0006312841,0.0019726502,0.002659602,0.0011746914,0.00851693,0.002673653,0.0033207198,0.0012377357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001996503,0.0005169633,0.0042696227,0.0010588977,0.00024369225,0.00023837562,0.0012697373,0.5445245,0.012032576,0.16328359,0.017571004,0.25299457],"study_design_scores_gemma":[0.0001801729,0.00013647729,0.00047294318,0.000047846443,0.00011535992,0.00023661698,0.00023549408,0.84866947,0.005978796,0.13894884,0.0049524256,0.000025597585],"about_ca_topic_score_codex":0.0031322963,"about_ca_topic_score_gemma":0.0048241625,"teacher_disagreement_score":0.0071701747,"about_ca_system_score_codex":0.003566611,"about_ca_system_score_gemma":0.0023490665,"threshold_uncertainty_score":0.025877655},"labels":[],"label_agreement":null},{"id":"W2245981342","doi":"10.4230/lipics.csl.2013.296","title":"Theories for Subexponential-size Bounded-depth Frege Proofs","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Mathematical proof; Bounded function; Proof complexity; Mathematics; Discrete mathematics; Class (philosophy); Complexity class; Pigeonhole principle; Proof theory; Computer science; Time complexity","score_opus":0.01360851346926505,"score_gpt":0.2445596853273095,"score_spread":0.23095117185804445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245981342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08090493,0.0010107699,0.8832464,0.0025933092,0.00013456945,0.00031999144,0.00067596533,0.0017338543,0.02938026],"genre_scores_gemma":[0.58595645,0.00092810043,0.39723602,0.001473104,0.00041283478,0.0006509124,0.0012495414,0.000591089,0.011501963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952173,0.0007942297,0.0002914758,0.0008774288,0.0021464415,0.00067316194],"domain_scores_gemma":[0.9765062,0.015882434,0.0018358016,0.0036184518,0.0016304523,0.00052671466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030856554,0.0007347945,0.00089333794,0.0024163956,0.0016551275,0.0044683777,0.0028465688,0.0015027333,0.010130655],"category_scores_gemma":[0.021280589,0.0010397057,0.0031348355,0.0015568496,0.0038571386,0.017390773,0.004384911,0.006993996,0.00087056233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043820077,0.000041725696,0.0008135046,0.00013692895,0.000023140277,0.00005929942,0.00026565514,0.006897385,0.0017506399,0.97589195,0.0015146111,0.012561388],"study_design_scores_gemma":[0.0000368305,0.00003233107,0.00085946394,0.00006044976,0.000059328064,0.00018889192,0.00011300851,0.06915011,0.0046104677,0.91389585,0.010956394,0.000036873345],"about_ca_topic_score_codex":0.0033400056,"about_ca_topic_score_gemma":0.0046419585,"teacher_disagreement_score":0.010130655,"about_ca_system_score_codex":0.0074427132,"about_ca_system_score_gemma":0.0026129882,"threshold_uncertainty_score":0.054000914},"labels":[],"label_agreement":null},{"id":"W2248358623","doi":"10.4230/lipics.csl.2011.381","title":"A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Complexity class; Bipartite graph; Mathematical proof; Lexicographical order; Mathematics; Class (philosophy); Discrete mathematics; Completeness (order theory); Matching (statistics); Computational complexity theory; Computer science; Combinatorics; Time complexity; Theoretical computer science; Graph; Algorithm; Artificial intelligence","score_opus":0.055634707499851235,"score_gpt":0.2694607798329779,"score_spread":0.21382607233312667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248358623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043672934,0.0036915413,0.85404944,0.0095065925,0.00069284916,0.0004901421,0.001856489,0.00051291607,0.08552703],"genre_scores_gemma":[0.6398875,0.003976322,0.32056522,0.0039636367,0.002777504,0.0027216307,0.0033194262,0.00037574893,0.022412984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961493,0.00082416745,0.00037025692,0.0007926878,0.0013623959,0.00050115754],"domain_scores_gemma":[0.99019146,0.0068005705,0.00065080647,0.00088967936,0.0010063174,0.00046127263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003365856,0.0012568927,0.0012046747,0.0058100964,0.0034453557,0.00782432,0.002391624,0.0028930851,0.009780791],"category_scores_gemma":[0.010373257,0.0006998409,0.0029509135,0.0062420843,0.009108367,0.017029777,0.0051809046,0.009651416,0.001165556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060561897,0.000015559763,0.00008311192,0.0000423478,0.000004171494,0.000020882688,0.00010603709,0.0007336224,0.00013093758,0.9941743,0.001074132,0.0036089332],"study_design_scores_gemma":[0.000014667138,0.000018258528,0.00018024183,0.000023061051,0.000007734945,0.000095166724,0.00008008417,0.0056878594,0.0002897334,0.98433775,0.009247535,0.000017796814],"about_ca_topic_score_codex":0.0024868974,"about_ca_topic_score_gemma":0.0012281558,"teacher_disagreement_score":0.009780791,"about_ca_system_score_codex":0.005382829,"about_ca_system_score_gemma":0.0022054352,"threshold_uncertainty_score":0.039055407},"labels":[],"label_agreement":null},{"id":"W2249023948","doi":"10.4230/lipics.approx-random.2014.721","title":"Communication Complexity of Set-Disjointness for All Probabilities","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Communication complexity; Characterization (materials science); Mathematics; Bounded function; Upper and lower bounds; Class (philosophy); Complexity class; Discrete mathematics; Set (abstract data type); Combinatorics; Alpha (finance); Computational complexity theory; Time complexity; Computer science; Algorithm","score_opus":0.05522852973585569,"score_gpt":0.28918484811893547,"score_spread":0.2339563183830798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249023948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4900705,0.00070652727,0.48646322,0.0064958096,0.000097196484,0.00022169018,0.0008750766,0.0005589224,0.014511008],"genre_scores_gemma":[0.96721554,0.00037619038,0.027060797,0.00038938504,0.00023158718,0.00032365188,0.0003410563,0.00016570452,0.0038960455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904974,0.0035415448,0.00038306945,0.0019231923,0.0021301687,0.0015245975],"domain_scores_gemma":[0.9024466,0.08206389,0.0052397824,0.006973353,0.0014623803,0.0018140007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060133953,0.0013790447,0.00198668,0.0013811693,0.0017706158,0.0054176627,0.0038738672,0.0026541613,0.006118221],"category_scores_gemma":[0.039400034,0.00080434687,0.0026758804,0.0015821619,0.0054614292,0.013310825,0.00635508,0.00936303,0.000583549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052312907,0.00020799469,0.0022554016,0.00023621655,0.0001416942,0.00024214342,0.00066794694,0.17915346,0.0031923347,0.79871696,0.0022072438,0.012455482],"study_design_scores_gemma":[0.00006703153,0.00005254791,0.00036684162,0.000017489838,0.000036570516,0.00006743516,0.00006140632,0.45344734,0.0017187112,0.5434777,0.00065665477,0.00003022858],"about_ca_topic_score_codex":0.0019030944,"about_ca_topic_score_gemma":0.0009425822,"teacher_disagreement_score":0.006118221,"about_ca_system_score_codex":0.005763544,"about_ca_system_score_gemma":0.0023103852,"threshold_uncertainty_score":0.041817665},"labels":[],"label_agreement":null},{"id":"W2249508463","doi":"10.4230/oasics.cmn.2013.158","title":"Constructing Spatial Representations from Narratives and Non-Narrative Descriptions: Evidence from 7-year-olds","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Spatial Cognition and Navigation","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Narrative; Construct (python library); Neighbourhood (mathematics); Narrative inquiry; Narrative network; Narrative criticism; Cognition; Comprehension; Psychology; Cognitive psychology; Narrative structure; Linguistics; Computer science; Mathematics","score_opus":0.018226694046280936,"score_gpt":0.25054892215536445,"score_spread":0.2323222281090835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249508463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9991642,0.00013193431,0.00007338573,0.000015221583,0.0000032071,0.000010946978,0.000072296316,0.0000048761844,0.0005239708],"genre_scores_gemma":[0.99786466,0.0005283734,0.00056209584,0.000029514826,0.000005168848,0.000026028663,0.00022441504,0.0000069059265,0.00075284595],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99917597,0.00014234154,0.0001354932,0.00019148522,0.00023911514,0.00011558586],"domain_scores_gemma":[0.9914113,0.0038522675,0.0018022434,0.0009891092,0.0013966032,0.0005484839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025396044,0.000642873,0.0007342236,0.0014177934,0.00050934387,0.0024518976,0.0006297856,0.0008065757,0.002083502],"category_scores_gemma":[0.0109147625,0.0006598878,0.00045377188,0.000627096,0.0022901162,0.0017305287,0.00142886,0.0009358988,0.0008879805],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007186301,0.001258402,0.6319891,0.0010527617,0.00015747819,0.007427458,0.26596195,0.0004903474,0.021397766,0.0012682586,0.0013069385,0.06697091],"study_design_scores_gemma":[0.0000510416,0.0016710163,0.8919779,0.00026155522,0.00019279125,0.00453077,0.08535957,0.00049080915,0.006446671,0.0010384971,0.007865178,0.00011416906],"about_ca_topic_score_codex":0.010056716,"about_ca_topic_score_gemma":0.011624893,"teacher_disagreement_score":0.010056716,"about_ca_system_score_codex":0.00037353256,"about_ca_system_score_gemma":0.00047977766,"threshold_uncertainty_score":0.019996345},"labels":[],"label_agreement":null},{"id":"W2250040917","doi":"10.4230/oasics.cmn.2013.147","title":"Testing Reader Ethical Judgments over the Course of a Narrative","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Ethics in Business and Education","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Narrative; Reading (process); Psychology; Test (biology); Ethical issues; Social psychology; Computer science; Engineering ethics; Linguistics; Philosophy; Engineering","score_opus":0.16992978183789928,"score_gpt":0.4150164531278844,"score_spread":0.2450866712899851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250040917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841928,0.000057239886,0.008611332,0.00011955078,0.000028808494,0.00023980251,0.000058540707,0.0001158126,0.0065760557],"genre_scores_gemma":[0.9821813,0.00008155219,0.014147745,0.000086361986,0.00002286094,0.00029089663,0.00013994746,0.000032750002,0.0030166775],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9906769,0.006048414,0.00053861825,0.0013200705,0.0011415903,0.00027443763],"domain_scores_gemma":[0.8345479,0.13963953,0.009115542,0.0073689893,0.0070969677,0.0022311483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0104557425,0.00057755614,0.000485184,0.00084291334,0.0007628117,0.0037160784,0.000781085,0.0015432399,0.0055712434],"category_scores_gemma":[0.08995229,0.0003967223,0.0003702219,0.00045718602,0.0012070724,0.0027848422,0.0018327659,0.001338284,0.0014017706],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006383404,0.011334137,0.187244,0.0011034556,0.00029599853,0.0018242114,0.26229316,0.0068900683,0.1751074,0.009478149,0.0034696495,0.33457634],"study_design_scores_gemma":[0.0011609867,0.03040189,0.4074888,0.0008200603,0.00059564156,0.0034939689,0.13913088,0.04952267,0.27964917,0.04377439,0.043208253,0.0007533026],"about_ca_topic_score_codex":0.00025889202,"about_ca_topic_score_gemma":0.00041753444,"teacher_disagreement_score":0.0104557425,"about_ca_system_score_codex":0.0005835915,"about_ca_system_score_gemma":0.00045562044,"threshold_uncertainty_score":0.055295885},"labels":[],"label_agreement":null},{"id":"W2252374344","doi":"10.4230/lipics.ecoop.2015.76","title":"Concrete Types for TypeScript","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Agence Nationale de la Recherche; National Science Foundation","keywords":"TypeScript; JavaScript; Computer science; Programming language; Compiler; Toolchain; Code (set theory); Point (geometry); Software engineering; Set (abstract data type); Software","score_opus":0.04170734998501201,"score_gpt":0.2783358575516958,"score_spread":0.2366285075666838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252374344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018978476,0.00072656106,0.9542669,0.0009120608,0.0009027706,0.00013751954,0.0017000802,0.016323954,0.023132343],"genre_scores_gemma":[0.08832259,0.0019883765,0.85157436,0.002174711,0.0010279211,0.00088198384,0.0055268332,0.016338093,0.032165132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576616,0.00074110104,0.00073664554,0.0006245239,0.0017873867,0.00034420943],"domain_scores_gemma":[0.99307233,0.002298717,0.00054385356,0.002579571,0.0012235894,0.00028190346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039768135,0.0011519212,0.0009022248,0.0017323748,0.0017007857,0.007179991,0.0028380218,0.0021549424,0.045566652],"category_scores_gemma":[0.014479942,0.0015649945,0.0023395827,0.0024395275,0.003078999,0.011154571,0.004887882,0.005736912,0.024362568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014628205,0.00003485083,0.0005880876,0.0005035128,0.00002798378,0.00022051184,0.000479779,0.0014884634,0.0041324366,0.88078445,0.041731168,0.06986246],"study_design_scores_gemma":[0.000055643253,0.00002504591,0.0001558149,0.00028436002,0.000034359466,0.0005206724,0.000080181926,0.007068187,0.007844289,0.5528443,0.4310212,0.00006604939],"about_ca_topic_score_codex":0.001101268,"about_ca_topic_score_gemma":0.0013354345,"teacher_disagreement_score":0.045566652,"about_ca_system_score_codex":0.0018924096,"about_ca_system_score_gemma":0.0026858642,"threshold_uncertainty_score":0.1524356},"labels":[],"label_agreement":null},{"id":"W2252725190","doi":"10.4230/lipics.socg.2015.733","title":"A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Algorithm; Computer science; Combinatorics; Mathematics; Convex set; Convex optimization; Geometry","score_opus":0.03449451087858447,"score_gpt":0.29835211687478386,"score_spread":0.2638576059961994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252725190","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049461066,0.00015626913,0.9867632,0.00019145488,0.00008433697,0.000143338,0.0001915345,0.004214089,0.003309696],"genre_scores_gemma":[0.05489603,0.00010860539,0.9394588,0.00011933407,0.000042725373,0.00028102903,0.0011103996,0.00087376515,0.0031092889],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976808,0.00021513247,0.0002090976,0.00057700503,0.00096404646,0.00035395598],"domain_scores_gemma":[0.99728775,0.0011458185,0.00009078155,0.00074850017,0.0005949,0.00013215806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094334735,0.0020812855,0.0026371994,0.0023005514,0.0021068046,0.0025107362,0.0042621633,0.0025164208,0.02654521],"category_scores_gemma":[0.0055654766,0.0013528767,0.0028481379,0.0042691627,0.0016608356,0.0046549994,0.006319183,0.0040754355,0.008212509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076595356,0.00036336313,0.0010517566,0.000679395,0.00016318253,0.0003677059,0.000763726,0.069276,0.018486995,0.07080611,0.027441861,0.80983394],"study_design_scores_gemma":[0.00062405475,0.00026729502,0.0006373245,0.000080964695,0.00012083232,0.0005111922,0.00038588836,0.7937176,0.025313564,0.14467472,0.033479348,0.00018724625],"about_ca_topic_score_codex":0.007462536,"about_ca_topic_score_gemma":0.00854545,"teacher_disagreement_score":0.02654521,"about_ca_system_score_codex":0.0019239802,"about_ca_system_score_gemma":0.002238754,"threshold_uncertainty_score":0.08880252},"labels":[],"label_agreement":null},{"id":"W2264380204","doi":"10.4230/lipics.approx-random.2014.857","title":"It’s a Small World for Random Surfers","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PageRank; Logarithm; Upper and lower bounds; Random graph; Graph; Combinatorics; Computer science; Tree (set theory); Mathematics; Selection (genetic algorithm); Discrete mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.01649037442209622,"score_gpt":0.26245746898906425,"score_spread":0.24596709456696803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264380204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2789433,0.0034034315,0.67211264,0.0050005596,0.0003957985,0.00015154669,0.0007523467,0.001208975,0.038031477],"genre_scores_gemma":[0.9434923,0.0025560642,0.038209844,0.00082707126,0.00065704656,0.00022570947,0.0005808007,0.00029635892,0.013154901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871707,0.0003428767,0.000045403904,0.00043286363,0.00027354364,0.00018825139],"domain_scores_gemma":[0.97967166,0.014176348,0.0022544223,0.001697835,0.0008438843,0.0013558292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014322316,0.0010470792,0.001564099,0.002387684,0.0015978828,0.0047978666,0.0014693001,0.0018343882,0.008028006],"category_scores_gemma":[0.0158532,0.00072288356,0.00131459,0.0013553915,0.0029880719,0.008960399,0.0024357012,0.0027401978,0.00133788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034638392,0.00013001183,0.004688792,0.00059048715,0.00019247166,0.00092443865,0.00070711656,0.05885067,0.011333975,0.88283575,0.014358111,0.02504187],"study_design_scores_gemma":[0.00005938923,0.00011644403,0.0016333987,0.00006593403,0.00010887314,0.00075868436,0.00022775459,0.33266446,0.003151476,0.6526938,0.008463183,0.000056536104],"about_ca_topic_score_codex":0.0012118033,"about_ca_topic_score_gemma":0.0012446749,"teacher_disagreement_score":0.008028006,"about_ca_system_score_codex":0.0012990774,"about_ca_system_score_gemma":0.0004102755,"threshold_uncertainty_score":0.026856363},"labels":[],"label_agreement":null},{"id":"W2266970999","doi":"10.4230/oasics.atmos.2015.95","title":"A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper)","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Instituto de Sistemas Complejos de Ingeniería","keywords":"Modal; Competition (biology); Integer (computer science); Integer programming; Computer science; Mathematical optimization; Linear programming; Flow network; Network planning and design; Algorithm; Mathematics; Telecommunications","score_opus":0.04996539748351885,"score_gpt":0.29056564212230135,"score_spread":0.2406002446387825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266970999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011721884,0.00046274677,0.9677231,0.00084565056,0.000109213295,0.00040250923,0.00070124783,0.0002731404,0.017760376],"genre_scores_gemma":[0.24599826,0.0010687095,0.72924066,0.00062081934,0.00025607258,0.002338569,0.0011447007,0.00032980615,0.01900233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887365,0.00048701058,0.00003063415,0.00023479741,0.00020700454,0.00016701425],"domain_scores_gemma":[0.9983494,0.0012318565,0.00012546036,0.000041475065,0.00015921534,0.00009256638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021649883,0.0018138706,0.0012676567,0.0007656683,0.00048544887,0.002297878,0.0012833152,0.0020822443,0.01490275],"category_scores_gemma":[0.003509657,0.00094293396,0.0013149199,0.0011538222,0.00080326915,0.0014128253,0.0014874607,0.0021075327,0.0014990616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009655157,0.0002052077,0.0002570312,0.0003416417,0.000033168497,0.00013784273,0.00008058151,0.9297566,0.0010597225,0.028938351,0.0057330118,0.033360247],"study_design_scores_gemma":[0.000048406135,0.000113447124,0.00007715879,0.000036601537,0.000016421569,0.000031532403,0.00003799727,0.9860502,0.00040915524,0.009706701,0.0034612226,0.000011118492],"about_ca_topic_score_codex":0.004314139,"about_ca_topic_score_gemma":0.0051029525,"teacher_disagreement_score":0.01490275,"about_ca_system_score_codex":0.0016824565,"about_ca_system_score_gemma":0.0025102692,"threshold_uncertainty_score":0.049854636},"labels":[],"label_agreement":null},{"id":"W2272363982","doi":"10.4230/lipics.tqc.2015.48","title":"The Spin-2 AKLT State on the Square Lattice is Universal for Measurement-based Quantum Computation","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum and electron transport phenomena","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; National Science Foundation","keywords":"Cluster state; Quantum computer; Quantum entanglement; Computation; Statistical physics; Computer science; Quantum; Theoretical computer science; Quantum mechanics; Physics; Algorithm","score_opus":0.03657021278199733,"score_gpt":0.26169996048825983,"score_spread":0.22512974770626248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272363982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8333223,0.00041482298,0.109553024,0.001115897,0.00017992636,0.000049400016,0.0002436273,0.0005633968,0.05455757],"genre_scores_gemma":[0.9856328,0.00009132256,0.012515375,0.00009851157,0.000024213976,0.000027007645,0.00005712047,0.00003312696,0.001520587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999819,0.00004705155,0.000009197872,0.000030764895,0.00005205659,0.000041954092],"domain_scores_gemma":[0.99966943,0.00011649816,0.000034792283,0.00010857031,0.0000312888,0.00003939682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025066308,0.000131325,0.00023209013,0.0003885638,0.0006656034,0.0011030723,0.00038014213,0.00054882467,0.0038425582],"category_scores_gemma":[0.00093338714,0.00014870257,0.00027773317,0.0003172268,0.0016336178,0.0012450982,0.0008158486,0.0006881718,0.0003533943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075303105,0.000045313063,0.00053221587,0.00005901602,0.000005854835,0.00016092048,0.00013666549,0.00956371,0.013781189,0.9660918,0.0013365411,0.008211618],"study_design_scores_gemma":[0.000033784603,0.000091108275,0.0010231561,0.000022473654,0.000007588422,0.00018020371,0.00017324022,0.1329948,0.010847566,0.850874,0.003710058,0.000041909185],"about_ca_topic_score_codex":0.0005721162,"about_ca_topic_score_gemma":0.0007102015,"teacher_disagreement_score":0.0038425582,"about_ca_system_score_codex":0.0004009471,"about_ca_system_score_gemma":0.000355837,"threshold_uncertainty_score":0.012854636},"labels":[],"label_agreement":null},{"id":"W2274270508","doi":"10.4230/lipics.approx-random.2014.596","title":"The Power of Super-logarithmic Number of Players","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Department of Science and Technology, Ministry of Science and Technology, India; National Science Foundation","keywords":"Block (permutation group theory); Logarithm; Combinatorics; Randomness; Mathematics; Communication complexity; Discrete mathematics; Boolean function; Function (biology); Matrix (chemical analysis)","score_opus":0.015729154624178603,"score_gpt":0.2995939864223142,"score_spread":0.2838648317981356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274270508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14684968,0.0018676071,0.755482,0.011785244,0.0005719476,0.0002250545,0.0005033979,0.0018501682,0.080864884],"genre_scores_gemma":[0.89000344,0.00088856276,0.07999297,0.0014576549,0.0004993959,0.0005545333,0.0002490153,0.000506319,0.02584815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917459,0.0033691484,0.00028315836,0.0017001707,0.0020052497,0.00089648],"domain_scores_gemma":[0.9573368,0.028111516,0.001317281,0.010800364,0.0012650607,0.0011689778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007124794,0.0011765973,0.001978837,0.00072703057,0.0014907193,0.004695595,0.004042988,0.0020322767,0.008954713],"category_scores_gemma":[0.03117995,0.0011631991,0.0013084904,0.00083961955,0.005627137,0.016526533,0.0068042185,0.006706369,0.0023974138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095350196,0.00010969923,0.0008386163,0.00029677773,0.00006808964,0.000286124,0.00034620313,0.028145757,0.00956053,0.9308971,0.0057649044,0.022732712],"study_design_scores_gemma":[0.00015724121,0.00010913553,0.00017904465,0.00005930959,0.000045964927,0.00023744367,0.00006175874,0.25157395,0.006345605,0.7333068,0.00788438,0.000039319566],"about_ca_topic_score_codex":0.0005578107,"about_ca_topic_score_gemma":0.0004150983,"teacher_disagreement_score":0.008954713,"about_ca_system_score_codex":0.0020182857,"about_ca_system_score_gemma":0.0016939201,"threshold_uncertainty_score":0.03767997},"labels":[],"label_agreement":null},{"id":"W2276905128","doi":"10.4230/lipics.approx-random.2015.265","title":"On Linear Programming Relaxations for Unsplittable Flow in Trees","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Linear programming relaxation; Path (computing); Omega; Tree (set theory); Rank (graph theory); Upper and lower bounds; Relaxation (psychology); Linear programming; Approximation algorithm; Binary logarithm; Constant (computer programming); Time complexity; Discrete mathematics; Algorithm; Computer science; Physics","score_opus":0.044742045626293775,"score_gpt":0.2913879659113839,"score_spread":0.2466459202850901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276905128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03637589,0.004154014,0.916285,0.0040291725,0.00030231097,0.00033357504,0.0007370118,0.00053356914,0.037249584],"genre_scores_gemma":[0.29927173,0.0075657284,0.66399163,0.0027880443,0.0012990624,0.0014514164,0.0021874493,0.0010043826,0.02044062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739313,0.0010122531,0.00009544767,0.00042900897,0.00050598785,0.0005640628],"domain_scores_gemma":[0.98739713,0.010546939,0.00078923005,0.00044656187,0.0005062089,0.00031393475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040627397,0.0029014386,0.001647067,0.0015407923,0.0013411401,0.0031096647,0.0018469398,0.0021801444,0.009520166],"category_scores_gemma":[0.019305585,0.0014414692,0.0028986586,0.003499938,0.0024456135,0.0065592946,0.0021016332,0.009779396,0.0017173904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031094748,0.0004655253,0.00071669184,0.0007445348,0.00009932622,0.00036338522,0.00064673164,0.63595355,0.0033001152,0.29409543,0.014905192,0.04839859],"study_design_scores_gemma":[0.0000959067,0.00013973638,0.00031391313,0.00016985193,0.000040410257,0.00016352301,0.00022384757,0.7365228,0.0011822782,0.2491453,0.0119629335,0.000039512644],"about_ca_topic_score_codex":0.005064487,"about_ca_topic_score_gemma":0.004700054,"teacher_disagreement_score":0.009520166,"about_ca_system_score_codex":0.0035149325,"about_ca_system_score_gemma":0.0020366034,"threshold_uncertainty_score":0.031848133},"labels":[],"label_agreement":null},{"id":"W2277373197","doi":"10.4230/lipics.ecoop.2015.321","title":"Hybrid DOM-Sensitive Change Impact Analysis for JavaScript","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"JavaScript; Computer science; Asynchronous communication; Static analysis; Unobtrusive JavaScript; Task (project management); Set (abstract data type); Ranking (information retrieval); Distributed computing; Data mining; Artificial intelligence; Programming language; Rich Internet application; Computer network","score_opus":0.05926056696419222,"score_gpt":0.3147781806116966,"score_spread":0.25551761364750436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277373197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16769786,0.0006656379,0.81128436,0.00013160506,0.000057155165,0.00042318288,0.0008919651,0.015965056,0.0028831537],"genre_scores_gemma":[0.6730058,0.00017526484,0.32317802,0.00007653781,0.000043236654,0.00019137021,0.0015149381,0.00064904295,0.0011657693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949988,0.0010710177,0.00037109762,0.0007280527,0.00251417,0.0003168145],"domain_scores_gemma":[0.9891431,0.0048500444,0.0012325207,0.0016987209,0.0027388055,0.00033675274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025843338,0.0011395209,0.0009025902,0.007613788,0.0006473356,0.0016789082,0.001129756,0.0007755783,0.0009542256],"category_scores_gemma":[0.011942477,0.00040558595,0.0009575397,0.0028113506,0.00050058606,0.0018784147,0.0017931466,0.0009985118,0.0005259534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072459923,0.00093394663,0.07915751,0.0006072295,0.0003522804,0.00076161535,0.00082305656,0.0820094,0.0903322,0.006480772,0.005639836,0.7321776],"study_design_scores_gemma":[0.000029500661,0.00023818623,0.026928116,0.000040165192,0.00009445381,0.000465118,0.00021891996,0.9212724,0.040158693,0.006660903,0.0038121033,0.000081503356],"about_ca_topic_score_codex":0.0026888894,"about_ca_topic_score_gemma":0.0040752087,"teacher_disagreement_score":0.007613788,"about_ca_system_score_codex":0.00072128675,"about_ca_system_score_gemma":0.0008544319,"threshold_uncertainty_score":0.013667464},"labels":[],"label_agreement":null},{"id":"W2278290577","doi":"10.4230/oasics.fsfma.2013.32","title":"On the Determinism of Multi-core Processors","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Core (optical fiber); Computer science; Multi-core processor; Determinism; Parallel computing; Philosophy; Telecommunications; Epistemology","score_opus":0.04619803570894649,"score_gpt":0.2935138285973516,"score_spread":0.2473157928884051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278290577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1310958,0.0208302,0.79916227,0.0049312254,0.00094245747,0.00012501661,0.00012387488,0.00065216975,0.04213706],"genre_scores_gemma":[0.9299045,0.0039169574,0.05751222,0.00060424366,0.00052142196,0.00018121036,0.000072649294,0.0001527508,0.0071340585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651957,0.0009437425,0.00017223567,0.0006112944,0.0012531946,0.0004999857],"domain_scores_gemma":[0.99210054,0.005279425,0.0006338718,0.0010021197,0.00078155386,0.00020248517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029793682,0.0004997429,0.0007295072,0.0009180064,0.0013532632,0.0020611226,0.0011044508,0.0010444212,0.001347744],"category_scores_gemma":[0.011909712,0.0007759646,0.0007331081,0.0006283024,0.0036309217,0.0033024065,0.0021582444,0.0031978393,0.00029438123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038915605,0.000067020985,0.0026528826,0.00036275596,0.000048094655,0.0003664937,0.0005356262,0.124805175,0.008520662,0.81332886,0.0022072804,0.046716046],"study_design_scores_gemma":[0.000038667764,0.00014082046,0.0010213822,0.00013198073,0.00003674369,0.00022136827,0.00007202674,0.27041876,0.0064212936,0.7087831,0.012654271,0.000059584163],"about_ca_topic_score_codex":0.001909525,"about_ca_topic_score_gemma":0.0016893061,"teacher_disagreement_score":0.0029793682,"about_ca_system_score_codex":0.0017135532,"about_ca_system_score_gemma":0.0018245504,"threshold_uncertainty_score":0.015756607},"labels":[],"label_agreement":null},{"id":"W2280397671","doi":"10.4230/dagrep.4.5.40","title":"The Future of Refactoring (Dagstuhl Seminar 14211)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal de Pernambuco; Universiteit Antwerpen; University of Waterloo; Eidgenössische Technische Hochschule Zürich; Universitetet i Oslo; Oregon State University; Technische Universiteit Delft; University of Bern; Google; Université Catholique de Louvain; Universidade de Pernambuco; Universität Trier; Portland State University; Iowa State University","keywords":"Code refactoring; Pace; Computer science; Software engineering; Plan (archaeology); Breakout; Work (physics); Software; Programming language; Engineering; Business","score_opus":0.007149529876516246,"score_gpt":0.24185171350493004,"score_spread":0.2347021836284138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280397671","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035590526,0.123506375,0.09094813,0.349328,0.1260888,0.0008997355,0.005496114,0.0052488097,0.2628934],"genre_scores_gemma":[0.22061965,0.03643461,0.063417934,0.02061247,0.025498953,0.0013112138,0.0076824985,0.005576811,0.6188458],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9921462,0.0025441253,0.00038103637,0.00086875784,0.0025648545,0.0014949252],"domain_scores_gemma":[0.99545234,0.0010649929,0.00022341097,0.00038282218,0.0009976185,0.0018788367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012861761,0.0015652784,0.000930676,0.0020397652,0.0021770669,0.008374119,0.0019684546,0.0046041557,0.04619956],"category_scores_gemma":[0.010797955,0.0007690342,0.0011714229,0.0018536291,0.0018780733,0.005297951,0.0072929496,0.005463846,0.027306186],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045270563,0.00024382296,0.00028090522,0.00045462028,0.000026761953,0.00032109814,0.0015926715,0.0010587516,0.004505485,0.054421257,0.75495905,0.1816829],"study_design_scores_gemma":[0.00006812837,0.00012601202,0.00078013045,0.00030551045,0.000010107824,0.00015320159,0.00024793946,0.0005513527,0.0021849836,0.018776804,0.9767646,0.00003118219],"about_ca_topic_score_codex":0.0015634975,"about_ca_topic_score_gemma":0.0018225427,"teacher_disagreement_score":0.04619956,"about_ca_system_score_codex":0.0044961893,"about_ca_system_score_gemma":0.004723132,"threshold_uncertainty_score":0.15455294},"labels":[],"label_agreement":null},{"id":"W2281674668","doi":"10.4230/lipics.types.2014.72","title":"Typeful Normalization by Evaluation","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Continuation; Normalization (sociology); Metaprogramming; Computer science; Modulo; Programming language; Type inference; Syntax; System F; Simply typed lambda calculus; Functional programming; Algebraic number; Algebra over a field; Inference; Typed lambda calculus; Lambda calculus; Mathematics; Discrete mathematics; Pure mathematics; Artificial intelligence","score_opus":0.03913021365096173,"score_gpt":0.28294360305770117,"score_spread":0.24381338940673944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281674668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007941253,0.0001793455,0.9700818,0.0003259629,0.0003059228,0.0000821619,0.0001669347,0.0071301484,0.013786338],"genre_scores_gemma":[0.33802304,0.000676531,0.61271673,0.0013592863,0.00036979848,0.00050066045,0.000623545,0.011613456,0.0341169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99273235,0.0012707758,0.0006391953,0.0013980975,0.0030730863,0.000886446],"domain_scores_gemma":[0.9922511,0.0015776836,0.00025260227,0.0041609183,0.0015547147,0.00020291221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005437302,0.00094723806,0.001424397,0.0011983647,0.001433339,0.005086295,0.0032281426,0.0012430548,0.009703087],"category_scores_gemma":[0.015362989,0.0009522543,0.0017849403,0.0013065017,0.005259158,0.010432761,0.0072169933,0.0037232277,0.0039439136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018146136,0.00008789211,0.0012652911,0.00024087826,0.000053308504,0.00020536927,0.00083454483,0.004554742,0.009868317,0.8625127,0.007338205,0.11285731],"study_design_scores_gemma":[0.00004880035,0.000056373858,0.00034201168,0.0001435625,0.000109976434,0.0003513401,0.00014337724,0.04246641,0.049419764,0.7881551,0.11865498,0.00010834949],"about_ca_topic_score_codex":0.001648414,"about_ca_topic_score_gemma":0.001632471,"teacher_disagreement_score":0.009703087,"about_ca_system_score_codex":0.0019092225,"about_ca_system_score_gemma":0.002737581,"threshold_uncertainty_score":0.032460093},"labels":[],"label_agreement":null},{"id":"W2282111065","doi":"10.4230/dagrep.4.10.51","title":"Optimal algorithms and proofs (Dagstuhl Seminar 14421)","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Council for Research in the Social Sciences, Columbia University; Universität Wien; Julius-Maximilians-Universität Würzburg; Université de Fribourg; Kungliga Tekniska Högskolan; University of Toronto; Universität Ulm; University of Leeds; Middlesex University; State University of New York; National Institute of Informatics; Univerzita Karlova v Praze; Technische Universität Chemnitz","keywords":"Mathematical proof; Computer science; Theoretical computer science; Algorithm; Mathematics","score_opus":0.027977739421020744,"score_gpt":0.28091864407180567,"score_spread":0.25294090465078495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282111065","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016878605,0.16940601,0.13654892,0.17101295,0.07505097,0.00050017337,0.010994306,0.004684233,0.41492376],"genre_scores_gemma":[0.27678752,0.04819218,0.11232637,0.02076581,0.041070927,0.0014071468,0.01292836,0.0060429075,0.48047885],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931075,0.0025170199,0.00035231587,0.0009278348,0.0023045314,0.0007908675],"domain_scores_gemma":[0.99703634,0.0010895777,0.00014800757,0.00042184468,0.00058201404,0.000722296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008963508,0.0022980168,0.0021093837,0.0026981735,0.0018962673,0.0076363683,0.0020566287,0.0035866944,0.06127673],"category_scores_gemma":[0.011919626,0.0010001112,0.0019415295,0.0031909053,0.002298896,0.0043247063,0.0046903696,0.007097813,0.027660826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039948692,0.00020592946,0.00017480507,0.0004571735,0.00006450264,0.0001823954,0.00027950213,0.0028249614,0.0015856174,0.28487423,0.60084563,0.10810571],"study_design_scores_gemma":[0.0002461879,0.00014028662,0.001303875,0.0003930153,0.00005007954,0.00021040204,0.0000746284,0.0037623725,0.0019939654,0.31511334,0.6766516,0.0000602551],"about_ca_topic_score_codex":0.0022471747,"about_ca_topic_score_gemma":0.002119124,"teacher_disagreement_score":0.06127673,"about_ca_system_score_codex":0.0075616986,"about_ca_system_score_gemma":0.0038936296,"threshold_uncertainty_score":0.2049911},"labels":[],"label_agreement":null},{"id":"W2282291731","doi":"10.4230/lipics.tqc.2014.36","title":"Quantum Communication Complexity with Coherent States and Linear Optics","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum information science; Communication complexity; Superposition principle; Computer science; Qubit; Quantum network; Unitary state; Quantum; Coherent states; Quantum error correction; Physics; Quantum information; Theoretical computer science; Quantum mechanics; Quantum entanglement","score_opus":0.018224700737952276,"score_gpt":0.25844339205781885,"score_spread":0.2402186913198666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282291731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03772397,0.00054825225,0.92877823,0.0025462003,0.00016065163,0.00016360678,0.00013505497,0.0001744554,0.029769497],"genre_scores_gemma":[0.7274093,0.0012231419,0.25658968,0.0006616305,0.00044128727,0.00068737724,0.0001793709,0.00014216169,0.012666071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958086,0.0014168262,0.00024083779,0.0005261006,0.0015631455,0.00044440504],"domain_scores_gemma":[0.99088216,0.006320181,0.0005601829,0.0015744376,0.00043144813,0.00023159677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030184272,0.0008517287,0.0006812389,0.0010625599,0.0011590045,0.0035423841,0.0017058816,0.002042865,0.0049513397],"category_scores_gemma":[0.010669471,0.00049177924,0.0010456752,0.0013309435,0.0058304286,0.011487306,0.00470911,0.0049601193,0.00078846654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013437216,0.000016619462,0.00003214613,0.00002916398,0.0000044849126,0.00002003637,0.000057086036,0.006560072,0.00059972086,0.9886431,0.00033894202,0.0036852069],"study_design_scores_gemma":[0.000014407697,0.000024095378,0.000035834106,0.000012403296,0.0000060788702,0.000039953768,0.000020972991,0.049794916,0.001311872,0.9468054,0.0019205555,0.000013479388],"about_ca_topic_score_codex":0.00047992173,"about_ca_topic_score_gemma":0.0003385296,"teacher_disagreement_score":0.0049513397,"about_ca_system_score_codex":0.002521453,"about_ca_system_score_gemma":0.0018807172,"threshold_uncertainty_score":0.018294513},"labels":[],"label_agreement":null},{"id":"W2282607975","doi":"10.4230/lipics.fsttcs.2012.325","title":"k-delivery traveling salesman problem on tree networks","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Travelling salesman problem; Pickup; Routing (electronic design automation); Vehicle routing problem; Tree (set theory); Traveling purchaser problem; Computer science; Mathematical optimization; Mathematics; Combinatorics; 2-opt; Artificial intelligence; Computer network","score_opus":0.017013542441611736,"score_gpt":0.2445203401976485,"score_spread":0.22750679775603677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282607975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10847253,0.0010808257,0.87774915,0.0007872557,0.00008699346,0.00015127313,0.000582863,0.0002569442,0.010832285],"genre_scores_gemma":[0.65412027,0.0026351516,0.3261667,0.00028032536,0.00014425442,0.00033465936,0.0014559221,0.00018943178,0.014673326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999511,0.00015994819,0.000028368693,0.00012305594,0.000083966894,0.0000935764],"domain_scores_gemma":[0.99924004,0.000509071,0.00009596371,0.000039107737,0.00006132844,0.000054446296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006404714,0.0005022546,0.00076628366,0.0003957038,0.0006079038,0.0010171884,0.00092967233,0.00088360644,0.0044895587],"category_scores_gemma":[0.0022769393,0.000307339,0.0005251449,0.0012008734,0.00046304235,0.0024884664,0.00091372046,0.0006800366,0.0006413039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019394206,0.00011321714,0.0007769582,0.00042241954,0.00006836113,0.0003717425,0.00026148642,0.76353186,0.0031379703,0.16055854,0.008924072,0.061639484],"study_design_scores_gemma":[0.000040839426,0.00007461129,0.0002649482,0.000018326444,0.000017848708,0.0002125624,0.00013634542,0.8957713,0.0008393123,0.09624501,0.006366952,0.0000119224815],"about_ca_topic_score_codex":0.0023725722,"about_ca_topic_score_gemma":0.0015796751,"teacher_disagreement_score":0.0044895587,"about_ca_system_score_codex":0.00097485015,"about_ca_system_score_gemma":0.00072676246,"threshold_uncertainty_score":0.015019119},"labels":[],"label_agreement":null},{"id":"W2290038473","doi":"10.4230/lipics.rta.2015.241","title":"Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Rewriting; Unification; Gröbner basis; Computation; Computer science; Coding theory; Algebra over a field; Theoretical computer science; Mathematics; Algorithm; Pure mathematics; Programming language","score_opus":0.05325202344418297,"score_gpt":0.28994845724449386,"score_spread":0.23669643380031088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290038473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07507314,0.00064932875,0.8978004,0.0006424423,0.00020520808,0.00016101591,0.00012993177,0.00040066178,0.024937822],"genre_scores_gemma":[0.55043805,0.0007613112,0.4350937,0.00048648834,0.00022354008,0.0002714404,0.00032328552,0.00026309007,0.012139054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738723,0.00092641305,0.00022898361,0.0004181409,0.0007369629,0.00030235696],"domain_scores_gemma":[0.99762326,0.001229748,0.00019417601,0.00060439034,0.00024983415,0.00009848257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025771314,0.00056135963,0.0007728044,0.00094249926,0.0010764068,0.0021838727,0.00085742056,0.0008722562,0.006632637],"category_scores_gemma":[0.006697703,0.0005528637,0.0015866071,0.0012391277,0.0032863552,0.004228201,0.002748355,0.0024207444,0.0014598492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044534714,0.000033807217,0.00019766674,0.000083984174,0.000013293765,0.00007174701,0.00038520436,0.0055649765,0.0018233625,0.9583944,0.00064372487,0.03274323],"study_design_scores_gemma":[0.000022876138,0.000043323358,0.000047908554,0.000036985854,0.000012298549,0.00004552519,0.000056375447,0.01464635,0.0028658963,0.97517186,0.007034188,0.000016270247],"about_ca_topic_score_codex":0.0007103345,"about_ca_topic_score_gemma":0.00073084526,"teacher_disagreement_score":0.006632637,"about_ca_system_score_codex":0.0012204546,"about_ca_system_score_gemma":0.0010598995,"threshold_uncertainty_score":0.022188365},"labels":[],"label_agreement":null},{"id":"W2294324668","doi":"10.4230/darts.1.1.7","title":"The Love/Hate Relationship with the C Preprocessor: An Interview Study (Artifact)","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Artifact (error); Grounded theory; Subject (documents); Preprocessor; Computer science; Process (computing); Psychology; Data science; Information retrieval; Epistemology; Social psychology; Artificial intelligence; World Wide Web; Sociology; Qualitative research; Social science; Philosophy","score_opus":0.047419963778204614,"score_gpt":0.2804762879035224,"score_spread":0.2330563241253178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294324668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9518338,0.00034808557,0.02178251,0.0026801296,0.00019536298,0.0040539205,0.0016398825,0.00016460395,0.017301768],"genre_scores_gemma":[0.93272024,0.0006588093,0.026424812,0.002567004,0.00013127169,0.0071154223,0.00101236,0.00018413743,0.029185865],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9954016,0.0030522833,0.00026432434,0.0004248077,0.0005043008,0.00035258205],"domain_scores_gemma":[0.9793849,0.014729673,0.0007852218,0.0014073636,0.0021732878,0.0015194917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076066325,0.0005827247,0.00045534977,0.0016203267,0.005854904,0.0025117514,0.00091643503,0.002333791,0.0073745255],"category_scores_gemma":[0.026234215,0.0007566008,0.00033802792,0.001497538,0.0029271117,0.0020456577,0.002244937,0.0033437205,0.0026147596],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021355327,0.0011566317,0.01040519,0.0003673245,0.000006470447,0.0018775419,0.93679065,0.00015633833,0.0062866844,0.0033769098,0.012611203,0.026751515],"study_design_scores_gemma":[0.00007689877,0.0016994574,0.029486664,0.00058958784,0.000021310807,0.0024361357,0.80061436,0.0010160115,0.008936293,0.0017532617,0.15321998,0.00015001955],"about_ca_topic_score_codex":0.0056579923,"about_ca_topic_score_gemma":0.008108355,"teacher_disagreement_score":0.0076066325,"about_ca_system_score_codex":0.0026865706,"about_ca_system_score_gemma":0.002944681,"threshold_uncertainty_score":0.040228188},"labels":[],"label_agreement":null},{"id":"W2296156273","doi":"10.4230/lipics.icalp.2017.52","title":"Randomized Communication vs. Partition Number.","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Partition (number theory); Randomized algorithm; Mathematics; Combinatorics; Clique; Upper and lower bounds; Set (abstract data type); Computational complexity theory; Discrete mathematics; Computer science; Algorithm","score_opus":0.040418325749375754,"score_gpt":0.2913102703181808,"score_spread":0.25089194456880504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296156273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13811283,0.003092665,0.77912086,0.012764389,0.00097005547,0.00079193665,0.0029345201,0.0037250628,0.058487717],"genre_scores_gemma":[0.8728389,0.00092228706,0.11179359,0.0019519688,0.0007484359,0.000994492,0.0015897243,0.0009450953,0.008215529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98590404,0.005184954,0.000419681,0.0030720495,0.0032410135,0.0021782317],"domain_scores_gemma":[0.9079216,0.067620076,0.004852323,0.015244177,0.0019161014,0.0024457113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006098421,0.0021142492,0.002207789,0.0014297393,0.0028356346,0.0057704225,0.005778044,0.0036758638,0.017416272],"category_scores_gemma":[0.058882464,0.0011832865,0.0017384704,0.0026758143,0.0044295304,0.0145111205,0.0053817565,0.007054313,0.0024695154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029983516,0.00075007486,0.0029775244,0.0008314077,0.00020862553,0.00018740662,0.00034197685,0.2915904,0.012817128,0.58822906,0.022265103,0.0768029],"study_design_scores_gemma":[0.00026724688,0.00029479837,0.0007627283,0.00008278219,0.00009949033,0.00021465027,0.00007470095,0.56822884,0.0066432036,0.41878033,0.0044882162,0.00006306416],"about_ca_topic_score_codex":0.001709994,"about_ca_topic_score_gemma":0.0029630514,"teacher_disagreement_score":0.017416272,"about_ca_system_score_codex":0.006085685,"about_ca_system_score_gemma":0.0053411555,"threshold_uncertainty_score":0.058263242},"labels":[],"label_agreement":null},{"id":"W2296549964","doi":"10.4230/lipics.socg.2015.719","title":"Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Deterministic algorithm; Computational geometry; Algorithm; Voronoi diagram; Combinatorics; Mathematics; Time complexity; Regular polygon; Dynamic programming; Randomized algorithm; Linear programming; Approximation algorithm; Mathematical optimization; Computer science; Geometry","score_opus":0.042338327910993775,"score_gpt":0.2922397059483311,"score_spread":0.2499013780373373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296549964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010930501,0.00025174074,0.9832181,0.00023878447,0.00005425466,0.000093123475,0.00022695409,0.0009539272,0.0040327236],"genre_scores_gemma":[0.114983834,0.0002716216,0.8798372,0.00015070372,0.00003602252,0.00028739372,0.00082594104,0.00037375925,0.003233486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788886,0.00034489034,0.00020404314,0.00052194105,0.00066455937,0.00037566587],"domain_scores_gemma":[0.9952583,0.0024005675,0.00036926134,0.0013274917,0.000457727,0.00018674371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013995497,0.0012828697,0.0015526814,0.0012045004,0.0012977374,0.0022109845,0.0030529785,0.0018272846,0.010444268],"category_scores_gemma":[0.007954277,0.0011745829,0.0021980372,0.0020175637,0.0014552008,0.0034942182,0.0042824396,0.0022681302,0.0023097345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046369512,0.00021884887,0.0014760124,0.0005223179,0.000074426425,0.000091353846,0.00022912755,0.4397383,0.006674679,0.16532022,0.012511944,0.3726791],"study_design_scores_gemma":[0.00010915396,0.000091588285,0.00030124612,0.00004127613,0.000036319565,0.000095440235,0.000071930095,0.8265741,0.0036697856,0.16218598,0.0067891036,0.000034092533],"about_ca_topic_score_codex":0.0035845304,"about_ca_topic_score_gemma":0.006978776,"teacher_disagreement_score":0.010444268,"about_ca_system_score_codex":0.0023903183,"about_ca_system_score_gemma":0.0024961282,"threshold_uncertainty_score":0.034939528},"labels":[],"label_agreement":null},{"id":"W2342776777","doi":"10.4230/lipics.isaac.2016.17","title":"On $r$-Guarding Thin Orthogonal Polygons","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Combinatorics; Polygon covering; Simple polygon; Point in polygon; Mathematics; Star-shaped polygon; Guard (computer science); Visibility polygon; Rectangle; Rectilinear polygon; Polygon mesh; Time complexity; Regular polygon; Discrete mathematics; Geometry; Computer science; Convex set","score_opus":0.019561566869496214,"score_gpt":0.27233527313246036,"score_spread":0.25277370626296414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342776777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2446762,0.0005773568,0.7402787,0.00067844155,0.00010916564,0.000220251,0.0011696109,0.0018963416,0.010393855],"genre_scores_gemma":[0.5008798,0.00058742095,0.49023944,0.00024829668,0.000064376814,0.00017253928,0.0025175489,0.0006753466,0.004615203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992663,0.00014308095,0.0000524775,0.00020776124,0.0001474596,0.00018282696],"domain_scores_gemma":[0.9979103,0.0011332962,0.00024393546,0.000467024,0.000101373706,0.0001440157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077156705,0.00074861024,0.0010636881,0.00056406175,0.00066084,0.001049826,0.0011562901,0.00080586434,0.005288797],"category_scores_gemma":[0.0044576046,0.0005507872,0.0011930885,0.000983827,0.0015961538,0.0027365023,0.0026922352,0.0012499255,0.00094868947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010363046,0.00029715698,0.0065663713,0.0009790178,0.00010236508,0.0012351337,0.0009172924,0.5724452,0.024617724,0.14693089,0.013270299,0.23160228],"study_design_scores_gemma":[0.000117903415,0.00020103135,0.00107648,0.0001240102,0.00004542466,0.0005975194,0.00042739595,0.7560911,0.0140660945,0.21689326,0.010314216,0.000045639863],"about_ca_topic_score_codex":0.002127545,"about_ca_topic_score_gemma":0.0023011675,"teacher_disagreement_score":0.005288797,"about_ca_system_score_codex":0.0005337745,"about_ca_system_score_gemma":0.00062772265,"threshold_uncertainty_score":0.017692804},"labels":[],"label_agreement":null},{"id":"W2395549257","doi":"10.4230/dagsemproc.10081.1","title":"10081 Abstracts Collection – Cognitive Robotics","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Robotics and Automated Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Informatics; Robotics; Computer science; Artificial intelligence; Cognitive robotics; Cognition; Section (typography); Research center; Cognitive science; Robot; Psychology; Engineering; Medicine; Electrical engineering; Neuroscience","score_opus":0.008313654482951193,"score_gpt":0.22287983400872424,"score_spread":0.21456617952577306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395549257","genre_codex":"other","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014024305,0.10513803,0.0119799515,0.011085662,0.07120191,0.0010173023,0.036343947,0.0037034655,0.7581274],"genre_scores_gemma":[0.0057847416,0.04517167,0.003865717,0.0017137467,0.03493866,0.0009730955,0.043737657,0.0020495434,0.86176515],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99762267,0.0002385857,0.00025401916,0.0005338564,0.0011507828,0.00020007906],"domain_scores_gemma":[0.9945498,0.00054131466,0.0003444213,0.00059482525,0.0022802462,0.0016893233],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030326075,0.0044679814,0.0034299756,0.009739502,0.0020625158,0.008631981,0.0033320577,0.0025835384,0.52379334],"category_scores_gemma":[0.0052510346,0.0008047026,0.0016644883,0.006982448,0.0012196928,0.0036525475,0.004645061,0.002986954,0.4409111],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057571226,0.00003340551,0.000066527995,0.0005686687,0.000019545787,0.00004497536,0.000031513595,0.00011949702,0.0003789019,0.0028089904,0.95317334,0.04269713],"study_design_scores_gemma":[0.000011829323,0.000025420815,0.0004654609,0.00021761844,0.000010335347,0.000064356296,0.000021263782,0.00008034692,0.000124061,0.0016071915,0.9973634,0.000008730668],"about_ca_topic_score_codex":0.0042001433,"about_ca_topic_score_gemma":0.005568729,"teacher_disagreement_score":0.52379334,"about_ca_system_score_codex":0.0048218463,"about_ca_system_score_gemma":0.0033747116,"threshold_uncertainty_score":0.67925096},"labels":[],"label_agreement":null},{"id":"W2397354107","doi":"10.4230/lipics.icalp.2016.31","title":"Block-Wise Non-Malleable Codes","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; University of Waterloo; Defense Advanced Research Projects Agency; U.S. Department of Defense; National Science Foundation","keywords":"Code word; Block (permutation group theory); Computer science; Function (biology); Adversary; Construct (python library); Block code; Theoretical computer science; Mathematics; Combinatorics; Discrete mathematics; Decoding methods; Computer security; Algorithm; Computer network","score_opus":0.010145184393490743,"score_gpt":0.23287103519973626,"score_spread":0.22272585080624552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397354107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049718987,0.0010132452,0.93456286,0.0011181715,0.0001655632,0.00016543172,0.0005309575,0.0007467469,0.0119780125],"genre_scores_gemma":[0.8225143,0.00097257405,0.15538774,0.00087185303,0.00017871665,0.00041327262,0.0007823917,0.0002264559,0.018652676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671066,0.00069128233,0.00022105523,0.0007768458,0.0010901254,0.0005100846],"domain_scores_gemma":[0.990311,0.003651646,0.0011578597,0.0031578697,0.0013847104,0.00033684168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015982853,0.0009030746,0.0009079752,0.0009887296,0.0008603783,0.0017560256,0.0018423954,0.0017574313,0.0030205746],"category_scores_gemma":[0.012072213,0.000523598,0.00068855,0.0011511764,0.0031270122,0.003974102,0.003035775,0.0031574247,0.0017581652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036819154,0.000047013862,0.0007790457,0.00018719138,0.000045910907,0.00021699736,0.00034227638,0.06736872,0.00812732,0.88420945,0.0030509834,0.03525689],"study_design_scores_gemma":[0.0000925901,0.0001722638,0.00028539702,0.000118531425,0.000035392124,0.00041037714,0.00007295688,0.33658373,0.013224568,0.63673043,0.012197897,0.000075797485],"about_ca_topic_score_codex":0.0015701961,"about_ca_topic_score_gemma":0.0013993925,"teacher_disagreement_score":0.0030205746,"about_ca_system_score_codex":0.0017665614,"about_ca_system_score_gemma":0.0019154643,"threshold_uncertainty_score":0.012817383},"labels":[],"label_agreement":null},{"id":"W2397478800","doi":"10.4230/dagsemproc.09261.9","title":"Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Integer programming; Solver; Rule-based machine translation; Scheduling (production processes); Grammar; ENCODE; Theoretical computer science; Integer (computer science); Mathematical optimization; Algorithm; Programming language; Artificial intelligence; Mathematics","score_opus":0.20195313577961396,"score_gpt":0.4130827993715797,"score_spread":0.21112966359196575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397478800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009209399,0.00012520129,0.98486114,0.00036860435,0.000034191882,0.0001105842,0.00031923072,0.00021974056,0.0047518243],"genre_scores_gemma":[0.18848845,0.0005808759,0.8015829,0.00022388792,0.00007957832,0.0010356037,0.001148021,0.0002540028,0.0066067385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988721,0.00042598197,0.00006477321,0.00020559967,0.00028504588,0.00014642598],"domain_scores_gemma":[0.997919,0.0015448922,0.00016836869,0.0001705382,0.00012694491,0.00007026641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013581631,0.0011884527,0.0008271064,0.0005815221,0.00050128176,0.0015295102,0.0018665537,0.0014232979,0.0050370456],"category_scores_gemma":[0.004176812,0.00070145103,0.001827749,0.0013246547,0.0013988141,0.0020144389,0.0015445278,0.0031677824,0.00069363654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023670103,0.000067271976,0.00017183974,0.00009956034,0.000016211818,0.00008305245,0.00014039254,0.805396,0.00077347027,0.17706093,0.0014394827,0.0147281205],"study_design_scores_gemma":[0.000030329214,0.000023681381,0.000043396267,0.000017150884,0.000011237338,0.000024046465,0.000028113996,0.8558336,0.00045586392,0.1396619,0.0038617547,0.000008931257],"about_ca_topic_score_codex":0.0038430365,"about_ca_topic_score_gemma":0.0061955494,"teacher_disagreement_score":0.0050370456,"about_ca_system_score_codex":0.0016086211,"about_ca_system_score_gemma":0.0025525424,"threshold_uncertainty_score":0.01685059},"labels":[],"label_agreement":null},{"id":"W2397833257","doi":"10.4230/lipics.ccc.2016.5","title":"A Composition Theorem for Conical Juntas.","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Upper and lower bounds; Context (archaeology); Mathematics; Tree (set theory); Combinatorics; Boolean function; Function (biology); Discrete mathematics; Decision tree model; Computer science; Decision tree; Artificial intelligence","score_opus":0.04365673072524578,"score_gpt":0.28863726379517657,"score_spread":0.24498053306993078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397833257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031264413,0.00040662134,0.8940938,0.0017050509,0.00028822583,0.00030868757,0.0004430793,0.0010706908,0.07041943],"genre_scores_gemma":[0.5972743,0.00062615087,0.35872975,0.0028288069,0.0005845299,0.000948328,0.0009991234,0.00094683457,0.03706224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99433124,0.00092537043,0.00027456717,0.0012875934,0.0024051147,0.0007761185],"domain_scores_gemma":[0.98974097,0.0066676075,0.0005766941,0.0016873027,0.00088618865,0.00044124902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033670159,0.0007331682,0.0010855776,0.0012487486,0.0022987942,0.0031515965,0.0024612607,0.0017075236,0.018924227],"category_scores_gemma":[0.017027598,0.0008514196,0.0029683176,0.00122232,0.0045383177,0.010488927,0.0062333466,0.0071142106,0.0035068013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010916192,0.000041301737,0.0003946467,0.00012211375,0.000020071697,0.00006664246,0.00014709108,0.0046923594,0.004677887,0.9674662,0.0026415472,0.019621037],"study_design_scores_gemma":[0.000030437901,0.00006190611,0.00023159722,0.000036090547,0.000038495204,0.00020081467,0.000051919607,0.04182222,0.007121668,0.93973947,0.010639617,0.000025672427],"about_ca_topic_score_codex":0.001033816,"about_ca_topic_score_gemma":0.00166605,"teacher_disagreement_score":0.018924227,"about_ca_system_score_codex":0.0021521277,"about_ca_system_score_gemma":0.0017926294,"threshold_uncertainty_score":0.06330788},"labels":[],"label_agreement":null},{"id":"W2406981943","doi":"10.4230/dagsemproc.09171.1","title":"09171 Abstracts Collection – Adaptive, Output Sensitive, Online and Parameterized Algorithms","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Computer science; Informatics; Research center; Center (category theory); Work (physics); Algorithm; Theoretical computer science; Engineering; Electrical engineering","score_opus":0.03175318269460307,"score_gpt":0.28721453522514434,"score_spread":0.25546135253054125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406981943","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005599629,0.16064855,0.078330554,0.025101192,0.1340953,0.0015021017,0.046008456,0.0041441466,0.5445701],"genre_scores_gemma":[0.03395327,0.09598564,0.043587156,0.004448394,0.11750166,0.002508619,0.091686726,0.0061200806,0.6042084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967608,0.00046881763,0.00028673885,0.0007162315,0.0015550023,0.00021246001],"domain_scores_gemma":[0.99554414,0.0011060439,0.00025892624,0.0006044147,0.001428518,0.0010579722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042638956,0.0038252561,0.0031230531,0.0054654423,0.0015604969,0.0066564158,0.003221997,0.0017016352,0.25017977],"category_scores_gemma":[0.006887374,0.00076729717,0.002338482,0.006676631,0.001154963,0.0035699033,0.0037040613,0.004504991,0.10826722],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015574208,0.000106869,0.00014715357,0.0009566041,0.000069067166,0.000056864108,0.000036268193,0.00080157956,0.000933437,0.010400515,0.90043914,0.08589673],"study_design_scores_gemma":[0.00009247032,0.00014122433,0.0018635899,0.00042901642,0.00008041719,0.00018506442,0.000047114147,0.001850931,0.0010887347,0.014545828,0.9796367,0.000038927097],"about_ca_topic_score_codex":0.002160446,"about_ca_topic_score_gemma":0.002931492,"teacher_disagreement_score":0.25017977,"about_ca_system_score_codex":0.005019497,"about_ca_system_score_gemma":0.0032136724,"threshold_uncertainty_score":0.8369347},"labels":[],"label_agreement":null},{"id":"W2412311009","doi":"10.4230/lipics.fun.2016.13","title":"Super Mario Bros. is Harder/Easier Than We Thought","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"PSPACE; Constant (computer programming); Mathematical proof; Video game; Time complexity; Combinatorics; Mathematics; Computational complexity theory; Computer science; State (computer science); Discrete mathematics; Algorithm; Multimedia","score_opus":0.02679281900818871,"score_gpt":0.27077906729970047,"score_spread":0.24398624829151178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412311009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24070247,0.0015002362,0.39365822,0.037497,0.0018945663,0.00094838964,0.0066267676,0.005557371,0.31161496],"genre_scores_gemma":[0.714531,0.00082457974,0.1721417,0.0058262944,0.00026527364,0.00035341547,0.0038802752,0.0013770927,0.100800425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990337,0.0001541695,0.000048187016,0.00032779173,0.00018143875,0.0002547098],"domain_scores_gemma":[0.99858665,0.00061589957,0.00016367908,0.00029259064,0.00013145087,0.00020977983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005197686,0.0008697171,0.00075286545,0.00028534894,0.0015228557,0.0020817511,0.0013891979,0.0014721538,0.026503026],"category_scores_gemma":[0.0037951227,0.00066165737,0.001620738,0.00038482915,0.0015863071,0.0055038086,0.0022561916,0.0032505672,0.0033830532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017080657,0.00042278256,0.0063745426,0.0018753645,0.00028208105,0.001887878,0.0023965447,0.037524678,0.028137157,0.6293534,0.13512373,0.1549138],"study_design_scores_gemma":[0.00015331151,0.00025192337,0.004949011,0.00037081528,0.0001261301,0.0013142668,0.0018558817,0.08091977,0.008518229,0.6739564,0.22745539,0.00012887073],"about_ca_topic_score_codex":0.006044473,"about_ca_topic_score_gemma":0.010471749,"teacher_disagreement_score":0.026503026,"about_ca_system_score_codex":0.0012563498,"about_ca_system_score_gemma":0.0010840369,"threshold_uncertainty_score":0.08866143},"labels":[],"label_agreement":null},{"id":"W2415039998","doi":"10.4230/lipics.swat.2016.3","title":"A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hausdorff Center for Mathematics; University of Waterloo","keywords":"Steiner tree problem; Bipartite graph; Combinatorics; Logarithm; Mathematics; Tree (set theory); Constant (computer programming); Discrete mathematics; Linear programming relaxation; Cover (algebra); Set (abstract data type); Upper and lower bounds; Computer science; Algorithm; Graph; Linear programming","score_opus":0.042358375616166954,"score_gpt":0.2944877939420583,"score_spread":0.25212941832589136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415039998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16309504,0.005455359,0.74852556,0.008495262,0.00049333705,0.00014114071,0.0011001,0.0010722858,0.07162186],"genre_scores_gemma":[0.8360568,0.0039556283,0.14592597,0.0013858507,0.0005738601,0.0002577054,0.0010075583,0.0008104889,0.01002609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978404,0.00057209085,0.00006639528,0.0004216475,0.0006110956,0.0004883993],"domain_scores_gemma":[0.98623323,0.010947455,0.0006195428,0.0010826791,0.000434929,0.0006821694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028822827,0.0015985903,0.0015460256,0.0014833827,0.0011818875,0.004669739,0.0027803301,0.0017215112,0.010305897],"category_scores_gemma":[0.017313864,0.00073041563,0.0013261064,0.0024607927,0.002717561,0.009932451,0.00391148,0.008753966,0.001448185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009687118,0.0005323128,0.0025077397,0.0009759679,0.00012318385,0.00035854717,0.00059394294,0.24675351,0.012762128,0.6366108,0.018469302,0.079343796],"study_design_scores_gemma":[0.000041767387,0.0000843302,0.0006602972,0.00009643025,0.00006005058,0.00027574782,0.00011195156,0.46224043,0.0030325379,0.5274619,0.005909371,0.000025223175],"about_ca_topic_score_codex":0.00088352687,"about_ca_topic_score_gemma":0.001017205,"teacher_disagreement_score":0.010305897,"about_ca_system_score_codex":0.003858348,"about_ca_system_score_gemma":0.001213856,"threshold_uncertainty_score":0.034476697},"labels":[],"label_agreement":null},{"id":"W2465741342","doi":"10.4230/dagsemproc.10071.6","title":"Every Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Sublinear function; Competitive analysis; Omega; Fixed point; Scheduling (production processes); Mathematics; Upper and lower bounds; Computer science; Discrete mathematics; BETA (programming language); Combinatorics; Algorithm; Mathematical optimization","score_opus":0.02426286062609075,"score_gpt":0.2645023520200533,"score_spread":0.24023949139396253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465741342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20351481,0.0010909265,0.75637984,0.0070544714,0.0005211231,0.00043336817,0.0006189683,0.0037238144,0.026662644],"genre_scores_gemma":[0.66930056,0.00044922065,0.31734386,0.0020057254,0.00020762245,0.00047872402,0.00067356497,0.0009781917,0.008562569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99216014,0.0013230201,0.0004869895,0.0025560313,0.0018654973,0.001608348],"domain_scores_gemma":[0.9727121,0.014683373,0.00194592,0.0062576835,0.0026466744,0.0017542368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058502434,0.0021819791,0.003000007,0.0010462572,0.0038914832,0.005717771,0.004918257,0.0033252002,0.0049801283],"category_scores_gemma":[0.029787904,0.0014176213,0.0022646831,0.0018378979,0.004040869,0.0059587806,0.0031038136,0.0065752603,0.0021028577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025518101,0.00066011527,0.0063570575,0.0008811266,0.00033664142,0.00025237192,0.0007120952,0.49934086,0.03178906,0.37897992,0.014089169,0.064049825],"study_design_scores_gemma":[0.00016683586,0.0002866592,0.0003914544,0.00004454422,0.00006879138,0.00009605755,0.00006597923,0.8281738,0.009752931,0.15741472,0.0034771448,0.00006105108],"about_ca_topic_score_codex":0.005746998,"about_ca_topic_score_gemma":0.0059871054,"teacher_disagreement_score":0.007656362,"about_ca_system_score_codex":0.007656362,"about_ca_system_score_gemma":0.011920064,"threshold_uncertainty_score":0.055551052},"labels":[],"label_agreement":null},{"id":"W2465968014","doi":"10.4230/lipics.ccc.2016.10","title":"Learning Algorithms from Natural Proofs","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; Simons Foundation; National Science Foundation","keywords":"Mathematical proof; Algorithm; Mathematics; Constant (computer programming); Class (philosophy); Natural number; Discrete mathematics; Prime (order theory); Upper and lower bounds; Combinatorics; Concept class; Computer science; Artificial intelligence","score_opus":0.01391521125942484,"score_gpt":0.24175137597842083,"score_spread":0.22783616471899598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465968014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014164859,0.0011330676,0.9664042,0.0028932984,0.00016360292,0.00017826378,0.00043103014,0.0017769618,0.01285466],"genre_scores_gemma":[0.28822044,0.001704806,0.6938996,0.001980314,0.00070760126,0.0006852563,0.0019126635,0.00060533086,0.0102840755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944898,0.001953111,0.00036997092,0.0014294351,0.0014208291,0.000336765],"domain_scores_gemma":[0.9681359,0.025251603,0.00093416264,0.0039775507,0.001301156,0.00039973724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036789405,0.0008903968,0.0008388662,0.0017786117,0.001209997,0.003990665,0.0030535476,0.0014478099,0.01064613],"category_scores_gemma":[0.036318477,0.0008693753,0.0016861325,0.0020505085,0.0036378424,0.01371781,0.005384964,0.0047436664,0.001701112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016757965,0.000104252016,0.0006463905,0.00047341615,0.000050468978,0.00005992665,0.0003312162,0.02471915,0.0014444327,0.84134597,0.00898734,0.12166995],"study_design_scores_gemma":[0.00005347209,0.000026935757,0.000099950856,0.00004153563,0.000013303618,0.00006206854,0.000026220985,0.080347225,0.001169597,0.90999454,0.008152144,0.000013092943],"about_ca_topic_score_codex":0.0012758189,"about_ca_topic_score_gemma":0.0016834458,"teacher_disagreement_score":0.01064613,"about_ca_system_score_codex":0.003040008,"about_ca_system_score_gemma":0.0021674526,"threshold_uncertainty_score":0.035614848},"labels":[],"label_agreement":null},{"id":"W2495677458","doi":"10.4230/lipics.icalp.2016.69","title":"Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bounded function; Linear programming relaxation; Sigma; Outlier; Mathematics; Upper and lower bounds; Relaxation (psychology); Cluster analysis; Algorithm; Discrete mathematics; Linear programming; Physics; Mathematical analysis; Statistics","score_opus":0.03067713943686306,"score_gpt":0.24541119566093658,"score_spread":0.21473405622407352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495677458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008035978,0.0020402407,0.9839759,0.0010600752,0.00013644483,0.00011350359,0.00026387308,0.00080235075,0.003571546],"genre_scores_gemma":[0.2673347,0.0027045044,0.719062,0.001054248,0.00054288947,0.0006893944,0.0022275285,0.0008506328,0.005534115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922518,0.0027815343,0.00047784924,0.0015106277,0.0018094352,0.0011687723],"domain_scores_gemma":[0.98087525,0.012906272,0.0015580894,0.0022170602,0.0017746597,0.000668649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073132906,0.0042620576,0.0047019413,0.0028276423,0.0021189656,0.0045644343,0.006193941,0.0046091434,0.004921614],"category_scores_gemma":[0.032349437,0.0017383016,0.0034507592,0.007019785,0.0026785033,0.0077487146,0.0047423067,0.0077768965,0.0019416701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002919131,0.00016939953,0.0008056052,0.0004163246,0.00016791096,0.00006898067,0.00021332514,0.9052807,0.0005926255,0.041426882,0.0070030056,0.04356336],"study_design_scores_gemma":[0.000032218384,0.00003143407,0.00008882014,0.000032451757,0.000018305018,0.00003366529,0.000044629385,0.9614031,0.0002662487,0.036852382,0.0011859859,0.000010802463],"about_ca_topic_score_codex":0.011806482,"about_ca_topic_score_gemma":0.010639864,"teacher_disagreement_score":0.011806482,"about_ca_system_score_codex":0.006224144,"about_ca_system_score_gemma":0.0039016106,"threshold_uncertainty_score":0.04515952},"labels":[],"label_agreement":null},{"id":"W2506792106","doi":"10.4230/lipics.socg.2016.28","title":"Two Approaches to Building Time-Windowed Geometric Data Structures","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ackermann function; Mathematics; Combinatorics; Intersection (aeronautics); Algorithm; Convex hull; Time complexity; Sequence (biology); Computational geometry; Binary logarithm; Data structure; Discrete mathematics; Computer science; Inverse; Regular polygon; Geometry","score_opus":0.10465413543093907,"score_gpt":0.28717925870178046,"score_spread":0.1825251232708414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506792106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045563714,0.00043502773,0.991155,0.00049659814,0.000097303775,0.00015547825,0.0003880254,0.001417933,0.0012982191],"genre_scores_gemma":[0.044854954,0.00041945194,0.95098096,0.00020012392,0.00012709835,0.00029966107,0.0009531999,0.00021031391,0.0019542014],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99548197,0.0005436569,0.00044732066,0.0015822366,0.0015094122,0.0004355253],"domain_scores_gemma":[0.9932439,0.0020596893,0.0007720134,0.0027905784,0.0008085683,0.00032527788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002272017,0.0016356871,0.001822292,0.004012585,0.0009409259,0.004497344,0.006184262,0.0026229734,0.0068925293],"category_scores_gemma":[0.011049956,0.0017128991,0.0027709077,0.0053994586,0.0023545597,0.015574907,0.005316132,0.0053052707,0.0018921961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008279373,0.00051005546,0.0018305244,0.0006479611,0.00013308715,0.00021915864,0.0006575559,0.07286245,0.018683936,0.3162776,0.01287306,0.5744767],"study_design_scores_gemma":[0.0002669443,0.0006380874,0.0009800381,0.00015679726,0.00012219095,0.00066604343,0.00031504672,0.5969783,0.04586259,0.3022828,0.051528066,0.0002031339],"about_ca_topic_score_codex":0.0023235704,"about_ca_topic_score_gemma":0.0031977284,"teacher_disagreement_score":0.0068925293,"about_ca_system_score_codex":0.0022063933,"about_ca_system_score_gemma":0.0026109682,"threshold_uncertainty_score":0.023057818},"labels":[],"label_agreement":null},{"id":"W2534741016","doi":"10.4230/lipics.ccc.2017.23","title":"Augmented Index and Quantum Streaming Algorithms for DYCK(2)","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Industry Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Leverage (statistics); Upper and lower bounds; Quantum; Computer science; Generalization; Algorithm; Quantum algorithm; Theoretical computer science; Mathematics; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.01704133513518973,"score_gpt":0.26744324661322655,"score_spread":0.2504019114780368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534741016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10799678,0.00025274412,0.8762999,0.0009402584,0.000119706085,0.00015168996,0.0003347719,0.0005528358,0.013351257],"genre_scores_gemma":[0.6588581,0.00029788917,0.32397017,0.00034628852,0.00015027299,0.00048343657,0.0005278865,0.00031413595,0.015051851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983909,0.00044636065,0.00012130552,0.00028512822,0.00049299625,0.00026338856],"domain_scores_gemma":[0.99668056,0.0017078028,0.00031876224,0.0006826981,0.000400218,0.00020992264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00161779,0.00070796884,0.00085248105,0.0009074196,0.0008517746,0.0023522982,0.001941462,0.0011369777,0.0059064673],"category_scores_gemma":[0.0070081446,0.00028753397,0.0007252061,0.0011427554,0.001868769,0.0065114256,0.0033089314,0.0031824277,0.0010221263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013175486,0.000073507676,0.0002971371,0.00008717705,0.000012541306,0.00006306349,0.00017641732,0.026080377,0.0033149682,0.94302964,0.001825941,0.024907533],"study_design_scores_gemma":[0.000025371013,0.000044121498,0.00010891794,0.000015538273,0.000009078013,0.00006714688,0.00003791173,0.31374785,0.00416428,0.6795376,0.0022185592,0.000023615166],"about_ca_topic_score_codex":0.00088500767,"about_ca_topic_score_gemma":0.0010290748,"teacher_disagreement_score":0.0059064673,"about_ca_system_score_codex":0.0018299078,"about_ca_system_score_gemma":0.0014471152,"threshold_uncertainty_score":0.019759059},"labels":[],"label_agreement":null},{"id":"W2534763950","doi":"10.4230/lipics.cpm.2016.14","title":"Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tree (set theory); Binary tree; Computer science; Function (biology); K-ary tree; Time complexity; Gene; Algorithm; Mathematics; Tree structure; Computational biology; Biology; Combinatorics; Genetics","score_opus":0.010708093779433252,"score_gpt":0.23793670818291388,"score_spread":0.22722861440348063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534763950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113703564,0.00080321525,0.8763143,0.0006536829,0.000113677306,0.00026055562,0.0005310151,0.004245258,0.0033746648],"genre_scores_gemma":[0.297765,0.00017756113,0.69563466,0.00018691394,0.00006768942,0.00030013575,0.002006769,0.00084380957,0.003017519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982399,0.00066305895,0.00010679654,0.0004283084,0.00033729716,0.0002248148],"domain_scores_gemma":[0.9929253,0.0043442855,0.00047320366,0.0014885633,0.0005583662,0.00021032256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024479236,0.0012827439,0.0021037583,0.0017445724,0.0012016624,0.00199736,0.0039818822,0.0026839452,0.0073875636],"category_scores_gemma":[0.010044097,0.00070630666,0.0014702945,0.0028406342,0.00101766,0.004225793,0.0025241876,0.0017406357,0.0016435721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008176189,0.00040865297,0.0024478782,0.00048336314,0.00019183177,0.00028026183,0.0004193739,0.5183864,0.0110751325,0.023277195,0.009244312,0.43296793],"study_design_scores_gemma":[0.0001034636,0.00007695144,0.0004982954,0.0000134785505,0.000042755037,0.00013315138,0.00007285498,0.9750665,0.0030975782,0.019367337,0.00150428,0.000023402348],"about_ca_topic_score_codex":0.002854036,"about_ca_topic_score_gemma":0.0039493926,"teacher_disagreement_score":0.0073875636,"about_ca_system_score_codex":0.0012082527,"about_ca_system_score_gemma":0.0019350079,"threshold_uncertainty_score":0.024713814},"labels":[],"label_agreement":null},{"id":"W2536571921","doi":"10.4230/oasics.atmos.2016.6","title":"Multi-Column Generation Model for the Locomotive Assignment Problem","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Column generation; Train; Decomposition; Column (typography); Computer science; Set (abstract data type); Decomposition method (queueing theory); Generator (circuit theory); Heuristics; Assignment problem; Process (computing); Fraction (chemistry); Mathematical optimization; Algorithm; Mathematics; Power (physics)","score_opus":0.029924688836358893,"score_gpt":0.23247067837628183,"score_spread":0.20254598953992292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536571921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097169755,0.00022424321,0.9867019,0.00020221354,0.000057316407,0.000090031994,0.00048386116,0.00032555772,0.002197824],"genre_scores_gemma":[0.2630185,0.0005371039,0.7260481,0.00028068642,0.00011260286,0.0006207917,0.0022387272,0.00024808603,0.006895384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934345,0.00026154457,0.000026542737,0.00014216542,0.00012855534,0.00009773551],"domain_scores_gemma":[0.99933124,0.00036683958,0.00007811955,0.00006691797,0.00010690188,0.000050065264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007862958,0.0012222257,0.0009704854,0.0006828526,0.00037555082,0.0012818597,0.0016964565,0.0011123763,0.0057770493],"category_scores_gemma":[0.0012602701,0.0005635593,0.0012427103,0.0014715231,0.00052603893,0.0010500846,0.0007723781,0.001686562,0.0011858575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040378305,0.000054573007,0.00028428918,0.0000795786,0.00002692778,0.00008139609,0.000024412937,0.9712154,0.00084173604,0.008944994,0.0024523148,0.015954033],"study_design_scores_gemma":[0.000008629134,0.0000112318685,0.000043972523,0.000003272649,0.0000046689497,0.000015878008,0.0000053669523,0.9958846,0.00017764872,0.003197331,0.0006440364,0.0000034232858],"about_ca_topic_score_codex":0.006739357,"about_ca_topic_score_gemma":0.009555783,"teacher_disagreement_score":0.006739357,"about_ca_system_score_codex":0.00097138825,"about_ca_system_score_gemma":0.001211096,"threshold_uncertainty_score":0.01932621},"labels":[],"label_agreement":null},{"id":"W2541904841","doi":"10.4230/lipics.ecoop.2016.8","title":"C++ const and Immutability: An Empirical Study of Writes-Through-const","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Immutability; Computer science; Set (abstract data type); Benchmark (surveying); Code (set theory); Meaning (existential); State (computer science); Programming language; Epistemology; Philosophy; Blockchain; Computer security","score_opus":0.03031890135607083,"score_gpt":0.32196307523619433,"score_spread":0.2916441738801235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541904841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99444604,0.00026464966,0.002132677,0.00019797901,0.000011376043,0.00006519497,0.00040898882,0.00019805756,0.0022750602],"genre_scores_gemma":[0.9963995,0.00008364159,0.0017630131,0.000068134825,0.00000802612,0.000042135438,0.0008724261,0.00013285546,0.0006301361],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9842166,0.005806268,0.0016352049,0.0019129317,0.005611783,0.00081725745],"domain_scores_gemma":[0.67184716,0.25002286,0.0343194,0.02064986,0.0202631,0.002897563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012079672,0.00060319004,0.00035103946,0.0021130936,0.0012090419,0.0019856838,0.0016669426,0.0010187814,0.0017884431],"category_scores_gemma":[0.1641544,0.0004785887,0.000466869,0.0028001054,0.003158783,0.0043881787,0.0021996296,0.0027867625,0.0005807775],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006974049,0.00078839454,0.94122344,0.00048745872,0.00016184467,0.00065915973,0.008955702,0.0029320165,0.0026866505,0.0031661836,0.0031446465,0.035097048],"study_design_scores_gemma":[0.000089554625,0.0017342671,0.91007787,0.0003489431,0.00015828351,0.0026589443,0.01515234,0.0347479,0.0099279545,0.004199211,0.020784438,0.00012024832],"about_ca_topic_score_codex":0.005337648,"about_ca_topic_score_gemma":0.0060680388,"teacher_disagreement_score":0.012079672,"about_ca_system_score_codex":0.0009626674,"about_ca_system_score_gemma":0.0011626884,"threshold_uncertainty_score":0.0638842},"labels":[],"label_agreement":null},{"id":"W2558161679","doi":"10.4230/lipics.icdt.2015.342","title":"From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Consistency (knowledge bases); Causality (physics); Database theory; Database; Information retrieval; Data mining; Database design; Artificial intelligence","score_opus":0.0445754772296752,"score_gpt":0.28253670423893745,"score_spread":0.23796122700926226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558161679","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019115906,0.0008698975,0.96841484,0.0043515284,0.0001620367,0.00011822489,0.00030851737,0.00050977437,0.0061493516],"genre_scores_gemma":[0.624981,0.0020342297,0.35994586,0.0015741587,0.0005223816,0.0003966376,0.0011147738,0.00035645912,0.0090744635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.990301,0.0027910455,0.00067308574,0.0018562042,0.0036009375,0.00077765004],"domain_scores_gemma":[0.9422949,0.04485261,0.0031180985,0.005388061,0.0035056083,0.0008407893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070893867,0.0010757165,0.0011007116,0.0037982122,0.0021120652,0.005435621,0.003288916,0.0026159438,0.009380499],"category_scores_gemma":[0.05083539,0.0011401626,0.0036022745,0.002857534,0.006662125,0.01575966,0.0058866497,0.0055160713,0.0006767359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000917134,0.0000644416,0.0019077744,0.00026861936,0.000058999067,0.0003591629,0.0007966189,0.03917984,0.00059771375,0.92237425,0.0019240938,0.032376874],"study_design_scores_gemma":[0.000018500707,0.000018820889,0.00024084284,0.000053484324,0.000056817684,0.00017941583,0.0002597482,0.070444,0.0013272924,0.9241361,0.003239022,0.000025898451],"about_ca_topic_score_codex":0.005920225,"about_ca_topic_score_gemma":0.0046196626,"teacher_disagreement_score":0.009380499,"about_ca_system_score_codex":0.004651245,"about_ca_system_score_gemma":0.0041501145,"threshold_uncertainty_score":0.037492752},"labels":[],"label_agreement":null},{"id":"W2561495450","doi":"10.4230/lipics.socg.2015.141","title":"1-String B_2-VPG Representation of Planar Graphs","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planar; Planar graph; String (physics); Combinatorics; Representation (politics); Graph; Enhanced Data Rates for GSM Evolution; Mathematics; Grid; Computer science; Topology (electrical circuits); Geometry; Artificial intelligence; Computer graphics (images)","score_opus":0.04353341120342063,"score_gpt":0.28724107464332505,"score_spread":0.2437076634399044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561495450","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055593356,0.00018471717,0.91511005,0.0004737999,0.00013252089,0.00009202708,0.00096445065,0.001685555,0.025763486],"genre_scores_gemma":[0.561402,0.00053697213,0.4172447,0.00043126006,0.000116323405,0.0003278289,0.0033279192,0.00068923284,0.015923686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994702,0.00009796843,0.000032092772,0.0001180452,0.00018566991,0.00009609141],"domain_scores_gemma":[0.9994143,0.00014696168,0.000080435944,0.00017605523,0.0001421027,0.000040107065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031954705,0.0005557315,0.00044879576,0.00094249967,0.0005047606,0.0016558187,0.00095155323,0.0009886764,0.010962808],"category_scores_gemma":[0.0019665062,0.0003080404,0.0005300791,0.0013900448,0.00086246023,0.0026071784,0.0016596611,0.0016029151,0.0031406689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022248074,0.00008003496,0.0006108849,0.00023052542,0.00001923022,0.00040397898,0.0003843098,0.032088492,0.01341771,0.80669624,0.012196457,0.13364972],"study_design_scores_gemma":[0.00004371224,0.00011021614,0.0004243503,0.00006517635,0.000027263583,0.00047769945,0.00025008773,0.14236654,0.008113807,0.8108444,0.037241895,0.000034822664],"about_ca_topic_score_codex":0.0007526277,"about_ca_topic_score_gemma":0.00051749416,"teacher_disagreement_score":0.010962808,"about_ca_system_score_codex":0.0004720501,"about_ca_system_score_gemma":0.00034418888,"threshold_uncertainty_score":0.03667426},"labels":[],"label_agreement":null},{"id":"W2563385979","doi":"10.4230/lipics.opodis.2015.3","title":"Time to Change: On Distributed Computing in Dynamic Networks (Keynote)","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; CLARITY; Focus (optics); Field (mathematics); Order (exchange); Data science; Distributed computing; Network topology; Ubiquitous computing; Human–computer interaction; Computer network","score_opus":0.011793917093032246,"score_gpt":0.2500765987211474,"score_spread":0.23828268162811517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563385979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041481135,0.24762657,0.34293428,0.16776107,0.06134446,0.00018099183,0.00039827454,0.0010135701,0.17459272],"genre_scores_gemma":[0.24697459,0.30718824,0.10824039,0.059701532,0.11270455,0.0012891982,0.0008298294,0.001428895,0.16164276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978709,0.0006638678,0.00013719559,0.0004975529,0.0006470944,0.00018342276],"domain_scores_gemma":[0.99507433,0.0034447105,0.00022150518,0.0004777768,0.00057333766,0.00020844812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029331842,0.00093615387,0.0010641164,0.0025414932,0.0023910599,0.004877366,0.0018513103,0.0034473373,0.012599771],"category_scores_gemma":[0.012609705,0.00058589416,0.00092736684,0.0060513755,0.0062998254,0.016445862,0.0032673376,0.0057674935,0.0036007757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058398982,0.000018000757,0.00021363744,0.00024203697,0.000021904027,0.00019907976,0.00044530048,0.0021096976,0.00017106421,0.82929474,0.12542288,0.041803278],"study_design_scores_gemma":[0.000021780303,0.00003309925,0.00025655236,0.00036852292,0.000026285918,0.00023294397,0.0002124224,0.0035669229,0.00018166644,0.5878205,0.4072519,0.000027528682],"about_ca_topic_score_codex":0.0032784112,"about_ca_topic_score_gemma":0.001861178,"teacher_disagreement_score":0.012599771,"about_ca_system_score_codex":0.0042998902,"about_ca_system_score_gemma":0.0012266133,"threshold_uncertainty_score":0.042150438},"labels":[],"label_agreement":null},{"id":"W2567588361","doi":"10.4230/lipics.socg.2017.45","title":"Lower Bounds for Differential Privacy from Gaussian Width","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Differential privacy; Polytope; Gaussian; Workload; Convex geometry; Sample (material); Measure (data warehouse); Mathematics; Convex body; Sensitivity (control systems); Upper and lower bounds; Regular polygon; Computer science; Discrete mathematics; Algorithm; Convex optimization; Convex set; Mathematical analysis; Database; Geometry","score_opus":0.029747761094864964,"score_gpt":0.2898978853087917,"score_spread":0.2601501242139267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567588361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095820114,0.0023561064,0.883313,0.0042746863,0.00016830441,0.00025543373,0.0009942778,0.0007521284,0.012065973],"genre_scores_gemma":[0.84496737,0.0026776043,0.13902265,0.0016556527,0.0011087174,0.0012011168,0.0013627972,0.0009522741,0.0070517226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98725104,0.003647158,0.0005634896,0.0025298882,0.003972051,0.0020364411],"domain_scores_gemma":[0.8862796,0.090128824,0.004817726,0.011307851,0.0041353665,0.0033305888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01036963,0.0027840924,0.0036461689,0.0027236806,0.0018029569,0.0068701,0.005022282,0.0031663238,0.0068584364],"category_scores_gemma":[0.08782321,0.0014305674,0.0028770892,0.0033343819,0.005674566,0.018875683,0.007314894,0.008514309,0.0012302124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015188861,0.00046756776,0.0066078315,0.0007325742,0.00034334377,0.00039250034,0.0010530086,0.25373068,0.01575445,0.6640825,0.006345233,0.048971422],"study_design_scores_gemma":[0.000052336884,0.00019394727,0.000996075,0.00007170624,0.00006907592,0.00020940183,0.00011310837,0.5668906,0.0040985947,0.42550522,0.0017453474,0.000054553628],"about_ca_topic_score_codex":0.0011272862,"about_ca_topic_score_gemma":0.00079029513,"teacher_disagreement_score":0.01036963,"about_ca_system_score_codex":0.006337948,"about_ca_system_score_gemma":0.0025482567,"threshold_uncertainty_score":0.054840505},"labels":[],"label_agreement":null},{"id":"W2569250480","doi":"10.4230/lipics.stacs.2011.637","title":"Bounds on the maximum multiplicity of some common geometric graphs","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Combinatorics; General position; Mathematics; Omega; Upper and lower bounds; Spanning tree; Multiplicity (mathematics); Regular polygon; Discrete mathematics; Geometry; Physics","score_opus":0.03768576974394765,"score_gpt":0.2456183393488825,"score_spread":0.20793256960493484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569250480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28710824,0.0025028815,0.6634292,0.0013079277,0.00016210381,0.00013850012,0.00085248187,0.00064811826,0.04385057],"genre_scores_gemma":[0.8535768,0.0016978222,0.13607787,0.000223489,0.00030793194,0.00032591287,0.0010746968,0.00029003105,0.006425444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967237,0.00054109405,0.00019095698,0.00093622034,0.0010019791,0.00060604396],"domain_scores_gemma":[0.9848305,0.007980219,0.0020017873,0.0026475086,0.0014066359,0.0011333252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016293778,0.0017174467,0.0014273777,0.0040694186,0.0016450415,0.00260112,0.0036678903,0.0014984893,0.0057580457],"category_scores_gemma":[0.016286122,0.000990438,0.0018831214,0.0033512532,0.002492373,0.007322671,0.0042078267,0.0041489103,0.0011545016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082458556,0.00023084207,0.015087811,0.0008652199,0.00031127664,0.00083891663,0.0011301407,0.19585805,0.04469528,0.6146014,0.007098671,0.11845786],"study_design_scores_gemma":[0.000044946977,0.00026116672,0.005858006,0.00017963555,0.0001865091,0.0012808569,0.00031991873,0.49931216,0.026737208,0.44843298,0.01725446,0.00013220382],"about_ca_topic_score_codex":0.000741266,"about_ca_topic_score_gemma":0.00092220254,"teacher_disagreement_score":0.0057580457,"about_ca_system_score_codex":0.0025691641,"about_ca_system_score_gemma":0.0006037177,"threshold_uncertainty_score":0.019262612},"labels":[],"label_agreement":null},{"id":"W2569474846","doi":"10.4230/dagrep.6.4.80","title":"Natural Language Argumentation: Mining, Processing, and Reasoning over Textual Arguments (Dagstuhl Seminar 16161)","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Argumentation theory; Argument (complex analysis); Natural (archaeology); Computer science; Cognition; Task (project management); Epistemology; Computational linguistics; Natural language; Linguistics; Natural language processing; Cognitive science; Psychology; Philosophy; Management; History","score_opus":0.008148196413969548,"score_gpt":0.2725896490723868,"score_spread":0.2644414526584173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569474846","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07801486,0.100418925,0.3777217,0.22155565,0.040499818,0.0025124482,0.013858148,0.011473008,0.15394555],"genre_scores_gemma":[0.34815055,0.03991983,0.3045667,0.00874886,0.018643528,0.002905193,0.03259456,0.006249938,0.23822086],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98867583,0.0057170554,0.00069964764,0.0016874933,0.0023437976,0.00087624264],"domain_scores_gemma":[0.9921755,0.004062249,0.00031988675,0.0006357311,0.0011435479,0.0016630229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017099842,0.0017611326,0.0016933114,0.0025643164,0.0021116433,0.0099743605,0.0022149445,0.0033127202,0.03109209],"category_scores_gemma":[0.023138598,0.0010712888,0.001885243,0.0023222112,0.0024641894,0.0056562466,0.007327095,0.005344171,0.024306022],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010684462,0.0009922883,0.0007843148,0.0011747703,0.00016265063,0.00041576676,0.0026790048,0.0052602547,0.005709956,0.08021108,0.51065826,0.39088327],"study_design_scores_gemma":[0.00038419766,0.0002444059,0.0035645447,0.0010454885,0.00005521217,0.0003725043,0.00077440793,0.00900627,0.006707051,0.18585454,0.7918742,0.000117183044],"about_ca_topic_score_codex":0.0011687563,"about_ca_topic_score_gemma":0.0011632738,"teacher_disagreement_score":0.03109209,"about_ca_system_score_codex":0.003730646,"about_ca_system_score_gemma":0.004761932,"threshold_uncertainty_score":0.10401338},"labels":[],"label_agreement":null},{"id":"W2570673800","doi":"10.4230/lipics.opodis.2015.2","title":"Dynamic Reconfiguration: A Tutorial (Tutorial)","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Azrieli Foundation; National Science Foundation","keywords":"Control reconfiguration; Computer science; Distributed computing; Reliability (semiconductor); Server; Key (lock); Object (grammar); Embedded system; Reliability engineering; Computer network; Engineering; Power (physics); Operating system; Artificial intelligence","score_opus":0.008623260246433827,"score_gpt":0.2393983755626764,"score_spread":0.23077511531624256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570673800","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002408824,0.7059439,0.08555731,0.0042248005,0.016009424,0.00011712468,0.00085749634,0.0019963796,0.18288478],"genre_scores_gemma":[0.026148127,0.6627362,0.090964966,0.0063470188,0.024683693,0.00048832915,0.003286747,0.0016719878,0.18367301],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996506,0.00004571045,0.000026709089,0.0000968257,0.00012723116,0.00005288062],"domain_scores_gemma":[0.99961805,0.00017657578,0.000028872715,0.000032994027,0.000078761535,0.000064726206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004233313,0.002282358,0.001157563,0.0024385983,0.0005648367,0.0022570223,0.0010390972,0.0013607745,0.030935137],"category_scores_gemma":[0.0010863479,0.0006728035,0.00083563913,0.0038863125,0.00067801983,0.003737602,0.001197886,0.003013992,0.0316107],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006110006,0.00020739913,0.00022356743,0.0017898524,0.00004324111,0.00019624876,0.00013472975,0.004659212,0.002560632,0.04278999,0.44325057,0.5040836],"study_design_scores_gemma":[0.0000073912674,0.000052593867,0.0005075416,0.00055117346,0.00001930095,0.00060630357,0.000041090156,0.0016264963,0.00036506058,0.021198863,0.9750025,0.000021498014],"about_ca_topic_score_codex":0.0014019021,"about_ca_topic_score_gemma":0.0014657024,"teacher_disagreement_score":0.030935137,"about_ca_system_score_codex":0.0011102564,"about_ca_system_score_gemma":0.00071631663,"threshold_uncertainty_score":0.103488326},"labels":[],"label_agreement":null},{"id":"W2571737124","doi":"10.4230/lipics.isaac.2016.24","title":"All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Binary logarithm; Shortest path problem; Logarithm; Mathematics; Vertex (graph theory); Time complexity; Running time; Unit disk; Graph; Discrete mathematics; Log-log plot; Algorithm","score_opus":0.015584024005765048,"score_gpt":0.24810136650653028,"score_spread":0.23251734250076522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571737124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22064145,0.002456769,0.74122703,0.002983963,0.00026194454,0.0003457615,0.0016161277,0.004899655,0.025567256],"genre_scores_gemma":[0.41439933,0.0010476548,0.5645488,0.0005767369,0.0002704327,0.0003330256,0.002984996,0.0015275951,0.014311425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969399,0.00086260913,0.00015930533,0.0008968847,0.0006691168,0.00047228488],"domain_scores_gemma":[0.9941076,0.0039606323,0.00043523518,0.0009120011,0.0003181447,0.00026628975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015791699,0.0016851071,0.0019361784,0.0012084582,0.0015729623,0.0036020093,0.0033194388,0.0015749909,0.011375241],"category_scores_gemma":[0.01020994,0.0008668152,0.0012632868,0.0033532223,0.001655858,0.010433392,0.0031221122,0.0024218191,0.0031642565],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026889888,0.0005301082,0.0029290114,0.0018953322,0.00024062517,0.0005001934,0.0012361323,0.47684637,0.016073091,0.16713195,0.038042583,0.29188567],"study_design_scores_gemma":[0.0003420758,0.0001766682,0.0007096305,0.000049949645,0.00009037521,0.00031192193,0.00030778028,0.69843626,0.004680454,0.28461486,0.010244102,0.00003588705],"about_ca_topic_score_codex":0.0048900396,"about_ca_topic_score_gemma":0.008210505,"teacher_disagreement_score":0.011375241,"about_ca_system_score_codex":0.0027553772,"about_ca_system_score_gemma":0.002021172,"threshold_uncertainty_score":0.03805399},"labels":[],"label_agreement":null},{"id":"W2576120132","doi":"10.4230/lipics.isaac.2016.57","title":"Scaling and Proximity Properties of Integrally Convex Functions","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Hausdorff Center for Mathematics; Mitsubishi Foundation","keywords":"Integrally closed; Mathematics; Convex analysis; Scaling; Subderivative; Proper convex function; Convex combination; Convex function; Logarithm; Regular polygon; Dimension (graph theory); Convex optimization; Convex set; Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01748297982224099,"score_gpt":0.20273563698842234,"score_spread":0.18525265716618136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576120132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094303064,0.00056717225,0.8900479,0.0007297719,0.00006744175,0.00004964522,0.00013868388,0.000119532,0.013976847],"genre_scores_gemma":[0.8727473,0.0012340341,0.119142815,0.000352315,0.00034510446,0.00020661893,0.00027510058,0.00013260385,0.0055641397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980933,0.00054512045,0.000106939435,0.00045751562,0.00065018795,0.0001468388],"domain_scores_gemma":[0.9915998,0.0054262863,0.0007317185,0.00074537896,0.0010819539,0.00041487737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002209095,0.0006903911,0.00081544096,0.0012354848,0.00072940387,0.0020095482,0.00073012925,0.00077348953,0.002896785],"category_scores_gemma":[0.018352518,0.00037355017,0.00069536996,0.00102559,0.002965443,0.0041899523,0.0023325488,0.00234742,0.0005251652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012748873,0.00006960914,0.0017195083,0.00017962478,0.00003324715,0.00027530504,0.0004345853,0.061864544,0.008775302,0.8816751,0.0016471142,0.04319866],"study_design_scores_gemma":[0.000018785744,0.00015260043,0.0015521145,0.00003828182,0.000014439013,0.0004419006,0.00013538745,0.43434963,0.0046705394,0.5537047,0.004886983,0.00003459784],"about_ca_topic_score_codex":0.0005043581,"about_ca_topic_score_gemma":0.00022482651,"teacher_disagreement_score":0.002896785,"about_ca_system_score_codex":0.0009833393,"about_ca_system_score_gemma":0.00047954672,"threshold_uncertainty_score":0.011682987},"labels":[],"label_agreement":null},{"id":"W2577191082","doi":"10.4230/lipics.isaac.2016.56","title":"Approximation Algorithms for Capacitated k-Travelling Repairmen Problems","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Rounding; Vehicle routing problem; Computer science; Approximation algorithm; Latency (audio); Mathematical optimization; Algorithm; Travelling salesman problem; Constant (computer programming); Routing (electronic design automation); Mathematics; Computer network; Telecommunications","score_opus":0.027757152322522058,"score_gpt":0.25974010107693307,"score_spread":0.231982948754411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577191082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024549251,0.0029860986,0.9533998,0.0014150722,0.00021386392,0.00015193074,0.00060684583,0.0017721421,0.014905126],"genre_scores_gemma":[0.44542074,0.002745514,0.5362707,0.0007749235,0.00039551783,0.0004060601,0.002293963,0.0008213685,0.01087121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976978,0.0006990702,0.00012515865,0.0004988988,0.00046983152,0.0005093158],"domain_scores_gemma":[0.99550134,0.0028949883,0.0003345253,0.00070067006,0.0003526115,0.00021587766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00215116,0.0023256782,0.0018737002,0.0011642383,0.00089750526,0.0026178292,0.0042940024,0.0022850123,0.009383113],"category_scores_gemma":[0.010595344,0.00077492965,0.0017149502,0.0032519656,0.001035465,0.0053401017,0.0020781197,0.0041034217,0.0022452755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042871365,0.0003048293,0.0011322418,0.00045505952,0.00011677145,0.00011559498,0.00031806316,0.7835944,0.0012408033,0.089484714,0.016346138,0.10646261],"study_design_scores_gemma":[0.000055766806,0.000045298766,0.000114907874,0.000033205633,0.00002189745,0.00006469593,0.00008514817,0.9181794,0.00040170044,0.07764009,0.003345125,0.000012750761],"about_ca_topic_score_codex":0.005822957,"about_ca_topic_score_gemma":0.0068322946,"teacher_disagreement_score":0.009383113,"about_ca_system_score_codex":0.0032928337,"about_ca_system_score_gemma":0.0021274085,"threshold_uncertainty_score":0.031389654},"labels":[],"label_agreement":null},{"id":"W2583679202","doi":"10.4230/lipics.aofa.2018.30","title":"Periods of Iterations of Mappings over Finite Fields with Restricted Preimage Sizes","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Modulo; Mathematics; Product (mathematics); Combinatorics; Set (abstract data type); Discrete mathematics; Heuristic; Finite set; Mathematical analysis; Mathematical optimization; Geometry; Computer science","score_opus":0.013656057012199144,"score_gpt":0.24707481273719306,"score_spread":0.23341875572499393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583679202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8999165,0.0004170555,0.08898829,0.00041632034,0.000043413438,0.00007684432,0.00030947564,0.00026370975,0.009568239],"genre_scores_gemma":[0.98530465,0.0001521634,0.011645169,0.000039087627,0.000036868594,0.000104267274,0.00017609903,0.00006188617,0.0024797106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990921,0.00034908234,0.000048241793,0.0001640536,0.00014178525,0.00020479223],"domain_scores_gemma":[0.9883111,0.007906383,0.0018147015,0.00085929676,0.00039915703,0.0007093195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023457254,0.00035684442,0.00047188386,0.0015167479,0.0006840798,0.0017763095,0.0009467283,0.00063921424,0.004448734],"category_scores_gemma":[0.021097181,0.00047494684,0.0005519897,0.00068778364,0.0021271624,0.0023181129,0.0009893671,0.00076264626,0.00031943314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094846595,0.00009951081,0.014718154,0.0001892595,0.000069886126,0.00048628697,0.00059018313,0.27843875,0.009713647,0.6738032,0.0025328065,0.018409926],"study_design_scores_gemma":[0.000093060604,0.00015556283,0.0042408328,0.000051684267,0.000024600731,0.00036121736,0.0001586808,0.73437506,0.0049511488,0.25367326,0.0018760693,0.000038740196],"about_ca_topic_score_codex":0.00091007166,"about_ca_topic_score_gemma":0.00088074134,"teacher_disagreement_score":0.004448734,"about_ca_system_score_codex":0.001804669,"about_ca_system_score_gemma":0.00079820724,"threshold_uncertainty_score":0.014882505},"labels":[],"label_agreement":null},{"id":"W2612636087","doi":"10.4230/lipics.opodis.2016.34","title":"Deletion without Rebalancing in Non-Blocking Binary Search Trees","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"Blocking (statistics); Computer science; Binary search tree; Tree (set theory); Binary tree; Lock (firearm); Bounded function; Optimal binary search tree; Algorithm; Theoretical computer science; K-ary tree; Combinatorics; Mathematics; Tree structure","score_opus":0.02315242208962659,"score_gpt":0.3028318129520669,"score_spread":0.2796793908624403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612636087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08440622,0.0006685607,0.90186363,0.0005027236,0.00008405554,0.00031154955,0.0003154642,0.005328973,0.0065188813],"genre_scores_gemma":[0.4449048,0.0003658609,0.54469657,0.0005239371,0.00007198796,0.0004238257,0.0008652643,0.00095696445,0.0071908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975721,0.00057721906,0.0001518805,0.00036533468,0.000761319,0.00057211786],"domain_scores_gemma":[0.9964682,0.0013882227,0.00048921834,0.000859903,0.0005583192,0.00023622988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018693472,0.00078162673,0.0010597506,0.0007655892,0.0011193074,0.0017267723,0.0028482785,0.0010959426,0.004062423],"category_scores_gemma":[0.0061405418,0.00077843416,0.0009515673,0.0012367048,0.0012230759,0.0035760065,0.002445995,0.0018072702,0.0015207495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016700807,0.0005993347,0.0032750228,0.0011304676,0.00011210162,0.00046418942,0.0011636809,0.44958302,0.071721576,0.0932657,0.009679994,0.36733478],"study_design_scores_gemma":[0.00038110753,0.00039822963,0.0005936341,0.00008044463,0.00007781918,0.00038541868,0.0002860866,0.9143007,0.023399638,0.04843636,0.011590299,0.00007028835],"about_ca_topic_score_codex":0.0035085713,"about_ca_topic_score_gemma":0.004516314,"teacher_disagreement_score":0.004062423,"about_ca_system_score_codex":0.0012426078,"about_ca_system_score_gemma":0.002573906,"threshold_uncertainty_score":0.013590157},"labels":[],"label_agreement":null},{"id":"W2724706363","doi":"10.4230/lipics.socg.2017.27","title":"Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Sublinear function; Dimension (graph theory); Discrete mathematics; Binary logarithm; Randomized algorithm; Data structure; Constant (computer programming); Computer science","score_opus":0.0315930621693897,"score_gpt":0.2854385854838485,"score_spread":0.25384552331445875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724706363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10096352,0.005027699,0.86030537,0.0055632237,0.00049409043,0.0001609079,0.0012704772,0.0021670552,0.024047678],"genre_scores_gemma":[0.5509722,0.0025751167,0.43529782,0.0016576601,0.0004647837,0.00023055477,0.0013960255,0.00043941423,0.0069663785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978933,0.0004899255,0.00013071315,0.00047835073,0.00069119723,0.00031660547],"domain_scores_gemma":[0.9951748,0.0021937492,0.00026398528,0.0016119415,0.0005166674,0.00023890215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013706126,0.0007264193,0.001727032,0.0011684657,0.0014677437,0.0034287355,0.0026264188,0.002017171,0.0057693175],"category_scores_gemma":[0.010552227,0.0006700219,0.0012990568,0.003681035,0.0020769916,0.0126283495,0.004001804,0.0041948375,0.0022823568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090398657,0.00041690038,0.0040399223,0.0006416277,0.00010288507,0.00049039855,0.0008484579,0.1062477,0.009588521,0.5125658,0.04133203,0.32282177],"study_design_scores_gemma":[0.00013067856,0.00019214072,0.0009528093,0.00010852194,0.000041117477,0.00067926577,0.00048020663,0.45169336,0.0054440387,0.51165926,0.028535157,0.00008336909],"about_ca_topic_score_codex":0.0035445844,"about_ca_topic_score_gemma":0.0034075335,"teacher_disagreement_score":0.0057693175,"about_ca_system_score_codex":0.0013955575,"about_ca_system_score_gemma":0.0012360599,"threshold_uncertainty_score":0.019300282},"labels":[],"label_agreement":null},{"id":"W2727825080","doi":"10.4230/lipics.esa.2016.34","title":"On Interference Among Moving Sensors and Related Problems","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Voronoi diagram; Combinatorics; Interference (communication); Binary logarithm; Set (abstract data type); Log-log plot; Upper and lower bounds; Mathematics; Diagram; Discrete mathematics; Mathematical analysis; Computer science; Geometry; Statistics; Telecommunications","score_opus":0.010557863851427367,"score_gpt":0.22149315034837466,"score_spread":0.2109352864969473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727825080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029693697,0.004904925,0.93849605,0.0023305134,0.00034124617,0.000098660246,0.00026366342,0.00020444379,0.023666777],"genre_scores_gemma":[0.77799267,0.00861413,0.18591893,0.0013484961,0.0017622517,0.0005898811,0.0009028688,0.00039725454,0.022473488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970393,0.0012348413,0.000111232206,0.00045105058,0.00070054893,0.00046305094],"domain_scores_gemma":[0.98405576,0.013200106,0.0009781829,0.00055673823,0.00075401535,0.0004550943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031072677,0.0014162664,0.0019673551,0.0021262434,0.0020405068,0.0020178286,0.0032774208,0.0026686494,0.00433538],"category_scores_gemma":[0.016997384,0.0007747687,0.0011022068,0.0038543618,0.0030867131,0.0033692264,0.004027647,0.0023938299,0.0008287868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028094347,0.00011207423,0.0017415795,0.00043885323,0.000124809,0.00064808584,0.00037221253,0.6068464,0.0015796878,0.33671772,0.010312112,0.04082541],"study_design_scores_gemma":[0.000055777742,0.00005835615,0.0005580581,0.000049716127,0.000035828514,0.0002956346,0.00014050164,0.64062434,0.00070793205,0.3509322,0.0065139774,0.000027647238],"about_ca_topic_score_codex":0.0038749382,"about_ca_topic_score_gemma":0.0018179294,"teacher_disagreement_score":0.00433538,"about_ca_system_score_codex":0.0023445738,"about_ca_system_score_gemma":0.0008920876,"threshold_uncertainty_score":0.017011166},"labels":[],"label_agreement":null},{"id":"W2733045287","doi":"10.4230/lipics.ecrts.2017.24","title":"WCET-Driven Dynamic Data Scratchpad Management With Compiler-Directed Prefetching","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Compiler; Worst-case execution time; Parallel computing; Latency (audio); CAS latency; Scheme (mathematics); Embedded system; Operating system; Execution time; Memory controller; Semiconductor memory","score_opus":0.030260485462023687,"score_gpt":0.29869695360681403,"score_spread":0.26843646814479033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2733045287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35021344,0.00062088174,0.62620944,0.0002880656,0.00009815175,0.00010371578,0.00016302441,0.018439958,0.0038632394],"genre_scores_gemma":[0.8750478,0.000118725,0.122147895,0.00007524852,0.000022747095,0.00007964603,0.00013144116,0.0006398488,0.0017366234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940825,0.00009178363,0.000039174687,0.00010218358,0.00021792928,0.000140708],"domain_scores_gemma":[0.99887484,0.00043499967,0.00016620476,0.0003019172,0.00018785463,0.000034103792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047454186,0.0006109497,0.00047547385,0.0007440644,0.00033120599,0.000633528,0.0009915078,0.00034492504,0.001319624],"category_scores_gemma":[0.0017947663,0.00032345593,0.00026731225,0.00064855866,0.0007482465,0.00088294665,0.00062478817,0.0005699092,0.0002555514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006865427,0.00029640913,0.0065502985,0.00028626644,0.00006563255,0.00044921375,0.00030412953,0.5502403,0.19246493,0.015952943,0.004404411,0.22829896],"study_design_scores_gemma":[0.000030811738,0.0000803712,0.00053954386,0.000008726295,0.000018618477,0.000041876916,0.000012817947,0.926584,0.0687982,0.002636956,0.0012336985,0.0000143916905],"about_ca_topic_score_codex":0.003764008,"about_ca_topic_score_gemma":0.005255542,"teacher_disagreement_score":0.003764008,"about_ca_system_score_codex":0.00060894847,"about_ca_system_score_gemma":0.0014807231,"threshold_uncertainty_score":0.0074841976},"labels":[],"label_agreement":null},{"id":"W2734180996","doi":"10.4230/lipics.ecoop.2017.23","title":"Interprocedural Specialization of Higher-Order Dynamic Languages Without Static Analysis","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Compiler; Computer science; Programming language; Interprocedural optimization; Compile time; Function (biology); Register allocation; Optimizing compiler; Parallel computing; Functional programming; Just-in-time compilation; Static analysis; Identity (music); Loop optimization","score_opus":0.011184281094810195,"score_gpt":0.31666544997271834,"score_spread":0.30548116887790816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734180996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2103957,0.00046343863,0.75871706,0.00017560714,0.000069179536,0.00011224524,0.00012402244,0.021234216,0.008708569],"genre_scores_gemma":[0.7811426,0.0002580024,0.20874555,0.00017796115,0.00005387593,0.00009976853,0.00034600432,0.0032276628,0.0059485664],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989619,0.00019752994,0.000087296,0.00015524485,0.0003827316,0.00021530522],"domain_scores_gemma":[0.99630654,0.0010047675,0.00040248042,0.0018980327,0.0003207283,0.00006746671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094792247,0.0006356624,0.0005329301,0.00092583644,0.00055366504,0.00086597155,0.0009760946,0.00035722714,0.001892761],"category_scores_gemma":[0.0024337913,0.00054489815,0.000998517,0.0007014384,0.0010554509,0.001393631,0.0014540408,0.0010035583,0.00066258694],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058768556,0.00031365996,0.015375344,0.00086878234,0.00019189328,0.0018073845,0.0018706403,0.0835122,0.27458796,0.074112706,0.005838208,0.54093355],"study_design_scores_gemma":[0.00008675696,0.00045842293,0.005833771,0.0001475918,0.00025029818,0.0021012232,0.00019784736,0.37720454,0.5169224,0.049228784,0.04743933,0.00012893334],"about_ca_topic_score_codex":0.00094299635,"about_ca_topic_score_gemma":0.0015854494,"teacher_disagreement_score":0.001892761,"about_ca_system_score_codex":0.00069565926,"about_ca_system_score_gemma":0.0014952581,"threshold_uncertainty_score":0.00633198},"labels":[],"label_agreement":null},{"id":"W2747422829","doi":"10.4230/lipics.approx-random.2017.5","title":"Scheduling Problems over Network of Machines","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Job shop scheduling; Computer science; Preemption; Scheduling (production processes); Flow shop scheduling; Schedule; Distributed computing; Mathematical optimization; Mathematics; Operating system","score_opus":0.025341678855584946,"score_gpt":0.29091071457535445,"score_spread":0.2655690357197695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747422829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06208929,0.008429749,0.9004489,0.0022459198,0.0008653504,0.00031281984,0.0016877016,0.000615763,0.023304425],"genre_scores_gemma":[0.58680975,0.012480091,0.36623362,0.0005310469,0.0014257027,0.00062666787,0.002585501,0.00034518825,0.028962415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841094,0.00064667687,0.00010527573,0.00041245192,0.00021068695,0.00021395949],"domain_scores_gemma":[0.99825996,0.0012241208,0.00021528447,0.00010768592,0.0000980815,0.000094851035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011685308,0.0016549582,0.0014445914,0.0009631261,0.0011530936,0.002306277,0.0013705688,0.0020297195,0.0059101167],"category_scores_gemma":[0.004220527,0.0005747662,0.0009852782,0.0032411611,0.0009915554,0.0031110619,0.0013046153,0.001325574,0.0010181444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018951617,0.00011032579,0.0008366376,0.00087440974,0.00014108597,0.000679344,0.00019400136,0.7908277,0.0019110525,0.15401505,0.00731209,0.042908754],"study_design_scores_gemma":[0.0000739302,0.00012339438,0.00042379322,0.00006726057,0.000049870963,0.0003376951,0.00013364934,0.7314378,0.0007416037,0.24285416,0.023731202,0.000025605988],"about_ca_topic_score_codex":0.0029165817,"about_ca_topic_score_gemma":0.002046911,"teacher_disagreement_score":0.0059101167,"about_ca_system_score_codex":0.00149759,"about_ca_system_score_gemma":0.00077904935,"threshold_uncertainty_score":0.019771338},"labels":[],"label_agreement":null},{"id":"W2749142859","doi":"10.4230/lipics.wabi.2017.8","title":"A General Framework for Gene Tree Correction Based on Duplication-Loss Reconciliation","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université de Montréal","funders":"","keywords":"Supertree; Tree (set theory); Phylogenetic tree; Computer science; Set (abstract data type); Binary tree; K-ary tree; Gene duplication; Interval tree; Algorithm; Tree structure; Mathematics; Theoretical computer science; Combinatorics; Biology; Gene","score_opus":0.017443418923115017,"score_gpt":0.27683856830365866,"score_spread":0.25939514938054364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749142859","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005180705,0.0002938151,0.9975188,0.0002243026,0.000047379894,0.000064943146,0.000056504625,0.00027203976,0.0010042503],"genre_scores_gemma":[0.034529153,0.0009038018,0.959538,0.00031816872,0.00029186864,0.0003612696,0.00043143064,0.00041753467,0.0032088442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949438,0.0016625456,0.00032146036,0.0012993012,0.0014087005,0.0003642804],"domain_scores_gemma":[0.9972523,0.0012345569,0.0002834796,0.0006587516,0.00043827275,0.00013253036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066580074,0.002142926,0.00284118,0.0040720305,0.0021583778,0.004058077,0.007485854,0.0042268042,0.006681281],"category_scores_gemma":[0.008977276,0.0011510475,0.004422359,0.0043094507,0.0038206652,0.004331539,0.0057535353,0.0055781663,0.0023809592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008528449,0.00008722157,0.0004997236,0.00050900935,0.00014037146,0.0006566501,0.00045174867,0.19200526,0.0053860196,0.6945845,0.006032493,0.09956177],"study_design_scores_gemma":[0.00004300122,0.00009044264,0.00024421353,0.0000954213,0.00006419518,0.0005386509,0.00007896006,0.40033627,0.002238481,0.57178557,0.024411906,0.000072897805],"about_ca_topic_score_codex":0.003070161,"about_ca_topic_score_gemma":0.0028380826,"teacher_disagreement_score":0.007485854,"about_ca_system_score_codex":0.0025574262,"about_ca_system_score_gemma":0.0029982948,"threshold_uncertainty_score":0.035211325},"labels":[],"label_agreement":null},{"id":"W2751149696","doi":"10.4230/lipics.cpm.2023.26","title":"Acceleration of FM-Index Queries Through Prefix-Free Parsing","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"International Max Planck Research School for Environmental, Cellular and Molecular Microbiology; Shurl and Kay Curci Foundation; California State University, Dominguez Hills; Gordon and Betty Moore Foundation; Pennsylvania Department of Health; National Institutes of Health; National Science Foundation","keywords":"Computer science; Identification (biology); Source code; Metric (unit); Data mining; Pattern recognition (psychology); Artificial intelligence; Biology","score_opus":0.02438688718006604,"score_gpt":0.28139486309643025,"score_spread":0.2570079759163642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751149696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063344866,0.0016499287,0.7904033,0.0005313071,0.00034093793,0.00034952202,0.0036682657,0.12944688,0.010264963],"genre_scores_gemma":[0.16144817,0.00046034635,0.8129078,0.00034391083,0.0001693573,0.00032279541,0.011379789,0.006482953,0.0064848303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738127,0.00035354498,0.00033825217,0.00063592655,0.0010072453,0.00028368234],"domain_scores_gemma":[0.995587,0.0019748106,0.00021064536,0.0013507627,0.0007440376,0.00013277496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014140091,0.0021161193,0.0015372934,0.0023334345,0.00086841156,0.0026394138,0.0030874999,0.0015357755,0.010224379],"category_scores_gemma":[0.009231922,0.0008479979,0.0013629976,0.0042024916,0.00074115413,0.005604698,0.0025186543,0.0015208971,0.009171646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013880399,0.0004593042,0.0039161807,0.0008877006,0.00016902322,0.00037157687,0.00071657344,0.016565762,0.0960034,0.0153029775,0.04976549,0.81445396],"study_design_scores_gemma":[0.000378161,0.00040590682,0.0036173647,0.00010287459,0.00016887826,0.0010226085,0.00046166897,0.726606,0.1515022,0.042781573,0.07275247,0.00020031279],"about_ca_topic_score_codex":0.0037165107,"about_ca_topic_score_gemma":0.0035371012,"teacher_disagreement_score":0.010224379,"about_ca_system_score_codex":0.0010733932,"about_ca_system_score_gemma":0.0017383039,"threshold_uncertainty_score":0.034203947},"labels":[],"label_agreement":null},{"id":"W2753236625","doi":"10.4230/lipics.cpm.2017.5","title":"Path Queries on Functions","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Path (computing); Element (criminal law); Range (aeronautics); Function (biology); Mathematics; Domain (mathematical analysis); Binary logarithm; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.020877183787311186,"score_gpt":0.273045631051949,"score_spread":0.25216844726463783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753236625","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27656054,0.004131348,0.65850115,0.00472248,0.00033452574,0.0006515791,0.0171121,0.014676584,0.023309665],"genre_scores_gemma":[0.75086766,0.0013621367,0.21885228,0.0013078357,0.0003195717,0.0008070139,0.011723801,0.0012457184,0.013513909],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722433,0.0006735691,0.00034439375,0.00062413054,0.0007000484,0.00043356436],"domain_scores_gemma":[0.98914856,0.0073465216,0.00046153666,0.0021397506,0.00069600425,0.00020753607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019567953,0.0010214789,0.001402465,0.0016174952,0.0010262027,0.0022753251,0.0013087603,0.0016891693,0.011858349],"category_scores_gemma":[0.014792647,0.00042009357,0.0007013999,0.0037862652,0.0012792648,0.010703736,0.0031715853,0.0013730824,0.0017909254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038690816,0.00031743295,0.006436108,0.0011265766,0.00013385389,0.0006402184,0.001365996,0.044886857,0.02054268,0.2978283,0.07670498,0.5461479],"study_design_scores_gemma":[0.00048294986,0.0006966281,0.0021857761,0.0002510402,0.0000913921,0.0012522939,0.0011383268,0.19677277,0.036564138,0.66378117,0.096655,0.00012847818],"about_ca_topic_score_codex":0.0019238648,"about_ca_topic_score_gemma":0.0016590789,"teacher_disagreement_score":0.011858349,"about_ca_system_score_codex":0.0022583124,"about_ca_system_score_gemma":0.0010133388,"threshold_uncertainty_score":0.03967011},"labels":[],"label_agreement":null},{"id":"W2756932492","doi":"10.4230/lipics.cosit.2017.12","title":"Targeted Cognitive Training of Spatial Skills: Perspective Taking in Robot Teleoperation","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Spatial Cognition and Navigation","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Teleoperation; Perspective (graphical); Robot; Computer science; Training (meteorology); Human–computer interaction; Cognition; Psychology; Artificial intelligence; Neuroscience; Geography","score_opus":0.02303822077972452,"score_gpt":0.2867509318269888,"score_spread":0.2637127110472643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756932492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9819806,0.0002934953,0.012923273,0.00014264055,0.000025173062,0.00009511284,0.000018860837,0.00004149604,0.004479204],"genre_scores_gemma":[0.986798,0.00033149568,0.011350654,0.000041776635,0.000009677164,0.00007722423,0.000020946796,0.000005024221,0.0013652542],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976844,0.000086629814,0.000008937962,0.000048456182,0.00005646089,0.000031097636],"domain_scores_gemma":[0.9996623,0.00012759368,0.00006424066,0.00004930277,0.00002685217,0.00006975406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003571526,0.00034574742,0.00016397299,0.00018148003,0.00019860889,0.0002679042,0.00025649555,0.0002954891,0.0021530103],"category_scores_gemma":[0.0009793139,0.000080938225,0.00016708796,0.00012101074,0.0005044602,0.00032236028,0.0004610377,0.0003995744,0.0002213349],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011692232,0.007155615,0.016299566,0.0009207991,0.00005664064,0.0006069183,0.004884594,0.0021447046,0.48829764,0.0027531805,0.0007767743,0.47493428],"study_design_scores_gemma":[0.00071234,0.04255726,0.51003194,0.00067796186,0.00035658004,0.004647375,0.005490295,0.015603272,0.3793449,0.012727167,0.027705634,0.00014530287],"about_ca_topic_score_codex":0.0005326637,"about_ca_topic_score_gemma":0.0006745604,"teacher_disagreement_score":0.0021530103,"about_ca_system_score_codex":0.0001669946,"about_ca_system_score_gemma":0.000450292,"threshold_uncertainty_score":0.007202506},"labels":[],"label_agreement":null},{"id":"W2757110170","doi":"10.4230/lipics.cosit.2017.2","title":"A New Perspective on the Mereotopology of RCC8","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary relation; Axiom; Conservative extension; Extension (predicate logic); Disjoint sets; Isomorphism (crystallography); Set theory; Mathematics; Characterization (materials science); Interpretation (philosophy); Pairwise comparison; Perspective (graphical); Computer science; Set (abstract data type); Algebra over a field; Theoretical computer science; Discrete mathematics; Pure mathematics; Artificial intelligence","score_opus":0.02455929192061818,"score_gpt":0.30054820678367833,"score_spread":0.27598891486306015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757110170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087362856,0.0028170967,0.65439343,0.010125569,0.0007716114,0.000063201536,0.0004645411,0.00070253806,0.24329913],"genre_scores_gemma":[0.8213842,0.0014591231,0.15709266,0.0017857145,0.00095612905,0.00010714236,0.000356054,0.00022749824,0.01663157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831486,0.00054924795,0.000101945516,0.00040639163,0.00045256453,0.00017493936],"domain_scores_gemma":[0.99815637,0.0007092924,0.00018096367,0.00047837305,0.0003495009,0.00012548921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017797296,0.00044691694,0.0005475719,0.0019678504,0.0019950524,0.00408281,0.0012825552,0.0014168816,0.004792478],"category_scores_gemma":[0.0023638806,0.00047514425,0.0009843746,0.00160345,0.011746444,0.012205586,0.002827977,0.0039606616,0.0006893793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002512698,0.0000013629342,0.00003262923,0.0000062220547,9.761319e-7,0.000012178416,0.00015857488,0.000094668074,0.00013521758,0.9987174,0.00013041962,0.00070802745],"study_design_scores_gemma":[0.0000070303454,0.000012622043,0.00013354176,0.000015636404,0.000006940207,0.00010551247,0.0001709942,0.0013822615,0.00041694197,0.96774966,0.029988382,0.000010454504],"about_ca_topic_score_codex":0.0022781976,"about_ca_topic_score_gemma":0.00232718,"teacher_disagreement_score":0.004792478,"about_ca_system_score_codex":0.0022445559,"about_ca_system_score_gemma":0.0013353957,"threshold_uncertainty_score":0.016285539},"labels":[],"label_agreement":null},{"id":"W2760543158","doi":"10.4230/lipics.fscd.2017.13","title":"There Is Only One Notion of Differentiation","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differential (mechanical device); Mathematics; Coalgebra; Differential calculus; Category theory; Linear logic; Categorical variable; Algebra over a field; Calculus (dental); Pure mathematics; Discrete mathematics","score_opus":0.029348905077160776,"score_gpt":0.2623765621112201,"score_spread":0.23302765703405934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760543158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023004495,0.0035553926,0.7633887,0.012303014,0.0013582726,0.00011430403,0.00051038404,0.0011468026,0.19461875],"genre_scores_gemma":[0.70435995,0.0029354414,0.23201482,0.0048242644,0.0016146614,0.00035231767,0.0004959154,0.00064334995,0.05275915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485874,0.0008190631,0.00044995616,0.0017380774,0.0015716101,0.00056257425],"domain_scores_gemma":[0.9935528,0.0019742192,0.0004852065,0.0017920459,0.001468959,0.00072674954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039084232,0.0010334773,0.001532798,0.0027077547,0.0037611302,0.008065901,0.0025251445,0.003951706,0.01078266],"category_scores_gemma":[0.0059088757,0.0008759692,0.0023253583,0.0019538817,0.016166989,0.024396585,0.010035395,0.008384108,0.003073201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010471794,0.000009504101,0.000098197415,0.000039910898,0.0000060142133,0.00003563944,0.00017328006,0.000081742495,0.00050520204,0.9943098,0.000497473,0.0042326557],"study_design_scores_gemma":[0.000022139364,0.00005479033,0.00014728383,0.000085647545,0.00002806477,0.00045814327,0.00024415218,0.0010797987,0.0022623788,0.9500713,0.045496933,0.000049318052],"about_ca_topic_score_codex":0.0005752811,"about_ca_topic_score_gemma":0.00059830345,"teacher_disagreement_score":0.01078266,"about_ca_system_score_codex":0.0030737445,"about_ca_system_score_gemma":0.0024069555,"threshold_uncertainty_score":0.0360716},"labels":[],"label_agreement":null},{"id":"W2768429747","doi":"10.4230/lipics.icalp.2018.29","title":"Interpolating between $k$-Median and $k$-Center: Approximation Algorithms for Ordered $k$-Median","year":2017,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Approximation algorithm; Metric space; Center (category theory); Algorithm; Discrete mathematics","score_opus":0.059524760361767445,"score_gpt":0.2948647382965404,"score_spread":0.23533997793477296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768429747","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020092689,0.0005326271,0.97115433,0.0007321109,0.000108440545,0.00011314154,0.00044232118,0.00089913025,0.0059251944],"genre_scores_gemma":[0.22605443,0.0004718368,0.76268935,0.0006059741,0.0001297633,0.00035612236,0.0014350781,0.0005843167,0.0076731863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986865,0.00035757682,0.00006031318,0.00039254417,0.00024119683,0.00026188485],"domain_scores_gemma":[0.99817526,0.0010311779,0.00017348057,0.00029884445,0.00017076754,0.00015043504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020670847,0.0018638844,0.0026120325,0.0012257402,0.0010547879,0.001975477,0.003565198,0.0023483627,0.008648572],"category_scores_gemma":[0.005909321,0.00085201074,0.0018027433,0.0031166968,0.0014957963,0.0048576575,0.0029405567,0.0038883237,0.0016908282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043632154,0.00035775837,0.0009529734,0.0002723197,0.00008835996,0.00010794367,0.00016647506,0.80049497,0.0010580771,0.0800185,0.016572611,0.09947365],"study_design_scores_gemma":[0.000051934694,0.000055980163,0.00010077861,0.000026797785,0.000010735425,0.000040212704,0.000053732445,0.93546414,0.0005140677,0.061349727,0.0023175476,0.000014359341],"about_ca_topic_score_codex":0.0067318277,"about_ca_topic_score_gemma":0.009832218,"teacher_disagreement_score":0.008648572,"about_ca_system_score_codex":0.0024683315,"about_ca_system_score_gemma":0.0027543763,"threshold_uncertainty_score":0.028932393},"labels":[],"label_agreement":null},{"id":"W2772933217","doi":"10.4230/lipics.disc.2017.12","title":"On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linearizability; Computer science; Set (abstract data type); Algorithm; Programming language","score_opus":0.014070423245765592,"score_gpt":0.2588253246099194,"score_spread":0.24475490136415382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772933217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3913379,0.0008701417,0.5706154,0.0035707785,0.000121951794,0.00039985808,0.00080839667,0.0011146707,0.031160928],"genre_scores_gemma":[0.90315825,0.00050369353,0.08447947,0.0004783101,0.00025557078,0.00093464466,0.000662902,0.00032810992,0.009199057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98210126,0.004162144,0.0022382187,0.004655009,0.0038986602,0.0029447023],"domain_scores_gemma":[0.8472782,0.11828173,0.009536893,0.016118597,0.0047242655,0.0040604006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009086299,0.001134745,0.002793569,0.0028113052,0.0048176674,0.013199306,0.0049006734,0.0028977175,0.0091155665],"category_scores_gemma":[0.056328006,0.0019189682,0.003922885,0.003127076,0.018984446,0.039397202,0.013868819,0.007563871,0.0012770803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004556206,0.00014462494,0.003836752,0.00032868536,0.000062322346,0.00039744104,0.0018866705,0.012540189,0.0032605568,0.96538734,0.0008113954,0.0108883325],"study_design_scores_gemma":[0.000109719156,0.00010464674,0.0005924863,0.000098550656,0.00011485032,0.00047424948,0.00047090848,0.03857527,0.0063860132,0.94952404,0.0034708714,0.000078233476],"about_ca_topic_score_codex":0.0014617139,"about_ca_topic_score_gemma":0.0007216924,"teacher_disagreement_score":0.013199306,"about_ca_system_score_codex":0.0038090602,"about_ca_system_score_gemma":0.002766668,"threshold_uncertainty_score":0.048053503},"labels":[],"label_agreement":null},{"id":"W2783084218","doi":"10.4230/lipics.isaac.2017.30","title":"Succinct Color Searching in One Dimension","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Dimension (graph theory); Set (abstract data type); Omega; Interval (graph theory); Rank (graph theory); Space (punctuation); Integer (computer science); Mathematics; Binary logarithm; Discrete mathematics; Point (geometry); Computer science; Physics; Geometry","score_opus":0.03602457941706265,"score_gpt":0.2935508951595492,"score_spread":0.2575263157424865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783084218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16852392,0.0022200674,0.80576134,0.0024034842,0.00025748208,0.00031149542,0.0049273893,0.008072068,0.007522829],"genre_scores_gemma":[0.5184683,0.0008937485,0.46569967,0.0010834486,0.00016070047,0.00053067884,0.0056693126,0.0007015072,0.0067926142],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940293,0.0012705905,0.0007863526,0.0010984212,0.0022095446,0.00060581317],"domain_scores_gemma":[0.98076254,0.0066531375,0.001811607,0.008824426,0.0015360926,0.0004122439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026338527,0.00088491704,0.0019805704,0.0013630171,0.0012067737,0.0039610527,0.003551537,0.0015457651,0.006440796],"category_scores_gemma":[0.016288666,0.0008635461,0.0009607135,0.0046322853,0.0019584564,0.014241291,0.0041159997,0.0024436612,0.0017825967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034182863,0.00072594505,0.008839749,0.0014120457,0.00018953941,0.00047000163,0.0014819211,0.20833807,0.024048185,0.30465677,0.027257336,0.41916212],"study_design_scores_gemma":[0.00038320056,0.00045969072,0.0011567936,0.00021181162,0.00008154268,0.0005720059,0.000530931,0.5896574,0.030585537,0.35056612,0.025629943,0.00016501144],"about_ca_topic_score_codex":0.0027413915,"about_ca_topic_score_gemma":0.0030704893,"teacher_disagreement_score":0.006440796,"about_ca_system_score_codex":0.0025947776,"about_ca_system_score_gemma":0.0026168784,"threshold_uncertainty_score":0.021546602},"labels":[],"label_agreement":null},{"id":"W2783565018","doi":"10.20382/jocg.v9i1a15","title":"Routing on the Visibility Graph","year":2017,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Exploratory Research for Advanced Technology; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Visibility graph; Equal-cost multi-path routing; Computer science; Combinatorics; Routing (electronic design automation); Static routing; Visibility; Graph; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Computer network; Routing protocol; Geography","score_opus":0.04137934408100575,"score_gpt":0.2961158290571426,"score_spread":0.2547364849761369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783565018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09235077,0.00062769745,0.89628565,0.000733796,0.00007300779,0.00010201763,0.0004612422,0.00079635443,0.008569422],"genre_scores_gemma":[0.72822964,0.00095931644,0.26297927,0.00018619274,0.000099629004,0.0001701631,0.0012589297,0.00032596017,0.005790908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990941,0.00020756922,0.000040934203,0.00029651506,0.00016039706,0.00020037532],"domain_scores_gemma":[0.9982168,0.0009129169,0.00022706254,0.00043875983,0.00011459059,0.00008985668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005040769,0.00065677206,0.0009048652,0.000575473,0.0008957812,0.0016321609,0.0012766466,0.0008905097,0.003353286],"category_scores_gemma":[0.0041984245,0.00047831915,0.0006971386,0.0010201752,0.0009843882,0.0033474187,0.0020285107,0.0011072541,0.0004707037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003788674,0.00007698418,0.0014331597,0.00035196228,0.000094413066,0.00032851248,0.00036804494,0.6569765,0.013859511,0.18568039,0.0075878915,0.13286377],"study_design_scores_gemma":[0.00004944816,0.00011889688,0.0005555242,0.000028919318,0.00004216654,0.00021309995,0.00015437683,0.7754328,0.0054984367,0.20749381,0.010388392,0.000024138304],"about_ca_topic_score_codex":0.003587725,"about_ca_topic_score_gemma":0.0035772265,"teacher_disagreement_score":0.003587725,"about_ca_system_score_codex":0.0010523871,"about_ca_system_score_gemma":0.0009262375,"threshold_uncertainty_score":0.011217892},"labels":[],"label_agreement":null},{"id":"W2787986197","doi":"10.4230/lipics.icalp.2018.141","title":"The Beta-Bernoulli process and algebraic effects","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Engineering and Physical Sciences Research Council; Ministry of Science and ICT, South Korea","keywords":"Bernoulli's principle; Computer science; Bernoulli process; Algebraic number; Theoretical computer science; Process (computing); Semantics (computer science); Bayesian probability; Block (permutation group theory); Mathematics; Algebra over a field; Programming language; Artificial intelligence; Pure mathematics","score_opus":0.013770906717360573,"score_gpt":0.2611088724838626,"score_spread":0.24733796576650202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787986197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01617216,0.00066946325,0.9616283,0.0021149758,0.00014549219,0.00003509108,0.00009939264,0.00010253078,0.019032637],"genre_scores_gemma":[0.6403246,0.0024924478,0.3376846,0.0013967878,0.0008398533,0.0003377375,0.00018287722,0.00026929376,0.01647175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601585,0.0013689543,0.0002020739,0.00060464576,0.0015262412,0.00028222715],"domain_scores_gemma":[0.9897082,0.006635726,0.0010909799,0.00096596254,0.0011858415,0.00041337413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055398936,0.00062628306,0.0006942873,0.001969459,0.0015875393,0.00415714,0.0013406038,0.0013969104,0.0054183383],"category_scores_gemma":[0.014928309,0.0005789853,0.0014299463,0.0017455019,0.007173889,0.011244115,0.0035646695,0.0042712935,0.0007921944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025225286,0.00000251395,0.000073297495,0.000007815856,0.0000020591615,0.000015153196,0.000041266776,0.0006632896,0.000065484935,0.9979085,0.00008377081,0.0011345006],"study_design_scores_gemma":[0.0000054856146,0.0000076199303,0.000056583358,0.000014223663,0.0000064494775,0.000061449886,0.000020971152,0.0075966944,0.00020594259,0.9882734,0.003742713,0.000008451549],"about_ca_topic_score_codex":0.001243146,"about_ca_topic_score_gemma":0.00084781495,"teacher_disagreement_score":0.0055398936,"about_ca_system_score_codex":0.0019398957,"about_ca_system_score_gemma":0.0016142388,"threshold_uncertainty_score":0.029298127},"labels":[],"label_agreement":null},{"id":"W2788862636","doi":"10.20382/jocg.v11i1a16","title":"Faster Algorithms for some Optimization Problems on Collinear Points","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Disjoint sets; Interval (graph theory); Dimension (graph theory); Algorithm; Point (geometry); Running time; Range (aeronautics); Set (abstract data type); Server; Computer science; Combinatorics; Mathematics; Geometry; Computer network","score_opus":0.03458544815699344,"score_gpt":0.2824341130306675,"score_spread":0.24784866487367407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788862636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007124652,0.0011309496,0.9780291,0.0008150482,0.00026563075,0.00027949165,0.00034473516,0.0034419445,0.008568445],"genre_scores_gemma":[0.05674362,0.00053035346,0.93410003,0.0005794001,0.0002871909,0.00078438444,0.0013633842,0.0010321323,0.004579476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605715,0.0008489357,0.00025478928,0.0012371104,0.0009921732,0.0006097906],"domain_scores_gemma":[0.99294394,0.004117893,0.00046298603,0.0012892104,0.0009951625,0.00019091838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030220698,0.0044847257,0.0028574008,0.0024231097,0.0015719801,0.0029394273,0.0044309855,0.002962064,0.027716069],"category_scores_gemma":[0.01189776,0.0015494765,0.0037797021,0.0041517112,0.0013461385,0.007470639,0.004090338,0.0063712425,0.0081346715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079137005,0.00087232003,0.001930448,0.0016766825,0.0003964584,0.00036625937,0.00055976654,0.33223,0.006492047,0.114206985,0.049541533,0.49093613],"study_design_scores_gemma":[0.00040446737,0.00013664158,0.0004695718,0.000096846554,0.00008322882,0.00021407478,0.00014332634,0.8236116,0.0021037823,0.15597732,0.016710417,0.000048698526],"about_ca_topic_score_codex":0.004992135,"about_ca_topic_score_gemma":0.0077504492,"teacher_disagreement_score":0.027716069,"about_ca_system_score_codex":0.0025434096,"about_ca_system_score_gemma":0.0027290261,"threshold_uncertainty_score":0.092719495},"labels":[],"label_agreement":null},{"id":"W2793662473","doi":"10.4230/lipics.stacs.2018.54","title":"Sums of Palindromes: an Approach via Automata","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Natural number; Automaton; Base (topology); Representation (politics); Combinatorics; Constant (computer programming); Mathematics; Natural (archaeology); Discrete mathematics; Computer science; Theoretical computer science","score_opus":0.016344549135428415,"score_gpt":0.26225920579889506,"score_spread":0.24591465666346665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793662473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031330116,0.0022440716,0.9442293,0.0012389112,0.00033621438,0.000121814875,0.00015859438,0.0003855496,0.01995529],"genre_scores_gemma":[0.33132905,0.0015460487,0.6542704,0.00058575213,0.00076767715,0.00036331455,0.0003136705,0.00034429075,0.010479697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960245,0.0014674976,0.0003875132,0.00097653776,0.0008964206,0.00024749548],"domain_scores_gemma":[0.9938498,0.004026308,0.0003396051,0.00092346943,0.0005929826,0.0002678697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031921978,0.0011933418,0.0016820799,0.0033897124,0.0020843965,0.005030676,0.0031580492,0.0017263136,0.006851376],"category_scores_gemma":[0.009419452,0.0014999355,0.0037152166,0.0016008614,0.0048011784,0.010506076,0.004504921,0.0047547575,0.0013810792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049616356,0.00003071207,0.00019884283,0.00009554222,0.000030819603,0.00011291053,0.0002873151,0.00459757,0.001527453,0.9820004,0.00052150275,0.0105472375],"study_design_scores_gemma":[0.000012670175,0.000020434152,0.000040667357,0.000028450997,0.000016285452,0.000066047476,0.00004511015,0.027284706,0.00096592196,0.96752733,0.0039742677,0.00001805927],"about_ca_topic_score_codex":0.0006795974,"about_ca_topic_score_gemma":0.001000921,"teacher_disagreement_score":0.006851376,"about_ca_system_score_codex":0.0020002543,"about_ca_system_score_gemma":0.00080434146,"threshold_uncertainty_score":0.022920132},"labels":[],"label_agreement":null},{"id":"W2794549768","doi":"10.4230/lipics.opodis.2017.11","title":"Evacuating an Equilateral Triangle in the Face-to-Face Model","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Robot; Upper and lower bounds; Equilateral triangle; Face (sociological concept); Combinatorics; Computer science; Boundary (topology); Mathematics; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.052625107559147274,"score_gpt":0.33286018274123674,"score_spread":0.28023507518208945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794549768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07400103,0.00029384356,0.90078324,0.00072213623,0.00011757762,0.00012396829,0.00031182423,0.0005271527,0.02311923],"genre_scores_gemma":[0.65647995,0.00066405575,0.30467394,0.000453711,0.00007924294,0.00036246428,0.00094826415,0.00036191786,0.0359764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993305,0.0001734175,0.000024096633,0.00011720316,0.00015595472,0.00019883079],"domain_scores_gemma":[0.999206,0.0003576134,0.00009553092,0.00012799382,0.00008461432,0.0001282832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004951313,0.00064269896,0.00097446615,0.00037282088,0.00084099034,0.000895774,0.002624984,0.00169274,0.011441566],"category_scores_gemma":[0.0026355241,0.0004351935,0.0011702753,0.00052992173,0.0012122788,0.001999219,0.0027583817,0.0017421775,0.002072472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020509209,0.000048199952,0.00034396187,0.000114720955,0.000015119535,0.00040643456,0.00018394367,0.91472346,0.003277767,0.06051034,0.0027402563,0.017430676],"study_design_scores_gemma":[0.00003136147,0.000042249714,0.000063794796,0.000011243635,0.000004081428,0.000082979124,0.00008072467,0.9630359,0.00085102854,0.03369044,0.002094163,0.000012012607],"about_ca_topic_score_codex":0.008393036,"about_ca_topic_score_gemma":0.006185736,"teacher_disagreement_score":0.011441566,"about_ca_system_score_codex":0.0011120617,"about_ca_system_score_gemma":0.0007533977,"threshold_uncertainty_score":0.038275838},"labels":[],"label_agreement":null},{"id":"W2798279120","doi":"10.20382/jocg.v12i2a2","title":"Extending Drawings of Graphs to Arrangements of Pseudolines","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; European Commission","keywords":"Computer science","score_opus":0.017000399652586207,"score_gpt":0.2873462560179413,"score_spread":0.2703458563653551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798279120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13240954,0.0005303798,0.8385325,0.00031896666,0.00010341653,0.000111778565,0.00035897834,0.0011414653,0.02649295],"genre_scores_gemma":[0.50448346,0.0011820623,0.48223934,0.00017400619,0.00012539471,0.00016821998,0.001087759,0.00043909997,0.010100636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993026,0.00018964187,0.00005075261,0.00019778397,0.00017978663,0.000079480924],"domain_scores_gemma":[0.9986505,0.00038502962,0.00021769178,0.00043088547,0.0002190007,0.00009688467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030029783,0.000616229,0.00030408174,0.0011154759,0.0005532246,0.0014862962,0.0006997952,0.0006197084,0.0041685672],"category_scores_gemma":[0.0027176389,0.00055395084,0.0006332902,0.0017105166,0.0010733185,0.0026721545,0.0014389347,0.0012149024,0.0009433787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010337941,0.00006414874,0.0017280077,0.00018778958,0.000016005251,0.00069456943,0.0008605283,0.052452706,0.01316047,0.77207446,0.006630646,0.15202723],"study_design_scores_gemma":[0.000032687585,0.000104249826,0.0010869828,0.00008001363,0.00002586351,0.001027834,0.00035626418,0.14447261,0.010146491,0.7594246,0.0831923,0.000050043374],"about_ca_topic_score_codex":0.0009029631,"about_ca_topic_score_gemma":0.0011769976,"teacher_disagreement_score":0.0041685672,"about_ca_system_score_codex":0.00058672315,"about_ca_system_score_gemma":0.00026881148,"threshold_uncertainty_score":0.0139452815},"labels":[],"label_agreement":null},{"id":"W2798438706","doi":"10.4230/lipics.itcs.2019.52","title":"Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Property testing; Omega; Combinatorics; Discrete mathematics; Computer science; Computerized adaptive testing; Graph; Sampling (signal processing); Mathematics; Theoretical computer science; Statistics; Physics","score_opus":0.053714843414863066,"score_gpt":0.29322430157427337,"score_spread":0.2395094581594103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798438706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11904708,0.0014710766,0.8340054,0.006877303,0.00025928285,0.00058412354,0.0019856005,0.0059048985,0.02986517],"genre_scores_gemma":[0.79356444,0.00080304296,0.18213692,0.0033659742,0.00085316284,0.0013043691,0.0050019985,0.0022580805,0.010711929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9755004,0.0070840875,0.001358102,0.0039575584,0.008044144,0.0040556686],"domain_scores_gemma":[0.87871784,0.087801404,0.004509959,0.021046039,0.0047722645,0.0031524966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008073893,0.003541519,0.0027995806,0.0026209522,0.0021425905,0.008084303,0.008187771,0.0033402913,0.014194502],"category_scores_gemma":[0.058986668,0.0016290862,0.0055818018,0.0026671155,0.0050675706,0.020924376,0.007840766,0.010252428,0.0032053737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004498348,0.0020825227,0.018991455,0.0015662438,0.0006523716,0.0009831176,0.0015756794,0.27389425,0.046659112,0.43254995,0.031087225,0.18545978],"study_design_scores_gemma":[0.00022028525,0.00035054213,0.0014364047,0.00008133666,0.00026806397,0.0004469815,0.00026501107,0.6590087,0.011199876,0.32265675,0.00397448,0.00009160393],"about_ca_topic_score_codex":0.0038532035,"about_ca_topic_score_gemma":0.0045887446,"teacher_disagreement_score":0.014194502,"about_ca_system_score_codex":0.00491083,"about_ca_system_score_gemma":0.00419466,"threshold_uncertainty_score":0.047485292},"labels":[],"label_agreement":null},{"id":"W2798468821","doi":"10.4230/lipics.socg.2018.24","title":"Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Binary logarithm; Unit disk; Bounded function; Upper and lower bounds; Time complexity; Metric space; Graph; Oracle; Discrete mathematics; Computer science","score_opus":0.014313323477263336,"score_gpt":0.2540391938587569,"score_spread":0.23972587038149357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798468821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09848199,0.0018543665,0.8861956,0.0010187895,0.000118720825,0.00015701666,0.0015751175,0.004218126,0.0063802605],"genre_scores_gemma":[0.4929958,0.0009274324,0.49547198,0.0002890609,0.00016163496,0.00025966714,0.0036732384,0.00055354804,0.0056677074],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974068,0.0005760009,0.00019848968,0.0007243383,0.0008230143,0.0002714],"domain_scores_gemma":[0.99505264,0.0022461084,0.00054071506,0.0015779507,0.0003622405,0.00022043951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010128138,0.0014851565,0.0017697504,0.0014768174,0.0007239373,0.0023162796,0.0042976732,0.0017298803,0.0062966654],"category_scores_gemma":[0.01156676,0.00069862005,0.00091609673,0.0035768661,0.0010219943,0.009055033,0.0035233013,0.0021584507,0.0020344083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002612932,0.0004334786,0.004025789,0.0012932062,0.00019989147,0.00034616067,0.000594379,0.39255655,0.018751033,0.15003897,0.020670092,0.40847746],"study_design_scores_gemma":[0.00013553648,0.00019340822,0.00077986566,0.000038390943,0.00004438435,0.00035051175,0.00016844222,0.8146656,0.008130988,0.16868377,0.006768909,0.00004008652],"about_ca_topic_score_codex":0.003047047,"about_ca_topic_score_gemma":0.0036215943,"teacher_disagreement_score":0.0062966654,"about_ca_system_score_codex":0.0017055643,"about_ca_system_score_gemma":0.00089871476,"threshold_uncertainty_score":0.02106446},"labels":[],"label_agreement":null},{"id":"W2799196781","doi":"10.4230/lipics.mfcs.2018.75","title":"Reconfiguration of Graph Minors","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Control reconfiguration; Vertex (graph theory); Mathematics; Graph; Edge contraction; Vertex connectivity; Discrete mathematics; Computer science; Line graph; Graph power","score_opus":0.02228317346872367,"score_gpt":0.25909982572182005,"score_spread":0.2368166522530964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799196781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53330815,0.00034861176,0.4087316,0.0005305861,0.00018573698,0.00025252916,0.000568723,0.0016625794,0.054411404],"genre_scores_gemma":[0.94053227,0.0001934241,0.044743165,0.00013186414,0.00007861752,0.00013269523,0.00069490744,0.0003005945,0.013192535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958986,0.00007871162,0.000023053155,0.00015156792,0.00007008346,0.000086754466],"domain_scores_gemma":[0.999102,0.00018293728,0.00017032435,0.00030361483,0.00009804597,0.00014313916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025986216,0.000468512,0.0003418022,0.0005393858,0.0007800894,0.0010243766,0.0006326595,0.00042382313,0.005408711],"category_scores_gemma":[0.0015930277,0.00026083447,0.0008035712,0.0003966837,0.0010799114,0.001540647,0.0012273133,0.00064740656,0.0006440234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033761642,0.00013483404,0.0023885393,0.0002284595,0.00005055626,0.0014310824,0.0013471792,0.07835067,0.055146497,0.79256624,0.0070807375,0.060937714],"study_design_scores_gemma":[0.00007267681,0.00032312315,0.00197585,0.000034116973,0.000045817113,0.0017138247,0.00069377513,0.20616467,0.017522737,0.7300151,0.041391272,0.000047039008],"about_ca_topic_score_codex":0.0012778577,"about_ca_topic_score_gemma":0.0012242694,"teacher_disagreement_score":0.005408711,"about_ca_system_score_codex":0.00076371426,"about_ca_system_score_gemma":0.00038166356,"threshold_uncertainty_score":0.018093944},"labels":[],"label_agreement":null},{"id":"W2800605324","doi":"10.4230/lipics.disc.2018.21","title":"An Almost Tight RMR Lower Bound for Abortable Test-And-Set","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Swap (finance); Computer science; Omega; Constant (computer programming); Set (abstract data type); Upper and lower bounds; Cache; Theoretical computer science; Parallel computing; Mathematics; Programming language","score_opus":0.018384321435701824,"score_gpt":0.2866736917350727,"score_spread":0.26828937029937083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800605324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07888873,0.004358439,0.84753084,0.011463273,0.0011932418,0.00082210975,0.0016429396,0.0130710285,0.04102939],"genre_scores_gemma":[0.60294276,0.0015588991,0.35644707,0.005061412,0.0014975796,0.0017752552,0.003043079,0.0048790914,0.022794968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9735724,0.006502231,0.0013739949,0.0045352583,0.008672027,0.005344115],"domain_scores_gemma":[0.889586,0.06585898,0.0048338003,0.032707695,0.004203244,0.0028102142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010329455,0.0038533732,0.0044949325,0.002344565,0.003298142,0.007346414,0.010347364,0.004274599,0.027264044],"category_scores_gemma":[0.058088038,0.0019379201,0.005487635,0.0027745557,0.0055301012,0.020145247,0.011632544,0.013679618,0.007941881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062953252,0.0019460049,0.008227481,0.0030763163,0.00063714496,0.0011368502,0.0013978163,0.23974694,0.060883638,0.35805845,0.066141106,0.25245303],"study_design_scores_gemma":[0.00046856378,0.00063105696,0.0015948643,0.00023662976,0.00045334833,0.00080361863,0.00025098346,0.6805738,0.02201532,0.2787217,0.0140611725,0.00018888571],"about_ca_topic_score_codex":0.0030653935,"about_ca_topic_score_gemma":0.004219621,"teacher_disagreement_score":0.027264044,"about_ca_system_score_codex":0.008082372,"about_ca_system_score_gemma":0.007545148,"threshold_uncertainty_score":0.091207266},"labels":[],"label_agreement":null},{"id":"W2804358784","doi":"10.4230/lipics.aofa.2018.36","title":"Average Cost of QuickXsort with Pivot Sampling","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Quicksort; Sorting; Selection (genetic algorithm); Term (time); Mathematical optimization; Sampling (signal processing); Computer science; Isolation (microbiology); Matching (statistics); Linear programming; sort; Algorithm; Mathematics; Sorting algorithm; Statistics; Arithmetic; Artificial intelligence","score_opus":0.03303782809232589,"score_gpt":0.2881667979971099,"score_spread":0.25512896990478406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804358784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1882364,0.008569496,0.72048455,0.005178857,0.0011164307,0.00059420476,0.0037005392,0.017474234,0.054645304],"genre_scores_gemma":[0.57780457,0.0015447285,0.38760832,0.0014693873,0.0005091106,0.00073676254,0.0039671343,0.005121745,0.021238303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9889135,0.0017308258,0.00065034593,0.0014422393,0.0051672347,0.0020958616],"domain_scores_gemma":[0.9804248,0.009747706,0.00080199656,0.0058451085,0.0024108305,0.0007695823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005578994,0.0018694754,0.001840038,0.002265585,0.0017210321,0.004969547,0.0044854027,0.0016317812,0.016155867],"category_scores_gemma":[0.02795314,0.0010597374,0.0015884911,0.0040356065,0.0026342422,0.011724041,0.004503642,0.002761932,0.0040287813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004674547,0.00054758746,0.008247903,0.0015394482,0.0003569149,0.00035155474,0.0005090339,0.26234692,0.02632352,0.1998619,0.0708209,0.4244198],"study_design_scores_gemma":[0.00020484634,0.00030375316,0.0017595348,0.00013411748,0.00020311736,0.00039925694,0.00018874012,0.8270506,0.03100561,0.12163086,0.017028673,0.00009086846],"about_ca_topic_score_codex":0.0046189106,"about_ca_topic_score_gemma":0.009602143,"teacher_disagreement_score":0.016155867,"about_ca_system_score_codex":0.004945519,"about_ca_system_score_gemma":0.0072669555,"threshold_uncertainty_score":0.05404675},"labels":[],"label_agreement":null},{"id":"W2804472712","doi":"10.4230/lipics.cpm.2018.6","title":"Nearest constrained circular words","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Point (geometry); Computer science; Word (group theory); Polynomial; Dynamic programming; Algorithm; Time complexity; Mathematical optimization; Mathematics; Geometry; Mathematical analysis","score_opus":0.017279605229506646,"score_gpt":0.2567727694223453,"score_spread":0.23949316419283864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804472712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29007187,0.0017014104,0.678334,0.0010459329,0.00043037863,0.00022292633,0.0010879145,0.0006901357,0.026415413],"genre_scores_gemma":[0.69879556,0.00078815856,0.27367395,0.00046878832,0.00022151343,0.00033754646,0.0022354661,0.0004789292,0.023000093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859256,0.0002531555,0.00013882155,0.00059078797,0.00026222106,0.00016248065],"domain_scores_gemma":[0.99631834,0.002021236,0.00054566376,0.00048220262,0.00035835363,0.0002742464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005005582,0.00065288716,0.00080332236,0.0010106147,0.0019684443,0.0017135296,0.0013536027,0.0016320118,0.012608458],"category_scores_gemma":[0.0055739144,0.0005563738,0.00094829104,0.001245087,0.0018406083,0.0043565063,0.0022402648,0.0012516695,0.0022212816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005449966,0.00016422893,0.002285382,0.0008807302,0.00007427424,0.001381958,0.001473846,0.08357658,0.017373737,0.78740674,0.0072455397,0.09759189],"study_design_scores_gemma":[0.0000481857,0.00015157842,0.0005442383,0.000097038595,0.000040068986,0.00082991103,0.0007336064,0.11341368,0.006464682,0.85120547,0.026392812,0.00007861896],"about_ca_topic_score_codex":0.0011963847,"about_ca_topic_score_gemma":0.0011699944,"teacher_disagreement_score":0.012608458,"about_ca_system_score_codex":0.0008174186,"about_ca_system_score_gemma":0.00071367086,"threshold_uncertainty_score":0.042179525},"labels":[],"label_agreement":null},{"id":"W2807502981","doi":"10.4230/lipics.isaac.2018.14","title":"An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Sink (geography); Path (computing); Aggregate (composite); Minimax; Computer science; Operations research; Mathematical economics; Economics; Mathematics; Computer network; Geography; Cartography; Machine learning; Materials science","score_opus":0.010641403169443642,"score_gpt":0.24689880755193852,"score_spread":0.23625740438249487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807502981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02461041,0.000701178,0.95988315,0.0014973312,0.00016360532,0.00029419066,0.00060632866,0.003696802,0.008546985],"genre_scores_gemma":[0.26966003,0.00052081584,0.711797,0.0005759968,0.00019582265,0.00065402774,0.0018676907,0.00097153365,0.013757055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890625,0.00033905832,0.000045059358,0.00029656707,0.00016725896,0.00024576896],"domain_scores_gemma":[0.9982609,0.0012287502,0.00012944994,0.0001959393,0.00009718885,0.0000877248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018210115,0.002651841,0.0020879335,0.00086001924,0.0009848581,0.0016628988,0.0024627668,0.0025234038,0.01157936],"category_scores_gemma":[0.004372567,0.00076633727,0.001352434,0.0012663938,0.00097470527,0.0036312994,0.0024681755,0.002275874,0.0022284428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006827305,0.00025336668,0.00073721504,0.0004438229,0.00012606248,0.00015708357,0.0002599802,0.7537723,0.0022111929,0.046168797,0.024057394,0.17113],"study_design_scores_gemma":[0.00008395788,0.00008872499,0.00014311372,0.000018515353,0.000022086511,0.000059396058,0.000052802556,0.9415724,0.0008279027,0.054466408,0.002651805,0.000012908628],"about_ca_topic_score_codex":0.0029049888,"about_ca_topic_score_gemma":0.0059232474,"teacher_disagreement_score":0.01157936,"about_ca_system_score_codex":0.0019181782,"about_ca_system_score_gemma":0.002038301,"threshold_uncertainty_score":0.03873682},"labels":[],"label_agreement":null},{"id":"W2810174119","doi":"10.4230/lipics.approx-random.2018.46","title":"Satisfiability and Derandomization for Small Polynomial Threshold Circuits","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Polynomial; Computer science; Algorithm; Discrete mathematics; Combinatorics","score_opus":0.017630096420032347,"score_gpt":0.24257035753034417,"score_spread":0.22494026111031182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810174119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2634573,0.0011816024,0.7057559,0.0067742993,0.00019257294,0.00039568567,0.0014266866,0.0028656505,0.017950272],"genre_scores_gemma":[0.8976091,0.00064160937,0.08778442,0.0013375208,0.00025415412,0.00062297913,0.0013282365,0.00063456816,0.009787485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99367493,0.002280925,0.0003370556,0.0016960566,0.0010580447,0.00095299527],"domain_scores_gemma":[0.96218765,0.029410033,0.0016453177,0.0046049207,0.0012882376,0.0008638938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043444256,0.001190021,0.0017395407,0.0010089893,0.0013612224,0.003701549,0.0026427135,0.0017523868,0.0069412347],"category_scores_gemma":[0.034128778,0.0006981056,0.0026696727,0.0011829715,0.0035560506,0.007855547,0.0040784054,0.005943125,0.0009447644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011490473,0.00023445538,0.0048084166,0.0005952848,0.00027232195,0.0002965773,0.0006195481,0.26940677,0.017564412,0.65631324,0.007992702,0.040747155],"study_design_scores_gemma":[0.00016315175,0.000087748514,0.00054691563,0.000048378017,0.00010207937,0.00009818075,0.000067122426,0.6167107,0.0057265237,0.3737628,0.0026495887,0.000036824382],"about_ca_topic_score_codex":0.0027518587,"about_ca_topic_score_gemma":0.003181865,"teacher_disagreement_score":0.0069412347,"about_ca_system_score_codex":0.005406523,"about_ca_system_score_gemma":0.0037872833,"threshold_uncertainty_score":0.039227307},"labels":[],"label_agreement":null},{"id":"W2810396831","doi":"10.4230/lipics.aofa.2018.4","title":"Bootstrap Percolation and Galton-Watson Trees (Keynote Speakers)","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Percolation (cognitive psychology); Mathematics; Statistics; Watson; Econometrics; Computer science; Artificial intelligence; Psychology","score_opus":0.06048173084340924,"score_gpt":0.3462339176110378,"score_spread":0.28575218676762854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810396831","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09221456,0.05398563,0.4765923,0.031147094,0.008106937,0.00015235657,0.00068409916,0.00089571025,0.33622128],"genre_scores_gemma":[0.86993515,0.014360212,0.045993775,0.0037139428,0.0055913473,0.00024444415,0.000313097,0.00028906358,0.05955899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927825,0.00029788635,0.000022010758,0.00013690292,0.00018398809,0.00008094985],"domain_scores_gemma":[0.99881077,0.00070651044,0.00009294519,0.00007876264,0.00015740328,0.00015363011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013120407,0.0005387941,0.0005939736,0.0014257317,0.0013394661,0.0023641998,0.00069148914,0.0016376153,0.0062847245],"category_scores_gemma":[0.005842677,0.00035912156,0.00075787655,0.0018669544,0.0036749858,0.0030810854,0.0014424407,0.002471988,0.0014578167],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010192662,0.0000057557413,0.00012898631,0.000029992318,0.000005848344,0.00006297763,0.00014267601,0.0015524984,0.00018591448,0.98668146,0.005571975,0.005621694],"study_design_scores_gemma":[0.0000041956237,0.0000064814494,0.00020070745,0.000027172413,0.000003363112,0.000063084975,0.000044575143,0.003641175,0.00013616325,0.97722197,0.018642927,0.000008142415],"about_ca_topic_score_codex":0.0013943625,"about_ca_topic_score_gemma":0.00096489093,"teacher_disagreement_score":0.0062847245,"about_ca_system_score_codex":0.0014870196,"about_ca_system_score_gemma":0.00042488764,"threshold_uncertainty_score":0.021024466},"labels":[],"label_agreement":null},{"id":"W2810486625","doi":"10.4230/lipics.sea.2018.6","title":"Speeding up Dualization in the Fredman-Khachiyan Algorithm B","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.021613850467479278,"score_gpt":0.2850080168253123,"score_spread":0.263394166357833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810486625","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12069451,0.00041535284,0.8514726,0.0010975223,0.00017143734,0.00026655997,0.0003280295,0.006398929,0.01915507],"genre_scores_gemma":[0.3935285,0.00012475716,0.5985887,0.00044281853,0.00006111531,0.00026735468,0.0005959826,0.0005408202,0.005849881],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798644,0.00052745687,0.00012711594,0.0004048553,0.00048689457,0.0004672481],"domain_scores_gemma":[0.9971169,0.0015052388,0.00017690395,0.00064780837,0.0004238496,0.00012933141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002193714,0.0009048488,0.0010999234,0.0012955002,0.0011157846,0.0022082385,0.0018301064,0.0017763501,0.006504504],"category_scores_gemma":[0.009007293,0.0005346921,0.0011038044,0.0010565716,0.0014498974,0.0031599742,0.0034767154,0.0026281194,0.0020907759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026205725,0.00062816706,0.0051653828,0.00056790694,0.00011881043,0.0003700907,0.0007659183,0.10971848,0.038331367,0.25859407,0.018691279,0.5644279],"study_design_scores_gemma":[0.00038231793,0.00019629937,0.0007821796,0.000080473714,0.000055685872,0.00036062894,0.00018891433,0.7892912,0.027100075,0.17010456,0.011400084,0.00005754933],"about_ca_topic_score_codex":0.0043474566,"about_ca_topic_score_gemma":0.0044027898,"teacher_disagreement_score":0.006504504,"about_ca_system_score_codex":0.001812387,"about_ca_system_score_gemma":0.0032337217,"threshold_uncertainty_score":0.021759748},"labels":[],"label_agreement":null},{"id":"W2810740386","doi":"10.4230/lites-v005-i001-a001","title":"Risk-Aware Scheduling of Dual Criticality Job Systems Using Demand Distributions","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Criticality; Computer science; Exploit; Probabilistic logic; Scheduling (production processes); Job scheduler; Distributed computing; Mathematical optimization; Artificial intelligence; Mathematics; Computer network","score_opus":0.025800413825419095,"score_gpt":0.29354077942873463,"score_spread":0.26774036560331554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810740386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3644508,0.00039793085,0.6286447,0.00083995244,0.000110759844,0.0001990271,0.00029239943,0.0005054952,0.004558966],"genre_scores_gemma":[0.96124715,0.00007926775,0.036946774,0.000077262084,0.000037122332,0.0000798503,0.00014619768,0.00008374348,0.0013025146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988028,0.00034798158,0.00005308705,0.0002555372,0.00024067573,0.00029990193],"domain_scores_gemma":[0.99569786,0.0025012793,0.00064095925,0.0002386057,0.00030981613,0.00061155396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025973925,0.0010421799,0.0012213663,0.00056030415,0.00061938574,0.0015027706,0.0014747011,0.00084481906,0.0019053892],"category_scores_gemma":[0.0069555435,0.001024163,0.00078217697,0.00047193762,0.0010359337,0.0014106418,0.0012860518,0.0014483511,0.00023202022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017386983,0.00004141006,0.00086694234,0.000030072179,0.000024613908,0.00006626541,0.000045615277,0.9862585,0.0013789178,0.007259713,0.00027737432,0.0035766133],"study_design_scores_gemma":[0.000009123782,0.000028606371,0.00013755934,0.000002304494,0.0000036628269,0.000008543327,0.000010225296,0.9951544,0.00023324706,0.0043176957,0.00009059599,0.00000409732],"about_ca_topic_score_codex":0.003892753,"about_ca_topic_score_gemma":0.0029929641,"teacher_disagreement_score":0.003892753,"about_ca_system_score_codex":0.0014289791,"about_ca_system_score_gemma":0.0018457735,"threshold_uncertainty_score":0.013736486},"labels":[],"label_agreement":null},{"id":"W2811181433","doi":"10.4230/lipics.concur.2018.33","title":"Automatic Analysis of Expected Termination Time for Population Protocols","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Grantová Agentura České Republiky; Alexander von Humboldt-Stiftung","keywords":"Computation; Computer science; Protocol (science); Population; Parametric statistics; Upper and lower bounds; Function (biology); Distributed computing; Algorithm; Theoretical computer science; Mathematics","score_opus":0.01829018276171908,"score_gpt":0.3099208662115419,"score_spread":0.29163068344982285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811181433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0827189,0.0001815779,0.9123993,0.0005247146,0.00003793527,0.00011624443,0.00014724847,0.0012223725,0.0026516712],"genre_scores_gemma":[0.8205238,0.00017327964,0.17525263,0.00017116615,0.00009958169,0.00066154235,0.0005080553,0.0006760018,0.0019339095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903976,0.0034550715,0.0005335596,0.0016718855,0.0028130307,0.0011289888],"domain_scores_gemma":[0.859639,0.118165165,0.0066421786,0.0072344677,0.0064101536,0.0019091639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01121398,0.0013825715,0.0015354815,0.0020839504,0.0013551932,0.0033285932,0.0037530402,0.00226814,0.003961354],"category_scores_gemma":[0.0969535,0.0009643643,0.0015430916,0.0011651508,0.004830556,0.00555782,0.003177349,0.0049947905,0.0006222172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007995296,0.00020485779,0.0057246983,0.00030083454,0.00013476683,0.00029796668,0.00091906806,0.7283048,0.015128978,0.21142921,0.0022211066,0.03453425],"study_design_scores_gemma":[0.00003606528,0.000043272517,0.00019603316,0.000013062466,0.000014251537,0.000036513276,0.000021850283,0.9394023,0.0023955689,0.057567943,0.00025891184,0.000014164345],"about_ca_topic_score_codex":0.001143565,"about_ca_topic_score_gemma":0.0007395483,"teacher_disagreement_score":0.01121398,"about_ca_system_score_codex":0.003874973,"about_ca_system_score_gemma":0.0029175817,"threshold_uncertainty_score":0.059305847},"labels":[],"label_agreement":null},{"id":"W2811461449","doi":"10.4230/lipics.fun.2018.27","title":"The complexity of speedrunning video games","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Treewidth; Parameterized complexity; Boosting (machine learning); Bounded function; Computer science; Routing (electronic design automation); Time complexity; Exponential time hypothesis; Knapsack problem; Combinatorics; Theoretical computer science; Discrete mathematics; Mathematics; Mathematical optimization; Artificial intelligence; Pathwidth; Graph; Algorithm","score_opus":0.05888925186306259,"score_gpt":0.3089636948358681,"score_spread":0.2500744429728055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811461449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6872758,0.0018688712,0.2119611,0.016056255,0.00030585667,0.0007276375,0.006907774,0.0028535824,0.07204314],"genre_scores_gemma":[0.9099886,0.0012271004,0.06618581,0.001067762,0.00021285933,0.00046706558,0.004057404,0.00077889266,0.016014438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99697304,0.0008341197,0.0001698862,0.00066672993,0.000561573,0.0007947537],"domain_scores_gemma":[0.9874965,0.009958595,0.0006982255,0.0007689496,0.00039398423,0.0006837901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015888738,0.001617074,0.0019952755,0.00073309033,0.0014484146,0.005302313,0.0031471397,0.0028050428,0.017101051],"category_scores_gemma":[0.016205251,0.0010484423,0.0020020744,0.0013172087,0.0018404908,0.0076430566,0.003120228,0.0040430017,0.0016644836],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019971582,0.0007565076,0.0067500263,0.0013320548,0.00035383325,0.0008047623,0.0010290514,0.6930922,0.008356074,0.16123132,0.0335672,0.09072985],"study_design_scores_gemma":[0.00027116077,0.00012259517,0.0014080273,0.00006885451,0.000106292326,0.0002229778,0.00027768142,0.7496882,0.0016535787,0.2420833,0.004054283,0.000042932676],"about_ca_topic_score_codex":0.011676919,"about_ca_topic_score_gemma":0.007962277,"teacher_disagreement_score":0.017101051,"about_ca_system_score_codex":0.0033893725,"about_ca_system_score_gemma":0.0026566465,"threshold_uncertainty_score":0.057208717},"labels":[],"label_agreement":null},{"id":"W2883173799","doi":"10.4230/lipics.aft.2025.15","title":"A Modular Approach for the Analysis of Blockchain Consensus Protocol Under Churn (Poster)","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Gossip; Computer science; Political science; Law","score_opus":0.031245055841411285,"score_gpt":0.29786935584384455,"score_spread":0.26662430000243326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883173799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016375726,0.00018903652,0.98052365,0.00017956807,0.000040184495,0.000101154634,0.000046514335,0.00017056655,0.0023735901],"genre_scores_gemma":[0.7098916,0.00068175554,0.28276503,0.00022039587,0.0002891344,0.00061608135,0.00024120914,0.000242038,0.0050526517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987482,0.00042806086,0.00006422833,0.00019507337,0.0004294212,0.00013498351],"domain_scores_gemma":[0.997677,0.001007935,0.0003494633,0.00038253577,0.0004075495,0.00017548406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020029396,0.000635494,0.00047308684,0.0015430613,0.0005371289,0.0010701234,0.0010446666,0.0008511576,0.0024469947],"category_scores_gemma":[0.005710979,0.0002859868,0.001133739,0.00075304776,0.0018378313,0.0021038405,0.0027771906,0.0015056016,0.00053232466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013371525,0.00010551823,0.0020472778,0.0002505306,0.00015704952,0.0007472351,0.00073880295,0.27136695,0.031324323,0.6428873,0.0026393626,0.04760198],"study_design_scores_gemma":[0.000011028836,0.00008208939,0.000419416,0.000026608772,0.000034407098,0.00014676659,0.000052368185,0.79475665,0.0030446425,0.1986323,0.0027762644,0.000017472392],"about_ca_topic_score_codex":0.00053463347,"about_ca_topic_score_gemma":0.00027422764,"teacher_disagreement_score":0.0024469947,"about_ca_system_score_codex":0.00074579084,"about_ca_system_score_gemma":0.00078353955,"threshold_uncertainty_score":0.010592699},"labels":[],"label_agreement":null},{"id":"W2883962117","doi":"10.4230/lipics.mfcs.2018.37","title":"Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; University of California, Santa Barbara; National Science Foundation","keywords":"Diagonal; Combinatorics; Mathematics; Intersection (aeronautics); Line segment; Approximation algorithm; Logarithm; Dominating set; Line (geometry); Discrete mathematics; Geometry; Graph; Mathematical analysis","score_opus":0.028714842930334793,"score_gpt":0.3103756508637333,"score_spread":0.28166080793339854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883962117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25854805,0.0030633002,0.71222246,0.0022204223,0.00029008096,0.00035920276,0.004003928,0.002776587,0.01651592],"genre_scores_gemma":[0.5644196,0.0012420652,0.41938812,0.0007143391,0.00021086623,0.00035517683,0.006643983,0.00059208734,0.006433827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749845,0.0007131379,0.0001171732,0.00088721147,0.0004004773,0.0003835229],"domain_scores_gemma":[0.9960211,0.002289543,0.00047520036,0.0005516754,0.00030311418,0.00035940474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001490676,0.00218077,0.0023532833,0.0013346919,0.0011443883,0.0023816605,0.003165705,0.0014457096,0.0048025204],"category_scores_gemma":[0.008745707,0.0009093818,0.0015981004,0.0036243382,0.001004645,0.004752096,0.003011431,0.002085615,0.0010938273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014838481,0.00030530294,0.0033802674,0.0010291503,0.00032922113,0.00058767525,0.001145011,0.7409233,0.009870382,0.107454285,0.018460585,0.1150311],"study_design_scores_gemma":[0.00010927221,0.00021721055,0.0007508991,0.00007314881,0.00008552419,0.00036212496,0.00041174158,0.87576574,0.004349036,0.109526545,0.008312206,0.000036622696],"about_ca_topic_score_codex":0.0048483904,"about_ca_topic_score_gemma":0.004061999,"teacher_disagreement_score":0.0048483904,"about_ca_system_score_codex":0.002758661,"about_ca_system_score_gemma":0.0011409813,"threshold_uncertainty_score":0.020015597},"labels":[],"label_agreement":null},{"id":"W2886070095","doi":"10.4230/lipics.ecoop.2018.18","title":"ThingsMigrate: Platform-Independent Migration of Stateful JavaScript IoT Applications","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Institute for Computing, Information and Cognitive Systems","keywords":"Stateful firewall; Computer science; JavaScript; Cloud computing; Unobtrusive JavaScript; Middleware (distributed applications); Operating system; Programmer; Rich Internet application; Virtual machine; State (computer science); AspectJ; Internet of Things; Distributed computing; Embedded system; Programming language; Software; Computer network","score_opus":0.016150544061017826,"score_gpt":0.25383470341345854,"score_spread":0.23768415935244072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886070095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24987182,0.0009767379,0.42924684,0.00041239985,0.00079072145,0.00079281075,0.0008171126,0.30448404,0.012607487],"genre_scores_gemma":[0.8124716,0.00049212645,0.15707867,0.0006073074,0.00010691342,0.00036855877,0.003186075,0.015365165,0.010323532],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990711,0.00010864708,0.00009223335,0.00022517587,0.00033930806,0.00016358834],"domain_scores_gemma":[0.9983553,0.00027888166,0.00015806044,0.00082617067,0.00020494609,0.00017654286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084439456,0.0012024072,0.00045963263,0.00051219884,0.00046925104,0.0011226712,0.0020118495,0.00085337495,0.0017639945],"category_scores_gemma":[0.0031853074,0.00074052927,0.00060902827,0.00034143546,0.0007169771,0.001541085,0.0022477445,0.0014994321,0.00090701936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003052693,0.0012857772,0.019293651,0.0010208914,0.0005291468,0.0021046614,0.0022483529,0.04897377,0.4448436,0.013879087,0.061670378,0.40109795],"study_design_scores_gemma":[0.00070754474,0.00086206006,0.01624976,0.00016745419,0.00019722235,0.0012054604,0.00030774027,0.5100378,0.35809588,0.0074106827,0.104425415,0.0003330361],"about_ca_topic_score_codex":0.0012098823,"about_ca_topic_score_gemma":0.0011708032,"teacher_disagreement_score":0.0020118495,"about_ca_system_score_codex":0.00041152665,"about_ca_system_score_gemma":0.0008521643,"threshold_uncertainty_score":0.005901158},"labels":[],"label_agreement":null},{"id":"W2886378351","doi":"10.4230/dagrep.8.2.101","title":"Data Consistency in Distributed Systems: Algorithms, Programs, and Databases (Dagstuhl Seminar 18091)","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Consistency (knowledge bases); Database; Distributed database; Algorithm; Artificial intelligence","score_opus":0.06080402614862889,"score_gpt":0.29857990828721304,"score_spread":0.23777588213858414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886378351","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006705528,0.3789871,0.2459865,0.16380727,0.052545544,0.00023472846,0.0012261083,0.003699403,0.14680783],"genre_scores_gemma":[0.16376208,0.2635221,0.18899675,0.025333174,0.07589358,0.0013268128,0.003793567,0.005214699,0.27215725],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560887,0.0015257994,0.0002837567,0.0007632748,0.0014521853,0.00036598762],"domain_scores_gemma":[0.99708563,0.0018102039,0.00011888114,0.00029040192,0.00045644087,0.00023852594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055948757,0.0018580253,0.0019008268,0.00262646,0.0015792736,0.0070142224,0.0018037708,0.0033799922,0.019055855],"category_scores_gemma":[0.0095142005,0.0012979005,0.0013788469,0.0035428621,0.0029278093,0.0084816655,0.004075898,0.007813094,0.011726533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017180403,0.0001479484,0.00022149751,0.00062728184,0.000050973507,0.00013113454,0.000480042,0.003944894,0.0009114472,0.33615032,0.43015146,0.22701126],"study_design_scores_gemma":[0.000076365264,0.00006652559,0.00050555076,0.00060140615,0.000026897509,0.00020017137,0.000101733225,0.005179763,0.0006447604,0.287846,0.70470583,0.00004495164],"about_ca_topic_score_codex":0.0017715482,"about_ca_topic_score_gemma":0.0013226194,"teacher_disagreement_score":0.019055855,"about_ca_system_score_codex":0.0042842682,"about_ca_system_score_gemma":0.002389735,"threshold_uncertainty_score":0.06374812},"labels":[],"label_agreement":null},{"id":"W2886751042","doi":"10.4230/lipics.fscd.2018.19","title":"Index-Stratified Types","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Index (typography); Mathematics; Statistics; Computer science","score_opus":0.03283214050205933,"score_gpt":0.290830328016197,"score_spread":0.25799818751413767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886751042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009693564,0.0005164159,0.96611387,0.0005185301,0.0003586711,0.00012660894,0.0010113976,0.0031904108,0.018470597],"genre_scores_gemma":[0.35626906,0.0012812276,0.61082065,0.00091594906,0.0005258699,0.000535147,0.0015972515,0.0014681923,0.026586577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979797,0.00042880935,0.00023393401,0.00036476177,0.0007990733,0.00019378318],"domain_scores_gemma":[0.9980076,0.0005818856,0.00025385196,0.0006215232,0.00038309104,0.00015205205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024287214,0.00059222657,0.0005929224,0.0014484753,0.00091497676,0.003711514,0.0016761124,0.00063818006,0.007965645],"category_scores_gemma":[0.004570932,0.00065142434,0.0011240115,0.0012451166,0.0027609945,0.007858959,0.0026820262,0.0022226772,0.0026642429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035344445,0.000008183657,0.00015833047,0.0000693693,0.000010435769,0.0000615301,0.00027290918,0.00084238016,0.0014091716,0.9788408,0.0024332716,0.01585821],"study_design_scores_gemma":[0.000028153107,0.000051485935,0.00019426309,0.00009323682,0.00005000355,0.00030515948,0.00014918338,0.012362797,0.009561104,0.7943181,0.18284434,0.000042236104],"about_ca_topic_score_codex":0.0007770527,"about_ca_topic_score_gemma":0.0012655057,"teacher_disagreement_score":0.007965645,"about_ca_system_score_codex":0.0013845236,"about_ca_system_score_gemma":0.0018671474,"threshold_uncertainty_score":0.026647747},"labels":[],"label_agreement":null},{"id":"W2888797620","doi":"10.4230/lipics.wabi.2018.20","title":"PRINCE: Accurate Approximation of the Copy Number of Tandem Repeats","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Genome Canada; Alfred P. Sloan Foundation","keywords":"Tandem repeat; Multiple Loci VNTR Analysis; Variable number tandem repeat; Genome; Biology; Genetics; Computational biology; Minisatellite; Sequence (biology); Computer science; Microsatellite; Gene","score_opus":0.012398138104129285,"score_gpt":0.27078499430584807,"score_spread":0.2583868562017188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888797620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03495491,0.00096332585,0.9473763,0.0002361749,0.00009295999,0.00007073831,0.0028365124,0.012499189,0.00096997205],"genre_scores_gemma":[0.23234831,0.000618602,0.75051826,0.0003743826,0.000105168,0.00030857473,0.010647328,0.001970732,0.0031086714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99849844,0.0004508766,0.00008551675,0.0003799279,0.00048752964,0.00009779938],"domain_scores_gemma":[0.9942478,0.003849661,0.0004384231,0.00081069884,0.00054128247,0.00011215081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026866947,0.001367137,0.0012703097,0.0016388304,0.00042637673,0.0014048142,0.0021158846,0.0016850606,0.0025240064],"category_scores_gemma":[0.0165035,0.00089366327,0.0014379614,0.0014094583,0.00076296064,0.0020929738,0.0013705682,0.001988724,0.002237193],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007385642,0.00019324376,0.027857294,0.00090907776,0.00056524895,0.00035347856,0.000348882,0.6645646,0.032486886,0.010500322,0.017807929,0.24367443],"study_design_scores_gemma":[0.000022468157,0.000048324822,0.0020150875,0.000024916608,0.00001512024,0.00014745627,0.000028601464,0.9823972,0.006188174,0.005840188,0.0032405872,0.000031939053],"about_ca_topic_score_codex":0.0038917677,"about_ca_topic_score_gemma":0.004672905,"teacher_disagreement_score":0.0038917677,"about_ca_system_score_codex":0.00062208436,"about_ca_system_score_gemma":0.0011902269,"threshold_uncertainty_score":0.014208794},"labels":[],"label_agreement":null},{"id":"W2888982113","doi":"10.4230/lipics.giscience.2018.47","title":"OpenPOI: An Open Place of Interest Platform (Short Paper)","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.0560757865532742,"score_gpt":0.309528021035456,"score_spread":0.2534522344821818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888982113","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125210425,0.0025548076,0.7533045,0.00753889,0.011689743,0.0014007778,0.020896193,0.07700555,0.11308849],"genre_scores_gemma":[0.07430143,0.0061899456,0.44741642,0.0026359616,0.0051542437,0.0016790824,0.08004551,0.022291584,0.36028588],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921405,0.00008671746,0.00006703307,0.00015296364,0.00038349215,0.00009570586],"domain_scores_gemma":[0.99762946,0.00036691336,0.000114260576,0.0005891188,0.00057097175,0.00072932977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012544224,0.00093079,0.0006746938,0.0013551003,0.0014862034,0.0053065997,0.002600928,0.0023623158,0.052911654],"category_scores_gemma":[0.0042561707,0.0007605191,0.00072152703,0.0022644093,0.0011010268,0.009804381,0.0068571605,0.0022296475,0.03651535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003317215,0.00015566315,0.0012403645,0.0005730021,0.000026440523,0.00084575266,0.0010099447,0.0019774144,0.009966879,0.076815225,0.58093905,0.3261185],"study_design_scores_gemma":[0.000019438346,0.00004889662,0.00054138165,0.0000614404,0.000007776292,0.00026074753,0.00013423234,0.004525076,0.0022733696,0.007956429,0.984121,0.00005025889],"about_ca_topic_score_codex":0.002836441,"about_ca_topic_score_gemma":0.0036049369,"teacher_disagreement_score":0.052911654,"about_ca_system_score_codex":0.00079619075,"about_ca_system_score_gemma":0.001361994,"threshold_uncertainty_score":0.17700714},"labels":[],"label_agreement":null},{"id":"W2895552009","doi":"10.4230/lipics.icalp.2020.21","title":"Counting Homomorphisms in Plain Exponential Time","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Exponential function; Mathematics; Exponential growth; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.020173281068611455,"score_gpt":0.28427927199375524,"score_spread":0.2641059909251438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895552009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17998198,0.0014395242,0.75533736,0.0116170645,0.0005031077,0.00062655885,0.0036385823,0.01348759,0.033368282],"genre_scores_gemma":[0.52325237,0.00066818896,0.44444042,0.0020278692,0.0005249584,0.00069366314,0.006297714,0.0018870939,0.020207774],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937854,0.0015373304,0.00035833172,0.0021327606,0.0012879997,0.00089811796],"domain_scores_gemma":[0.9720824,0.018470313,0.001220714,0.0065181777,0.0010742984,0.0006341233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036439782,0.0019614645,0.0018364411,0.0013694911,0.0017882285,0.004917543,0.004120492,0.0023386602,0.018414484],"category_scores_gemma":[0.026919378,0.001070411,0.0022432278,0.0029003404,0.002565983,0.022461701,0.0050133276,0.004896218,0.0037799354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00271203,0.0012212308,0.008145581,0.0019763084,0.0004465209,0.0005168576,0.0013846159,0.07195996,0.022077523,0.33626214,0.07324185,0.48005527],"study_design_scores_gemma":[0.00037619728,0.00015260195,0.0011222311,0.00007224813,0.00016299139,0.0006830391,0.00045884785,0.22035153,0.011980184,0.7494271,0.015152133,0.000060849587],"about_ca_topic_score_codex":0.0018892364,"about_ca_topic_score_gemma":0.0035701545,"teacher_disagreement_score":0.018414484,"about_ca_system_score_codex":0.0025734163,"about_ca_system_score_gemma":0.0032770236,"threshold_uncertainty_score":0.061602652},"labels":[],"label_agreement":null},{"id":"W290526480","doi":"10.4230/dagsemproc.06111.10","title":"Incremental branching programs","year":2006,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; McGill University; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Nondeterministic algorithm; Branching (polymer chemistry); Computation; Computer science; Exponential function; Mathematics; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.008540348256302814,"score_gpt":0.21953475216317944,"score_spread":0.21099440390687663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W290526480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034050457,0.00021765895,0.93166333,0.0009364319,0.00007505174,0.00017227339,0.00039801752,0.0012531382,0.031233598],"genre_scores_gemma":[0.53989553,0.00036964114,0.44095108,0.0006628347,0.000155657,0.00073104963,0.0010436623,0.00033638047,0.015854059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821115,0.00051043514,0.00009551138,0.00043766806,0.0005178075,0.00022747912],"domain_scores_gemma":[0.9956754,0.0022829343,0.00028764637,0.0010412532,0.00049822824,0.00021451052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015464424,0.0006334459,0.00046446224,0.00071753317,0.0007625987,0.0017563266,0.0026258957,0.000999196,0.007568963],"category_scores_gemma":[0.00567118,0.0004920653,0.0011798145,0.0007998252,0.0024717636,0.0049453215,0.0025767623,0.002900066,0.000889877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068000576,0.000055181466,0.00047037736,0.000086450105,0.000016434466,0.00016158925,0.00021272374,0.022129614,0.0025264267,0.9510131,0.0017988349,0.021461325],"study_design_scores_gemma":[0.000039614974,0.000056555,0.00018744804,0.000026644748,0.00002962975,0.00020828345,0.00007433405,0.15989634,0.0029599122,0.8192046,0.01729796,0.000018686216],"about_ca_topic_score_codex":0.0014317578,"about_ca_topic_score_gemma":0.001551918,"teacher_disagreement_score":0.007568963,"about_ca_system_score_codex":0.0010330338,"about_ca_system_score_gemma":0.0010608864,"threshold_uncertainty_score":0.02532065},"labels":[],"label_agreement":null},{"id":"W2907125844","doi":"10.4230/lipics.icdt.2019.9","title":"Categorical Range Reporting with Frequencies","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Range (aeronautics); Categorical variable; Computer science; Machine learning; Engineering","score_opus":0.018562575614069335,"score_gpt":0.2422777644464392,"score_spread":0.22371518883236985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907125844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03607315,0.0013299056,0.9507749,0.0020241388,0.00023989755,0.00021565933,0.0017562038,0.0034684043,0.0041176556],"genre_scores_gemma":[0.4186184,0.0011348166,0.5669502,0.0011619828,0.00074979616,0.00060766976,0.0036305073,0.0009013416,0.0062452927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98005486,0.0057835523,0.0019544032,0.0039806813,0.0065037613,0.0017227393],"domain_scores_gemma":[0.93785787,0.030603714,0.0053476826,0.020337159,0.004604643,0.0012489144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008357789,0.0012502337,0.002549121,0.0027602476,0.001701482,0.0062782057,0.0055940906,0.002659234,0.007932506],"category_scores_gemma":[0.059640832,0.00096903066,0.0019178953,0.0076071215,0.0024115532,0.017907422,0.0067006093,0.0041693435,0.0021087695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018361753,0.0004886397,0.01341971,0.0011687509,0.00024273558,0.00047783955,0.0017692115,0.120526016,0.011935541,0.35405326,0.025461376,0.46862084],"study_design_scores_gemma":[0.00024365554,0.00047315008,0.0020810445,0.00019701327,0.00016972919,0.0012115708,0.00092199893,0.44500384,0.014913527,0.4972112,0.037376918,0.00019640096],"about_ca_topic_score_codex":0.003298283,"about_ca_topic_score_gemma":0.0015957078,"teacher_disagreement_score":0.008357789,"about_ca_system_score_codex":0.0022713481,"about_ca_system_score_gemma":0.002165761,"threshold_uncertainty_score":0.044200778},"labels":[],"label_agreement":null},{"id":"W2907584067","doi":"10.4230/lipics.isaac.2018.67","title":"Succinct Data Structures for Chordal Graphs","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Chordal graph; Computer science; Interval graph; Theoretical computer science; Graph; 1-planar graph","score_opus":0.04590123781032047,"score_gpt":0.34013356367956615,"score_spread":0.2942323258692457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907584067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10425997,0.0019488015,0.8716367,0.0025433907,0.00030971575,0.00043009844,0.0067672534,0.0074212286,0.00468277],"genre_scores_gemma":[0.5503799,0.0011352969,0.43290827,0.00084903126,0.00022436517,0.0006574321,0.008722457,0.0005276825,0.004595509],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972059,0.00048167506,0.00047293512,0.00050352496,0.0010505723,0.00028535965],"domain_scores_gemma":[0.9863418,0.004802834,0.0012534785,0.006023081,0.0012381676,0.00034068935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018881012,0.00093744585,0.0013871851,0.0013487515,0.0011719838,0.003026527,0.0037809988,0.001399311,0.0063995533],"category_scores_gemma":[0.013858069,0.000727559,0.00085220806,0.0038736756,0.0015802521,0.013086024,0.0034156118,0.0022236651,0.00137629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032287259,0.000622884,0.006442609,0.001963784,0.0001661939,0.00038498853,0.0012706652,0.17588241,0.030468712,0.3627348,0.04191531,0.37491888],"study_design_scores_gemma":[0.00035029376,0.000599869,0.0007697047,0.00023575501,0.00010728976,0.00051502936,0.00057907274,0.4291629,0.040376708,0.49561605,0.03155696,0.0001303844],"about_ca_topic_score_codex":0.0017346068,"about_ca_topic_score_gemma":0.0027637503,"teacher_disagreement_score":0.0063995533,"about_ca_system_score_codex":0.0025814665,"about_ca_system_score_gemma":0.0018375848,"threshold_uncertainty_score":0.021408617},"labels":[],"label_agreement":null},{"id":"W2914939413","doi":"10.4230/lipics.icalp.2019.91","title":"Toward a Dichotomy for Approximation of $H$-coloring","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Digraph; Combinatorics; Homomorphism; Mathematics; Approximation algorithm; Discrete mathematics; Time complexity; Arc (geometry); Graph","score_opus":0.04762587225070952,"score_gpt":0.31523348949259755,"score_spread":0.26760761724188803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914939413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22711001,0.0027121857,0.73648685,0.008629536,0.00025211214,0.00024287251,0.0015779891,0.005366652,0.01762188],"genre_scores_gemma":[0.6461525,0.00090853224,0.34011698,0.0022706843,0.00027663822,0.0003274792,0.002544261,0.0007793955,0.0066235983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966929,0.0007852742,0.00016276109,0.0010281982,0.0007545588,0.0005762625],"domain_scores_gemma":[0.9900142,0.006313934,0.00066867867,0.0021017676,0.00043919813,0.00046230745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034152807,0.0015789474,0.0018638072,0.0014281492,0.0010784453,0.004088196,0.003724358,0.0023979954,0.0059301644],"category_scores_gemma":[0.016638476,0.001068235,0.0018200566,0.0020719583,0.002121532,0.008456288,0.004307469,0.006622008,0.0013262565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043559936,0.0013810608,0.013671421,0.0010533489,0.00023393014,0.0002867352,0.0014590117,0.43337575,0.012421144,0.2405313,0.040378023,0.25085226],"study_design_scores_gemma":[0.00011239064,0.00012870532,0.00061708246,0.000070659466,0.00003630432,0.00010514605,0.00016160529,0.8590828,0.0022534835,0.13387467,0.003536761,0.000020362275],"about_ca_topic_score_codex":0.006086325,"about_ca_topic_score_gemma":0.006654669,"teacher_disagreement_score":0.0061671995,"about_ca_system_score_codex":0.0061671995,"about_ca_system_score_gemma":0.0034065149,"threshold_uncertainty_score":0.0447464},"labels":[],"label_agreement":null},{"id":"W2916420924","doi":"10.4230/lipics.icalp.2019.78","title":"Towards Optimal Depth Reductions for Syntactically Multilinear Circuits","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Department of Science and Technology, Ministry of Science and Technology, India; Tata Institute of Fundamental Research","keywords":"Exponent; Multilinear map; Combinatorics; Upper and lower bounds; Omega; Mathematics; Degree (music); Polynomial; Discrete mathematics; Mathematical analysis; Physics; Pure mathematics; Quantum mechanics","score_opus":0.043345682677481366,"score_gpt":0.3074808794513182,"score_spread":0.26413519677383684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916420924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20105426,0.0013678718,0.74852157,0.0031452666,0.0001997571,0.00030864307,0.0009857904,0.0062363762,0.038180362],"genre_scores_gemma":[0.71289235,0.0007296508,0.27145496,0.001465113,0.00023682916,0.00050092814,0.0012308061,0.001390099,0.010099167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956909,0.00085480924,0.00019965014,0.0008176659,0.0015033988,0.0009335731],"domain_scores_gemma":[0.99193454,0.0051495936,0.00044070103,0.0017372594,0.0005067163,0.00023123244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018721535,0.0014395323,0.0014264196,0.0010698808,0.0012647869,0.0026681025,0.0028512026,0.0014735521,0.009573776],"category_scores_gemma":[0.0117301745,0.000926421,0.0025271813,0.0014382785,0.002470506,0.0072576744,0.006614929,0.005431284,0.002130127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015049527,0.0004417619,0.0021266155,0.0014590954,0.00016365788,0.00040373817,0.0010855647,0.0961401,0.05785173,0.62394804,0.018001905,0.19687286],"study_design_scores_gemma":[0.00026795693,0.00020058063,0.000611294,0.00011678774,0.00018217463,0.00021751426,0.00017537968,0.27821976,0.027803177,0.6785534,0.013580083,0.00007189322],"about_ca_topic_score_codex":0.0017814466,"about_ca_topic_score_gemma":0.0038356725,"teacher_disagreement_score":0.009573776,"about_ca_system_score_codex":0.0037338396,"about_ca_system_score_gemma":0.0026582894,"threshold_uncertainty_score":0.032027483},"labels":[],"label_agreement":null},{"id":"W2916806630","doi":"10.4230/lipics.icalp.2019.58","title":"Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; National Science Foundation","keywords":"Boolean function; Conjecture; Mathematics; Product (mathematics); Generalization; Combinatorics; Discrete mathematics; Measure (data warehouse); Product measure; Argument (complex analysis); Function (biology); Computer science","score_opus":0.028998688564719703,"score_gpt":0.2460417792424528,"score_spread":0.21704309067773309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916806630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21624422,0.0009084873,0.7628816,0.0020836575,0.00010839361,0.00017412176,0.00020404202,0.0007378846,0.016657569],"genre_scores_gemma":[0.9164449,0.0004553963,0.07787139,0.0005052396,0.00010261266,0.00037952082,0.00013360541,0.00015270822,0.003954638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99255484,0.003436972,0.0003109296,0.0013718616,0.0015597149,0.00076563226],"domain_scores_gemma":[0.9678927,0.019800775,0.0028611452,0.0068489127,0.0015687817,0.001027701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009075774,0.0010838397,0.0014681512,0.0011139377,0.0013865636,0.0027319256,0.0022661854,0.0020836648,0.0025962896],"category_scores_gemma":[0.041672196,0.001077923,0.0013531755,0.0012842317,0.005283035,0.00814123,0.0054663573,0.0035244785,0.0008330918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005969944,0.00010034087,0.0018986219,0.00016012878,0.00013586831,0.00020378185,0.0005597944,0.071690015,0.008223471,0.8896928,0.0012499138,0.025488323],"study_design_scores_gemma":[0.00014482,0.00013760116,0.0005196838,0.000050605388,0.000056757777,0.00016532798,0.000056766712,0.21415047,0.006175461,0.7756849,0.00280417,0.00005342186],"about_ca_topic_score_codex":0.0008957753,"about_ca_topic_score_gemma":0.00063132495,"teacher_disagreement_score":0.009075774,"about_ca_system_score_codex":0.0025839552,"about_ca_system_score_gemma":0.0014718104,"threshold_uncertainty_score":0.047997892},"labels":[],"label_agreement":null},{"id":"W2917055100","doi":"10.4230/dagsemproc.10061.1","title":"10061 Abstracts Collection – Circuits, Logic, and Games","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Informatics; Section (typography); Work (physics); Research center; Center (category theory); Electronic circuit; Mathematics education; Electrical engineering; Engineering; Psychology; Political science","score_opus":0.012914686516707862,"score_gpt":0.2445793892799274,"score_spread":0.23166470276321954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917055100","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022737654,0.15343429,0.015299682,0.019041944,0.06666502,0.0003313549,0.02130546,0.0020359715,0.71961254],"genre_scores_gemma":[0.018024577,0.085691005,0.0074736583,0.003322174,0.058833793,0.00068347575,0.039271552,0.002184142,0.7845156],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984434,0.0001795613,0.00013770502,0.0003197835,0.0008105006,0.000109004206],"domain_scores_gemma":[0.99730754,0.0005513067,0.00014833981,0.0003058494,0.0010338682,0.0006530302],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001817167,0.003205613,0.0024498794,0.008450292,0.0015387359,0.006643287,0.0021484934,0.0014306545,0.35474595],"category_scores_gemma":[0.0033621932,0.0006714506,0.0017847337,0.008860792,0.0012330278,0.0036391942,0.002462713,0.0035592539,0.12530601],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004574841,0.000028595088,0.00008788223,0.00048873987,0.000031315176,0.000046857247,0.00003774962,0.00025746014,0.00040552532,0.015224658,0.9403694,0.04297599],"study_design_scores_gemma":[0.000017206701,0.000029518398,0.00071738637,0.00022386096,0.000022675362,0.000094502844,0.000033393808,0.00024338097,0.00018664959,0.010771998,0.9876481,0.000011294788],"about_ca_topic_score_codex":0.0040196194,"about_ca_topic_score_gemma":0.0051069628,"teacher_disagreement_score":0.645254,"about_ca_system_score_codex":0.0060844105,"about_ca_system_score_gemma":0.0024233656,"threshold_uncertainty_score":0.9203766},"labels":[],"label_agreement":null},{"id":"W2917061129","doi":"10.4230/lipics.ccc.2019.20","title":"Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Quantum entanglement; Quantum information science; Bipartite graph; LOCC; Communication complexity; Mathematics; Discrete mathematics; Quantum mechanics; Bounded function; Physics; Quantum","score_opus":0.03117126209909912,"score_gpt":0.27037406651477297,"score_spread":0.23920280441567385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917061129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26139295,0.0040820306,0.6678496,0.013091328,0.0003279943,0.00025930168,0.00077109574,0.0006286011,0.0515971],"genre_scores_gemma":[0.9062666,0.0017289455,0.08119822,0.00084810087,0.0005317123,0.00062753755,0.00032660444,0.00034892015,0.008123255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99378526,0.0021826648,0.00024815396,0.0015091017,0.0013903213,0.000884484],"domain_scores_gemma":[0.9345901,0.05319877,0.002439469,0.007335275,0.0013617099,0.0010746702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042330325,0.0015192702,0.0014707596,0.0015113875,0.0014955101,0.003590263,0.0036019462,0.002779451,0.0073105944],"category_scores_gemma":[0.03998371,0.0007861632,0.0023661477,0.00209545,0.008705634,0.01704204,0.005931741,0.007884002,0.000814341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046872773,0.00021207052,0.0018945005,0.00035660283,0.00008667408,0.0002276313,0.0003958303,0.11579293,0.005556942,0.84540105,0.0033624035,0.026244568],"study_design_scores_gemma":[0.000047681897,0.00011844024,0.0009944278,0.00008101447,0.000058541824,0.0002130713,0.0000954216,0.3260809,0.003990373,0.66567147,0.0025950542,0.00005365787],"about_ca_topic_score_codex":0.0010360349,"about_ca_topic_score_gemma":0.0007339015,"teacher_disagreement_score":0.0073105944,"about_ca_system_score_codex":0.004622174,"about_ca_system_score_gemma":0.0017830178,"threshold_uncertainty_score":0.033536375},"labels":[],"label_agreement":null},{"id":"W2932277743","doi":"10.4230/lipics.stacs.2019.40","title":"A Characterization of Subshifts with Computable Language","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Characterization (materials science); Computer science; Theoretical computer science","score_opus":0.00934227030477084,"score_gpt":0.23227065996252594,"score_spread":0.2229283896577551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932277743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7846301,0.0007052853,0.19800474,0.00039400614,0.00011344342,0.00006293577,0.00048767612,0.00058750296,0.015014135],"genre_scores_gemma":[0.9701255,0.00014693185,0.025107088,0.00008763817,0.0000601043,0.000066674394,0.00034783824,0.0000961738,0.003962054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992818,0.000091629474,0.000063249936,0.00028540552,0.00014929946,0.00012868638],"domain_scores_gemma":[0.99800915,0.0009166389,0.00029498938,0.00028405423,0.00026938558,0.00022595392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045954372,0.00040276005,0.000428115,0.0012806864,0.00082056643,0.0018494759,0.0007311305,0.0006309141,0.0031927228],"category_scores_gemma":[0.0021088647,0.00031341318,0.0007020051,0.00083242526,0.0029565305,0.0020549812,0.0011438221,0.0008470656,0.00038609136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016334234,0.000051823547,0.002606892,0.0001437196,0.00002422924,0.0005618608,0.0013957594,0.0040777135,0.03807459,0.93959624,0.0006941327,0.01260966],"study_design_scores_gemma":[0.00006726778,0.0002011745,0.003170319,0.00007202731,0.0000697704,0.0012121435,0.0013998145,0.035132978,0.038473174,0.9005014,0.019613666,0.00008622728],"about_ca_topic_score_codex":0.0012072283,"about_ca_topic_score_gemma":0.0007951486,"teacher_disagreement_score":0.0031927228,"about_ca_system_score_codex":0.0011474136,"about_ca_system_score_gemma":0.0005169755,"threshold_uncertainty_score":0.010680735},"labels":[],"label_agreement":null},{"id":"W2938806477","doi":"10.4230/lipics.icalp.2019.137","title":"Energy Consumption of Group Search on a Line","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université de Sherbrooke; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Bounded function; Line (geometry); Energy (signal processing); Computer science; Energy consumption; Constant (computer programming); Algorithm; Mathematics; Artificial intelligence; Engineering; Geometry; Electrical engineering","score_opus":0.050881177732604296,"score_gpt":0.30483765629693776,"score_spread":0.25395647856433345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938806477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8144142,0.00076909654,0.16744779,0.00063106697,0.000055519045,0.00009835783,0.00027043876,0.00027746658,0.016036006],"genre_scores_gemma":[0.9842881,0.00011732766,0.013189794,0.000034045417,0.000006470887,0.000061879065,0.00009943624,0.000028911556,0.002174027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995442,0.00013697828,0.000014671348,0.00007818293,0.00008998525,0.00013597804],"domain_scores_gemma":[0.9990466,0.00060162623,0.00010555435,0.000091521804,0.0000818011,0.00007281906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154192,0.0005487436,0.00074316974,0.00044231015,0.0005375581,0.0009437447,0.0011680205,0.001167604,0.004073307],"category_scores_gemma":[0.002368579,0.00027061612,0.00041636708,0.000790009,0.0006599007,0.0015626872,0.0008636918,0.00041760452,0.00038736864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005712793,0.0000903068,0.00097132573,0.000070527334,0.00003857049,0.00013847378,0.00006607534,0.9754136,0.0033705838,0.0050070714,0.0006933938,0.013568686],"study_design_scores_gemma":[0.000027422617,0.0001696646,0.000432316,0.000004918049,0.000010205235,0.000042144344,0.000071355855,0.9945147,0.0008136041,0.003586672,0.0003199006,0.0000070674228],"about_ca_topic_score_codex":0.0024010374,"about_ca_topic_score_gemma":0.0014004336,"teacher_disagreement_score":0.004073307,"about_ca_system_score_codex":0.0009943628,"about_ca_system_score_gemma":0.00042714828,"threshold_uncertainty_score":0.013626516},"labels":[],"label_agreement":null},{"id":"W2940319467","doi":"10.4230/lipics.opodis.2017.31","title":"Shape formation by programmable particles","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Grid; Node (physics); Isosceles triangle; Constructive; Hexagonal tiling; Constant (computer programming); Characterization (materials science); Topology (electrical circuits); Distributed computing; Geometry; Process (computing); Physics; Mathematics; Combinatorics; Optics","score_opus":0.014285508763020888,"score_gpt":0.2336301135995201,"score_spread":0.2193446048364992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940319467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090729065,0.00014723628,0.8976151,0.00017298119,0.0000600834,0.00012531319,0.000091966394,0.00050306635,0.010555228],"genre_scores_gemma":[0.7580344,0.00029103376,0.22877245,0.00012890022,0.000039114817,0.0002724661,0.00030899225,0.00019150772,0.011961113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994097,0.00009974157,0.000035141908,0.00021562903,0.00014666024,0.00009310529],"domain_scores_gemma":[0.9986953,0.000518417,0.00017694065,0.00035347135,0.00012512127,0.00013073228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005482482,0.00045225507,0.00051854266,0.00046304674,0.0008319309,0.0013362856,0.0012698247,0.00082777423,0.004051224],"category_scores_gemma":[0.0030392811,0.00047108546,0.0010306294,0.00035941598,0.0025701174,0.0015499486,0.0025884975,0.00094934506,0.0005863316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020895104,0.000052295352,0.0013600037,0.00014330055,0.000037927977,0.00029294039,0.00037773556,0.4842826,0.022858495,0.42769784,0.0016879876,0.06099991],"study_design_scores_gemma":[0.00005690624,0.00013164252,0.00032178886,0.000028082595,0.000014798037,0.00016537594,0.00009641566,0.82430017,0.016216801,0.15052408,0.008110821,0.000033172073],"about_ca_topic_score_codex":0.0012420552,"about_ca_topic_score_gemma":0.00094284053,"teacher_disagreement_score":0.004051224,"about_ca_system_score_codex":0.00066183216,"about_ca_system_score_gemma":0.0006517687,"threshold_uncertainty_score":0.013552725},"labels":[],"label_agreement":null},{"id":"W2940471369","doi":"10.4230/dagrep.8.10.127","title":"Data Physicalization (Dagstuhl Seminar 18441)","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Sports Science and Education","field":"Arts and Humanities","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Bauhaus-Universität Weimar; Monash University; University of Lethbridge; Julius-Maximilians-Universität Würzburg; Microsoft Research; Carnegie Mellon University; University of Minnesota","keywords":"Environmental science; Computer science","score_opus":0.054221553302701245,"score_gpt":0.28094446613120916,"score_spread":0.22672291282850793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940471369","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016592536,0.09971229,0.0481263,0.10179475,0.08477636,0.0007808913,0.011349215,0.005040958,0.6318267],"genre_scores_gemma":[0.06516029,0.016367743,0.01377837,0.005194655,0.01085989,0.0005555474,0.004436297,0.003030692,0.8806165],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997529,0.00061555416,0.00012615454,0.0005185879,0.00078522647,0.00042552722],"domain_scores_gemma":[0.998889,0.00024520516,0.000045155328,0.0001447391,0.00023911554,0.00043682964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036506373,0.0020009351,0.0010253892,0.0022232917,0.002125675,0.0066045034,0.0016101626,0.0037447158,0.20434211],"category_scores_gemma":[0.0047818213,0.0006974124,0.0014019769,0.0014737892,0.0016050036,0.0045757364,0.006283637,0.003665843,0.09847133],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003389884,0.00013396585,0.0001337926,0.0003507513,0.00002334899,0.00024983234,0.00038866175,0.00064807606,0.0022589047,0.05001867,0.82643545,0.11901957],"study_design_scores_gemma":[0.000049117232,0.00006784017,0.0005435201,0.0002443065,0.000010177875,0.0001425775,0.00008221056,0.0003790116,0.0012000225,0.015951227,0.9813116,0.000018388284],"about_ca_topic_score_codex":0.0017732101,"about_ca_topic_score_gemma":0.0029588016,"teacher_disagreement_score":0.20434211,"about_ca_system_score_codex":0.003385009,"about_ca_system_score_gemma":0.0021039585,"threshold_uncertainty_score":0.68359244},"labels":[],"label_agreement":null},{"id":"W2940923581","doi":"10.4230/lipics.mfcs.2017.24","title":"Better Complexity Bounds for Cost Register Automata","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Register (sociolinguistics); Automaton; Register allocation; Theoretical computer science; Parallel computing; Programming language","score_opus":0.06230586614724938,"score_gpt":0.3169479117971421,"score_spread":0.25464204564989273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940923581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29246008,0.0063494802,0.5399512,0.021266544,0.0008643462,0.00026997118,0.002578541,0.0030805916,0.13317923],"genre_scores_gemma":[0.9083363,0.0017931579,0.06814167,0.0015369188,0.000949505,0.0003151969,0.0013985472,0.0008223768,0.01670643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993997,0.0011425486,0.00033341892,0.0016025245,0.0019753259,0.0009492475],"domain_scores_gemma":[0.96444297,0.025914162,0.0012181442,0.0057472233,0.0016505101,0.0010270382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036329855,0.0011074587,0.0014234607,0.0021009583,0.0014905491,0.0068127075,0.0028684048,0.0019528964,0.016501527],"category_scores_gemma":[0.023779174,0.0006802736,0.0025803777,0.0021192762,0.0038351677,0.020256951,0.0046267654,0.008500534,0.0019513525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002607069,0.00011227877,0.0012072902,0.0002552551,0.000037577916,0.00008596898,0.00036977074,0.024124492,0.003110139,0.9464548,0.0057006003,0.01828105],"study_design_scores_gemma":[0.00003106572,0.000055519078,0.00042776743,0.000044616234,0.000037883943,0.0000707878,0.000090952904,0.1004801,0.0022353928,0.8901053,0.006387843,0.000032823238],"about_ca_topic_score_codex":0.0024247942,"about_ca_topic_score_gemma":0.002553266,"teacher_disagreement_score":0.016501527,"about_ca_system_score_codex":0.005898189,"about_ca_system_score_gemma":0.0020925286,"threshold_uncertainty_score":0.05520308},"labels":[],"label_agreement":null},{"id":"W2942961654","doi":"10.4230/lipics.icalp.2019.35","title":"Query-To-Communication Lifting for BPP Using Inner Product","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation","keywords":"Gadget; Mathematical proof; Computer science; Mathematics; Search engine indexing; Entropy (arrow of time); Product (mathematics); Theoretical computer science; Discrete mathematics; Combinatorics; Information retrieval","score_opus":0.02559971745356479,"score_gpt":0.2813312082238702,"score_spread":0.25573149077030544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942961654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017811866,0.00028827766,0.96769744,0.0015385016,0.00027633118,0.00030265254,0.00033365548,0.0012098904,0.010541512],"genre_scores_gemma":[0.543629,0.0010855747,0.4322964,0.0024492561,0.0012357134,0.0014782066,0.0009967685,0.0016043533,0.015224779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878578,0.0022961851,0.0009331256,0.0024201083,0.004504409,0.001988306],"domain_scores_gemma":[0.9677614,0.017328752,0.0015183487,0.009875142,0.002372963,0.0011434709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075573204,0.0018865858,0.0030466528,0.0016610285,0.002857902,0.0063722446,0.0037368345,0.0026926424,0.013171133],"category_scores_gemma":[0.031027082,0.0015478639,0.005096957,0.0024675287,0.0056248214,0.01685411,0.015385548,0.012041213,0.0037431724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030820226,0.0002042522,0.0004913911,0.00034807896,0.00006722527,0.00026853412,0.00069309806,0.017856894,0.008276937,0.9311845,0.005530871,0.034769993],"study_design_scores_gemma":[0.000072559895,0.00014655727,0.00021632612,0.000065137676,0.00008072701,0.00024459814,0.0000878717,0.115422964,0.005809336,0.87181073,0.0059668957,0.00007636355],"about_ca_topic_score_codex":0.0013272656,"about_ca_topic_score_gemma":0.00079365494,"teacher_disagreement_score":0.013171133,"about_ca_system_score_codex":0.0031164126,"about_ca_system_score_gemma":0.004308831,"threshold_uncertainty_score":0.04406184},"labels":[],"label_agreement":null},{"id":"W2946703759","doi":"10.4230/lipics.mfcs.2019.59","title":"Counting Homomorphisms Modulo a Prime Number","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Combinatorics; Modulo; Mathematics; Discrete mathematics; Graph homomorphism; Graph; Prime (order theory); Prime number; Graph power; Line graph","score_opus":0.022752544219782747,"score_gpt":0.29763978576484207,"score_spread":0.27488724154505934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946703759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5181272,0.0029808395,0.4295257,0.012709091,0.0006189241,0.00046708086,0.002907073,0.0020077433,0.030656284],"genre_scores_gemma":[0.8160205,0.0016653141,0.16483358,0.0013548834,0.0014024943,0.00046523358,0.003337969,0.0004181679,0.010501869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934198,0.001708265,0.0004386351,0.0023715273,0.0014010177,0.00066080067],"domain_scores_gemma":[0.9658965,0.025096778,0.0023814314,0.00397813,0.0011936291,0.0014535838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033514504,0.0013041178,0.0020111823,0.0027231341,0.0022642058,0.0054092314,0.0030998222,0.002538048,0.007826264],"category_scores_gemma":[0.026618574,0.0010558229,0.0018816441,0.0035420472,0.0050464817,0.02248602,0.004455233,0.004883042,0.0009775953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093636144,0.00042514724,0.011347638,0.0011034245,0.00024147144,0.000726058,0.0015917141,0.059566997,0.008043926,0.74880964,0.020873647,0.14633395],"study_design_scores_gemma":[0.000059822356,0.000059241338,0.0007835108,0.000039989547,0.00005647492,0.00039199664,0.00019319128,0.061373208,0.002874005,0.929519,0.004608395,0.000041071296],"about_ca_topic_score_codex":0.0011713353,"about_ca_topic_score_gemma":0.0008971654,"teacher_disagreement_score":0.007826264,"about_ca_system_score_codex":0.0028045266,"about_ca_system_score_gemma":0.0019718073,"threshold_uncertainty_score":0.02618146},"labels":[],"label_agreement":null},{"id":"W2946907515","doi":"10.4230/lipics.itcs.2020.26","title":"On Local Testability in the Non-Signaling Setting","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Experimental Learning in Engineering","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Interchain Stiftung; Ethereum Foundation; Achievement Rewards for College Scientists Foundation; National Science Foundation","keywords":"Testability; Computer science; Reliability engineering; Engineering","score_opus":0.008621963358760525,"score_gpt":0.218389583665734,"score_spread":0.20976762030697346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946907515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13763003,0.0003741286,0.84311116,0.0034388592,0.000065278495,0.0001912644,0.0006290156,0.0007198507,0.0138404295],"genre_scores_gemma":[0.899359,0.00035968656,0.09400592,0.0010877568,0.00025529394,0.0004140352,0.0008456485,0.00020984873,0.0034628594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9843732,0.0054027922,0.0010868872,0.004019775,0.0035941496,0.0015231975],"domain_scores_gemma":[0.87599784,0.10360257,0.0045988183,0.0074690483,0.005973173,0.002358512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01049068,0.0011667307,0.0019238273,0.0029409062,0.0023304527,0.00473859,0.0032954798,0.0025957476,0.004861176],"category_scores_gemma":[0.05610778,0.00087977684,0.0030355758,0.0017925448,0.014939751,0.014287346,0.006931161,0.0066909525,0.00067612244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109850094,0.00007893635,0.0016687361,0.00019113724,0.0000593855,0.00029931572,0.0006233925,0.016186722,0.0023803764,0.96779263,0.00076332287,0.009846257],"study_design_scores_gemma":[0.00003618507,0.00005600484,0.00032744344,0.000030314224,0.000031685704,0.00012469174,0.00009452589,0.04602274,0.0024330898,0.9502193,0.00058998,0.000034113804],"about_ca_topic_score_codex":0.002131573,"about_ca_topic_score_gemma":0.0017201115,"teacher_disagreement_score":0.01049068,"about_ca_system_score_codex":0.0036068216,"about_ca_system_score_gemma":0.0026722471,"threshold_uncertainty_score":0.05548072},"labels":[],"label_agreement":null},{"id":"W2947194824","doi":"10.4230/oasics.ldk.2019.13","title":"A Proposal for a Two-Way Journey on Validating Locations in Unstructured and Structured Data","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Unstructured data; Data science; Database; Data mining; Big data","score_opus":0.027119531376479898,"score_gpt":0.2921384102888953,"score_spread":0.26501887891241543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947194824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013050775,0.0002638015,0.9720622,0.020226868,0.0005703778,0.00053966703,0.00026131535,0.0013030565,0.0034676339],"genre_scores_gemma":[0.010595142,0.0001935367,0.98289204,0.0024549484,0.000239739,0.0006473262,0.00056908827,0.00032324373,0.0020849344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.91142905,0.049353518,0.006848261,0.0126541965,0.01756506,0.0021498925],"domain_scores_gemma":[0.80696625,0.10475709,0.0053046434,0.050043993,0.025955487,0.0069725164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0985364,0.0020444714,0.002718669,0.010420369,0.008051131,0.027820839,0.013924342,0.018775227,0.020120787],"category_scores_gemma":[0.18764819,0.0034454144,0.008010269,0.012167574,0.038863327,0.08061048,0.033252243,0.02049734,0.009234827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010393624,0.0002203228,0.0011069877,0.0006174841,0.00011367202,0.00056354946,0.0038556263,0.002812421,0.0019546465,0.9263434,0.016008882,0.046299115],"study_design_scores_gemma":[0.00012268346,0.00016100633,0.00043795726,0.0008225019,0.000074441086,0.0009695758,0.002362868,0.029744394,0.0025644838,0.81693876,0.1455915,0.00020989132],"about_ca_topic_score_codex":0.0066352016,"about_ca_topic_score_gemma":0.0052717556,"teacher_disagreement_score":0.0985364,"about_ca_system_score_codex":0.0048582517,"about_ca_system_score_gemma":0.016512379,"threshold_uncertainty_score":0.5211165},"labels":[],"label_agreement":null},{"id":"W2947533077","doi":"10.4230/lipics.opodis.2019.28","title":"Optimal Register Construction in M&M Systems","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Register (sociolinguistics); Computer science; Philosophy; Linguistics","score_opus":0.02723560032673622,"score_gpt":0.2527163328723498,"score_spread":0.22548073254561357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947533077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113792755,0.0010200145,0.8748473,0.00058513146,0.00006772729,0.00011465877,0.0000936046,0.0011948936,0.0082838815],"genre_scores_gemma":[0.7656037,0.0003909032,0.2291725,0.00016832174,0.000053614476,0.00021235859,0.0001580264,0.00020286409,0.0040377863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776995,0.0007242106,0.00019493343,0.0004933693,0.00046306863,0.00035452226],"domain_scores_gemma":[0.99739945,0.0010608825,0.00028503366,0.0009623428,0.00020037855,0.00009195695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014467384,0.00053236785,0.0010914312,0.00070832716,0.0010866388,0.0018576275,0.001591038,0.0015182847,0.003243046],"category_scores_gemma":[0.0063767447,0.0007037038,0.00085007393,0.0009404258,0.0017709454,0.003193544,0.002989544,0.001219087,0.0008590934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006023895,0.00012802778,0.0020108346,0.00050176104,0.000051866464,0.00028231798,0.00041117633,0.2366071,0.015494815,0.6048563,0.0043705213,0.13468291],"study_design_scores_gemma":[0.00016764847,0.00027650764,0.00036786852,0.00008573955,0.0000617606,0.0002008243,0.00014714131,0.56775016,0.019907096,0.40050554,0.010483238,0.000046604317],"about_ca_topic_score_codex":0.0010261906,"about_ca_topic_score_gemma":0.001021674,"teacher_disagreement_score":0.003243046,"about_ca_system_score_codex":0.0013227666,"about_ca_system_score_gemma":0.0015425289,"threshold_uncertainty_score":0.010849118},"labels":[],"label_agreement":null},{"id":"W2947823345","doi":"10.4230/oasics.ldk.2019.22","title":"Opening Digitized Newspapers Corpora: Europeana’s Full-Text Data Interoperability Case","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Digital Humanities and Scholarship","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canarie","funders":"","keywords":"Newspaper; Interoperability; Metadata; Computer science; Cultural heritage; World Wide Web; Digitization; Digital library; Publishing; Political science; Linguistics; Media studies; Sociology","score_opus":0.08152154047678656,"score_gpt":0.2635114314603703,"score_spread":0.18198989098358376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947823345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.595886,0.0022297336,0.12951013,0.021887591,0.00042922157,0.0013795042,0.014747334,0.001662748,0.23226783],"genre_scores_gemma":[0.8050153,0.0011218095,0.14934926,0.002407999,0.00020148106,0.00094842433,0.020409865,0.0009032399,0.01964262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9862489,0.0058558015,0.0016113825,0.0021612812,0.0033107547,0.0008118377],"domain_scores_gemma":[0.958781,0.023491539,0.0012921157,0.010958041,0.004476201,0.0010011331],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.016951386,0.00038892162,0.0007213091,0.0042565144,0.005533787,0.011979037,0.0026811655,0.0043770554,0.005082173],"category_scores_gemma":[0.04346655,0.0007906586,0.0010663439,0.013866446,0.0056809057,0.019897114,0.008771506,0.003017423,0.0012818609],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095965917,0.0005787218,0.02564336,0.00080653274,0.00015782028,0.010658118,0.037282184,0.0124461055,0.005948505,0.7430713,0.03803319,0.1244145],"study_design_scores_gemma":[0.00032510282,0.00015826471,0.02552249,0.00091449916,0.00016952597,0.0065190876,0.030230667,0.04678189,0.017988551,0.1769612,0.69416386,0.00026483304],"about_ca_topic_score_codex":0.029099237,"about_ca_topic_score_gemma":0.02399805,"teacher_disagreement_score":0.98802096,"about_ca_system_score_codex":0.0037780276,"about_ca_system_score_gemma":0.002777464,"threshold_uncertainty_score":0.089648545},"labels":[],"label_agreement":null},{"id":"W2953086575","doi":"10.4230/lipics.tqc.2014.48","title":"Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Foundation Singapore; National Research Foundation; Ministry of Education, India; European Commission; Leverhulme Trust; British Heart Foundation; National Science Foundation","keywords":"Quantum entanglement; Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Bounded function; Discrete mathematics; Integer (computer science); Quantum; Physics; Quantum mechanics; Computer science","score_opus":0.020022688094083026,"score_gpt":0.251291030914784,"score_spread":0.23126834282070097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953086575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42485657,0.004453006,0.44889766,0.003828907,0.0003471176,0.00010693785,0.00041477953,0.0005042631,0.11659081],"genre_scores_gemma":[0.97224987,0.0015803135,0.019966174,0.00022051942,0.00024162936,0.00018324573,0.00018721666,0.0001253694,0.0052457415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851364,0.0003994404,0.00005275674,0.00020532704,0.00050148665,0.00032741774],"domain_scores_gemma":[0.98570883,0.010873872,0.0010188977,0.00095496257,0.00087922893,0.0005642967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026862833,0.0015275307,0.000918013,0.002339499,0.0010150897,0.002269,0.001787005,0.0011172093,0.0037818232],"category_scores_gemma":[0.013667901,0.0004492433,0.00083687267,0.0014601474,0.0048742355,0.0048522684,0.0028891058,0.0042597475,0.00064077426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090131085,0.00004170551,0.00043373383,0.00007080699,0.000015913056,0.00005157089,0.00015272039,0.033592492,0.0027354197,0.9559826,0.0008352198,0.005997686],"study_design_scores_gemma":[0.000023723804,0.00007303461,0.00038530646,0.000065528635,0.000022451006,0.00007764431,0.000060230832,0.26674625,0.004543471,0.72585505,0.002094688,0.000052680556],"about_ca_topic_score_codex":0.0010406009,"about_ca_topic_score_gemma":0.00066598627,"teacher_disagreement_score":0.0037818232,"about_ca_system_score_codex":0.0027312269,"about_ca_system_score_gemma":0.0012668051,"threshold_uncertainty_score":0.019816577},"labels":[],"label_agreement":null},{"id":"W2953106330","doi":"10.4230/lipics.cosit.2022.10","title":"Are Psychological Variables Relevant to Evaluating Geoinformatics Applications? The Case of Landmarks (Vision Paper)","year":2008,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Embodied and Extended Cognition","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Cognition; Computer science; Cognitive psychology; Psychology; Cognitive science; Neuroscience","score_opus":0.0729925459827801,"score_gpt":0.36786272467377973,"score_spread":0.29487017869099963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953106330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68370306,0.009687838,0.1994595,0.021588536,0.0004961713,0.0007023634,0.00057741546,0.00020681613,0.08357821],"genre_scores_gemma":[0.97803295,0.00061271264,0.01991443,0.00031908546,0.00010763646,0.00023473156,0.000099351026,0.000039000483,0.0006400677],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96221936,0.02696832,0.0018910681,0.0018497411,0.006277764,0.00079385884],"domain_scores_gemma":[0.72108835,0.23361546,0.01948709,0.006827003,0.016649377,0.0023327603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.036588144,0.000588429,0.00089238514,0.00307827,0.0010441188,0.008894209,0.00087008346,0.0017845953,0.004249455],"category_scores_gemma":[0.23691745,0.00028566553,0.00088952004,0.0036411607,0.005934559,0.008066095,0.0024567985,0.0020262366,0.00046929938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023544857,0.0006568078,0.19902672,0.003147222,0.000925013,0.00047850818,0.013703415,0.015113464,0.003607766,0.25552687,0.006694378,0.49876544],"study_design_scores_gemma":[0.0002612237,0.0022782763,0.3315277,0.0021941017,0.0012685524,0.0006603136,0.019527117,0.0437991,0.010379998,0.5580322,0.029554049,0.00051736797],"about_ca_topic_score_codex":0.0018733649,"about_ca_topic_score_gemma":0.0020144216,"teacher_disagreement_score":0.036588144,"about_ca_system_score_codex":0.0021002155,"about_ca_system_score_gemma":0.0016750403,"threshold_uncertainty_score":0.19349891},"labels":[],"label_agreement":null},{"id":"W2953195806","doi":"10.4230/lipics.approx-random.2016.28","title":"Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Mathematics; Constructive; Equivalence (formal languages); Regular polygon; Gaussian measure; Combinatorics; Norm (philosophy); Convex body; Distribution (mathematics); Sequence (biology); Discrete mathematics; Gaussian; Computer science; Mathematical analysis; Convex optimization; Geometry; Physics; Law","score_opus":0.0277196396158142,"score_gpt":0.2996892744997357,"score_spread":0.2719696348839215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953195806","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038041798,0.0001436722,0.9891979,0.0006180841,0.00010558694,0.000049692,0.000059408234,0.00040765686,0.005613802],"genre_scores_gemma":[0.17227338,0.0004854079,0.80936486,0.0016336889,0.0007776788,0.00056627055,0.00035656054,0.0010900788,0.013452053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99172145,0.0027340902,0.00029429919,0.0015910824,0.0030064671,0.00065260194],"domain_scores_gemma":[0.98109996,0.011450693,0.0012823036,0.0031986772,0.0023551516,0.00061323005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009563477,0.0019541068,0.0017809963,0.002704306,0.0019289348,0.0052517992,0.0037962531,0.002327399,0.0127543835],"category_scores_gemma":[0.031673595,0.0013273167,0.0022233773,0.0025168483,0.0067519676,0.010435249,0.008155836,0.0078123584,0.005227046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083901665,0.000054650136,0.00029456342,0.000088631765,0.000021440974,0.0000773971,0.00018050194,0.012888833,0.0030226917,0.94131356,0.0030251215,0.03894874],"study_design_scores_gemma":[0.000058029564,0.00006298113,0.00017566966,0.00003608798,0.000015894355,0.00013181893,0.000050392544,0.09376873,0.0049337437,0.88904256,0.011681996,0.000042134427],"about_ca_topic_score_codex":0.00077627,"about_ca_topic_score_gemma":0.00071194005,"teacher_disagreement_score":0.0127543835,"about_ca_system_score_codex":0.0022337886,"about_ca_system_score_gemma":0.0019253506,"threshold_uncertainty_score":0.050577104},"labels":[],"label_agreement":null},{"id":"W2953924437","doi":"10.4230/lipics.fscd.2019.27","title":"Hilbert’s Tenth Problem in Coq","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Diophantine equation; Recursively enumerable language; Computability; Constructive; Recursively enumerable set; Diophantine set; Mathematics; Proof assistant; Discrete mathematics; Type (biology); Algebra over a field; Computer science; Calculus (dental); Pure mathematics; Programming language; Mathematical proof","score_opus":0.019399495376912178,"score_gpt":0.25821950570910135,"score_spread":0.23882001033218916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953924437","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08894397,0.0012243153,0.7486078,0.010169663,0.0007848458,0.00010838502,0.00059511,0.0010660773,0.14849983],"genre_scores_gemma":[0.87227213,0.0006078218,0.09470006,0.0013433204,0.0003478977,0.00014375738,0.00036054282,0.0004216067,0.029802876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987024,0.0003287457,0.00006205152,0.00030302693,0.00036237287,0.00024136428],"domain_scores_gemma":[0.9973546,0.0016699726,0.00012413283,0.00040079394,0.0003381564,0.000112419315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020608364,0.0004671964,0.00051583326,0.0011202071,0.0017925672,0.0027044564,0.0012717049,0.0013837994,0.009874287],"category_scores_gemma":[0.005312913,0.00035852377,0.0009219847,0.0010137458,0.0067022503,0.008009917,0.0034603209,0.00397612,0.0015765392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009373578,0.0000040472933,0.00009149216,0.000018063254,0.000002070973,0.00003455281,0.00012845176,0.00041840316,0.00017909537,0.9962288,0.00068287563,0.0022029055],"study_design_scores_gemma":[0.00000906043,0.000007208768,0.00008652464,0.000013086285,0.0000040972445,0.000074778145,0.00008215233,0.004150251,0.0012546295,0.9827848,0.011523178,0.000010121627],"about_ca_topic_score_codex":0.0022572598,"about_ca_topic_score_gemma":0.0015459962,"teacher_disagreement_score":0.009874287,"about_ca_system_score_codex":0.002312821,"about_ca_system_score_gemma":0.0012367624,"threshold_uncertainty_score":0.033032775},"labels":[],"label_agreement":null},{"id":"W2962752375","doi":"10.4230/lipics.icdt.2019.6","title":"A Formal Framework for Probabilistic Unclean Databases.","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Probabilistic logic; Computer science; Tuple; Cardinality (data modeling); Database; Probabilistic database; Realization (probability); Data mining; Theoretical computer science; Database theory; Database design; Artificial intelligence; Mathematics","score_opus":0.13311431167096552,"score_gpt":0.405443553735199,"score_spread":0.2723292420642335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962752375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082946353,0.00056294614,0.9939103,0.001109821,0.000071709735,0.00011439028,0.00045851755,0.00026277854,0.0026800944],"genre_scores_gemma":[0.10142073,0.0017186854,0.8847226,0.0018476509,0.00063010235,0.0013212576,0.002252975,0.00039389246,0.005692112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98163915,0.005825458,0.0021384633,0.003962256,0.0054094177,0.0010253515],"domain_scores_gemma":[0.9687572,0.01917444,0.0023928424,0.0058189845,0.0029743644,0.0008822261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016643556,0.0017368756,0.0015607472,0.004538955,0.002910065,0.0094438335,0.0076176627,0.004219567,0.009494969],"category_scores_gemma":[0.034998372,0.0023618808,0.0060520982,0.005791965,0.008919773,0.019639578,0.010968688,0.009946758,0.002901128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021120306,0.000025994084,0.00025518663,0.00011492569,0.000027294718,0.00013185498,0.00029188345,0.009814603,0.00029053874,0.9777899,0.0015321511,0.009704633],"study_design_scores_gemma":[0.000023730041,0.000023315135,0.00007767458,0.000089162524,0.000030046485,0.00028406736,0.00010215994,0.050134834,0.00053980644,0.9249571,0.023705333,0.000032929158],"about_ca_topic_score_codex":0.006224689,"about_ca_topic_score_gemma":0.004551849,"teacher_disagreement_score":0.016643556,"about_ca_system_score_codex":0.004734007,"about_ca_system_score_gemma":0.0053057917,"threshold_uncertainty_score":0.08802056},"labels":[],"label_agreement":null},{"id":"W2962803978","doi":"10.4230/lipics.isaac.2018.61","title":"Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; European Commission","keywords":"Rectangle; Set cover problem; Approximation algorithm; Logarithm; Line segment; Cover (algebra); Combinatorics; Mathematics; Computational geometry; Constant (computer programming); Boundary (topology); Set (abstract data type); Line (geometry); Plane (geometry); Discrete mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.026819945950279842,"score_gpt":0.2810604631147204,"score_spread":0.2542405171644405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962803978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22540951,0.0009753841,0.7502987,0.001028187,0.00009715336,0.00030116676,0.00071190554,0.0020377673,0.019140251],"genre_scores_gemma":[0.60022247,0.0010446537,0.38133925,0.00045020581,0.000106240725,0.00042435137,0.0020778908,0.00060881075,0.013726125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903655,0.00016429891,0.000046651705,0.00016234358,0.00027246852,0.0003176927],"domain_scores_gemma":[0.998021,0.00079020037,0.00020056998,0.00066888676,0.00015310847,0.00016620908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006211876,0.0011518784,0.0013779721,0.00075677526,0.0005557545,0.0019630222,0.0016709738,0.0009014764,0.010006506],"category_scores_gemma":[0.0031601065,0.000683433,0.001466365,0.00163431,0.00082099304,0.003983562,0.0022846253,0.0023852002,0.0023422153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007829706,0.00040644006,0.0034453073,0.00038514604,0.00009795111,0.00043596956,0.00035041265,0.6569659,0.035007,0.07899655,0.014819051,0.20830728],"study_design_scores_gemma":[0.000045425517,0.00016598037,0.0006176029,0.00003186157,0.000031844287,0.0001783789,0.000104627004,0.93646747,0.0067084236,0.049774513,0.0058543305,0.00001943688],"about_ca_topic_score_codex":0.0034173555,"about_ca_topic_score_gemma":0.0040198616,"teacher_disagreement_score":0.010006506,"about_ca_system_score_codex":0.0012645682,"about_ca_system_score_gemma":0.0010398191,"threshold_uncertainty_score":0.03347516},"labels":[],"label_agreement":null},{"id":"W2962832012","doi":"10.4230/lipics.fsttcs.2014.199","title":"Lift & Project Systems Performing on the Partial Vertex Cover Polytope","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex cover; Vertex (graph theory); Approximation algorithm; Mathematics; Polytope; Lift (data mining); Cover (algebra); Relaxation (psychology); Theory of computation; Linear programming relaxation; Discrete mathematics; Graph; Linear programming; Computer science; Mathematical optimization; Algorithm","score_opus":0.036818026451760515,"score_gpt":0.2644570532543573,"score_spread":0.2276390268025968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962832012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22050795,0.00052175013,0.7296147,0.0013753785,0.0001422815,0.00032430945,0.0005176397,0.000799122,0.046196975],"genre_scores_gemma":[0.801254,0.00049446576,0.18552586,0.00040206415,0.00013390814,0.00046122275,0.0010732734,0.00028569516,0.010369618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984658,0.0003457758,0.000053264903,0.00030113605,0.00039899145,0.0004349816],"domain_scores_gemma":[0.99560416,0.002656385,0.00039368565,0.0005686606,0.0003082824,0.00046886798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022602116,0.0014411055,0.0013243934,0.00090932974,0.0011490291,0.0024363108,0.0021954463,0.0012617655,0.010912261],"category_scores_gemma":[0.012249834,0.0006004797,0.001545846,0.0010675254,0.001906025,0.0032630914,0.0056234244,0.004732448,0.0010997998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039935968,0.0001719206,0.0018385742,0.0003189316,0.000054423377,0.0001550879,0.00040804205,0.5638881,0.0027852163,0.3696744,0.0060488824,0.05425708],"study_design_scores_gemma":[0.000025048943,0.00011296308,0.00018632086,0.00002845057,0.000011985912,0.000050280272,0.00008041832,0.8979412,0.001308041,0.098455735,0.0017880849,0.000011482316],"about_ca_topic_score_codex":0.0031926865,"about_ca_topic_score_gemma":0.0027877633,"teacher_disagreement_score":0.010912261,"about_ca_system_score_codex":0.0023302278,"about_ca_system_score_gemma":0.0016771076,"threshold_uncertainty_score":0.036505163},"labels":[],"label_agreement":null},{"id":"W2962981543","doi":"10.4230/lipics.approx-random.2017.18","title":"Approximating Unique Games Using Low Diameter Graph Decomposition","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Minor (academic); Graph; Approximation algorithm; Discrete mathematics","score_opus":0.031841944923086854,"score_gpt":0.3105793707548013,"score_spread":0.27873742583171446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962981543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033463243,0.0002777896,0.9597023,0.0003809363,0.000059353886,0.00011326564,0.00017434466,0.00093953684,0.0048892396],"genre_scores_gemma":[0.360293,0.0003460898,0.63302344,0.0003198757,0.000073673706,0.00036066535,0.0007215722,0.00043690353,0.004424718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983693,0.0005024021,0.000068701695,0.0004722296,0.00027168082,0.00031572263],"domain_scores_gemma":[0.99682176,0.0017848896,0.00042491383,0.00052062125,0.00022338892,0.0002243666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013893745,0.00197101,0.0014009344,0.0015972734,0.0008317207,0.0016246978,0.0026242277,0.001458125,0.004723556],"category_scores_gemma":[0.008124851,0.0008831548,0.0017883017,0.0017272268,0.0011036547,0.0033474092,0.0027653556,0.00251988,0.0010544177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030001384,0.00022903347,0.0017997724,0.00033324427,0.0001123525,0.00017521963,0.00022446952,0.77033776,0.0054292963,0.09993265,0.007672857,0.11345324],"study_design_scores_gemma":[0.00003438994,0.0000613508,0.00013883514,0.000023230596,0.000015939424,0.00006361151,0.00004205282,0.9164533,0.0015623812,0.08017352,0.0014202644,0.000011098685],"about_ca_topic_score_codex":0.0035905577,"about_ca_topic_score_gemma":0.006162835,"teacher_disagreement_score":0.004723556,"about_ca_system_score_codex":0.0024300735,"about_ca_system_score_gemma":0.0013488805,"threshold_uncertainty_score":0.017631471},"labels":[],"label_agreement":null},{"id":"W2963042078","doi":"10.4230/lipics.itcs.2017.33","title":"Testing Submodularity and Other Properties of Valuation Functions","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Property testing; Submodular set function; Bounding overwatch; Constant (computer programming); Mathematics; Valuation (finance); Discrete mathematics; Function (biology); Monotonic function; Constant function; Combinatorics; Computer science; Piecewise; Mathematical analysis","score_opus":0.062271835273430644,"score_gpt":0.2795524570611236,"score_spread":0.21728062178769295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963042078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3983068,0.0010473027,0.5822521,0.0038509031,0.0001283425,0.00023043824,0.0013804911,0.0016817463,0.011121979],"genre_scores_gemma":[0.94002855,0.00027872395,0.056443263,0.0004500112,0.00013117859,0.00013419136,0.0007762197,0.00012783094,0.0016300309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946136,0.0014679338,0.00030832866,0.0014606235,0.0013585455,0.00079098175],"domain_scores_gemma":[0.9423808,0.046168555,0.0024432598,0.0062513514,0.0015503681,0.0012056514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059765754,0.001639372,0.002287468,0.000978439,0.0009276916,0.0035647524,0.0035917659,0.0017058882,0.0053617726],"category_scores_gemma":[0.049286272,0.0005399822,0.0018941433,0.0016196874,0.0036903606,0.012300061,0.0034777597,0.0050001703,0.00060777523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029107248,0.0011887151,0.02683572,0.00086662994,0.00034539748,0.00080355123,0.00095173967,0.29922405,0.017028159,0.44077387,0.008331108,0.20074043],"study_design_scores_gemma":[0.00012163295,0.00037873286,0.0013437576,0.000051473708,0.00006152775,0.0003639669,0.00017141139,0.60641956,0.007304407,0.38229337,0.0014498791,0.000040344654],"about_ca_topic_score_codex":0.0016013987,"about_ca_topic_score_gemma":0.001341657,"teacher_disagreement_score":0.0059765754,"about_ca_system_score_codex":0.002039182,"about_ca_system_score_gemma":0.0020571444,"threshold_uncertainty_score":0.03160751},"labels":[],"label_agreement":null},{"id":"W2963080927","doi":"10.4230/lipics.ecoop.2016.7","title":"Interprocedural Type Specialization of JavaScript Programs Without Type Analysis","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Programming language; JavaScript; Compiler; Software versioning; Block (permutation group theory); Simple (philosophy); Source code; Context (archaeology); Software","score_opus":0.020671696320407565,"score_gpt":0.2782466223932611,"score_spread":0.25757492607285354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963080927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13413912,0.0005237037,0.8110126,0.00022635394,0.000083514715,0.00020794573,0.00042031356,0.046446573,0.006939932],"genre_scores_gemma":[0.6140419,0.0003122343,0.36785015,0.0003341751,0.00006762885,0.00013751161,0.001026574,0.009110563,0.007119247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621826,0.0010253083,0.0003367383,0.0007433583,0.0012646037,0.00041174554],"domain_scores_gemma":[0.9813442,0.0044121523,0.0013520791,0.011442441,0.0012501176,0.00019895342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025306433,0.0008105198,0.000893332,0.0011625283,0.0007672807,0.0017901073,0.0020960036,0.00059322733,0.002611543],"category_scores_gemma":[0.013815296,0.0008828099,0.0012486035,0.0015583409,0.001425239,0.003721005,0.0023944073,0.0017795848,0.0012592113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001012083,0.00029857917,0.03500131,0.00078618224,0.00023056682,0.00041615256,0.0016745556,0.031409755,0.114552945,0.04162876,0.0068298965,0.7661592],"study_design_scores_gemma":[0.00016310319,0.0006645132,0.015795961,0.0002523548,0.00035651692,0.001451953,0.0002741249,0.560777,0.30944932,0.058434743,0.052172624,0.00020784485],"about_ca_topic_score_codex":0.002819659,"about_ca_topic_score_gemma":0.004226581,"teacher_disagreement_score":0.002819659,"about_ca_system_score_codex":0.0009993816,"about_ca_system_score_gemma":0.0021765293,"threshold_uncertainty_score":0.013383508},"labels":[],"label_agreement":null},{"id":"W2963143041","doi":"10.4230/lipics.tqc.2013.285","title":"Kitaev's Z_d-Codes Threshold Estimates","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; Compute Canada","keywords":"Decoding methods; Code (set theory); Error detection and correction; Noise (video); Quantum; Toric code; Mathematics; Algorithm; Discrete mathematics; Computer science; Physics; Quantum computer; Quantum mechanics; Artificial intelligence; Image (mathematics); Set (abstract data type)","score_opus":0.009502770313851085,"score_gpt":0.23302664153535987,"score_spread":0.2235238712215088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963143041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59817874,0.001956856,0.31626335,0.00396032,0.00026479794,0.000085906126,0.00041336895,0.0007813939,0.0780953],"genre_scores_gemma":[0.98413783,0.00035672725,0.008510052,0.00019097228,0.00010834913,0.00007448609,0.000117977754,0.00011949452,0.006383991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992963,0.00014789174,0.000031902284,0.00008967393,0.0002615237,0.00017270207],"domain_scores_gemma":[0.99700636,0.001609401,0.00030595768,0.00031111384,0.00046843497,0.00029876755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012490911,0.0007917624,0.0010112455,0.0017348563,0.0007992408,0.001459453,0.0014132963,0.001438297,0.004476439],"category_scores_gemma":[0.007890648,0.0002714715,0.00051763176,0.00059991423,0.0027087168,0.0021857063,0.0029807382,0.0023968471,0.000583892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050409242,0.000015924465,0.0004908803,0.00007478099,0.000013277008,0.00009005465,0.00014360478,0.02850923,0.0036982773,0.9633707,0.00082314026,0.0027196566],"study_design_scores_gemma":[0.00002813716,0.00003191147,0.0004756483,0.000060505667,0.000015088569,0.00011311345,0.00006410229,0.28499746,0.0044205617,0.70880795,0.0009412005,0.000044192486],"about_ca_topic_score_codex":0.0013892481,"about_ca_topic_score_gemma":0.0005848313,"teacher_disagreement_score":0.004476439,"about_ca_system_score_codex":0.0016891429,"about_ca_system_score_gemma":0.0010098664,"threshold_uncertainty_score":0.014975131},"labels":[],"label_agreement":null},{"id":"W2963225498","doi":"10.4230/lipics.itcs.2019.54","title":"On the Communication Complexity of High-Dimensional Permutations","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Integer (computer science); Communication complexity; Combinatorics; Abelian group; Discrete mathematics; Extension (predicate logic); Mathematics; Variety (cybernetics); Group (periodic table); Computational complexity theory; Computer science; Theoretical computer science; Algorithm","score_opus":0.022459193858593098,"score_gpt":0.23265221125104732,"score_spread":0.21019301739245422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963225498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6358085,0.0020471103,0.28782022,0.012465495,0.00030025202,0.00024722706,0.0011195763,0.00048504106,0.05970659],"genre_scores_gemma":[0.95992184,0.0011157402,0.029633196,0.0005811363,0.00035421003,0.00039210974,0.0005227589,0.00018304403,0.007296065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954462,0.0018133037,0.00017589066,0.00063605065,0.0009483501,0.0009802019],"domain_scores_gemma":[0.9494392,0.043622468,0.0024400314,0.0028299543,0.0006709619,0.0009974695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035047606,0.0012640818,0.0016258477,0.0017322709,0.002533783,0.004278672,0.0027497578,0.0026466036,0.0058258614],"category_scores_gemma":[0.02134632,0.0006737014,0.0015891151,0.0021945678,0.004913948,0.011499067,0.0049212542,0.0072784377,0.0007587333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003891026,0.0002053463,0.0016366069,0.00021781755,0.000076823315,0.00026571655,0.00047099433,0.09731656,0.0030906417,0.87999547,0.0043906416,0.011944282],"study_design_scores_gemma":[0.000051139596,0.00004907969,0.0003680015,0.000027498489,0.000022515109,0.00010964698,0.00009631035,0.24047826,0.00098411,0.75647086,0.0013068817,0.000035672027],"about_ca_topic_score_codex":0.0012082309,"about_ca_topic_score_gemma":0.00084886583,"teacher_disagreement_score":0.0058258614,"about_ca_system_score_codex":0.0037628673,"about_ca_system_score_gemma":0.0016549408,"threshold_uncertainty_score":0.02730167},"labels":[],"label_agreement":null},{"id":"W2963227782","doi":"10.4230/lipics.esa.2018.25","title":"Improved Time and Space Bounds for Dynamic Range Mode","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Data structure; Linear space; Element (criminal law); Range query (database); Range (aeronautics); Computer science; Space (punctuation); Monte Carlo method; Algorithm; Binary logarithm; Theoretical computer science; Combinatorics; Mathematics; Information retrieval; Search engine; Web query classification; Statistics; Web search query","score_opus":0.007625279048213117,"score_gpt":0.25666534523955187,"score_spread":0.24904006619133875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963227782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063577406,0.0053742225,0.865008,0.005347298,0.0007495602,0.0007196478,0.003183713,0.02366634,0.032373745],"genre_scores_gemma":[0.31113017,0.0016263868,0.65794975,0.0024715173,0.0008920342,0.0012535705,0.00497804,0.003664141,0.01603441],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9752529,0.0038822405,0.0020810093,0.0048899716,0.00995695,0.0039368994],"domain_scores_gemma":[0.9449805,0.026576718,0.0023741208,0.02044718,0.004056244,0.0015652836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008664699,0.003622238,0.004054515,0.0038231304,0.0023313663,0.0067554438,0.0097697545,0.0028294756,0.024677172],"category_scores_gemma":[0.038579695,0.0022495333,0.005372074,0.0057338746,0.0034871357,0.026446862,0.014387568,0.007153964,0.00888705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006564333,0.001734348,0.008796167,0.0014144344,0.00035301995,0.00055371114,0.0015861527,0.12182403,0.043458927,0.18770081,0.06604396,0.5599701],"study_design_scores_gemma":[0.00076681067,0.0011857407,0.0011765722,0.00024864884,0.0003302144,0.0007914439,0.0004558836,0.7211312,0.020874621,0.22614022,0.026665254,0.00023337077],"about_ca_topic_score_codex":0.007659369,"about_ca_topic_score_gemma":0.0079000415,"teacher_disagreement_score":0.024677172,"about_ca_system_score_codex":0.0040334584,"about_ca_system_score_gemma":0.0068284455,"threshold_uncertainty_score":0.08255339},"labels":[],"label_agreement":null},{"id":"W2963282726","doi":"10.4230/lipics.icalp.2016.74","title":"Approximating Directed Steiner Problems via Tree Embedding","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Directed acyclic graph; Feedback arc set; Directed graph; Discrete mathematics; Vertex (graph theory); Disjoint sets; Embedding; Covering problems; Graph; Computer science; Set (abstract data type); Line graph","score_opus":0.01862077904121224,"score_gpt":0.24849855334000945,"score_spread":0.22987777429879722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963282726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07121268,0.0029391232,0.90876305,0.0010232342,0.000199218,0.00013462908,0.0009397403,0.001433485,0.013354797],"genre_scores_gemma":[0.4688536,0.0026077598,0.5168105,0.00034074794,0.00016269583,0.00026535706,0.003788364,0.00040981066,0.0067611285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989691,0.00033999438,0.000060364317,0.00023428701,0.00025920154,0.00013702601],"domain_scores_gemma":[0.99749446,0.0016538665,0.00020799004,0.00033476812,0.00019966035,0.00010932474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009060558,0.0012911992,0.0012386327,0.0012167924,0.0004479134,0.0016870253,0.001668119,0.0014705062,0.0043762783],"category_scores_gemma":[0.007670878,0.0007168275,0.0009761908,0.0023165417,0.0005737139,0.0040818662,0.0018035871,0.00199836,0.0011711495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023624075,0.0001448374,0.0016675415,0.00040969302,0.000102386286,0.00013477149,0.00014896064,0.792086,0.0016388088,0.0583241,0.012762781,0.132344],"study_design_scores_gemma":[0.000021704158,0.000038330305,0.00014445372,0.000027431654,0.000012566315,0.000049382867,0.000041442017,0.9423939,0.00036636947,0.05430799,0.0025906316,0.000005868218],"about_ca_topic_score_codex":0.0021169279,"about_ca_topic_score_gemma":0.003295666,"teacher_disagreement_score":0.0043762783,"about_ca_system_score_codex":0.0013021468,"about_ca_system_score_gemma":0.00097336713,"threshold_uncertainty_score":0.014640152},"labels":[],"label_agreement":null},{"id":"W2963306680","doi":"10.4230/lipics.icalp.2016.75","title":"Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Swap (finance); Upper and lower bounds; Mathematics; Heuristic; Combinatorics; Matching (statistics); Approximation algorithm; Mathematical optimization; Computer science; Statistics; Economics","score_opus":0.02371906159291856,"score_gpt":0.24282902159203415,"score_spread":0.2191099599991156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963306680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12875691,0.0031164302,0.78819877,0.005303823,0.00032604454,0.0005415151,0.0017429477,0.0016656521,0.070347935],"genre_scores_gemma":[0.6084941,0.0017857117,0.35826498,0.0019514369,0.00033320484,0.00082563504,0.0020463585,0.0014186666,0.024879871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655044,0.0009762548,0.00011381417,0.00057479047,0.0007987977,0.000985871],"domain_scores_gemma":[0.9911634,0.005676723,0.0006321175,0.001057267,0.0006400181,0.0008304632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038554461,0.0026831094,0.0032948018,0.0018471824,0.0021359324,0.004274984,0.0043230685,0.003060977,0.028447213],"category_scores_gemma":[0.020768376,0.0015544114,0.0025584567,0.0028796636,0.00227872,0.007915159,0.0049011083,0.0058861114,0.002631221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012868461,0.0006038719,0.0026851771,0.00074182515,0.00022818215,0.00034039348,0.00057979365,0.73892015,0.0048726257,0.1671595,0.029620327,0.052961305],"study_design_scores_gemma":[0.0000872893,0.00017074856,0.0004484873,0.00012143573,0.00006635347,0.0001365909,0.00017730964,0.8811853,0.0012329504,0.11134628,0.0050003417,0.000027019565],"about_ca_topic_score_codex":0.005435696,"about_ca_topic_score_gemma":0.007596036,"teacher_disagreement_score":0.028447213,"about_ca_system_score_codex":0.004769203,"about_ca_system_score_gemma":0.0032445013,"threshold_uncertainty_score":0.09516537},"labels":[],"label_agreement":null},{"id":"W2963350132","doi":"10.4230/lipics.swat.2018.12","title":"Boundary Labeling for Rectangular Diagrams","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Carleton University","funders":"","keywords":"Boundary (topology); Rectangle; Combinatorics; Time complexity; Set (abstract data type); Mathematics; Graph; Polynomial; Computer science; Geometry; Discrete mathematics; Algorithm; Mathematical analysis; Programming language","score_opus":0.01661868606084442,"score_gpt":0.27406740591457013,"score_spread":0.2574487198537257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963350132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041886732,0.00070931274,0.919911,0.0007602014,0.00014780372,0.00023079164,0.0010056751,0.0032177642,0.032130614],"genre_scores_gemma":[0.17381883,0.00042003483,0.812748,0.00027343424,0.000059709488,0.00027522212,0.002498636,0.000843691,0.009062466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858826,0.00041265582,0.00008561895,0.00042336728,0.00031009503,0.00018001776],"domain_scores_gemma":[0.99766016,0.0012150932,0.00021818117,0.00050015707,0.00024593662,0.0001604096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008617956,0.00086812204,0.0009503188,0.000957491,0.0013163796,0.0021981157,0.0015471582,0.0014431573,0.021223191],"category_scores_gemma":[0.0058430927,0.0006509536,0.0012494446,0.0014362534,0.001158558,0.0050967685,0.0031380637,0.0018934078,0.0053961664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035269445,0.00014965853,0.0014546192,0.000889123,0.00003148816,0.00039287453,0.0011814275,0.07297687,0.015168521,0.5093469,0.032684486,0.36537132],"study_design_scores_gemma":[0.00010113201,0.00012384904,0.0003852186,0.00020584234,0.00003518056,0.00048537485,0.00054506835,0.24807186,0.009642739,0.65819544,0.08216036,0.000047934845],"about_ca_topic_score_codex":0.0016927795,"about_ca_topic_score_gemma":0.0028191966,"teacher_disagreement_score":0.021223191,"about_ca_system_score_codex":0.0012958668,"about_ca_system_score_gemma":0.0009729874,"threshold_uncertainty_score":0.07099861},"labels":[],"label_agreement":null},{"id":"W2963419150","doi":"10.4230/lipics.disc.2017.4","title":"Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Global Affairs Canada; Israel Science Foundation; University of Toronto","keywords":"Computer science; Algorithm; Overhead (engineering); Reuse; Lock (firearm); Artificial intelligence; Machine learning; Programming language","score_opus":0.03523850705275347,"score_gpt":0.28125691022323734,"score_spread":0.24601840317048387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963419150","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023648122,0.00024333657,0.96923053,0.0001867713,0.00017206179,0.00011919054,0.00008127485,0.0043882765,0.0019304983],"genre_scores_gemma":[0.21724103,0.00031325896,0.77154815,0.00049090653,0.00011969381,0.00042853187,0.00035226715,0.002825091,0.0066810455],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99656904,0.00073442794,0.00034396758,0.0005701163,0.0013192708,0.00046320874],"domain_scores_gemma":[0.98864496,0.0033661334,0.0010011588,0.005392513,0.001241064,0.00035418727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038324036,0.0012689383,0.0010767576,0.0013541902,0.0012205412,0.0026865117,0.0042376034,0.001204237,0.0028547174],"category_scores_gemma":[0.015078406,0.0010683769,0.0014331117,0.002307471,0.002817039,0.0063950103,0.0044143237,0.002696752,0.0014673014],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013013901,0.00059349835,0.0068421527,0.00040361445,0.00017326343,0.0003348715,0.0010491039,0.08421323,0.039420627,0.22792575,0.011886998,0.62585545],"study_design_scores_gemma":[0.00048247806,0.00061530154,0.0009306836,0.000090075,0.00018315448,0.00034950263,0.00034668852,0.56939566,0.07478561,0.3092543,0.0434126,0.00015398653],"about_ca_topic_score_codex":0.0030361635,"about_ca_topic_score_gemma":0.0030530032,"teacher_disagreement_score":0.0042376034,"about_ca_system_score_codex":0.001226219,"about_ca_system_score_gemma":0.0029868574,"threshold_uncertainty_score":0.020267904},"labels":[],"label_agreement":null},{"id":"W2963443829","doi":"10.4230/lipics.icalp.2017.32","title":"Improved Algorithms for MST and Metric-TSP Interdiction","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Defense, Military, and Policy Studies","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interdiction; Knapsack problem; Approximation algorithm; Mathematics; Metric (unit); Continuous knapsack problem; Greedy algorithm; Combinatorics; Tree (set theory); Upper and lower bounds; Generalization; Multigraph; Mathematical optimization; Computer science; Algorithm","score_opus":0.05027572088194217,"score_gpt":0.28540757373975256,"score_spread":0.2351318528578104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963443829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018053664,0.0012407633,0.95495194,0.0011492557,0.00020555263,0.0001950905,0.0011957998,0.0030906436,0.019917276],"genre_scores_gemma":[0.20851393,0.0010870202,0.7743768,0.0006863352,0.0002519444,0.00033303254,0.00366919,0.001331278,0.00975053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972384,0.00052570336,0.00017297741,0.0007270203,0.0009464588,0.0003894951],"domain_scores_gemma":[0.996276,0.0013221678,0.00031911183,0.0013094238,0.00056007126,0.00021320612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015037246,0.0021633252,0.0018119911,0.002061255,0.001049719,0.0022838828,0.004762653,0.0024223558,0.016530998],"category_scores_gemma":[0.0103144655,0.0009514259,0.0024372682,0.0043251873,0.0011167146,0.0064142486,0.0041502346,0.004849465,0.0048929015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005646065,0.0004375028,0.001341161,0.0008664886,0.00020333481,0.0002109396,0.00047636492,0.48800296,0.005822186,0.2119129,0.041953694,0.24820778],"study_design_scores_gemma":[0.00008630205,0.00012123819,0.00034664228,0.000071219125,0.000067359884,0.00025983088,0.00008069622,0.79245996,0.0023616417,0.18760432,0.01651021,0.000030491792],"about_ca_topic_score_codex":0.0046383864,"about_ca_topic_score_gemma":0.007550835,"teacher_disagreement_score":0.016530998,"about_ca_system_score_codex":0.0032583058,"about_ca_system_score_gemma":0.0024231235,"threshold_uncertainty_score":0.055301666},"labels":[],"label_agreement":null},{"id":"W2963526330","doi":"10.4230/lipics.tqc.2019.2","title":"Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounded function; Zero (linguistics); Mathematics; Measure (data warehouse); Discrete mathematics; Function (biology); Upper and lower bounds; State (computer science); Boolean function; Algorithm; Combinatorics; Computer science","score_opus":0.03387183656975885,"score_gpt":0.2957106843187253,"score_spread":0.2618388477489665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963526330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09168064,0.0015417561,0.8755586,0.0059795883,0.00019202338,0.000149149,0.00030587576,0.00047790213,0.02411441],"genre_scores_gemma":[0.8665668,0.000827222,0.12339226,0.0012903126,0.00044766176,0.0003288694,0.00026389185,0.00024188864,0.0066412194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878633,0.0030681752,0.0005355735,0.002216548,0.0044678375,0.0018486249],"domain_scores_gemma":[0.9142737,0.06294719,0.0049956073,0.012042819,0.0037500083,0.001990798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00857149,0.0012396614,0.001370884,0.002431918,0.0018410307,0.004998363,0.0041292966,0.0026964738,0.005489678],"category_scores_gemma":[0.042311598,0.00073131337,0.002162427,0.0023883465,0.012482456,0.019153455,0.007825905,0.008355684,0.0007098114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008560854,0.000046093508,0.0006189684,0.00006652548,0.000021925684,0.000041043044,0.00016533204,0.016696336,0.0013834081,0.97200847,0.0007485801,0.008117782],"study_design_scores_gemma":[0.000023666322,0.00007350131,0.00039408187,0.000023698822,0.000020948552,0.00009113401,0.00005730329,0.10756659,0.0030969388,0.88633317,0.0022824358,0.00003645741],"about_ca_topic_score_codex":0.0017268634,"about_ca_topic_score_gemma":0.0009688372,"teacher_disagreement_score":0.00857149,"about_ca_system_score_codex":0.0066725938,"about_ca_system_score_gemma":0.0030886596,"threshold_uncertainty_score":0.048413277},"labels":[],"label_agreement":null},{"id":"W2963530074","doi":"10.4230/lipics.isaac.2019.57","title":"On Approximate Range Mode and Range Selection","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Range (aeronautics); Rank (graph theory); Combinatorics; Space (punctuation); Constant (computer programming); Mathematics; Position (finance); Selection (genetic algorithm); Range query (database); Sequence (biology); Element (criminal law); Discrete mathematics; Computer science; Search engine; Web search query; Chemistry; Sargable","score_opus":0.01617894227685548,"score_gpt":0.26434331517425186,"score_spread":0.24816437289739637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963530074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051541336,0.002829756,0.9187237,0.002715937,0.00013865129,0.00025125378,0.0013773188,0.0031864475,0.019235516],"genre_scores_gemma":[0.50372475,0.002435506,0.46839383,0.0024093399,0.00055159465,0.0012088331,0.004681071,0.0011057958,0.015489252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930577,0.001446326,0.00045660415,0.0013418377,0.00283499,0.000862453],"domain_scores_gemma":[0.9843404,0.009729652,0.00089787063,0.003607491,0.0010964548,0.00032812468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00261229,0.0017274588,0.0023618808,0.0020071617,0.0013540231,0.0030025512,0.0037605478,0.002106585,0.010118131],"category_scores_gemma":[0.020096645,0.0008610274,0.0015708025,0.0054122466,0.0025552693,0.013829999,0.0056711123,0.0037506926,0.003289765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003050528,0.00051236735,0.007425438,0.00086022925,0.00014782745,0.00050952943,0.0015224803,0.14201465,0.03103298,0.32960525,0.035731472,0.4475873],"study_design_scores_gemma":[0.00019521487,0.00055096555,0.0016696937,0.00015105025,0.00012027935,0.001234445,0.0006172867,0.57551014,0.015351582,0.3734857,0.030990958,0.00012267259],"about_ca_topic_score_codex":0.0033393314,"about_ca_topic_score_gemma":0.0019938082,"teacher_disagreement_score":0.010118131,"about_ca_system_score_codex":0.0019635903,"about_ca_system_score_gemma":0.0017018262,"threshold_uncertainty_score":0.033848524},"labels":[],"label_agreement":null},{"id":"W2963552320","doi":"10.4230/lipics.icalp.2018.31","title":"Orthogonal Point Location and Rectangle Stabbing Queries in 3-d","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rectangle; Data structure; Disjoint sets; Point location; Combinatorics; Recursion (computer science); Linear space; Computer science; Logarithm; Pointer (user interface); Binary logarithm; Time complexity; Mathematics; Discrete mathematics; Point (geometry); Algorithm; Geometry","score_opus":0.011409725992905883,"score_gpt":0.24882596063621948,"score_spread":0.2374162346433136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963552320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1000102,0.0019699468,0.8653846,0.0018994651,0.0003470158,0.00029524523,0.0028565258,0.010501379,0.016735667],"genre_scores_gemma":[0.38191423,0.00092818,0.593847,0.0010374073,0.0003169377,0.0005454811,0.0057363627,0.0014303671,0.01424411],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945898,0.00069959735,0.0006141187,0.0013168,0.0017668589,0.0010128379],"domain_scores_gemma":[0.9922854,0.0024100195,0.0006280042,0.0036387176,0.00074113504,0.00029675965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015226621,0.0016038105,0.0026637134,0.0016778207,0.0022806365,0.004213249,0.0049984646,0.0031129923,0.014292363],"category_scores_gemma":[0.008834611,0.0010851765,0.0020654995,0.0075780125,0.0025330936,0.015064646,0.008696923,0.0029606211,0.0061225607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027931652,0.0006431795,0.005619751,0.0012700836,0.00018053422,0.00058548286,0.0016206675,0.16392638,0.036347248,0.29321304,0.061544463,0.43225598],"study_design_scores_gemma":[0.00034435574,0.0005671311,0.0013173505,0.00012410682,0.00010720657,0.000787063,0.0010461917,0.6450471,0.035904534,0.2657385,0.04881742,0.00019897136],"about_ca_topic_score_codex":0.007410379,"about_ca_topic_score_gemma":0.008150823,"teacher_disagreement_score":0.014292363,"about_ca_system_score_codex":0.0027679303,"about_ca_system_score_gemma":0.0023933027,"threshold_uncertainty_score":0.0478127},"labels":[],"label_agreement":null},{"id":"W2963643297","doi":"10.4230/lipics.itcs.2018.41","title":"Graph Clustering using Effective Resistance","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conductance; Inverse; Graph; Connection (principal bundle); Degree (music); Discrete mathematics; Physics; Geometry","score_opus":0.012682103788339588,"score_gpt":0.28431961830362557,"score_spread":0.27163751451528595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963643297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011996964,0.00026264822,0.9808508,0.00026701167,0.000046957182,0.00016017392,0.00017276187,0.0027775015,0.0034651505],"genre_scores_gemma":[0.22044033,0.000422494,0.7698196,0.00022051732,0.00010753923,0.00048943155,0.0012472414,0.0006039243,0.0066489284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806505,0.0004711358,0.000099130135,0.00063616474,0.0005086727,0.00021994743],"domain_scores_gemma":[0.9973207,0.0006927142,0.0003510277,0.0010541849,0.00043597203,0.00014533004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276995,0.0018475984,0.0017363812,0.0034511432,0.0014326744,0.0021424692,0.004154087,0.0017343921,0.004520848],"category_scores_gemma":[0.0052384865,0.00088392553,0.0015927774,0.0026808635,0.0014139593,0.0042992122,0.0025298079,0.0013775286,0.0038172293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041988425,0.00023307376,0.001468546,0.0005642158,0.00022385432,0.00015697995,0.00041321415,0.46926457,0.032714315,0.12623563,0.012768586,0.35553715],"study_design_scores_gemma":[0.00005165851,0.00010345362,0.0002441983,0.000023586503,0.000032880267,0.00010447324,0.000051294643,0.91526014,0.008320973,0.06956577,0.0062069097,0.000034707326],"about_ca_topic_score_codex":0.0028795965,"about_ca_topic_score_gemma":0.0028864022,"teacher_disagreement_score":0.004520848,"about_ca_system_score_codex":0.0022941215,"about_ca_system_score_gemma":0.0016771938,"threshold_uncertainty_score":0.016645133},"labels":[],"label_agreement":null},{"id":"W2963782874","doi":"10.4230/lipics.icalp.2017.55","title":"Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Approximation algorithm; Combinatorics; Matroid; Discrete mathematics; Rounding; Polynomial-time approximation scheme; Vertex (graph theory); Linear programming relaxation; Knapsack problem; Graph; Mathematical optimization; Linear programming; Computer science","score_opus":0.023494034116332947,"score_gpt":0.2828776831977924,"score_spread":0.25938364908145944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963782874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087361045,0.0014145115,0.8860344,0.002698142,0.00014574963,0.00017222953,0.0007475711,0.0011063183,0.020319972],"genre_scores_gemma":[0.52407694,0.0009630358,0.46113577,0.0011637126,0.00028320478,0.0002584748,0.0014289999,0.0006800449,0.0100097535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978192,0.0006862885,0.00008300643,0.00051763054,0.0005527135,0.00034108342],"domain_scores_gemma":[0.9935575,0.003364038,0.00066095276,0.0016387516,0.0004141931,0.00036455598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024495977,0.0018354083,0.0017063243,0.0010401173,0.0010290027,0.0032443146,0.0034622883,0.002262274,0.010268559],"category_scores_gemma":[0.015382332,0.0007902819,0.0019591397,0.0028686435,0.0012993284,0.0073880884,0.002593872,0.005375813,0.0014226929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080353743,0.0007277465,0.0024392153,0.0005478225,0.00013585712,0.00035238874,0.00086100755,0.49974573,0.008182337,0.3554545,0.016280038,0.114469774],"study_design_scores_gemma":[0.00005562301,0.00008809794,0.00029050693,0.00005004985,0.000027816268,0.00015561597,0.00015960193,0.78272605,0.0017400827,0.20873755,0.0059528085,0.000016154187],"about_ca_topic_score_codex":0.003864516,"about_ca_topic_score_gemma":0.0044618957,"teacher_disagreement_score":0.010268559,"about_ca_system_score_codex":0.0026932636,"about_ca_system_score_gemma":0.001591601,"threshold_uncertainty_score":0.034351766},"labels":[],"label_agreement":null},{"id":"W2963859684","doi":"10.4230/lipics.itcs.2018.22","title":"Convergence Results for Neural Networks via Electrodynamics","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Gradient descent; Electron; Convergence (economics); Node (physics); Artificial neural network; Physics; Function (biology); Equivalence (formal languages); Descent (aeronautics); Mathematics; Topology (electrical circuits); Computer science; Mathematical analysis; Quantum mechanics; Combinatorics; Discrete mathematics; Artificial intelligence","score_opus":0.011468294227940972,"score_gpt":0.25449760773054636,"score_spread":0.2430293135026054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963859684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027426658,0.0030465845,0.9432549,0.0032452412,0.00020124897,0.00007777745,0.0001334329,0.0003803124,0.022233803],"genre_scores_gemma":[0.7511125,0.00433744,0.21195966,0.0019016868,0.0006519299,0.00081226503,0.00051802216,0.00059584767,0.028110718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987483,0.000567292,0.00006137496,0.0002298362,0.0002703067,0.00012290952],"domain_scores_gemma":[0.99079996,0.0072724307,0.00039677048,0.00034889524,0.0009107307,0.0002712109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004397285,0.0018561461,0.001128846,0.0017078926,0.0009388394,0.0014254717,0.0019292663,0.0025772685,0.0051573133],"category_scores_gemma":[0.02261153,0.00075118936,0.001328512,0.00083870156,0.0033566963,0.0044125994,0.0036565564,0.004253359,0.00091100344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106060535,0.00006860981,0.0013762641,0.00028927543,0.00012932313,0.00012762961,0.00023452572,0.34531897,0.0019983375,0.62211096,0.0031246115,0.02511549],"study_design_scores_gemma":[0.000015788512,0.000044153978,0.00015837532,0.000042212378,0.000012021248,0.000028123824,0.000018281036,0.76614976,0.00041803252,0.23210016,0.001002228,0.000010957952],"about_ca_topic_score_codex":0.0030110748,"about_ca_topic_score_gemma":0.0022057425,"teacher_disagreement_score":0.0051573133,"about_ca_system_score_codex":0.0021557966,"about_ca_system_score_gemma":0.0010766182,"threshold_uncertainty_score":0.023255348},"labels":[],"label_agreement":null},{"id":"W2964036832","doi":"10.4230/lipics.wabi.2018.5","title":"Reconciling Multiple Genes Trees via Segmental Duplications and Losses","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Lambda; Tree (set theory); Gene duplication; Genome; Segmental duplication; Set (abstract data type); Time complexity; Gene; Combinatorics; Computer science; Biology; Computational complexity theory; Mathematics; Computational biology; Algorithm; Genetics; Gene family; Physics","score_opus":0.013491124354818928,"score_gpt":0.24583922955293272,"score_spread":0.2323481051981138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964036832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36677527,0.0013470504,0.6231863,0.001187727,0.00009125619,0.00013497521,0.0016198346,0.0036797153,0.0019778984],"genre_scores_gemma":[0.6082814,0.00042207327,0.38347086,0.00025861483,0.000066950706,0.00011040969,0.0051727355,0.000693271,0.001523791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987404,0.0003554076,0.00008545872,0.0004686426,0.00024036181,0.00010972635],"domain_scores_gemma":[0.9960335,0.0023467625,0.00041803642,0.00079976564,0.00026090015,0.00014107053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022489117,0.00085052155,0.0012286924,0.002566249,0.0012438844,0.001489165,0.0017570783,0.0014012128,0.0021827954],"category_scores_gemma":[0.008503122,0.0007114883,0.0014901742,0.0026120462,0.0009578719,0.0033626985,0.0021873876,0.0016479134,0.00076723576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014544382,0.00021897783,0.03642574,0.0007704768,0.0005832772,0.0022041798,0.0018536706,0.42615464,0.0514239,0.050085537,0.010180838,0.41864434],"study_design_scores_gemma":[0.00008924839,0.0001324792,0.007535405,0.00007550871,0.00019429663,0.0011795745,0.00071493007,0.8309272,0.02313251,0.123782985,0.012169313,0.00006664065],"about_ca_topic_score_codex":0.0013213677,"about_ca_topic_score_gemma":0.0019818114,"teacher_disagreement_score":0.002566249,"about_ca_system_score_codex":0.001003153,"about_ca_system_score_gemma":0.0009980462,"threshold_uncertainty_score":0.011893511},"labels":[],"label_agreement":null},{"id":"W2964076874","doi":"10.4230/lipics.approx-random.2018.5","title":"Greedy Bipartite Matching in Random Type Poisson Arrival Model","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Poisson distribution; Bipartite graph; Matching (statistics); Combinatorics; Node (physics); Type (biology); Greedy algorithm; Random graph; Competitive analysis; Mathematics; Upper and lower bounds; Discrete mathematics; Computer science; Graph; Algorithm; Statistics; Physics","score_opus":0.031064202598069954,"score_gpt":0.28945299620023374,"score_spread":0.25838879360216377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964076874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043840345,0.00025294878,0.9450998,0.0011782662,0.00018653266,0.00028937068,0.0007860635,0.00072585966,0.007640967],"genre_scores_gemma":[0.7872803,0.0008320972,0.1884852,0.0014725488,0.0004673709,0.0009238371,0.0013667296,0.00041797484,0.018753855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993725,0.0026833627,0.00019484335,0.0012021096,0.0011764177,0.0010181861],"domain_scores_gemma":[0.9895176,0.0057035927,0.0014331482,0.001732686,0.00083163695,0.0007813836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057528233,0.0013693209,0.002715462,0.0016032472,0.00100523,0.0031801427,0.007784071,0.004206001,0.008890032],"category_scores_gemma":[0.01923505,0.0012027703,0.0023734912,0.002817283,0.0020391336,0.0058354083,0.003262941,0.004290326,0.002342614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005326639,0.00024095621,0.0013876087,0.00023795974,0.00010243657,0.0004668475,0.00023138413,0.46994752,0.002852541,0.5022522,0.0063590906,0.015388821],"study_design_scores_gemma":[0.000059902606,0.000057447018,0.00016986467,0.000010445032,0.000015683603,0.00010826373,0.000030473011,0.8859249,0.00043943286,0.111914724,0.0012477264,0.00002125469],"about_ca_topic_score_codex":0.0022768397,"about_ca_topic_score_gemma":0.002000817,"teacher_disagreement_score":0.008890032,"about_ca_system_score_codex":0.0033934002,"about_ca_system_score_gemma":0.0017022137,"threshold_uncertainty_score":0.030424178},"labels":[],"label_agreement":null},{"id":"W2964084063","doi":"10.4230/lipics.ecoop.2015.101","title":"Simple and Effective Type Check Removal through Lazy Basic Block Versioning","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Software versioning; Compiler; Just-in-time compilation; JavaScript; Type inference; Python (programming language); Toolchain; Parallel computing; Software; Inference","score_opus":0.024121287491206147,"score_gpt":0.2821698156898441,"score_spread":0.258048528198638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964084063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09032282,0.0005337058,0.8584301,0.00015956056,0.00011758786,0.00016183603,0.0002795529,0.04620769,0.0037871534],"genre_scores_gemma":[0.47820312,0.0004258103,0.5034189,0.00024994442,0.00007703648,0.00018642598,0.00080804597,0.011905557,0.0047252015],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984157,0.00028840557,0.00016095249,0.0002541309,0.00067103904,0.00020975411],"domain_scores_gemma":[0.99490225,0.0013029223,0.000508986,0.002602808,0.00056008704,0.00012295926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012452743,0.0006664536,0.0006227158,0.00078590447,0.00051167374,0.0013188708,0.0015753936,0.00048663866,0.0027845637],"category_scores_gemma":[0.0060997647,0.00072950096,0.0008733806,0.0007249301,0.0009936871,0.0023977456,0.0016249446,0.00143763,0.0015494373],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096087507,0.0002924692,0.020551814,0.0008150927,0.0001733808,0.0006508691,0.0010295338,0.041444857,0.2870661,0.033512037,0.011644361,0.6018586],"study_design_scores_gemma":[0.00022767094,0.0005042346,0.0086745,0.00023310467,0.0002475985,0.0014222631,0.00015463465,0.39736715,0.49248904,0.03868454,0.059763663,0.00023163145],"about_ca_topic_score_codex":0.0014041148,"about_ca_topic_score_gemma":0.0017422339,"teacher_disagreement_score":0.0027845637,"about_ca_system_score_codex":0.00045016533,"about_ca_system_score_gemma":0.001873678,"threshold_uncertainty_score":0.009315252},"labels":[],"label_agreement":null},{"id":"W2964110985","doi":"10.4230/lipics.stacs.2014.506","title":"Space-Efficient String Indexing for Wildcard Pattern Matching","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Search engine indexing; Log-log plot; Binary logarithm; String (physics); Combinatorics; Alphabet; Mathematics; Pattern matching; Data structure; Matching (statistics); String searching algorithm; Computer science; Statistics; Information retrieval","score_opus":0.012138384331876216,"score_gpt":0.24470617512360687,"score_spread":0.23256779079173065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964110985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07356841,0.0036508928,0.8954761,0.00096575444,0.0003962576,0.00040234957,0.002847724,0.013101835,0.009590651],"genre_scores_gemma":[0.2753137,0.0014875309,0.70695966,0.0006074267,0.0003463422,0.00044023167,0.0074522444,0.0011341197,0.006258756],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967272,0.0004681241,0.0004578189,0.0004919462,0.001561548,0.00029340002],"domain_scores_gemma":[0.9931131,0.002159142,0.00050860667,0.0032458433,0.0008124152,0.0001609757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012570771,0.0007693597,0.0018064582,0.0032318071,0.00096668286,0.0026528968,0.002687653,0.0012040776,0.0073940773],"category_scores_gemma":[0.010465317,0.0005469082,0.0007434148,0.008714428,0.0011135399,0.008844637,0.0031386497,0.0012512554,0.0035707585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001301447,0.0002880118,0.0023825075,0.00064686476,0.00009383488,0.00029613977,0.00042411807,0.013100956,0.038331214,0.06848066,0.024214637,0.85043955],"study_design_scores_gemma":[0.0004489743,0.0008959286,0.0020599589,0.00022964607,0.00017388522,0.0017676045,0.0005064648,0.43100902,0.1587183,0.3147836,0.0892387,0.00016788891],"about_ca_topic_score_codex":0.0012328617,"about_ca_topic_score_gemma":0.0013986157,"teacher_disagreement_score":0.0073940773,"about_ca_system_score_codex":0.001265616,"about_ca_system_score_gemma":0.0017218556,"threshold_uncertainty_score":0.02473563},"labels":[],"label_agreement":null},{"id":"W2964334818","doi":"10.4230/lipics.socg.2016.19","title":"On Visibility Representations of Non-Planar Graphs","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Combinatorics; Embedding; Book embedding; Time complexity; Mathematics; Discrete mathematics; Rectangle; Visibility; 1-planar graph; Computer science; Graph; Chordal graph; Geometry; Artificial intelligence; Physics","score_opus":0.013139787585957508,"score_gpt":0.27598739435984493,"score_spread":0.2628476067738874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964334818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16469315,0.0006902347,0.8249366,0.0008692947,0.00006315158,0.00015636803,0.0007693005,0.0012540922,0.006567756],"genre_scores_gemma":[0.6894175,0.0011162726,0.30064416,0.0002649057,0.00016381603,0.00027202754,0.0034182381,0.00044032396,0.004262832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974497,0.0007913969,0.00018975437,0.0006242903,0.0005912244,0.00035363057],"domain_scores_gemma":[0.99020445,0.006196363,0.0013082052,0.0016171271,0.0004377085,0.00023612287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097329,0.0011082725,0.00089203747,0.0012065892,0.00066808186,0.0026190148,0.0019483652,0.001320347,0.005358356],"category_scores_gemma":[0.0110415695,0.0006949585,0.0011617319,0.0024612632,0.0020414053,0.006857023,0.0026896219,0.0025207095,0.000846291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007375189,0.00030539572,0.002420039,0.0005486049,0.000071476716,0.0006588648,0.0012214163,0.31954777,0.021086056,0.4963643,0.0055344077,0.15150423],"study_design_scores_gemma":[0.000103034545,0.00020021445,0.0007141628,0.00010827512,0.00003842457,0.0003873194,0.00031278768,0.433873,0.0077093323,0.5511704,0.0053346185,0.000048383747],"about_ca_topic_score_codex":0.0012652158,"about_ca_topic_score_gemma":0.0013103443,"teacher_disagreement_score":0.005358356,"about_ca_system_score_codex":0.0011611262,"about_ca_system_score_gemma":0.0005307351,"threshold_uncertainty_score":0.0179255},"labels":[],"label_agreement":null},{"id":"W2965349778","doi":"10.4230/lipics.icalp.2019.84","title":"Short Proofs Are Hard to Find","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Educational Assessment and Pedagogy","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Mathematical proof; Computer science; Mathematics","score_opus":0.045337903897074434,"score_gpt":0.37259746939666527,"score_spread":0.32725956549959084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965349778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022874584,0.014647967,0.7316297,0.048328456,0.004971839,0.0009007578,0.0069341543,0.016738415,0.15297411],"genre_scores_gemma":[0.3779912,0.014168351,0.42153674,0.016223459,0.004432944,0.0014965311,0.011773093,0.012485766,0.13989195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876989,0.0030227515,0.0009666437,0.003163146,0.0040521603,0.0010964252],"domain_scores_gemma":[0.89803743,0.071866415,0.005268546,0.016837252,0.0064254976,0.0015647872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007908118,0.0023955796,0.0022806462,0.003384494,0.004862883,0.009852098,0.0034787613,0.0037216293,0.10587624],"category_scores_gemma":[0.07252703,0.003371448,0.003079132,0.0052143447,0.004115095,0.032154158,0.010726431,0.00840799,0.044180863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005989936,0.0001602222,0.0010783289,0.002669357,0.00029690762,0.00080001773,0.00096410967,0.0049244463,0.004819744,0.6179987,0.15195185,0.21373732],"study_design_scores_gemma":[0.00008547879,0.000043979064,0.00018918417,0.00025593443,0.000076403645,0.00066785567,0.00019338448,0.00479746,0.0025185377,0.8557065,0.13541001,0.000055321947],"about_ca_topic_score_codex":0.0009880287,"about_ca_topic_score_gemma":0.0012741636,"teacher_disagreement_score":0.10587624,"about_ca_system_score_codex":0.0031548578,"about_ca_system_score_gemma":0.0027991761,"threshold_uncertainty_score":0.3541913},"labels":[],"label_agreement":null},{"id":"W2965474919","doi":"10.4230/lipics.ccc.2019.1","title":"Criticality of Regular Formulas","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Boolean function; Upper and lower bounds; Satisfiability; Discrete mathematics; Bounded function; Criticality; Function (biology); Pigeonhole principle; Lemma (botany); Tree (set theory); Class (philosophy); Computer science","score_opus":0.01088334422631499,"score_gpt":0.24616431488463897,"score_spread":0.23528097065832398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965474919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73683673,0.0018925839,0.21687134,0.0017751192,0.00013870183,0.00024145983,0.0015182531,0.0012172997,0.0395085],"genre_scores_gemma":[0.98320454,0.00028366948,0.012242597,0.00035532078,0.00015040107,0.0001195521,0.000533408,0.000119900345,0.0029905064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998162,0.00021427344,0.00010648343,0.0006069208,0.00050503423,0.00040531287],"domain_scores_gemma":[0.9833745,0.0115975775,0.0015317522,0.0011028583,0.00139614,0.0009970771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012186372,0.0006312627,0.00081013987,0.002486006,0.0010902035,0.0025724398,0.0012112049,0.00063467113,0.0057449522],"category_scores_gemma":[0.015690528,0.0005195135,0.00075549056,0.0009457064,0.0024357708,0.0033924652,0.0017370773,0.0021212294,0.000528033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013082299,0.000231748,0.019064654,0.000738708,0.0001694976,0.001238476,0.0014165789,0.041132063,0.047257353,0.78736115,0.009388436,0.09069314],"study_design_scores_gemma":[0.00013723077,0.00027412738,0.003951905,0.00011813391,0.00012217995,0.0011959292,0.00025165803,0.1611007,0.028365895,0.7938765,0.010532892,0.00007286498],"about_ca_topic_score_codex":0.0016535368,"about_ca_topic_score_gemma":0.0011603058,"teacher_disagreement_score":0.0057449522,"about_ca_system_score_codex":0.0024059173,"about_ca_system_score_gemma":0.0011395643,"threshold_uncertainty_score":0.019218802},"labels":[],"label_agreement":null},{"id":"W2965627508","doi":"10.4230/lipics.ecrts.2019.4","title":"PREM-Based Optimal Task Segmentation Under Fixed Priority Scheduling","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Compiler; Computation; Parallel computing; Scheduling (production processes); Task (project management); Task analysis; Theoretical computer science; Algorithm; Programming language; Mathematical optimization","score_opus":0.012539583983443844,"score_gpt":0.26311127491193836,"score_spread":0.2505716909284945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965627508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090121426,0.00065724365,0.89959574,0.00024607402,0.00009425954,0.00015987411,0.0001826598,0.0033202008,0.005622521],"genre_scores_gemma":[0.629776,0.00014710611,0.36719677,0.000149922,0.00003403129,0.00013937852,0.00034645144,0.00038264671,0.0018276976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992551,0.00017004512,0.00003690596,0.00018690075,0.00015149693,0.0001994752],"domain_scores_gemma":[0.99903834,0.00043632343,0.000117957185,0.00015953321,0.0001493377,0.00009855635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010098529,0.00085159234,0.00085083354,0.000860336,0.0005782709,0.0008783345,0.0012907904,0.0006121268,0.0021728189],"category_scores_gemma":[0.0023806342,0.00047054602,0.0004646079,0.0007260366,0.00064983167,0.00088711584,0.0007187181,0.00080890756,0.00046586583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092959875,0.00023242207,0.0017110499,0.0002277476,0.000043463653,0.00016380312,0.00021187877,0.7526582,0.025305625,0.017158488,0.004977051,0.19638067],"study_design_scores_gemma":[0.000034963203,0.00008431827,0.00019198594,0.000009297606,0.000012164993,0.000030848885,0.00002763415,0.98705345,0.0040650726,0.0075869914,0.00089589227,0.000007374826],"about_ca_topic_score_codex":0.0036374915,"about_ca_topic_score_gemma":0.0057313577,"teacher_disagreement_score":0.0036374915,"about_ca_system_score_codex":0.0011729242,"about_ca_system_score_gemma":0.0028508257,"threshold_uncertainty_score":0.008510232},"labels":[],"label_agreement":null},{"id":"W2965722881","doi":"10.4230/lipics.ccc.2019.29","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bounded function; Function (biology); Randomized algorithm; Communication complexity; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.022314205953207728,"score_gpt":0.28291295491487933,"score_spread":0.2605987489616716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965722881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082975134,0.0023344602,0.8636179,0.010188518,0.0003285934,0.00027174043,0.0012215935,0.002172075,0.036890067],"genre_scores_gemma":[0.79172033,0.0014998963,0.18426123,0.0034401861,0.0011410282,0.0010973403,0.0014253185,0.0013809162,0.014033684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9816651,0.0054848013,0.00083095755,0.0040234327,0.0053765825,0.0026191652],"domain_scores_gemma":[0.9117302,0.06800141,0.0026237322,0.012036547,0.003308086,0.002300033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009937334,0.0026262314,0.003394947,0.0019246761,0.0019704003,0.006321714,0.0056692227,0.0029544807,0.016345555],"category_scores_gemma":[0.06809301,0.0013813659,0.0036052677,0.003152049,0.0065872124,0.022071421,0.010314232,0.009990661,0.0031574697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015198449,0.0005330705,0.003000285,0.00068219966,0.00017575949,0.000216651,0.0005541359,0.093790375,0.0058065993,0.81010336,0.014693667,0.068924084],"study_design_scores_gemma":[0.00019051103,0.00010932671,0.00065195013,0.000054882563,0.00008297791,0.0001519879,0.000087457855,0.3238995,0.0036800618,0.66824675,0.0027929111,0.000051773357],"about_ca_topic_score_codex":0.0021109811,"about_ca_topic_score_gemma":0.0018860552,"teacher_disagreement_score":0.016345555,"about_ca_system_score_codex":0.0072544278,"about_ca_system_score_gemma":0.0060592904,"threshold_uncertainty_score":0.05468136},"labels":[],"label_agreement":null},{"id":"W2966029787","doi":"10.4230/lipics.ccc.2019.25","title":"Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Gas meter prover; Operator (biology); Upper and lower bounds; Soundness; Mathematics; Completeness (order theory); Discrete mathematics; Value (mathematics); Class (philosophy); Complexity class; Combinatorics; Time complexity; Computer science","score_opus":0.015284144150633644,"score_gpt":0.2675084582222198,"score_spread":0.2522243140715862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966029787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18874404,0.0007675053,0.7880894,0.0026709845,0.00010305956,0.00025552287,0.00041425807,0.0015202579,0.017435012],"genre_scores_gemma":[0.8710938,0.00044426767,0.12149492,0.00053228653,0.00017451664,0.0003895636,0.00057159323,0.00039818202,0.004900872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99278474,0.0018378984,0.00033145974,0.0016304855,0.0021576448,0.0012577609],"domain_scores_gemma":[0.9545707,0.03581267,0.0018401311,0.005541241,0.001282354,0.0009529083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005420788,0.001550717,0.0022519438,0.0013649298,0.0013426649,0.005356402,0.004293362,0.0017391391,0.0073164552],"category_scores_gemma":[0.03429943,0.0007631945,0.002927425,0.001268617,0.0051542097,0.012991715,0.0061863344,0.007492837,0.0010307826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079824985,0.0002587384,0.0036009701,0.00056501915,0.00019328666,0.0002852465,0.00095766684,0.33505496,0.007187182,0.60787135,0.003338769,0.039888505],"study_design_scores_gemma":[0.00004260523,0.000060088903,0.00029629603,0.000034892633,0.00003539226,0.000051166222,0.000058457073,0.5984746,0.0030427484,0.39713982,0.0007371826,0.00002674798],"about_ca_topic_score_codex":0.002791386,"about_ca_topic_score_gemma":0.0029394177,"teacher_disagreement_score":0.0073164552,"about_ca_system_score_codex":0.005849373,"about_ca_system_score_gemma":0.0038667615,"threshold_uncertainty_score":0.042440414},"labels":[],"label_agreement":null},{"id":"W2968697199","doi":"10.4230/lipics.mfcs.2020.26","title":"Span Programs and Quantum Time Complexity","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Span (engineering); Computer science; Structural engineering; Engineering","score_opus":0.03405248869646342,"score_gpt":0.2589164173791722,"score_spread":0.22486392868270877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968697199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11825992,0.0006951357,0.8219407,0.003553924,0.00018406268,0.00014612667,0.00038145474,0.00143187,0.0534068],"genre_scores_gemma":[0.7658028,0.0008305945,0.21427886,0.0012205667,0.0003032045,0.00054990593,0.00054660573,0.00064348086,0.015823863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975751,0.0005263741,0.00011152041,0.00055635325,0.00082576677,0.00040489918],"domain_scores_gemma":[0.99519086,0.003076685,0.0002541449,0.0008091904,0.0005093627,0.00015988901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011765363,0.00047107827,0.00050960877,0.000762748,0.0009769249,0.0020537581,0.0010467346,0.0010274784,0.007079153],"category_scores_gemma":[0.0073318896,0.00036187022,0.0012800595,0.0011169178,0.003030179,0.0061807116,0.0022800323,0.0036384838,0.0005355694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032729527,0.000025841995,0.00016920311,0.000051974705,0.000009726478,0.000030883373,0.00013191672,0.008511637,0.0012341744,0.97940344,0.0009248393,0.009473651],"study_design_scores_gemma":[0.00002169146,0.00003818489,0.00022281964,0.000020444493,0.000014419811,0.000041999054,0.000038240138,0.068309344,0.0024701855,0.92226845,0.0065404265,0.00001386655],"about_ca_topic_score_codex":0.0017948946,"about_ca_topic_score_gemma":0.0010590163,"teacher_disagreement_score":0.007079153,"about_ca_system_score_codex":0.0023082,"about_ca_system_score_gemma":0.0012990333,"threshold_uncertainty_score":0.023682117},"labels":[],"label_agreement":null},{"id":"W2970633507","doi":"10.4230/lipics.swat.2020.12","title":"A Simple Algorithm for Minimum Cuts in Near-Linear Time","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minimum cut; Combinatorics; Simple (philosophy); Subroutine; Vertex (graph theory); Time complexity; Undirected graph; Minimum spanning tree; Spanning tree; Mathematics; Running time; Algorithm; Matching (statistics); Graph; Enhanced Data Rates for GSM Evolution; Computer science","score_opus":0.021239953373996097,"score_gpt":0.30963520775811404,"score_spread":0.28839525438411795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970633507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002786212,0.00025833858,0.98554915,0.0003178546,0.00013465603,0.00021160078,0.00028589583,0.0053178295,0.005138436],"genre_scores_gemma":[0.024195384,0.0001727587,0.9682009,0.00023954266,0.00008589652,0.0004189028,0.0010735136,0.0009723504,0.0046407823],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997251,0.00037936677,0.00021084916,0.0007718709,0.0010834119,0.00030356576],"domain_scores_gemma":[0.9971739,0.001122636,0.00017301044,0.00088488334,0.00048212928,0.00016343161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011864303,0.0027828973,0.0014308841,0.0020436193,0.0010557349,0.0020562205,0.0037768753,0.0027293868,0.03218807],"category_scores_gemma":[0.007704468,0.0014766369,0.0019091443,0.0032175544,0.0010613297,0.0059205247,0.0042070835,0.004453353,0.013384523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004591212,0.00038621805,0.00049261237,0.0007513462,0.00015237152,0.00026105173,0.00025357655,0.031951647,0.024982933,0.074713595,0.048935413,0.81666017],"study_design_scores_gemma":[0.0008151288,0.00043801215,0.00078085007,0.00015549181,0.00015572258,0.0015125759,0.00016663724,0.38294312,0.02374675,0.5020834,0.08701626,0.00018607023],"about_ca_topic_score_codex":0.0012695277,"about_ca_topic_score_gemma":0.0020950225,"teacher_disagreement_score":0.03218807,"about_ca_system_score_codex":0.0011446538,"about_ca_system_score_gemma":0.0014678157,"threshold_uncertainty_score":0.107679784},"labels":[],"label_agreement":null},{"id":"W2970698689","doi":"10.4230/lipics.concur.2019.31","title":"Expressive Power of Broadcast Consensus Protocols","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Unary operation; Computer science; Class (philosophy); Population; Theoretical computer science; Decidability; Protocol (science); Atomic broadcast; Expressive power; Computation; Power (physics); Distributed computing; Discrete mathematics; Broadcasting (networking); Algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.01223587976930665,"score_gpt":0.26594943568258356,"score_spread":0.25371355591327693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970698689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13416809,0.0012728216,0.7839149,0.0054485793,0.00016781941,0.00018376806,0.0007634814,0.001083274,0.07299715],"genre_scores_gemma":[0.93846256,0.0006606192,0.050770625,0.00054719066,0.00021900958,0.00045558802,0.00046484935,0.00017516139,0.00824436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936498,0.0022118734,0.00043103757,0.0009725891,0.002279595,0.00045505332],"domain_scores_gemma":[0.9885222,0.008118692,0.0005693794,0.0017554167,0.00067129865,0.0003630337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004895981,0.0005231176,0.000855112,0.0008229343,0.0010659305,0.004061879,0.0019163414,0.0012071293,0.002708548],"category_scores_gemma":[0.016135173,0.0006383203,0.0011404,0.0010173818,0.0041577066,0.0072822664,0.00527736,0.0039742608,0.0003809435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001295855,0.000036058078,0.0003101121,0.00012510712,0.000027321988,0.00015890585,0.0009855437,0.021367295,0.0042981966,0.9602935,0.0011000942,0.0111683775],"study_design_scores_gemma":[0.00007468844,0.000031428768,0.00009668297,0.000039069113,0.000030549607,0.00009564529,0.00012842537,0.09154295,0.0028582595,0.89748025,0.007606257,0.000015780486],"about_ca_topic_score_codex":0.0008665398,"about_ca_topic_score_gemma":0.0004635449,"teacher_disagreement_score":0.004895981,"about_ca_system_score_codex":0.0015845448,"about_ca_system_score_gemma":0.0010618722,"threshold_uncertainty_score":0.025892735},"labels":[],"label_agreement":null},{"id":"W2970703080","doi":"10.4230/lipics.mfcs.2019.60","title":"Approximate Counting CSP Seen from the Other Side","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science","score_opus":0.010326148565543786,"score_gpt":0.2228140260968382,"score_spread":0.21248787753129442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970703080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11245846,0.0018775873,0.8273733,0.013262036,0.00066105917,0.0003632708,0.0017253766,0.0039072875,0.03837159],"genre_scores_gemma":[0.741498,0.0008451564,0.22933917,0.002887934,0.00070459116,0.00047807678,0.0023496859,0.00096592953,0.020931484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913769,0.002345773,0.0004023691,0.0020883216,0.0027700828,0.0010165996],"domain_scores_gemma":[0.9811725,0.012301589,0.00093608716,0.00380671,0.0011514134,0.0006316778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029278982,0.0011627959,0.0023776046,0.00092898915,0.0016343863,0.0058556926,0.0031052937,0.0029825142,0.0223284],"category_scores_gemma":[0.024231285,0.00074878143,0.0023933346,0.0026904177,0.0032684417,0.016691472,0.004547426,0.0073787784,0.0021416927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010487578,0.00029068138,0.0018909425,0.00073815504,0.00016714241,0.00051237625,0.0005701497,0.100389086,0.006364927,0.76805973,0.020084875,0.09988317],"study_design_scores_gemma":[0.00008742447,0.00007118813,0.00025091605,0.000038288472,0.000064059815,0.00029297694,0.00016502907,0.38230613,0.0029668414,0.6062432,0.007476589,0.00003735489],"about_ca_topic_score_codex":0.0050182324,"about_ca_topic_score_gemma":0.005682848,"teacher_disagreement_score":0.0223284,"about_ca_system_score_codex":0.002850838,"about_ca_system_score_gemma":0.0031761636,"threshold_uncertainty_score":0.074695945},"labels":[],"label_agreement":null},{"id":"W2971070621","doi":"10.4230/lipics.concur.2019.9","title":"Computing Probabilistic Bisimilarity Distances for Probabilistic Automata","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Probabilistic logic; Computer science; Probabilistic automaton; Automaton; Theoretical computer science; Artificial intelligence","score_opus":0.011532384648756541,"score_gpt":0.2636695619378635,"score_spread":0.25213717728910695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971070621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057571292,0.000099909215,0.9400107,0.0001772568,0.00003141724,0.00008945485,0.00012257676,0.0005342207,0.0013630502],"genre_scores_gemma":[0.57581836,0.00011646833,0.4212777,0.00015330936,0.00003914165,0.00025444385,0.00045007648,0.0002094996,0.0016809927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951845,0.0014009749,0.0005024987,0.0013820792,0.0011942742,0.00033559775],"domain_scores_gemma":[0.9886352,0.007715312,0.00084425486,0.0014217709,0.00096092344,0.0004226013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030208302,0.0009937249,0.0011837223,0.0022028522,0.00092110445,0.002595654,0.0018595532,0.002028804,0.0031617035],"category_scores_gemma":[0.024741326,0.00066711515,0.0014203456,0.0014513244,0.0026581136,0.00563705,0.0043590073,0.0028861812,0.0006783508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031595063,0.00015360203,0.0023146868,0.00027168938,0.00011831314,0.0001289916,0.00057567016,0.22422516,0.009838816,0.6576885,0.0011683789,0.10320032],"study_design_scores_gemma":[0.000025175037,0.00007357354,0.00019518328,0.00001935387,0.000016241425,0.000047866175,0.00004844195,0.5049061,0.005636772,0.4878343,0.0011658589,0.00003108987],"about_ca_topic_score_codex":0.0010113973,"about_ca_topic_score_gemma":0.0011570062,"teacher_disagreement_score":0.0031617035,"about_ca_system_score_codex":0.002220338,"about_ca_system_score_gemma":0.0018171524,"threshold_uncertainty_score":0.016109705},"labels":[],"label_agreement":null},{"id":"W2973098730","doi":"10.4230/lipics.mfcs.2020.20","title":"Homomorphisms of signed graphs: An update","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Grantová Agentura, Univerzita Karlova; European Commission; Univerzita Karlova v Praze","keywords":"Signed graph; Combinatorics; Homomorphism; Graph homomorphism; Mathematics; Discrete mathematics; Adjacency list; Graph; Line graph; Graph power","score_opus":0.024735935971948956,"score_gpt":0.2980308278716488,"score_spread":0.27329489189969985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973098730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02543602,0.004315428,0.88232017,0.004319855,0.004414254,0.00020272651,0.0020196785,0.0023148044,0.074657045],"genre_scores_gemma":[0.3010892,0.0061629526,0.626123,0.0020132305,0.004249156,0.00026838476,0.0029100904,0.0013023103,0.055881687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983753,0.0003189707,0.00012459485,0.0006056086,0.00046879932,0.0001066789],"domain_scores_gemma":[0.9961767,0.001279571,0.0001411425,0.0015781106,0.00067888614,0.0001454682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015088544,0.0007271279,0.00067204854,0.0020436826,0.0013303314,0.003299454,0.0019243631,0.0009981756,0.0155325765],"category_scores_gemma":[0.009950192,0.0007541846,0.0013084406,0.0024210152,0.0019854777,0.011449174,0.0031056495,0.0034891262,0.0042631226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010004366,0.00009961789,0.00058721314,0.00019817206,0.00003098091,0.00014384376,0.00030716797,0.0037672948,0.0024978665,0.7482457,0.024030507,0.21999153],"study_design_scores_gemma":[0.00002976482,0.00007998028,0.0006906073,0.0000851825,0.00005526352,0.0006060808,0.00016896949,0.029279381,0.004832706,0.77916086,0.18495038,0.000060863716],"about_ca_topic_score_codex":0.0019135298,"about_ca_topic_score_gemma":0.0022629544,"teacher_disagreement_score":0.0155325765,"about_ca_system_score_codex":0.0018993121,"about_ca_system_score_gemma":0.0010715143,"threshold_uncertainty_score":0.05196166},"labels":[],"label_agreement":null},{"id":"W2975226411","doi":"10.4230/lipics.socg.2016.63","title":"Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Information and Communications Technology Promotion; Natural Sciences and Engineering Research Council of Canada; Center for Massive Data Algorithmics; Korea Advanced Institute of Science and Technology; National Research Foundation of Korea; Danmarks Grundforskningsfond; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Mathematics; Regular polygon; Combinatorics; Pure mathematics; Geometry","score_opus":0.04886053309053268,"score_gpt":0.2961416573089014,"score_spread":0.24728112421836873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975226411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09003729,0.00013435853,0.90812856,0.00013781774,0.000026806336,0.00004210288,0.00007742465,0.00019888156,0.0012167727],"genre_scores_gemma":[0.6825017,0.00036206184,0.31340247,0.00009479898,0.000095136165,0.00015971177,0.00044974836,0.00032500204,0.0026094944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979328,0.0005932971,0.000110546636,0.0004292061,0.00077150075,0.00016271695],"domain_scores_gemma":[0.9933275,0.0041303826,0.0008189576,0.0008994618,0.00055164093,0.00027198007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036136738,0.0011151221,0.0018879395,0.0020891689,0.0004506849,0.0024385033,0.0020833495,0.0013728151,0.0017743348],"category_scores_gemma":[0.013713745,0.0008300977,0.0015005457,0.0015490346,0.0036997243,0.0029993595,0.0035937103,0.00242327,0.00032947512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003398957,0.00008274902,0.0018706338,0.00013094638,0.0000750695,0.00015706525,0.0002457892,0.7835964,0.011446378,0.14273942,0.00082191714,0.0584937],"study_design_scores_gemma":[0.000010991455,0.00006224447,0.00025150948,0.000010001861,0.0000059732038,0.00003332491,0.000024086801,0.95260626,0.0023873148,0.044358853,0.00023828726,0.000011096598],"about_ca_topic_score_codex":0.001896584,"about_ca_topic_score_gemma":0.0012433567,"teacher_disagreement_score":0.0036136738,"about_ca_system_score_codex":0.002122957,"about_ca_system_score_gemma":0.00086569105,"threshold_uncertainty_score":0.019111216},"labels":[],"label_agreement":null},{"id":"W2977350080","doi":"10.4230/lipics.approx-random.2019.56","title":"String Matching: Communication, Circuits, and Learning","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"String searching algorithm; Upper and lower bounds; VC dimension; Communication complexity; Matching (statistics); String (physics); Sample complexity; Mathematics; Computational complexity theory; Circuit complexity; Pattern matching; Dimension (graph theory); Classifier (UML); Discrete mathematics; Theoretical computer science; Computer science; Electronic circuit; Algorithm; Combinatorics; Artificial intelligence","score_opus":0.009260590006367071,"score_gpt":0.23186566141304576,"score_spread":0.2226050714066787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977350080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104195565,0.010482106,0.82668424,0.01688923,0.000612965,0.0002840525,0.0012578156,0.0015770788,0.038017087],"genre_scores_gemma":[0.7592721,0.007292592,0.20801617,0.0021188646,0.0017604484,0.00068319973,0.0018741492,0.00049108686,0.018491354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950873,0.0015320585,0.00025482124,0.0012013996,0.0013002261,0.0006241398],"domain_scores_gemma":[0.9697667,0.02456714,0.0014844221,0.002887587,0.000778472,0.00051569106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00302425,0.0014499968,0.0016280334,0.0016176692,0.0015462281,0.0059411423,0.0028595903,0.003951639,0.008731903],"category_scores_gemma":[0.026355868,0.0007657026,0.0011332683,0.0043581966,0.005366049,0.014897698,0.003260267,0.0050013117,0.0013296385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060285925,0.00024147013,0.00176703,0.0005229793,0.000089921195,0.0001437197,0.00022314879,0.18670012,0.0038958073,0.61344105,0.01540749,0.17696449],"study_design_scores_gemma":[0.00005117033,0.00006493363,0.0003907915,0.00006317107,0.00002289699,0.00010447063,0.000059446484,0.27681634,0.0037227636,0.71352124,0.0051542995,0.00002858215],"about_ca_topic_score_codex":0.0025336635,"about_ca_topic_score_gemma":0.0017779581,"teacher_disagreement_score":0.008731903,"about_ca_system_score_codex":0.0058950353,"about_ca_system_score_gemma":0.0025396468,"threshold_uncertainty_score":0.042771637},"labels":[],"label_agreement":null},{"id":"W2979929440","doi":"10.4230/lipics.tqc.2020.4","title":"Uncloneable Quantum Encryption via Oracles","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Computer science; Pseudorandom function family; Theoretical computer science; Quantum cryptography; Random oracle; Quantum; Probabilistic encryption; Cryptography; Quantum information; Computer security; Public-key cryptography; Physics; Quantum mechanics","score_opus":0.013423494992439852,"score_gpt":0.2472337597318089,"score_spread":0.23381026473936903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979929440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099984095,0.00081490586,0.8615865,0.0018203873,0.0001486055,0.00012198592,0.00021861162,0.0005891438,0.034715686],"genre_scores_gemma":[0.8879367,0.00074816233,0.095833294,0.00038932523,0.00010079945,0.00019135271,0.0002019334,0.0002178481,0.014380581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970726,0.0009109083,0.000196487,0.00048795345,0.00088165666,0.00045033408],"domain_scores_gemma":[0.9960063,0.0020470698,0.00032459805,0.0011018146,0.00032660275,0.00019361886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021204716,0.000651119,0.0007632265,0.00074862124,0.0006813626,0.0025853922,0.0017251234,0.0015151565,0.0059570945],"category_scores_gemma":[0.006531095,0.0004790049,0.0009018423,0.00068972696,0.0045213588,0.0082011875,0.0043747784,0.0035469334,0.001337145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045721597,0.000015655929,0.00008510288,0.00003697214,0.0000043721125,0.000052398424,0.00009304665,0.00320902,0.0015987225,0.9907081,0.0003199423,0.0038308427],"study_design_scores_gemma":[0.00004238652,0.000053392236,0.00010299242,0.000044832235,0.0000150305,0.00018909975,0.00004308876,0.09460903,0.013900133,0.8836824,0.0072836867,0.00003389706],"about_ca_topic_score_codex":0.00042228765,"about_ca_topic_score_gemma":0.00034312642,"teacher_disagreement_score":0.0059570945,"about_ca_system_score_codex":0.0013944468,"about_ca_system_score_gemma":0.00091412145,"threshold_uncertainty_score":0.019928455},"labels":[],"label_agreement":null},{"id":"W2980088699","doi":"10.4230/lipics.csl.2020.17","title":"Tangent Categories from the Coalgebras of Differential Categories","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Calgary","funders":"Clarendon Fund; Natural Sciences and Engineering Research Council of Canada; DeepMind","keywords":"Mathematics; Category of groups; Closed category; Differential (mechanical device); Category theory; Tangent; Pure mathematics; Concrete category; Derived category; Biproduct; Equivalence of categories; Algebra over a field; Enriched category; Abelian group; Abelian category; Geometry; Functor","score_opus":0.03294372047147163,"score_gpt":0.29455122918852883,"score_spread":0.2616075087170572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980088699","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1085329,0.0072952113,0.52517366,0.0046644313,0.0010181605,0.000098705845,0.0010904663,0.0007808413,0.3513456],"genre_scores_gemma":[0.8789193,0.0034056117,0.061837003,0.001246944,0.00084475754,0.00014738721,0.001140663,0.00030503768,0.052153286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900204,0.00025477362,0.00006603604,0.00016620658,0.00041375146,0.0000971807],"domain_scores_gemma":[0.99880147,0.0003924692,0.000085193285,0.00019175748,0.0003321571,0.00019684009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010040613,0.00040174767,0.00030813736,0.0019813767,0.0013065272,0.0036263946,0.0006572013,0.0006488273,0.011457683],"category_scores_gemma":[0.0023232799,0.00027312755,0.00053592457,0.0011778068,0.0040121544,0.009736495,0.0037342773,0.002056797,0.0014324903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029463338,0.00000195225,0.00006924698,0.000017551107,0.0000017204409,0.000019829415,0.00023122776,0.00007016073,0.00024619442,0.9957806,0.0006423187,0.0029162616],"study_design_scores_gemma":[0.000002989459,0.0000056856006,0.00019506099,0.0000101304495,0.0000019282854,0.0001084339,0.00016211643,0.00044978198,0.00030395557,0.9735363,0.025217589,0.000006088931],"about_ca_topic_score_codex":0.00081043056,"about_ca_topic_score_gemma":0.000817692,"teacher_disagreement_score":0.011457683,"about_ca_system_score_codex":0.001267749,"about_ca_system_score_gemma":0.0007611659,"threshold_uncertainty_score":0.03832978},"labels":[],"label_agreement":null},{"id":"W2982393288","doi":"10.4230/lipics.ccc.2020.12","title":"Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Invariant (physics); Invariant theory; Conjecture; Mathematics; Computational complexity theory; Algebraic number; Proof complexity; Polynomial ring; Algebra over a field; Discrete mathematics; Theoretical computer science; Polynomial; Pure mathematics; Computer science; Algorithm; Mathematical proof","score_opus":0.06788203052079886,"score_gpt":0.2681875824002677,"score_spread":0.20030555187946883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982393288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39629924,0.002499722,0.53763986,0.025987294,0.0002414603,0.00042594798,0.0030706287,0.0015359484,0.032299813],"genre_scores_gemma":[0.8553589,0.0013496627,0.13098073,0.0011631154,0.00042488365,0.00028462187,0.0024500361,0.000329681,0.00765835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971831,0.00095766725,0.00017900743,0.0006943838,0.00059536926,0.00039059273],"domain_scores_gemma":[0.97322494,0.02299411,0.001081828,0.0017164027,0.00055911456,0.00042357648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00289355,0.0006654076,0.001114701,0.0015891016,0.002066539,0.005819764,0.0024791416,0.0020863386,0.010201878],"category_scores_gemma":[0.021325495,0.0005437497,0.0018283825,0.0030319283,0.005018842,0.016377296,0.0033063786,0.0051134718,0.00082255446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027410526,0.00019104576,0.0023792111,0.00055543485,0.00006248585,0.00027912334,0.0007806577,0.044498183,0.0018612731,0.8785471,0.009143741,0.061427772],"study_design_scores_gemma":[0.00004747054,0.000038109218,0.0003232701,0.000032374563,0.00003268638,0.00015106045,0.00027623028,0.053696223,0.002235891,0.9401904,0.0029525927,0.00002367955],"about_ca_topic_score_codex":0.0022647327,"about_ca_topic_score_gemma":0.0024559048,"teacher_disagreement_score":0.010201878,"about_ca_system_score_codex":0.0038576752,"about_ca_system_score_gemma":0.0024637147,"threshold_uncertainty_score":0.034128666},"labels":[],"label_agreement":null},{"id":"W2982703654","doi":"10.4230/lipics.disc.2019.26","title":"The Complexity of Symmetry Breaking in Massive Graphs","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Omega; Combinatorics; Upper and lower bounds; Symmetry breaking; Graph; Algorithm; Mathematics; Time complexity; Discrete mathematics; Physics; Particle physics; Mathematical analysis","score_opus":0.022236742729631654,"score_gpt":0.26792577825810493,"score_spread":0.24568903552847327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982703654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5653291,0.00076101953,0.40296847,0.0056411745,0.00019508798,0.0003849999,0.0022810553,0.0035444757,0.018894633],"genre_scores_gemma":[0.9178756,0.00035064082,0.07357475,0.000518044,0.0001489123,0.0003004911,0.0020297733,0.00050404883,0.0046977093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953603,0.0014229913,0.00023582573,0.001022836,0.0011552046,0.00080287445],"domain_scores_gemma":[0.9735865,0.016382357,0.002052574,0.006116586,0.0008687238,0.0009932901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024755087,0.0008618995,0.0018002146,0.0009762001,0.0019796009,0.003766816,0.0036076528,0.0017589596,0.008952907],"category_scores_gemma":[0.023455236,0.0009897589,0.0020760628,0.0016160989,0.0024473497,0.007673728,0.0032537375,0.0038924816,0.0015320954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013775524,0.00034084913,0.0062534204,0.00058322423,0.00022587947,0.00067562674,0.0008992709,0.44372714,0.009294862,0.43447703,0.02210283,0.080042355],"study_design_scores_gemma":[0.000082080966,0.000036414494,0.0006594067,0.000018930868,0.000026708214,0.00010693234,0.00012568064,0.510254,0.001870387,0.48546946,0.0013243016,0.000025664422],"about_ca_topic_score_codex":0.004235815,"about_ca_topic_score_gemma":0.0030200118,"teacher_disagreement_score":0.008952907,"about_ca_system_score_codex":0.0029815002,"about_ca_system_score_gemma":0.00223525,"threshold_uncertainty_score":0.0299505},"labels":[],"label_agreement":null},{"id":"W2989796728","doi":"10.4230/lipics.opodis.2019.16","title":"Byzantine-Tolerant Set-Constrained Delivery Broadcast","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Set (abstract data type); Object (grammar); Mathematics; Discrete mathematics; Combinatorics; Task (project management); Computer science; Artificial intelligence","score_opus":0.030149361340502206,"score_gpt":0.26389688453854215,"score_spread":0.23374752319803996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989796728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10251684,0.0008104509,0.86196154,0.0017605027,0.00040273546,0.00051923667,0.0013012293,0.0061184503,0.024608985],"genre_scores_gemma":[0.784676,0.00044117923,0.18481898,0.0009585847,0.00018173773,0.00053643837,0.0016902463,0.0006705236,0.026026282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675435,0.00066295697,0.00025112607,0.0007971303,0.00095131947,0.00058313104],"domain_scores_gemma":[0.9935441,0.0023813262,0.0005979974,0.002340875,0.0008537349,0.00028197764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021920677,0.00089228735,0.0015946021,0.0006989074,0.0017962313,0.0026233029,0.0027395359,0.0014299613,0.0075236517],"category_scores_gemma":[0.007831935,0.0005590735,0.0011673054,0.0010503052,0.0014349418,0.005385094,0.005122995,0.002598114,0.0017387543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027283977,0.00033489338,0.002318342,0.0015609757,0.0002609767,0.00093236606,0.0031283696,0.22530034,0.052331638,0.51117504,0.031861037,0.1680676],"study_design_scores_gemma":[0.0002648479,0.0003139061,0.0006107368,0.000111987094,0.00013926974,0.00041416564,0.00054644194,0.66751796,0.02619248,0.2624303,0.04135388,0.00010399178],"about_ca_topic_score_codex":0.0033059353,"about_ca_topic_score_gemma":0.0044365632,"teacher_disagreement_score":0.0075236517,"about_ca_system_score_codex":0.0028525274,"about_ca_system_score_gemma":0.0024813688,"threshold_uncertainty_score":0.025169134},"labels":[],"label_agreement":null},{"id":"W2990002113","doi":"10.4230/lipics.isaac.2019.45","title":"Path and Ancestor Queries over Trees with Multidimensional Weight Vectors","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ancestor; Path (computing); Computer science; Theoretical computer science; Tree (set theory); Combinatorics; Mathematics; Algorithm; Geography; Computer network","score_opus":0.00610076255544151,"score_gpt":0.20920867595822878,"score_spread":0.20310791340278728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990002113","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31924713,0.0013754535,0.66290015,0.002146282,0.00014513823,0.0003436728,0.0026911062,0.0044719814,0.0066790776],"genre_scores_gemma":[0.6840148,0.0006067734,0.30655596,0.00032764906,0.00014271679,0.00028131308,0.0030414122,0.00032108062,0.0047083967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504495,0.0011187167,0.0006273727,0.00096787786,0.0015604638,0.0006806482],"domain_scores_gemma":[0.99044496,0.0056819892,0.0008328932,0.0019181843,0.00073310535,0.00038889248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002826114,0.0009891052,0.0016957694,0.00157809,0.0013113219,0.003032994,0.0024359745,0.0017377299,0.0034663542],"category_scores_gemma":[0.016808154,0.0006569001,0.0011321311,0.004548717,0.00095560483,0.013811839,0.0037544842,0.001730102,0.00073252426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00224138,0.00085964927,0.016523236,0.0013667714,0.0002315509,0.0015396435,0.0027383007,0.21376228,0.041966382,0.19163817,0.024753679,0.50237894],"study_design_scores_gemma":[0.00015743132,0.00034615063,0.0012209313,0.000051463703,0.0000655639,0.00070152053,0.0007044284,0.81151015,0.013159677,0.16184261,0.010175524,0.000064553264],"about_ca_topic_score_codex":0.0033151158,"about_ca_topic_score_gemma":0.0036454757,"teacher_disagreement_score":0.0034663542,"about_ca_system_score_codex":0.001391433,"about_ca_system_score_gemma":0.0013404181,"threshold_uncertainty_score":0.014946103},"labels":[],"label_agreement":null},{"id":"W2990814010","doi":"10.4230/lipics.isaac.2019.46","title":"A 21/16-Approximation for the Minimum 3-Path Partition Problem","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Approximation algorithm; Combinatorics; Partition (number theory); Partition problem; Mathematics; Graph partition; Greedy algorithm; Discrete mathematics; Graph; Algorithm","score_opus":0.017539987755028318,"score_gpt":0.27483009011971604,"score_spread":0.25729010236468774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990814010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124406084,0.0029624514,0.82974315,0.0049404763,0.00051499705,0.00067938777,0.002302,0.0045578214,0.029893676],"genre_scores_gemma":[0.38295105,0.0014679001,0.59616375,0.0014772038,0.0003563232,0.00084406993,0.004811336,0.001432992,0.010495422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974256,0.0005009015,0.00011958494,0.00074467243,0.0006501141,0.00055897987],"domain_scores_gemma":[0.996473,0.0018266614,0.0003380679,0.00082063396,0.00024144248,0.00030014006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002040576,0.0028028523,0.0021164354,0.0012640487,0.0017195761,0.0033338002,0.003648435,0.0028787723,0.011160504],"category_scores_gemma":[0.01009529,0.0010658111,0.0025723162,0.0030458476,0.0015787302,0.0077479375,0.004435871,0.0049321894,0.003530811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033098343,0.0017095476,0.0038811713,0.0017548281,0.00037191238,0.0005771399,0.0009477215,0.3921585,0.021318054,0.12922256,0.08295203,0.36179674],"study_design_scores_gemma":[0.0003839076,0.00040548027,0.0009475661,0.00014018557,0.00014580261,0.00078086805,0.00026902786,0.7731145,0.0056918366,0.20539264,0.012668976,0.000059169815],"about_ca_topic_score_codex":0.0030103992,"about_ca_topic_score_gemma":0.003930849,"teacher_disagreement_score":0.011160504,"about_ca_system_score_codex":0.0034384339,"about_ca_system_score_gemma":0.0039916392,"threshold_uncertainty_score":0.037335575},"labels":[],"label_agreement":null},{"id":"W2994217331","doi":"10.4230/lipics.stacs.2021.6","title":"A Unified Framework of Quantum Walk Search","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research; Institute for Quantum Information and Matter, California Institute of Technology; Samsung; California Institute of Technology; National Science Foundation","keywords":"Quantum walk; Hitting time; Electric network; Quantum; Random walk; Computer science; Quantum algorithm; Operator (biology); Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.018530198710314177,"score_gpt":0.27452845219937855,"score_spread":0.25599825348906435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994217331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041563213,0.0008691737,0.9807751,0.0008369447,0.00011303064,0.0000602078,0.000100307814,0.00016933928,0.01291946],"genre_scores_gemma":[0.34087384,0.0034713736,0.63880163,0.0008448323,0.0008292925,0.00055645255,0.00031971844,0.0003278,0.013975217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803835,0.00071226107,0.00009188134,0.00035254704,0.00054439274,0.00026053874],"domain_scores_gemma":[0.99706024,0.0016200931,0.00014508466,0.0005807226,0.0004251602,0.00016863886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021815277,0.0011615,0.0015012831,0.0017230748,0.0014274748,0.0037070927,0.003216741,0.0025973418,0.0088269105],"category_scores_gemma":[0.0066182762,0.0007468701,0.0017110662,0.00169031,0.003611738,0.007934469,0.0028995988,0.004136666,0.0014916145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011082301,0.000013878358,0.000058860714,0.000034719815,0.000007921629,0.000021429909,0.000037691054,0.030631993,0.00035031725,0.9627155,0.0007313953,0.005385247],"study_design_scores_gemma":[0.000016893448,0.000028201823,0.000046898553,0.000018378598,0.0000074687564,0.000025352743,0.000019127678,0.23717934,0.00020303008,0.7581915,0.004247483,0.000016300357],"about_ca_topic_score_codex":0.0032783365,"about_ca_topic_score_gemma":0.002529188,"teacher_disagreement_score":0.0088269105,"about_ca_system_score_codex":0.0023041833,"about_ca_system_score_gemma":0.002221843,"threshold_uncertainty_score":0.029528975},"labels":[],"label_agreement":null},{"id":"W2997607600","doi":"10.4230/lipics.ipec.2019.9","title":"C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Planarity testing; Combinatorics; Book embedding; Parameterized complexity; Planar graph; Mathematics; Embedding; Discrete mathematics; Vertex (graph theory); Graph drawing; Graph; 1-planar graph; Computer science; Line graph","score_opus":0.019458393798127485,"score_gpt":0.2348391680125248,"score_spread":0.21538077421439733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997607600","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5763872,0.00094132154,0.39206395,0.0060318448,0.00012342217,0.00037817264,0.003508406,0.0073307958,0.013234967],"genre_scores_gemma":[0.80511844,0.00032407657,0.1841242,0.00096895854,0.00015302506,0.00024944555,0.0047473675,0.0010945583,0.0032199002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953258,0.0007476641,0.00020544573,0.0018081389,0.001079216,0.00083372963],"domain_scores_gemma":[0.9572473,0.030520227,0.002440958,0.0062257936,0.0020368958,0.0015287745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026347798,0.0019918687,0.0019430816,0.0013310151,0.0015538639,0.0041472893,0.005971147,0.0033822125,0.004840926],"category_scores_gemma":[0.030030116,0.0011638546,0.0023689317,0.0021772874,0.0036135882,0.009539356,0.005095859,0.0048600943,0.0012343533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049781413,0.001266917,0.021888789,0.0018594125,0.0005322885,0.0012532448,0.0018842099,0.47129452,0.057206523,0.17181468,0.026256677,0.23976456],"study_design_scores_gemma":[0.00025311354,0.00021734973,0.0013409603,0.000066674416,0.00015469363,0.00042159142,0.00038982285,0.699022,0.01857545,0.27721548,0.0022764758,0.0000664274],"about_ca_topic_score_codex":0.005095202,"about_ca_topic_score_gemma":0.0049261954,"teacher_disagreement_score":0.005971147,"about_ca_system_score_codex":0.0031816154,"about_ca_system_score_gemma":0.002854872,"threshold_uncertainty_score":0.023084402},"labels":[],"label_agreement":null},{"id":"W3004244792","doi":"10.4230/dagrep.9.8.70","title":"Computational Proteomics (Dagstuhl Seminar 19351)","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genetics, Bioinformatics, and Biomedical Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universitetet i Bergen; Universiteit Gent; Radboud Universiteit; Kungliga Tekniska Högskolan; Eidgenössische Technische Hochschule Zürich; University of Toronto; Buck Institute for Research on Aging; Friedrich-Schiller-Universität Jena; Leids Universitair Medisch Centrum; Universiteit Leiden; Princeton University; Université du Luxembourg; Dartmouth College","keywords":"Breakout; Session (web analytics); Identification (biology); Computer science; Proteome; Data science; Proteomics; World Wide Web; Bioinformatics; Biology","score_opus":0.01050825642027453,"score_gpt":0.2682828677345903,"score_spread":0.2577746113143158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004244792","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016024357,0.042038895,0.21985725,0.13942382,0.16891816,0.0021237747,0.027323052,0.017719753,0.36657104],"genre_scores_gemma":[0.05545895,0.017700154,0.06901005,0.01519404,0.033139728,0.0019993878,0.026714481,0.011231951,0.7695514],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995905,0.0008837851,0.00018923984,0.0008908352,0.0013908136,0.0007404264],"domain_scores_gemma":[0.99436367,0.001011546,0.00016941346,0.0005062539,0.001470235,0.002478958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009679998,0.0024355853,0.0011950253,0.0023175296,0.0016503629,0.0068829823,0.0024344306,0.002710535,0.19106925],"category_scores_gemma":[0.011977863,0.00076252787,0.001682309,0.0018599789,0.00087325036,0.0031848745,0.0072068055,0.005070793,0.14691612],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002523499,0.00012246949,0.00014783772,0.00019135147,0.000029045003,0.00008776153,0.00012128208,0.00079027883,0.0015683661,0.012258564,0.8947466,0.08968414],"study_design_scores_gemma":[0.00010435804,0.0001130991,0.00090790144,0.00019595948,0.000016775655,0.00009718671,0.00007085044,0.0014429463,0.0017047579,0.017125664,0.97818756,0.00003282716],"about_ca_topic_score_codex":0.0012168753,"about_ca_topic_score_gemma":0.0018300349,"teacher_disagreement_score":0.19106925,"about_ca_system_score_codex":0.0034148768,"about_ca_system_score_gemma":0.0033025932,"threshold_uncertainty_score":0.6391903},"labels":[],"label_agreement":null},{"id":"W3008457491","doi":"10.4230/lipics.mfcs.2020.14","title":"Layered Fan-Planar Graph Drawings","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; University of Waterloo; Deutsche Forschungsgemeinschaft","keywords":"Planar graph; Embedding; Planar; Combinatorics; Graph drawing; Pathwidth; Mathematics; Graph; Representation (politics); Book embedding; Computer science; Discrete mathematics; Computer graphics (images); Line graph; Artificial intelligence","score_opus":0.028163835996368642,"score_gpt":0.26729729868200985,"score_spread":0.2391334626856412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008457491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20790198,0.00063137437,0.7613757,0.00040124447,0.000060072813,0.00012507408,0.0012797,0.0011617217,0.027063057],"genre_scores_gemma":[0.6802992,0.0009160368,0.30520618,0.00021266272,0.000050302853,0.0001360512,0.0022447302,0.00030313426,0.010631711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917656,0.0001649731,0.00004153937,0.00021776075,0.00025460706,0.00014445816],"domain_scores_gemma":[0.99820423,0.00063732406,0.00031975537,0.00046838343,0.00022692264,0.00014336352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000529612,0.00067886297,0.00045146185,0.0006527515,0.00041266964,0.0014111955,0.000981112,0.0007915296,0.007229375],"category_scores_gemma":[0.0040453756,0.0007145059,0.0005493715,0.0011594556,0.0009378251,0.0030183583,0.001210371,0.0010854573,0.00081795116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003222268,0.00011321095,0.005806287,0.0005395901,0.000099858196,0.000937274,0.0006247644,0.15703455,0.02883886,0.6390792,0.013207567,0.15339655],"study_design_scores_gemma":[0.00009823602,0.00023169004,0.0047414633,0.0001732259,0.000114762726,0.001593711,0.0004941123,0.3878557,0.024109686,0.5213084,0.05919126,0.00008782187],"about_ca_topic_score_codex":0.0013773751,"about_ca_topic_score_gemma":0.0021784594,"teacher_disagreement_score":0.007229375,"about_ca_system_score_codex":0.0006904494,"about_ca_system_score_gemma":0.00032508667,"threshold_uncertainty_score":0.024184704},"labels":[],"label_agreement":null},{"id":"W3011330615","doi":"10.4230/lipics.opodis.2019.25","title":"On Memory, Communication, and Synchronous Schedulers When Moving and Computing","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Strategic International Collaborative Research Program; Japan Science and Technology Agency; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Robot; Constant (computer programming); Focus (optics); Shared memory; Euclidean geometry; Distributed computing; Theoretical computer science; Artificial intelligence; Parallel computing; Mathematics; Programming language","score_opus":0.015192216139031833,"score_gpt":0.23245680051203205,"score_spread":0.21726458437300022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011330615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13704431,0.003139512,0.8055553,0.004407726,0.0004167742,0.00019164338,0.0001561295,0.00066080876,0.0484278],"genre_scores_gemma":[0.89491564,0.0018496074,0.0916516,0.0007659061,0.0008437382,0.00031109658,0.00009212104,0.00024483542,0.009325442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968035,0.0011355536,0.00012666728,0.00049485144,0.000752304,0.0006871046],"domain_scores_gemma":[0.9883598,0.008388852,0.0009520525,0.0013667351,0.000461349,0.00047119815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032211381,0.00093970343,0.00088757946,0.0011910365,0.0018599462,0.0027392637,0.0021536169,0.0013798184,0.004845106],"category_scores_gemma":[0.0155313155,0.0005299991,0.0009085044,0.0016000429,0.006570325,0.010120256,0.0033758855,0.0027592122,0.00051754643],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001013337,0.000042956195,0.0005948736,0.000077167635,0.000013748178,0.000116866075,0.0003781317,0.038339943,0.0009261339,0.9493648,0.0009851239,0.009058883],"study_design_scores_gemma":[0.000051780473,0.00010539296,0.00035977818,0.00003749969,0.00003323432,0.00011384335,0.00018371116,0.31028756,0.0016356392,0.6813664,0.005793729,0.000031460102],"about_ca_topic_score_codex":0.0036704072,"about_ca_topic_score_gemma":0.0028009869,"teacher_disagreement_score":0.004845106,"about_ca_system_score_codex":0.0026668278,"about_ca_system_score_gemma":0.0020843956,"threshold_uncertainty_score":0.019349277},"labels":[],"label_agreement":null},{"id":"W3012040074","doi":"10.4230/lipics.stacs.2020.16","title":"Existential Length Universality","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Universality (dynamical systems); Discrete mathematics; Bounded function; Upper and lower bounds; PSPACE; Exponential function; Binary number; Computational complexity theory; Algorithm; Arithmetic","score_opus":0.023378349384035317,"score_gpt":0.23238747961975506,"score_spread":0.20900913023571974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012040074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21557184,0.0030351342,0.7077844,0.009582424,0.00044747128,0.00024980932,0.0020208203,0.0033024477,0.058005564],"genre_scores_gemma":[0.90304655,0.0010714149,0.077581026,0.0016359795,0.0007778138,0.00022164267,0.0011392394,0.0007972234,0.013729105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933467,0.0011975449,0.00041883235,0.0030578717,0.00083105837,0.0011480434],"domain_scores_gemma":[0.97478783,0.017149933,0.0019702392,0.004100373,0.0008985686,0.0010930402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040907227,0.0010931044,0.0014459911,0.0014335096,0.0024502384,0.004283587,0.0036624346,0.0021606793,0.011836812],"category_scores_gemma":[0.022690242,0.0011935123,0.002814653,0.0017493181,0.007450569,0.021222379,0.009261435,0.0051599564,0.0014049261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027740482,0.00009173875,0.0033299786,0.0007046164,0.00009562091,0.0005338507,0.0014192713,0.021328924,0.0047311005,0.922902,0.005726784,0.038858734],"study_design_scores_gemma":[0.00004075991,0.00007266364,0.00058576587,0.000108236716,0.00009892986,0.00060563814,0.00032036862,0.035839666,0.0048554894,0.9390274,0.01838734,0.000057790574],"about_ca_topic_score_codex":0.0016556587,"about_ca_topic_score_gemma":0.0011506057,"teacher_disagreement_score":0.011836812,"about_ca_system_score_codex":0.003959471,"about_ca_system_score_gemma":0.0015674185,"threshold_uncertainty_score":0.039598048},"labels":[],"label_agreement":null},{"id":"W3012136308","doi":"10.4230/lipics.cp.2022.15","title":"Constraint Acquisition Based on Solution Counting","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Constraint (computer-aided design); Computer science; Information retrieval; Mathematics; Geometry","score_opus":0.014764384835088212,"score_gpt":0.2674246517087655,"score_spread":0.25266026687367726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012136308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015104798,0.00030803733,0.9451981,0.00061328674,0.00007552192,0.00036629193,0.000609196,0.031044548,0.006680126],"genre_scores_gemma":[0.184101,0.00028155593,0.8015159,0.0008443154,0.000095404095,0.0006123434,0.0030532817,0.0032611913,0.0062351367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990488,0.0032104617,0.0005912265,0.0016915766,0.003433572,0.00058526767],"domain_scores_gemma":[0.97073686,0.017067159,0.0014256282,0.006174722,0.0038956746,0.0006999673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004773093,0.0017943871,0.0018605792,0.0028415732,0.0014408771,0.0033862945,0.005523963,0.0018177225,0.020590372],"category_scores_gemma":[0.041185115,0.001298055,0.0019905716,0.0031012532,0.00236318,0.008029324,0.0059666913,0.0049697165,0.0061081536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011157945,0.0009929417,0.0042214165,0.001285982,0.00024574006,0.0003917153,0.0009884713,0.06902021,0.022603994,0.11187892,0.054138053,0.73311675],"study_design_scores_gemma":[0.00014728548,0.00013086968,0.00045327508,0.00012217932,0.000050579005,0.00024633494,0.000118572825,0.8638748,0.021601668,0.09071743,0.022439424,0.000097567805],"about_ca_topic_score_codex":0.0049086167,"about_ca_topic_score_gemma":0.008295822,"teacher_disagreement_score":0.020590372,"about_ca_system_score_codex":0.0015357367,"about_ca_system_score_gemma":0.004230605,"threshold_uncertainty_score":0.06888163},"labels":[],"label_agreement":null},{"id":"W3013273637","doi":"10.4230/lipics.stacs.2020.40","title":"Succinct Population Protocols for Presburger Arithmetic","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Presburger arithmetic; Remainder; Population; Protocol (science); Quantifier (linguistics); Computer science; Discrete mathematics; Fragment (logic); Mathematics; Decidability; Arithmetic; Programming language","score_opus":0.046122456538243706,"score_gpt":0.3144925250052844,"score_spread":0.2683700684670407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013273637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025300313,0.00019373556,0.9602276,0.0010363244,0.00009198318,0.0003361087,0.00039286976,0.0019543343,0.010466755],"genre_scores_gemma":[0.55278426,0.00054985477,0.42877653,0.0012955627,0.00018145364,0.0015059981,0.0013714362,0.00087262446,0.0126621565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996228,0.0010805234,0.00028041657,0.0007475294,0.0012580584,0.00040552256],"domain_scores_gemma":[0.99306715,0.0043681846,0.00042579122,0.001383691,0.00057992764,0.00017525154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029324426,0.00078749104,0.000740379,0.0007886645,0.0013854997,0.0025255817,0.001894559,0.0012725609,0.010794685],"category_scores_gemma":[0.0099087795,0.0006751717,0.0016372793,0.0007654024,0.0033155633,0.00916262,0.0050622174,0.005171444,0.0017321266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018214641,0.00010531405,0.00038889784,0.00020895382,0.000029265582,0.0001285189,0.00079809444,0.019784002,0.011440322,0.93475705,0.0027071545,0.029470325],"study_design_scores_gemma":[0.00015026148,0.00013669151,0.00016687832,0.00008990158,0.000055818557,0.0000973529,0.00016580292,0.09087117,0.028932642,0.86492574,0.014349499,0.0000582063],"about_ca_topic_score_codex":0.0009845326,"about_ca_topic_score_gemma":0.0015961089,"teacher_disagreement_score":0.010794685,"about_ca_system_score_codex":0.002356699,"about_ca_system_score_gemma":0.0021381574,"threshold_uncertainty_score":0.03611189},"labels":[],"label_agreement":null},{"id":"W3013325312","doi":"10.4230/lipics.icdt.2020.24","title":"Reverse Prevention Sampling for Misinformation Mitigation in Social Networks","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Misinformation; Scalability; Computer science; Limiting; Set (abstract data type); Social network (sociolinguistics); Work (physics); Sampling (signal processing); Theoretical computer science; Algorithm; Computer security; Social media; Telecommunications; Engineering; World Wide Web","score_opus":0.0317130336257738,"score_gpt":0.28072222779172823,"score_spread":0.24900919416595443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013325312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04813045,0.0027221383,0.94036883,0.0017322662,0.00019915048,0.0005847754,0.00060984434,0.0025696116,0.0030829047],"genre_scores_gemma":[0.4756147,0.0011482512,0.5153303,0.00088669965,0.00041958448,0.00060638913,0.0017943797,0.0003230558,0.0038765662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956839,0.0021429001,0.0001972157,0.00089887355,0.00080957584,0.00026746897],"domain_scores_gemma":[0.97826743,0.015737742,0.0016701341,0.0028392388,0.0009624832,0.00052308943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00505349,0.0020588308,0.0022014324,0.0023962099,0.0014601349,0.0016252099,0.0031232478,0.0023850435,0.0023181085],"category_scores_gemma":[0.021155091,0.0010759322,0.0015346776,0.0019815802,0.0018940675,0.0043374104,0.0022838134,0.002548338,0.00096733106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009543291,0.0005688354,0.010892848,0.0010299134,0.0004901664,0.00038272823,0.00078378664,0.6066031,0.0053689717,0.038118746,0.0125062335,0.32230034],"study_design_scores_gemma":[0.000063785454,0.0001081561,0.00067804335,0.000054113618,0.00006821014,0.00017774249,0.0001392072,0.95491874,0.0026131817,0.038330127,0.002827105,0.000021585347],"about_ca_topic_score_codex":0.0047148974,"about_ca_topic_score_gemma":0.0066660293,"teacher_disagreement_score":0.00505349,"about_ca_system_score_codex":0.001884719,"about_ca_system_score_gemma":0.0028243258,"threshold_uncertainty_score":0.02672571},"labels":[],"label_agreement":null},{"id":"W3013736025","doi":"10.4230/lipics.stacs.2020.15","title":"The Tandem Duplication Distance Is NP-Hard","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Gene duplication; Tandem exon duplication; Tandem; Edit distance; Computer science; Genome; Tandem repeat; String (physics); Sequence (biology); Mathematics; Biology; Algorithm; Combinatorics; Computational biology; Genetics; Gene","score_opus":0.021399867699930453,"score_gpt":0.2490937005606947,"score_spread":0.22769383286076422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013736025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36191428,0.011506407,0.40456694,0.066197515,0.0018332065,0.0007822662,0.021540781,0.00418299,0.1274756],"genre_scores_gemma":[0.787515,0.005827371,0.14704786,0.00628463,0.0022474565,0.0006657298,0.015865248,0.0012147428,0.033331953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980446,0.0003174505,0.00010464404,0.0008193276,0.00036455717,0.00034936375],"domain_scores_gemma":[0.9905256,0.007959656,0.00042266666,0.00044508715,0.0003420175,0.00030502302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007571331,0.0015240315,0.002373561,0.0007085898,0.0018453476,0.0041525685,0.003522811,0.0034117394,0.012122665],"category_scores_gemma":[0.007389242,0.0008778162,0.0017738475,0.0028301536,0.0021852697,0.00813706,0.002338955,0.005950951,0.0020147113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012138746,0.0010141266,0.0044158907,0.003701785,0.0005151446,0.001259446,0.0008267159,0.34215063,0.009676353,0.26676348,0.18194768,0.18651493],"study_design_scores_gemma":[0.0002591584,0.00015876249,0.0014738116,0.00014433048,0.00014290742,0.0011190322,0.0006343493,0.28084144,0.0044998643,0.67969555,0.030945208,0.000085650754],"about_ca_topic_score_codex":0.0037141703,"about_ca_topic_score_gemma":0.003823559,"teacher_disagreement_score":0.012122665,"about_ca_system_score_codex":0.0031325193,"about_ca_system_score_gemma":0.0022517594,"threshold_uncertainty_score":0.040554345},"labels":[],"label_agreement":null},{"id":"W3013795241","doi":"10.4230/dagrep.9.10.47","title":"Quantum Cryptanalysis (Dagstuhl Seminar 19421)","year":2020,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Illinois at Urbana-Champaign; National Institute of Standards and Technology; Universidad de León; Infineon Technologies; Ruhr-Universität Bochum; Université Paris Diderot; Université de Limoges; Universidad del Atlántico; University of Oxford; Sorbonne Université; University of Waterloo; Universidad Rey Juan Carlos; University of Cincinnati; Royal Holloway, University of London; Kungliga Tekniska Högskolan; Technische Universität Darmstadt; California Institute of Technology; University of South Florida; Immanuel Kant Baltic Federal University; Florida Atlantic University; Institut national de recherche en informatique et en automatique (INRIA); Microsoft","keywords":"Cryptanalysis; Computer science; Computer security; Cryptography","score_opus":0.009593295081138457,"score_gpt":0.2350014193117031,"score_spread":0.22540812423056464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013795241","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012107861,0.027380245,0.01241997,0.07936801,0.051768277,0.0003149211,0.007177363,0.0016355625,0.8078278],"genre_scores_gemma":[0.10316843,0.007727916,0.0073075746,0.0057232766,0.0103778755,0.00028504655,0.0036414384,0.0010657776,0.8607026],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795216,0.00045070855,0.00006639126,0.00028853188,0.0007100548,0.0005321641],"domain_scores_gemma":[0.99909365,0.00010322778,0.000041981628,0.00009233233,0.00017611963,0.000492704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027906466,0.001351765,0.00068675104,0.0015872024,0.002412142,0.0045375745,0.0013339962,0.002671551,0.14373095],"category_scores_gemma":[0.0032797875,0.0003497754,0.0007388343,0.0013808149,0.0011767655,0.0022839047,0.0045692488,0.0028180624,0.065299034],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021945284,0.00010752528,0.00015618034,0.00014869512,0.000012771519,0.00014270186,0.00015856752,0.00039189402,0.0011948781,0.08761062,0.84920436,0.060652383],"study_design_scores_gemma":[0.00004610303,0.000055119926,0.00054810266,0.000091316564,0.000005589226,0.00008818393,0.000048515896,0.00032920757,0.00117072,0.026796011,0.9708083,0.000012864301],"about_ca_topic_score_codex":0.0017302328,"about_ca_topic_score_gemma":0.0025221487,"teacher_disagreement_score":0.14373095,"about_ca_system_score_codex":0.004931717,"about_ca_system_score_gemma":0.002816956,"threshold_uncertainty_score":0.48082793},"labels":[],"label_agreement":null},{"id":"W3013871422","doi":"10.4230/dagrep.9.9.135","title":"Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401)","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Birkbeck, University of London; Royal Holloway, University of London; National Research University Higher School of Economics; Universität des Saarlandes; Centre National de la Recherche Scientifique; University of Waterloo; Université de Bordeaux; Universiteit van Amsterdam; Monash University; Louisiana State University; Deakin University; U.S. Naval Academy; Durham University; Universiteit Leiden; University of North Texas; University of North Florida; Queen Mary University of London; Seoul National University; University of South Florida; York University; Aix-Marseille Université; Université de Montpellier; Univerzita Karlova v Praze","keywords":"Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.04844326896163092,"score_gpt":0.32058332757919805,"score_spread":0.2721400586175671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013871422","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030361442,0.1279434,0.19286318,0.11112825,0.009113455,0.00009376616,0.0018990937,0.0006233453,0.5259741],"genre_scores_gemma":[0.73756754,0.038865194,0.09319208,0.011608091,0.007145709,0.00052837917,0.0016801403,0.00053602905,0.108876795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981047,0.0009674916,0.000059173195,0.00027920894,0.00039796,0.0001915015],"domain_scores_gemma":[0.99868876,0.00084989576,0.000097356875,0.00009629441,0.00017586583,0.00009183291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003311014,0.00066439476,0.0006468241,0.0028474568,0.0021534243,0.003505492,0.000738556,0.0015546823,0.013211024],"category_scores_gemma":[0.004365917,0.00033273874,0.0010431813,0.0027687754,0.0038608082,0.0047083097,0.0021461116,0.0033377113,0.0024817572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012338149,0.000006111847,0.000052164574,0.000037808746,0.000005956242,0.000022272363,0.00014153321,0.0003034137,0.00011943038,0.97040415,0.01844107,0.010453706],"study_design_scores_gemma":[0.000009730558,0.000014832066,0.00033995198,0.00006931304,0.0000072014204,0.00005260285,0.00005677141,0.00051277055,0.00015216945,0.8967158,0.10205813,0.000010661489],"about_ca_topic_score_codex":0.0023667486,"about_ca_topic_score_gemma":0.0020404719,"teacher_disagreement_score":0.013211024,"about_ca_system_score_codex":0.0073233573,"about_ca_system_score_gemma":0.0012571813,"threshold_uncertainty_score":0.05313492},"labels":[],"label_agreement":null},{"id":"W3013877464","doi":"10.4230/lipics.opodis.2019.24","title":"Oblivious Permutations on the Plane","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Robot; Permutation (music); Class (philosophy); Computer science; Plane (geometry); Euclidean geometry; Mobile robot; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Geometry","score_opus":0.05331678362262645,"score_gpt":0.2853190603340678,"score_spread":0.23200227671144133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013877464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15713973,0.00018877583,0.83042413,0.00043402333,0.00004434718,0.00010910909,0.00017593661,0.00030368607,0.011180349],"genre_scores_gemma":[0.8104978,0.00044275838,0.18003896,0.00009610341,0.00004599366,0.00025037426,0.00026041904,0.0000747904,0.00829268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916244,0.00030556085,0.00005308824,0.00016416187,0.00015955836,0.00015507001],"domain_scores_gemma":[0.9988354,0.00057810714,0.00020509744,0.00022029738,0.00007748963,0.00008363404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004983955,0.0005577756,0.00066133717,0.00029537923,0.0005885221,0.001305575,0.0007900437,0.0007296942,0.002449798],"category_scores_gemma":[0.0021222027,0.00026097675,0.0006200646,0.0006110272,0.0014729805,0.0021916179,0.00107651,0.0010971068,0.0004957053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024987344,0.00005194826,0.0005318857,0.00006569775,0.00002811599,0.00027706067,0.00022154023,0.5898035,0.0045414357,0.38538754,0.0007588375,0.018082492],"study_design_scores_gemma":[0.000113336544,0.00010115568,0.00023821616,0.000010008169,0.000015640106,0.00009409523,0.0001327715,0.6880375,0.003172182,0.30226567,0.0057995445,0.000019876798],"about_ca_topic_score_codex":0.0019736127,"about_ca_topic_score_gemma":0.0013419177,"teacher_disagreement_score":0.002449798,"about_ca_system_score_codex":0.0007449864,"about_ca_system_score_gemma":0.00072715944,"threshold_uncertainty_score":0.00819546},"labels":[],"label_agreement":null},{"id":"W3013905686","doi":"10.4230/lipics.opodis.2019.19","title":"Toward Linearizability Testing for Multi-Word Persistent Synchronization Primitives","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linearizability; Computer science; Word (group theory); Synchronization (alternating current); Programming language; Arithmetic; Computer network; Correctness; Mathematics","score_opus":0.06717344285763832,"score_gpt":0.27320658961995586,"score_spread":0.20603314676231754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013905686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07921126,0.00013726526,0.9137511,0.0008303437,0.00006620689,0.00017797749,0.000082891,0.004456073,0.0012868454],"genre_scores_gemma":[0.571511,0.00017684457,0.4254585,0.000365538,0.00008289051,0.00023317462,0.00026494704,0.0005827979,0.0013243329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916869,0.0027620972,0.00059563253,0.001262162,0.0027986176,0.0008946805],"domain_scores_gemma":[0.9527267,0.03138842,0.004503174,0.0055101416,0.0051012123,0.0007703251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005445193,0.0011726387,0.0009340891,0.00261422,0.00083407474,0.0032800932,0.0030635973,0.0018456005,0.003175928],"category_scores_gemma":[0.034997582,0.00092822703,0.0017445169,0.0014503938,0.0053445515,0.0065411422,0.0038300373,0.0038443236,0.0008803571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014857708,0.001218232,0.023483302,0.0014539812,0.0002343281,0.0018084259,0.0015909955,0.1431498,0.17132962,0.3688734,0.0054275603,0.27994463],"study_design_scores_gemma":[0.00013834216,0.00045706952,0.00095240993,0.00016244002,0.0000876314,0.00032267702,0.0003543297,0.60675853,0.10414489,0.2841287,0.0024033638,0.00008952661],"about_ca_topic_score_codex":0.001821986,"about_ca_topic_score_gemma":0.0020943386,"teacher_disagreement_score":0.005445193,"about_ca_system_score_codex":0.001593429,"about_ca_system_score_gemma":0.003353917,"threshold_uncertainty_score":0.028797328},"labels":[],"label_agreement":null},{"id":"W3014455327","doi":"10.4230/lipics.tqc.2020.7","title":"Beyond Product State Approximations for a Quantum Analogue of Max Cut","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Maximum cut; Semidefinite programming; Hamiltonian (control theory); Qubit; Mathematics; Bounded function; Eigenvalues and eigenvectors; Relaxation (psychology); Quantum; Upper and lower bounds; Quantum computer; Graph; Product (mathematics); Discrete mathematics; Combinatorics; Quantum mechanics; Mathematical optimization; Mathematical analysis; Physics","score_opus":0.016616981657599762,"score_gpt":0.24280658669256847,"score_spread":0.2261896050349687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014455327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09103633,0.00043334352,0.89197326,0.0012462637,0.00008577677,0.00007272197,0.00017969272,0.0006709586,0.014301687],"genre_scores_gemma":[0.7359473,0.0003215302,0.25692645,0.00037886167,0.00007752822,0.00016219003,0.0004058496,0.0003767638,0.0054033916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863285,0.0005712332,0.00004634755,0.00025281447,0.0003483892,0.00014828218],"domain_scores_gemma":[0.9947589,0.0036905475,0.00023200276,0.00092225336,0.00026564163,0.00013065671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002157303,0.00086495554,0.00092703913,0.00058338686,0.0006479955,0.001991341,0.0017707943,0.0014501468,0.0057123033],"category_scores_gemma":[0.009797412,0.00048107363,0.0010431386,0.0011040332,0.0024218226,0.004754396,0.0017872875,0.0038335759,0.00054189353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035318316,0.00014631588,0.0005848364,0.00016112211,0.000056180877,0.00008430468,0.0001789241,0.45197448,0.00303314,0.50915676,0.002562768,0.031707935],"study_design_scores_gemma":[0.00001546938,0.000031550127,0.000055597888,0.000010715653,0.000006872015,0.000022203476,0.00001828878,0.7196213,0.0011754301,0.27822617,0.00081009016,0.0000063632287],"about_ca_topic_score_codex":0.001359687,"about_ca_topic_score_gemma":0.0015422975,"teacher_disagreement_score":0.0057123033,"about_ca_system_score_codex":0.0017490383,"about_ca_system_score_gemma":0.00097140484,"threshold_uncertainty_score":0.019109547},"labels":[],"label_agreement":null},{"id":"W3017007515","doi":"10.4230/lipics.cpm.2020.11","title":"Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Automatic summarization; Heuristic; String (physics); Sequence (biology); Computer science; Tree (set theory); Variety (cybernetics); Set (abstract data type); Chain (unit); Algorithm; Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.027909060437225013,"score_gpt":0.2671914755954198,"score_spread":0.23928241515819476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017007515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057616554,0.0020706195,0.93342924,0.0007027361,0.00012630764,0.00017461649,0.0012970483,0.003050419,0.0015324609],"genre_scores_gemma":[0.16556878,0.00074644224,0.8268556,0.0001543179,0.00012337911,0.00015700045,0.0038325347,0.0003177624,0.0022441885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872845,0.0003076593,0.00017019978,0.00037965082,0.00034485693,0.00006906426],"domain_scores_gemma":[0.99509096,0.0026245406,0.0005577358,0.0010487475,0.0005413845,0.00013652675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013505064,0.0009557215,0.0014387257,0.0031139276,0.0010076531,0.0019301288,0.0016902013,0.0016701347,0.002306244],"category_scores_gemma":[0.010798249,0.00056865177,0.0007623534,0.005575363,0.0010690439,0.003257013,0.0012374057,0.0017212442,0.0013414564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004629979,0.00016137105,0.00503339,0.00060603756,0.00011485395,0.00053051545,0.0008112881,0.26105198,0.013137642,0.05596959,0.0106170755,0.6515034],"study_design_scores_gemma":[0.00004282601,0.00015044898,0.0010312495,0.00008170413,0.00004908252,0.00049925136,0.00028926105,0.83353925,0.01328213,0.13829586,0.012701598,0.00003735312],"about_ca_topic_score_codex":0.0015476067,"about_ca_topic_score_gemma":0.0024967433,"teacher_disagreement_score":0.0031139276,"about_ca_system_score_codex":0.0009847779,"about_ca_system_score_gemma":0.0010228251,"threshold_uncertainty_score":0.0077151656},"labels":[],"label_agreement":null},{"id":"W3021687661","doi":"10.4230/lipics.icalp.2017.93","title":"Subspace-Invariant AC^0 Formulas","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Combinatorics; Mathematics; Invariant (physics); Parity function; Omega; Hamming weight; Subspace topology; Discrete mathematics; Upper and lower bounds; Boolean function; Hamming code; Mathematical analysis; Physics; Pure mathematics; Algorithm; Mathematical physics; Quantum mechanics","score_opus":0.0313715502383439,"score_gpt":0.2874558150757654,"score_spread":0.2560842648374215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021687661","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54220843,0.00060258445,0.35251516,0.0011903265,0.0001906935,0.00012120782,0.0017187417,0.0020924597,0.099360354],"genre_scores_gemma":[0.93271655,0.00022218458,0.05466031,0.0003674979,0.00012636006,0.00009226731,0.001174902,0.00029537256,0.010344651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847645,0.00025432045,0.00010082882,0.00031940974,0.0005770144,0.0002719773],"domain_scores_gemma":[0.9963883,0.001623581,0.00030944843,0.0008848746,0.00060166157,0.00019219589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006127733,0.00041395766,0.00047694918,0.0008277076,0.000865115,0.0020432828,0.001186466,0.00044836942,0.008061885],"category_scores_gemma":[0.004057229,0.0002766908,0.0008381559,0.00092257955,0.0019001213,0.0038088644,0.0018494143,0.0014949697,0.0007482137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015482088,0.00005573546,0.0017520281,0.00014475096,0.00002049011,0.00016798389,0.00014369245,0.0033741912,0.009504414,0.9429795,0.0034241825,0.038278196],"study_design_scores_gemma":[0.000037004058,0.000064588436,0.0012311658,0.000023602644,0.000047432794,0.00028263987,0.00008775101,0.043830983,0.019131804,0.925991,0.009242044,0.000030097346],"about_ca_topic_score_codex":0.0019175119,"about_ca_topic_score_gemma":0.0020254643,"teacher_disagreement_score":0.008061885,"about_ca_system_score_codex":0.0015074048,"about_ca_system_score_gemma":0.001236819,"threshold_uncertainty_score":0.026969671},"labels":[],"label_agreement":null},{"id":"W3023180869","doi":"10.4230/lipics.tqc.2020.8","title":"Simpler Proofs of Quantumness","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; Canadian Institute for Advanced Research; Multidisciplinary University Research Initiative; European Commission; Adolph C. and Mary Sprague Miller Institute for Basic Research in Science, University of California Berkeley; National Science Foundation","keywords":"Mathematical proof; Computer science; Oracle; Learning with errors; Theoretical computer science; Random oracle; Hash function; Cryptography; Heuristic; Property (philosophy); Cryptographic primitive; Function (biology); Quantum computer; Quantum; Algorithm; Cryptographic protocol; Mathematics; Encryption; Public-key cryptography; Artificial intelligence; Computer security; Programming language","score_opus":0.037655001637565966,"score_gpt":0.2865085311426028,"score_spread":0.2488535295050368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023180869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031787384,0.0056385235,0.78574896,0.015749827,0.0029270258,0.00031296327,0.0008906456,0.002040634,0.15490398],"genre_scores_gemma":[0.6339608,0.004008899,0.30472723,0.007438681,0.0026597728,0.00075865135,0.0009543084,0.0011173456,0.044374418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923855,0.002427336,0.00045005232,0.0014497702,0.002569954,0.00071737036],"domain_scores_gemma":[0.9782727,0.012660192,0.00086343323,0.0057480833,0.001967885,0.00048774536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007110254,0.0010184806,0.0011508446,0.0019046955,0.0018966618,0.0050403876,0.002547268,0.002668887,0.031719387],"category_scores_gemma":[0.020642605,0.00073833775,0.0020352034,0.0013016652,0.006326619,0.013487511,0.007393958,0.007818874,0.004887346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003060447,0.000034904435,0.00006067671,0.000206848,0.00001598532,0.000077317854,0.00018755916,0.0008668968,0.0018042128,0.98339945,0.0036353536,0.009679984],"study_design_scores_gemma":[0.000045668254,0.00004877498,0.000100152036,0.00007695102,0.00001221127,0.00011172595,0.000044297733,0.0030874605,0.0034885874,0.9642024,0.028748246,0.000033569002],"about_ca_topic_score_codex":0.0004927452,"about_ca_topic_score_gemma":0.00040923434,"teacher_disagreement_score":0.031719387,"about_ca_system_score_codex":0.0025217887,"about_ca_system_score_gemma":0.0016889112,"threshold_uncertainty_score":0.10611194},"labels":[],"label_agreement":null},{"id":"W3023400052","doi":"10.4230/lipics.icalp.2020.110","title":"Sensitive Instances of the Constraint Satisfaction Problem","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Constraint satisfaction problem; Idempotence; Tuple; Mathematics; Context (archaeology); Subalgebra; Variety (cybernetics); Consistency (knowledge bases); Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.018631219693516422,"score_gpt":0.24485251207343764,"score_spread":0.22622129237992122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023400052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5952061,0.00048082863,0.38718805,0.0012507478,0.000083817504,0.0004133172,0.000651139,0.0005587487,0.014167362],"genre_scores_gemma":[0.88948524,0.00027328054,0.10663988,0.0003242799,0.00010701105,0.00019040886,0.0006775767,0.0001490676,0.0021532725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899478,0.0036475873,0.00056766724,0.0019705717,0.0028589559,0.001007413],"domain_scores_gemma":[0.9648524,0.027343456,0.002691252,0.003418417,0.0007630539,0.0009314779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061600413,0.00084012054,0.0010468758,0.0011545698,0.0009610563,0.0032497859,0.0023655456,0.0014976534,0.0037969565],"category_scores_gemma":[0.032862924,0.00083015184,0.0021902702,0.0016653681,0.0023219085,0.005972305,0.0032044963,0.004197492,0.00021300919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055824826,0.0005152367,0.007351698,0.00039744927,0.0004216657,0.00093647477,0.00077540363,0.4307278,0.008441122,0.50318694,0.0017000763,0.04498794],"study_design_scores_gemma":[0.00010621108,0.00028360906,0.0013773453,0.00003183529,0.00011930808,0.0003939178,0.00023914617,0.5390053,0.009460973,0.44597146,0.0029618216,0.00004904212],"about_ca_topic_score_codex":0.0013481907,"about_ca_topic_score_gemma":0.0011193692,"teacher_disagreement_score":0.0061600413,"about_ca_system_score_codex":0.0015281774,"about_ca_system_score_gemma":0.0012131099,"threshold_uncertainty_score":0.032577753},"labels":[],"label_agreement":null},{"id":"W3034373981","doi":"10.4230/lipics.cpm.2021.13","title":"A Fast and Small Subsampled R-Index","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.03198763216395205,"score_gpt":0.25634886082708896,"score_spread":0.2243612286631369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034373981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025267107,0.002983943,0.8828052,0.0009141923,0.00084799004,0.0005524734,0.007261424,0.06704502,0.012322607],"genre_scores_gemma":[0.06797004,0.00068499456,0.8895251,0.0006411357,0.0002846306,0.00061052165,0.01903319,0.004338296,0.016912187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997983,0.00018924376,0.00017274836,0.00042764764,0.0010539588,0.00017345657],"domain_scores_gemma":[0.9972459,0.00043507753,0.00017373076,0.0011921551,0.0007876542,0.00016543912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008173068,0.0017634187,0.001945003,0.002566265,0.0014125454,0.0023816412,0.00331614,0.0012450163,0.019540686],"category_scores_gemma":[0.007769736,0.0007224879,0.0014253876,0.004123377,0.0007924621,0.0043758377,0.003918101,0.0016244682,0.022841854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001275891,0.00026117425,0.0021100906,0.0005002707,0.00015902537,0.0005793625,0.00033725018,0.015130485,0.035234924,0.021026121,0.13585754,0.78752786],"study_design_scores_gemma":[0.0007510658,0.00083321054,0.0030063323,0.00017900558,0.00019977076,0.0023709321,0.0004445485,0.6185625,0.083440885,0.08038123,0.20940651,0.00042402447],"about_ca_topic_score_codex":0.00494125,"about_ca_topic_score_gemma":0.0070686266,"teacher_disagreement_score":0.019540686,"about_ca_system_score_codex":0.0010076531,"about_ca_system_score_gemma":0.002562434,"threshold_uncertainty_score":0.06537014},"labels":[],"label_agreement":null},{"id":"W3036465868","doi":"10.48550/arxiv.2006.10957","title":"When Is Amplification Necessary for Composition in Randomized Query Complexity?","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Decision tree; Function (biology); Upper and lower bounds; Mathematics; Combinatorics; Overhead (engineering); Tree (set theory); Discrete mathematics; Computer science; Statistics; Data mining; Mathematical analysis","score_opus":0.06031803637100492,"score_gpt":0.2985062379972715,"score_spread":0.23818820162626658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036465868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23393781,0.001995972,0.692962,0.025433186,0.0005547114,0.00060064805,0.00094277284,0.0034955845,0.040077273],"genre_scores_gemma":[0.9076694,0.0011329912,0.07320607,0.0046541984,0.0015794558,0.0007932692,0.0006670441,0.0010971748,0.00920046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97266364,0.009058927,0.001622638,0.0056502344,0.0067083575,0.004296238],"domain_scores_gemma":[0.79315066,0.17507608,0.0057322364,0.017861202,0.0045680916,0.003611708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018764732,0.0016912782,0.0041677263,0.0014323143,0.0029199424,0.008167026,0.003642969,0.00510928,0.01663993],"category_scores_gemma":[0.1440961,0.0024706163,0.0036832355,0.0019884687,0.010049727,0.040381566,0.009319465,0.011295271,0.0029167524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004410301,0.0009968943,0.0099932365,0.0010553002,0.00026984053,0.0010718922,0.0021765819,0.08641568,0.020804467,0.77742475,0.010270777,0.08511024],"study_design_scores_gemma":[0.00028619103,0.0002463162,0.0013247394,0.0001231072,0.00015667969,0.00059139315,0.0002860819,0.21781828,0.009532021,0.7656107,0.0039225044,0.00010194281],"about_ca_topic_score_codex":0.0022311544,"about_ca_topic_score_gemma":0.0014571921,"teacher_disagreement_score":0.018764732,"about_ca_system_score_codex":0.0047095255,"about_ca_system_score_gemma":0.004327272,"threshold_uncertainty_score":0.099238575},"labels":[],"label_agreement":null},{"id":"W3037400974","doi":"10.4230/lipics.itc.2020.7","title":"Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Leakage (economics); Secret sharing; Affine transformation; Bounded function; Mathematics; Access structure; Oracle; Computer science; Information leakage; Random oracle; Discrete mathematics; Topology (electrical circuits); Cryptography; Encryption; Combinatorics; Algorithm; Computer network; Public-key cryptography; Pure mathematics; Mathematical analysis","score_opus":0.028446762039231927,"score_gpt":0.2550328808854351,"score_spread":0.22658611884620314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037400974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06521232,0.0011454695,0.9232182,0.001064766,0.000112586386,0.00020475454,0.00035025435,0.0007258023,0.0079658395],"genre_scores_gemma":[0.9461171,0.00089098886,0.045517955,0.0003983149,0.000097810866,0.00020393371,0.00022815002,0.00014891352,0.0063968776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934683,0.002087659,0.00038507825,0.0013222236,0.001535184,0.0012014043],"domain_scores_gemma":[0.9833965,0.0076732575,0.0019360252,0.0056537064,0.00078847463,0.0005519766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049448875,0.001552246,0.0022453556,0.0012499106,0.0015704466,0.0038198754,0.00345965,0.0033387155,0.0050428603],"category_scores_gemma":[0.018159077,0.0010574325,0.0035282385,0.0017517371,0.005348669,0.01643522,0.0069781747,0.006304977,0.0011676563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003143429,0.00008168031,0.0003843477,0.0002764746,0.00013554448,0.00027062153,0.0005071387,0.14046113,0.0072220825,0.8400273,0.0013401064,0.008979331],"study_design_scores_gemma":[0.000056236695,0.0001387285,0.00013373836,0.0000808414,0.00007515346,0.0002869569,0.00008283699,0.43460274,0.006837599,0.5545959,0.003032413,0.00007703891],"about_ca_topic_score_codex":0.0010538438,"about_ca_topic_score_gemma":0.00058054057,"teacher_disagreement_score":0.0050428603,"about_ca_system_score_codex":0.0046199937,"about_ca_system_score_gemma":0.0021149556,"threshold_uncertainty_score":0.03352058},"labels":[],"label_agreement":null},{"id":"W3037488610","doi":"10.4230/lipics.swat.2020.22","title":"Clustering Moving Entities in Euclidean Space","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cluster analysis; k-medians clustering; Correlation clustering; Disjoint sets; CURE data clustering algorithm; Combinatorics; Canopy clustering algorithm; Mathematics; Single-linkage clustering; Center (category theory); Algorithm; Sequence (biology); Data stream clustering; Euclidean space; Computer science; Statistics","score_opus":0.022118242785892406,"score_gpt":0.23660286487675364,"score_spread":0.21448462209086122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037488610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01981987,0.0012525643,0.9735883,0.00048493873,0.000101699894,0.00013573874,0.0018059136,0.0011504819,0.0016604529],"genre_scores_gemma":[0.26461318,0.0018595689,0.7208226,0.00018809327,0.00015176447,0.00031498526,0.007575516,0.00023926643,0.0042350623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971675,0.0007210469,0.0002171611,0.0010510196,0.00066962006,0.00017359424],"domain_scores_gemma":[0.9983517,0.000703498,0.0002138244,0.00038634942,0.00026878505,0.00007593102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001135358,0.0013685126,0.0016148038,0.0024669725,0.001019717,0.001744829,0.0024479423,0.0019648978,0.0020277316],"category_scores_gemma":[0.006059765,0.0007509317,0.0011178917,0.006307842,0.0010163728,0.0035570187,0.0026862859,0.0015869531,0.0013851185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036038595,0.00008323906,0.0027256766,0.00052914885,0.00020398054,0.0002538867,0.00040246733,0.74473554,0.00520641,0.06113617,0.015284672,0.16907845],"study_design_scores_gemma":[0.000023979108,0.00004523932,0.0010569494,0.00003372932,0.000022984952,0.00012036364,0.00014350549,0.9381033,0.0023598175,0.046560418,0.011493629,0.000036148755],"about_ca_topic_score_codex":0.008931326,"about_ca_topic_score_gemma":0.008133117,"teacher_disagreement_score":0.008931326,"about_ca_system_score_codex":0.0016022391,"about_ca_system_score_gemma":0.0009217124,"threshold_uncertainty_score":0.017758727},"labels":[],"label_agreement":null},{"id":"W3037695460","doi":"10.4230/lipics.icalp.2020.85","title":"Proportionally Fair Clustering Revisited","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Metric space; Mathematics; Centroid; Combinatorics; Metric (unit); Generalization; Discrete mathematics; Cluster (spacecraft); Approximation algorithm; k-medians clustering; Correlation clustering; Computer science; CURE data clustering algorithm; Statistics; Geometry","score_opus":0.03339787288379148,"score_gpt":0.2676198671543172,"score_spread":0.2342219942705257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037695460","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017905746,0.0022053774,0.95682204,0.0023696062,0.00053079135,0.00014167097,0.00011429052,0.00031242325,0.019598015],"genre_scores_gemma":[0.75469047,0.0020708956,0.21722955,0.0014224075,0.0010850308,0.00022533769,0.00022335372,0.00033118043,0.022721859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945168,0.0017125595,0.00017131901,0.0014468096,0.0014859965,0.0006665598],"domain_scores_gemma":[0.9926041,0.004047407,0.0003976685,0.001670354,0.00088677707,0.00039371062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049148435,0.0011614563,0.001821777,0.001114822,0.003121925,0.0029785112,0.004432275,0.00311694,0.006324113],"category_scores_gemma":[0.01725073,0.00056423544,0.0012951653,0.002236614,0.0036391716,0.0073106084,0.0036255764,0.0038034625,0.0011332284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018396924,0.00009661648,0.00070523925,0.00014560147,0.000073706564,0.00014461327,0.00040138914,0.2093722,0.0012783802,0.7260173,0.0073297764,0.054251228],"study_design_scores_gemma":[0.00004085439,0.0000668856,0.00020484031,0.00003254026,0.000027304111,0.0002049002,0.00010551031,0.5327991,0.0016315082,0.45286754,0.011981121,0.00003780771],"about_ca_topic_score_codex":0.0053298213,"about_ca_topic_score_gemma":0.0031667782,"teacher_disagreement_score":0.006324113,"about_ca_system_score_codex":0.004931226,"about_ca_system_score_gemma":0.0028011561,"threshold_uncertainty_score":0.0357787},"labels":[],"label_agreement":null},{"id":"W3037891713","doi":"10.4230/lipics.sea.2020.27","title":"Path Query Data Structures in Practice","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Data structure; Tree traversal; Path (computing); Pointer (user interface); Theoretical computer science; Data mining; Algorithm; Artificial intelligence","score_opus":0.04467023161662047,"score_gpt":0.3016617124805083,"score_spread":0.25699148086388784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037891713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17692149,0.0023642872,0.72660697,0.0036863948,0.0006458555,0.0017047309,0.013628184,0.05905475,0.015387314],"genre_scores_gemma":[0.35364053,0.000918813,0.6144899,0.0010007841,0.00012075416,0.0017521494,0.0197226,0.0034589092,0.004895488],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9812321,0.0037636084,0.002663169,0.002704236,0.008434598,0.0012022896],"domain_scores_gemma":[0.9491027,0.022067595,0.0018641853,0.020376015,0.005870601,0.00071891013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0086817825,0.0015782522,0.0013382625,0.0018556744,0.0014625423,0.0046732198,0.004531453,0.0032244774,0.01411796],"category_scores_gemma":[0.05901762,0.0010098072,0.0012539924,0.006645584,0.00193741,0.017789187,0.005096621,0.0035094419,0.0052043837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004889657,0.00204282,0.012822365,0.002938944,0.00032285476,0.0005515051,0.0022708143,0.08997218,0.038404834,0.17853506,0.13547911,0.53176993],"study_design_scores_gemma":[0.0010867239,0.0021324924,0.0023873455,0.00033342207,0.00016990957,0.0009258818,0.0015297272,0.5701738,0.06469112,0.22896774,0.12739503,0.00020681196],"about_ca_topic_score_codex":0.003285271,"about_ca_topic_score_gemma":0.0025316784,"teacher_disagreement_score":0.01411796,"about_ca_system_score_codex":0.0022619877,"about_ca_system_score_gemma":0.0038611325,"threshold_uncertainty_score":0.04722929},"labels":[],"label_agreement":null},{"id":"W3038043972","doi":"10.4230/lipics.icalp.2020.87","title":"On the Complexity of Zero Gap MIP*","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decidability; Complexity class; Class (philosophy); Connection (principal bundle); Discrete mathematics; Mathematical proof; Computability; PSPACE; Mathematics; Quantum complexity theory; Set (abstract data type); Core (optical fiber); Complement (music); Computer science; Operator (biology); Hierarchy; Computational complexity theory; Quantum; Time complexity; Quantum computer; Algorithm","score_opus":0.09277187158679966,"score_gpt":0.26941137540116816,"score_spread":0.1766395038143685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038043972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7422492,0.0014159669,0.20070417,0.014037678,0.00012571161,0.00022104585,0.0017624599,0.000916034,0.03856767],"genre_scores_gemma":[0.975368,0.0004149377,0.018264549,0.00058810116,0.0001945592,0.00017924198,0.00094618107,0.00017857451,0.0038658746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99464154,0.0014666652,0.00025167677,0.0011429406,0.0015086946,0.0009883633],"domain_scores_gemma":[0.94599515,0.047807787,0.0018341424,0.002183287,0.0010210755,0.0011586593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037499766,0.00066121964,0.0012152583,0.0014190131,0.0021630174,0.007300632,0.0024433334,0.0018963505,0.0068097273],"category_scores_gemma":[0.022279425,0.0007147538,0.0018572774,0.0014166894,0.0045043114,0.012304494,0.0050297976,0.0068908515,0.000466371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005969372,0.00021516994,0.0047328267,0.00036209388,0.000091974,0.00024084427,0.0012991955,0.040012445,0.002890557,0.9187706,0.0057994113,0.024987927],"study_design_scores_gemma":[0.00004654571,0.000035888483,0.0010159952,0.0000322664,0.000033373104,0.00011606686,0.0002208742,0.13392587,0.0018784014,0.86076254,0.0019031795,0.000029022389],"about_ca_topic_score_codex":0.0026054012,"about_ca_topic_score_gemma":0.0012812751,"teacher_disagreement_score":0.007300632,"about_ca_system_score_codex":0.0047993627,"about_ca_system_score_gemma":0.0024884853,"threshold_uncertainty_score":0.034821987},"labels":[],"label_agreement":null},{"id":"W3038075884","doi":"10.4230/lipics.socg.2020.65","title":"Dense Graphs Have Rigid Parts","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; European Commission","keywords":"Embedding; Combinatorics; Line graph; Infinitesimal; Discrete mathematics; Graph; Mathematics; Connection (principal bundle); Graph embedding; Upper and lower bounds; Computer science; Geometry; Artificial intelligence","score_opus":0.02509235238038038,"score_gpt":0.2507870625630595,"score_spread":0.22569471018267911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038075884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6041711,0.0007968204,0.3450791,0.001249925,0.00014683603,0.00012144933,0.0006671749,0.0009849529,0.04678262],"genre_scores_gemma":[0.9457221,0.00036543695,0.04443049,0.0003291592,0.00008704907,0.000101616664,0.00074548926,0.00019028284,0.008028442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856347,0.00023709646,0.00010312539,0.0004825022,0.00033639185,0.0002774848],"domain_scores_gemma":[0.99387956,0.0023252456,0.0009142996,0.0016492533,0.0005012334,0.0007303447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006782367,0.0006667188,0.0007408359,0.0011020676,0.0016459001,0.001634587,0.0010913163,0.0014931323,0.012254127],"category_scores_gemma":[0.0056172763,0.0011025566,0.0010550115,0.00086589484,0.004316218,0.0052320794,0.003418668,0.0025797838,0.0017705897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003066745,0.000059559334,0.0031603773,0.00022796656,0.00003911782,0.0007113172,0.001145435,0.012444649,0.014840584,0.9445634,0.0025612123,0.019939732],"study_design_scores_gemma":[0.00005338995,0.00024325069,0.00320983,0.00007305521,0.000052309984,0.0010865277,0.0007735358,0.023949513,0.008194317,0.95028615,0.01202696,0.000051256553],"about_ca_topic_score_codex":0.00094214774,"about_ca_topic_score_gemma":0.0012323492,"teacher_disagreement_score":0.012254127,"about_ca_system_score_codex":0.0006198381,"about_ca_system_score_gemma":0.0002806398,"threshold_uncertainty_score":0.040994108},"labels":[],"label_agreement":null},{"id":"W3042622665","doi":"10.4230/lipics.icalp.2022.71","title":"Downsampling for Testing and Learning in Product Distributions","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upsampling; Property testing; Monotonic function; Polynomial; Product (mathematics); Mathematics; Distribution (mathematics); Constant (computer programming); Regular polygon; Connection (principal bundle); Combinatorics; Discrete mathematics; Sample complexity; Time complexity; Function (biology); Sample (material); Algorithm; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.03634888266614139,"score_gpt":0.2872981621214975,"score_spread":0.2509492794553561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042622665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017898878,0.00031582397,0.978297,0.00073125877,0.00004674389,0.000084478546,0.00013988485,0.000685959,0.0018000265],"genre_scores_gemma":[0.3867923,0.0004199056,0.60698473,0.0006867874,0.0003141009,0.0004837709,0.0008440076,0.00031938855,0.003155064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459153,0.002020238,0.00024952856,0.0013939502,0.0013643007,0.0003803891],"domain_scores_gemma":[0.9697337,0.023083903,0.0012784044,0.0040411595,0.0012594551,0.000603274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076571126,0.0017733747,0.0019352629,0.0016035716,0.0008724773,0.0020202096,0.0033765337,0.0017311127,0.0044407416],"category_scores_gemma":[0.038009603,0.0009880926,0.0021397471,0.0014754941,0.0035592827,0.008285429,0.0040051616,0.005065198,0.0009703463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012007898,0.00047823734,0.0062402682,0.00048023986,0.00023819836,0.00036869882,0.00046366674,0.30626494,0.0070523433,0.38937443,0.009538823,0.27829942],"study_design_scores_gemma":[0.00004124418,0.00006165688,0.00031225974,0.000015400423,0.000019874584,0.00008853233,0.000018040875,0.86869097,0.0023491129,0.1275363,0.00085541216,0.000011197477],"about_ca_topic_score_codex":0.002333326,"about_ca_topic_score_gemma":0.0017051161,"teacher_disagreement_score":0.0076571126,"about_ca_system_score_codex":0.0024355946,"about_ca_system_score_gemma":0.0018025031,"threshold_uncertainty_score":0.040495157},"labels":[],"label_agreement":null},{"id":"W3048149130","doi":"10.4230/lipics.icalp.2020.118","title":"A Recipe for Quantum Graphical Languages","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Recipe; Computer science; Programming language; Theoretical computer science; History","score_opus":0.02432635080196455,"score_gpt":0.30179505609517104,"score_spread":0.2774687052932065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048149130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034088,0.0012964172,0.9205825,0.008217128,0.0010783817,0.00018400524,0.00058962684,0.0014920163,0.06315116],"genre_scores_gemma":[0.13096902,0.0015997227,0.811779,0.0052427584,0.0009035491,0.00083472586,0.00063680654,0.001991998,0.046042334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816763,0.0006321706,0.00015479304,0.00039099986,0.0004924208,0.00016202443],"domain_scores_gemma":[0.99822456,0.00067845697,0.00006691569,0.00048742752,0.0003770613,0.00016559739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002473509,0.0010160247,0.0008247163,0.0021872586,0.0026108504,0.0047505824,0.0024988425,0.002701531,0.033073395],"category_scores_gemma":[0.006295594,0.0009883821,0.002583198,0.0013660926,0.0052281423,0.010215388,0.005274887,0.0067394143,0.007845801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035003707,0.0000057960942,0.000022320684,0.000023536992,0.000002721203,0.000029362967,0.0001729189,0.00017853711,0.00023868658,0.9935962,0.0026547175,0.0030716155],"study_design_scores_gemma":[0.000007901371,0.0000061505425,0.000024575978,0.000023497885,0.000004164794,0.00006926894,0.00005583476,0.0015997142,0.0002663509,0.9612705,0.03665775,0.000014329847],"about_ca_topic_score_codex":0.0016069264,"about_ca_topic_score_gemma":0.0021769032,"teacher_disagreement_score":0.033073395,"about_ca_system_score_codex":0.0015982724,"about_ca_system_score_gemma":0.001310182,"threshold_uncertainty_score":0.11064154},"labels":[],"label_agreement":null},{"id":"W3082438618","doi":"10.4230/lipics.esa.2020.69","title":"On the Computational Complexity of Linear Discrepancy","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Matrix (chemical analysis); Computational complexity theory; Exponential function; Constant (computer programming); Row and column spaces; Bounded function; Linear system; Discrete mathematics; Approximation algorithm; Linear programming; Algorithm; Combinatorics; Applied mathematics; Row; Computer science; Mathematical analysis","score_opus":0.1430395375713346,"score_gpt":0.3338956725879022,"score_spread":0.1908561350165676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082438618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18504792,0.0040937173,0.75366586,0.015045536,0.0005002991,0.00027819694,0.0018659073,0.002019893,0.03748268],"genre_scores_gemma":[0.74928606,0.0020557726,0.2332325,0.0017938352,0.0008046722,0.00075577176,0.0022112634,0.0010516916,0.008808364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99007857,0.0040804255,0.000482984,0.0017374554,0.00249793,0.0011226624],"domain_scores_gemma":[0.91055155,0.07731304,0.0022184295,0.0068011233,0.0023483206,0.00076752936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006300354,0.0015653275,0.0021336826,0.0015608431,0.0018082123,0.0051214714,0.0036474892,0.0021354568,0.0071225115],"category_scores_gemma":[0.051886503,0.0008551731,0.001863447,0.0033515322,0.005431519,0.010972403,0.0054504327,0.007335403,0.001562789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021154874,0.0004311503,0.00585105,0.00086504215,0.00019688465,0.00030242736,0.00085320766,0.3835232,0.0047151367,0.49496806,0.019932453,0.086245954],"study_design_scores_gemma":[0.00010013,0.000050827155,0.00048821414,0.00004382904,0.000028016013,0.00009007778,0.000084625484,0.6103048,0.0012955802,0.38553596,0.0019503495,0.000027633321],"about_ca_topic_score_codex":0.0037761633,"about_ca_topic_score_gemma":0.0027086702,"teacher_disagreement_score":0.0071225115,"about_ca_system_score_codex":0.0042779427,"about_ca_system_score_gemma":0.0027429683,"threshold_uncertainty_score":0.03331989},"labels":[],"label_agreement":null},{"id":"W3082716383","doi":"10.4230/lipics.approx/random.2020.18","title":"On Testing and Robust Characterizations of Convexity","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convexity; Computer science","score_opus":0.14247473325074667,"score_gpt":0.33722900295259484,"score_spread":0.19475426970184817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082716383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18366678,0.0008391143,0.80381286,0.0027406444,0.00010042592,0.00035534066,0.0013072795,0.0016980442,0.0054794075],"genre_scores_gemma":[0.8787848,0.00031257115,0.11557464,0.000732747,0.0002798632,0.00046066192,0.0020044083,0.0005218582,0.0013285541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9553638,0.019131687,0.003233424,0.0077832267,0.011191515,0.0032963692],"domain_scores_gemma":[0.6067125,0.3154538,0.019012308,0.046569657,0.008575822,0.003675965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02133064,0.0020150123,0.003674462,0.00320947,0.0018008266,0.006355049,0.0057983138,0.0040410417,0.0033073197],"category_scores_gemma":[0.18969029,0.0014346603,0.0033217978,0.0037531718,0.012978465,0.018230444,0.00981173,0.0071237925,0.000879251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005108145,0.00057609845,0.03326572,0.00060020783,0.0008032098,0.0011219573,0.0014154899,0.49232283,0.0155121125,0.33324328,0.008112147,0.1079188],"study_design_scores_gemma":[0.00011098947,0.00026782975,0.002258579,0.000053685642,0.000061731895,0.0004072099,0.00020781395,0.7903399,0.0064933007,0.19879171,0.0009370585,0.000070253926],"about_ca_topic_score_codex":0.0028950886,"about_ca_topic_score_gemma":0.0014219948,"teacher_disagreement_score":0.02133064,"about_ca_system_score_codex":0.0038234189,"about_ca_system_score_gemma":0.0027185034,"threshold_uncertainty_score":0.112808526},"labels":[],"label_agreement":null},{"id":"W3082756794","doi":"10.4230/lipics.itcs.2021.32","title":"Bounds on the QAC$^0$ Complexity of Approximating Parity","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Toffoli gate; Upper and lower bounds; Electronic circuit; Parity (physics); Qubit; Mathematics; Physics; Discrete mathematics; Quantum; Combinatorics; Quantum gate; Quantum mechanics; Mathematical analysis","score_opus":0.0579366486334525,"score_gpt":0.2758983058560783,"score_spread":0.21796165722262578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082756794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27118522,0.00516691,0.59428346,0.013678473,0.0006307953,0.0005384747,0.0034672408,0.0060321866,0.105017215],"genre_scores_gemma":[0.76687276,0.0027988306,0.20654118,0.003021352,0.00063222996,0.0010006112,0.0031007703,0.0010047148,0.015027508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954189,0.0007876134,0.0002165466,0.0009023894,0.0018998135,0.0007748071],"domain_scores_gemma":[0.96981746,0.0231312,0.00081554695,0.004303801,0.0013461891,0.0005858267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033234735,0.0018832744,0.0011967032,0.0013416065,0.0014175342,0.0041278536,0.004122784,0.0025823715,0.01395062],"category_scores_gemma":[0.029171268,0.0009944495,0.0020293158,0.001505935,0.0042594317,0.01053086,0.0054865656,0.0066649434,0.0027263279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025124736,0.00044862248,0.0070399246,0.0013707714,0.00021945815,0.0003409636,0.0007284216,0.24296497,0.052358367,0.5176569,0.029758465,0.1446006],"study_design_scores_gemma":[0.00018775882,0.00025750816,0.00200406,0.00021597372,0.00014585581,0.00033022664,0.00012127362,0.6540856,0.028561164,0.30342138,0.010579554,0.000089709145],"about_ca_topic_score_codex":0.004142058,"about_ca_topic_score_gemma":0.0041340096,"teacher_disagreement_score":0.01395062,"about_ca_system_score_codex":0.005756403,"about_ca_system_score_gemma":0.0033887723,"threshold_uncertainty_score":0.046669483},"labels":[],"label_agreement":null},{"id":"W3082819694","doi":"10.4230/lipics.esa.2020.67","title":"Light Euclidean Spanners with Steiner Points","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Blavatnik Family Foundation","keywords":"Spanner; Combinatorics; Bounded function; Upper and lower bounds; Mathematics; Euclidean geometry; Point (geometry); Euclidean distance; Lightness; Discrete mathematics; Binary logarithm; Computer science; Geometry; Mathematical analysis; Artificial intelligence","score_opus":0.015175484887956319,"score_gpt":0.22441194505017908,"score_spread":0.20923646016222278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082819694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2993561,0.0012797939,0.65664643,0.00066076126,0.00018379658,0.00010153745,0.0007448612,0.0007988935,0.040227856],"genre_scores_gemma":[0.7409743,0.0011542405,0.22598547,0.00045553787,0.0002255205,0.00020339231,0.0012691972,0.0004409935,0.029291283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991794,0.000173568,0.00005192253,0.00021380972,0.00026162385,0.00011971983],"domain_scores_gemma":[0.9985588,0.0005661132,0.00021556919,0.00029989387,0.00015337486,0.00020631484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065302744,0.0007891535,0.000780279,0.0010771218,0.0006973044,0.0011961511,0.0011000319,0.0009947219,0.008778192],"category_scores_gemma":[0.004358931,0.00057890726,0.0008596649,0.0012378219,0.0015115847,0.00289233,0.0033790476,0.0021367753,0.002678023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002823667,0.000050504616,0.00080614875,0.00019275249,0.000040955623,0.0002535366,0.00038465718,0.04732479,0.013967185,0.88041407,0.0041578547,0.052125197],"study_design_scores_gemma":[0.000046855595,0.00018288058,0.00046816672,0.000045453864,0.00001743574,0.00029319426,0.00011096014,0.06001803,0.0051494087,0.9214145,0.012216202,0.00003698997],"about_ca_topic_score_codex":0.0004252552,"about_ca_topic_score_gemma":0.0006475722,"teacher_disagreement_score":0.008778192,"about_ca_system_score_codex":0.0007112483,"about_ca_system_score_gemma":0.00032634244,"threshold_uncertainty_score":0.029365957},"labels":[],"label_agreement":null},{"id":"W3090935379","doi":"10.4230/lipics.fun.2021.10","title":"Computational Fun with Sturdy and Flimsy Numbers","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Base (topology); Mathematics; Natural number; Computer science; Theoretical computer science; Arithmetic; Discrete mathematics; Algorithm","score_opus":0.015259475496861529,"score_gpt":0.2268073120333851,"score_spread":0.2115478365365236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090935379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1674468,0.0006144234,0.796116,0.0019742213,0.00016312694,0.00014056709,0.00026532792,0.00096016855,0.03231931],"genre_scores_gemma":[0.57875854,0.00033177235,0.40959823,0.0002866408,0.0002324234,0.00022108752,0.00034852073,0.0002097569,0.010013089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976114,0.0007522731,0.00019580733,0.00060229644,0.0006038018,0.0002345215],"domain_scores_gemma":[0.9899913,0.0073160417,0.0005040475,0.0013897469,0.0005350474,0.00026376508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659922,0.00074978004,0.0007290593,0.002159996,0.0017041715,0.004397469,0.0014958014,0.0012040765,0.009165603],"category_scores_gemma":[0.01839623,0.0006041794,0.0015835862,0.0018087942,0.00587444,0.010456611,0.0037489876,0.0022482793,0.0011549625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013549397,0.00003438186,0.0013012787,0.00013319401,0.000019162064,0.0000865018,0.0004547708,0.014847053,0.0011391118,0.94912106,0.0017819903,0.03094594],"study_design_scores_gemma":[0.000015580144,0.000024880597,0.00016044393,0.000032587337,0.000012106469,0.00011054295,0.00009305072,0.045927707,0.0020208077,0.94719833,0.004385388,0.000018657913],"about_ca_topic_score_codex":0.0007984366,"about_ca_topic_score_gemma":0.0011953544,"teacher_disagreement_score":0.009165603,"about_ca_system_score_codex":0.0018995273,"about_ca_system_score_gemma":0.000985418,"threshold_uncertainty_score":0.03066206},"labels":[],"label_agreement":null},{"id":"W3091285509","doi":"10.4230/lipics.types.2019.9","title":"Is Impredicativity Implicitly Implicit","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Consistency (knowledge bases); Recursion (computer science); Computer science; Focus (optics); Type (biology); Calculus (dental); Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.02894255553916048,"score_gpt":0.26671360330542876,"score_spread":0.23777104776626828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091285509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09158257,0.0011858719,0.8282698,0.009248824,0.0006080831,0.00011179289,0.0003169098,0.0024881084,0.06618803],"genre_scores_gemma":[0.88775563,0.0008199238,0.09579566,0.0023806435,0.00046476972,0.000139949,0.0002379793,0.0012282928,0.011177149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9835037,0.005869856,0.0014394061,0.0036901578,0.0039986474,0.0014982106],"domain_scores_gemma":[0.9605723,0.014013279,0.0018465063,0.018608687,0.004488101,0.000471227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015780754,0.00058969983,0.0014708255,0.0014320224,0.0027873006,0.0076743704,0.0037680548,0.0031796787,0.0052347803],"category_scores_gemma":[0.04036221,0.001983605,0.0016402119,0.0012347143,0.014371187,0.027354915,0.009487456,0.0072218017,0.0014549057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038235547,0.000015333,0.00077698944,0.000102642545,0.000030545234,0.00014344888,0.0015358869,0.0006971124,0.001118277,0.9869646,0.0005519975,0.008024932],"study_design_scores_gemma":[0.00003218552,0.000038683367,0.00027641343,0.00014110318,0.000108143526,0.00037318104,0.0004481612,0.00471093,0.005714952,0.9580749,0.030028462,0.000052915362],"about_ca_topic_score_codex":0.001650215,"about_ca_topic_score_gemma":0.0012098794,"teacher_disagreement_score":0.015780754,"about_ca_system_score_codex":0.0015762495,"about_ca_system_score_gemma":0.0028453548,"threshold_uncertainty_score":0.08345765},"labels":[],"label_agreement":null},{"id":"W3092889289","doi":"10.4230/lipics.socg.2019.15","title":"Preconditioning for the Geometric Transportation Problem","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computational geometry; Logarithm; Euclidean space; Transportation theory; Euclidean geometry; Mathematics; Geometric networks; Mathematical optimization; Dimension (graph theory); Geometric programming; Integer (computer science); Simple (philosophy); Approximation algorithm; Discrete mathematics; Combinatorics; Computer science; Graph theory; Algorithm; Geometry; Mathematical analysis","score_opus":0.013973836162577013,"score_gpt":0.23837965907272265,"score_spread":0.22440582291014563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092889289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015549155,0.0003984718,0.9739276,0.00070867396,0.00014997328,0.000101046964,0.00016293455,0.00092432834,0.008077832],"genre_scores_gemma":[0.3123133,0.00092468114,0.6758497,0.00062300754,0.00027894473,0.0004319824,0.0008704181,0.00047053545,0.008237409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999186,0.00022940773,0.000045091536,0.00020583284,0.00018908846,0.00014462741],"domain_scores_gemma":[0.9982358,0.0009044961,0.0001553366,0.00039355727,0.00020167451,0.00010905578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711511,0.0011850704,0.0010620857,0.00045420357,0.00073727395,0.0009021569,0.0011856976,0.0011723092,0.011365941],"category_scores_gemma":[0.006608769,0.0003539928,0.0009094385,0.00090511615,0.0013368992,0.0027980502,0.0018118755,0.0027365112,0.0018817156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067946326,0.00020763685,0.00119889,0.0004947162,0.000046766057,0.00020367895,0.00024460984,0.46613696,0.006335061,0.28296992,0.026912145,0.21457025],"study_design_scores_gemma":[0.00007063679,0.00012843106,0.0001837027,0.00003305449,0.000014927056,0.00008952903,0.00004984819,0.84124976,0.0019116345,0.14836957,0.007884742,0.000014033855],"about_ca_topic_score_codex":0.003159133,"about_ca_topic_score_gemma":0.0031827937,"teacher_disagreement_score":0.011365941,"about_ca_system_score_codex":0.0012125815,"about_ca_system_score_gemma":0.0017060166,"threshold_uncertainty_score":0.038022876},"labels":[],"label_agreement":null},{"id":"W3097401090","doi":"10.4230/lipics.icalp.2021.18","title":"Relaxed Locally Correctable Codes with Improved Parameters","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code word; Mathematics; Decoding methods; Block (permutation group theory); Combinatorics; Constant (computer programming); Discrete mathematics; Block code; List decoding; Algorithm; Computer science; Concatenated error correction code","score_opus":0.009338702257736227,"score_gpt":0.21309815665717333,"score_spread":0.2037594543994371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097401090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11233132,0.0018479575,0.8641547,0.0025772096,0.00024239464,0.00053024804,0.0016013602,0.0033130061,0.013401805],"genre_scores_gemma":[0.71774143,0.0012628266,0.26654238,0.0012871363,0.00023751592,0.0008867382,0.0019957186,0.0010130823,0.009033169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911624,0.00209547,0.00064135564,0.0018342825,0.0031974032,0.0010690821],"domain_scores_gemma":[0.9656037,0.017466547,0.0022495072,0.010962225,0.0029328405,0.00078516675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004087563,0.0018710704,0.0020807795,0.0011153171,0.0008927759,0.0032664896,0.0035593826,0.0030143003,0.0067986646],"category_scores_gemma":[0.047667615,0.0010651575,0.001360058,0.0020651105,0.0029394496,0.011447306,0.0070452173,0.00863743,0.0029207019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023054897,0.00029996433,0.0029657274,0.00064664544,0.00014368638,0.000442768,0.0012448125,0.5276796,0.035550438,0.32787165,0.007980883,0.092868306],"study_design_scores_gemma":[0.00032444866,0.00044014858,0.00043373983,0.0001451359,0.00007677524,0.00042207807,0.00019649888,0.785306,0.020253513,0.18271708,0.009489727,0.00019492007],"about_ca_topic_score_codex":0.0032698372,"about_ca_topic_score_gemma":0.0029050426,"teacher_disagreement_score":0.0067986646,"about_ca_system_score_codex":0.0035331924,"about_ca_system_score_gemma":0.003757132,"threshold_uncertainty_score":0.025635302},"labels":[],"label_agreement":null},{"id":"W3107440164","doi":"10.4230/darts.6.2.14","title":"Scala with Explicit Nulls (Artifact)","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scala; Artifact (error); Computer science; Programming language; Code (set theory); Compiler; Artificial intelligence; Java; Set (abstract data type)","score_opus":0.023753708714751277,"score_gpt":0.23508024529519364,"score_spread":0.21132653658044237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107440164","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003980172,0.00025135977,0.66223544,0.0018352967,0.003038792,0.00017761336,0.015081091,0.26280323,0.050596926],"genre_scores_gemma":[0.09678287,0.0009062449,0.49252853,0.00438361,0.0017524401,0.0009764501,0.04550435,0.250312,0.10685346],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970065,0.0005116771,0.0003056401,0.0004840795,0.0014053185,0.00028675428],"domain_scores_gemma":[0.990415,0.0013770816,0.00035492697,0.0056342115,0.0018809339,0.00033785801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028272348,0.001042457,0.0007534551,0.001006869,0.0013562513,0.0032740282,0.0032577484,0.0013736757,0.06746223],"category_scores_gemma":[0.011578377,0.0014219776,0.002038489,0.001669522,0.0019393648,0.004450712,0.00601103,0.0040592486,0.045501757],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005656681,0.00009208054,0.002480874,0.0008011254,0.00011683154,0.00041024503,0.00038272387,0.003816876,0.010177943,0.20195308,0.6735087,0.10569384],"study_design_scores_gemma":[0.00012240752,0.000023464394,0.00083098636,0.00009853607,0.00003560058,0.00025783936,0.000025389118,0.008202527,0.014387551,0.032066457,0.9438765,0.0000727082],"about_ca_topic_score_codex":0.007285414,"about_ca_topic_score_gemma":0.0067435843,"teacher_disagreement_score":0.06746223,"about_ca_system_score_codex":0.0018486476,"about_ca_system_score_gemma":0.0032873952,"threshold_uncertainty_score":0.22568369},"labels":[],"label_agreement":null},{"id":"W3110091335","doi":"10.4230/darts.6.2.10","title":"Blame for Null (Artifact)","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artifact (error); Blame; Artificial intelligence; Computer science; Mathematics; Psychology; Social psychology","score_opus":0.031812913883906356,"score_gpt":0.2555231901688151,"score_spread":0.22371027628490872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110091335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065587824,0.0019364893,0.617551,0.046985492,0.030518467,0.0002528474,0.0053123473,0.063731,0.22715361],"genre_scores_gemma":[0.19438106,0.0030905486,0.25605795,0.029203646,0.0074481787,0.0005582074,0.011129354,0.057382867,0.44074816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627703,0.0008822068,0.00023379496,0.00066751835,0.0016340778,0.00030528664],"domain_scores_gemma":[0.99348116,0.001599584,0.00023655746,0.0026692539,0.0017746226,0.00023887756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033215075,0.00093432586,0.0007827709,0.0019193314,0.0023805562,0.005195809,0.0023991468,0.0023964732,0.08855135],"category_scores_gemma":[0.012246322,0.00086967606,0.0017294309,0.0013363633,0.003693504,0.009503426,0.006281208,0.0046435357,0.034398217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011615742,0.000055732195,0.00050947646,0.00035080648,0.00003166096,0.00036883217,0.0005676655,0.0005941587,0.0032408058,0.48687324,0.44711393,0.060177576],"study_design_scores_gemma":[0.000022703558,0.00002341406,0.00023656228,0.00010198363,0.000017706723,0.00044614536,0.00007951785,0.0015571801,0.0052647367,0.080926545,0.91128045,0.000043049236],"about_ca_topic_score_codex":0.0043117306,"about_ca_topic_score_gemma":0.004941839,"teacher_disagreement_score":0.08855135,"about_ca_system_score_codex":0.0022919811,"about_ca_system_score_gemma":0.002569582,"threshold_uncertainty_score":0.29623377},"labels":[],"label_agreement":null},{"id":"W3112211311","doi":"10.4230/lipics.esa.2025.75","title":"An Improved Bound for Plane Covering Paths","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"Agence Nationale de la Recherche","keywords":"Kernelization; Randomized algorithm; Algorithm; Set cover problem; Upper and lower bounds; Mathematics; Deterministic algorithm; Line (geometry); Cover (algebra); Computational geometry; Monte Carlo method; Combinatorics; Time complexity; Set (abstract data type); Parameterized complexity; Computer science; Geometry; Mathematical analysis","score_opus":0.02555340797288808,"score_gpt":0.28108164930107316,"score_spread":0.2555282413281851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112211311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095629446,0.0071645854,0.8061525,0.0031273814,0.00066458626,0.00033516536,0.0024303237,0.0045041274,0.07999189],"genre_scores_gemma":[0.44172177,0.004609021,0.5260697,0.0010106934,0.00069965067,0.00058759266,0.0039032705,0.0016724422,0.019725863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604094,0.0004513787,0.00017689921,0.00074187695,0.0015661226,0.0010227235],"domain_scores_gemma":[0.9927206,0.0040417,0.00034657016,0.0015805134,0.0009278984,0.00038264078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001847076,0.0018590904,0.0015930474,0.0030129305,0.0016838763,0.0036705954,0.0032403618,0.0020030006,0.020860454],"category_scores_gemma":[0.015000735,0.00092336937,0.0021873042,0.004095627,0.0021060167,0.009285096,0.0053799115,0.0047030128,0.0048117912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017214813,0.00042666207,0.0066065583,0.0013496369,0.00021785336,0.00083291775,0.0009978117,0.19891499,0.037207257,0.28834915,0.061681002,0.40169466],"study_design_scores_gemma":[0.00011786299,0.0004202352,0.0030421657,0.00030567398,0.00024642964,0.0012153371,0.00031004558,0.6031232,0.016755845,0.2956488,0.07869613,0.00011823563],"about_ca_topic_score_codex":0.0045563537,"about_ca_topic_score_gemma":0.0042646527,"teacher_disagreement_score":0.020860454,"about_ca_system_score_codex":0.0027104008,"about_ca_system_score_gemma":0.0014279336,"threshold_uncertainty_score":0.06978518},"labels":[],"label_agreement":null},{"id":"W3115176827","doi":"10.4230/lipics.isaac.2020.31","title":"Flexible List Colorings in Graphs with Special Degeneracy Conditions","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Combinatorics; Degeneracy (biology); Treewidth; Mathematics; List coloring; Graph; Degree (music); Discrete mathematics; Pathwidth; Physics; Line graph; Graph power","score_opus":0.03325270291963795,"score_gpt":0.3085065180223265,"score_spread":0.27525381510268854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115176827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77248174,0.00081014726,0.20107652,0.0017282178,0.00008437839,0.00011593093,0.0014951922,0.0009462598,0.021261608],"genre_scores_gemma":[0.954546,0.00033861233,0.040292434,0.00042872035,0.0000879165,0.00011319285,0.0011151707,0.00020750571,0.002870335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734664,0.00056243717,0.00024908027,0.0008648787,0.0005130901,0.00046384212],"domain_scores_gemma":[0.9874068,0.00643347,0.0016720014,0.0027780135,0.0005149869,0.0011947535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001515002,0.00061486126,0.00091060903,0.001206175,0.0015974628,0.0024873212,0.0014742104,0.0012885365,0.004195607],"category_scores_gemma":[0.011621645,0.0008575243,0.0011774006,0.0016259452,0.0031124847,0.005576249,0.0030481594,0.003305833,0.00051712873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001017054,0.00020571945,0.011552462,0.0004574648,0.000083060164,0.0014911601,0.0021361655,0.07876761,0.022861646,0.83419156,0.004325434,0.04291056],"study_design_scores_gemma":[0.000076847784,0.00007404256,0.0019529042,0.000054185988,0.000032962078,0.00077197433,0.0003475578,0.067038484,0.0041579055,0.9217279,0.0037141908,0.00005103237],"about_ca_topic_score_codex":0.0011456797,"about_ca_topic_score_gemma":0.0012407753,"teacher_disagreement_score":0.004195607,"about_ca_system_score_codex":0.0017918871,"about_ca_system_score_gemma":0.0007214325,"threshold_uncertainty_score":0.014035702},"labels":[],"label_agreement":null},{"id":"W3116404732","doi":"10.4230/lipics.fsttcs.2020.33","title":"Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Algorithm; Computer science; Amortized analysis; Distributed algorithm; Vertex (graph theory); Sublinear function; Sequence (biology); Deterministic algorithm; Computation; Degree (music); Parallel algorithm; Combinatorics; Graph; Mathematics; Theoretical computer science; Data structure","score_opus":0.03316991790132955,"score_gpt":0.27476811442225246,"score_spread":0.2415981965209229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116404732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018050456,0.000575407,0.97344357,0.0004383107,0.000074232434,0.00016094507,0.0002802059,0.0017148827,0.005261966],"genre_scores_gemma":[0.35582083,0.00043419123,0.63597816,0.0002832507,0.00013067754,0.00041531335,0.0011526392,0.00055304787,0.005231842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973701,0.00054530584,0.00015620867,0.00087110454,0.00070241693,0.00035478428],"domain_scores_gemma":[0.9956813,0.0020240666,0.00033955037,0.0013384835,0.00042985968,0.00018662114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001956018,0.0010384712,0.0010761798,0.0009073002,0.0010536752,0.002119731,0.0034989847,0.0011977489,0.0052078706],"category_scores_gemma":[0.0060535097,0.00068877375,0.0008331418,0.0017575694,0.0012100892,0.004693164,0.0030037258,0.0017657123,0.0009698152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011757307,0.00033004826,0.0013185807,0.00057164417,0.00013126816,0.00011175573,0.00030139307,0.4545992,0.010721081,0.204933,0.014137144,0.31166908],"study_design_scores_gemma":[0.00010472001,0.000092772985,0.00019756872,0.000021601049,0.000026678314,0.00013023298,0.00004142679,0.83605784,0.003729699,0.1537945,0.005781554,0.000021419522],"about_ca_topic_score_codex":0.002019164,"about_ca_topic_score_gemma":0.0028905813,"teacher_disagreement_score":0.0052078706,"about_ca_system_score_codex":0.0019249658,"about_ca_system_score_gemma":0.001953017,"threshold_uncertainty_score":0.01742202},"labels":[],"label_agreement":null},{"id":"W3116777151","doi":"10.4230/lipics.isaac.2020.10","title":"Approximation Algorithms for Generalized Path Scheduling","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Queue; Path (computing); Algorithm; Computer science; Flow shop scheduling; Longest path problem; Mathematics; Mathematical optimization; Theoretical computer science; Shortest path problem; Graph","score_opus":0.050347934490476275,"score_gpt":0.2875827974597208,"score_spread":0.23723486296924454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116777151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015907431,0.0027005067,0.9633543,0.0010436213,0.00034007998,0.00018929783,0.00067780074,0.0015145111,0.014272498],"genre_scores_gemma":[0.33625042,0.0031559241,0.64154786,0.00071306026,0.00040686782,0.0007424167,0.0034636508,0.0007436355,0.012976223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985936,0.0005403475,0.000051236144,0.00027265903,0.00029931116,0.00024292669],"domain_scores_gemma":[0.9972844,0.0018018625,0.00021210202,0.00034265485,0.00022629643,0.00013278247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018077183,0.0021231761,0.0017964989,0.0014711379,0.0009853528,0.002195462,0.002773858,0.0020471623,0.012997838],"category_scores_gemma":[0.007994058,0.00073271873,0.0013860798,0.0028179341,0.0010611968,0.0036155821,0.0018403683,0.0029359735,0.0018021538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022571231,0.00011212735,0.0004800267,0.00024782083,0.00009276555,0.000068347035,0.00008374238,0.83110756,0.00041049524,0.07494585,0.015543847,0.07668158],"study_design_scores_gemma":[0.000047883703,0.00003532161,0.000071264694,0.000021995465,0.000012231724,0.000027259175,0.000025528816,0.92834646,0.00008291453,0.06851688,0.0028065462,0.0000057974516],"about_ca_topic_score_codex":0.008295065,"about_ca_topic_score_gemma":0.007903429,"teacher_disagreement_score":0.012997838,"about_ca_system_score_codex":0.0032944775,"about_ca_system_score_gemma":0.0028444051,"threshold_uncertainty_score":0.043482065},"labels":[],"label_agreement":null},{"id":"W3116827133","doi":"10.4230/lipics.isaac.2020.39","title":"Market Pricing for Matroid Rank Valuations","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Division of Mathematical Sciences; Nemzeti Kutatási, Fejlesztési és Innovaciós Alap; Research Institute for Mathematical Sciences; Japan Society for the Promotion of Science; Innovációs és Technológiai Minisztérium; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Magyar Tudományos Akadémia","keywords":"Matroid; Weighted matroid; Combinatorics; Rank (graph theory); Graphic matroid; Mathematics; Matroid partitioning; Partition (number theory); Conjecture; Base (topology); Discrete mathematics","score_opus":0.05232919747656014,"score_gpt":0.2469366637237974,"score_spread":0.19460746624723727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116827133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17375456,0.00055000733,0.80555093,0.0012134332,0.00007421691,0.00018151825,0.00021040128,0.00021437822,0.018250545],"genre_scores_gemma":[0.87193507,0.00034411807,0.121119,0.00015198826,0.00011986006,0.00017300884,0.00015675815,0.0000815097,0.005918663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969042,0.0015799808,0.000106750005,0.00044772017,0.0006107994,0.0003504948],"domain_scores_gemma":[0.9953382,0.0028200531,0.0005115151,0.0006904286,0.00032911045,0.00031058266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037276738,0.00068499014,0.0012635654,0.0009583877,0.0009122707,0.004260619,0.0018605253,0.0016581574,0.005647706],"category_scores_gemma":[0.013804645,0.0004986478,0.0010498496,0.0019129562,0.002394487,0.00938814,0.0018171316,0.0019152609,0.00057471794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008855336,0.000088128756,0.00048167928,0.00009584696,0.000032729862,0.00007435467,0.00014212867,0.05046145,0.0012962373,0.92705846,0.0010652171,0.019115265],"study_design_scores_gemma":[0.000035529916,0.000053588643,0.0001669169,0.000016399992,0.000014756593,0.00006953939,0.00007311125,0.28872868,0.00071800547,0.7079864,0.0021220497,0.000014976403],"about_ca_topic_score_codex":0.0006577859,"about_ca_topic_score_gemma":0.0007622986,"teacher_disagreement_score":0.005647706,"about_ca_system_score_codex":0.0019084939,"about_ca_system_score_gemma":0.0008636692,"threshold_uncertainty_score":0.019714057},"labels":[],"label_agreement":null},{"id":"W3127870088","doi":"10.4230/lipics.ccc.2021.6","title":"On the Power and Limitations of Branch and Cut","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Mathematical proof; Conjecture; Bounded function; Polynomial; Mathematics; Cutting-plane method; Integer (computer science); Exponential function; Integer programming; Algebraic number; Discrete mathematics; Pure mathematics; Algebra over a field; Combinatorics; Computer science; Geometry; Algorithm; Mathematical analysis","score_opus":0.05304068730325925,"score_gpt":0.2892556532147285,"score_spread":0.23621496591146926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127870088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033656813,0.026565146,0.7597819,0.05076938,0.0013136775,0.00029580022,0.0008613566,0.005704075,0.12105189],"genre_scores_gemma":[0.5087149,0.022315163,0.42923895,0.0098274965,0.0029069828,0.00083973695,0.0016136416,0.0059029968,0.018640207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.968864,0.01581817,0.00097438553,0.0035672877,0.008991363,0.0017847687],"domain_scores_gemma":[0.8040275,0.1626386,0.0022975502,0.023882678,0.0054668356,0.0016868075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026149984,0.0029376908,0.0022365213,0.0027035847,0.0030878137,0.01073141,0.0071641956,0.0039596516,0.022630887],"category_scores_gemma":[0.11345612,0.0028076328,0.0038172093,0.0043113073,0.012804862,0.047949832,0.010900508,0.023997754,0.008085637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005416614,0.00012242825,0.0011002383,0.0006250999,0.00009845026,0.00012598443,0.0005484264,0.020168595,0.000986346,0.8647141,0.014309355,0.09665937],"study_design_scores_gemma":[0.0001115558,0.000055083787,0.00014664096,0.0003600854,0.000057624016,0.00008259433,0.00009616683,0.055905458,0.0010879798,0.9195797,0.022482263,0.0000350496],"about_ca_topic_score_codex":0.006881376,"about_ca_topic_score_gemma":0.004506189,"teacher_disagreement_score":0.026149984,"about_ca_system_score_codex":0.007036607,"about_ca_system_score_gemma":0.0058950013,"threshold_uncertainty_score":0.13829601},"labels":[],"label_agreement":null},{"id":"W3131743673","doi":"10.4230/lipics.disc.2021.43","title":"Brief Announcement: Fast Graphical Population Protocols","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Population; Medicine; Environmental health","score_opus":0.02080968731075352,"score_gpt":0.28884518879494614,"score_spread":0.26803550148419264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131743673","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018180057,0.005960343,0.82857317,0.03844736,0.013155864,0.0005632064,0.005467041,0.014103807,0.07554922],"genre_scores_gemma":[0.5341469,0.012506549,0.27378812,0.014759389,0.01297073,0.002555979,0.01741125,0.005064827,0.12679635],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980021,0.0008192939,0.00007055248,0.00032775194,0.0005599391,0.00022026771],"domain_scores_gemma":[0.9946708,0.0031527579,0.00022911036,0.0009097672,0.0005711796,0.00046637238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021511212,0.0010006479,0.0008920663,0.0007903346,0.0011579595,0.0022452008,0.0023634331,0.0025774243,0.036226448],"category_scores_gemma":[0.01816338,0.0007333786,0.0009118115,0.0016260303,0.0010794973,0.005603061,0.0021686638,0.004565691,0.00928976],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006275358,0.00012660027,0.0010098253,0.0005767683,0.00012730878,0.00028952857,0.00022580755,0.04999017,0.004954684,0.36597317,0.45929047,0.11680826],"study_design_scores_gemma":[0.00038184668,0.00020917655,0.00060958555,0.00014791782,0.0000737537,0.0003678663,0.000073082934,0.2661577,0.0039682398,0.394733,0.33316684,0.000111005626],"about_ca_topic_score_codex":0.001709438,"about_ca_topic_score_gemma":0.0022973402,"teacher_disagreement_score":0.036226448,"about_ca_system_score_codex":0.0020142847,"about_ca_system_score_gemma":0.0014213482,"threshold_uncertainty_score":0.121189535},"labels":[],"label_agreement":null},{"id":"W3133750907","doi":"10.4230/lipics.socg.2017.28","title":"Dynamic Orthogonal Range Searching on the RAM, Revisited","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Combinatorics; Binary logarithm; Log-log plot; Range (aeronautics); Data structure; Mathematics; Upper and lower bounds; Computational geometry; Amortized analysis; Constant (computer programming); Word (group theory); Algorithm; Computer science; Geometry; Mathematical analysis","score_opus":0.025036970799697925,"score_gpt":0.29309773481931123,"score_spread":0.2680607640196133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133750907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12570919,0.0057719583,0.8400382,0.0033927502,0.00037422625,0.00015812014,0.0007538279,0.0027476454,0.021054063],"genre_scores_gemma":[0.6342789,0.0032093711,0.35003296,0.0009677081,0.00058572565,0.00028982005,0.00083559164,0.00044372902,0.009356193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738485,0.00066460576,0.00015870998,0.00059952843,0.0008176701,0.0003745718],"domain_scores_gemma":[0.993679,0.0024289219,0.0006369082,0.00268287,0.0003479909,0.00022427754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017735005,0.0009036745,0.0017388676,0.0015290173,0.0008619669,0.0026531543,0.0034864314,0.0012255261,0.005661551],"category_scores_gemma":[0.011202302,0.00067613344,0.00070473866,0.00427645,0.002470225,0.0135203665,0.005782412,0.0021404242,0.0018908171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012154776,0.00033211202,0.0036596188,0.00061290554,0.0001092129,0.00045704786,0.0009127282,0.11200957,0.017983405,0.48456886,0.02220003,0.35593912],"study_design_scores_gemma":[0.0001180977,0.00051549025,0.0008442489,0.00012231806,0.00006581232,0.0011353237,0.00041404396,0.632917,0.014553306,0.3232883,0.025916098,0.000110032044],"about_ca_topic_score_codex":0.0013703208,"about_ca_topic_score_gemma":0.0012649345,"teacher_disagreement_score":0.005661551,"about_ca_system_score_codex":0.0009579449,"about_ca_system_score_gemma":0.0008059089,"threshold_uncertainty_score":0.018939734},"labels":[],"label_agreement":null},{"id":"W3138772443","doi":"10.4230/lipics.icdt.2021.3","title":"Box Covers and Domain Orderings for Beyond Worst-Case Join Processing","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Computer science; Join (topology); Generalization; Domain (mathematical analysis); Cover (algebra); Set (abstract data type); Algorithm; Approximation algorithm; Block (permutation group theory); Certificate; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics","score_opus":0.015119934348414504,"score_gpt":0.2510682944724922,"score_spread":0.2359483601240777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138772443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035533383,0.00048804146,0.95652276,0.00054567115,0.000047578582,0.00011449081,0.00033958044,0.0025771896,0.003831299],"genre_scores_gemma":[0.2653891,0.000470909,0.72853905,0.00030868922,0.00018427912,0.00025159965,0.0015852952,0.00080309244,0.0024678223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616784,0.00068674696,0.00027259966,0.0007865405,0.0016405438,0.00044559254],"domain_scores_gemma":[0.98968995,0.0059303236,0.0006473757,0.0027784542,0.0006708193,0.0002830984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002604057,0.0010168672,0.0014295921,0.0014416738,0.0010622967,0.0029093262,0.0015137849,0.0011962485,0.004446439],"category_scores_gemma":[0.010664172,0.00093251123,0.0017209903,0.0025712166,0.0020923405,0.0077176136,0.0027416851,0.0033164774,0.0012629336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010759126,0.0004280358,0.0030189252,0.00047426668,0.00011918794,0.0002969397,0.00063944876,0.3326778,0.030347206,0.35088515,0.015252256,0.26478484],"study_design_scores_gemma":[0.00008995059,0.00016166418,0.0004549291,0.0000419558,0.00003784106,0.00022858435,0.00012136932,0.7431127,0.013888385,0.2316945,0.010132764,0.00003545176],"about_ca_topic_score_codex":0.0020319296,"about_ca_topic_score_gemma":0.0032204906,"teacher_disagreement_score":0.004446439,"about_ca_system_score_codex":0.0019414915,"about_ca_system_score_gemma":0.0025517074,"threshold_uncertainty_score":0.014874876},"labels":[],"label_agreement":null},{"id":"W3153655827","doi":"10.4230/lipics.socg.2021.50","title":"Near Neighbor Search via Efficient Average Distortion Embeddings","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Automated Road and Building Extraction","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Embedding; Metric space; Mathematics; Time complexity; Dimension (graph theory); Distortion (music); Metric (unit); Discrete mathematics; Polynomial; Theoretical computer science; Data structure; Computational complexity theory; Structural complexity theory; Linear space; Complexity class; Algorithm; Computer science; Combinatorics; Artificial intelligence","score_opus":0.007212224851921144,"score_gpt":0.22665971025551507,"score_spread":0.21944748540359393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153655827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044345982,0.0010961295,0.94433373,0.0009644965,0.00013689668,0.00020216376,0.0018422744,0.002279252,0.004799128],"genre_scores_gemma":[0.32087895,0.00070006796,0.6632714,0.0004213149,0.00016709676,0.0005282523,0.005848411,0.0006298899,0.007554571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530196,0.0010082804,0.00048105489,0.0011746269,0.0017536082,0.000280512],"domain_scores_gemma":[0.99305373,0.0021814036,0.0005805623,0.0030323938,0.0009023873,0.00024945274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020308935,0.001399244,0.0024233528,0.0018334071,0.0009498906,0.0037546179,0.003906033,0.0021029187,0.005704539],"category_scores_gemma":[0.020216053,0.00091464556,0.0015671328,0.0034359873,0.0016724691,0.010244419,0.005823785,0.0035594297,0.0032193013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013551565,0.00044814002,0.005084881,0.0007120689,0.00017464886,0.0002266701,0.0009357944,0.2562161,0.011098033,0.30215776,0.022762315,0.3988284],"study_design_scores_gemma":[0.000101368496,0.0003113408,0.0005385471,0.000056286197,0.000034429944,0.0002769732,0.00019479007,0.75456375,0.0055875583,0.22828884,0.009990001,0.000056050398],"about_ca_topic_score_codex":0.002900171,"about_ca_topic_score_gemma":0.0037129582,"teacher_disagreement_score":0.005704539,"about_ca_system_score_codex":0.0021868618,"about_ca_system_score_gemma":0.0018327127,"threshold_uncertainty_score":0.01908362},"labels":[],"label_agreement":null},{"id":"W3153906568","doi":"10.4230/lipics.socg.2021.35","title":"On Rich Lenses in Planar Arrangements of Circles and Related Problems","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Plane (geometry); Planar; Lens (geology); Pairwise comparison; Algebraic number; Mathematical proof; Point (geometry); Algebraic curve; Upper and lower bounds; Discrete mathematics; Geometry; Mathematical analysis; Computer science; Physics; Optics","score_opus":0.038478240735234384,"score_gpt":0.2916801594869693,"score_spread":0.2532019187517349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153906568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5912255,0.004964685,0.34536678,0.0027825823,0.00010910531,0.00020129584,0.0005532757,0.00026272837,0.054534055],"genre_scores_gemma":[0.9143556,0.0037169647,0.06947925,0.00027161874,0.00037211057,0.00019296705,0.00058351696,0.00008680669,0.010941116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972377,0.0008894267,0.00011389982,0.0004918713,0.0007052181,0.00056191016],"domain_scores_gemma":[0.9804811,0.0139250625,0.002619615,0.0010709433,0.0006259594,0.0012773877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021919496,0.0012971825,0.0017049513,0.0034165129,0.002900571,0.0031191304,0.0020632746,0.0018816179,0.010010007],"category_scores_gemma":[0.013449156,0.0008547845,0.0012229221,0.0038760996,0.004262309,0.008541156,0.0045929477,0.0031680926,0.0010721234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040400235,0.00012518787,0.0050050444,0.00044278742,0.00009283727,0.0006299905,0.0010711849,0.043964133,0.0046085985,0.9064781,0.0036803696,0.033497874],"study_design_scores_gemma":[0.00010940316,0.00022297524,0.003926213,0.000097951335,0.000085809064,0.0013383708,0.0010388092,0.1065596,0.004124198,0.86963516,0.012785587,0.000075890195],"about_ca_topic_score_codex":0.0019098378,"about_ca_topic_score_gemma":0.0013324629,"teacher_disagreement_score":0.010010007,"about_ca_system_score_codex":0.0020904755,"about_ca_system_score_gemma":0.00047775544,"threshold_uncertainty_score":0.033486784},"labels":[],"label_agreement":null},{"id":"W3155264699","doi":"10.4230/lipics.socg.2021.10","title":"Characterizing Universal Reconfigurability of Modular Pivoting Robots","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Reconfigurability; Vertex (graph theory); Modular design; Computer science; Set (abstract data type); Combinatorics; Reduction (mathematics); Process (computing); Mathematics; Topology (electrical circuits); Algorithm; Geometry; Embedded system","score_opus":0.02016749841390728,"score_gpt":0.23302990188346198,"score_spread":0.2128624034695547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155264699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34688032,0.0003904182,0.63705045,0.00048293686,0.00003895165,0.00019043456,0.00040944398,0.0013870174,0.013169997],"genre_scores_gemma":[0.9257218,0.00027817042,0.06986347,0.00013088001,0.000043287182,0.00021469264,0.0007326673,0.00018598288,0.0028290637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983134,0.00032389612,0.00011558701,0.0005349559,0.00033841562,0.00037374947],"domain_scores_gemma":[0.99382424,0.003639748,0.0008524755,0.001228917,0.00019360766,0.00026094532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009262679,0.0011637377,0.0009290702,0.0007086965,0.00073116325,0.0018397641,0.0023735284,0.001353276,0.0039441534],"category_scores_gemma":[0.0070089106,0.00087995204,0.0015165637,0.0010543695,0.003155314,0.0031273612,0.0035384477,0.0017341684,0.000618921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045783428,0.00013759756,0.0031293428,0.0007741667,0.00015727508,0.00053363666,0.00085100747,0.6667085,0.024027927,0.24751112,0.0031537528,0.052557833],"study_design_scores_gemma":[0.00012319034,0.0003045619,0.001151755,0.000062362764,0.00008371356,0.00039139914,0.00023844057,0.57006747,0.016880732,0.40603206,0.004614312,0.000050066323],"about_ca_topic_score_codex":0.00082097313,"about_ca_topic_score_gemma":0.00078557606,"teacher_disagreement_score":0.0039441534,"about_ca_system_score_codex":0.0009880507,"about_ca_system_score_gemma":0.0005608516,"threshold_uncertainty_score":0.013194501},"labels":[],"label_agreement":null},{"id":"W3158797200","doi":"10.4230/lipics.mfcs.2021.57","title":"Online Domination: The Value of Getting to Know All Your Neighbors","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bipartite graph; Combinatorics; Competitive analysis; Vertex (graph theory); Mathematics; Graph; Planar graph; Node (physics); Set (abstract data type); Computer science; Discrete mathematics; Upper and lower bounds","score_opus":0.030331920693422384,"score_gpt":0.3110980857950028,"score_spread":0.2807661651015804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158797200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30369702,0.0021079162,0.6556851,0.0057287198,0.0003219955,0.0002221756,0.0007745333,0.00079833774,0.030664224],"genre_scores_gemma":[0.94319123,0.0007886923,0.04937747,0.0005492282,0.00024748856,0.000114445684,0.0003073273,0.00020938304,0.005214862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963642,0.0013258273,0.00010882597,0.0009660651,0.00064484484,0.00059030054],"domain_scores_gemma":[0.96015334,0.030926157,0.0025492264,0.0032173006,0.001268727,0.0018852253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003683218,0.0012980872,0.0019726353,0.00087153126,0.0015742464,0.0029471673,0.004209971,0.001955828,0.005027364],"category_scores_gemma":[0.025551192,0.00064514397,0.0012701089,0.0016215036,0.0027285304,0.0094184475,0.002739807,0.002858359,0.0008045964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020943757,0.0007038296,0.009679949,0.0009575373,0.00056720193,0.00084755314,0.0010560455,0.48479453,0.018077895,0.32520625,0.0135813635,0.14243346],"study_design_scores_gemma":[0.000104777864,0.0003870252,0.001168004,0.000057417365,0.00015986105,0.00071104185,0.00020815362,0.7203291,0.0059422106,0.26495102,0.0059239967,0.000057393823],"about_ca_topic_score_codex":0.0019041073,"about_ca_topic_score_gemma":0.0012653628,"teacher_disagreement_score":0.005027364,"about_ca_system_score_codex":0.0024238753,"about_ca_system_score_gemma":0.0015068077,"threshold_uncertainty_score":0.019478977},"labels":[],"label_agreement":null},{"id":"W3165181736","doi":"10.4230/lipics.sea.2021.19","title":"A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Structural motif; Nucleic acid structure; Computer science; RNA; Riboswitch; Ribozyme; Computational biology; Theoretical computer science; Artificial intelligence; Algorithm; Non-coding RNA; Biology; Genetics","score_opus":0.04017379042250248,"score_gpt":0.2688525933420768,"score_spread":0.22867880291957432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165181736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1516209,0.0016931475,0.8405892,0.00030255504,0.00006757976,0.00015464958,0.0008340297,0.0007871142,0.003950863],"genre_scores_gemma":[0.7341816,0.000552229,0.26158634,0.00012695708,0.00012271598,0.00014950571,0.0015265173,0.00012310102,0.0016310514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991572,0.00018365518,0.0000782467,0.00025964997,0.0002458656,0.000075428674],"domain_scores_gemma":[0.99869305,0.0005208845,0.0002875422,0.0001905527,0.00020712132,0.00010084858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004747769,0.00056158606,0.00078985764,0.0066692475,0.00061479997,0.0010568474,0.0010077605,0.0012280494,0.0016596675],"category_scores_gemma":[0.0028194808,0.00019517996,0.00084716,0.0035271337,0.00078851,0.0019028191,0.0009790703,0.00063353195,0.0004464405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006916879,0.00049033616,0.03190821,0.0009677277,0.0006509498,0.000711379,0.0008595267,0.15511173,0.07828916,0.1318782,0.0060215853,0.59241945],"study_design_scores_gemma":[0.000034969962,0.00038420304,0.011628763,0.000058916972,0.00016054271,0.0009798817,0.00032798474,0.8729599,0.009484183,0.0959725,0.00793389,0.00007418902],"about_ca_topic_score_codex":0.0016582719,"about_ca_topic_score_gemma":0.0017928018,"teacher_disagreement_score":0.0066692475,"about_ca_system_score_codex":0.0006050683,"about_ca_system_score_gemma":0.00034377817,"threshold_uncertainty_score":0.005552113},"labels":[],"label_agreement":null},{"id":"W3167838610","doi":"10.4230/lipics.isaac.2021.39","title":"Multimodal Transportation with Ridesharing of Personal Vehicles","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Public transport; Transport engineering; Transit (satellite); Occupancy; Travel behavior; Travel time; Population; Transit system; Computer science; Engineering","score_opus":0.012633370514550827,"score_gpt":0.22722743999134454,"score_spread":0.21459406947679371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167838610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17231525,0.00052178855,0.81593615,0.00023142571,0.00007350735,0.0001302229,0.0004148364,0.0026767664,0.0077000237],"genre_scores_gemma":[0.9194552,0.00020643984,0.07484088,0.000042768945,0.0000441576,0.000051160783,0.0004287672,0.000063293635,0.004867392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993573,0.0001571896,0.000028950508,0.00023350996,0.000115976436,0.00010705751],"domain_scores_gemma":[0.999556,0.00008001504,0.0000488408,0.00018928987,0.000079570935,0.000046198253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042403268,0.00064874603,0.0009509319,0.0004396298,0.000953588,0.0011793594,0.0012482449,0.00074489054,0.0043302993],"category_scores_gemma":[0.0015649295,0.00028293495,0.0008880795,0.0010679364,0.00064229633,0.001263356,0.0013996289,0.0006749462,0.0009369659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019749119,0.00013511057,0.004175978,0.00012665089,0.00008139244,0.0002811095,0.00022487839,0.7673522,0.010593711,0.0080967145,0.0027633633,0.2059714],"study_design_scores_gemma":[0.000010608872,0.00009783157,0.0014693866,0.0000081153075,0.000030697087,0.00013193295,0.00006175069,0.9881776,0.0027197879,0.0037071449,0.003564414,0.000020766649],"about_ca_topic_score_codex":0.020137787,"about_ca_topic_score_gemma":0.020674089,"teacher_disagreement_score":0.020137787,"about_ca_system_score_codex":0.0009898131,"about_ca_system_score_gemma":0.000919181,"threshold_uncertainty_score":0.04004115},"labels":[],"label_agreement":null},{"id":"W3183449483","doi":"10.4230/lipics.icalp.2021.81","title":"Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Norm (philosophy); Job shop scheduling; Approximation algorithm; Random variable; Load balancing (electrical power); Mathematics; Monotone polygon; Mathematical optimization; Combinatorics; Discrete mathematics; Minification; Computer science; Statistics","score_opus":0.00950825918348574,"score_gpt":0.23621623706637002,"score_spread":0.22670797788288427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183449483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042382866,0.0013193872,0.9401312,0.0016496234,0.00034809043,0.00015964708,0.00053926645,0.0013489397,0.012120942],"genre_scores_gemma":[0.6002936,0.0015030139,0.38331357,0.0009431296,0.0006626245,0.00056675705,0.0015637474,0.0015313185,0.009622216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974854,0.00065887533,0.0001150151,0.00070134783,0.00062747655,0.00041187825],"domain_scores_gemma":[0.99686617,0.0017482474,0.00038452828,0.00046848168,0.0003274738,0.00020497596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026692017,0.003062492,0.002720799,0.0007807472,0.00097492855,0.0024652306,0.0023466004,0.0017389306,0.0043256017],"category_scores_gemma":[0.01019356,0.00094609807,0.0013766355,0.001748926,0.0015675775,0.004479279,0.001999434,0.0025786539,0.0012190877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006264113,0.0002231162,0.0006634982,0.00067939487,0.00011793009,0.00011420468,0.00015623942,0.8503946,0.0049499343,0.05807022,0.010950524,0.07305384],"study_design_scores_gemma":[0.0000361472,0.00012993207,0.00023474965,0.00003670355,0.00001711227,0.00006582502,0.000045430632,0.9050209,0.0013665034,0.090946406,0.0020864306,0.000013765736],"about_ca_topic_score_codex":0.0025457297,"about_ca_topic_score_gemma":0.002576201,"teacher_disagreement_score":0.0043256017,"about_ca_system_score_codex":0.0017193714,"about_ca_system_score_gemma":0.0023143375,"threshold_uncertainty_score":0.014470577},"labels":[],"label_agreement":null},{"id":"W3184117305","doi":"10.4230/lipics.icalp.2021.2","title":"Symmetries and Complexity (Invited Talk)","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Homogeneous space; Computer science; Theoretical computer science; Algebraic number; Algebra over a field; Constraint (computer-aided design); Mathematical optimization; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.027038361841987664,"score_gpt":0.2497060505491352,"score_spread":0.22266768870714754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184117305","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015948832,0.30591154,0.05831883,0.17096381,0.06762655,0.00009840564,0.0020070777,0.0011108078,0.37801412],"genre_scores_gemma":[0.29085344,0.20676427,0.034820963,0.029160544,0.13741511,0.00041428773,0.0035580387,0.0013142377,0.29569903],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943525,0.00015344465,0.000020484276,0.00014374993,0.00017043478,0.00007654527],"domain_scores_gemma":[0.9991248,0.00055806316,0.000031740048,0.000047476093,0.0001286696,0.00010934856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009428936,0.00084225583,0.00077514467,0.001203796,0.0009992346,0.002820308,0.0005321296,0.0014527426,0.03487827],"category_scores_gemma":[0.0028229766,0.0003927456,0.00080613774,0.0012308095,0.0013423715,0.004325838,0.0016034395,0.003648645,0.0088153705],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006707337,0.00005721244,0.00030900718,0.00041602165,0.000048135822,0.00011785031,0.00034211477,0.0018173037,0.0009016052,0.4257568,0.49698702,0.07317981],"study_design_scores_gemma":[0.000028258843,0.000035808036,0.00064182153,0.0002162215,0.000027387478,0.00022187148,0.00015933126,0.0013766366,0.0005454232,0.47140795,0.5253071,0.000032209304],"about_ca_topic_score_codex":0.0010015774,"about_ca_topic_score_gemma":0.00089952094,"teacher_disagreement_score":0.03487827,"about_ca_system_score_codex":0.0018729334,"about_ca_system_score_gemma":0.0005926111,"threshold_uncertainty_score":0.11667949},"labels":[],"label_agreement":null},{"id":"W3184432724","doi":"10.4230/lipics.icalp.2021.67","title":"Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Rounding; Approximation algorithm; Combinatorics; Orienteering; Metric space; Path (computing); Constant (computer programming); Mathematics; Travelling salesman problem; Binary logarithm; Randomized rounding; Metric (unit); Point (geometry); Time complexity; Computer science; Discrete mathematics; Mathematical optimization","score_opus":0.014313825941000835,"score_gpt":0.2530143342341167,"score_spread":0.23870050829311584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184432724","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084075086,0.0032486622,0.88043845,0.0055603953,0.00061561674,0.00022785296,0.0014102577,0.0039081923,0.020515397],"genre_scores_gemma":[0.56560105,0.0019166495,0.4133964,0.001805966,0.0005814577,0.0003995054,0.0023796968,0.0012754776,0.012643774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974942,0.00064681267,0.00013132436,0.0006262383,0.0005653361,0.00053620536],"domain_scores_gemma":[0.9934012,0.0039743283,0.0005557872,0.0012501706,0.0003840178,0.00043445828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029916654,0.00213689,0.0022184597,0.0007486209,0.0013058075,0.0030228256,0.0033127377,0.0018905263,0.009164559],"category_scores_gemma":[0.014150272,0.0007441321,0.0018500059,0.002196005,0.0014853694,0.0063338084,0.0021243487,0.004213823,0.002169186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017006204,0.00068203546,0.0028545947,0.0011397011,0.00023395543,0.00032892346,0.0005992653,0.6829309,0.0059009157,0.17857772,0.032890473,0.0921609],"study_design_scores_gemma":[0.00019083532,0.00016502306,0.0003877639,0.000037849863,0.000039245,0.00012605316,0.00008581842,0.8159744,0.0007250037,0.17574474,0.006505449,0.000017693106],"about_ca_topic_score_codex":0.0071256044,"about_ca_topic_score_gemma":0.008726786,"teacher_disagreement_score":0.009164559,"about_ca_system_score_codex":0.0033483447,"about_ca_system_score_gemma":0.0028543305,"threshold_uncertainty_score":0.030658543},"labels":[],"label_agreement":null},{"id":"W3184553479","doi":"10.4230/lipics.icalp.2021.86","title":"Automorphisms and Isomorphisms of Maps in Linear Time","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Automorphism; Mathematics; Embedding; Antipodal point; Combinatorics; Isomorphism (crystallography); Homeomorphism (graph theory); Surface (topology); Vertex (graph theory); Discrete mathematics; Graph; Computer science; Geometry; Artificial intelligence","score_opus":0.022853191756842545,"score_gpt":0.2816594830081233,"score_spread":0.2588062912512808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184553479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2905604,0.0008130085,0.6585414,0.0015940242,0.00021250187,0.00043401384,0.0015062987,0.014336961,0.03200156],"genre_scores_gemma":[0.614522,0.00026923994,0.36324015,0.00033762556,0.00016385109,0.00039506378,0.004224127,0.0018393254,0.015008563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961134,0.00067712093,0.00023549335,0.0011233003,0.0011707285,0.00067998987],"domain_scores_gemma":[0.9935087,0.0039149323,0.00045409656,0.0014816531,0.0004012061,0.0002393699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011714742,0.0013134467,0.0011808584,0.0011437377,0.001476428,0.004732502,0.001938789,0.0012276067,0.013080821],"category_scores_gemma":[0.008035996,0.0008162849,0.0019755063,0.0018216781,0.0028556597,0.006692204,0.003173547,0.0023865497,0.004109453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002925591,0.00086018903,0.008592261,0.0012082326,0.00032135056,0.0010365188,0.0022991507,0.12873347,0.044805612,0.29347223,0.02266517,0.49308026],"study_design_scores_gemma":[0.00047699714,0.0003310625,0.0015171876,0.000058279,0.00015995966,0.00035428273,0.00044200956,0.24819942,0.026195819,0.7050712,0.01711934,0.000074446056],"about_ca_topic_score_codex":0.003564392,"about_ca_topic_score_gemma":0.0060754684,"teacher_disagreement_score":0.013080821,"about_ca_system_score_codex":0.002246204,"about_ca_system_score_gemma":0.0018155082,"threshold_uncertainty_score":0.043759763},"labels":[],"label_agreement":null},{"id":"W3185954029","doi":"10.4230/lipics.icalp.2021.44","title":"Lifting for Constant-Depth Circuits and Applications to MCSP","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Constant (computer programming); Electronic circuit; Computer science; Electrical engineering; Engineering","score_opus":0.024541543105000695,"score_gpt":0.2865105065907636,"score_spread":0.26196896348576293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185954029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082634926,0.0008180001,0.880229,0.00314207,0.0002088942,0.00024826892,0.0004316033,0.0020270785,0.030260142],"genre_scores_gemma":[0.6828341,0.0015788693,0.2971694,0.0012133014,0.00062185875,0.00044013324,0.0009028365,0.00065434043,0.014585091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980531,0.00027357932,0.000088076085,0.0003239933,0.00086849765,0.00039275864],"domain_scores_gemma":[0.99533325,0.0028023699,0.00018819723,0.001177296,0.0002806937,0.00021811949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017297248,0.0010731274,0.0009143693,0.0013237863,0.0011148608,0.002451984,0.0020386726,0.0011582893,0.009240453],"category_scores_gemma":[0.008488084,0.00074442365,0.00328023,0.0017543848,0.0026428,0.0060423105,0.005830031,0.0070296833,0.0014883397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022744524,0.00013878425,0.0011331411,0.00038704224,0.0000300828,0.00025354337,0.0005230103,0.052069888,0.014289516,0.8264938,0.0048213038,0.09963244],"study_design_scores_gemma":[0.000041623713,0.000074512966,0.00051679206,0.000065870125,0.000040599018,0.00021044935,0.00007396356,0.17592858,0.010694851,0.8020612,0.010259883,0.000031734155],"about_ca_topic_score_codex":0.0030678704,"about_ca_topic_score_gemma":0.001820898,"teacher_disagreement_score":0.009240453,"about_ca_system_score_codex":0.0039684004,"about_ca_system_score_gemma":0.0016556911,"threshold_uncertainty_score":0.0309124},"labels":[],"label_agreement":null},{"id":"W3186306330","doi":"10.4230/lipics.ccc.2021.30","title":"On Query-To-Communication Lifting for Adversary Bounds","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Communication complexity; Mathematics; Gadget; Adversary; Constant (computer programming); Computation; Quantum; Discrete mathematics; Secure two-party computation; Quantum computer; Bounded function; Theoretical computer science; Computer science; Combinatorics; Secure multi-party computation; Algorithm; Quantum mechanics","score_opus":0.012678107947237451,"score_gpt":0.2669322982956679,"score_spread":0.25425419034843044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186306330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036223628,0.00079178927,0.9042105,0.005631358,0.00036840673,0.00033750045,0.00033061393,0.00059302704,0.051513206],"genre_scores_gemma":[0.81040895,0.0018920195,0.15987825,0.003435118,0.0019518312,0.0012817553,0.0005640781,0.0007246529,0.019863322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98391634,0.004330596,0.0006733562,0.0026236624,0.005679739,0.002776285],"domain_scores_gemma":[0.9496573,0.03458267,0.002276972,0.009791799,0.0022354648,0.0014557673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012685358,0.0021531088,0.0020032313,0.0027826233,0.0033014023,0.0069403998,0.004626761,0.0034664862,0.016656594],"category_scores_gemma":[0.03889777,0.0012990958,0.0056491117,0.0028822303,0.009956924,0.025941364,0.014789012,0.017765906,0.0028418663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052255393,0.000057444213,0.00018207953,0.00007417433,0.00001882574,0.00006865619,0.00017902807,0.0068188272,0.0012822555,0.98378307,0.0010532404,0.006430132],"study_design_scores_gemma":[0.00002491942,0.00007685171,0.00019246698,0.000044131466,0.00003647141,0.00008121796,0.000048401078,0.07644757,0.0023432414,0.91682583,0.0038414057,0.000037499205],"about_ca_topic_score_codex":0.0020341878,"about_ca_topic_score_gemma":0.00076526863,"teacher_disagreement_score":0.016656594,"about_ca_system_score_codex":0.007394546,"about_ca_system_score_gemma":0.00276693,"threshold_uncertainty_score":0.06708741},"labels":[],"label_agreement":null},{"id":"W3186369772","doi":"10.4230/lipics.ccc.2021.36","title":"On the Pseudo-Deterministic Query Complexity of NP Search Problems","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Deterministic algorithm; Mathematics; Randomized algorithm; Computational complexity theory; Time complexity; Contrast (vision); Algorithm; Discrete mathematics; Theoretical computer science; Combinatorics; Computer science","score_opus":0.06558652675906523,"score_gpt":0.2789850136981461,"score_spread":0.21339848693908087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186369772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18499559,0.0041639567,0.76588506,0.015458068,0.00028399902,0.00047428985,0.0015237739,0.0014081098,0.025807152],"genre_scores_gemma":[0.85665846,0.002345732,0.12953117,0.0020258874,0.0007937924,0.0011642632,0.0013651298,0.00096013397,0.0051553817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97193366,0.013741051,0.0014501308,0.0040140483,0.0059182066,0.0029428313],"domain_scores_gemma":[0.6900069,0.28197515,0.005601136,0.016385801,0.003992402,0.0020385447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019207265,0.0017975124,0.0027919582,0.002423978,0.0030059172,0.00858067,0.0049555534,0.0035909656,0.0066807717],"category_scores_gemma":[0.12364596,0.0015818472,0.0033239631,0.004137615,0.010596418,0.019472701,0.006566675,0.010915318,0.0010956847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012212123,0.00049808354,0.0050071804,0.00083799765,0.00030459085,0.00019102207,0.00077446544,0.32848737,0.004432999,0.61738336,0.007115213,0.033746492],"study_design_scores_gemma":[0.00012826592,0.000103271486,0.00091490103,0.00006457512,0.000070209164,0.00012754393,0.000101291414,0.54630023,0.0015762188,0.44905064,0.0015087671,0.00005402348],"about_ca_topic_score_codex":0.0031560443,"about_ca_topic_score_gemma":0.0023053512,"teacher_disagreement_score":0.019207265,"about_ca_system_score_codex":0.008284704,"about_ca_system_score_gemma":0.0054332013,"threshold_uncertainty_score":0.10157895},"labels":[],"label_agreement":null},{"id":"W3186774379","doi":"10.4230/lipics.icalp.2021.9","title":"Almost-Linear-Time Weighted 𝓁 p -Norm Solvers in Slightly Dense Graphs via Sparsification.","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiplicative function; Mathematics; Voltage; Norm (philosophy); Iterative refinement; Combinatorics; Binary logarithm; Discrete mathematics; Applied mathematics; Algorithm; Mathematical analysis; Physics","score_opus":0.015473223014820708,"score_gpt":0.2422710938439041,"score_spread":0.2267978708290834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186774379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014439493,0.00032686608,0.9715881,0.00066153024,0.0001071071,0.00013644836,0.00046978262,0.0029944172,0.009276276],"genre_scores_gemma":[0.18831593,0.00025796323,0.79702926,0.0005691003,0.00012651335,0.00040662772,0.0024557214,0.0013809423,0.009457899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885356,0.00034736298,0.000055699584,0.0002772802,0.000284701,0.00018131663],"domain_scores_gemma":[0.996824,0.00204686,0.00018563081,0.0005384746,0.00027591072,0.00012916884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011662234,0.002440708,0.0011394504,0.00057437265,0.0004967445,0.0014545885,0.0018113382,0.0014530752,0.013307029],"category_scores_gemma":[0.00892533,0.00074850186,0.0011671836,0.0010671507,0.001022262,0.0030802402,0.0027647913,0.0030666366,0.0036938125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057151215,0.00021938773,0.0013502693,0.00063067506,0.00016226513,0.00027642585,0.00029747147,0.59334403,0.00733988,0.09200543,0.043423902,0.2603787],"study_design_scores_gemma":[0.00005764484,0.00004661784,0.0000957908,0.000023683897,0.000014051663,0.000056709,0.00004840333,0.92226094,0.0016723565,0.072842695,0.0028731325,0.00000793163],"about_ca_topic_score_codex":0.0036132773,"about_ca_topic_score_gemma":0.009738059,"teacher_disagreement_score":0.013307029,"about_ca_system_score_codex":0.0011030739,"about_ca_system_score_gemma":0.0015290631,"threshold_uncertainty_score":0.044516444},"labels":[],"label_agreement":null},{"id":"W3187834769","doi":"10.4230/lipics.disc.2021.13","title":"A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Air Force Office of Scientific Research; Institute for Basic Science; Agence Nationale de la Recherche; National Science Foundation","keywords":"Dominating set; Mathematics; Vertex (graph theory); Combinatorics; Approximation algorithm; Constant (computer programming); Graph; Independent set; Discrete mathematics; Degree (music); Algorithm; Computer science; Physics","score_opus":0.0237182243147758,"score_gpt":0.27425245885769994,"score_spread":0.2505342345429241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187834769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033087082,0.000540604,0.9578513,0.0006655183,0.000057949856,0.00020365967,0.00027271966,0.0019038573,0.005417283],"genre_scores_gemma":[0.3587496,0.0005180796,0.6310019,0.00036457588,0.00010328103,0.00066177634,0.0014508805,0.0005302213,0.0066196625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981205,0.00048005246,0.000098414734,0.00060201104,0.0004249974,0.00027406993],"domain_scores_gemma":[0.99678135,0.0016002995,0.00029726533,0.00083017856,0.0002487056,0.00024211955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567632,0.0010118888,0.0016623829,0.0009508826,0.0011160239,0.0017785407,0.0032305492,0.0011125018,0.0048101656],"category_scores_gemma":[0.0066975034,0.000641868,0.0009973919,0.00175684,0.0011052492,0.0037701514,0.004089763,0.0021349844,0.0017309512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012255199,0.0005583706,0.002040268,0.0011396052,0.0001800173,0.00024484852,0.0010459166,0.49380597,0.026856763,0.10841348,0.021329353,0.34315985],"study_design_scores_gemma":[0.0003192948,0.00036367457,0.0007080403,0.00007353322,0.0000796575,0.0002615558,0.00018433417,0.858926,0.0100601455,0.114572905,0.014405629,0.000045208802],"about_ca_topic_score_codex":0.0017572724,"about_ca_topic_score_gemma":0.0024293198,"teacher_disagreement_score":0.0048101656,"about_ca_system_score_codex":0.0017050966,"about_ca_system_score_gemma":0.0017708762,"threshold_uncertainty_score":0.016091585},"labels":[],"label_agreement":null},{"id":"W3189431800","doi":"10.4230/lipics.disc.2021.4","title":"Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Leader election; Computer science; Bounded function; Asynchronous communication; Logarithm; Concurrency; Randomized algorithm; Upper and lower bounds; Shared memory; Parallel computing; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Computer network","score_opus":0.026453677728506226,"score_gpt":0.2748358487098276,"score_spread":0.24838217098132134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189431800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100575276,0.0052335267,0.8384084,0.007272605,0.0006424962,0.00039108697,0.0010594396,0.004862575,0.04155455],"genre_scores_gemma":[0.8830969,0.0018120945,0.09404735,0.0014885704,0.00074284425,0.00072763546,0.0011948441,0.0018608479,0.015028988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98959607,0.0021658435,0.00042644938,0.0015562917,0.0030298864,0.0032254616],"domain_scores_gemma":[0.93563753,0.0486992,0.002637901,0.008565904,0.002494135,0.0019651866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059637167,0.0025670803,0.0025715076,0.0022902044,0.0030168449,0.0075676055,0.0054955175,0.0024373701,0.014179615],"category_scores_gemma":[0.03652096,0.001094326,0.0021224297,0.0021948207,0.0044179675,0.0148261795,0.00702953,0.007808622,0.0031593451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044669183,0.0011402378,0.006754723,0.001874785,0.00035840427,0.00069663394,0.0015017961,0.435481,0.03886373,0.3697743,0.026802633,0.1122847],"study_design_scores_gemma":[0.00015782066,0.0002242421,0.0006906372,0.00010645533,0.00012506044,0.00019174808,0.00016814253,0.73069113,0.014472637,0.24876851,0.004329876,0.00007368363],"about_ca_topic_score_codex":0.0012170381,"about_ca_topic_score_gemma":0.0019698078,"teacher_disagreement_score":0.014179615,"about_ca_system_score_codex":0.0051121893,"about_ca_system_score_gemma":0.0034688571,"threshold_uncertainty_score":0.047435522},"labels":[],"label_agreement":null},{"id":"W3191976396","doi":"10.4230/lipics.disc.2021.12","title":"Space and Time Bounded Multiversion Garbage Collection","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Horizon 2020 Framework Programme","keywords":"Garbage collection; Amortized analysis; Computer science; Garbage; Bounded function; Pointer (user interface); Concurrency; Constant (computer programming); Reachability; Concurrency control; Set (abstract data type); Data structure; Algorithm; Theoretical computer science; Programming language; Mathematics; Artificial intelligence","score_opus":0.01013403197380855,"score_gpt":0.23305664676178328,"score_spread":0.22292261478797473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191976396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077796183,0.0004234445,0.9854724,0.00015067554,0.000054831642,0.0000712619,0.00013845673,0.004038386,0.001870804],"genre_scores_gemma":[0.18417682,0.00046168847,0.8081536,0.00016321505,0.0000836574,0.00030713037,0.0006384612,0.0014466681,0.004568705],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945755,0.00075025845,0.0005033523,0.0009198086,0.0026311246,0.00061997556],"domain_scores_gemma":[0.986702,0.0028557442,0.0009949675,0.0075345826,0.0015675968,0.00034506342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003178825,0.0014346773,0.0012253678,0.0025165647,0.0018672656,0.0035623547,0.004609848,0.00088213896,0.0053043095],"category_scores_gemma":[0.010350782,0.00086490484,0.0016937959,0.0035482158,0.0030329071,0.006633379,0.0060761133,0.0021698393,0.0017924537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009309372,0.00020523164,0.0031488347,0.00097053027,0.00017575079,0.00023986527,0.0011505333,0.13282304,0.06525686,0.28806084,0.012566028,0.49447155],"study_design_scores_gemma":[0.00017791489,0.0003563827,0.00073462864,0.00018419346,0.00020241494,0.00054844224,0.0002259753,0.50657827,0.19704174,0.23293193,0.060803067,0.00021503767],"about_ca_topic_score_codex":0.0019917095,"about_ca_topic_score_gemma":0.0030269467,"teacher_disagreement_score":0.0053043095,"about_ca_system_score_codex":0.0021749216,"about_ca_system_score_gemma":0.003102604,"threshold_uncertainty_score":0.01774466},"labels":[],"label_agreement":null},{"id":"W3193009786","doi":"10.4230/lipics.itc.2021.18","title":"Differentially Private Approximations of a Convex Hull in Low Dimensions","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Convex hull; Mathematics; Convex body; Combinatorics; Regular polygon; Minimum bounding box; Kernel (algebra); Bounding overwatch; Euclidean space; Ball (mathematics); Hull; Approximation algorithm; Discrete mathematics; Geometry; Image (mathematics); Computer science; Artificial intelligence","score_opus":0.01235288857539698,"score_gpt":0.24311820232689443,"score_spread":0.23076531375149745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193009786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04872577,0.00031175127,0.94767565,0.00053527096,0.000035480192,0.000054628574,0.00026403042,0.00079815177,0.0015993138],"genre_scores_gemma":[0.66468346,0.00040415616,0.32780504,0.0003356258,0.00011337514,0.00016541893,0.0010550688,0.00022773948,0.0052101887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694854,0.00085091224,0.00018496405,0.00055490865,0.0010750124,0.00038581598],"domain_scores_gemma":[0.98976594,0.0046348968,0.0009695206,0.0035186233,0.0007176167,0.00039340943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027269502,0.0009964838,0.0018816583,0.0009795164,0.0008454915,0.0029693,0.0025649641,0.0016488433,0.00196645],"category_scores_gemma":[0.019118765,0.0008067199,0.0012491453,0.0015394739,0.0022012356,0.006930258,0.0051410226,0.0036237855,0.0007727359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017922764,0.00016783662,0.0051505296,0.00021840664,0.00015686896,0.0002295281,0.0007569294,0.5990727,0.013022056,0.25911906,0.0061180126,0.11419572],"study_design_scores_gemma":[0.000027719969,0.000065049346,0.000409751,0.000015145288,0.00001069061,0.00007129238,0.00005399985,0.92001164,0.0032967904,0.07483501,0.0011848569,0.000018055802],"about_ca_topic_score_codex":0.0032093327,"about_ca_topic_score_gemma":0.0026296473,"teacher_disagreement_score":0.0035519658,"about_ca_system_score_codex":0.0035519658,"about_ca_system_score_gemma":0.0013402336,"threshold_uncertainty_score":0.02577138},"labels":[],"label_agreement":null},{"id":"W3193864805","doi":"10.4230/lipics.esa.2021.58","title":"QCSP on Reflexive Tournaments","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Tournament; Mathematics; Constraint satisfaction problem; Graph; Statistics","score_opus":0.030196304247193714,"score_gpt":0.3282804791982487,"score_spread":0.298084174951055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193864805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18183048,0.0010012811,0.7858038,0.0038521038,0.0002519978,0.00039962004,0.0023317034,0.0010466796,0.02348246],"genre_scores_gemma":[0.7698987,0.0009005349,0.21232247,0.0012511844,0.00042516398,0.0005515916,0.0036109292,0.00029078967,0.010748651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966371,0.00086111523,0.00022776636,0.0008974841,0.0007736486,0.000602878],"domain_scores_gemma":[0.99032193,0.0065483777,0.0007920916,0.00095119904,0.0008000722,0.0005864203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018943064,0.0009815819,0.0011756496,0.0008250272,0.0012594049,0.0037124748,0.0020108884,0.001223714,0.008842974],"category_scores_gemma":[0.008922559,0.000515152,0.0018158159,0.0021768473,0.0018889604,0.0046243113,0.002862545,0.0037639365,0.0005709766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005657702,0.0004460488,0.002068418,0.000908436,0.00028296333,0.00079745264,0.0008676272,0.21802829,0.008683528,0.68746436,0.012597455,0.06728968],"study_design_scores_gemma":[0.00014071276,0.00009977438,0.0005051187,0.00004912395,0.0000622501,0.00019595648,0.000117543896,0.37978864,0.0017838094,0.61130744,0.005911964,0.000037644746],"about_ca_topic_score_codex":0.0047309347,"about_ca_topic_score_gemma":0.003186822,"teacher_disagreement_score":0.008842974,"about_ca_system_score_codex":0.0020223083,"about_ca_system_score_gemma":0.001378805,"threshold_uncertainty_score":0.02958268},"labels":[],"label_agreement":null},{"id":"W3194730801","doi":"10.4230/lipics.esa.2021.65","title":"The Visibility Center of a Simple Polygon","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple polygon; Visibility polygon; Visibility; Polygon (computer graphics); Geodesic; Center (category theory); Combinatorics; Star-shaped polygon; Polygon covering; Mathematics; Point (geometry); Set (abstract data type); Rectilinear polygon; Point in polygon; Polygon mesh; Geometry; Computer science; Regular polygon; Physics; Convex set; Optics","score_opus":0.017318214488164826,"score_gpt":0.27752543314692063,"score_spread":0.2602072186587558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194730801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10490856,0.00041148713,0.88081676,0.00022028638,0.00008955018,0.00012207578,0.00055547716,0.0008013791,0.012074463],"genre_scores_gemma":[0.5554221,0.00043603784,0.4376551,0.000049587405,0.000047569465,0.00010885655,0.0010630807,0.0004062698,0.0048114597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954826,0.000057449215,0.000026566919,0.00012866118,0.00016822865,0.000070805196],"domain_scores_gemma":[0.9993394,0.00022635501,0.00012715858,0.0001379242,0.00010255092,0.00006658062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022937589,0.0005004503,0.0006103462,0.0009586812,0.0005657608,0.0014038213,0.0009216079,0.0006108487,0.0038746288],"category_scores_gemma":[0.0025286241,0.00050920894,0.0005746533,0.0008594045,0.0013003065,0.0020413557,0.002360778,0.00089505425,0.00089315884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077543024,0.00012422298,0.005081297,0.0006322172,0.00009285416,0.001132158,0.0010796242,0.16909048,0.09420551,0.359853,0.009949901,0.35798332],"study_design_scores_gemma":[0.0001157528,0.00028141684,0.0023943014,0.000117007185,0.000051168645,0.0013031248,0.0004980672,0.64059776,0.06910501,0.235257,0.050177176,0.00010216981],"about_ca_topic_score_codex":0.0017500703,"about_ca_topic_score_gemma":0.0009657085,"teacher_disagreement_score":0.0038746288,"about_ca_system_score_codex":0.0004263572,"about_ca_system_score_gemma":0.0006789892,"threshold_uncertainty_score":0.012961924},"labels":[],"label_agreement":null},{"id":"W3196499363","doi":"10.4230/lipics.esa.2021.70","title":"Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Optimal binary search tree; Random binary tree; Ternary search tree; Binary tree; Range tree; Tree (set theory); Data structure; Binary search tree; K-ary tree; Weight-balanced tree; Interval tree; Range (aeronautics); Random access; Computer science; Mathematics; Combinatorics; Discrete mathematics; Binary number; Search tree; Algorithm; Tree structure; Search algorithm; Arithmetic","score_opus":0.036877857656343445,"score_gpt":0.274961936432509,"score_spread":0.23808407877616555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196499363","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051025998,0.00072620186,0.9358101,0.0006299094,0.00013138953,0.00014157622,0.0017363669,0.0042786333,0.005519894],"genre_scores_gemma":[0.42729893,0.0007213174,0.55675775,0.000747551,0.00017017784,0.0007794557,0.005169978,0.001781452,0.0065733846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828964,0.00017798877,0.00012714099,0.00025042196,0.0009591657,0.00019565511],"domain_scores_gemma":[0.9961398,0.0011808941,0.00031497763,0.0013118013,0.0009263378,0.0001261556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007946062,0.00058338663,0.00070595136,0.0012925115,0.0007060727,0.0013036552,0.0012853282,0.0008339015,0.0041292887],"category_scores_gemma":[0.009421873,0.00036923995,0.00053236936,0.0022983185,0.0012712894,0.0037648396,0.0029774536,0.0016165214,0.0016888469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058477215,0.00016903266,0.0030779347,0.0003881503,0.00005041714,0.00032945187,0.00074270676,0.09184779,0.0331742,0.36148036,0.024948427,0.48320678],"study_design_scores_gemma":[0.00008045276,0.00018157923,0.0006056891,0.00014645355,0.000027937795,0.00056619005,0.00019235794,0.65884876,0.04711946,0.26800054,0.024137847,0.00009270791],"about_ca_topic_score_codex":0.0022279613,"about_ca_topic_score_gemma":0.0030141885,"teacher_disagreement_score":0.0041292887,"about_ca_system_score_codex":0.0013311191,"about_ca_system_score_gemma":0.002309515,"threshold_uncertainty_score":0.013813853},"labels":[],"label_agreement":null},{"id":"W3198367481","doi":"10.4230/lipics.esa.2021.17","title":"Distant Representatives for Rectangles in the Plane","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Plane (geometry); Combinatorics; Approximation algorithm; Set (abstract data type); Constant (computer programming); Time complexity; Mathematics; Point (geometry); Polynomial; Computational geometry; Object (grammar); Polynomial-time approximation scheme; Discrete mathematics; Computer science; Algorithm; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.0225185920211277,"score_gpt":0.2908109689955102,"score_spread":0.26829237697438246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198367481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04727342,0.000702678,0.9470924,0.00040456018,0.000035189598,0.0000762473,0.00028708304,0.0010497737,0.0030786186],"genre_scores_gemma":[0.34416017,0.0007611572,0.6471047,0.00019853644,0.00007922406,0.00021240092,0.0024808005,0.0005336732,0.004469388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805486,0.0006092099,0.00010231191,0.0005397558,0.00047363894,0.00022026109],"domain_scores_gemma":[0.9973404,0.0013883093,0.00040014548,0.00053455634,0.00015963965,0.00017685519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015639651,0.0009245243,0.0014989818,0.001138969,0.0006220426,0.001691288,0.0016214696,0.0017464544,0.0055115004],"category_scores_gemma":[0.0074144807,0.0008238001,0.0010848788,0.0018715684,0.00089959893,0.0038446195,0.002624637,0.0019320586,0.0016506071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008556956,0.000271519,0.003214988,0.000543072,0.00009997452,0.00046290527,0.0006151488,0.4632381,0.017417254,0.20140219,0.019037902,0.2928412],"study_design_scores_gemma":[0.00009843651,0.00017807067,0.0006571656,0.00007471798,0.000026220672,0.0005206,0.00030987646,0.85526156,0.00911288,0.12107924,0.012653193,0.00002802079],"about_ca_topic_score_codex":0.0011802078,"about_ca_topic_score_gemma":0.0016949542,"teacher_disagreement_score":0.0055115004,"about_ca_system_score_codex":0.0008122822,"about_ca_system_score_gemma":0.00049804925,"threshold_uncertainty_score":0.018437803},"labels":[],"label_agreement":null},{"id":"W3198482522","doi":"10.4230/lipics.esa.2021.46","title":"Space Efficient Two-Dimensional Orthogonal Colored Range Counting","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Rectangle; Space (punctuation); Combinatorics; Mathematics; Multiplication (music); Linear space; Matrix (chemical analysis); Colored; Range (aeronautics); Set (abstract data type); Discrete mathematics; Upper and lower bounds; Algorithm; Computer science; Geometry","score_opus":0.013824082897404031,"score_gpt":0.2761275067103163,"score_spread":0.2623034238129122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198482522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04832909,0.0003783768,0.93309563,0.00067072763,0.0001486142,0.00026539798,0.0005649262,0.004396627,0.012150545],"genre_scores_gemma":[0.3928981,0.00022923115,0.5975418,0.00046194065,0.000098573786,0.0004469343,0.0017255889,0.0004380479,0.0061597493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953074,0.00090016105,0.0003467959,0.0008283354,0.0016274424,0.0009898973],"domain_scores_gemma":[0.9939288,0.0021275629,0.000423079,0.002460172,0.00077153306,0.00028879064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017452594,0.0010834571,0.0017310996,0.0012988731,0.0010464465,0.0032189924,0.0039899694,0.0015268516,0.00925118],"category_scores_gemma":[0.009832845,0.000482662,0.0013005226,0.0043626716,0.0013117447,0.006423874,0.0046668635,0.0015935161,0.0021486508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014163431,0.0008223963,0.0029949218,0.00063608744,0.00012601132,0.00033284555,0.00038608437,0.15605333,0.046775095,0.17953198,0.030259443,0.5806655],"study_design_scores_gemma":[0.00025795103,0.00026338507,0.0006661745,0.000041529394,0.000045425106,0.0004323708,0.00022281431,0.8614592,0.03197139,0.09449217,0.010057559,0.0000900593],"about_ca_topic_score_codex":0.0028027229,"about_ca_topic_score_gemma":0.0036814078,"teacher_disagreement_score":0.00925118,"about_ca_system_score_codex":0.0015043089,"about_ca_system_score_gemma":0.0026526155,"threshold_uncertainty_score":0.030948281},"labels":[],"label_agreement":null},{"id":"W3198931134","doi":"10.4230/lipics.calco.2021.7","title":"Tensor of Quantitative Equational Theories","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Physics and Python Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tensor (intrinsic definition); Theoretical physics; Mathematical physics; Mathematics; Physics; Pure mathematics","score_opus":0.023136533542534463,"score_gpt":0.2918314372074361,"score_spread":0.2686949036649016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198931134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02275219,0.00078122993,0.92750496,0.0016850604,0.00045570172,0.000100970174,0.00038420397,0.00059248606,0.0457431],"genre_scores_gemma":[0.6255222,0.0011727226,0.34412423,0.0011898868,0.0008870606,0.00041443788,0.00088857487,0.0005440796,0.025256809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936551,0.0015828026,0.00062473246,0.0010400625,0.0025061527,0.0005912829],"domain_scores_gemma":[0.99495244,0.0014214027,0.00051987835,0.00104708,0.0016907583,0.0003685295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056765843,0.00087679015,0.00085976656,0.0035181656,0.0018282527,0.004802274,0.0015248647,0.0010957156,0.0075932937],"category_scores_gemma":[0.006681522,0.000794969,0.0027525704,0.0015811665,0.0064243944,0.012056392,0.0047189943,0.0037283588,0.001424119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034533914,0.0000045391416,0.000050382798,0.000015524625,0.000005313413,0.00001665727,0.00010111933,0.00037426912,0.00021023065,0.9979336,0.00018934793,0.0010955352],"study_design_scores_gemma":[0.000005558148,0.000011579007,0.00006563402,0.000016071752,0.000015045866,0.000051030733,0.00005736949,0.0056432895,0.0005749988,0.9847472,0.008798949,0.000013183623],"about_ca_topic_score_codex":0.0020299407,"about_ca_topic_score_gemma":0.0016258995,"teacher_disagreement_score":0.0075932937,"about_ca_system_score_codex":0.0026929919,"about_ca_system_score_gemma":0.0019639977,"threshold_uncertainty_score":0.030021012},"labels":[],"label_agreement":null},{"id":"W3199722554","doi":"10.4230/lipics.isaac.2021.44","title":"Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Euclidean geometry; Matching (statistics); Planar graph; Planar; Approximation algorithm; Plane (geometry); Cover (algebra); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.02379987069991624,"score_gpt":0.27714837656340074,"score_spread":0.2533485058634845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199722554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13935272,0.006633318,0.80613387,0.003996799,0.0004117923,0.000571795,0.003816916,0.009991659,0.029091086],"genre_scores_gemma":[0.41381997,0.002300646,0.5640319,0.0006146332,0.00029029342,0.0004259446,0.0068085883,0.001044735,0.010663391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700147,0.000529096,0.0002024157,0.0008540472,0.00076096196,0.0006519904],"domain_scores_gemma":[0.9954046,0.0021591506,0.00049561384,0.0013704476,0.00029776606,0.00027242355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015534334,0.0024936006,0.0032808073,0.0023578666,0.0017991969,0.004385696,0.005836382,0.0031349475,0.013828892],"category_scores_gemma":[0.008744876,0.0010641894,0.0019851357,0.0070115263,0.0012847699,0.01060498,0.003614636,0.0029609024,0.00376236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021321536,0.0012846666,0.0042031184,0.0013335773,0.00046552793,0.00035510128,0.0006687785,0.49551255,0.005781702,0.07967423,0.05030038,0.35828832],"study_design_scores_gemma":[0.00029464238,0.00011608823,0.0006984298,0.000051869374,0.00011059905,0.00026759857,0.00024212501,0.88105154,0.0015470854,0.10962826,0.005956596,0.00003524439],"about_ca_topic_score_codex":0.0122988,"about_ca_topic_score_gemma":0.018586999,"teacher_disagreement_score":0.013828892,"about_ca_system_score_codex":0.004415038,"about_ca_system_score_gemma":0.0035937103,"threshold_uncertainty_score":0.046262264},"labels":[],"label_agreement":null},{"id":"W3201703753","doi":"10.4230/lipics.approx/random.2021.25","title":"Hitting Weighted Even Cycles in Planar Graphs","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Transversal (combinatorics); Approximation algorithm; Discrete mathematics; Undirected graph; Graph; Minimum weight; Time complexity; Independent set","score_opus":0.018321825107868304,"score_gpt":0.2553436650242999,"score_spread":0.23702183991643158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201703753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28264895,0.0015889247,0.69278884,0.0014644647,0.00011355814,0.00020491153,0.0014814298,0.0018183915,0.01789051],"genre_scores_gemma":[0.67411554,0.0019880377,0.30206537,0.0006614151,0.00012184531,0.00031636114,0.0034884007,0.001069939,0.01617317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999169,0.00017468458,0.000034645993,0.000267606,0.0001787342,0.00017527463],"domain_scores_gemma":[0.9977531,0.0012944671,0.00030495675,0.0003152589,0.00015703743,0.00017525576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006889799,0.0012600188,0.0011809585,0.0010160877,0.00077832333,0.0017105312,0.0015629333,0.0010301822,0.008764017],"category_scores_gemma":[0.005352516,0.0009084269,0.0012200937,0.001774012,0.0010235085,0.0034693796,0.0022295953,0.0020056418,0.0013651892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007474144,0.00021201,0.003682353,0.00085488736,0.00019293623,0.00064835406,0.0005886421,0.548616,0.011626192,0.2228207,0.019291244,0.19071928],"study_design_scores_gemma":[0.0000689889,0.00011925682,0.00063417415,0.00008034174,0.000056410187,0.0003312759,0.00022223954,0.59627086,0.004465476,0.3905829,0.0071417065,0.000026388641],"about_ca_topic_score_codex":0.0035211525,"about_ca_topic_score_gemma":0.0044883317,"teacher_disagreement_score":0.008764017,"about_ca_system_score_codex":0.0013222377,"about_ca_system_score_gemma":0.0008702115,"threshold_uncertainty_score":0.029318571},"labels":[],"label_agreement":null},{"id":"W3202345783","doi":"10.4230/lipics.approx/random.2021.13","title":"Secretary Matching Meets Probing with Commitment","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Matching (statistics); Competitive analysis; Combinatorics; Knapsack problem; Secretary problem; Online algorithm; Order (exchange); Stochastic block model; Generalization; Set (abstract data type); Time complexity; Mathematics; Context (archaeology); Oracle; Matroid; Discrete mathematics; Computer science; Algorithm; Mathematical optimization; Graph; Upper and lower bounds; Artificial intelligence","score_opus":0.016288179103186976,"score_gpt":0.2455387204149818,"score_spread":0.22925054131179481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202345783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118940994,0.0002937277,0.8591132,0.0030947633,0.0001259144,0.00021176314,0.0008155458,0.0009358955,0.01646821],"genre_scores_gemma":[0.86593604,0.00032598336,0.120011166,0.0006408965,0.0002626289,0.00022049293,0.00088765833,0.00034481572,0.011370356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937209,0.002212941,0.00025755275,0.0020048372,0.0008135398,0.0009902525],"domain_scores_gemma":[0.984617,0.009317316,0.0016265673,0.00260202,0.0007063435,0.0011307183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003336985,0.0010951665,0.0019659577,0.00069668994,0.0011996861,0.0035918443,0.0027242235,0.0029527955,0.008887271],"category_scores_gemma":[0.018687254,0.00076281716,0.0018288175,0.0014929333,0.0022616896,0.007996168,0.004058285,0.004366665,0.0011210024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005726357,0.0003135683,0.0018141957,0.00029166843,0.000115303366,0.0003228651,0.0003888276,0.30391437,0.0034305677,0.6425997,0.0063902694,0.039846055],"study_design_scores_gemma":[0.0000697811,0.00014680332,0.0002934005,0.000016273474,0.000024786954,0.00014311215,0.000113574504,0.6262749,0.0012830822,0.36846796,0.0031373776,0.000028869954],"about_ca_topic_score_codex":0.002460919,"about_ca_topic_score_gemma":0.0015901648,"teacher_disagreement_score":0.008887271,"about_ca_system_score_codex":0.0022135274,"about_ca_system_score_gemma":0.0022971698,"threshold_uncertainty_score":0.029730856},"labels":[],"label_agreement":null},{"id":"W3203056386","doi":"10.4230/lipics.time.2021.5","title":"Model Checking of Stream Processing Pipelines","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Alpen-Adria-Universität Klagenfurt; LOEWE Zentrum AdRIA","keywords":"Computer science; Pipeline transport; Stream processing; Programming language; Model checking; Extension (predicate logic); Set (abstract data type); Computation; Distributed computing; Engineering","score_opus":0.0477818302484747,"score_gpt":0.31496843515858736,"score_spread":0.26718660491011265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203056386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053767435,0.00009847563,0.93706065,0.0001973281,0.0000395553,0.0001334159,0.0004681738,0.0062453276,0.0019896438],"genre_scores_gemma":[0.701399,0.00028472426,0.2909425,0.00020611858,0.000037440917,0.00041848226,0.0016552629,0.0011260773,0.003930445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951965,0.0014346244,0.00036909865,0.0008309283,0.0016197055,0.00054905296],"domain_scores_gemma":[0.992388,0.0050237007,0.0005178384,0.0012532085,0.0006913865,0.00012591403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044208374,0.0010899252,0.0009909822,0.0010083263,0.00064070977,0.0020973475,0.002272721,0.0012143331,0.0035013717],"category_scores_gemma":[0.013737785,0.0011198545,0.0028094677,0.00073092396,0.0028446214,0.0034443913,0.0028996319,0.0016720338,0.000397721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045421976,0.00015502717,0.0039806035,0.00054624333,0.00017372619,0.00058875943,0.00036991105,0.775248,0.026348034,0.15923299,0.0023448477,0.030557703],"study_design_scores_gemma":[0.00010281334,0.00007250896,0.0002652556,0.000039518574,0.000049254697,0.00007158455,0.000028052042,0.9191659,0.024380993,0.05321285,0.0025857443,0.000025477957],"about_ca_topic_score_codex":0.00822243,"about_ca_topic_score_gemma":0.00709578,"teacher_disagreement_score":0.00822243,"about_ca_system_score_codex":0.0017905494,"about_ca_system_score_gemma":0.0031648339,"threshold_uncertainty_score":0.023379862},"labels":[],"label_agreement":null},{"id":"W3206946486","doi":"10.4230/lipics.disc.2021.29","title":"Detectable Sequential Specifications for Recoverable Shared Objects","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Linearizability; Cache; Thread (computing); Shared memory; State (computer science); Parallel computing; Cache coherence; Sequential consistency; Atomicity; Distributed computing; Programming language; CPU cache; Consistency model; Cache algorithms","score_opus":0.04403339357712774,"score_gpt":0.26483447846352914,"score_spread":0.2208010848864014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206946486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016520135,0.00013056031,0.97525716,0.000402691,0.00006893535,0.00013540128,0.0001899924,0.0014861657,0.00580899],"genre_scores_gemma":[0.46019074,0.00045367944,0.528677,0.0007811203,0.00019621779,0.0007076513,0.001050541,0.0006217596,0.007321286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99358046,0.0014881768,0.000999718,0.000756186,0.0026306177,0.0005449295],"domain_scores_gemma":[0.9882867,0.0056603495,0.0010585778,0.0021745777,0.0025072298,0.00031269036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045016436,0.0007753943,0.00040418294,0.0008890477,0.0006437672,0.0020413636,0.001408808,0.0010308768,0.0029731153],"category_scores_gemma":[0.011718358,0.0006945295,0.0015006707,0.0006502567,0.003178881,0.004075356,0.002581776,0.002471325,0.0008014957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076537886,0.00005340465,0.0009373902,0.00017807033,0.000019188965,0.00039813903,0.0012060787,0.013922371,0.0077849426,0.9501072,0.0014421339,0.023874523],"study_design_scores_gemma":[0.000110444584,0.00020534925,0.00036531882,0.000118881704,0.0000697766,0.0004360102,0.0004806598,0.13990031,0.021297345,0.78542835,0.0515095,0.00007799249],"about_ca_topic_score_codex":0.00320245,"about_ca_topic_score_gemma":0.0033431323,"teacher_disagreement_score":0.0045016436,"about_ca_system_score_codex":0.001512754,"about_ca_system_score_gemma":0.0030448732,"threshold_uncertainty_score":0.023807228},"labels":[],"label_agreement":null},{"id":"W3208459334","doi":"10.4230/lipics.disc.2021.36","title":"Extension-Based Proofs for Synchronous Message Passing","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Computer science; Extension (predicate logic); Message passing; Message broker; Distributed computing; Theoretical computer science; Programming language; Mathematics","score_opus":0.020686900519599927,"score_gpt":0.2743864207098398,"score_spread":0.2536995201902399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208459334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022331815,0.0005755798,0.9652474,0.0009351447,0.00021367412,0.0001319261,0.00018469183,0.0007194425,0.009660328],"genre_scores_gemma":[0.59065676,0.0010684176,0.3975246,0.0012872646,0.00065198325,0.0006602118,0.00058623316,0.0005200474,0.0070444415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98977494,0.0036264549,0.0009298787,0.0015717592,0.003015383,0.0010816273],"domain_scores_gemma":[0.9564861,0.028541306,0.0030174102,0.007035904,0.0038683028,0.0010509748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009726083,0.001247246,0.0010202666,0.0013869943,0.0021000449,0.0034165713,0.003141281,0.001345442,0.004609028],"category_scores_gemma":[0.031795688,0.0011275997,0.003071767,0.001286325,0.004905524,0.01241541,0.008118705,0.00589721,0.0011292455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001572837,0.00006802046,0.00048900297,0.0003282522,0.000063272055,0.00019365846,0.00060491904,0.009993489,0.004333892,0.96296746,0.0024160938,0.0183846],"study_design_scores_gemma":[0.00012005116,0.00014422745,0.00024228878,0.00012785682,0.00008003372,0.00029086415,0.000112256996,0.042435993,0.010291835,0.9273458,0.01873702,0.00007178324],"about_ca_topic_score_codex":0.00043768142,"about_ca_topic_score_gemma":0.00040246142,"teacher_disagreement_score":0.009726083,"about_ca_system_score_codex":0.0020802876,"about_ca_system_score_gemma":0.002117872,"threshold_uncertainty_score":0.05143702},"labels":[],"label_agreement":null},{"id":"W3209321351","doi":"10.4230/lipics.disc.2021.43","title":"Brief Announcement: Fast Graphical Population Protocols","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pairwise comparison; Population; Clique; Graph; Leader election; Discrete mathematics; Computer science; Line graph; Quadratic equation; Node (physics); Mathematics; Combinatorics; Theoretical computer science; Statistics","score_opus":0.015868861208871623,"score_gpt":0.2771996097140464,"score_spread":0.2613307485051748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209321351","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018143872,0.008398665,0.8330165,0.041854035,0.0138898315,0.0004547297,0.004093257,0.011886218,0.06826283],"genre_scores_gemma":[0.47288322,0.01721843,0.272489,0.01534648,0.015733058,0.0019487707,0.0161388,0.0049840873,0.1832581],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985177,0.00054903957,0.000059556573,0.00025624703,0.00044411005,0.00017338194],"domain_scores_gemma":[0.9965233,0.0019993284,0.00016162738,0.00059849466,0.0004053889,0.0003116537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017264434,0.0008188316,0.0006655199,0.00077261555,0.00092464016,0.0019654143,0.0017766849,0.0019695002,0.03064284],"category_scores_gemma":[0.011992154,0.00058117777,0.000589774,0.0014533355,0.0009351564,0.0050410526,0.00216186,0.0036702275,0.009544404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006066499,0.000107725056,0.0007566516,0.00049843494,0.000108427674,0.00030991723,0.00026292342,0.02842205,0.007793032,0.34129256,0.43538523,0.18445644],"study_design_scores_gemma":[0.00032053882,0.00024488757,0.00063135085,0.00015547709,0.00006864142,0.00041811605,0.00008799783,0.14680375,0.0063744965,0.33645543,0.50833607,0.000103201026],"about_ca_topic_score_codex":0.0015522528,"about_ca_topic_score_gemma":0.001699155,"teacher_disagreement_score":0.03064284,"about_ca_system_score_codex":0.0017078586,"about_ca_system_score_gemma":0.00095381605,"threshold_uncertainty_score":0.10251051},"labels":[],"label_agreement":null},{"id":"W3209486183","doi":"10.4230/lipics.cp.2021.35","title":"Counterfactual Explanations via Inverse Constraint Programming","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterfactual thinking; Constraint programming; Mathematical optimization; Inverse; Computer science; Scheduling (production processes); Constraint (computer-aided design); Integer programming; Knapsack problem; Mathematics; Stochastic programming","score_opus":0.02717998728889445,"score_gpt":0.27272963290072283,"score_spread":0.24554964561182838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209486183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00536761,0.00014352295,0.99068123,0.0006088106,0.000027128175,0.00010922984,0.00011387021,0.00030186374,0.0026467892],"genre_scores_gemma":[0.20256074,0.0003237486,0.7938949,0.00034619786,0.000085529144,0.00045292496,0.00051287725,0.00021368172,0.0016093756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99250925,0.0045753727,0.00026508333,0.00076901505,0.0015746243,0.0003066148],"domain_scores_gemma":[0.9592247,0.0365267,0.0013620781,0.0014939393,0.0011521473,0.00024036673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072781276,0.0015276326,0.0010879465,0.0018646775,0.0010038179,0.003242505,0.0023308608,0.0018006061,0.0070731626],"category_scores_gemma":[0.03817822,0.0009180453,0.0023239516,0.0018512787,0.0031573542,0.0032758228,0.0029560514,0.004757556,0.00052932306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010481749,0.000101722115,0.0009385266,0.00026320826,0.000109929315,0.00026820024,0.0003335995,0.6000811,0.00055623625,0.31940952,0.0029398645,0.0748932],"study_design_scores_gemma":[0.000028526563,0.00001539041,0.00008413467,0.00004272978,0.00001886471,0.00003297763,0.000032817126,0.7992246,0.00059000874,0.19765194,0.002264196,0.0000138659925],"about_ca_topic_score_codex":0.005214033,"about_ca_topic_score_gemma":0.006732839,"teacher_disagreement_score":0.0072781276,"about_ca_system_score_codex":0.0021705355,"about_ca_system_score_gemma":0.0027954334,"threshold_uncertainty_score":0.03849089},"labels":[],"label_agreement":null},{"id":"W3210396263","doi":"10.4230/lipics.cp.2021.3","title":"Learning in Local Branching (Invited Talk)","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Archaeological and Geological Studies","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Branching (polymer chemistry); Computer science; Artificial intelligence; Materials science","score_opus":0.023691300634289637,"score_gpt":0.22905651769632265,"score_spread":0.205365217062033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210396263","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017753333,0.07075205,0.7189878,0.06887984,0.034435038,0.00027322728,0.0017418812,0.004576733,0.08260004],"genre_scores_gemma":[0.29912466,0.041904036,0.35320106,0.0370685,0.051121812,0.0014521303,0.0067529753,0.004370413,0.2050044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885774,0.0003883932,0.000041920674,0.00039828682,0.00020099714,0.00011266049],"domain_scores_gemma":[0.9963923,0.00255577,0.00010852775,0.00019949947,0.00036743184,0.00037642088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024679115,0.0014473213,0.0016352088,0.00084132777,0.0010559582,0.003749681,0.0017356962,0.0030070094,0.037156448],"category_scores_gemma":[0.011284626,0.00070787,0.0015118236,0.00091755687,0.0011417657,0.004529341,0.0026675288,0.004917251,0.015340075],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005680797,0.0004898578,0.0020729317,0.0009317702,0.00026932108,0.0005829167,0.0005405227,0.041227087,0.002192687,0.16364782,0.44150448,0.3459726],"study_design_scores_gemma":[0.00025393072,0.00023660786,0.001859135,0.0005274068,0.00017272872,0.00066158606,0.00027661156,0.1080615,0.001997997,0.519177,0.36658347,0.00019194759],"about_ca_topic_score_codex":0.0025105486,"about_ca_topic_score_gemma":0.0022671053,"teacher_disagreement_score":0.037156448,"about_ca_system_score_codex":0.0016237816,"about_ca_system_score_gemma":0.0011117376,"threshold_uncertainty_score":0.12430066},"labels":[],"label_agreement":null},{"id":"W3216294916","doi":"10.4230/lipics.isaac.2021.61","title":"Dynamic Boolean Formula Evaluation.","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Boolean function; Theoretical computer science; Algorithm","score_opus":0.027566407644740696,"score_gpt":0.32531156849104576,"score_spread":0.29774516084630503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216294916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045203846,0.0008557259,0.9071649,0.0013452076,0.00015624016,0.00042039398,0.0016969522,0.019450579,0.023706246],"genre_scores_gemma":[0.39987433,0.00029562722,0.576506,0.0006807936,0.000095173295,0.00041269013,0.0037688592,0.0015785593,0.016787872],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969879,0.00047512958,0.00016520321,0.00077027676,0.0010599218,0.0005416254],"domain_scores_gemma":[0.9965623,0.0013354846,0.00023257457,0.001253074,0.00048380892,0.00013273885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011860551,0.0010569672,0.0012053485,0.0011443824,0.0011679794,0.002307595,0.004123585,0.001044386,0.021646364],"category_scores_gemma":[0.0061104125,0.0006726252,0.001369081,0.002112381,0.0011621785,0.0061525516,0.003641512,0.00197384,0.0038732283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009613786,0.00038771375,0.003171202,0.00062306575,0.00013317005,0.00024156863,0.00027681643,0.048667185,0.028828815,0.09685315,0.031323195,0.7885328],"study_design_scores_gemma":[0.00019043453,0.00019916489,0.0010797892,0.000052471223,0.00009339879,0.00037718515,0.00016822368,0.8004572,0.03807157,0.12734723,0.03190084,0.00006247249],"about_ca_topic_score_codex":0.008093236,"about_ca_topic_score_gemma":0.01891205,"teacher_disagreement_score":0.021646364,"about_ca_system_score_codex":0.0035676635,"about_ca_system_score_gemma":0.0025888497,"threshold_uncertainty_score":0.07241428},"labels":[],"label_agreement":null},{"id":"W3216398592","doi":"10.20382/jocg.v14i1a1","title":"Approximating Longest Spanning Tree with Neighborhoods","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Computer science; Minimum spanning tree; Tree (set theory); Combinatorics; Mathematics; Algorithm","score_opus":0.01329564247200219,"score_gpt":0.23161460095429337,"score_spread":0.2183189584822912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216398592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1864522,0.0024678279,0.8050176,0.00061644975,0.00009468793,0.00006842997,0.00055352657,0.0008352946,0.0038938962],"genre_scores_gemma":[0.53696537,0.00092485413,0.45737302,0.000097403914,0.00008887168,0.000114494695,0.0014529967,0.0002560675,0.002726936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992761,0.00027070142,0.00004109551,0.00018395139,0.00013582106,0.000092413946],"domain_scores_gemma":[0.99844414,0.0009250015,0.00019777921,0.00017765745,0.00014007911,0.00011529672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008781909,0.0007553473,0.0015274036,0.0010818945,0.00053842424,0.0008672407,0.0013508031,0.0010181319,0.001796415],"category_scores_gemma":[0.005080521,0.0005329479,0.0007202726,0.0022365905,0.00045938694,0.0024039207,0.0011936841,0.00075172965,0.00053304236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031295736,0.00011078897,0.0017695106,0.00025391212,0.00008663378,0.00022003955,0.00015025827,0.89203835,0.004071833,0.025575062,0.006084814,0.06932587],"study_design_scores_gemma":[0.000014670148,0.00003675154,0.00016533755,0.0000088617,0.000008321892,0.000072054216,0.00002272081,0.9829317,0.0006268645,0.015142724,0.00096535875,0.0000045697548],"about_ca_topic_score_codex":0.0024527386,"about_ca_topic_score_gemma":0.0023810272,"teacher_disagreement_score":0.0024527386,"about_ca_system_score_codex":0.0007775034,"about_ca_system_score_gemma":0.00050677935,"threshold_uncertainty_score":0.0060096383},"labels":[],"label_agreement":null},{"id":"W3217470394","doi":"10.4230/lipics.isaac.2021.16","title":"Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Planar straight-line graph; Outerplanar graph; Book embedding; Edge contraction; Combinatorics; Planar; Graph; Mathematics; Discrete mathematics; Computer science; 1-planar graph; Pathwidth; Line graph; Voltage graph","score_opus":0.012951347721054173,"score_gpt":0.23663351082266498,"score_spread":0.22368216310161082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217470394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13913456,0.0004613563,0.8476782,0.0005484048,0.0000824693,0.0002525077,0.0009647713,0.0025772715,0.008300561],"genre_scores_gemma":[0.22640646,0.00032580228,0.7633091,0.00014031984,0.000026177837,0.00013722709,0.003184284,0.0006694477,0.0058010984],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995964,0.000051499872,0.000030008683,0.00012027411,0.000109013585,0.00009278485],"domain_scores_gemma":[0.99930406,0.00030278353,0.000051444462,0.00019941325,0.00010084813,0.000041382267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034428178,0.0007857715,0.0008411715,0.00090772216,0.00068312796,0.0009514821,0.001100884,0.0006293467,0.0055251056],"category_scores_gemma":[0.001787091,0.00056568667,0.0008731912,0.0013478429,0.0006116448,0.0026469876,0.0021374838,0.0009804743,0.0017691482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005614326,0.00025986452,0.0041344576,0.0006969366,0.00007564732,0.00035325816,0.00069203787,0.13658862,0.052836467,0.05603258,0.03207032,0.71569836],"study_design_scores_gemma":[0.00022636008,0.00031626606,0.002537339,0.00011463595,0.00010888815,0.00070358237,0.0010893317,0.6896355,0.047318224,0.21375333,0.044123366,0.000073150135],"about_ca_topic_score_codex":0.0032580318,"about_ca_topic_score_gemma":0.007635147,"teacher_disagreement_score":0.0055251056,"about_ca_system_score_codex":0.0005249195,"about_ca_system_score_gemma":0.00087952544,"threshold_uncertainty_score":0.01848334},"labels":[],"label_agreement":null},{"id":"W4221140426","doi":"10.4230/lipics.swat.2022.19","title":"An Optimal Algorithm for Product Structure in Planar Graphs","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Product (mathematics); Planar; Graph; Path (computing); Discrete mathematics; Time complexity; Treewidth; Algorithm; Pathwidth; Computer science; Geometry; Line graph","score_opus":0.019428817194095484,"score_gpt":0.3105806399749501,"score_spread":0.2911518227808546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221140426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022719357,0.0004663293,0.94906145,0.00066538167,0.00012467182,0.00035082514,0.0013614793,0.010882681,0.014367838],"genre_scores_gemma":[0.1021846,0.00034857547,0.87843114,0.0002662737,0.00008543708,0.0004638788,0.0066360654,0.0018626674,0.009721412],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986449,0.00015916134,0.000106477455,0.00045212693,0.0003939747,0.00024351789],"domain_scores_gemma":[0.9978758,0.0007716024,0.0001108896,0.0006668527,0.00044502062,0.00012989804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007434708,0.0022467577,0.001502091,0.0021564797,0.0012290394,0.0022364885,0.0031051934,0.0020050472,0.030803006],"category_scores_gemma":[0.0037378268,0.0013042681,0.002149264,0.003282997,0.0011440428,0.006189504,0.0046481933,0.0021533167,0.011369612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079678115,0.00038779495,0.00127198,0.0008257659,0.000114305345,0.00024055623,0.00037523964,0.03237746,0.022385467,0.06530039,0.06618987,0.8097344],"study_design_scores_gemma":[0.00087769766,0.000489368,0.0013287427,0.00013998209,0.00029059645,0.0011790928,0.00050437497,0.5011726,0.031049397,0.39400306,0.068825155,0.0001398748],"about_ca_topic_score_codex":0.0024583393,"about_ca_topic_score_gemma":0.0033150024,"teacher_disagreement_score":0.030803006,"about_ca_system_score_codex":0.0015466874,"about_ca_system_score_gemma":0.0020104016,"threshold_uncertainty_score":0.1030463},"labels":[],"label_agreement":null},{"id":"W4221160784","doi":"10.4230/lipics.ecoop.2022.13","title":"REST: Integrating Term Rewriting with Program Verification","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Haskell; Rewriting; Mathematical proof; Computer science; Lemma (botany); Rest (music); Term (time); Programming language; Functional programming; Implementation; Gas meter prover; Algorithm; Theoretical computer science; Mathematics","score_opus":0.026357473301668842,"score_gpt":0.28385608241737076,"score_spread":0.25749860911570194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221160784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018280153,0.000102489816,0.9838508,0.0001024304,0.00004824591,0.000057283716,0.000081734055,0.011784065,0.0021449858],"genre_scores_gemma":[0.12209002,0.00035042875,0.8663371,0.00047761045,0.00013902821,0.00021650938,0.0006455592,0.004594458,0.005149184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993558,0.002041182,0.00053469714,0.0007447964,0.002691643,0.00042975435],"domain_scores_gemma":[0.9943488,0.0023080492,0.00031077617,0.0020897505,0.0008332768,0.00010927555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044056834,0.0008093713,0.0008290688,0.0011718955,0.000598624,0.0021347478,0.0025775873,0.00074883964,0.004918782],"category_scores_gemma":[0.010565049,0.00083122443,0.0018553424,0.00088548375,0.0020413345,0.0035310527,0.003945969,0.0022318815,0.0023499294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041101457,0.00020652561,0.0017821704,0.0009399424,0.00026878665,0.00082523783,0.000716614,0.046928953,0.05321187,0.37156227,0.017078076,0.50606847],"study_design_scores_gemma":[0.00014754321,0.0002660536,0.0007721615,0.00026656996,0.00028152013,0.0008809221,0.00009261132,0.42839858,0.12017479,0.32320356,0.1253546,0.00016112746],"about_ca_topic_score_codex":0.002725645,"about_ca_topic_score_gemma":0.002607434,"teacher_disagreement_score":0.004918782,"about_ca_system_score_codex":0.0008879458,"about_ca_system_score_gemma":0.0021187016,"threshold_uncertainty_score":0.023299754},"labels":[],"label_agreement":null},{"id":"W4225547311","doi":"10.4230/lipics.socg.2022.42","title":"Robust Radical Sylvester-Gallai Theorem for Quadratics","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Generalization; Dimension (graph theory); Mathematics; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.025147154245618777,"score_gpt":0.23528827382658862,"score_spread":0.21014111958096984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225547311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37292093,0.000800164,0.5872346,0.0007981154,0.00024556843,0.0000978482,0.00076655846,0.00059070316,0.03654553],"genre_scores_gemma":[0.9555956,0.00030960346,0.03537054,0.00026481913,0.00020262199,0.00008169526,0.0004092013,0.00010063669,0.007665303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994301,0.00007497852,0.000026614038,0.0001722002,0.00018280269,0.000113394846],"domain_scores_gemma":[0.9989237,0.00030111158,0.00021697294,0.00024800366,0.0001625708,0.00014762934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006292909,0.00054472446,0.00052781665,0.0010399474,0.00079753774,0.0010570982,0.00071570015,0.00043399705,0.007690587],"category_scores_gemma":[0.0021978272,0.00024136118,0.0006640434,0.00059833395,0.001651677,0.001985098,0.002287516,0.0016618875,0.0011422884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001545599,0.000035725123,0.0011565926,0.000098511155,0.000033745993,0.00021306147,0.00021494296,0.017149305,0.014804478,0.9430055,0.002967155,0.020166544],"study_design_scores_gemma":[0.000039449857,0.0002406037,0.0016302906,0.000024371522,0.000019459267,0.00032878315,0.00009390491,0.08062746,0.011240962,0.89635825,0.00934484,0.000051673742],"about_ca_topic_score_codex":0.00038173195,"about_ca_topic_score_gemma":0.0003580659,"teacher_disagreement_score":0.007690587,"about_ca_system_score_codex":0.000568906,"about_ca_system_score_gemma":0.0002667814,"threshold_uncertainty_score":0.02572757},"labels":[],"label_agreement":null},{"id":"W4226124909","doi":"10.4230/lipics.fun.2026.23","title":"Combinatorial Gray codes-an updated survey","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gray code; Computer science; Gray (unit); Combinatorics; Vertex (graph theory); Class (philosophy); Theoretical computer science; Graph; Mathematics; Algorithm; Artificial intelligence","score_opus":0.029575244443663298,"score_gpt":0.2819583446586847,"score_spread":0.2523831002150214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226124909","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012309394,0.84615,0.054381125,0.006359595,0.0035107827,0.00006522502,0.0013045153,0.0004523474,0.075467005],"genre_scores_gemma":[0.06591883,0.87377536,0.03125606,0.0030263779,0.0052129445,0.00009422648,0.0024540888,0.00037288203,0.0178892],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991986,0.00012406109,0.00006269884,0.00024191987,0.00028961693,0.00008317002],"domain_scores_gemma":[0.9969313,0.0017189666,0.00014034854,0.000293172,0.00073432404,0.00018180216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010822744,0.000964046,0.0012753942,0.0055975,0.0009002708,0.002532907,0.0010541652,0.0011673833,0.007464896],"category_scores_gemma":[0.0034768924,0.0007302187,0.0005727065,0.009961777,0.0018404005,0.006583295,0.0016272647,0.0024427942,0.0027749506],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068937756,0.000102594684,0.0014884599,0.0026122716,0.00005459993,0.00010072342,0.00013769268,0.0071598906,0.0007693519,0.25305146,0.09119359,0.6432605],"study_design_scores_gemma":[0.000012905455,0.00006230659,0.001367803,0.00083879393,0.000046803016,0.0010356522,0.00017480382,0.0053572566,0.0008158432,0.16847269,0.82176036,0.000054744683],"about_ca_topic_score_codex":0.0020185162,"about_ca_topic_score_gemma":0.0018999568,"teacher_disagreement_score":0.007464896,"about_ca_system_score_codex":0.0020944234,"about_ca_system_score_gemma":0.0014691022,"threshold_uncertainty_score":0.024972558},"labels":[],"label_agreement":null},{"id":"W4226530376","doi":"10.4230/lipics.socg.2022.71","title":"Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Partition (number theory); Plane (geometry); Combinatorics; Partition problem; Line segment; Mathematics; Set (abstract data type); Computer science; Line (geometry); Geometry","score_opus":0.03651706458180236,"score_gpt":0.2986221419772685,"score_spread":0.2621050773954661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226530376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1274266,0.0012919668,0.8514672,0.0028013503,0.0001516126,0.00022372407,0.0013916384,0.0026918903,0.012553973],"genre_scores_gemma":[0.49890098,0.00040383294,0.49010077,0.0008642533,0.00010887658,0.00043174773,0.0029761584,0.0009828177,0.005230541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998987,0.00049161445,0.000030482082,0.00019696174,0.00016437368,0.00012957647],"domain_scores_gemma":[0.9972485,0.0020400994,0.00013915499,0.00030783683,0.00014191095,0.00012237199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011316825,0.0007682772,0.0014567898,0.0006694484,0.0007916439,0.0010739696,0.0019355632,0.0018025254,0.0071771336],"category_scores_gemma":[0.00608653,0.00055052264,0.0010569612,0.0012948089,0.0012330925,0.0021789768,0.0020547006,0.0019520536,0.0010328916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070751755,0.00036410717,0.002020318,0.0005887212,0.00016409092,0.00039556413,0.00052880263,0.6784463,0.006279091,0.09537155,0.045303565,0.16983035],"study_design_scores_gemma":[0.00016329772,0.000096759286,0.00024190731,0.000034151297,0.000037538997,0.00009306509,0.00020512285,0.8952255,0.0021636984,0.09732514,0.004396734,0.000016917666],"about_ca_topic_score_codex":0.0025876937,"about_ca_topic_score_gemma":0.0041374364,"teacher_disagreement_score":0.0071771336,"about_ca_system_score_codex":0.0008440692,"about_ca_system_score_gemma":0.0011850789,"threshold_uncertainty_score":0.024009943},"labels":[],"label_agreement":null},{"id":"W4280619266","doi":"10.4230/lipics.itp.2022.18","title":"Automatic Test-Case Reduction in Proof Assistants: A Case Study in Coq","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Reduction (mathematics); Test (biology); Proof assistant; Proof of concept; Programming language; Operating system; Mathematics; Mathematical proof","score_opus":0.02613850071469267,"score_gpt":0.29371747690243355,"score_spread":0.2675789761877409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280619266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7600886,0.0007399402,0.22384034,0.0007820198,0.00004994213,0.0005429865,0.00031512303,0.009326984,0.004314043],"genre_scores_gemma":[0.7809086,0.0002265254,0.21392475,0.00021481753,0.000020959737,0.00020663625,0.00047021182,0.0020340232,0.0019935253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9827209,0.010059453,0.00088253606,0.0015209692,0.0039800205,0.00083610794],"domain_scores_gemma":[0.8032766,0.16475502,0.0045119002,0.017596744,0.008369414,0.0014902845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013411,0.0010472698,0.00070713134,0.0013448981,0.0011041978,0.0014673,0.0030660566,0.001995211,0.0018146044],"category_scores_gemma":[0.08403687,0.0008621739,0.0006981056,0.0014138462,0.0022347737,0.0025272546,0.0019770532,0.0021623033,0.00065129803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031486766,0.0054241894,0.04792395,0.0024992872,0.00028081491,0.010156485,0.023536662,0.15122975,0.07847746,0.027817369,0.015248625,0.6342567],"study_design_scores_gemma":[0.001359443,0.0060502803,0.029312355,0.00056060345,0.00032726882,0.011517374,0.004581789,0.6708084,0.17884082,0.017186088,0.07912508,0.00033057661],"about_ca_topic_score_codex":0.005994147,"about_ca_topic_score_gemma":0.0050094123,"teacher_disagreement_score":0.013411,"about_ca_system_score_codex":0.001289634,"about_ca_system_score_gemma":0.001534885,"threshold_uncertainty_score":0.070925},"labels":[],"label_agreement":null},{"id":"W4281858785","doi":"10.4230/lipics.aofa.2022.13","title":"Mean Field Analysis of an Incentive Algorithm for a Closed Stochastic Network","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Field (mathematics); Incentive; Algorithm; Mathematics; Economics","score_opus":0.01503601822912607,"score_gpt":0.2701443491793923,"score_spread":0.2551083309502662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281858785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072061524,0.00032879342,0.9208095,0.0009361394,0.000077668396,0.00010976841,0.00010568534,0.00014373766,0.0054270844],"genre_scores_gemma":[0.887428,0.0005086666,0.09674976,0.00031893078,0.00011386923,0.00038683906,0.00021216417,0.00014843191,0.014133376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984004,0.0007332463,0.0000625503,0.00024500975,0.0002956456,0.0002630996],"domain_scores_gemma":[0.9867749,0.010012261,0.0010670067,0.0002897594,0.0011404672,0.0007155873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046687373,0.00089615124,0.00132872,0.0014905107,0.0010772804,0.0017736938,0.001638431,0.002257234,0.0058047855],"category_scores_gemma":[0.01872033,0.0006271462,0.001040665,0.0009854274,0.0027017903,0.0027289016,0.00185092,0.0018813582,0.00036757765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011078598,0.00006583901,0.0008225495,0.00007374407,0.000037000555,0.00007873077,0.000120012664,0.72152,0.0014382785,0.2674514,0.001097767,0.0071838526],"study_design_scores_gemma":[0.000016081436,0.000022305005,0.00007151174,0.00000614455,0.0000043993687,0.000010899616,0.00001107559,0.96505105,0.00010535059,0.034472033,0.00022241483,0.0000067006904],"about_ca_topic_score_codex":0.004648804,"about_ca_topic_score_gemma":0.0023648108,"teacher_disagreement_score":0.0058047855,"about_ca_system_score_codex":0.0034780258,"about_ca_system_score_gemma":0.0025616896,"threshold_uncertainty_score":0.025234938},"labels":[],"label_agreement":null},{"id":"W4283124407","doi":"10.4230/lipics.approx/random.2022.18","title":"Sketching Distances in Monotone Graph Classes","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Monotone polygon; Computer science; Graph; Theoretical computer science; Combinatorics; Mathematics; Geometry","score_opus":0.02570291299465333,"score_gpt":0.3180068150081586,"score_spread":0.29230390201350526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283124407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37676206,0.0010554299,0.61262065,0.0010565729,0.00004939125,0.00014427846,0.00056339294,0.0009831268,0.006765069],"genre_scores_gemma":[0.87759787,0.00073339214,0.11597594,0.00020142163,0.00015260014,0.0001903286,0.00070566137,0.00030743857,0.00413533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757487,0.0006070794,0.00013122454,0.00067063444,0.0007169282,0.00029932478],"domain_scores_gemma":[0.96614987,0.026467308,0.0021378796,0.0033020014,0.0009552184,0.0009877092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025888016,0.0007655064,0.0009767732,0.001254334,0.00076328794,0.002036147,0.0021642055,0.0013366026,0.00366926],"category_scores_gemma":[0.029905388,0.00064995495,0.0009940933,0.0010563823,0.0018323445,0.008544234,0.0025171344,0.0022451743,0.0004967085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008607473,0.00025473387,0.006842378,0.0007576282,0.00012584506,0.00027199375,0.0011131815,0.3358381,0.016161337,0.41308984,0.0058550104,0.2188292],"study_design_scores_gemma":[0.00007036263,0.00013581688,0.0011637881,0.000035574183,0.000026137368,0.00030064036,0.00012898973,0.72634494,0.0042042024,0.26362285,0.0039374125,0.000029193148],"about_ca_topic_score_codex":0.0013341461,"about_ca_topic_score_gemma":0.0010742964,"teacher_disagreement_score":0.00366926,"about_ca_system_score_codex":0.0017239345,"about_ca_system_score_gemma":0.00054193696,"threshold_uncertainty_score":0.013691068},"labels":[],"label_agreement":null},{"id":"W4283330479","doi":"10.4230/lipics.icalp.2022.81","title":"A Study of Weisfeiler-Leman Colorings on Planar Graphs","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Graph isomorphism; Discrete mathematics; Planar graph; Isomorphism (crystallography); Subgraph isomorphism problem; Line graph; Chordal graph; Pathwidth; Graph","score_opus":0.040270605147283325,"score_gpt":0.3205178733126442,"score_spread":0.2802472681653609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283330479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6693869,0.0010967405,0.29285383,0.0013379504,0.00007149525,0.0001304259,0.0005184127,0.00062059425,0.0339835],"genre_scores_gemma":[0.9059317,0.0009017308,0.079330444,0.00044616908,0.0001477967,0.00015966893,0.0008395186,0.0002739206,0.0119689135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908376,0.00024907524,0.00003733751,0.00022549958,0.00022208443,0.00018224785],"domain_scores_gemma":[0.996024,0.0024120254,0.0006228026,0.0004070578,0.00031140546,0.00022262595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008749745,0.0007380631,0.0005405765,0.001898815,0.0012806639,0.0016248092,0.0012582726,0.0010454367,0.0045335786],"category_scores_gemma":[0.0071179094,0.0006000532,0.0011624243,0.001965592,0.0020786508,0.0032075301,0.0011450502,0.0017251611,0.00039435978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010675518,0.00006967419,0.0030398355,0.00015092299,0.00002958147,0.00021744186,0.0005721497,0.081720024,0.0048083467,0.8847043,0.002232935,0.022347983],"study_design_scores_gemma":[0.000031002004,0.00008427926,0.002197333,0.00007482061,0.000034037486,0.00023672436,0.00026978742,0.19453466,0.0036293892,0.7913335,0.007532382,0.0000421411],"about_ca_topic_score_codex":0.0034242265,"about_ca_topic_score_gemma":0.0024251414,"teacher_disagreement_score":0.0045335786,"about_ca_system_score_codex":0.0028507756,"about_ca_system_score_gemma":0.00076078007,"threshold_uncertainty_score":0.020683885},"labels":[],"label_agreement":null},{"id":"W4285580083","doi":"10.4230/lipics.sea.2022.16","title":"RLBWT Tricks","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute of Allergy and Infectious Diseases; National Human Genome Research Institute","keywords":"Row; Permutation (music); Table (database); Constant (computer programming); Computer science; Speedup; Limiting; Algorithm; Rank (graph theory); Compression (physics); Computation; Combinatorics; Parallel computing; Mathematics; Database; Physics; Programming language","score_opus":0.020076732669350592,"score_gpt":0.2675891314586799,"score_spread":0.24751239878932932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285580083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057382914,0.0016815297,0.9347969,0.0017101157,0.0009978195,0.00028199411,0.0010387017,0.013870842,0.039883826],"genre_scores_gemma":[0.076872215,0.0015871566,0.8707255,0.0021209822,0.0008658423,0.0008342187,0.0027644385,0.007935609,0.03629399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558014,0.0006809812,0.00037688404,0.000709777,0.0021343436,0.0005178048],"domain_scores_gemma":[0.99576557,0.0012071863,0.00016635554,0.0022366561,0.0005205549,0.000103750885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022038722,0.0016983463,0.0014818142,0.0025110096,0.0015353624,0.0036589894,0.0040696277,0.0016039297,0.054098334],"category_scores_gemma":[0.012099604,0.0011477382,0.0022785703,0.003646444,0.0018199693,0.0085975155,0.0079677785,0.0051927366,0.033048112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004696033,0.00020019188,0.0005613621,0.0006092996,0.000092135655,0.00040746396,0.0003965204,0.0055126958,0.011782973,0.34757987,0.11287424,0.51951367],"study_design_scores_gemma":[0.00032707507,0.0002104612,0.00045243456,0.0002501411,0.00009607767,0.0016618117,0.0002401675,0.10340893,0.029471403,0.56010526,0.30363265,0.0001435593],"about_ca_topic_score_codex":0.0013117453,"about_ca_topic_score_gemma":0.0013647232,"teacher_disagreement_score":0.054098334,"about_ca_system_score_codex":0.0012037256,"about_ca_system_score_gemma":0.0011460547,"threshold_uncertainty_score":0.18097699},"labels":[],"label_agreement":null},{"id":"W4287548900","doi":"10.4230/lipics.aft.2023.27","title":"Liquidity Management Attacks on Lending Markets","year":2023,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Incentive; Implementation; Executable; Context (archaeology); Variety (cybernetics); Computer science; Microeconomics; Economics; Artificial intelligence; Software engineering; Programming language","score_opus":0.033896532246055905,"score_gpt":0.28982876095798843,"score_spread":0.25593222871193255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287548900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69860876,0.0013445291,0.21209317,0.0036373483,0.00021442169,0.00030446096,0.00020763047,0.0057458747,0.07784386],"genre_scores_gemma":[0.9804803,0.00018040703,0.012716952,0.00040580324,0.000045876888,0.000081260776,0.0000446411,0.00008546176,0.005959235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730057,0.001025208,0.0001136752,0.00025340708,0.00086637994,0.0004407994],"domain_scores_gemma":[0.99650794,0.001309801,0.0008137228,0.00077453384,0.00032297507,0.0002709905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021501286,0.0006486032,0.00051573,0.0008374271,0.0013622021,0.002922659,0.0012479852,0.0015521995,0.0056366515],"category_scores_gemma":[0.008179527,0.00038773424,0.00047773155,0.00052686915,0.0022003131,0.004943255,0.0049507194,0.0015503899,0.0008290234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019132991,0.0003726439,0.014384268,0.00040499365,0.0001666155,0.0026276782,0.002238383,0.14138,0.077589646,0.54287076,0.021786973,0.19426472],"study_design_scores_gemma":[0.00026110013,0.00072921783,0.0038801166,0.00019376083,0.000105666106,0.0015791805,0.0006660231,0.65359664,0.05141918,0.23402707,0.053398762,0.00014341483],"about_ca_topic_score_codex":0.0007290391,"about_ca_topic_score_gemma":0.00061067205,"teacher_disagreement_score":0.0056366515,"about_ca_system_score_codex":0.0015412867,"about_ca_system_score_gemma":0.0010530871,"threshold_uncertainty_score":0.018856525},"labels":[],"label_agreement":null},{"id":"W4287553630","doi":"10.4230/lipics.cpm.2022.2","title":"String Attractors for Automatic Sequences","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Attractor; String (physics); Combinatorics; Decidability; Sequence (biology); Mathematics; Prefix; Constant (computer programming); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Mathematical physics; Computer science","score_opus":0.0406756292479632,"score_gpt":0.28597792565633673,"score_spread":0.24530229640837353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287553630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40596125,0.0021327948,0.5263838,0.0015261574,0.00021539269,0.000076542594,0.0006846906,0.00095517247,0.062064152],"genre_scores_gemma":[0.9536395,0.00074024877,0.03690501,0.00023240705,0.00025358575,0.00015676454,0.00062164874,0.00017228715,0.007278544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880195,0.00026736612,0.00010003994,0.00036213864,0.00037442904,0.000094062125],"domain_scores_gemma":[0.9951563,0.0031236173,0.00059527316,0.0002983338,0.0005194932,0.0003070036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010505934,0.00055603345,0.0006078071,0.0031602564,0.0010499811,0.0028930067,0.0005959015,0.0009426321,0.00746985],"category_scores_gemma":[0.006241812,0.0002932031,0.0008519852,0.0015503139,0.0027968027,0.004255654,0.0018610503,0.0018143842,0.0006630079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015236125,0.000007832481,0.00034162376,0.000043717995,0.000009077947,0.000033982793,0.00014237032,0.0020314874,0.0014021221,0.99065745,0.00040968604,0.004905405],"study_design_scores_gemma":[0.000006262518,0.000019861856,0.00033035115,0.000016580363,0.0000067622136,0.00006324436,0.000054832653,0.018811805,0.0009337771,0.9777711,0.0019730488,0.000012369952],"about_ca_topic_score_codex":0.0005159621,"about_ca_topic_score_gemma":0.00037207842,"teacher_disagreement_score":0.00746985,"about_ca_system_score_codex":0.001433655,"about_ca_system_score_gemma":0.0004453362,"threshold_uncertainty_score":0.024989188},"labels":[],"label_agreement":null},{"id":"W4297416040","doi":"10.4230/lipics.cp.2022.6","title":"Acquiring Maps of Interrelated Conjectures on Sharp Bounds","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science","score_opus":0.021980698048406112,"score_gpt":0.26933426744177313,"score_spread":0.24735356939336703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297416040","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27923018,0.0002467291,0.70602137,0.00083996437,0.0000706827,0.00018500393,0.0004251604,0.0022423777,0.010738397],"genre_scores_gemma":[0.7686003,0.00016767609,0.22650361,0.00020094744,0.00006702034,0.00023330617,0.0007455075,0.0004654002,0.0030163054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957718,0.0010894367,0.00035799624,0.0013269449,0.001055351,0.0003983079],"domain_scores_gemma":[0.9754146,0.013693522,0.0014977722,0.006635617,0.0018691341,0.0008892988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051482175,0.0009535504,0.0014175072,0.0027214927,0.0015322763,0.0048411074,0.0018097037,0.0017603517,0.0074348445],"category_scores_gemma":[0.027865417,0.0014993858,0.0014824359,0.0019666513,0.0039770515,0.012405702,0.007872616,0.0047186064,0.0013082369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006365291,0.0003528944,0.011907307,0.00056016113,0.00010233589,0.0004068446,0.0020063077,0.06625377,0.03167404,0.76911193,0.0041369908,0.11285095],"study_design_scores_gemma":[0.00007480904,0.00029873144,0.0017104709,0.00006206846,0.00006370102,0.00022300163,0.0005910792,0.24675563,0.032916747,0.7101067,0.0071146637,0.00008240287],"about_ca_topic_score_codex":0.0006438129,"about_ca_topic_score_gemma":0.00052468013,"teacher_disagreement_score":0.0074348445,"about_ca_system_score_codex":0.0018852672,"about_ca_system_score_gemma":0.00140777,"threshold_uncertainty_score":0.027226686},"labels":[],"label_agreement":null},{"id":"W4302227484","doi":"10.4230/lipics.socg.2024.5","title":"Communication Complexity and Discrepancy of Halfplanes","year":2024,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Marianopolis College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Hypercube; Omega; Factorization; Order (exchange); Norm (philosophy); Polynomial; Discrete mathematics; Physics; Mathematical analysis; Algorithm","score_opus":0.08719177781554249,"score_gpt":0.3545731149878742,"score_spread":0.2673813371723317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302227484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74015224,0.00092832465,0.24040203,0.0035020676,0.000067630346,0.00006519149,0.0007672302,0.00036361272,0.013751693],"genre_scores_gemma":[0.96422386,0.0004430461,0.03119499,0.00023130038,0.00011703168,0.00013513524,0.0007181411,0.00010046622,0.0028360768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598217,0.0014485089,0.00021103729,0.0007343375,0.0011331093,0.00049084553],"domain_scores_gemma":[0.96345776,0.02858283,0.0027640532,0.0030027046,0.0010292662,0.0011632965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030482595,0.000602398,0.0014556013,0.0010155181,0.0011799415,0.0026576952,0.002702776,0.00178051,0.004485051],"category_scores_gemma":[0.025313305,0.00062225544,0.0009933227,0.001552396,0.0029660312,0.007303611,0.00359116,0.002953232,0.00057730766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012950284,0.000209664,0.0077119195,0.00036135182,0.00012017035,0.00037747668,0.0012145877,0.2721019,0.005472104,0.67492,0.0049060555,0.03130965],"study_design_scores_gemma":[0.00009215663,0.00011634445,0.0013313318,0.00004676452,0.00002533285,0.00024007903,0.00021259084,0.48061922,0.0026017136,0.51254904,0.0021347655,0.0000306667],"about_ca_topic_score_codex":0.0011043935,"about_ca_topic_score_gemma":0.00045334533,"teacher_disagreement_score":0.004485051,"about_ca_system_score_codex":0.0023037056,"about_ca_system_score_gemma":0.0008696152,"threshold_uncertainty_score":0.016714633},"labels":[],"label_agreement":null},{"id":"W4310419450","doi":"10.4230/lipics.fscd.2022.20","title":"Decision Problems for Linear Logic with Least and Greatest Fixed Points","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Fixed point; Computer science; Mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.04310459302682623,"score_gpt":0.3080269835349024,"score_spread":0.26492239050807614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310419450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24958077,0.0023610303,0.7159,0.010954611,0.00019415871,0.00046647288,0.0012801265,0.0008682044,0.018394573],"genre_scores_gemma":[0.7690903,0.0012941739,0.21382415,0.001289081,0.000404124,0.0004014493,0.001758053,0.0002315688,0.011707116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99222577,0.0027974772,0.0006173961,0.0021803516,0.0012394856,0.0009394866],"domain_scores_gemma":[0.9600389,0.036011904,0.0012223939,0.0010216611,0.001165478,0.00053954456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073051983,0.0008577944,0.0011528345,0.0011880016,0.0019919872,0.0049692756,0.0020568997,0.0019632343,0.0069577047],"category_scores_gemma":[0.020897856,0.0011108705,0.003253617,0.0010979171,0.005674647,0.008924419,0.004320456,0.0070728078,0.00068352616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005025725,0.00029480454,0.0023406732,0.0008853178,0.0002505228,0.00034834063,0.001203413,0.057498906,0.0035317838,0.88176686,0.00504692,0.04632979],"study_design_scores_gemma":[0.00010883588,0.000064846725,0.00033128096,0.00005127323,0.0000709382,0.00009451767,0.0001936091,0.07070291,0.003052126,0.9226341,0.0026531483,0.000042391584],"about_ca_topic_score_codex":0.0039760806,"about_ca_topic_score_gemma":0.0039843586,"teacher_disagreement_score":0.0073051983,"about_ca_system_score_codex":0.004773929,"about_ca_system_score_gemma":0.0031244222,"threshold_uncertainty_score":0.03863406},"labels":[],"label_agreement":null},{"id":"W4385849427","doi":"10.4230/lipics.itcs.2023.73","title":"Recovery from Non-Decomposable Distance Oracles","year":2023,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Hamming distance; Sequence (biology); Combinatorics; Edit distance; Function (biology); Mathematics; Earth mover's distance; Dynamic time warping; Set (abstract data type); Alphabet; Estimator; Algorithm; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.02600066608497223,"score_gpt":0.27197818908609694,"score_spread":0.24597752300112471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385849427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12298472,0.0014828206,0.86411667,0.003535634,0.00017189007,0.00020968725,0.0013646529,0.002969064,0.0031648548],"genre_scores_gemma":[0.78353816,0.000710215,0.20515692,0.0011656675,0.000274003,0.0002449167,0.0029264414,0.00051544135,0.0054682246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864049,0.0044297758,0.0012140526,0.0035460808,0.003273253,0.0011319264],"domain_scores_gemma":[0.9208339,0.053984486,0.0036096221,0.017962225,0.002312533,0.0012971807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007818488,0.0018900685,0.003702161,0.0012211656,0.0010176396,0.0032002297,0.0049886727,0.0041542808,0.004827549],"category_scores_gemma":[0.070506744,0.00084009813,0.0013249258,0.0023107962,0.0022617327,0.012660645,0.0068568187,0.006713787,0.0018551092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00475349,0.0008078185,0.008340429,0.0015458746,0.00036851733,0.0015240504,0.0013426611,0.3653674,0.029900787,0.18657203,0.01733278,0.38214424],"study_design_scores_gemma":[0.00015497213,0.00033154522,0.0010004422,0.00008768367,0.00005103469,0.00093484315,0.00039132376,0.7351485,0.015138939,0.24371734,0.00297246,0.00007095364],"about_ca_topic_score_codex":0.0010710148,"about_ca_topic_score_gemma":0.0010328571,"teacher_disagreement_score":0.007818488,"about_ca_system_score_codex":0.0018935069,"about_ca_system_score_gemma":0.00227168,"threshold_uncertainty_score":0.041348636},"labels":[],"label_agreement":null},{"id":"W4391922953","doi":"10.4230/lipics.esa.2018.22","title":"Improved Routing on the Delaunay Triangulation","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geographic Information Systems Studies","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Delaunay triangulation; Computer science; Bowyer–Watson algorithm; Constrained Delaunay triangulation; Algorithm","score_opus":0.032457351564038076,"score_gpt":0.3050960411121619,"score_spread":0.2726386895481238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391922953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02060075,0.0011168267,0.96442133,0.0004747789,0.00022254862,0.00017034794,0.00041901314,0.0024033475,0.010171048],"genre_scores_gemma":[0.15781628,0.000999468,0.8305143,0.00020512224,0.00018382075,0.00033465298,0.0010656212,0.00045721862,0.008423597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717134,0.00060090964,0.00017090795,0.0006708681,0.0010574793,0.00032850693],"domain_scores_gemma":[0.9971609,0.0007619551,0.00021743818,0.0009448427,0.0007987227,0.000116213356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011816961,0.0012340642,0.0021282407,0.002111978,0.0013531613,0.0015297987,0.0024900057,0.0012653744,0.008677864],"category_scores_gemma":[0.0061654816,0.00082345953,0.0012410826,0.0025013671,0.0010634764,0.0037673172,0.004669628,0.002048548,0.0029518409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004423519,0.000096431446,0.0009848528,0.0004304892,0.000110859466,0.00025124536,0.0003912137,0.5447001,0.011014074,0.07146938,0.018014677,0.3520943],"study_design_scores_gemma":[0.000095761614,0.00016149059,0.00040957867,0.00007588375,0.000052394975,0.0001906635,0.00014601665,0.9231527,0.004223887,0.049468447,0.021962766,0.00006034882],"about_ca_topic_score_codex":0.011779791,"about_ca_topic_score_gemma":0.011283158,"teacher_disagreement_score":0.011779791,"about_ca_system_score_codex":0.0017360442,"about_ca_system_score_gemma":0.0016638205,"threshold_uncertainty_score":0.029030383},"labels":[],"label_agreement":null},{"id":"W4394636026","doi":"10.4230/lipics.approx/random.2022.21","title":"Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Rank (graph theory); Undecidable problem; Tensor (intrinsic definition); Mathematics; Domain (mathematical analysis); Computational complexity theory; Conjecture; Polynomial; Time complexity; Matrix (chemical analysis); Symmetric tensor; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Decidability; Exact solutions in general relativity; Mathematical analysis","score_opus":0.06372568142230997,"score_gpt":0.33636613014081457,"score_spread":0.27264044871850457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394636026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7217737,0.0010445752,0.2587615,0.0042036646,0.00007501708,0.00017712306,0.0026426255,0.0023638154,0.008958091],"genre_scores_gemma":[0.9293728,0.00034655991,0.06313685,0.00066764076,0.00012911813,0.00013425622,0.0027275758,0.00012703697,0.003358098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989611,0.0001931407,0.000058710033,0.00038609374,0.00020388521,0.00019712953],"domain_scores_gemma":[0.99439234,0.004019915,0.0004286002,0.0006491264,0.00023660512,0.00027339146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009375138,0.00082395395,0.0014299346,0.00045989384,0.0006384818,0.0015011745,0.0018841119,0.0016118905,0.0053170095],"category_scores_gemma":[0.009285684,0.00052375894,0.0014353791,0.0008379723,0.0012622476,0.0045239306,0.0018999858,0.0027374001,0.0005364359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031490403,0.0006805281,0.015812729,0.00087972905,0.00028277,0.0011307391,0.0009749863,0.585628,0.012071666,0.13473481,0.018183095,0.22647192],"study_design_scores_gemma":[0.00022641013,0.00021119147,0.0013096585,0.000045246845,0.000074299955,0.00028903806,0.00015236001,0.7336169,0.0028201768,0.25904486,0.0021836273,0.00002623556],"about_ca_topic_score_codex":0.0027935824,"about_ca_topic_score_gemma":0.00418579,"teacher_disagreement_score":0.0053170095,"about_ca_system_score_codex":0.0016177593,"about_ca_system_score_gemma":0.001200025,"threshold_uncertainty_score":0.017787158},"labels":[],"label_agreement":null},{"id":"W4394666350","doi":"10.48550/arxiv.1303.3997","title":"Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5348,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Human Genome Research Institute; National Institute of Allergy and Infectious Diseases; Natural Sciences and Engineering Research Council of Canada; Comisión Nacional de Investigación Científica y Tecnológica; Directorate for Biological Sciences; Israel Institute for Biological Research; Japan Society for the Promotion of Science; Centre for Biotechnology and Bioengineering; National Institutes of Health; National Science Foundation","keywords":"Contig; Sequence (biology); clone (Java method); Sequence assembly; Computational biology; Genetics; Biology; Computer science; Genome; DNA; Gene","score_opus":0.014938161947430808,"score_gpt":0.2756569372533093,"score_spread":0.2607187753058785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394666350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015909653,0.00072479545,0.82107896,0.00030459624,0.00052987837,0.00031430097,0.027144656,0.12628418,0.007708979],"genre_scores_gemma":[0.031059947,0.00043878437,0.83685243,0.0001590481,0.00012638814,0.0011176966,0.08977723,0.031549096,0.008919293],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985461,0.00024308475,0.0001567563,0.0005607912,0.0003923393,0.0001009388],"domain_scores_gemma":[0.9984705,0.0004945894,0.00012170303,0.00047458778,0.00035391957,0.0000847499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002335207,0.0029705116,0.0020715757,0.003956048,0.0018333601,0.0025833445,0.0038248815,0.001440967,0.041502934],"category_scores_gemma":[0.008505639,0.0018853121,0.0016525357,0.004416403,0.00060499937,0.002153295,0.0021979911,0.0028435993,0.04492043],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002265471,0.00041243562,0.0033019672,0.004301869,0.00096909533,0.0010510972,0.0010248302,0.014367672,0.21241876,0.01923448,0.30211323,0.43853903],"study_design_scores_gemma":[0.00040860454,0.00029024566,0.0051200413,0.00031601527,0.00040931278,0.0010433454,0.0003844179,0.21519542,0.28943226,0.052062742,0.43511164,0.00022594689],"about_ca_topic_score_codex":0.0013696698,"about_ca_topic_score_gemma":0.0016594921,"teacher_disagreement_score":0.041502934,"about_ca_system_score_codex":0.0006852458,"about_ca_system_score_gemma":0.001221787,"threshold_uncertainty_score":0.1388411},"labels":[],"label_agreement":null},{"id":"W4394667522","doi":"10.4230/lipics.fun.2022.3","title":"Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Hand Gesture Recognition Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.02073116981896781,"score_gpt":0.25911460801713004,"score_spread":0.23838343819816224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394667522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29292098,0.0014397051,0.6424874,0.006696841,0.00031145086,0.00058580446,0.0030998187,0.003854062,0.04860398],"genre_scores_gemma":[0.7936064,0.0010731447,0.18408413,0.0014588463,0.00015594794,0.0007502357,0.00393779,0.0010201858,0.013913356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996944,0.0006402221,0.0001890736,0.00071354746,0.0006618203,0.00085124635],"domain_scores_gemma":[0.989022,0.00853107,0.00037307676,0.0010200787,0.00056597526,0.00048788672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022319537,0.0020549744,0.0017857968,0.0012227026,0.0020344763,0.0041684606,0.0029036563,0.002449551,0.0074861804],"category_scores_gemma":[0.013110866,0.0012221803,0.004742955,0.0013683027,0.0044221007,0.006864646,0.0057650795,0.0069338894,0.0008961389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011758627,0.000577476,0.0030641467,0.0017195102,0.0003485776,0.0015466054,0.002392468,0.26584718,0.014925224,0.6295097,0.01700119,0.06189222],"study_design_scores_gemma":[0.00031031383,0.00010458625,0.00044719302,0.00011208596,0.00012062235,0.00026912367,0.00033736508,0.14709306,0.008736734,0.8346396,0.0077591636,0.00007009813],"about_ca_topic_score_codex":0.012495071,"about_ca_topic_score_gemma":0.012407186,"teacher_disagreement_score":0.012495071,"about_ca_system_score_codex":0.002835025,"about_ca_system_score_gemma":0.00362131,"threshold_uncertainty_score":0.025043786},"labels":[],"label_agreement":null},{"id":"W4405765923","doi":"10.4230/lipics.esa.2022.56","title":"Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Algorithm; Mathematics; Combinatorics; Computer science; Statistics","score_opus":0.026285380078038455,"score_gpt":0.2950712382600269,"score_spread":0.26878585818198847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405765923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012408086,0.00081941177,0.9792586,0.0005295644,0.00014870941,0.0000980606,0.00029061048,0.001783214,0.0046638213],"genre_scores_gemma":[0.1507498,0.00055055687,0.8413237,0.00038314986,0.00018696005,0.00027893813,0.001068186,0.0007528174,0.0047058607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955167,0.0010672131,0.00023013397,0.0008329414,0.0016647774,0.00068827294],"domain_scores_gemma":[0.99438864,0.0022485785,0.000434677,0.0018399847,0.0007621671,0.00032592213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031120337,0.0023232873,0.0024860366,0.001837988,0.0013454811,0.002855286,0.004319447,0.002557053,0.005711228],"category_scores_gemma":[0.015833631,0.0009949052,0.00216172,0.0033904004,0.001313645,0.004880109,0.00370473,0.0048709963,0.0032756424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087553845,0.0002861789,0.0010828234,0.00041490595,0.00011726701,0.00013781332,0.00040702787,0.6902141,0.008751944,0.10582566,0.020101933,0.17178479],"study_design_scores_gemma":[0.000060936825,0.000055944587,0.00017359252,0.000026877755,0.00001830664,0.00007907771,0.000051838077,0.94747144,0.0021110813,0.046107672,0.0038239122,0.000019284122],"about_ca_topic_score_codex":0.006060365,"about_ca_topic_score_gemma":0.008078489,"teacher_disagreement_score":0.006060365,"about_ca_system_score_codex":0.0036314533,"about_ca_system_score_gemma":0.0023031048,"threshold_uncertainty_score":0.026348174},"labels":[],"label_agreement":null},{"id":"W4406206083","doi":"10.4230/lipics.icdt.2024.15","title":"Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Ministry of Education, India; Agence Nationale de la Recherche; National Research Foundation; Deutsche Forschungsgemeinschaft; National Research Foundation Singapore","keywords":"Probabilistic logic; Computer science; Conjunctive query; Theoretical computer science; Artificial intelligence; Information retrieval; Relational database","score_opus":0.02464285751339443,"score_gpt":0.2679624310476123,"score_spread":0.24331957353421788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406206083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09549912,0.0035768151,0.8737667,0.011158307,0.00015824735,0.00021755048,0.0010679802,0.0023023384,0.012252946],"genre_scores_gemma":[0.69030416,0.0021168103,0.29703468,0.0020301794,0.0008913961,0.00046632133,0.0012170428,0.0011230581,0.0048163235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9749619,0.0071935398,0.0016438412,0.0059199845,0.007872631,0.0024081522],"domain_scores_gemma":[0.8290335,0.1424006,0.0044579194,0.018908584,0.0036130506,0.0015862591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017576002,0.0019244023,0.0036264982,0.0019951,0.001998225,0.01128444,0.006988209,0.0041977167,0.004812851],"category_scores_gemma":[0.105461664,0.0019479295,0.005994954,0.0034629316,0.0063954163,0.033543695,0.007347955,0.0120806685,0.0010144251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009982216,0.00031767983,0.0044643534,0.0008882212,0.00040598944,0.00039924085,0.0017675898,0.20384696,0.0031093962,0.7110716,0.0065651066,0.06616555],"study_design_scores_gemma":[0.00006914724,0.000045371395,0.00033783674,0.00006005119,0.00011610891,0.00019853107,0.00016134985,0.4146361,0.0014018564,0.58078086,0.0021636991,0.000029114446],"about_ca_topic_score_codex":0.0060778335,"about_ca_topic_score_gemma":0.00405736,"teacher_disagreement_score":0.017576002,"about_ca_system_score_codex":0.006948785,"about_ca_system_score_gemma":0.0029514467,"threshold_uncertainty_score":0.092951834},"labels":[],"label_agreement":null},{"id":"W4412212567","doi":"10.4230/dagrep.14.5.58","title":"Evaluation Perspectives of Recommender Systems: Driving Research and Education (Dagstuhl Seminar 24211)","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Joint Research Centre; Universität Innsbruck; Universität Duisburg-Essen; Universiteit Antwerpen; Universidade Federal de Minas Gerais; Göteborgs Universitet; Technische Universität Wien; Technische Universiteit Delft; Science Foundation Ireland; York University; Vrije Universiteit Brussel; Universität Siegen; University College Dublin; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Drexel University; University of Pittsburgh; University of Minnesota; National Science Foundation","keywords":"Computer science","score_opus":0.06446594382043357,"score_gpt":0.3821489684670414,"score_spread":0.3176830246466078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412212567","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011054803,0.16717306,0.0361289,0.71453947,0.012886928,0.00019234583,0.00029082916,0.00026944967,0.057464287],"genre_scores_gemma":[0.5698747,0.15368134,0.08434288,0.060155462,0.021851756,0.0012607856,0.0006756533,0.0009252709,0.10723217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.96885854,0.022062233,0.00072965235,0.0015984311,0.004690905,0.0020601035],"domain_scores_gemma":[0.9734403,0.017413076,0.00078309095,0.00074607955,0.0037085472,0.0039089536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07277546,0.0009820936,0.0011684285,0.0028522508,0.0040728757,0.011184142,0.0024037277,0.008001219,0.011014257],"category_scores_gemma":[0.03238954,0.00089374825,0.0008871382,0.0025082438,0.009466097,0.011833093,0.00773381,0.011257573,0.004370467],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002806522,0.00028309616,0.00052670547,0.00068468414,0.000030839048,0.00024043224,0.009865479,0.001346837,0.0009062109,0.4892371,0.30307892,0.19351907],"study_design_scores_gemma":[0.00007995387,0.00021463615,0.0011829467,0.0017742019,0.00001992435,0.00017170713,0.0051087826,0.0016854433,0.0009531378,0.22439322,0.7643316,0.000084508785],"about_ca_topic_score_codex":0.004935371,"about_ca_topic_score_gemma":0.0041494505,"teacher_disagreement_score":0.07277546,"about_ca_system_score_codex":0.014845158,"about_ca_system_score_gemma":0.008881629,"threshold_uncertainty_score":0.38487804},"labels":[],"label_agreement":null},{"id":"W4412224928","doi":"10.4230/lipics.itcs.2024.20","title":"Discreteness of Asymptotic Tensor Ranks (Extended Abstract)","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Elasticity and Wave Propagation","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Novo Nordisk Fonden; Université de Genève; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Novo Nordisk; National Centres of Competence in Research SwissMAP; Centre de Recherches Mathématiques; Erasmus+; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Villum Fonden; National Science Foundation","keywords":"Tensor (intrinsic definition); Mathematics; Geology; Pure mathematics","score_opus":0.008627982498156384,"score_gpt":0.2272095582785489,"score_spread":0.21858157578039253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412224928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3765424,0.0020000732,0.46510506,0.0028807672,0.00086590654,0.000095298376,0.002467418,0.0010658788,0.1489771],"genre_scores_gemma":[0.9505936,0.00088340446,0.02894592,0.0005619362,0.0007515493,0.000110327564,0.001078383,0.000301205,0.016773747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842656,0.0003257886,0.000108172055,0.00044705567,0.00041133218,0.0002811215],"domain_scores_gemma":[0.99265116,0.002820542,0.0010918239,0.0013198289,0.0014179846,0.0006986274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014436095,0.0008436048,0.00069966214,0.00208034,0.00080163317,0.002826603,0.0008713312,0.00053018273,0.01924869],"category_scores_gemma":[0.00848611,0.0003033558,0.0009351216,0.0012798955,0.0036051287,0.0054604993,0.0022322426,0.0024293212,0.002640923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010712507,0.000045880075,0.0010415383,0.00012794175,0.000019586963,0.0001298037,0.00022870814,0.004679237,0.0023824265,0.97269315,0.0042315847,0.014313022],"study_design_scores_gemma":[0.000008246198,0.00005279211,0.0009494106,0.00002230248,0.000008482069,0.00018131384,0.000057169043,0.018790081,0.001385307,0.97442055,0.004097503,0.000026932832],"about_ca_topic_score_codex":0.0009411716,"about_ca_topic_score_gemma":0.0006991193,"teacher_disagreement_score":0.01924869,"about_ca_system_score_codex":0.0013201218,"about_ca_system_score_gemma":0.00048532768,"threshold_uncertainty_score":0.06439328},"labels":[],"label_agreement":null},{"id":"W44525949","doi":"10.4230/dagsemproc.07351.7","title":"Belief Change and Cryptographic Protocol Verification","year":2007,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Protocol (science); Cryptographic protocol; Computer science; Cryptographic primitive; Context (archaeology); Theoretical computer science; Cryptography; Model checking; Computer security; Medicine","score_opus":0.03827127503498007,"score_gpt":0.31928922582668573,"score_spread":0.28101795079170566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44525949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019057605,0.0014988497,0.9611215,0.004449848,0.00019516432,0.00021060537,0.00011700856,0.00065772334,0.012691631],"genre_scores_gemma":[0.680832,0.001450415,0.30751786,0.0013889122,0.0004778969,0.00053935515,0.00025676005,0.00015866119,0.0073781423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98187673,0.008680348,0.0009858187,0.0022144283,0.004864365,0.0013783787],"domain_scores_gemma":[0.9633129,0.027067995,0.0022946973,0.0036632302,0.0030201366,0.0006410138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014541933,0.00086468284,0.00093105604,0.0022712292,0.0021316826,0.004659763,0.002814321,0.0030801469,0.0045507904],"category_scores_gemma":[0.039754085,0.0007338176,0.0021731239,0.0018477426,0.012304715,0.011688701,0.0048651635,0.0061618043,0.00097577384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012799734,0.00005368583,0.00046369658,0.00018322885,0.00004777094,0.00030453407,0.00079294224,0.008711649,0.0013474632,0.9586669,0.0008929883,0.028406952],"study_design_scores_gemma":[0.000059515416,0.00006264207,0.00013374045,0.00006666002,0.00004002991,0.00016019389,0.00013271019,0.050442893,0.0026937912,0.94109493,0.005075579,0.00003733943],"about_ca_topic_score_codex":0.003432263,"about_ca_topic_score_gemma":0.0013879145,"teacher_disagreement_score":0.014541933,"about_ca_system_score_codex":0.0036800436,"about_ca_system_score_gemma":0.0027559025,"threshold_uncertainty_score":0.076906025},"labels":[],"label_agreement":null},{"id":"W6891491675","doi":"10.4230/lipics.disc.2022.30","title":"The Space Complexity of Scannable Objects with Bounded Components","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Object (grammar); Component (thermodynamics); Domain (mathematical analysis); Asynchronous communication; Construct (python library); Sequence (biology); Binary number","score_opus":0.022658546970267722,"score_gpt":0.23157766563717694,"score_spread":0.2089191186669092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891491675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6471391,0.00079016126,0.3339258,0.0014987757,0.000061033457,0.00023288348,0.0005406621,0.003427682,0.012383909],"genre_scores_gemma":[0.8679812,0.00044192307,0.12256068,0.00023337042,0.00005179043,0.00055825856,0.0008289085,0.00055200624,0.006791807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922956,0.001432955,0.0007109391,0.0010276994,0.0027484398,0.001784282],"domain_scores_gemma":[0.98536193,0.008419811,0.0011160198,0.0037062431,0.0009542329,0.0004416502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027597672,0.0010729628,0.001110442,0.0009248833,0.0013326685,0.005277225,0.003751334,0.0015288215,0.00592384],"category_scores_gemma":[0.01118103,0.0010195635,0.0020159485,0.0017769396,0.0029094422,0.0109821195,0.0050218673,0.0025052023,0.00091553223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038955042,0.00045540364,0.010558282,0.0011284723,0.00026757506,0.0006450656,0.0016727684,0.3997403,0.07496047,0.3753868,0.005640263,0.12564903],"study_design_scores_gemma":[0.00042634644,0.00040431359,0.0013538735,0.00009410184,0.00025572677,0.00022664564,0.0002769151,0.7374779,0.039923318,0.21305531,0.006399776,0.000105825544],"about_ca_topic_score_codex":0.0039667836,"about_ca_topic_score_gemma":0.003255467,"teacher_disagreement_score":0.00592384,"about_ca_system_score_codex":0.0033000894,"about_ca_system_score_gemma":0.004193856,"threshold_uncertainty_score":0.023943901},"labels":[],"label_agreement":null},{"id":"W6891507486","doi":"10.4230/lipics.cp.2024.32","title":"Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Dynamic programming; Constraint (computer-aided design); Exploit; Integer programming; Set (abstract data type); State (computer science); Construct (python library); Variable (mathematics); Dimension (graph theory)","score_opus":0.006743633718957348,"score_gpt":0.21102507861418743,"score_spread":0.2042814448952301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891507486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008035565,0.00015442644,0.9879082,0.00023279835,0.00002588763,0.000052551226,0.000090840214,0.00021829603,0.0032815244],"genre_scores_gemma":[0.22906075,0.0005076832,0.76427805,0.00024819653,0.000075657634,0.0003600686,0.0005204182,0.00027045174,0.004678741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989717,0.00036436395,0.00004198067,0.00022182436,0.00023571793,0.0001643978],"domain_scores_gemma":[0.9978529,0.0014681144,0.00019644228,0.0002434594,0.00014675825,0.00009237276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019836512,0.0013370711,0.00094663136,0.0008521687,0.0005055404,0.0019622834,0.0016495176,0.0012711278,0.005110635],"category_scores_gemma":[0.0037906056,0.0008241405,0.0014681359,0.0012798541,0.0011026039,0.0027561097,0.0019746611,0.0029807435,0.0005922751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005791465,0.0001129687,0.00039248785,0.00015088034,0.000042847467,0.000058493933,0.00006371596,0.87067825,0.0016041214,0.07360294,0.0018390047,0.051396426],"study_design_scores_gemma":[0.000015812899,0.00003239099,0.000042931642,0.000019324581,0.000007237781,0.000018380233,0.000023162842,0.96083176,0.00089004164,0.03664516,0.0014671962,0.0000066796133],"about_ca_topic_score_codex":0.0027977005,"about_ca_topic_score_gemma":0.0043736342,"teacher_disagreement_score":0.005110635,"about_ca_system_score_codex":0.0013413555,"about_ca_system_score_gemma":0.0022070517,"threshold_uncertainty_score":0.017096758},"labels":[],"label_agreement":null},{"id":"W6891547493","doi":"10.4230/lipics.itcs.2025.37","title":"A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Toronto; McGill University","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; University of Rochester","keywords":"Boolean function; Logarithm; Parity function; Binary decision diagram; Exponential function; Norm (philosophy); Upper and lower bounds; Integer (computer science); Binary number","score_opus":0.015653053134792778,"score_gpt":0.26034667450172133,"score_spread":0.24469362136692854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891547493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011844712,0.0014297797,0.96400815,0.0019987945,0.00040624358,0.00008253716,0.0002754121,0.00035789228,0.019596506],"genre_scores_gemma":[0.4950076,0.0049713836,0.46798322,0.0029245066,0.0027019263,0.0010266997,0.0009750971,0.0009933687,0.023416176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550325,0.0011113256,0.000204684,0.0008618882,0.0018060062,0.0005128551],"domain_scores_gemma":[0.9765276,0.017014828,0.0008629251,0.0026177191,0.002162517,0.0008143299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005035624,0.0021671825,0.0015178799,0.002316478,0.0010861348,0.003127064,0.0030158253,0.002128273,0.008636189],"category_scores_gemma":[0.03697269,0.0007722596,0.0025557568,0.0023042536,0.0046758777,0.010742427,0.005671989,0.011131829,0.0028547838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020804766,0.00019009027,0.0010445289,0.00030713866,0.00005665009,0.00021364354,0.0002607888,0.034600604,0.01053014,0.8744567,0.006395291,0.071736336],"study_design_scores_gemma":[0.000025204476,0.00015117394,0.0003972058,0.00009009515,0.000032747015,0.00021493158,0.000044281584,0.27676228,0.006620716,0.70868886,0.006908418,0.00006422129],"about_ca_topic_score_codex":0.0010560518,"about_ca_topic_score_gemma":0.00089876534,"teacher_disagreement_score":0.008636189,"about_ca_system_score_codex":0.002681766,"about_ca_system_score_gemma":0.0018106987,"threshold_uncertainty_score":0.028890908},"labels":[],"label_agreement":null},{"id":"W6891549005","doi":"10.4230/lipics.ecrts.2025.2","title":"Multi-Objective Memory Bandwidth Regulation and Cache Partitioning for Multicore Real-Time Systems","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Bundesministerium für Bildung und Forschung","keywords":"Cache; Scheduling (production processes); Knapsack problem; Heuristic; Bandwidth (computing); Benchmarking; Multi-core processor; Memory bandwidth; Task (project management); Linear programming","score_opus":0.014450534183901556,"score_gpt":0.26341798192404414,"score_spread":0.2489674477401426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891549005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10857521,0.0017544407,0.8780533,0.0005294452,0.00007022415,0.00019667072,0.0002096136,0.0011371074,0.009473912],"genre_scores_gemma":[0.7207441,0.0005622774,0.2716533,0.00018972528,0.000045579076,0.00048581016,0.00031052882,0.00025407426,0.0057546413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949574,0.00020371788,0.000016947073,0.00007831473,0.00012010555,0.00008520438],"domain_scores_gemma":[0.99926144,0.00049257465,0.0001055703,0.000028102413,0.00007927099,0.00003312499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009075548,0.001173108,0.0005844357,0.00056401826,0.0003382415,0.00084852974,0.00076688454,0.0008092923,0.0021003906],"category_scores_gemma":[0.0019311099,0.00043159202,0.00047585927,0.0005559577,0.0005102582,0.00058976084,0.0007184549,0.0007306673,0.00024631998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002582453,0.000026392985,0.00016063279,0.0000504182,0.000009593089,0.000020841964,0.000014175232,0.9868771,0.00096794585,0.0013834502,0.00033751558,0.010126086],"study_design_scores_gemma":[0.000007022327,0.00001812337,0.000055342553,0.0000054398847,0.0000030821586,0.0000047479384,0.0000057292978,0.9985145,0.00044118954,0.00065750215,0.00028514993,0.0000021331357],"about_ca_topic_score_codex":0.006611646,"about_ca_topic_score_gemma":0.005317272,"teacher_disagreement_score":0.006611646,"about_ca_system_score_codex":0.00094052433,"about_ca_system_score_gemma":0.0014816858,"threshold_uncertainty_score":0.013146341},"labels":[],"label_agreement":null},{"id":"W6891556177","doi":"10.4230/lipics.aofa.2018.1","title":"OMG: GW, CLT, CRT and CFTP (Flajolet Award Lecture)","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Work (physics); Mistake; Troubleshooting","score_opus":0.03266786689363419,"score_gpt":0.3306004135705848,"score_spread":0.29793254667695057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891556177","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005172313,0.0667924,0.020225488,0.07653254,0.11131675,0.00009891245,0.0032173423,0.0013736978,0.7152706],"genre_scores_gemma":[0.05267306,0.04441013,0.015434805,0.0069673923,0.047992352,0.00019801658,0.003472495,0.001552365,0.8272995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888724,0.00012951162,0.000048370228,0.00035668132,0.0003646383,0.00021366934],"domain_scores_gemma":[0.99880683,0.00022743392,0.000053421696,0.00008710949,0.00026641524,0.00055873743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018413687,0.0013272295,0.0010142095,0.002071851,0.0013346163,0.0037492712,0.0009974112,0.0022075442,0.20508726],"category_scores_gemma":[0.0037284016,0.0002872624,0.00072552584,0.0027720435,0.00095103716,0.004185375,0.0029256674,0.0031103624,0.11389217],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009156078,0.000051870014,0.0002702321,0.00036026703,0.000018509769,0.00015243077,0.00009617282,0.00037802823,0.000916186,0.14102715,0.61906064,0.23757696],"study_design_scores_gemma":[0.00001865175,0.00003028165,0.00061151694,0.0002357736,0.000011083188,0.00023177297,0.000061978084,0.00040779248,0.00034576122,0.04708183,0.9509424,0.000021197677],"about_ca_topic_score_codex":0.00155517,"about_ca_topic_score_gemma":0.0020606578,"teacher_disagreement_score":0.20508726,"about_ca_system_score_codex":0.0035546909,"about_ca_system_score_gemma":0.0020454738,"threshold_uncertainty_score":0.6860852},"labels":[],"label_agreement":null},{"id":"W6891559455","doi":"10.4230/lipics.disc.2022.40","title":"Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dominating set; Set cover problem; Set (abstract data type); Connected dominating set; Cover (algebra); Distributed algorithm","score_opus":0.030134733620477132,"score_gpt":0.2921644039674968,"score_spread":0.2620296703470197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891559455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021085276,0.053336922,0.8863791,0.027121432,0.016595244,0.000113866394,0.00020615377,0.00045246258,0.013686217],"genre_scores_gemma":[0.11903132,0.10247687,0.67621714,0.0129545275,0.046831228,0.0005931022,0.0012667201,0.00065079797,0.039978344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977842,0.00064820226,0.00015160828,0.0005627795,0.00070940127,0.0001438483],"domain_scores_gemma":[0.9966419,0.0018033232,0.000092587565,0.00042271416,0.0007690562,0.0002705208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035394246,0.0013151284,0.001521108,0.0018044912,0.0012232093,0.003577638,0.0025081271,0.002879001,0.004942561],"category_scores_gemma":[0.0061499774,0.000764833,0.0013877585,0.0033525818,0.0023645272,0.010870858,0.001967722,0.0074230693,0.0022801473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018412093,0.00011885348,0.0003865748,0.0010557513,0.000107694425,0.0001652924,0.00021047775,0.021037698,0.0020857677,0.5848895,0.10952117,0.28023705],"study_design_scores_gemma":[0.000087315784,0.00018323104,0.00027283467,0.0002516826,0.000075910626,0.0005250274,0.00015672551,0.094742455,0.0014115066,0.50339127,0.39883474,0.000067380526],"about_ca_topic_score_codex":0.0013068271,"about_ca_topic_score_gemma":0.0009041775,"teacher_disagreement_score":0.004942561,"about_ca_system_score_codex":0.002461426,"about_ca_system_score_gemma":0.0017386607,"threshold_uncertainty_score":0.018718481},"labels":[],"label_agreement":null},{"id":"W6891564556","doi":"10.4230/lipics.cp.2025.30","title":"Exact Methods for the Travelling Salesperson Problem with Self-Deleting Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Vertex (graph theory); Solver; Preprocessor; Integer programming; Linear programming; Constraint programming; Dependency graph; Simple (philosophy)","score_opus":0.012088851120582863,"score_gpt":0.29377524430412555,"score_spread":0.28168639318354266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891564556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008075647,0.00083996105,0.98420006,0.00027777674,0.000061031846,0.0000964941,0.00014169504,0.00033261793,0.005974737],"genre_scores_gemma":[0.20383039,0.0011118122,0.7873941,0.00022337116,0.00012199793,0.00036602432,0.00050418277,0.00044118555,0.0060069533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991738,0.00034374924,0.00003351284,0.0001490998,0.0001957483,0.00010416429],"domain_scores_gemma":[0.9975216,0.0018878214,0.00017816233,0.00014810389,0.00019363532,0.00007070586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016833794,0.0013759087,0.0011868168,0.0009540107,0.0005047351,0.0014749996,0.0021434186,0.0014036141,0.0064707873],"category_scores_gemma":[0.004962747,0.00075054105,0.0011167427,0.0015429718,0.0008271726,0.0017897076,0.001158334,0.0022739766,0.0009314127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036969366,0.00006521459,0.00025224636,0.00017439316,0.000036114245,0.00004103821,0.000041272913,0.9296945,0.00032488967,0.026737668,0.0018619705,0.040733706],"study_design_scores_gemma":[0.000011663671,0.0000131818415,0.000033755492,0.00001510529,0.000005321889,0.000009480572,0.000015828093,0.98423946,0.00010250449,0.0146922385,0.0008583251,0.0000031954467],"about_ca_topic_score_codex":0.008659228,"about_ca_topic_score_gemma":0.010136141,"teacher_disagreement_score":0.008659228,"about_ca_system_score_codex":0.001509852,"about_ca_system_score_gemma":0.0023128903,"threshold_uncertainty_score":0.021646976},"labels":[],"label_agreement":null},{"id":"W6891570807","doi":"10.4230/oasics.manzini.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.02358150356367914,"score_gpt":0.20934650921269696,"score_spread":0.18576500564901782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891570807","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006614506,0.0047206967,0.0016255421,0.016632192,0.2733466,0.0008055959,0.007884469,0.0021447705,0.6921788],"genre_scores_gemma":[0.0017419748,0.002300361,0.00052105123,0.0021351895,0.04622373,0.0002655493,0.0028455567,0.00091881934,0.94304776],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991831,0.000052675838,0.00007743918,0.00015832022,0.00039348903,0.00013486712],"domain_scores_gemma":[0.99463046,0.000449254,0.00025427225,0.00025798992,0.0021850816,0.0022228642],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001279385,0.0015659132,0.0015215593,0.0022789985,0.0017894283,0.009958579,0.0015444527,0.0030927968,0.84719014],"category_scores_gemma":[0.0060174125,0.0005742537,0.00083125365,0.0017520313,0.00048165224,0.003885196,0.001816198,0.0027611759,0.84447557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036988502,0.000033549546,0.000048131944,0.00014926778,0.0000020543062,0.000020289415,0.00000404683,0.00003722276,0.00022065632,0.00035530824,0.9661649,0.032927565],"study_design_scores_gemma":[0.000032456683,0.000034211753,0.00056663656,0.00016197667,0.0000034492327,0.000051427574,0.000037763617,0.00013035089,0.00017701552,0.0007990609,0.99799323,0.000012482333],"about_ca_topic_score_codex":0.0012674907,"about_ca_topic_score_gemma":0.0024234762,"teacher_disagreement_score":0.15280986,"about_ca_system_score_codex":0.0014418818,"about_ca_system_score_gemma":0.0019842065,"threshold_uncertainty_score":0.21796465},"labels":[],"label_agreement":null},{"id":"W6891584202","doi":"10.4230/lipics.disc.2024.7","title":"A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Snapshot (computer storage); Concurrency; Linearizability; Concurrent computing; Constant (computer programming)","score_opus":0.021010650707451794,"score_gpt":0.27211145065385633,"score_spread":0.25110079994640455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891584202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011182709,0.00038262716,0.93037313,0.00009766027,0.00010022489,0.00026858252,0.0005670356,0.053373024,0.0036549957],"genre_scores_gemma":[0.16074051,0.00028155124,0.815396,0.00025522502,0.000091518436,0.00067005854,0.0025621587,0.00431,0.015693024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907935,0.00009525137,0.000079727855,0.00023386216,0.00039193197,0.00011983554],"domain_scores_gemma":[0.99835,0.00020130424,0.00009894307,0.0009757334,0.00025456704,0.00011945686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011331916,0.00092349155,0.00073597045,0.0008675105,0.0005949765,0.0017572632,0.0029880607,0.0009376598,0.0076115006],"category_scores_gemma":[0.0027488363,0.0008829479,0.00073573965,0.0009296457,0.00084814866,0.003733027,0.0032262942,0.0014837994,0.0033828877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024057191,0.00027039138,0.004091002,0.00055227865,0.0001283511,0.0004492506,0.00059580605,0.01202034,0.06753103,0.08840862,0.026647812,0.7968993],"study_design_scores_gemma":[0.00063128397,0.0010116107,0.0042223693,0.00024011104,0.00023555514,0.0015496208,0.00022252707,0.3003491,0.18398364,0.08799534,0.41910416,0.0004546285],"about_ca_topic_score_codex":0.0016509609,"about_ca_topic_score_gemma":0.0020123655,"teacher_disagreement_score":0.0076115006,"about_ca_system_score_codex":0.00085334684,"about_ca_system_score_gemma":0.0012156565,"threshold_uncertainty_score":0.025463045},"labels":[],"label_agreement":null},{"id":"W6891614947","doi":"10.4230/lipics.wabi.2025.3","title":"Approximability of Longest Run Subsequence and Complementary Minimization Problems","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Substring; Longest increasing subsequence; Longest common subsequence problem; String (physics); Symbol (formal)","score_opus":0.014477793212230188,"score_gpt":0.2575422535346263,"score_spread":0.2430644603223961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891614947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13720341,0.0022986538,0.8472252,0.0017975731,0.0002536649,0.00014911068,0.0008722727,0.0016793727,0.008520677],"genre_scores_gemma":[0.68050694,0.0014194807,0.30477944,0.0006701217,0.00057305425,0.0003964912,0.0031332492,0.00086595974,0.0076552574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964079,0.0009561551,0.00020391567,0.0012365469,0.0007014306,0.0004940077],"domain_scores_gemma":[0.98712337,0.010275286,0.0008633625,0.0007507396,0.0005968451,0.00039042372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027441944,0.0022341933,0.00236447,0.0011249679,0.0008067475,0.0022206297,0.0031216922,0.0019783108,0.004590579],"category_scores_gemma":[0.020913418,0.0007720463,0.0025993143,0.0015908221,0.0019665388,0.0049633635,0.002384761,0.0034518302,0.00070919713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010020809,0.0005794253,0.0029940382,0.0013837924,0.0003718012,0.00042232109,0.00046126256,0.77553546,0.004430923,0.12820667,0.008813028,0.07579909],"study_design_scores_gemma":[0.00007622171,0.00012456393,0.00023508725,0.000036111534,0.000050445244,0.00014446996,0.000057895686,0.85248274,0.0011845492,0.14429586,0.0012952965,0.0000167343],"about_ca_topic_score_codex":0.0031518242,"about_ca_topic_score_gemma":0.0024193907,"teacher_disagreement_score":0.004590579,"about_ca_system_score_codex":0.001857066,"about_ca_system_score_gemma":0.002282409,"threshold_uncertainty_score":0.0153570175},"labels":[],"label_agreement":null},{"id":"W6891621332","doi":"10.4230/oasics.fab.2021.4","title":"TimeFabric: Trusted Time for Permissioned Blockchains","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Timestamp; Database transaction; Overhead (engineering); Popularity; Cache; Blockchain; Throughput","score_opus":0.01121591023393957,"score_gpt":0.24739395347187867,"score_spread":0.23617804323793912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891621332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0413954,0.00077129336,0.9163098,0.00074141385,0.0003207927,0.00042859497,0.00039930458,0.020639755,0.018993711],"genre_scores_gemma":[0.7897252,0.0006833422,0.1902591,0.00019164741,0.00017125558,0.00033940087,0.0006984592,0.0017311664,0.016200395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966583,0.00072703516,0.00018901528,0.00033684773,0.0016259743,0.00046281217],"domain_scores_gemma":[0.9943715,0.0014659063,0.00046434155,0.0024049103,0.0008457558,0.00044768158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021758997,0.0006149116,0.0005707845,0.0008098153,0.001403725,0.0024789104,0.001772778,0.0011531365,0.014885036],"category_scores_gemma":[0.009745211,0.0005362396,0.00040440419,0.00082017115,0.0017792416,0.005680755,0.0035775155,0.0019596461,0.003097087],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002560657,0.00029058702,0.0036657755,0.00078799913,0.000080508704,0.0014511296,0.00168765,0.072029576,0.065529846,0.4230318,0.029957512,0.398927],"study_design_scores_gemma":[0.0003651052,0.0005552539,0.00071202446,0.00024124718,0.00005580843,0.00089978887,0.00028057143,0.5961891,0.10161826,0.15060538,0.14830942,0.00016814268],"about_ca_topic_score_codex":0.0026359565,"about_ca_topic_score_gemma":0.002137963,"teacher_disagreement_score":0.014885036,"about_ca_system_score_codex":0.0011013094,"about_ca_system_score_gemma":0.0023554235,"threshold_uncertainty_score":0.04979539},"labels":[],"label_agreement":null},{"id":"W6891626384","doi":"10.4230/lipics.opodis.2022.6","title":"The Step Complexity of Multidimensional Approximate Agreement","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convex hull; Computational complexity theory; Upper and lower bounds; Set (abstract data type); Time complexity; Measure (data warehouse); Regular polygon; Approximation algorithm","score_opus":0.03932867486288999,"score_gpt":0.27307863806881294,"score_spread":0.23374996320592295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891626384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10754571,0.0003466902,0.8812029,0.00095631345,0.000044661778,0.00018586,0.00037615412,0.0012775701,0.0080641685],"genre_scores_gemma":[0.7131525,0.00025651837,0.28049308,0.0002443713,0.000043583357,0.0004981278,0.0006339265,0.00019998872,0.0044778343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926146,0.0015567432,0.00076453417,0.0013745627,0.0029577003,0.00073178066],"domain_scores_gemma":[0.96573514,0.024144066,0.0016682529,0.0057486785,0.0020791038,0.00062470685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003384975,0.0006590067,0.0012578411,0.0008624898,0.0010556998,0.0038883605,0.0027248156,0.0019155708,0.0056567965],"category_scores_gemma":[0.026349733,0.00057295273,0.0013310557,0.0014041422,0.0021295373,0.009295795,0.004908826,0.0033801575,0.0013892157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023473497,0.00036829736,0.005920145,0.00075269566,0.00022172538,0.00031448144,0.0010236363,0.4489114,0.034291055,0.2981278,0.004281398,0.20344],"study_design_scores_gemma":[0.00008230347,0.00016749957,0.00067745335,0.000036311485,0.000039631006,0.00015075946,0.00012926638,0.8202931,0.019060493,0.15718804,0.002135583,0.00003954191],"about_ca_topic_score_codex":0.0013748097,"about_ca_topic_score_gemma":0.0010772444,"teacher_disagreement_score":0.0056567965,"about_ca_system_score_codex":0.0020884562,"about_ca_system_score_gemma":0.0020780496,"threshold_uncertainty_score":0.018923938},"labels":[],"label_agreement":null},{"id":"W6891641062","doi":"10.4230/dagrep.14.6.52","title":"Geometric modeling: Challenges for Additive Manufacturing, Design and Analysis (Dagstuhl Seminar 24241)","year":2024,"lang":"en","type":"report","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Geometric modeling; Geometric design; Working life; Working group","score_opus":0.08610964884947203,"score_gpt":0.3220765428645641,"score_spread":0.23596689401509208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891641062","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029727623,0.10309042,0.15192817,0.2036854,0.034896616,0.000967299,0.007839641,0.003465987,0.46439877],"genre_scores_gemma":[0.11343821,0.042786647,0.08447013,0.0054158526,0.009945696,0.001395579,0.009032695,0.0030715405,0.73044366],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940001,0.0012151552,0.00015600397,0.00039472443,0.0035078872,0.0007261503],"domain_scores_gemma":[0.99742484,0.000638969,0.00013504965,0.00028940654,0.00073358626,0.0007780982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077002733,0.001957273,0.0012111138,0.002224523,0.0020406255,0.006559751,0.00268643,0.004599482,0.051167727],"category_scores_gemma":[0.0058720093,0.00081716117,0.0012051063,0.002575227,0.0015233807,0.0033814749,0.0063090683,0.004912617,0.040325284],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026228747,0.00019589944,0.0002894593,0.0004227112,0.000026726746,0.00030685164,0.00044779945,0.0050894995,0.0033221017,0.083787374,0.7576108,0.14823847],"study_design_scores_gemma":[0.00003584158,0.00010497629,0.0006115238,0.00021122315,0.000010128699,0.0002059319,0.00021234814,0.0029924235,0.0038154745,0.052772317,0.93899894,0.000028909863],"about_ca_topic_score_codex":0.002040268,"about_ca_topic_score_gemma":0.0026058063,"teacher_disagreement_score":0.051167727,"about_ca_system_score_codex":0.0040712375,"about_ca_system_score_gemma":0.0053487658,"threshold_uncertainty_score":0.1711731},"labels":[],"label_agreement":null},{"id":"W6891642036","doi":"10.4230/lipics.aft.2024.23","title":"A Shortfall in Investor Expectations of Leveraged Tokens","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Autorité des Marchés Financiers","keywords":"Leverage (statistics); Transparency (behavior); Cryptocurrency; Audit; Financial market; Price discovery; Work (physics)","score_opus":0.013719740893647133,"score_gpt":0.2591786933417796,"score_spread":0.24545895244813248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891642036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9524399,0.000544243,0.025304383,0.0041490966,0.00004519502,0.0000404783,0.00042880417,0.00025074856,0.016797097],"genre_scores_gemma":[0.99829334,0.00007817637,0.0007385778,0.00012605776,0.000023099792,0.00000878165,0.00008297969,0.00001936607,0.00062952377],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970709,0.0007746378,0.00021838651,0.00049860193,0.0010549686,0.0003824595],"domain_scores_gemma":[0.9679736,0.016497692,0.008946108,0.0034717775,0.0022292994,0.0008816403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069140033,0.0002965822,0.0006439596,0.00091285154,0.000685871,0.004554051,0.0007654612,0.001088101,0.0051906314],"category_scores_gemma":[0.048870984,0.00029696614,0.00033156868,0.0007553088,0.0017806744,0.006559487,0.0017643254,0.0017296441,0.00082795415],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020525502,0.0003203984,0.6306998,0.0003525105,0.00032629914,0.002623212,0.0049653314,0.03655182,0.015967565,0.15420409,0.008581087,0.14335534],"study_design_scores_gemma":[0.00023626647,0.000935846,0.4302848,0.00050183455,0.00022508118,0.0021645136,0.0067399577,0.17081164,0.02261069,0.3385489,0.026590016,0.00035038244],"about_ca_topic_score_codex":0.0010401569,"about_ca_topic_score_gemma":0.0008982645,"teacher_disagreement_score":0.0069140033,"about_ca_system_score_codex":0.0009034614,"about_ca_system_score_gemma":0.0006185884,"threshold_uncertainty_score":0.036565185},"labels":[],"label_agreement":null},{"id":"W6891653032","doi":"10.4230/lipics.sat.2025.18","title":"Towards Practical First-Order Model Counting","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Inference; Scalability; Domain (mathematical analysis); Code (set theory); Function (biology); State (computer science); Scale (ratio)","score_opus":0.03395770335754854,"score_gpt":0.34158758421404917,"score_spread":0.3076298808565006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891653032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009657682,0.00030780936,0.9802303,0.0007199018,0.00007185084,0.00007634825,0.0002241177,0.0057067554,0.0030051433],"genre_scores_gemma":[0.19015639,0.0004464523,0.8018631,0.00045729507,0.0001178833,0.00024835733,0.001039533,0.0020734929,0.003597522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873754,0.0039486857,0.0005989587,0.0021178464,0.004977376,0.0009817557],"domain_scores_gemma":[0.9656681,0.020334303,0.0011220156,0.009336124,0.0030504582,0.0004889545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006262444,0.001581037,0.0018300758,0.002376235,0.0014884952,0.0059790094,0.0043821787,0.0021647855,0.009013816],"category_scores_gemma":[0.041640665,0.0015757948,0.0028401646,0.0018609123,0.0032131744,0.011227926,0.006992569,0.0057136007,0.0025799775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033555506,0.00021447992,0.0028728135,0.0010441734,0.00017939518,0.0003775572,0.0008385482,0.13839217,0.012262123,0.5447332,0.018085456,0.28066453],"study_design_scores_gemma":[0.000045169676,0.000041181076,0.0001569809,0.000096365846,0.00003984234,0.00015116658,0.00011737708,0.55662555,0.012491273,0.41705647,0.013143034,0.000035532077],"about_ca_topic_score_codex":0.0036408491,"about_ca_topic_score_gemma":0.005999494,"teacher_disagreement_score":0.009013816,"about_ca_system_score_codex":0.002987917,"about_ca_system_score_gemma":0.005320493,"threshold_uncertainty_score":0.03311932},"labels":[],"label_agreement":null},{"id":"W6891654700","doi":"10.4230/artifacts.22479","title":"torus packing for multisets","year":2024,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multiset; Dimension (graph theory); Torus; Integer (computer science); Conjecture; Grid; Property (philosophy)","score_opus":0.024284106277250184,"score_gpt":0.31355492803457713,"score_spread":0.28927082175732693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891654700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038186565,0.0005118491,0.9049788,0.00032353683,0.0002427708,0.00018340163,0.0021079718,0.031881772,0.021583281],"genre_scores_gemma":[0.2562357,0.00038410327,0.72131795,0.0002457876,0.000068073736,0.00033749148,0.0062436378,0.00526773,0.009899495],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931955,0.00007456941,0.00005890044,0.00018474842,0.0002376331,0.00012466738],"domain_scores_gemma":[0.9991478,0.00032346335,0.00008372236,0.00026145144,0.00011294229,0.00007064223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003962806,0.00096150505,0.0008500524,0.0010453241,0.0009783165,0.0019392191,0.0012687371,0.00090573303,0.019110803],"category_scores_gemma":[0.0023369163,0.00062984927,0.0018337911,0.0014211371,0.0007398038,0.0029384438,0.0029421917,0.0010301754,0.006013874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006186737,0.00018882028,0.0046160403,0.0011405606,0.00011988322,0.0007402292,0.0010199995,0.15765095,0.021095896,0.197897,0.069896996,0.54501504],"study_design_scores_gemma":[0.000062365645,0.00015740507,0.00090111827,0.0001510874,0.000032609507,0.0005823272,0.0002761859,0.62762797,0.023305062,0.28626564,0.060569953,0.000068275476],"about_ca_topic_score_codex":0.0019148308,"about_ca_topic_score_gemma":0.0025191514,"teacher_disagreement_score":0.019110803,"about_ca_system_score_codex":0.0012047826,"about_ca_system_score_gemma":0.00080938486,"threshold_uncertainty_score":0.063932},"labels":[],"label_agreement":null},{"id":"W6891662472","doi":"10.4230/lipics.icalp.2019","title":"LIPIcs, Volume 132, ICALP'19, Complete Volume","year":2019,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"","field":"","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"","score_opus":0.020988369666042388,"score_gpt":0.2584578098891542,"score_spread":0.23746944022311178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891662472","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015769977,0.014988931,0.058538366,0.0067873127,0.025749257,0.00026894643,0.01944606,0.012791986,0.8598522],"genre_scores_gemma":[0.006378046,0.009566754,0.01450777,0.0010001753,0.009329023,0.00024639603,0.020989396,0.009592188,0.9283902],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833894,0.00017076965,0.000099912926,0.00033942237,0.000934828,0.000116103474],"domain_scores_gemma":[0.998899,0.00024667731,0.00006000361,0.00022253899,0.00031240826,0.0002592602],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011135107,0.0030071365,0.0024130347,0.003761638,0.0012187974,0.010599098,0.0019730867,0.0017567163,0.4660139],"category_scores_gemma":[0.004064123,0.00083391427,0.0010003591,0.0047515836,0.0009823574,0.005754512,0.0027103042,0.0036204983,0.41715673],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006658569,0.000040073235,0.00006832366,0.00031596396,0.000017485274,0.000021933769,0.000013350072,0.0005098524,0.000842765,0.008711523,0.8948301,0.09456198],"study_design_scores_gemma":[0.000031033178,0.000027514148,0.0005953185,0.00016536664,0.000019558647,0.00010573194,0.000036035937,0.0027698958,0.0011587718,0.02443467,0.9706296,0.000026537655],"about_ca_topic_score_codex":0.0037832644,"about_ca_topic_score_gemma":0.0058627757,"teacher_disagreement_score":0.4660139,"about_ca_system_score_codex":0.002996834,"about_ca_system_score_gemma":0.0024336223,"threshold_uncertainty_score":0.76166636},"labels":[],"label_agreement":null},{"id":"W6891668491","doi":"10.4230/lipics.itp.2024.10","title":"Duper: A Proof-Producing Superposition Theorem Prover for Dependent Type Theory","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Automated theorem proving; Gas meter prover; Superposition principle; Proof assistant; Type (biology); Calculus (dental); Generalization","score_opus":0.016810478464906204,"score_gpt":0.25659395859387646,"score_spread":0.23978348012897024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891668491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028867573,0.0002049028,0.9731154,0.00022114324,0.00008512264,0.0001114593,0.00042028914,0.018117383,0.0048375377],"genre_scores_gemma":[0.097517624,0.0005124577,0.88936293,0.0004637959,0.000101914025,0.0001658523,0.0013525283,0.004118253,0.0064046425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958716,0.0010733063,0.0003078754,0.0005157317,0.0019389193,0.00029264594],"domain_scores_gemma":[0.99060845,0.005955505,0.0004437689,0.0019698276,0.0008118236,0.00021059962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045389016,0.00097444345,0.0008548944,0.0022266197,0.0011138995,0.0027938266,0.0030107326,0.0012623937,0.020516803],"category_scores_gemma":[0.017271018,0.0011024462,0.0015879574,0.0017863094,0.0023153543,0.0048142993,0.0049914,0.0033482187,0.005512606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043822214,0.00025212375,0.0017426262,0.0012730504,0.00019124616,0.00064874266,0.0009845791,0.01651438,0.036990922,0.4070369,0.04536894,0.48855832],"study_design_scores_gemma":[0.00032523615,0.00036770737,0.0009661799,0.00035632082,0.00021164166,0.0020479695,0.00032503306,0.26224613,0.16459085,0.34756303,0.22080623,0.00019368541],"about_ca_topic_score_codex":0.0014134861,"about_ca_topic_score_gemma":0.002051369,"teacher_disagreement_score":0.020516803,"about_ca_system_score_codex":0.001189914,"about_ca_system_score_gemma":0.0032519116,"threshold_uncertainty_score":0.06863558},"labels":[],"label_agreement":null},{"id":"W6891668506","doi":"10.4230/lipics.ccc.2025.34","title":"Witness Encryption and NP-Hardness of Learning","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Encryption; Witness; Reduction (mathematics); Complement (music); Probabilistic encryption; 40-bit encryption","score_opus":0.006939146569976057,"score_gpt":0.24628382860903614,"score_spread":0.2393446820390601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891668506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27182963,0.0011292977,0.66903293,0.020080926,0.00020338711,0.00029820198,0.0015648825,0.0011170957,0.034743708],"genre_scores_gemma":[0.9120369,0.0007225753,0.073173985,0.0017134652,0.0003659297,0.0002753225,0.0012112261,0.00021952087,0.010281135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967811,0.0009533886,0.00014475979,0.0008385676,0.0007408884,0.00054132805],"domain_scores_gemma":[0.9742406,0.02127632,0.0009816507,0.0024892958,0.00052024616,0.0004919092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023674604,0.00090046163,0.0011312977,0.000660001,0.0012265181,0.0034746744,0.0027062343,0.0022017048,0.008146503],"category_scores_gemma":[0.016549645,0.0006362874,0.0023499103,0.0010061982,0.0037396941,0.013077794,0.0050534466,0.009091835,0.0007226181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037404153,0.0004644003,0.0026881108,0.00048203446,0.00012252232,0.00039113458,0.0009724256,0.074528605,0.0032261715,0.8791152,0.006618039,0.03101738],"study_design_scores_gemma":[0.0000668708,0.00006427199,0.00047095472,0.000034390636,0.00003294943,0.00018221923,0.0001602783,0.13447852,0.0025858246,0.8590756,0.0028243598,0.00002374286],"about_ca_topic_score_codex":0.0009667391,"about_ca_topic_score_gemma":0.00095463893,"teacher_disagreement_score":0.008146503,"about_ca_system_score_codex":0.0029857943,"about_ca_system_score_gemma":0.0014215958,"threshold_uncertainty_score":0.027252734},"labels":[],"label_agreement":null},{"id":"W6891677303","doi":"10.4230/lipics.cp.2024.7","title":"Cumulative Scheduling with Calendars and Overtime","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Overtime; Constraint (computer-aided design); Scheduling (production processes); Task (project management); Duration (music); Resource constraints; Constraint programming; Time constraint; Decomposition","score_opus":0.06126456549689985,"score_gpt":0.367827641617658,"score_spread":0.30656307612075817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891677303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12783487,0.0013957125,0.8422693,0.00077501324,0.00050167553,0.00037674443,0.0018162337,0.0017521539,0.023278264],"genre_scores_gemma":[0.76891017,0.00066645583,0.21912175,0.00020122313,0.00020525554,0.0002717973,0.0013819654,0.0003773706,0.008863987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985455,0.00033587485,0.00012840591,0.0003215073,0.00036534952,0.00030335056],"domain_scores_gemma":[0.99611086,0.0014814099,0.00066096743,0.00072917267,0.00045291445,0.0005647206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016000461,0.0010568917,0.0007945804,0.0008865606,0.00077760045,0.0018689388,0.0018275452,0.0005709888,0.0072076074],"category_scores_gemma":[0.0055906144,0.00047399843,0.00086933136,0.0022240016,0.00073890015,0.0022830854,0.0015197037,0.0014943925,0.0006282862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005755228,0.00021371878,0.0036537673,0.0006255737,0.000099804485,0.00039941294,0.0002775008,0.7044702,0.0080699865,0.11295775,0.009292649,0.15936406],"study_design_scores_gemma":[0.00012210966,0.00045348366,0.0023419901,0.00011632998,0.000096256255,0.0002966519,0.00019847024,0.8734995,0.008001403,0.06893618,0.04584733,0.00009028514],"about_ca_topic_score_codex":0.008328726,"about_ca_topic_score_gemma":0.011203205,"teacher_disagreement_score":0.008328726,"about_ca_system_score_codex":0.0011406791,"about_ca_system_score_gemma":0.003661309,"threshold_uncertainty_score":0.024111807},"labels":[],"label_agreement":null},{"id":"W6891678007","doi":"10.4230/lipics.cpm.2023.2","title":"Approximation Algorithms for the Longest Run Subsequence Problem","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Subsequence; Longest increasing subsequence; Longest common subsequence problem; String (physics); Symbol (formal); Sequence (biology); Bounded function","score_opus":0.036994911951309994,"score_gpt":0.2847968448206783,"score_spread":0.2478019328693683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891678007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03891581,0.0027421745,0.9479781,0.0010936761,0.00021739675,0.00016204795,0.00064997113,0.0029183768,0.0053224005],"genre_scores_gemma":[0.33562753,0.002181089,0.6511598,0.00056070957,0.0005103766,0.00055181736,0.0036196506,0.00085570355,0.004933334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964455,0.0008280355,0.0002989685,0.0009567731,0.0008987036,0.0005719777],"domain_scores_gemma":[0.991823,0.0055776206,0.0006247544,0.0012063291,0.000536359,0.00023192438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025610232,0.0022382725,0.002495346,0.0019495265,0.0010393759,0.002491438,0.0035742603,0.002019578,0.004417579],"category_scores_gemma":[0.016167574,0.00077960675,0.0018213106,0.0038974688,0.00128828,0.005577809,0.002234324,0.003631724,0.0015602197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010906335,0.0005875996,0.0028473337,0.0009999857,0.0003169741,0.00033287893,0.0005100078,0.6388187,0.005301556,0.072157115,0.017834162,0.25920302],"study_design_scores_gemma":[0.00011079678,0.00011184236,0.00023882513,0.000044607536,0.000042986783,0.0001694957,0.00006872059,0.9041402,0.0015434703,0.09103243,0.0024777853,0.000018835171],"about_ca_topic_score_codex":0.0030405717,"about_ca_topic_score_gemma":0.0028934486,"teacher_disagreement_score":0.004417579,"about_ca_system_score_codex":0.002106957,"about_ca_system_score_gemma":0.0026412045,"threshold_uncertainty_score":0.015287042},"labels":[],"label_agreement":null},{"id":"W6891680282","doi":"10.4230/lipics.giscience.2023.16","title":"When Everything Is \"Nearby\": How Airbnb Listings in New York City Exaggerate Proximity (Short Paper)","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Sharing Economy and Platforms","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Renting; Real estate; Warrant; Order (exchange); Geocoding; Destinations","score_opus":0.05327610536547876,"score_gpt":0.23723216618399465,"score_spread":0.1839560608185159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891680282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9835735,0.001038852,0.00025867578,0.0027879062,0.00008016499,0.000012984821,0.0004442414,0.000016499951,0.011787116],"genre_scores_gemma":[0.99449843,0.0006851007,0.00035943947,0.0002909607,0.000055843513,0.000020742813,0.00035393654,0.000023049977,0.003712598],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999032,0.00041056666,0.00006896742,0.00012941755,0.00027389024,0.00008513733],"domain_scores_gemma":[0.98794353,0.0048918244,0.0048193214,0.00023426101,0.0015041146,0.0006069041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012424546,0.000116573785,0.00013917706,0.0016650645,0.0015757467,0.0035085562,0.00031619685,0.00040671031,0.0037324862],"category_scores_gemma":[0.012080566,0.00012416721,0.00009000584,0.003103663,0.0013478884,0.0024574238,0.0015573262,0.0004620236,0.00041038252],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002634556,0.0000658872,0.5067875,0.00058786426,0.000077863064,0.0023880478,0.36984158,0.00033853672,0.0033009914,0.00617233,0.037358798,0.07281723],"study_design_scores_gemma":[0.000005122279,0.000048413604,0.6845859,0.00023781588,0.000036859205,0.0004072748,0.26975852,0.0008333586,0.0005131706,0.0006397252,0.042889565,0.000044232987],"about_ca_topic_score_codex":0.10396325,"about_ca_topic_score_gemma":0.22459976,"teacher_disagreement_score":0.10396325,"about_ca_system_score_codex":0.002686489,"about_ca_system_score_gemma":0.0010808768,"threshold_uncertainty_score":0.20671624},"labels":[],"label_agreement":null},{"id":"W6891699754","doi":"10.4230/lipics.sat.2024.27","title":"Revisiting SATZilla Features in 2024","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Preprocessor; Feature selection; Benchmark (surveying); Feature (linguistics); Boolean satisfiability problem; Ranging; Software","score_opus":0.01815246545251966,"score_gpt":0.3067046303418024,"score_spread":0.28855216488928276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891699754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12597843,0.0015082071,0.6632838,0.0022283043,0.0006304937,0.00042198025,0.01944365,0.17784902,0.008656054],"genre_scores_gemma":[0.45278993,0.00036820685,0.49309957,0.00066929683,0.00020051473,0.0006496225,0.0337433,0.012823193,0.005656312],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99647576,0.0005314364,0.0003620114,0.00074861717,0.0015924704,0.0002896826],"domain_scores_gemma":[0.9874622,0.0075112623,0.001130845,0.0021761926,0.001554208,0.00016520909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021125237,0.0019213723,0.0010255651,0.0032507742,0.0006550274,0.0026702948,0.002415265,0.0011926487,0.00923115],"category_scores_gemma":[0.024350822,0.0012286069,0.0021291452,0.0025753288,0.0007644544,0.003625356,0.0018565862,0.0025691912,0.0037901592],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018141292,0.0006061014,0.036997452,0.0016895083,0.00037326015,0.00075099646,0.00045218223,0.15937021,0.03753245,0.02366691,0.09903133,0.63771546],"study_design_scores_gemma":[0.0002299995,0.00037362985,0.008921187,0.00023122868,0.00013107476,0.00048923015,0.000082072846,0.8578078,0.05742762,0.025223644,0.048962813,0.00011975926],"about_ca_topic_score_codex":0.004591553,"about_ca_topic_score_gemma":0.009366498,"teacher_disagreement_score":0.00923115,"about_ca_system_score_codex":0.0015852615,"about_ca_system_score_gemma":0.0023619372,"threshold_uncertainty_score":0.030881286},"labels":[],"label_agreement":null},{"id":"W6891717383","doi":"10.4230/lipics.giscience.2023.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.040097298932838636,"score_gpt":0.2131662341686234,"score_spread":0.17306893523578476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891717383","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066414714,0.004770729,0.0016237348,0.01684758,0.27530125,0.0008116572,0.007898907,0.002145592,0.6899364],"genre_scores_gemma":[0.0017464202,0.0023279586,0.00052048085,0.0021608209,0.04666838,0.0002678794,0.0028433201,0.0009178135,0.9425469],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918216,0.000052601994,0.000077573255,0.0001580888,0.0003945861,0.00013499825],"domain_scores_gemma":[0.99458355,0.0004521657,0.00025648723,0.00025948955,0.0022079828,0.002240329],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001285723,0.00156338,0.0015267071,0.0022804216,0.0017994797,0.009987063,0.0015453473,0.0031019256,0.8455269],"category_scores_gemma":[0.0060432125,0.00057544943,0.00083320966,0.0017648495,0.00048138053,0.0038972616,0.0018162135,0.0027750058,0.84303737],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037141595,0.00003371981,0.000048639715,0.0001497446,0.0000020604477,0.000020343881,0.0000040606205,0.00003723405,0.00021987554,0.00035110718,0.9662258,0.03287043],"study_design_scores_gemma":[0.0000327967,0.000034530716,0.0005761844,0.0001634444,0.0000034895147,0.000052055562,0.00003828685,0.00013133777,0.00017738016,0.00079911447,0.99797875,0.000012607783],"about_ca_topic_score_codex":0.0012812122,"about_ca_topic_score_gemma":0.0024425802,"teacher_disagreement_score":0.15447313,"about_ca_system_score_codex":0.0014444998,"about_ca_system_score_gemma":0.0020027203,"threshold_uncertainty_score":0.22033715},"labels":[],"label_agreement":null},{"id":"W6891721153","doi":"10.4230/lipics.giscience.2023.49","title":"How Does Travel Environment Affect Mood? A Study Using Geographic Ecological Momentary Assessment in the UK (Short Paper)","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Urban Green Space and Health","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Affect (linguistics); Happiness; Global Positioning System; Mood; Likert scale; TRIPS architecture; Travel behavior; Phone","score_opus":0.026426920840809366,"score_gpt":0.2837767040864371,"score_spread":0.25734978324562774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891721153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9977545,0.00051383337,0.00018388912,0.00019189768,0.000019639509,0.000016878324,0.00027784417,0.000002123439,0.0010394643],"genre_scores_gemma":[0.998382,0.00048565565,0.00017323987,0.00019354523,0.000012363001,0.000036035683,0.00012601772,0.0000031845852,0.0005880986],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99946195,0.00027595102,0.000038023012,0.00008646322,0.00008158675,0.000056003908],"domain_scores_gemma":[0.9983242,0.000589682,0.0004634598,0.00012769114,0.00027489528,0.00022001336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007837083,0.00017889077,0.00025649165,0.00040790215,0.0005347805,0.001127531,0.00015960756,0.00036243023,0.0015132683],"category_scores_gemma":[0.0034743492,0.00024674236,0.00027307472,0.0006737014,0.0004233846,0.00051422237,0.00071082375,0.00046695667,0.00033520214],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000689834,0.00028119882,0.9095405,0.0003846822,0.00028533468,0.00062082044,0.03513642,0.00010367523,0.002855115,0.00023750741,0.0032967485,0.046568174],"study_design_scores_gemma":[0.000011085361,0.00024632382,0.9934103,0.000029476114,0.00002814855,0.00015586143,0.0045636874,0.000040072566,0.000078321544,0.000023571267,0.0014005774,0.000012457676],"about_ca_topic_score_codex":0.031871468,"about_ca_topic_score_gemma":0.04630694,"teacher_disagreement_score":0.031871468,"about_ca_system_score_codex":0.00068411394,"about_ca_system_score_gemma":0.000274011,"threshold_uncertainty_score":0.0633719},"labels":[],"label_agreement":null},{"id":"W6891741691","doi":"10.4230/lipics.itcs.2024.84","title":"Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subadditivity; Oracle; Payment; Valuation (finance); Submodular set function; Set (abstract data type); Mechanism design; Value (mathematics)","score_opus":0.06626143121203233,"score_gpt":0.3509448257184785,"score_spread":0.2846833945064462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891741691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016120927,0.0034711903,0.9714722,0.0017501886,0.00022478559,0.00039443083,0.00038718776,0.00076570414,0.0054134773],"genre_scores_gemma":[0.19409113,0.0031619268,0.78978103,0.0013988884,0.0005284304,0.0013053289,0.00076916453,0.00042011522,0.008543999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9896652,0.0046999427,0.00070064043,0.0020360914,0.0019997694,0.0008984398],"domain_scores_gemma":[0.9834779,0.008501998,0.00208657,0.0045343945,0.00081357197,0.0005857054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015786946,0.0028988735,0.0037652298,0.0019422034,0.0009377764,0.004916164,0.0061633145,0.005110642,0.012253815],"category_scores_gemma":[0.037263967,0.0019718402,0.0036489572,0.003819794,0.0023891055,0.022832917,0.003494833,0.00837353,0.0023024082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016790794,0.0011294312,0.0012376194,0.0019857506,0.00041387387,0.0003245791,0.0004994,0.20733,0.0082175005,0.5836452,0.013177191,0.18036035],"study_design_scores_gemma":[0.00096512015,0.00078798685,0.0005052358,0.00047627016,0.00019507429,0.00074403593,0.00010062587,0.34621087,0.0037877208,0.62647873,0.019621192,0.00012710685],"about_ca_topic_score_codex":0.0010589599,"about_ca_topic_score_gemma":0.0006362603,"teacher_disagreement_score":0.015786946,"about_ca_system_score_codex":0.0033556933,"about_ca_system_score_gemma":0.0034295307,"threshold_uncertainty_score":0.08349037},"labels":[],"label_agreement":null},{"id":"W6891765915","doi":"10.4230/lipics.opodis.2024.11","title":"Gathering Teams of Deterministic Finite Automata on a Line","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Task (project management); State (computer science); Set (abstract data type); Node (physics); Deterministic algorithm; Line (geometry); Integer (computer science); Time complexity","score_opus":0.01909302301479185,"score_gpt":0.29656767002335854,"score_spread":0.2774746470085667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891765915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18600242,0.00020638884,0.7975765,0.00046886536,0.000050754894,0.0003298836,0.0004717808,0.0022902957,0.012603183],"genre_scores_gemma":[0.7579544,0.00021722102,0.2284366,0.00019563964,0.000052983418,0.00071126455,0.0011713766,0.0002533695,0.011007271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969363,0.00086459663,0.00034570278,0.0008200358,0.00046535747,0.0005679786],"domain_scores_gemma":[0.992218,0.004798498,0.0009779697,0.0008478965,0.00060583715,0.0005517644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014732477,0.0011869367,0.0011826729,0.0007766633,0.0012467501,0.0030970722,0.002162073,0.0015313354,0.007859949],"category_scores_gemma":[0.008050103,0.0008962794,0.0023359791,0.0010554136,0.0021141788,0.003348669,0.0031446007,0.0014329487,0.0011817906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066976564,0.00015919346,0.0029730792,0.00028525884,0.00012895298,0.000998173,0.0011492167,0.86169034,0.0055257617,0.10439437,0.0014861095,0.020539783],"study_design_scores_gemma":[0.0000984619,0.00009470198,0.00023359188,0.000029276182,0.000038272512,0.000096874115,0.00018050238,0.9320978,0.0018559281,0.06265936,0.0025856092,0.000029621247],"about_ca_topic_score_codex":0.0054517435,"about_ca_topic_score_gemma":0.0037500511,"teacher_disagreement_score":0.007859949,"about_ca_system_score_codex":0.0020024201,"about_ca_system_score_gemma":0.0010698325,"threshold_uncertainty_score":0.026294112},"labels":[],"label_agreement":null},{"id":"W6910172465","doi":"10.4230/lipics.giscience.2023.61","title":"Mobility Vitality: Assessing Neighborhood Similarity Through Transportation Patterns In New York City (Short Paper)","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Vitality; Mobility model; Measure (data warehouse); Individual mobility; Similarity (geometry); Transportation planning","score_opus":0.06652143040895257,"score_gpt":0.3473298216363563,"score_spread":0.2808083912274037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910172465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99429214,0.00014399196,0.000462844,0.00008918447,0.000019729525,0.000014110089,0.0036391546,0.000013360872,0.0013254925],"genre_scores_gemma":[0.9943658,0.00016281604,0.0006250822,0.0000049128403,0.000013340102,0.00003733732,0.004038163,0.0000044196067,0.00074805616],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9999099,0.00001803952,0.000012279684,0.000025024696,0.000023435887,0.00001133454],"domain_scores_gemma":[0.9993192,0.00017884852,0.00017123591,0.0000434505,0.0001623683,0.00012492786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022028605,0.00010792414,0.00016827126,0.0015137872,0.0003708452,0.00056424405,0.00024263063,0.0001707796,0.0028430815],"category_scores_gemma":[0.0019165521,0.00007890926,0.00017937193,0.0018289952,0.0001516492,0.0006164693,0.00054959,0.00021177629,0.00020367016],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007516425,0.00003215773,0.98311967,0.000033472184,0.00007347127,0.0000700191,0.00051847554,0.0015748576,0.00025810438,0.0006458255,0.0030729694,0.0105257835],"study_design_scores_gemma":[0.0000025069724,0.000022438446,0.9931496,0.000010522525,0.000014817759,0.000036085927,0.0010001325,0.0042801863,0.00008129864,0.00015475381,0.0012413918,0.0000063002685],"about_ca_topic_score_codex":0.2045114,"about_ca_topic_score_gemma":0.26018244,"teacher_disagreement_score":0.2045114,"about_ca_system_score_codex":0.00087032636,"about_ca_system_score_gemma":0.0005325289,"threshold_uncertainty_score":0.40664202},"labels":[],"label_agreement":null},{"id":"W6910201977","doi":"10.4230/lipics.ccc.2024.29","title":"Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov Complexity","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"University of Warwick; UK Research and Innovation","keywords":"Reduction (mathematics); Bounded function; String (physics); Measure (data warehouse); Kolmogorov complexity; Upper and lower bounds","score_opus":0.0385608933092483,"score_gpt":0.31197945965250806,"score_spread":0.2734185663432598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910201977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033660863,0.0005848559,0.94572943,0.0019890734,0.00016479047,0.00024928793,0.0004947327,0.0022871091,0.014839866],"genre_scores_gemma":[0.5821951,0.0007664484,0.39904672,0.001580999,0.0006207717,0.0010518288,0.0013721463,0.0014186628,0.011947321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9862694,0.0022251976,0.0006636133,0.0030019763,0.006265182,0.0015746212],"domain_scores_gemma":[0.958966,0.031010669,0.0013102666,0.006095325,0.0019545604,0.00066301704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004618606,0.0015146869,0.0015720032,0.0016551213,0.0014568979,0.0038574645,0.0036627846,0.0014211384,0.0069557442],"category_scores_gemma":[0.033143125,0.00077931816,0.004196796,0.0015568525,0.0044340244,0.009406886,0.0054388857,0.01014346,0.0014467459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046815164,0.00037672324,0.0009258122,0.00043828005,0.00011032864,0.00016337472,0.00039015114,0.16726357,0.009659432,0.7430705,0.00794553,0.069188185],"study_design_scores_gemma":[0.0000788048,0.0000892474,0.00030797446,0.000039098024,0.00007043177,0.00007659987,0.000043048374,0.36705616,0.0076180333,0.6209617,0.0036163747,0.000042442854],"about_ca_topic_score_codex":0.0022969565,"about_ca_topic_score_gemma":0.0037086357,"teacher_disagreement_score":0.0069557442,"about_ca_system_score_codex":0.005568657,"about_ca_system_score_gemma":0.0052000773,"threshold_uncertainty_score":0.040403605},"labels":[],"label_agreement":null},{"id":"W6910264862","doi":"10.4230/lipics.ccc.2023.36","title":"Colourful TFNP and Propositional Proofs","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Unary operation; Class (philosophy); Proof complexity; Intersection (aeronautics); Resolution (logic); Propositional calculus; Analytic proof","score_opus":0.017782138798735237,"score_gpt":0.2582630661033912,"score_spread":0.24048092730465598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910264862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078818455,0.002498325,0.871352,0.0027777904,0.00028357952,0.00014994339,0.0007640016,0.001892876,0.041463062],"genre_scores_gemma":[0.81753457,0.0013479346,0.16466565,0.001051339,0.00042073615,0.00020386724,0.0008732676,0.00035126475,0.013551274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664235,0.00073390396,0.00025112374,0.0007949858,0.0011203343,0.00045725895],"domain_scores_gemma":[0.9874374,0.007754306,0.0008201431,0.0021825705,0.0013317645,0.00047376854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002387986,0.00046848276,0.00042313608,0.0015464047,0.0010866221,0.0035586925,0.0015812132,0.00091186276,0.0071094604],"category_scores_gemma":[0.014021428,0.0005833463,0.0013219934,0.0013048335,0.00422935,0.007982918,0.0025938067,0.0031315533,0.0005758837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043782264,0.000017778966,0.00039727066,0.00014243934,0.000015866248,0.00008863411,0.00023811689,0.0042092307,0.0011077494,0.97175986,0.0014193093,0.020560052],"study_design_scores_gemma":[0.000018011138,0.000017345572,0.00032367915,0.000031316293,0.000017451031,0.00015025356,0.00004533236,0.017989077,0.0012404104,0.96865875,0.011492896,0.000015638589],"about_ca_topic_score_codex":0.004809837,"about_ca_topic_score_gemma":0.0026139738,"teacher_disagreement_score":0.0071094604,"about_ca_system_score_codex":0.0038466929,"about_ca_system_score_gemma":0.0016057235,"threshold_uncertainty_score":0.027909815},"labels":[],"label_agreement":null},{"id":"W6910319334","doi":"10.4230/lipics.opodis.2021.28","title":"Strongly Linearizable Linked List and Queue","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linearizability; Correctness; Implementation; Data structure; Queue; Scheme (mathematics)","score_opus":0.010836333627335612,"score_gpt":0.23072336248391856,"score_spread":0.21988702885658296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910319334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046843037,0.00018804082,0.9344829,0.0012368603,0.00013297696,0.0001798197,0.0003983722,0.005737042,0.010800961],"genre_scores_gemma":[0.54802257,0.00030770444,0.4217951,0.00080027926,0.00018598889,0.0005136768,0.0011793195,0.00094798085,0.026247382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683374,0.0006259882,0.00029961774,0.0007052381,0.0011111986,0.0004242486],"domain_scores_gemma":[0.9921657,0.002846496,0.0007162071,0.0025335555,0.0013833628,0.00035482136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001911018,0.00045459231,0.00040858088,0.0007455308,0.0010666893,0.002855684,0.0022887036,0.0010083489,0.0076299068],"category_scores_gemma":[0.01094467,0.00051301357,0.0007878547,0.0015237463,0.0030133042,0.006349346,0.0037616573,0.0026925015,0.0017569019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031154614,0.00014957887,0.001623644,0.00021275629,0.000026732523,0.000176362,0.0007042699,0.01300962,0.0109465355,0.9070239,0.0064647784,0.05935031],"study_design_scores_gemma":[0.00015521262,0.0002526351,0.0004843768,0.000055187124,0.00006959621,0.00026077294,0.00023448544,0.11051316,0.03795183,0.811802,0.038136303,0.00008435803],"about_ca_topic_score_codex":0.0030668818,"about_ca_topic_score_gemma":0.0024373054,"teacher_disagreement_score":0.0076299068,"about_ca_system_score_codex":0.001949662,"about_ca_system_score_gemma":0.0031269658,"threshold_uncertainty_score":0.025524557},"labels":[],"label_agreement":null},{"id":"W6910320367","doi":"10.4230/lipics.icalp.2023.28","title":"Nondeterministic Interactive Refutations for Nearest Boolean Vector","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Chinese University of Hong Kong; European Commission","keywords":"Nondeterministic algorithm; Boolean function; Cube (algebra); Randomness; Maximum satisfiability problem; Linear subspace; Matrix (chemical analysis); Two-element Boolean algebra","score_opus":0.0219407974307442,"score_gpt":0.29767691246184613,"score_spread":0.27573611503110196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910320367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30683056,0.00046961248,0.669156,0.0031184445,0.00026126378,0.00032784732,0.0006745659,0.007676159,0.01148562],"genre_scores_gemma":[0.87360895,0.00010385843,0.12002844,0.00040368031,0.00006424152,0.00017217846,0.00068495603,0.00060609856,0.0043275133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947976,0.0014471001,0.00040923952,0.0012499398,0.0012039719,0.0008921802],"domain_scores_gemma":[0.95837224,0.028420104,0.0016677683,0.008747056,0.0019923053,0.0008004998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037144523,0.00076509686,0.0014287471,0.0007858602,0.0021567713,0.0023819606,0.004115241,0.00205334,0.0077711698],"category_scores_gemma":[0.032547858,0.0006418628,0.0017528322,0.0010602818,0.003371084,0.0055210353,0.007284672,0.0037865543,0.0014888162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026394625,0.0006777181,0.013693423,0.0009060498,0.00022788311,0.00091103057,0.0026858428,0.17009531,0.0207077,0.38895357,0.017516602,0.38098544],"study_design_scores_gemma":[0.00020349686,0.00017605242,0.00076412957,0.000068245194,0.00007880064,0.00034403446,0.0003264972,0.5719965,0.02460945,0.39699653,0.00434348,0.00009276806],"about_ca_topic_score_codex":0.002555724,"about_ca_topic_score_gemma":0.005213931,"teacher_disagreement_score":0.0077711698,"about_ca_system_score_codex":0.002190487,"about_ca_system_score_gemma":0.0031783534,"threshold_uncertainty_score":0.025997162},"labels":[],"label_agreement":null},{"id":"W6910341342","doi":"10.4230/lipics.opodis.2023.17","title":"A Wait-Free Deque With Polylogarithmic Step Complexity","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amortized analysis; Stack (abstract data type); Queue; Computational complexity theory; Data structure; Time complexity","score_opus":0.01784283380366237,"score_gpt":0.24830342300751643,"score_spread":0.23046058920385407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910341342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06550699,0.0005049565,0.91843826,0.00060173817,0.00024631474,0.00017865635,0.00027125078,0.004021818,0.010230169],"genre_scores_gemma":[0.4488452,0.00041441977,0.53064966,0.00037706338,0.00015463216,0.00042540376,0.0005330266,0.0008002615,0.017800316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963081,0.0003896175,0.0003581279,0.00063504995,0.0016580382,0.00065118686],"domain_scores_gemma":[0.9930582,0.0020368465,0.0004119186,0.0025390894,0.0015648323,0.0003890249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014438,0.001001385,0.00093824253,0.00094362465,0.0017781826,0.0056114756,0.0037661009,0.0014728479,0.0080933245],"category_scores_gemma":[0.0073021175,0.00078315363,0.0012143048,0.0013054729,0.0020484584,0.008459822,0.0035561891,0.003107172,0.0021352516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018874469,0.00063246215,0.0027217623,0.0006278321,0.00020214512,0.0003814584,0.00046817513,0.048553616,0.06985081,0.66566885,0.009712988,0.19929254],"study_design_scores_gemma":[0.00043208426,0.0008334168,0.0011665646,0.00011004045,0.00029327333,0.000672735,0.00021383981,0.38425976,0.10614843,0.46146896,0.044140905,0.0002599874],"about_ca_topic_score_codex":0.0023073656,"about_ca_topic_score_gemma":0.0025603909,"teacher_disagreement_score":0.0080933245,"about_ca_system_score_codex":0.0019135434,"about_ca_system_score_gemma":0.0043206923,"threshold_uncertainty_score":0.027074873},"labels":[],"label_agreement":null},{"id":"W6910364688","doi":"10.4230/lipics.socg.2025.18","title":"Finding a Shortest Curve That Separates Few Objects from Many","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Disjoint sets; Polygon (computer graphics); Graph; Line segment; Polygonal chain; Monotone polygon; Set (abstract data type); Shortest path problem","score_opus":0.021849879915498065,"score_gpt":0.2837568478144151,"score_spread":0.26190696789891704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910364688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092210494,0.0004805088,0.8904344,0.0007835003,0.00007103277,0.00024425823,0.0013091912,0.0039938493,0.010472716],"genre_scores_gemma":[0.24609861,0.0003132,0.7402407,0.00017893307,0.00004968067,0.00018487906,0.0047171884,0.001035969,0.0071809036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992028,0.00006613717,0.000042586926,0.0003500001,0.00020867615,0.000129775],"domain_scores_gemma":[0.99891686,0.00048753954,0.00014503607,0.000248829,0.000111371126,0.00009035431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003750896,0.0016955078,0.0018408587,0.0007189959,0.0009778179,0.0018477355,0.0018131515,0.0020675852,0.011285074],"category_scores_gemma":[0.0025636312,0.000887426,0.001609259,0.0015771887,0.0010469526,0.0031818922,0.0019016828,0.0017664117,0.0036258742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060152175,0.0004197985,0.0020947412,0.0010604061,0.00014577304,0.0006477983,0.00035333793,0.49901333,0.031580564,0.032505233,0.024904326,0.40667322],"study_design_scores_gemma":[0.00014217195,0.0002619485,0.0005857858,0.00006107012,0.000046892324,0.00049341115,0.00019606973,0.90947294,0.0121928835,0.06360878,0.012885611,0.000052394746],"about_ca_topic_score_codex":0.0047111465,"about_ca_topic_score_gemma":0.0046349177,"teacher_disagreement_score":0.011285074,"about_ca_system_score_codex":0.0011646387,"about_ca_system_score_gemma":0.0014734146,"threshold_uncertainty_score":0.03775233},"labels":[],"label_agreement":null},{"id":"W6910399977","doi":"10.4230/lipics.cp.2022.10","title":"A Constraint Programming Approach to Ship Refit Project Scheduling","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Thales (Canada)","funders":"","keywords":"Constraint programming; Scheduling (production processes); Project management; Baseline (sea); Speedup; Heuristic; Plan (archaeology); Work order; Constraint (computer-aided design)","score_opus":0.12577343677338768,"score_gpt":0.37385547381011147,"score_spread":0.2480820370367238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910399977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028592667,0.0006508089,0.9867732,0.00056979933,0.00008269034,0.00019964714,0.00042188083,0.00017235233,0.008270466],"genre_scores_gemma":[0.06598839,0.0017322925,0.92721844,0.00021781372,0.00012520615,0.0005959417,0.00047054584,0.0001142172,0.003537194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808323,0.0008304317,0.00012501681,0.00030167188,0.0004944048,0.00016522218],"domain_scores_gemma":[0.9969863,0.0022888437,0.00016338404,0.00010032391,0.0003612496,0.000099731325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021365313,0.0016875805,0.001051929,0.0015477703,0.0010655898,0.0026175005,0.0023095445,0.0013436364,0.005246847],"category_scores_gemma":[0.004746916,0.0010547332,0.0018630107,0.0040293443,0.0011923596,0.0014939522,0.0011521989,0.0032227766,0.00059721747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023838964,0.000058917656,0.00017244251,0.00018319493,0.0000553581,0.00010876239,0.00007533664,0.91628283,0.00051157194,0.049800944,0.0025631366,0.030163635],"study_design_scores_gemma":[0.000026619091,0.00002990748,0.000094493735,0.000053128504,0.000021757696,0.00004720302,0.000045126228,0.96063405,0.00041516204,0.02956798,0.009045004,0.00001958048],"about_ca_topic_score_codex":0.031571884,"about_ca_topic_score_gemma":0.03026054,"teacher_disagreement_score":0.031571884,"about_ca_system_score_codex":0.0022264842,"about_ca_system_score_gemma":0.0039821756,"threshold_uncertainty_score":0.06277627},"labels":[],"label_agreement":null},{"id":"W6910408406","doi":"10.4230/lipics.esa.2022.59","title":"Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Path (computing); Matrix multiplication; Matrix (chemical analysis); Range query (database); Colored; Tree (set theory); Element (criminal law); Product (mathematics); Node (physics)","score_opus":0.01677952594851535,"score_gpt":0.28010107376614735,"score_spread":0.263321547817632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910408406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07263384,0.00035067834,0.91003877,0.00065379805,0.00012936538,0.0002821106,0.0009111306,0.010633247,0.0043671215],"genre_scores_gemma":[0.34187287,0.00012295213,0.6505983,0.0002932975,0.00010278502,0.0002807684,0.0018632769,0.00051141874,0.004354272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975369,0.0004141241,0.0001797785,0.000652126,0.00078419957,0.00043274937],"domain_scores_gemma":[0.9954619,0.0020777055,0.00035191153,0.0012045588,0.0006267575,0.00027712277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012694122,0.0012841485,0.0016684692,0.0009278012,0.0010137309,0.002105559,0.0027210473,0.001068973,0.007351705],"category_scores_gemma":[0.007747923,0.000667973,0.0010385589,0.0021544092,0.00083420984,0.005552039,0.0025525764,0.0014759712,0.0021433828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020246394,0.00074991654,0.00431023,0.00068206707,0.00014671279,0.00049036526,0.001162528,0.19007033,0.040316295,0.089905776,0.03993283,0.6302084],"study_design_scores_gemma":[0.00014728129,0.0001910001,0.00030636514,0.000015591879,0.000026073663,0.0001460471,0.00017283815,0.92582107,0.006658693,0.061664913,0.0048200646,0.000030081346],"about_ca_topic_score_codex":0.007851731,"about_ca_topic_score_gemma":0.014458652,"teacher_disagreement_score":0.007851731,"about_ca_system_score_codex":0.0013469927,"about_ca_system_score_gemma":0.0024295673,"threshold_uncertainty_score":0.02459389},"labels":[],"label_agreement":null},{"id":"W6910433705","doi":"10.4230/lipics.ecrts.2024.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.030268111021064095,"score_gpt":0.21037886311000928,"score_spread":0.18011075208894517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910433705","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006648174,0.004722323,0.0016252821,0.01686385,0.27421448,0.0008109235,0.008024545,0.0021766075,0.69089717],"genre_scores_gemma":[0.0017413737,0.0023072402,0.0005225454,0.0021644635,0.046650242,0.00026744016,0.0028806252,0.00093084696,0.94253534],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918014,0.000052660114,0.00007792078,0.00015878821,0.0003949373,0.00013557507],"domain_scores_gemma":[0.9945766,0.00045488257,0.00025807635,0.0002611623,0.0022064073,0.0022428657],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012873521,0.001565378,0.001529331,0.0022947437,0.0018023528,0.009996369,0.0015490782,0.0031068516,0.8480414],"category_scores_gemma":[0.0060885902,0.00058024295,0.00083321246,0.001767055,0.00048299495,0.0039231908,0.0018209065,0.0027737012,0.8449605],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037036323,0.000033649034,0.000048194866,0.00014890224,0.0000020478003,0.00002015584,0.000004037874,0.00003704342,0.00022074468,0.00035046952,0.96635735,0.032740466],"study_design_scores_gemma":[0.000032848104,0.000034439592,0.0005723533,0.00016150188,0.0000034762293,0.000051511754,0.000038056893,0.00013038522,0.0001778389,0.0007974557,0.9979875,0.000012626856],"about_ca_topic_score_codex":0.0012806783,"about_ca_topic_score_gemma":0.0024371708,"teacher_disagreement_score":0.8480414,"about_ca_system_score_codex":0.0014451288,"about_ca_system_score_gemma":0.0020038206,"threshold_uncertainty_score":0.21675038},"labels":[],"label_agreement":null},{"id":"W6910447097","doi":"10.4230/lipics.itcs.2025.93","title":"Polynomials, Divided Differences, and Codes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; Israel Science Foundation; European Commission","keywords":"Multiplicity (mathematics); Decodes; Finite field; List decoding; Reed–Muller code; Decoding methods; Degree (music); Finite set; Linear code","score_opus":0.009595065195354174,"score_gpt":0.23929865331196112,"score_spread":0.22970358811660696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910447097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08006197,0.0056832135,0.8803094,0.0022048424,0.00045504596,0.000073177216,0.0003562423,0.00064672105,0.030209387],"genre_scores_gemma":[0.7207125,0.0040657115,0.25135604,0.0007895148,0.0008538371,0.00012962385,0.0004493918,0.00023486871,0.021408523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987901,0.00027219145,0.000049286442,0.00030310062,0.00040456778,0.00018073161],"domain_scores_gemma":[0.9984364,0.0007025747,0.00021818669,0.0003514053,0.00020573256,0.00008567086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077546714,0.0005436404,0.00042004793,0.001134678,0.00083802856,0.0016007044,0.0007811312,0.0008149019,0.0032134815],"category_scores_gemma":[0.0048430883,0.00027465753,0.00041744686,0.0019638455,0.0033830595,0.0035936914,0.0017685369,0.0019633435,0.0011340092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082870945,0.000011754518,0.0002686576,0.00005887553,0.000004526924,0.000050078983,0.00014502669,0.007130272,0.0010231923,0.95708096,0.0017984406,0.032345347],"study_design_scores_gemma":[0.00001572167,0.000060924427,0.0001829436,0.000039985214,0.0000067973924,0.00018621446,0.00005070146,0.02631258,0.0021562253,0.95835996,0.012603981,0.000023931385],"about_ca_topic_score_codex":0.0013248533,"about_ca_topic_score_gemma":0.0008688809,"teacher_disagreement_score":0.0032134815,"about_ca_system_score_codex":0.0013865187,"about_ca_system_score_gemma":0.00087020366,"threshold_uncertainty_score":0.010750234},"labels":[],"label_agreement":null},{"id":"W6910453624","doi":"10.4230/lipics.cp.2025.7","title":"Optimizing 2D Cutting: A Bin Packing Approach to Minimize Scraps and Maximize Their Reusability","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Bin packing problem; Reusability; Scrap; Leverage (statistics); Process (computing); Benchmark (surveying); Linear programming; Bin","score_opus":0.014183435343222302,"score_gpt":0.23016746625178017,"score_spread":0.21598403090855786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910453624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015016454,0.0003821343,0.9799256,0.00010898411,0.00002886181,0.000057824585,0.00012431513,0.00018099272,0.0041747913],"genre_scores_gemma":[0.3941637,0.0010584982,0.5959345,0.00014031056,0.0000392503,0.00038814914,0.00042755264,0.00037621098,0.007471888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932694,0.00021123288,0.000025807138,0.000121674486,0.00022717072,0.00008718361],"domain_scores_gemma":[0.99940944,0.0003624287,0.00006359505,0.000050215414,0.000079859536,0.00003452759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009670311,0.0012423682,0.001434221,0.000954102,0.000442995,0.0016230359,0.0011691103,0.0015395662,0.0036533717],"category_scores_gemma":[0.0015160267,0.00085606374,0.0010779302,0.0018183577,0.0007227248,0.00121487,0.0012389437,0.0010372872,0.00044900115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034338256,0.000030180943,0.00014678112,0.000089693836,0.000017173132,0.000035616587,0.000024372048,0.9762322,0.001582687,0.007295891,0.00045040078,0.0140606435],"study_design_scores_gemma":[0.0000061035216,0.000028456718,0.000070525086,0.000008870228,0.0000054507877,0.000022376227,0.0000091579805,0.9945358,0.0008661615,0.0035894085,0.00085219956,0.0000055476507],"about_ca_topic_score_codex":0.004150014,"about_ca_topic_score_gemma":0.0038929381,"teacher_disagreement_score":0.004150014,"about_ca_system_score_codex":0.0011898063,"about_ca_system_score_gemma":0.0014889537,"threshold_uncertainty_score":0.012221754},"labels":[],"label_agreement":null},{"id":"W6910470447","doi":"10.4230/dagrep.12.10.106","title":"Intelligent Security: Is \"AI for Cybersecurity\" a Blessing or a Curse (Dagstuhl Seminar 22412)","year":2023,"lang":"en","type":"report","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Blessing; Curse; Czech; Work (physics); Focus group","score_opus":0.11970142247771987,"score_gpt":0.4044872200558894,"score_spread":0.2847857975781695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910470447","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012564129,0.0871893,0.018516647,0.37207302,0.1652674,0.0006324266,0.004418617,0.002507534,0.33683088],"genre_scores_gemma":[0.11411075,0.030934917,0.016365334,0.03710929,0.046382222,0.0009929385,0.0047993013,0.0042864545,0.7450188],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919636,0.0030755734,0.0003476765,0.0009960525,0.0018173956,0.0017996352],"domain_scores_gemma":[0.9948037,0.0011072722,0.00019612724,0.00034597274,0.0008756188,0.002671235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0086519485,0.0019281501,0.0013929291,0.001815796,0.0029542965,0.013039862,0.0019667982,0.006199335,0.107711956],"category_scores_gemma":[0.009858812,0.0008443149,0.0012986795,0.0015953562,0.0032388328,0.005000583,0.0070843603,0.007165034,0.07310541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020003015,0.00013433538,0.00014044381,0.00028163288,0.000019985822,0.00013621448,0.00065383204,0.00027466324,0.0008850482,0.016702231,0.92812306,0.05244859],"study_design_scores_gemma":[0.00004363814,0.00008048036,0.0006773155,0.00029827972,0.000011186166,0.00011925074,0.00033918445,0.0002678655,0.0005432057,0.010315923,0.98727906,0.000024635972],"about_ca_topic_score_codex":0.002450685,"about_ca_topic_score_gemma":0.003961354,"teacher_disagreement_score":0.107711956,"about_ca_system_score_codex":0.00459604,"about_ca_system_score_gemma":0.0052648117,"threshold_uncertainty_score":0.36033237},"labels":[],"label_agreement":null},{"id":"W6910493891","doi":"10.4230/lipics.cpm.2021.15","title":"Data Structures for Categorical Path Counting Queries","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Categorical variable; Path (computing); Range query (database); Tree (set theory); Data structure; Range (aeronautics); Tree structure; Matrix (chemical analysis)","score_opus":0.03914755067280152,"score_gpt":0.2941442570978527,"score_spread":0.2549967064250512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910493891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043476935,0.00070866616,0.9103114,0.0023553777,0.00022052959,0.00059368805,0.012226876,0.024441611,0.0056648515],"genre_scores_gemma":[0.23205997,0.00036070542,0.7385356,0.00084760966,0.00022374163,0.0016269109,0.0190595,0.0020630148,0.005222898],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943388,0.0008250211,0.0011747304,0.0012358533,0.001824463,0.0006011941],"domain_scores_gemma":[0.97848004,0.007013962,0.0014788737,0.009777076,0.0025737295,0.00067629333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030465862,0.0014280777,0.0021653108,0.0022502942,0.0017878092,0.0048938696,0.004872723,0.002460315,0.013604023],"category_scores_gemma":[0.025090568,0.0013038589,0.0018650086,0.007890955,0.0016039739,0.01861083,0.005645288,0.003756843,0.005288049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029524355,0.0007622375,0.0087842895,0.0015517158,0.00017340755,0.0005547306,0.0014726208,0.057893515,0.03744151,0.30671716,0.09689537,0.48480102],"study_design_scores_gemma":[0.00046608172,0.00055691885,0.001430599,0.00022053334,0.00011354347,0.00075353164,0.0008684696,0.42384344,0.035006657,0.45222968,0.084292956,0.00021754457],"about_ca_topic_score_codex":0.0027618732,"about_ca_topic_score_gemma":0.003975754,"teacher_disagreement_score":0.013604023,"about_ca_system_score_codex":0.0030367654,"about_ca_system_score_gemma":0.0029980722,"threshold_uncertainty_score":0.045509994},"labels":[],"label_agreement":null},{"id":"W6910493941","doi":"10.4230/lipics.disc.2022.11","title":"How to Meet at a Node of Any Connected Graph","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Strongly connected component; Graph; Node (physics); Set (abstract data type); Task (project management); Finite set; Directed graph; Integer (computer science)","score_opus":0.017399656834605638,"score_gpt":0.2415029935148019,"score_spread":0.22410333668019625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910493941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20453893,0.0015464914,0.7214252,0.0087640695,0.00052753784,0.0007723263,0.0016213343,0.0014330738,0.059371073],"genre_scores_gemma":[0.57016873,0.0023273884,0.39962876,0.00069405395,0.00020111196,0.00057687965,0.002989535,0.0005747403,0.022838833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874026,0.000345735,0.00007919951,0.0004476768,0.00022428532,0.00016287704],"domain_scores_gemma":[0.99532986,0.003067744,0.00032624122,0.00056864525,0.00028253943,0.00042492454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080723315,0.0008324228,0.00068203406,0.00057750166,0.001348628,0.0021946493,0.0016467088,0.002059701,0.008274027],"category_scores_gemma":[0.0088071665,0.0004891649,0.0010378733,0.0009498961,0.0020502098,0.0057949997,0.0014861489,0.0015716284,0.0019644268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005821618,0.00024513842,0.0031273395,0.0016004178,0.00017960298,0.0009890603,0.0018817332,0.19167106,0.014738618,0.6025008,0.030953733,0.15153041],"study_design_scores_gemma":[0.000097574346,0.00018627249,0.0011392446,0.0001387073,0.00010828166,0.00084750744,0.0014435739,0.18129635,0.0076696915,0.7536562,0.053335365,0.000081345774],"about_ca_topic_score_codex":0.0031285195,"about_ca_topic_score_gemma":0.003183405,"teacher_disagreement_score":0.008274027,"about_ca_system_score_codex":0.0010632226,"about_ca_system_score_gemma":0.0011108959,"threshold_uncertainty_score":0.027679324},"labels":[],"label_agreement":null},{"id":"W6910514991","doi":"10.4230/lipics.gd.2024.27","title":"On k-Planar Graphs Without Short Cycles","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Austrian Science Fund","keywords":"Upper and lower bounds; Constant (computer programming); Graph; Crossing number (knot theory); Plane (geometry); Enhanced Data Rates for GSM Evolution","score_opus":0.01657954039253932,"score_gpt":0.2767311172570973,"score_spread":0.260151576864558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910514991","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6166704,0.0040702084,0.34574753,0.0015761765,0.00011201003,0.00010469467,0.0005097078,0.0007321664,0.030477012],"genre_scores_gemma":[0.9576989,0.0030503657,0.03543711,0.00029201322,0.00009450736,0.00011289087,0.0004167932,0.00020068338,0.002696706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987256,0.00040337438,0.000051009025,0.00022510724,0.00032874205,0.0002662897],"domain_scores_gemma":[0.9844226,0.011792257,0.0015146071,0.0009133378,0.0005252945,0.00083198235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011771517,0.0014191923,0.0010751515,0.002184674,0.001090082,0.0014339985,0.0016309036,0.00083435496,0.003963548],"category_scores_gemma":[0.0165701,0.00068497384,0.00062786567,0.0024902117,0.0023136388,0.0035161932,0.002631102,0.0015943256,0.00047352086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064353604,0.00016487471,0.0050980337,0.00065128173,0.0000994881,0.0005887043,0.00041477577,0.5756316,0.01293594,0.33569953,0.004625627,0.06344662],"study_design_scores_gemma":[0.000056321784,0.00020180267,0.002047404,0.00013868332,0.00006912743,0.0006252089,0.00024363799,0.6706378,0.0074756844,0.3144104,0.004036835,0.000057203706],"about_ca_topic_score_codex":0.0022064447,"about_ca_topic_score_gemma":0.0024328781,"teacher_disagreement_score":0.003963548,"about_ca_system_score_codex":0.001597059,"about_ca_system_score_gemma":0.0006400211,"threshold_uncertainty_score":0.013259411},"labels":[],"label_agreement":null},{"id":"W6910549475","doi":"10.4230/lipics.isaac.2022.8","title":"Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Approximation algorithm; Vertex (graph theory); Degree (music); Steiner tree problem; Multiset; Vertex cover; Graph; Spanning tree","score_opus":0.04451651043492749,"score_gpt":0.29754264998369145,"score_spread":0.25302613954876396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910549475","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053193923,0.0010153264,0.9363136,0.00062888063,0.0000881794,0.00014819668,0.00027260295,0.00088756526,0.0074517257],"genre_scores_gemma":[0.4965846,0.0005622879,0.49529618,0.00033725583,0.000072225055,0.00035334434,0.0008873288,0.0002814616,0.005625296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844766,0.0004531512,0.00009669056,0.000256145,0.0005195365,0.00022680855],"domain_scores_gemma":[0.9977894,0.0012071689,0.00019922762,0.00031777573,0.00030597232,0.00018046911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014461853,0.0011850693,0.0016253974,0.0009249688,0.00072776596,0.0014819856,0.002358608,0.0013129746,0.0038211967],"category_scores_gemma":[0.0060918573,0.0005402932,0.000776196,0.0024554643,0.00059318636,0.0023244536,0.0017397659,0.0016335796,0.0010808875],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048146522,0.00027502127,0.0014478574,0.00024378851,0.000100619945,0.000113599046,0.00029825044,0.83467966,0.0032058952,0.046207957,0.006167435,0.10677853],"study_design_scores_gemma":[0.000023730361,0.000036434074,0.00007601606,0.00000832825,0.000006299438,0.000027910233,0.000022295078,0.9883807,0.00027202495,0.010304353,0.000838028,0.0000039807774],"about_ca_topic_score_codex":0.0053097866,"about_ca_topic_score_gemma":0.0040648547,"teacher_disagreement_score":0.0053097866,"about_ca_system_score_codex":0.0016525476,"about_ca_system_score_gemma":0.0013923323,"threshold_uncertainty_score":0.01278317},"labels":[],"label_agreement":null},{"id":"W6910552698","doi":"10.4230/lipics.ecoop.2022.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.030068373311759634,"score_gpt":0.19713671650612644,"score_spread":0.1670683431943668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910552698","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065977697,0.004798364,0.0016099921,0.016872495,0.27659282,0.00080923917,0.008002515,0.0021523188,0.68850243],"genre_scores_gemma":[0.0017470875,0.0023473897,0.0005221951,0.0022005083,0.047216326,0.00027061187,0.0028892008,0.0009295744,0.9418771],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991774,0.000053108128,0.00007833289,0.00015948118,0.00039591442,0.00013568258],"domain_scores_gemma":[0.9945539,0.00045750907,0.00025967593,0.00026101916,0.002210095,0.0022577662],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012935947,0.0015733083,0.0015333351,0.0022997065,0.0018068479,0.010053142,0.0015465667,0.0031194894,0.8465726],"category_scores_gemma":[0.0060892333,0.00057930243,0.00083072396,0.0017814204,0.000483029,0.003927098,0.0018220736,0.002783468,0.84391415],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003716845,0.000033911172,0.00004840054,0.00015068997,0.0000020595814,0.000020256646,0.0000040678333,0.000037187423,0.00021893019,0.00035068358,0.9663677,0.032728985],"study_design_scores_gemma":[0.000032911314,0.000034484972,0.00057447766,0.00016373098,0.0000034949996,0.00005196216,0.000038386912,0.00013091884,0.00017642831,0.00079509575,0.99798536,0.000012678161],"about_ca_topic_score_codex":0.0012784037,"about_ca_topic_score_gemma":0.002433524,"teacher_disagreement_score":0.15342742,"about_ca_system_score_codex":0.0014420769,"about_ca_system_score_gemma":0.0020062611,"threshold_uncertainty_score":0.2188456},"labels":[],"label_agreement":null},{"id":"W6910679111","doi":"10.4230/oasics.manzini","title":"OASIcs, Volume 131, Manzini's Festschrift, Complete Volume","year":2025,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Phonetics and Phonology Research","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Volume (thermodynamics); Work (physics); Compression (physics); Ventricular volume","score_opus":0.02694934749136053,"score_gpt":0.3227305470015886,"score_spread":0.2957811995102281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910679111","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052543875,0.016674615,0.0017485893,0.009285391,0.0809921,0.00028117344,0.01102525,0.0017464138,0.87772095],"genre_scores_gemma":[0.0013110639,0.0033911422,0.0004833778,0.0009545783,0.0055574216,0.000108407934,0.0032887957,0.001363227,0.98354197],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980248,0.00020878665,0.00011617059,0.00022989893,0.0011567267,0.00026364427],"domain_scores_gemma":[0.998104,0.00026210703,0.00008966163,0.00020082343,0.00067616825,0.00066715723],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023838626,0.0017071278,0.0014199032,0.0045630196,0.0022055032,0.009823133,0.0016153728,0.002000284,0.5720707],"category_scores_gemma":[0.0046867444,0.0006338541,0.0008815532,0.004666932,0.0011516184,0.0041440036,0.0034340085,0.002831552,0.4830142],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023224862,0.000012779577,0.0000221791,0.000081084305,0.000001753142,0.000005250889,0.000009801181,0.000024352496,0.00007777927,0.0019876165,0.9795002,0.018254016],"study_design_scores_gemma":[0.000005989715,0.000009895103,0.00018730487,0.00005792344,0.0000015199499,0.000013812556,0.00001609877,0.000031368007,0.0000654951,0.0012965207,0.99830997,0.0000041701737],"about_ca_topic_score_codex":0.007826813,"about_ca_topic_score_gemma":0.013476445,"teacher_disagreement_score":0.5720707,"about_ca_system_score_codex":0.00419114,"about_ca_system_score_gemma":0.004049983,"threshold_uncertainty_score":0.6103892},"labels":[],"label_agreement":null},{"id":"W6910774580","doi":"10.4230/lipics.sea.2025.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leibniz-Gemeinschaft; Univerzita Karlova v Praze; Centre National de la Recherche Scientifique; Universitat Politècnica de Catalunya; Gran Sasso Science Institute; Sandia National Laboratories; Università degli Studi dell'Aquila; Universität Stuttgart; Universidad de Chile; Universität Konstanz; Rheinische Friedrich-Wilhelms-Universität Bonn; Universität Salzburg; Danmarks Tekniske Universitet; Universität Hamburg; University of Ioannina; Technische Universität Dortmund; Università di Catania; Stony Brook University; University of Waterloo; University of Patras; Institut national de recherche en informatique et en automatique (INRIA); Helsingin Yliopisto; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Universität Osnabrück; Université de Genève","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.02358150356367914,"score_gpt":0.20934650921269696,"score_spread":0.18576500564901782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910774580","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006614506,0.0047206967,0.0016255421,0.016632192,0.2733466,0.0008055959,0.007884469,0.0021447705,0.6921788],"genre_scores_gemma":[0.0017419748,0.002300361,0.00052105123,0.0021351895,0.04622373,0.0002655493,0.0028455567,0.00091881934,0.94304776],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991831,0.000052675838,0.00007743918,0.00015832022,0.00039348903,0.00013486712],"domain_scores_gemma":[0.99463046,0.000449254,0.00025427225,0.00025798992,0.0021850816,0.0022228642],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001279385,0.0015659132,0.0015215593,0.0022789985,0.0017894283,0.009958579,0.0015444527,0.0030927968,0.84719014],"category_scores_gemma":[0.0060174125,0.0005742537,0.00083125365,0.0017520313,0.00048165224,0.003885196,0.001816198,0.0027611759,0.84447557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036988502,0.000033549546,0.000048131944,0.00014926778,0.0000020543062,0.000020289415,0.00000404683,0.00003722276,0.00022065632,0.00035530824,0.9661649,0.032927565],"study_design_scores_gemma":[0.000032456683,0.000034211753,0.00056663656,0.00016197667,0.0000034492327,0.000051427574,0.000037763617,0.00013035089,0.00017701552,0.0007990609,0.99799323,0.000012482333],"about_ca_topic_score_codex":0.0012674907,"about_ca_topic_score_gemma":0.0024234762,"teacher_disagreement_score":0.15280986,"about_ca_system_score_codex":0.0014418818,"about_ca_system_score_gemma":0.0019842065,"threshold_uncertainty_score":0.21796465},"labels":[],"label_agreement":null},{"id":"W6928871751","doi":"10.4230/lipics.opodis.2024.6","title":"DULL: A Fast Scalable Detectable Unrolled Lock-Based Linked List","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Radioactive element chemistry and processing","field":"Chemistry","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scalability; Correctness; Multiprocessing; Data structure; Mutual exclusion","score_opus":0.008538810778566691,"score_gpt":0.2544704868382914,"score_spread":0.24593167605972469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6928871751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046870787,0.0011105089,0.88195324,0.00037958656,0.00016589552,0.00047610325,0.00095015403,0.06303593,0.005057907],"genre_scores_gemma":[0.2824751,0.00046147985,0.7006231,0.000402432,0.00006839402,0.00049050665,0.0032556665,0.0015241985,0.01069909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922204,0.000089115274,0.00004778242,0.00014897225,0.00040166502,0.00009045401],"domain_scores_gemma":[0.99863166,0.00040354286,0.00019876169,0.00036737233,0.00027547602,0.00012307908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005782681,0.00074773544,0.00046338633,0.0014348126,0.00065549015,0.0014928735,0.003365491,0.00068188197,0.0054338095],"category_scores_gemma":[0.0023997037,0.00048961135,0.00043033736,0.0010674171,0.0005807929,0.0024043978,0.002175762,0.00081799476,0.0015784363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012625764,0.00050168205,0.0042235656,0.0011678104,0.000103654886,0.000455153,0.00042450218,0.039783463,0.09790549,0.017334254,0.028915681,0.80792224],"study_design_scores_gemma":[0.0008565887,0.0015357073,0.0015550689,0.00011862245,0.00011732636,0.00043688354,0.00024949142,0.66860056,0.22224209,0.020874675,0.08322431,0.00018868159],"about_ca_topic_score_codex":0.002900502,"about_ca_topic_score_gemma":0.0044050957,"teacher_disagreement_score":0.0054338095,"about_ca_system_score_codex":0.0010405385,"about_ca_system_score_gemma":0.0017907643,"threshold_uncertainty_score":0.018177867},"labels":[],"label_agreement":null},{"id":"W6928957407","doi":"10.4230/lipics.ecrts.2024","title":"LIPIcs, Volume 298, ECRTS 2024, Complete Volume","year":2024,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genetics, Aging, and Longevity in Model Organisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"","score_opus":0.01134675045352374,"score_gpt":0.23875018745689516,"score_spread":0.22740343700337143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6928957407","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076043257,0.005676758,0.03553479,0.0020933426,0.0054913247,0.0002500489,0.04249852,0.030112676,0.8775821],"genre_scores_gemma":[0.0026279965,0.0032379704,0.009185087,0.0004562698,0.0011592007,0.00026627936,0.03519182,0.013929087,0.93394625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986946,0.000090301226,0.00007400817,0.00020933422,0.0008243328,0.00010735978],"domain_scores_gemma":[0.9985072,0.00032353753,0.0000901706,0.0002777437,0.00039459867,0.0004066349],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012057057,0.003123751,0.0024133986,0.0036076356,0.00093309634,0.00871248,0.0025194462,0.0019046629,0.7302619],"category_scores_gemma":[0.0051049693,0.0011382787,0.0009595398,0.0048386566,0.00065437815,0.005290691,0.0024546739,0.0028038705,0.6921311],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063082865,0.00002886982,0.000035608587,0.00022187598,0.000010979411,0.000014782544,0.000008902555,0.00063466374,0.0010873687,0.0050990004,0.92544806,0.06734678],"study_design_scores_gemma":[0.000028543569,0.000017883178,0.00018125317,0.00008076627,0.000008917969,0.000054098295,0.0000119776405,0.0013584334,0.0013187084,0.0072104167,0.98971087,0.000018122042],"about_ca_topic_score_codex":0.0022488153,"about_ca_topic_score_gemma":0.0036698526,"teacher_disagreement_score":0.7302619,"about_ca_system_score_codex":0.0022804162,"about_ca_system_score_gemma":0.0017914028,"threshold_uncertainty_score":0.38474858},"labels":[],"label_agreement":null},{"id":"W6929000334","doi":"10.4230/lipics.cp.2023.23","title":"Large Neighborhood Beam Search for Domain-Independent Dynamic Programming","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Solver; Scheduling (production processes); State space; Beam search; Constraint programming; Dynamic programming; State (computer science); Search algorithm","score_opus":0.013371875105233005,"score_gpt":0.27542852147713176,"score_spread":0.26205664637189874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929000334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060900594,0.0004001135,0.9891556,0.00021396138,0.000040776016,0.00008324139,0.000091581256,0.00044561666,0.0034790556],"genre_scores_gemma":[0.18678059,0.0005086908,0.8074915,0.00039721178,0.00007324571,0.0007426203,0.0005913914,0.00036176085,0.00305303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983368,0.00089595135,0.000066787085,0.00025553053,0.00033288932,0.00011204151],"domain_scores_gemma":[0.9975206,0.0018125252,0.00014923843,0.00021042401,0.00022814967,0.00007895281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002498064,0.0010604187,0.0014111948,0.0011923664,0.0006729917,0.0013490282,0.0015141908,0.0012938498,0.005853156],"category_scores_gemma":[0.0063049914,0.00080701936,0.001287885,0.0018423647,0.0013532154,0.001694596,0.0022312233,0.0026182064,0.00088648463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010055039,0.0001316827,0.0010537525,0.00024362627,0.000115385636,0.00007627129,0.00010804851,0.8001088,0.001978405,0.09711345,0.0063576084,0.092612445],"study_design_scores_gemma":[0.00002765932,0.00003426948,0.00006356437,0.00001826796,0.00001030173,0.000015199481,0.000012380174,0.97142315,0.00041774087,0.025573494,0.0023962935,0.000007643033],"about_ca_topic_score_codex":0.0028801141,"about_ca_topic_score_gemma":0.0054209367,"teacher_disagreement_score":0.005853156,"about_ca_system_score_codex":0.0010632591,"about_ca_system_score_gemma":0.0017875063,"threshold_uncertainty_score":0.019580722},"labels":[],"label_agreement":null},{"id":"W6929005788","doi":"10.4230/lipics.cpm.2024.17","title":"Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomic variations and chromosomal abnormalities","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Constant (computer programming); Upper and lower bounds; Interval (graph theory); Interval graph; Graph; Omega; Edge-graceful labeling","score_opus":0.010819448760542229,"score_gpt":0.24823209171967836,"score_spread":0.23741264295913614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929005788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10992411,0.0008793907,0.8713649,0.0010720815,0.00021663077,0.00021498183,0.0010289922,0.006351101,0.008947903],"genre_scores_gemma":[0.5330153,0.00043067886,0.45784056,0.0004813876,0.0001124307,0.0003677261,0.0016793836,0.00043224823,0.0056402767],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745554,0.00045496997,0.00024254131,0.00053438154,0.0009000072,0.00041256959],"domain_scores_gemma":[0.99322814,0.002178751,0.00058908964,0.003104591,0.0006194133,0.0002801118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011335512,0.0006567711,0.0010133171,0.0007939072,0.0010939508,0.0016958129,0.0025193442,0.0012310153,0.006571941],"category_scores_gemma":[0.0058714584,0.00042977819,0.00068961387,0.0017282105,0.001048669,0.0056856694,0.0036013557,0.0017924801,0.0021473577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037519503,0.00035109618,0.0020757292,0.0007570833,0.000083165825,0.00027590807,0.001107395,0.051874775,0.12683171,0.16699085,0.023199897,0.62270045],"study_design_scores_gemma":[0.0007588011,0.0018138222,0.001785411,0.00018508757,0.00017904163,0.0010700157,0.0007174695,0.41343987,0.16447759,0.35022974,0.06507492,0.00026826168],"about_ca_topic_score_codex":0.0010954295,"about_ca_topic_score_gemma":0.0009887457,"teacher_disagreement_score":0.006571941,"about_ca_system_score_codex":0.0017196906,"about_ca_system_score_gemma":0.0012274501,"threshold_uncertainty_score":0.021985352},"labels":[],"label_agreement":null},{"id":"W6929073864","doi":"10.4230/lipics.ecrts.2025.9","title":"DAMA: A Dual Arbitration Mechanism for Mixed-Criticality Applications","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latency (audio); Arbitration; Scheduling (production processes); Upper and lower bounds; Overhead (engineering); Preemption; Processor scheduling","score_opus":0.012993861564221025,"score_gpt":0.2810580026251762,"score_spread":0.2680641410609552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929073864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08392538,0.0017535251,0.8969,0.00042476892,0.00030485608,0.0002580635,0.00013877697,0.011581535,0.00471307],"genre_scores_gemma":[0.7471132,0.0004346485,0.2428565,0.00040213135,0.00017351792,0.00036725443,0.00021351539,0.00041488497,0.008024355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866116,0.00023165306,0.00016686314,0.00025059827,0.0004721024,0.00021750153],"domain_scores_gemma":[0.9983236,0.0003695039,0.00028975654,0.0005916893,0.00022585338,0.00019945923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021242504,0.0008025993,0.0005290431,0.00095426384,0.0005885322,0.0014438542,0.0034145974,0.0008471055,0.0045548035],"category_scores_gemma":[0.002864288,0.0005356567,0.0004047301,0.00045733055,0.00077563897,0.002074473,0.0029554584,0.0014072942,0.0010675006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00226413,0.0005827663,0.005109142,0.0008159477,0.00021993107,0.0010994007,0.0007254698,0.05048693,0.3593642,0.10107778,0.014287945,0.46396634],"study_design_scores_gemma":[0.000301895,0.0009632075,0.0015814917,0.00007200011,0.00014003037,0.0009641083,0.00006158038,0.754958,0.14102416,0.03586193,0.063905746,0.00016587078],"about_ca_topic_score_codex":0.0005910103,"about_ca_topic_score_gemma":0.0007354684,"teacher_disagreement_score":0.0045548035,"about_ca_system_score_codex":0.0007289585,"about_ca_system_score_gemma":0.0011021019,"threshold_uncertainty_score":0.015237331},"labels":[],"label_agreement":null},{"id":"W6929079456","doi":"10.4230/lipics.approx/random.2024.51","title":"Consequences of Randomized Reductions from SAT to Time-Bounded Kolmogorov Complexity","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kolmogorov complexity; Randomized algorithm; Constant (computer programming); Reduction (mathematics); Time complexity; Computational complexity theory; Class (philosophy); Running time","score_opus":0.02830620384657163,"score_gpt":0.2812607922792531,"score_spread":0.2529545884326815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929079456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25918227,0.0015741244,0.6233323,0.030544281,0.0008064607,0.0005700187,0.0014513828,0.0039358893,0.078603275],"genre_scores_gemma":[0.92251015,0.00070374284,0.06067731,0.0044944906,0.0007943668,0.0007440215,0.0008799609,0.0009519675,0.008244081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97695404,0.008319974,0.00090705924,0.0046079606,0.0064823646,0.0027286299],"domain_scores_gemma":[0.89993244,0.07932898,0.0029007052,0.013987968,0.0024201863,0.0014296662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009136315,0.0009563541,0.0017636083,0.0009031567,0.002486654,0.004343642,0.0042660846,0.002713376,0.0075172205],"category_scores_gemma":[0.059867356,0.0011965905,0.004000208,0.00092716096,0.007877676,0.012326988,0.007895005,0.01374832,0.00091677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008844421,0.0003954652,0.0031194377,0.0003489397,0.00016769565,0.00034586768,0.0005855428,0.07040807,0.006905611,0.89196634,0.007843668,0.017029015],"study_design_scores_gemma":[0.0002929767,0.00022324095,0.0021851505,0.00006938023,0.000111274356,0.00025613108,0.0002540756,0.16513161,0.008754905,0.81672835,0.005910224,0.00008255032],"about_ca_topic_score_codex":0.0019332956,"about_ca_topic_score_gemma":0.001830324,"teacher_disagreement_score":0.009136315,"about_ca_system_score_codex":0.0038378409,"about_ca_system_score_gemma":0.0034125615,"threshold_uncertainty_score":0.04831803},"labels":[],"label_agreement":null},{"id":"W6929089696","doi":"10.4230/lipics.isaac.2024.15","title":"On the Spanning and Routing Ratios of the Yao-Four Graph","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Euclidean distance; Distance; Vertex (graph theory); Path graph; Spanner; Graph; Butterfly graph; Line graph; Euclidean geometry","score_opus":0.018773751488630048,"score_gpt":0.23073189276381517,"score_spread":0.2119581412751851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929089696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6071663,0.0070355744,0.3021852,0.0036625348,0.0002838392,0.00020148954,0.0011734196,0.0017083529,0.07658333],"genre_scores_gemma":[0.91048276,0.0022621069,0.07983772,0.00047776723,0.0002543685,0.00022431291,0.00082926877,0.00053245947,0.0050991834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974821,0.00091880164,0.00008463049,0.0004887629,0.0005543578,0.00047132382],"domain_scores_gemma":[0.9790467,0.015835421,0.0016266573,0.0016068692,0.0011349457,0.0007495354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032780922,0.0014646448,0.00096225704,0.003236377,0.0010971392,0.0024862825,0.0023201539,0.0012179246,0.0069867275],"category_scores_gemma":[0.0323489,0.0006454591,0.000815373,0.0023113615,0.0023406278,0.0059322217,0.0023467178,0.0026009926,0.0015458158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018175412,0.00029393286,0.006673081,0.00041947069,0.00014941618,0.0003503038,0.0006084671,0.23583819,0.015646428,0.544964,0.018444875,0.17479436],"study_design_scores_gemma":[0.00014033925,0.0004019049,0.0033134078,0.00013218969,0.00016279345,0.0007631187,0.00030642597,0.5692418,0.010656281,0.4057696,0.0090091955,0.00010286257],"about_ca_topic_score_codex":0.001953826,"about_ca_topic_score_gemma":0.0014084332,"teacher_disagreement_score":0.0069867275,"about_ca_system_score_codex":0.002388311,"about_ca_system_score_gemma":0.0011999987,"threshold_uncertainty_score":0.023372948},"labels":[],"label_agreement":null},{"id":"W6929096184","doi":"10.4230/lipics.approx/random.2022","title":"LIPIcs, Volume 245, APPROX/RANDOM 2022, Complete Volume","year":2022,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Psychometric Methodologies and Testing","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Volume (thermodynamics); Work (physics); Compression (physics); Ventricular volume","score_opus":0.19952734369764433,"score_gpt":0.3852000474209052,"score_spread":0.18567270372326086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929096184","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014386822,0.0061082593,0.043964162,0.0071395277,0.010046677,0.00037781667,0.063899,0.016652774,0.8503731],"genre_scores_gemma":[0.010333189,0.0038067119,0.012829226,0.0019858603,0.0044580116,0.0005843736,0.03480042,0.01892981,0.91227233],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974076,0.00038656464,0.0001554729,0.00045282382,0.0014375204,0.00015996146],"domain_scores_gemma":[0.9965329,0.0012323435,0.00020155121,0.0006453429,0.00085776363,0.0005300261],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019421052,0.0024951096,0.0019060024,0.004265641,0.0010236518,0.009662876,0.0017397684,0.0016337329,0.72412723],"category_scores_gemma":[0.017172523,0.0008547772,0.00084289163,0.005963754,0.00084914605,0.0049313265,0.0018670993,0.0028720172,0.630251],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006545545,0.000033349414,0.000076864344,0.00016364451,0.000009132564,0.000011019128,0.000006657458,0.00054693164,0.00019592408,0.006937105,0.93777895,0.054174863],"study_design_scores_gemma":[0.00007926814,0.000038613605,0.00062681513,0.00023593435,0.000015193916,0.0001004031,0.00003768802,0.0036886884,0.0008430408,0.058645748,0.9356583,0.00003025419],"about_ca_topic_score_codex":0.0020426179,"about_ca_topic_score_gemma":0.003173209,"teacher_disagreement_score":0.27587277,"about_ca_system_score_codex":0.0029555326,"about_ca_system_score_gemma":0.0018875335,"threshold_uncertainty_score":0.39349902},"labels":[],"label_agreement":null},{"id":"W6929118331","doi":"10.4230/lipics.ccc.2023.12","title":"Improved Learning from Kolmogorov Complexity","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genetic Mapping and Diversity in Plants and Animals","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kolmogorov complexity; Boolean function; String (physics); Probably approximately correct learning; Function (biology); Circuit complexity; Relaxation (psychology); Boolean circuit","score_opus":0.031175317303962457,"score_gpt":0.2518167329530661,"score_spread":0.22064141564910367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929118331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049286306,0.00522436,0.908092,0.0059957705,0.00052370375,0.00018597879,0.0013114131,0.0027896261,0.02659087],"genre_scores_gemma":[0.73705757,0.002971788,0.23513982,0.0027118204,0.0020531549,0.0006574743,0.003201587,0.0008975961,0.015309169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946449,0.0015434042,0.00024162132,0.0016368825,0.0015077001,0.00042541357],"domain_scores_gemma":[0.9614929,0.0290993,0.0011571787,0.0054070256,0.0021616127,0.00068205834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003988994,0.0016362726,0.0028699846,0.0024431325,0.001363158,0.0038967563,0.0036791277,0.0022748574,0.009527376],"category_scores_gemma":[0.051508583,0.00094844104,0.002062608,0.0025391455,0.0031086686,0.012570527,0.0073679807,0.0075088674,0.0018905003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048635917,0.00027033038,0.00506297,0.00093919196,0.00020850013,0.00017601077,0.00054980785,0.1607543,0.0026485105,0.53967303,0.027023507,0.26220748],"study_design_scores_gemma":[0.00004687166,0.00006903711,0.0007223162,0.00006302353,0.000036401518,0.000057888603,0.000029489614,0.44299296,0.00088447466,0.5511226,0.0039486126,0.000026302527],"about_ca_topic_score_codex":0.0030459764,"about_ca_topic_score_gemma":0.003361476,"teacher_disagreement_score":0.009527376,"about_ca_system_score_codex":0.004485641,"about_ca_system_score_gemma":0.0026719295,"threshold_uncertainty_score":0.032545745},"labels":[],"label_agreement":null},{"id":"W6929138079","doi":"10.4230/lipics.giscience.2023.9","title":"Platial k-Anonymity: Improving Location Anonymity Through Temporal Popularity Signatures","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Statistical Methods and Bayesian Inference","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Anonymity; Popularity; Set (abstract data type); Location data; Field (mathematics); Spatial analysis; Location-based service; k-anonymity","score_opus":0.06392384411763485,"score_gpt":0.3668328807835996,"score_spread":0.30290903666596475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929138079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026492955,0.0003186781,0.96748483,0.00076967466,0.00010498631,0.00012114555,0.001175796,0.00086886063,0.0026631407],"genre_scores_gemma":[0.6571877,0.0007300901,0.33424214,0.00046691683,0.00039672395,0.00038055834,0.0020628525,0.0002587134,0.004274326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98514044,0.006575166,0.0010742951,0.0026471966,0.0037484502,0.0008142994],"domain_scores_gemma":[0.9423778,0.022287155,0.008041986,0.02167105,0.004712623,0.0009094042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008595346,0.00090779265,0.0013316363,0.0023569928,0.0022299148,0.0037692972,0.0031044052,0.0015032836,0.0024193747],"category_scores_gemma":[0.052490078,0.0006370962,0.0013765463,0.0058193333,0.0028419206,0.011791025,0.006248577,0.0027717575,0.0013239105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001641911,0.000342685,0.022415964,0.000598462,0.00042966628,0.00062174676,0.0021396826,0.21799889,0.013655627,0.3529264,0.015204071,0.37202492],"study_design_scores_gemma":[0.00008526996,0.00030232378,0.0030790097,0.00009369717,0.00011792519,0.000992129,0.00066154706,0.60962486,0.016686428,0.34849194,0.019645771,0.0002191357],"about_ca_topic_score_codex":0.0021563382,"about_ca_topic_score_gemma":0.002487542,"teacher_disagreement_score":0.008595346,"about_ca_system_score_codex":0.0018189662,"about_ca_system_score_gemma":0.0034664941,"threshold_uncertainty_score":0.045457065},"labels":[],"label_agreement":null},{"id":"W6929198917","doi":"10.4230/lipics.cp.2025.23","title":"RPID: Rust Programmable Interface for Domain-Independent Dynamic Programming","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Solver; Flexibility (engineering); Rust (programming language); Interface (matter); Software; Set (abstract data type); Dynamic programming; Class (philosophy)","score_opus":0.012899159785055066,"score_gpt":0.31897544518650495,"score_spread":0.3060762854014499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929198917","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011495657,0.00013469065,0.95899725,0.0001126726,0.00007102723,0.00009239522,0.00032581668,0.035662197,0.0034543935],"genre_scores_gemma":[0.07089718,0.0005220127,0.9045747,0.0006051239,0.00008464901,0.00091012125,0.0029681318,0.012829645,0.0066083972],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965197,0.0009550757,0.0003904379,0.0007562545,0.0010923307,0.00028619965],"domain_scores_gemma":[0.9970739,0.0014230919,0.00019026916,0.0008678218,0.00030818008,0.00013667012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034284357,0.0017070497,0.0009703005,0.001129924,0.0005010391,0.0029596877,0.004426575,0.001852741,0.020481091],"category_scores_gemma":[0.008633858,0.0014454239,0.0025432236,0.00087507407,0.0015098066,0.0046058497,0.0048940205,0.0054588607,0.0069858176],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013326856,0.00046124557,0.0019057551,0.0019758192,0.0003274727,0.0005122114,0.0008864119,0.089128174,0.025797794,0.34035543,0.09637944,0.44093767],"study_design_scores_gemma":[0.0004924046,0.00022385402,0.00024378506,0.00025956874,0.00009525379,0.0005017725,0.00007554133,0.66344714,0.033057477,0.121191375,0.18028425,0.00012760644],"about_ca_topic_score_codex":0.0013586268,"about_ca_topic_score_gemma":0.0015453147,"teacher_disagreement_score":0.020481091,"about_ca_system_score_codex":0.0011473076,"about_ca_system_score_gemma":0.0022276817,"threshold_uncertainty_score":0.068516016},"labels":[],"label_agreement":null},{"id":"W6929220425","doi":"10.4230/lipics.cp.2022.34","title":"Scheduling the Equipment Maintenance of an Electric Power Transmission Network Using Constraint Programming","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Obesity, Physical Activity, Diet","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Hydro-Québec; Polytechnique Montréal","funders":"","keywords":"Scheduling (production processes); Schedule; Electric power system; Grid; Electric power; Power grid; Power transmission; Electric power transmission; Power flow; Constraint satisfaction problem","score_opus":0.01848318716378527,"score_gpt":0.277746474083795,"score_spread":0.2592632869200097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929220425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32125196,0.00025817647,0.65874666,0.00044780283,0.000043896165,0.00043601217,0.0009880469,0.0009600532,0.016867433],"genre_scores_gemma":[0.7956792,0.0003195575,0.1976529,0.000081095466,0.0000141109995,0.00043581054,0.00063826866,0.00013325142,0.005045795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963033,0.00016678283,0.0000139291615,0.0000739544,0.000057008943,0.00005802926],"domain_scores_gemma":[0.9987809,0.0009831513,0.00008488579,0.000036395246,0.00007080862,0.000043839125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061706215,0.00085656357,0.0005207376,0.00036018877,0.00048252422,0.000948516,0.0008438412,0.0006696548,0.0036355152],"category_scores_gemma":[0.001882347,0.000409961,0.00055807846,0.00073607534,0.0005304711,0.0006198576,0.00035854208,0.0005658814,0.00019755104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030389694,0.0000211012,0.00018498664,0.000022234382,0.0000073061065,0.000036415262,0.00001706391,0.9929974,0.0005951024,0.0016264502,0.00020771431,0.004253772],"study_design_scores_gemma":[0.00001675805,0.00002263432,0.00009691367,0.0000030858018,0.000006471256,0.000007679956,0.000010735036,0.998319,0.00046813177,0.0006644341,0.0003805157,0.0000035608696],"about_ca_topic_score_codex":0.06007463,"about_ca_topic_score_gemma":0.045332856,"teacher_disagreement_score":0.06007463,"about_ca_system_score_codex":0.0016605131,"about_ca_system_score_gemma":0.0024217223,"threshold_uncertainty_score":0.11944991},"labels":[],"label_agreement":null},{"id":"W6929353258","doi":"10.4230/lipics.opodis.2019.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Heat Transfer and Numerical Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"École Polytechnique Fédérale de Lausanne; Leibniz-Gemeinschaft; National University of Singapore","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.024545996237824778,"score_gpt":0.23569218667115555,"score_spread":0.21114619043333077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929353258","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089003536,0.00481272,0.002614867,0.016123004,0.24305592,0.0007140023,0.006617157,0.0023251541,0.72284716],"genre_scores_gemma":[0.0021732186,0.0023096316,0.0007616084,0.001404351,0.033563923,0.00019641774,0.0024452207,0.00093845796,0.9562072],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992404,0.000043242948,0.00006493504,0.0001325744,0.00039601905,0.0001227799],"domain_scores_gemma":[0.9960603,0.00026634504,0.00017034738,0.00022176717,0.0017461671,0.0015349332],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001155702,0.0012749921,0.0012299798,0.0020033687,0.0017316607,0.008380045,0.001352237,0.002668166,0.8148015],"category_scores_gemma":[0.0044361316,0.0005288394,0.00076894154,0.0014816555,0.00044359,0.003311516,0.0016690508,0.0022133326,0.79685205],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038624206,0.00004270807,0.00007019948,0.0001601674,0.0000023239347,0.000022499413,0.0000046658447,0.000057449604,0.00044290515,0.0005655201,0.9518511,0.046741746],"study_design_scores_gemma":[0.000021133386,0.000040552564,0.0005797845,0.00013121062,0.00000361348,0.000065194516,0.00003431642,0.00016162502,0.0003366512,0.00085214636,0.9977621,0.000011667616],"about_ca_topic_score_codex":0.0010489788,"about_ca_topic_score_gemma":0.0022173054,"teacher_disagreement_score":0.18519849,"about_ca_system_score_codex":0.001252795,"about_ca_system_score_gemma":0.0021479037,"threshold_uncertainty_score":0.2641632},"labels":[],"label_agreement":null},{"id":"W6929452996","doi":"10.4230/darts.5.2.9","title":"Reasoning About Foreign Function Interfaces Without Modelling the Foreign Language (Artifact)","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Head and Neck Cancer Studies","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artifact (error); Function (biology); Mathematical proof; Foreign language; Component (thermodynamics); Natural language","score_opus":0.01794237902695197,"score_gpt":0.2750068444786599,"score_spread":0.25706446545170797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929452996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042925463,0.00017104424,0.9836542,0.0010025144,0.0002617924,0.0001023291,0.00023815474,0.0023083577,0.00796908],"genre_scores_gemma":[0.16660365,0.00060769875,0.8163289,0.0013392624,0.00034361857,0.00030998146,0.0011672523,0.0020504426,0.011249195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98939335,0.0032890115,0.0009571747,0.0017908002,0.0035025137,0.0010671932],"domain_scores_gemma":[0.98332363,0.0064007626,0.00072167866,0.0076687243,0.0016246724,0.00026051962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010009776,0.0017230231,0.0012196975,0.0019441287,0.0019214344,0.01213329,0.0046649254,0.0033382964,0.014204674],"category_scores_gemma":[0.026658515,0.0018124207,0.004725567,0.0012721937,0.0057772384,0.019537568,0.011740058,0.006352241,0.0041639875],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009474907,0.000078016994,0.0010798135,0.00040755715,0.000083931016,0.00076026295,0.0007218627,0.008178099,0.0056310645,0.92978173,0.007542246,0.04564071],"study_design_scores_gemma":[0.000079061836,0.00011308766,0.00048862444,0.00042349313,0.00019330227,0.0012268603,0.00046710434,0.062106334,0.040137257,0.79124457,0.10341001,0.000110304296],"about_ca_topic_score_codex":0.002081324,"about_ca_topic_score_gemma":0.0022198544,"teacher_disagreement_score":0.014204674,"about_ca_system_score_codex":0.001677645,"about_ca_system_score_gemma":0.0036618449,"threshold_uncertainty_score":0.05293739},"labels":[],"label_agreement":null},{"id":"W6947565633","doi":"10.4230/lipics.isaac.2024.4","title":"Minimum Plane Bichromatic Spanning Trees","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Spanning tree; Euclidean minimum spanning tree; Minimum spanning tree; k-minimum spanning tree; Shortest-path tree; Tree (set theory); Plane (geometry); Time complexity; Regular polygon","score_opus":0.019280831635430325,"score_gpt":0.2567765929345371,"score_spread":0.23749576129910677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947565633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1784818,0.0023865036,0.7981668,0.0007418431,0.00008613022,0.00027112637,0.0038625502,0.0015833827,0.01441978],"genre_scores_gemma":[0.36964786,0.001564979,0.6155846,0.00017774264,0.00005230026,0.00019452095,0.006367701,0.00024087228,0.0061694128],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995819,0.00007024115,0.000027388303,0.00013888966,0.0000971598,0.000084521846],"domain_scores_gemma":[0.9994497,0.00019038162,0.000104547995,0.000104589984,0.00009658161,0.000054210344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024408453,0.0007137559,0.001000759,0.00074819406,0.0005368658,0.0010800045,0.00093594566,0.0009918106,0.003995364],"category_scores_gemma":[0.0019135097,0.00042470603,0.0005534943,0.0021989692,0.00025382996,0.0016768704,0.0010358099,0.000756404,0.0011531975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007304256,0.0002478706,0.0026236582,0.0013622442,0.00018511491,0.000633188,0.0007644563,0.37492454,0.04722005,0.09474793,0.034618586,0.44194195],"study_design_scores_gemma":[0.0001091476,0.0002177549,0.002824492,0.00011599173,0.000082089806,0.0011846082,0.00037999445,0.84757686,0.011383658,0.10927325,0.026803903,0.000048203554],"about_ca_topic_score_codex":0.002015487,"about_ca_topic_score_gemma":0.0024959026,"teacher_disagreement_score":0.003995364,"about_ca_system_score_codex":0.0006384508,"about_ca_system_score_gemma":0.0004300466,"threshold_uncertainty_score":0.013365805},"labels":[],"label_agreement":null},{"id":"W6947624803","doi":"10.4230/artifacts.24205","title":"RPID","year":2025,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"","score_opus":0.012479253069022847,"score_gpt":0.24834334967312657,"score_spread":0.23586409660410373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947624803","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028322768,0.00067561254,0.004078253,0.0011539594,0.001584559,0.00016253698,0.09227675,0.02937558,0.8704096],"genre_scores_gemma":[0.002176965,0.0005935575,0.003071824,0.0011978945,0.00034656818,0.00024358089,0.08073148,0.012359027,0.89927906],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988965,0.000131752,0.000074220196,0.00022024698,0.0005045775,0.0001727214],"domain_scores_gemma":[0.99806756,0.00028352847,0.00009718948,0.00041803505,0.00055760815,0.0005759937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010623853,0.002031483,0.0013104622,0.0043520206,0.0015537951,0.005956888,0.0023728937,0.0018191298,0.92386353],"category_scores_gemma":[0.0051141195,0.0008080409,0.0012095437,0.0025240437,0.00049220934,0.0032608975,0.0044106953,0.001729784,0.9230979],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031927637,0.00001993367,0.00007269917,0.00014175448,0.0000048214374,0.00001677433,0.000017574886,0.000046203615,0.00021283295,0.00231003,0.9490753,0.048050106],"study_design_scores_gemma":[0.000012259379,0.0000052137,0.00012603913,0.00005017446,0.0000040764853,0.000025753347,0.000012652261,0.00006333725,0.00014844016,0.0015556612,0.99798894,0.000007573304],"about_ca_topic_score_codex":0.0034702502,"about_ca_topic_score_gemma":0.0047194017,"teacher_disagreement_score":0.92386353,"about_ca_system_score_codex":0.001014066,"about_ca_system_score_gemma":0.0015139558,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W6947760464","doi":"10.4230/lipics.dna.29.5","title":"Revisiting Hybridization Kinetics with Improved Elementary Step Simulation","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Research Data Management Practices","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Kinetic energy; Set (abstract data type); Markov chain; Markov process; Work (physics); Elementary reaction; Bayesian probability; Inference; Base (topology)","score_opus":0.042819751305135434,"score_gpt":0.3280214230198652,"score_spread":0.28520167171472977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947760464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18981804,0.000491826,0.79318595,0.0007085551,0.00019848123,0.00019206973,0.0021496569,0.0020541826,0.011201283],"genre_scores_gemma":[0.80864227,0.00050044974,0.18113753,0.0003580129,0.000089734414,0.0006010003,0.00241411,0.0007469782,0.0055099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937147,0.0001352482,0.00003811236,0.00017646486,0.00017829775,0.00010037066],"domain_scores_gemma":[0.9944113,0.004151989,0.00021113246,0.00055209163,0.00047524562,0.0001983266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017703873,0.000756824,0.0014566068,0.00094729,0.0005930948,0.0015921907,0.0030050657,0.0017795254,0.0060152877],"category_scores_gemma":[0.009353769,0.0009186832,0.0015816513,0.0008726469,0.0009886661,0.00229572,0.0011494609,0.002652189,0.0008973894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003199683,0.00004014358,0.0011213595,0.000052580723,0.000017160528,0.00006309277,0.000052626325,0.9811474,0.0016044276,0.011802817,0.0003372311,0.0037292428],"study_design_scores_gemma":[0.000004245459,0.000003556471,0.00006263181,0.0000023657292,0.0000024341866,0.0000041085973,0.000003001823,0.99749666,0.00032383366,0.0018447941,0.00024919285,0.0000031513396],"about_ca_topic_score_codex":0.021423317,"about_ca_topic_score_gemma":0.011250399,"teacher_disagreement_score":0.021423317,"about_ca_system_score_codex":0.0018523628,"about_ca_system_score_gemma":0.002834606,"threshold_uncertainty_score":0.042597234},"labels":[],"label_agreement":null},{"id":"W6947827468","doi":"10.4230/lipics.swat.2024.21","title":"Approximating Minimum Sum Coloring with Bundles","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Evolution and Paleontology Studies","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Graph coloring; Fractional coloring; Brooks' theorem; Chromatic scale; Bounded function; Graph; Edge coloring; Bundle","score_opus":0.01857988483805908,"score_gpt":0.23693530709057006,"score_spread":0.21835542225251098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947827468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14233223,0.0009457235,0.84209436,0.0006858911,0.00022838925,0.00010600453,0.0006628978,0.0033454741,0.00959899],"genre_scores_gemma":[0.70549273,0.00043090852,0.28617358,0.00032261526,0.00011124092,0.00013520723,0.0015837015,0.00077544374,0.004974513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870944,0.00035683383,0.000051230112,0.00031232488,0.00029202862,0.00027821568],"domain_scores_gemma":[0.9970498,0.0014119314,0.0002691531,0.0007541796,0.0002940312,0.00022079624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011105033,0.0014746204,0.0013324083,0.0007593666,0.0006951785,0.0014861037,0.0017078213,0.0010002027,0.0048232903],"category_scores_gemma":[0.0067429524,0.0005367955,0.0008106248,0.0018283215,0.00076180045,0.003094731,0.0012685655,0.0014509106,0.0012837113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009041064,0.00020909228,0.0027527486,0.0002951635,0.00009379069,0.0001878783,0.0002155597,0.841596,0.0063932342,0.038270075,0.013676327,0.09540604],"study_design_scores_gemma":[0.000020926494,0.000046666766,0.00016906428,0.000011023187,0.0000107875385,0.00005315208,0.000039961487,0.96881616,0.0010785523,0.02808226,0.0016655895,0.00000579463],"about_ca_topic_score_codex":0.003922514,"about_ca_topic_score_gemma":0.00522781,"teacher_disagreement_score":0.0048232903,"about_ca_system_score_codex":0.0020208114,"about_ca_system_score_gemma":0.0012627653,"threshold_uncertainty_score":0.016135514},"labels":[],"label_agreement":null},{"id":"W6947881571","doi":"10.4230/lipics.concur.2024.1","title":"Constrained Horn Clauses for Program Verification and Synthesis (Invited Talk)","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Horn clause; Satisfiability modulo theories; Satisfiability; Modular design; Functional verification; Formal verification; Fragment (logic); Model checking; Software verification; Boolean satisfiability problem","score_opus":0.022973149667059788,"score_gpt":0.27529304916189234,"score_spread":0.2523198994948326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947881571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032064202,0.034513567,0.91254616,0.006352331,0.003899062,0.000199902,0.000592585,0.0026903541,0.03599968],"genre_scores_gemma":[0.13063367,0.04077717,0.7440049,0.0062743383,0.006589547,0.001061232,0.0041218502,0.0029074277,0.06362982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979226,0.0006817254,0.00012043615,0.0004741442,0.0006469798,0.00015412291],"domain_scores_gemma":[0.9980263,0.0014572726,0.00007617895,0.00015163726,0.0002256662,0.00006292407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029166166,0.0014873169,0.0008957351,0.0012405094,0.0006129453,0.0026865387,0.0012828894,0.0016554468,0.029316125],"category_scores_gemma":[0.0057298252,0.0008445148,0.0012386929,0.00162962,0.0017263622,0.0039595966,0.0020902217,0.0028004262,0.007282401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000123044,0.000070070455,0.00021494749,0.000988041,0.00009218488,0.00021840718,0.000290519,0.0086695915,0.005145417,0.57440686,0.07450267,0.3352782],"study_design_scores_gemma":[0.000067597175,0.0000539165,0.00021506814,0.000407245,0.000055682453,0.00019971636,0.00006253064,0.02223685,0.004818276,0.6949199,0.2769146,0.000048617152],"about_ca_topic_score_codex":0.0012127033,"about_ca_topic_score_gemma":0.000882862,"teacher_disagreement_score":0.029316125,"about_ca_system_score_codex":0.0016801088,"about_ca_system_score_gemma":0.001195314,"threshold_uncertainty_score":0.09807223},"labels":[],"label_agreement":null},{"id":"W6947892631","doi":"10.4230/lipics.ccc.2025.28","title":"Provably Total Functions in the Polynomial Hierarchy","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Subterranean biodiversity and taxonomy","field":"Earth and Planetary Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Hierarchy; Proof complexity; Polynomial hierarchy; Verifiable secret sharing; Complexity class; Polynomial; Function (biology)","score_opus":0.01700601913867475,"score_gpt":0.21106625707578397,"score_spread":0.19406023793710922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947892631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10894112,0.003486839,0.81041914,0.0049409014,0.00013278853,0.00018605724,0.0009108472,0.001223583,0.06975876],"genre_scores_gemma":[0.79350656,0.0029154608,0.18389317,0.00108889,0.00039410853,0.00020951654,0.001161789,0.0003880295,0.016442528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965167,0.00076713425,0.00022475272,0.0007347015,0.0012551849,0.00050150184],"domain_scores_gemma":[0.9875271,0.009631396,0.00049407856,0.0012911366,0.00076973205,0.00028652945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026269534,0.0005298596,0.00072597887,0.0016358419,0.0014799837,0.004315612,0.001324198,0.0009183761,0.0056716558],"category_scores_gemma":[0.014059621,0.00065903465,0.0017861819,0.0017653166,0.003591133,0.009858752,0.002867978,0.0045010136,0.0007389343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003674065,0.000027408365,0.00039243244,0.00021704548,0.000022054366,0.000059651884,0.00038821,0.00801297,0.0011876399,0.9605625,0.0021815768,0.026911827],"study_design_scores_gemma":[0.000014920199,0.00001725641,0.00031326406,0.000040674357,0.000023283705,0.000085040985,0.00007317901,0.02187402,0.001175082,0.96858114,0.007785848,0.000016296337],"about_ca_topic_score_codex":0.0070816237,"about_ca_topic_score_gemma":0.005105955,"teacher_disagreement_score":0.0070816237,"about_ca_system_score_codex":0.0056111934,"about_ca_system_score_gemma":0.0025216558,"threshold_uncertainty_score":0.040712297},"labels":[],"label_agreement":null},{"id":"W6947905639","doi":"10.4230/oasics.evcs.2023.7","title":"Generating Software for Well-Understood Domains","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Software; Software development; Software construction; Traceability; Domain (mathematical analysis); Generative grammar; Software framework; Software system; Artifact (error)","score_opus":0.02883043313446245,"score_gpt":0.26353377811621864,"score_spread":0.23470334498175618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947905639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03457458,0.00017325884,0.9442705,0.00044831968,0.00008329215,0.00021865011,0.00054430804,0.013765158,0.005922026],"genre_scores_gemma":[0.1205315,0.00031929056,0.8657993,0.00015718977,0.00003072991,0.00020674702,0.0026263949,0.004713957,0.005614872],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988716,0.0002960724,0.00010127907,0.00025306022,0.00041425807,0.00006361013],"domain_scores_gemma":[0.99317145,0.0033387642,0.00033919307,0.002110685,0.0008939386,0.00014605703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024915151,0.0007581341,0.00040695365,0.0014323606,0.00059006445,0.002038588,0.0020322583,0.0011255693,0.0072000436],"category_scores_gemma":[0.010831398,0.0006730792,0.0019919057,0.0010084594,0.0010775088,0.002970702,0.0028149944,0.0015243276,0.0028889368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021601729,0.0004306087,0.017375672,0.0015031095,0.00020239642,0.0012771966,0.004564766,0.09122931,0.053482633,0.16566707,0.028017169,0.63603413],"study_design_scores_gemma":[0.00023614037,0.00025462598,0.003054836,0.00037696728,0.00017137107,0.0016815889,0.0012619281,0.49082467,0.10654093,0.1727603,0.22267638,0.00016029798],"about_ca_topic_score_codex":0.00077974563,"about_ca_topic_score_gemma":0.0014627702,"teacher_disagreement_score":0.0072000436,"about_ca_system_score_codex":0.0007401395,"about_ca_system_score_gemma":0.0011803056,"threshold_uncertainty_score":0.024086535},"labels":[],"label_agreement":null},{"id":"W6947952523","doi":"10.4230/oasics.fmbc.2024.9","title":"Securing Aptos Framework with Formal Verification","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Software security assurance; Formal verification; Computer security model; Formal methods; Scale (ratio)","score_opus":0.013448743047231815,"score_gpt":0.24694661888885255,"score_spread":0.23349787584162074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947952523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051482273,0.00013745957,0.9845301,0.00042940537,0.00010021095,0.00024235989,0.00022092598,0.005092511,0.004098898],"genre_scores_gemma":[0.24756452,0.0006356705,0.73986363,0.0005240237,0.00019564304,0.00092745747,0.0012188002,0.0020442456,0.007025995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98802364,0.0029974803,0.0010902042,0.0012321554,0.0057898494,0.00086661254],"domain_scores_gemma":[0.98871803,0.0051569273,0.00089357037,0.003103662,0.0018500921,0.0002777419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0106262,0.0008900902,0.00071537186,0.0014628111,0.0011809905,0.0044338303,0.0023543886,0.0013212248,0.006872283],"category_scores_gemma":[0.024609275,0.0009327057,0.0025714918,0.00061392493,0.0046697347,0.0054905377,0.005678121,0.0033319152,0.0024452298],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002146349,0.00012937927,0.0016778294,0.0005848783,0.00009682254,0.0009271092,0.0011906952,0.060346805,0.013574675,0.8356495,0.0072788517,0.07832873],"study_design_scores_gemma":[0.00021799933,0.000181744,0.0004901441,0.00039588567,0.00013111526,0.0006451523,0.000254239,0.30011126,0.030652676,0.532752,0.1340408,0.00012704275],"about_ca_topic_score_codex":0.0039021685,"about_ca_topic_score_gemma":0.0026620317,"teacher_disagreement_score":0.0106262,"about_ca_system_score_codex":0.0017214556,"about_ca_system_score_gemma":0.0058216457,"threshold_uncertainty_score":0.056197345},"labels":[],"label_agreement":null},{"id":"W6947980100","doi":"10.4230/lipics.cosit.2024.2","title":"A Salience-Based Framework for Terrain Modelling: From the Surface Network to Topo-Contexts","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Freshwater macroinvertebrate diversity and ecology","field":"Environmental Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Terrain; Landform; Thalweg; Context (archaeology); Ridge; Surface (topology); Raster graphics; Representation (politics)","score_opus":0.01848759906345466,"score_gpt":0.2391844336549695,"score_spread":0.22069683459151485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947980100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006679018,0.0005175064,0.9879582,0.0005050293,0.00004645411,0.000047450412,0.00021646777,0.00024289085,0.003787017],"genre_scores_gemma":[0.30259886,0.0014205141,0.6911559,0.00017732997,0.00018434845,0.0002530504,0.00072006724,0.00025365845,0.003236211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993624,0.00025667174,0.00003448424,0.00017514883,0.000118338816,0.00005310408],"domain_scores_gemma":[0.9991831,0.000373533,0.0000905373,0.00013869542,0.0001122996,0.000101747035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000797093,0.00090593233,0.0008190469,0.0030685791,0.00110245,0.0039462256,0.0022820495,0.0014323387,0.003492082],"category_scores_gemma":[0.0033958927,0.0006754015,0.0019923418,0.002810542,0.0036137288,0.0053290576,0.003124455,0.0020387133,0.0007155833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005939009,0.000033703353,0.0016544265,0.00018538753,0.00006741972,0.00042144078,0.0014633787,0.19987829,0.0024974197,0.7384722,0.0021876106,0.05307933],"study_design_scores_gemma":[0.000011264898,0.0000266171,0.0005649823,0.00007890606,0.000028855606,0.00013447729,0.0002952269,0.49400395,0.0004810061,0.488118,0.016227184,0.000029522407],"about_ca_topic_score_codex":0.013256974,"about_ca_topic_score_gemma":0.014449796,"teacher_disagreement_score":0.013256974,"about_ca_system_score_codex":0.001760567,"about_ca_system_score_gemma":0.0009573755,"threshold_uncertainty_score":0.026359618},"labels":[],"label_agreement":null},{"id":"W6947992690","doi":"10.4230/lipics.icalp.2025.20","title":"Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Approximation algorithm; Rounding; Graph; Set cover problem; Strength of a graph; Set (abstract data type); Graph theory; Connected dominating set; Network planning and design; Graph algorithms","score_opus":0.02941959307669111,"score_gpt":0.2704119662591975,"score_spread":0.24099237318250638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947992690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013154493,0.00076755387,0.97855765,0.00054875977,0.00009287762,0.0001012878,0.00023111097,0.0011285464,0.005417705],"genre_scores_gemma":[0.27673694,0.00078157,0.71544826,0.00038726843,0.00018711566,0.00046394055,0.0013038017,0.00036045891,0.004330594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997619,0.00067209447,0.000108814944,0.000479087,0.0006868382,0.000434251],"domain_scores_gemma":[0.99576277,0.0023955575,0.00034257065,0.0009003994,0.0004403055,0.00015850143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001959468,0.0022029914,0.0016082183,0.0016208552,0.0008694088,0.001808091,0.0038785841,0.0022977567,0.0062975064],"category_scores_gemma":[0.01006373,0.0010270277,0.0017621331,0.0038623891,0.0012552853,0.0045299153,0.0021197814,0.0035835155,0.0011227615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022705388,0.0001638882,0.0006006925,0.0001970849,0.000069886155,0.0000832025,0.00013552539,0.8582892,0.0014975552,0.045146585,0.0071618487,0.08642749],"study_design_scores_gemma":[0.000039448838,0.000031219042,0.00006670811,0.000013261046,0.0000127740195,0.000040610892,0.000018643375,0.9746361,0.00042725186,0.023022603,0.0016848149,0.00000663181],"about_ca_topic_score_codex":0.007715452,"about_ca_topic_score_gemma":0.008745335,"teacher_disagreement_score":0.007715452,"about_ca_system_score_codex":0.003488974,"about_ca_system_score_gemma":0.002327675,"threshold_uncertainty_score":0.02531439},"labels":[],"label_agreement":null},{"id":"W6948012238","doi":"10.4230/lipics.cp.2023.14","title":"Fast Matrix Multiplication Without Tears: A Constraint Programming Approach","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Evolution and Paleontology Studies","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Matrix multiplication; Multiplication (music); Matrix (chemical analysis); Correctness; Set (abstract data type); Simple (philosophy); Constraint satisfaction problem; Constraint programming; Constraint (computer-aided design)","score_opus":0.026217973178348966,"score_gpt":0.27583967758997346,"score_spread":0.2496217044116245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948012238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028766731,0.00013591052,0.99088204,0.0004939791,0.000050765135,0.00012021179,0.00018171583,0.00032812604,0.0049306722],"genre_scores_gemma":[0.063303046,0.000300394,0.9313747,0.0003229688,0.00008094223,0.00039204423,0.00036046954,0.00036986818,0.0034954937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586123,0.0013920967,0.00025764882,0.00076127046,0.001271578,0.00045622242],"domain_scores_gemma":[0.9888644,0.007872572,0.0006245131,0.001007457,0.001366491,0.00026450108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040595243,0.0020467094,0.0011661935,0.0010879822,0.0013208714,0.0032521696,0.0032007196,0.0016473276,0.013370098],"category_scores_gemma":[0.0176208,0.0012592654,0.0017869405,0.0022010596,0.00260414,0.0041972846,0.0031275842,0.005099908,0.0021924411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022671906,0.00019808517,0.00083076436,0.0006487955,0.00011339678,0.00041676837,0.00031820658,0.48657814,0.0052014557,0.3302474,0.012955952,0.16226426],"study_design_scores_gemma":[0.000044959863,0.00006603594,0.00008953163,0.00006880745,0.000020222835,0.00010210362,0.000074039526,0.8216082,0.002839863,0.16333692,0.011723786,0.000025631018],"about_ca_topic_score_codex":0.0065023783,"about_ca_topic_score_gemma":0.008353586,"teacher_disagreement_score":0.013370098,"about_ca_system_score_codex":0.0014439621,"about_ca_system_score_gemma":0.003464992,"threshold_uncertainty_score":0.044727445},"labels":[],"label_agreement":null},{"id":"W6948081770","doi":"10.4230/lipics.itc.2023.12","title":"Randomness Recoverable Secret Sharing Schemes","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Animal and Plant Science Education","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Cryptography; Cryptographic primitive; Secret sharing; Access structure; Encryption; Context (archaeology)","score_opus":0.046655546106840105,"score_gpt":0.33224128124430574,"score_spread":0.28558573513746566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948081770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10340448,0.0004819817,0.8824501,0.0011089761,0.00006172561,0.0003389781,0.00066619745,0.000836945,0.010650572],"genre_scores_gemma":[0.8542846,0.0005320329,0.13635716,0.00023929862,0.00010772054,0.00030407554,0.000518582,0.00008117009,0.007575379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945714,0.0015119002,0.00040414385,0.00095745677,0.001780647,0.000774427],"domain_scores_gemma":[0.9906882,0.0033538667,0.001406116,0.0036050314,0.0006017405,0.0003451064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035604532,0.0005696282,0.0012084047,0.0008576767,0.00115158,0.0021501633,0.0025978573,0.0015257233,0.0047640563],"category_scores_gemma":[0.009285298,0.00037581567,0.0014520875,0.0015569904,0.002412197,0.0067855665,0.0051650526,0.0027986958,0.0012117028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026787346,0.000080897684,0.00040949922,0.00015783719,0.000048205748,0.00012691504,0.00047382727,0.015922524,0.009394388,0.9394864,0.001066177,0.032565597],"study_design_scores_gemma":[0.000130812,0.00017891634,0.00040561694,0.00006364533,0.00007044312,0.00042381752,0.0001105918,0.12906343,0.020233886,0.83787906,0.011334101,0.0001057295],"about_ca_topic_score_codex":0.0003173747,"about_ca_topic_score_gemma":0.0002271826,"teacher_disagreement_score":0.0047640563,"about_ca_system_score_codex":0.0018353943,"about_ca_system_score_gemma":0.0019224113,"threshold_uncertainty_score":0.018829703},"labels":[],"label_agreement":null},{"id":"W6948095673","doi":"10.4230/dagrep.12.6","title":"Dagstuhl Reports, Volume 12, Issue 6, June 2022, Complete Issue","year":2023,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade do Porto; Università di Bologna; Universitetet i Bergen; Simon Fraser University; Aalto-Yliopisto; University of Sussex; London School of Economics and Political Science; University College London; University of Toronto; University of Cyprus; Institut national de recherche en informatique et en automatique (INRIA); University of Central Florida; Technische Universiteit Delft; Aarhus Universitet; Sorbonne Université; Microsoft Research","keywords":"Volume (thermodynamics); Term (time); Work (physics)","score_opus":0.011667609168178479,"score_gpt":0.24313989711971695,"score_spread":0.23147228795153849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948095673","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005905752,0.0036781535,0.0023156966,0.015943307,0.05835899,0.00043133137,0.05455031,0.009350204,0.85478145],"genre_scores_gemma":[0.000967505,0.0008925233,0.0006287515,0.0011432882,0.0014256377,0.00009712565,0.014109346,0.001634656,0.9791013],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99735665,0.00019827009,0.00014607924,0.00022932274,0.0017207804,0.00034893025],"domain_scores_gemma":[0.9935867,0.0006153997,0.00025352865,0.0006588293,0.0025511365,0.0023344264],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003400794,0.0021510618,0.0015432871,0.004796107,0.0023520219,0.012768116,0.0020918725,0.002782216,0.75479615],"category_scores_gemma":[0.0115731675,0.00096568366,0.0009752338,0.004563804,0.00078122347,0.0039605657,0.003413233,0.0030934687,0.8202389],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015799016,0.000012678846,0.00001909908,0.000033888024,0.0000011856033,0.0000068570776,0.0000028772668,0.000015888058,0.000056176876,0.0005003808,0.9901376,0.009197578],"study_design_scores_gemma":[0.000013223152,0.00000760022,0.00014281945,0.00002195873,0.0000018632495,0.000009711268,0.000009622599,0.00003464279,0.00011661709,0.0005306765,0.99910516,0.0000060841785],"about_ca_topic_score_codex":0.00883487,"about_ca_topic_score_gemma":0.014866205,"teacher_disagreement_score":0.75479615,"about_ca_system_score_codex":0.0035544506,"about_ca_system_score_gemma":0.006702095,"threshold_uncertainty_score":0.3497535},"labels":[],"label_agreement":null},{"id":"W6948107546","doi":"10.4230/lipics.ccc.2023.20","title":"Radical Sylvester-Gallai Theorem for Tuples of Quadratics","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Libraries and Information Services","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Codimension; Intersection theorem; Structured program theorem; Generalization; Dimension (graph theory); Polynomial ring; Quadratic equation; Representation theorem; Tuple","score_opus":0.04069580873162518,"score_gpt":0.2546487382397094,"score_spread":0.21395292950808423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948107546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28304395,0.0019830768,0.62020385,0.0014514715,0.0008424275,0.00015616785,0.00093517714,0.0005456008,0.09083823],"genre_scores_gemma":[0.8910265,0.0009812044,0.087387756,0.00048245292,0.000929058,0.000107492946,0.00075489894,0.00011619167,0.018214384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991566,0.00009165286,0.00004884914,0.00021488394,0.00031590502,0.0001721498],"domain_scores_gemma":[0.99873346,0.00034687665,0.00022205272,0.00020200996,0.00027390578,0.00022170824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001216279,0.0005168959,0.0006292801,0.0015092986,0.0014720522,0.0020837956,0.0006872978,0.00034674432,0.0074412054],"category_scores_gemma":[0.002042999,0.00028431215,0.0012021341,0.000997007,0.002334816,0.0036479936,0.0028041014,0.0021119155,0.0014306819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017714148,0.000013141422,0.0005780698,0.000034444893,0.0000058929613,0.00007953146,0.0003513481,0.00066196884,0.0015723603,0.9902838,0.0010199962,0.005381635],"study_design_scores_gemma":[0.00001617282,0.00007565587,0.0009694253,0.000019536743,0.000016180644,0.00028468104,0.00016843181,0.0072538476,0.003585086,0.96875876,0.018820306,0.000031946875],"about_ca_topic_score_codex":0.00067631225,"about_ca_topic_score_gemma":0.00045470198,"teacher_disagreement_score":0.0074412054,"about_ca_system_score_codex":0.0010431956,"about_ca_system_score_gemma":0.00054294517,"threshold_uncertainty_score":0.024893284},"labels":[],"label_agreement":null},{"id":"W6948520361","doi":"10.4230/lipics.ccc.2023.15","title":"Near-Optimal Set-Multilinear Formula Lower Bounds","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diptera species taxonomy and behavior","field":"Agricultural and Biological Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Iterated function; Upper and lower bounds; Polynomial; Algebraic number; Branching (polymer chemistry); Matrix multiplication; Field (mathematics)","score_opus":0.032328558713071935,"score_gpt":0.2576378728893339,"score_spread":0.22530931417626193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948520361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11326322,0.006695113,0.7876429,0.012763226,0.00088012614,0.00032626218,0.0020877125,0.007932059,0.06840934],"genre_scores_gemma":[0.65961343,0.0025652137,0.3092496,0.004698548,0.0015636501,0.0006277586,0.0027808046,0.0027482158,0.016152762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9858576,0.0019880652,0.00065869064,0.0028547181,0.0059913322,0.0026495482],"domain_scores_gemma":[0.9571487,0.02939889,0.0016646838,0.0075110467,0.0029084312,0.0013682364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054592383,0.0023981484,0.0022758977,0.0022364256,0.00219166,0.0070211017,0.00501565,0.0020181907,0.016780643],"category_scores_gemma":[0.040486827,0.0013807268,0.003252451,0.00266925,0.003368661,0.019597853,0.008677532,0.01232855,0.00436748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019031862,0.0006611863,0.0052895457,0.001654583,0.0002846048,0.00047078053,0.0010113261,0.07733434,0.029792186,0.68298155,0.033348255,0.16526851],"study_design_scores_gemma":[0.00013168866,0.00020311165,0.0006388361,0.0001547038,0.0002063273,0.00029876185,0.000122023346,0.21906096,0.012334474,0.7530608,0.013719121,0.00006909986],"about_ca_topic_score_codex":0.0018457491,"about_ca_topic_score_gemma":0.0033246344,"teacher_disagreement_score":0.016780643,"about_ca_system_score_codex":0.0050818883,"about_ca_system_score_gemma":0.003840604,"threshold_uncertainty_score":0.056136847},"labels":[],"label_agreement":null},{"id":"W6966298626","doi":"10.4230/lipics.approx/random.2024.67","title":"Explicit and Near-Optimal Construction of t-Rankwise Independent Permutations","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Permutation (music); Random permutation; Order (exchange); Set (abstract data type); Random variable; Upper and lower bounds","score_opus":0.01949977994498601,"score_gpt":0.29544373984220373,"score_spread":0.2759439598972177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966298626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16744033,0.00022024348,0.8081463,0.00055462116,0.00006620449,0.00017694783,0.000569035,0.00095228426,0.021873988],"genre_scores_gemma":[0.59707165,0.0002588416,0.38755956,0.00029607755,0.00009924736,0.00059976353,0.0011843583,0.00046692547,0.0124635855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979703,0.00066717854,0.00011102052,0.00047139736,0.00048762784,0.00029246637],"domain_scores_gemma":[0.99247265,0.0032034852,0.0005695622,0.0024512482,0.00061971054,0.00068335905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015681925,0.00061343855,0.00093636307,0.0009036413,0.001704191,0.0014521491,0.0014765096,0.0010321572,0.005270056],"category_scores_gemma":[0.007836138,0.0010098832,0.0012377318,0.0010187324,0.0017866351,0.0027383976,0.003304685,0.002467057,0.0014888728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036521797,0.0002721916,0.0037959989,0.0001906924,0.00006952428,0.0005811953,0.0008429453,0.04219275,0.03402115,0.81756216,0.009641093,0.09046506],"study_design_scores_gemma":[0.00010708498,0.00022073856,0.0016432762,0.00005454344,0.000060612634,0.000960661,0.00017611237,0.237528,0.02938854,0.7100048,0.019739976,0.00011564809],"about_ca_topic_score_codex":0.000394884,"about_ca_topic_score_gemma":0.00065955304,"teacher_disagreement_score":0.005270056,"about_ca_system_score_codex":0.0010593907,"about_ca_system_score_gemma":0.0012986759,"threshold_uncertainty_score":0.0176301},"labels":[],"label_agreement":null},{"id":"W6966428720","doi":"10.4230/artifacts.23555","title":"Travelling Salesperson Problem with Self Deleting Graphs","year":2024,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Code (set theory); Source code; Field (mathematics); Set (abstract data type)","score_opus":0.008824150382975711,"score_gpt":0.23078614731428884,"score_spread":0.22196199693131313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966428720","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014265072,0.0011725771,0.5596807,0.001867716,0.0006623077,0.00064993434,0.11960832,0.038994297,0.26309907],"genre_scores_gemma":[0.211567,0.001957623,0.464809,0.0006821483,0.00018987249,0.001781359,0.11945736,0.022713378,0.17684226],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981517,0.000021531952,0.000010893948,0.000038496593,0.00007301003,0.000040879997],"domain_scores_gemma":[0.9996989,0.00012513467,0.000016629672,0.000049589064,0.00008186052,0.000027825674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020982287,0.0010695502,0.00066201156,0.00078309135,0.0003594639,0.0010579948,0.001519658,0.0009738025,0.1889339],"category_scores_gemma":[0.0016153636,0.00053906895,0.00074462907,0.0013224398,0.00023866977,0.0014139256,0.00093987497,0.0010782162,0.041702345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011888027,0.0002730291,0.00071791,0.0008741535,0.000052878422,0.00028197456,0.00009981495,0.21840526,0.0014753066,0.1144645,0.5641703,0.099065945],"study_design_scores_gemma":[0.00022886747,0.000022439635,0.00041877766,0.00011127304,0.000022450358,0.0001755268,0.000056445744,0.6968405,0.0016485852,0.13281922,0.16762677,0.00002914714],"about_ca_topic_score_codex":0.009355187,"about_ca_topic_score_gemma":0.015026502,"teacher_disagreement_score":0.1889339,"about_ca_system_score_codex":0.0009761573,"about_ca_system_score_gemma":0.001421087,"threshold_uncertainty_score":0.6320468},"labels":[],"label_agreement":null},{"id":"W6966470547","doi":"10.4230/lipics.isaac.2024.20","title":"Revisit the Scheduling Problem with Calibrations","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stockpile; Scheduling (production processes); Schedule; Job shop scheduling; Calibration; Time complexity; Robot","score_opus":0.008909819028516699,"score_gpt":0.22157246137045863,"score_spread":0.21266264234194193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966470547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04252142,0.0024043364,0.9337538,0.0034435303,0.0008803562,0.00029201,0.0005862166,0.0005811218,0.015537211],"genre_scores_gemma":[0.61337334,0.0032667287,0.35570285,0.001174256,0.0016251664,0.0004721102,0.0011746256,0.0008296229,0.022381397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969958,0.0010544185,0.00016645437,0.00083835877,0.00042945586,0.00051553454],"domain_scores_gemma":[0.9955954,0.003006278,0.0004732989,0.00033963996,0.00033104417,0.00025442502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028079348,0.0021717998,0.0020471448,0.0008837824,0.001123802,0.0022068226,0.002498094,0.0022824393,0.008920822],"category_scores_gemma":[0.008732633,0.00097266666,0.0015893317,0.0022100105,0.0015741483,0.003895844,0.0016006907,0.004195487,0.0012906404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026219437,0.00018869381,0.0006377841,0.0005680843,0.00006684595,0.00035714108,0.00019693395,0.88614804,0.0027231744,0.058267556,0.00819302,0.04239054],"study_design_scores_gemma":[0.000058563943,0.0001135533,0.00026720922,0.00003684972,0.000023288638,0.00010026426,0.00006914055,0.9478728,0.00064661034,0.044975486,0.0058163083,0.000020032725],"about_ca_topic_score_codex":0.0075164903,"about_ca_topic_score_gemma":0.004775043,"teacher_disagreement_score":0.008920822,"about_ca_system_score_codex":0.002402556,"about_ca_system_score_gemma":0.0023883372,"threshold_uncertainty_score":0.029843092},"labels":[],"label_agreement":null},{"id":"W6966557460","doi":"10.4230/lipics.sand.2025.12","title":"Restless Exploration and Token Dissemination in Vertex-Permuted Temporal Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Security token; Graph; Vertex (graph theory); Class (philosophy); Topological graph theory; Graph property; Base (topology)","score_opus":0.013628539163856566,"score_gpt":0.27549746770986394,"score_spread":0.26186892854600735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966557460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10603928,0.0004320652,0.8854681,0.00079375674,0.000054859072,0.00011687463,0.00041765222,0.00045141834,0.006225873],"genre_scores_gemma":[0.87538236,0.0006402366,0.11685697,0.0001995364,0.00006829926,0.0001719088,0.0004826728,0.00015637107,0.006041817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881566,0.00046259208,0.00006616781,0.0002710475,0.0001797734,0.00020474163],"domain_scores_gemma":[0.9923962,0.0049875113,0.00088438764,0.0010444168,0.00034966617,0.00033777504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013823879,0.00054395886,0.00062379305,0.00069940183,0.0010838128,0.001494695,0.0013367878,0.0009786199,0.0026510493],"category_scores_gemma":[0.009412314,0.0003756353,0.0007648793,0.0013038403,0.0017037132,0.0053919097,0.0018270132,0.001244349,0.00029909777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068236765,0.000107555796,0.0013336409,0.0002565299,0.00006606154,0.0006391005,0.00067982863,0.41939387,0.008800921,0.5223587,0.004835471,0.04084592],"study_design_scores_gemma":[0.000056674293,0.00008827255,0.00032885274,0.000025006737,0.000034096327,0.00028470447,0.00019695511,0.6618344,0.0041473247,0.32687056,0.0061077033,0.00002538446],"about_ca_topic_score_codex":0.0019868673,"about_ca_topic_score_gemma":0.0017174174,"teacher_disagreement_score":0.0026510493,"about_ca_system_score_codex":0.0013734224,"about_ca_system_score_gemma":0.0009392577,"threshold_uncertainty_score":0.009964943},"labels":[],"label_agreement":null},{"id":"W6966632337","doi":"10.4230/lipics.sea.2023.19","title":"Exact and Approximate Range Mode Query Data Structures in Practice","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Range (aeronautics); Mode (computer interface); Range query (database); Space (punctuation); Data structure; Element (criminal law)","score_opus":0.03281440660623704,"score_gpt":0.3182803132095328,"score_spread":0.2854659066032958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966632337","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47982484,0.006968119,0.4523817,0.0063631227,0.00062733586,0.0011027816,0.0049211006,0.015781207,0.032029804],"genre_scores_gemma":[0.48133877,0.00093143084,0.5064047,0.0010727883,0.00015133509,0.00072789175,0.0047691986,0.0010637415,0.003540247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9697206,0.007864299,0.0027351673,0.0051691695,0.012016319,0.0024943484],"domain_scores_gemma":[0.93848115,0.033128213,0.002578692,0.020285472,0.0045389244,0.0009875752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009453237,0.0019752767,0.0023053566,0.0018046243,0.0019477385,0.0044267806,0.0049748146,0.004007481,0.009420867],"category_scores_gemma":[0.061072372,0.0012635263,0.0015795527,0.0061017307,0.0024580036,0.01771116,0.004572243,0.0037484374,0.0025030025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006486821,0.0044853524,0.016296921,0.0027297297,0.00047655002,0.0005770293,0.002229779,0.3256858,0.03178726,0.08614723,0.07593535,0.44716215],"study_design_scores_gemma":[0.0011329879,0.0013796781,0.00256493,0.00011740591,0.00012318017,0.00097519346,0.0014045069,0.86280984,0.016976953,0.090773985,0.021624468,0.000116866235],"about_ca_topic_score_codex":0.0063439785,"about_ca_topic_score_gemma":0.0065134335,"teacher_disagreement_score":0.009453237,"about_ca_system_score_codex":0.0034748574,"about_ca_system_score_gemma":0.0051122666,"threshold_uncertainty_score":0.04999411},"labels":[],"label_agreement":null},{"id":"W6966804948","doi":"10.4230/lipics.cosit.2024.30","title":"Wheelchair Users Navigational Behavior: Insights from Eye Movement Data and Environment Legibility (Short Paper)","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Rehabilitation; Centre de Géomatique du Québec","funders":"","keywords":"Legibility; Eye movement; Wheelchair; Cognition; Process (computing); Fixation (population genetics)","score_opus":0.022895423866908904,"score_gpt":0.2724276601275259,"score_spread":0.249532236260617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966804948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974498,0.00016774889,0.0014886148,0.000021010179,0.0000028464572,0.000013305175,0.00024126648,0.00003021645,0.00058527035],"genre_scores_gemma":[0.9982798,0.00014092695,0.0010610287,0.000011544898,0.000002988073,0.000013413241,0.00016604761,0.0000058627843,0.00031842414],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998522,0.000038536626,0.000015534133,0.000034656467,0.000038005695,0.000021109643],"domain_scores_gemma":[0.99899286,0.00037484686,0.00026629795,0.00006527119,0.00023332375,0.0000674917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002461521,0.000302287,0.0001983831,0.0007413727,0.00014520646,0.0005085754,0.00009929986,0.0002797713,0.0016899366],"category_scores_gemma":[0.0020617533,0.00009051659,0.00015242364,0.00038036468,0.00012868621,0.0004012088,0.0002913931,0.00015619818,0.00031522915],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001182763,0.000369383,0.6603098,0.0007494169,0.00020348902,0.0006883203,0.008915035,0.0008399277,0.19249862,0.00024722927,0.00097076036,0.13302526],"study_design_scores_gemma":[0.000006715354,0.00030075316,0.989956,0.000036951646,0.00004244502,0.00042484244,0.002273225,0.0012543112,0.004871758,0.000117712625,0.0006907174,0.0000245448],"about_ca_topic_score_codex":0.002913073,"about_ca_topic_score_gemma":0.004591215,"teacher_disagreement_score":0.002913073,"about_ca_system_score_codex":0.00009866642,"about_ca_system_score_gemma":0.000118943935,"threshold_uncertainty_score":0.0057922006},"labels":[],"label_agreement":null},{"id":"W6966805628","doi":"10.4230/darts.8.2.12","title":"REST: Integrating Term Rewriting with Program Verification (Artifact)","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Oral and Maxillofacial Pathology","field":"Dentistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Haskell; Rewriting; Artifact (error); Term (time); Functional programming; Scripting language; Rest (music); Code (set theory)","score_opus":0.018335155541670384,"score_gpt":0.2853478558821857,"score_spread":0.26701270034051533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966805628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017299855,0.00016150152,0.81056124,0.00018116194,0.00018103137,0.00020598112,0.0013353314,0.17750026,0.008143461],"genre_scores_gemma":[0.08247379,0.00054613076,0.80666625,0.00081531715,0.00026844902,0.00057745347,0.012158807,0.076927155,0.019566618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941123,0.0016400161,0.0006577194,0.0008572377,0.002420009,0.0003127303],"domain_scores_gemma":[0.99348253,0.0025075343,0.0002723657,0.0024403587,0.0011652941,0.00013185071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043166243,0.0013227031,0.0008669928,0.0015290276,0.0005983425,0.0028091206,0.0024588562,0.0008709793,0.025894353],"category_scores_gemma":[0.013336092,0.0013545486,0.0027901293,0.00077320286,0.0011463838,0.002860461,0.0041732397,0.0022015392,0.017355712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007083833,0.00033351738,0.0021526562,0.0015842008,0.00041675143,0.0012045328,0.0006675945,0.022257714,0.055705614,0.09517239,0.19042632,0.6293703],"study_design_scores_gemma":[0.00037991296,0.0005016267,0.0018393673,0.00052472233,0.0003335425,0.0019646646,0.000113051836,0.23164602,0.1396606,0.10953995,0.51317054,0.00032603968],"about_ca_topic_score_codex":0.00244414,"about_ca_topic_score_gemma":0.0028192326,"teacher_disagreement_score":0.025894353,"about_ca_system_score_codex":0.00080054614,"about_ca_system_score_gemma":0.0019097532,"threshold_uncertainty_score":0.08662522},"labels":[],"label_agreement":null},{"id":"W6966814896","doi":"10.4230/lipics.aofa.2024.2","title":"Enumeration and Succinct Encoding of AVL Trees","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enumeration; Tree (set theory); Class (philosophy); Node (physics); Encoding (memory); Variety (cybernetics); Upper and lower bounds; Constant (computer programming)","score_opus":0.01592361490010857,"score_gpt":0.25835598425096706,"score_spread":0.2424323693508585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966814896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118566774,0.00036161422,0.8642323,0.0011460594,0.00011559863,0.000099225974,0.0014953121,0.0022706587,0.011712486],"genre_scores_gemma":[0.65233207,0.00037039473,0.33602792,0.00046329622,0.000113690396,0.00033099885,0.0030338904,0.0006450205,0.0066827587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829024,0.00037861324,0.00014015427,0.00026012774,0.0006552877,0.0002755208],"domain_scores_gemma":[0.9928235,0.0028843416,0.00059596926,0.0026764872,0.0008131276,0.00020662931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011847804,0.0004266863,0.0006548146,0.0013277435,0.00077977544,0.0028465213,0.0017279538,0.00084826344,0.0040536085],"category_scores_gemma":[0.009143907,0.0005704383,0.00072244625,0.0021833146,0.0016854007,0.006773086,0.0032608714,0.0020889859,0.0012899179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034833798,0.00019295109,0.0018377239,0.00024399634,0.000021900463,0.00025914487,0.00073911075,0.058539465,0.025585147,0.75191844,0.009834553,0.15047929],"study_design_scores_gemma":[0.00005513782,0.00008522657,0.00035231697,0.000089609144,0.000024993056,0.00024496648,0.00017570354,0.31610873,0.026270403,0.64298177,0.013562625,0.00004853753],"about_ca_topic_score_codex":0.0008173204,"about_ca_topic_score_gemma":0.0016868399,"teacher_disagreement_score":0.0040536085,"about_ca_system_score_codex":0.001895698,"about_ca_system_score_gemma":0.0013119995,"threshold_uncertainty_score":0.013754308},"labels":[],"label_agreement":null},{"id":"W6966861328","doi":"10.4230/lipics.opodis.2024.5","title":"RMR-Efficient Detectable Objects for Persistent Memory and Their Applications","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Synchronization (alternating current); Process (computing); Multiprocessing; Reduction (mathematics); Blocking (statistics); Lock (firearm); Distributed shared memory; Shared memory","score_opus":0.008127687837484215,"score_gpt":0.2321173209926717,"score_spread":0.2239896331551875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966861328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021468323,0.000205344,0.9748377,0.0001451288,0.00002520109,0.00006889335,0.000028810015,0.0017812798,0.0014392463],"genre_scores_gemma":[0.38060874,0.00020687951,0.6142264,0.000106894164,0.000047647496,0.00027685546,0.00017728162,0.00051485316,0.0038344325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801993,0.00047654696,0.000121076126,0.0002740115,0.0008398224,0.00026856587],"domain_scores_gemma":[0.99644995,0.0012055789,0.00039846284,0.0014842621,0.00032712266,0.00013464002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020135918,0.0006187677,0.0007662975,0.00089653395,0.00094555784,0.0019528572,0.003002484,0.0011130908,0.0025302435],"category_scores_gemma":[0.005649795,0.0006383765,0.0007718013,0.0011820922,0.0022257948,0.0037635684,0.0042698337,0.0018527824,0.00076530466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000436294,0.00023461602,0.0015866386,0.00048740557,0.000040858275,0.00030205701,0.00059340906,0.08353957,0.045716934,0.635355,0.004022909,0.22768427],"study_design_scores_gemma":[0.00013171723,0.00041228443,0.00043157392,0.0000799962,0.000052336465,0.00036892705,0.00014403011,0.6791561,0.06273321,0.23288403,0.023528412,0.00007733131],"about_ca_topic_score_codex":0.00047974772,"about_ca_topic_score_gemma":0.0005297531,"teacher_disagreement_score":0.003002484,"about_ca_system_score_codex":0.0010392636,"about_ca_system_score_gemma":0.0013081272,"threshold_uncertainty_score":0.010649025},"labels":[],"label_agreement":null},{"id":"W6966867884","doi":"10.4230/lipics.itcs.2023.23","title":"On Low-End Obfuscation and Learning","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Obfuscation; Multilinear map; Cryptography; Class (philosophy); Simple (philosophy); Representation (politics); Context (archaeology); Learning with errors","score_opus":0.009901839214712521,"score_gpt":0.2411788112378562,"score_spread":0.23127697202314368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966867884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018075282,0.0039722486,0.9396573,0.0038773504,0.00021369156,0.00010153509,0.00018059998,0.0005860263,0.033336047],"genre_scores_gemma":[0.6376238,0.010361633,0.31816143,0.0035633235,0.0014754565,0.0007566298,0.00086443924,0.0005724372,0.026620852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99343735,0.002016697,0.00033981528,0.0014302761,0.0020479984,0.0007278931],"domain_scores_gemma":[0.9759127,0.017364215,0.0008456349,0.004680149,0.0008828511,0.0003144005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053154817,0.0021083641,0.001512638,0.0017944742,0.0018131532,0.0040804744,0.0021284362,0.0028720282,0.005972347],"category_scores_gemma":[0.015679045,0.00081715843,0.0018756337,0.0017075114,0.013596641,0.015446807,0.0070106937,0.012762166,0.001989223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010074675,0.000081489845,0.00035429795,0.00029798484,0.000029512621,0.00007707082,0.00015916549,0.015426326,0.0017182702,0.9428644,0.0016045539,0.037286133],"study_design_scores_gemma":[0.000014022624,0.00006176278,0.00014773848,0.000097477125,0.000016023185,0.00009660646,0.00002173804,0.031003004,0.003543104,0.96074057,0.0042336388,0.000024294935],"about_ca_topic_score_codex":0.00075115927,"about_ca_topic_score_gemma":0.00042037183,"teacher_disagreement_score":0.005972347,"about_ca_system_score_codex":0.0036780615,"about_ca_system_score_gemma":0.0016193034,"threshold_uncertainty_score":0.028111279},"labels":[],"label_agreement":null},{"id":"W6966981988","doi":"10.4230/lipics.cpm.2024.12","title":"Solving the Minimal Positional Substring Cover Problem in Sublinear Space","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genetic Associations and Epidemiology","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Università degli Studi di Milano-Bicocca; Israel Institute for Biological Research; Ministero dell’Istruzione, dell’Università e della Ricerca; National Institute of Allergy and Infectious Diseases; Natural Sciences and Engineering Research Council of Canada; European Commission; Dipartimenti di Eccellenza; National Institutes of Health; National Science Foundation","keywords":"Substring; Sublinear function; Computation; Set (abstract data type); Cover (algebra); Encoding (memory); Key (lock); Space (punctuation)","score_opus":0.010861251447455639,"score_gpt":0.26062918238207117,"score_spread":0.24976793093461552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966981988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11836291,0.002626569,0.8330965,0.005095142,0.00044807393,0.00032125448,0.00409124,0.018363427,0.017594904],"genre_scores_gemma":[0.25888258,0.00079454615,0.7183048,0.0010197579,0.00030345644,0.000520939,0.0071075247,0.002169654,0.010896631],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739563,0.0004913289,0.00018729418,0.00059076626,0.0009732163,0.00036180968],"domain_scores_gemma":[0.9928717,0.004752977,0.00035272533,0.0013757753,0.00048728808,0.00015958595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118661,0.0016918055,0.0014586778,0.0009985152,0.001010182,0.0026386508,0.0023279442,0.00159255,0.012533182],"category_scores_gemma":[0.008262895,0.0006817764,0.0020459655,0.0028930702,0.0012523683,0.0054612583,0.0028307335,0.002906778,0.005318553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019197781,0.00048688694,0.0040398794,0.0016857578,0.0002727349,0.000668257,0.0009945431,0.27637222,0.029166512,0.0572431,0.06698017,0.5601703],"study_design_scores_gemma":[0.00026827227,0.00017602938,0.0008404375,0.000056983587,0.000083281186,0.0003159772,0.00034058563,0.86390054,0.0101138605,0.11012506,0.013740126,0.000038860686],"about_ca_topic_score_codex":0.0065982803,"about_ca_topic_score_gemma":0.013227813,"teacher_disagreement_score":0.012533182,"about_ca_system_score_codex":0.001645629,"about_ca_system_score_gemma":0.0037227005,"threshold_uncertainty_score":0.041927695},"labels":[],"label_agreement":null},{"id":"W6967082722","doi":"10.4230/lipics.disc.2019.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Háskólinn í Reykjavík; Institute of Science and Technology Austria; Université Paris-Sud; Sorbonne Université; University of Waterloo; Szegedi Tudományegyetem; Augusta University; École Polytechnique Fédérale de Lausanne; Universität Hamburg; King's College London; Universität Salzburg; Helsingin Yliopisto; Ben-Gurion University of the Negev; Université Paris Diderot","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.023233327862266905,"score_gpt":0.19375407058889021,"score_spread":0.17052074272662332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967082722","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067610986,0.004922584,0.001628687,0.016895866,0.2735034,0.0007915675,0.007461627,0.0019882456,0.69213194],"genre_scores_gemma":[0.0017804939,0.0022888193,0.00053019664,0.0020436137,0.046042062,0.00025978833,0.002689543,0.0008308067,0.94353473],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920005,0.000051471594,0.00007753952,0.00015314411,0.0003859869,0.00013183062],"domain_scores_gemma":[0.9948462,0.0004304737,0.00024606174,0.00024773894,0.0021223219,0.0021070624],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012407327,0.0015321398,0.001460696,0.0022498854,0.0017637468,0.00955351,0.0015171972,0.0030825431,0.8443727],"category_scores_gemma":[0.005803291,0.00055567775,0.00082366826,0.0016842441,0.00047461715,0.0037640906,0.0017951014,0.0026766823,0.83924526],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003846217,0.00003550679,0.000051557927,0.0001576352,0.000002218442,0.00002148635,0.0000042402526,0.000039074417,0.00023497298,0.0003808874,0.96378034,0.035253607],"study_design_scores_gemma":[0.000031823016,0.000034013105,0.0005712576,0.00016089091,0.0000035413273,0.000054189022,0.00003640425,0.00012947553,0.00018515182,0.00081359927,0.9979672,0.000012362238],"about_ca_topic_score_codex":0.0011848316,"about_ca_topic_score_gemma":0.0023193085,"teacher_disagreement_score":0.8443727,"about_ca_system_score_codex":0.0014316665,"about_ca_system_score_gemma":0.001967975,"threshold_uncertainty_score":0.22198349},"labels":[],"label_agreement":null},{"id":"W6967083426","doi":"10.4230/lipics.ecoop.2020.3","title":"Blame for Null","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Blame; Java; Type (biology); Slogan; Semantics (computer science); Calculus (dental)","score_opus":0.030360240855390904,"score_gpt":0.25382819809362883,"score_spread":0.22346795723823792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967083426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008127636,0.0016264822,0.8818669,0.011827609,0.0039350293,0.00019131885,0.0010592502,0.016512569,0.07485322],"genre_scores_gemma":[0.28402293,0.0023142311,0.55622286,0.014897304,0.0021497074,0.0006277937,0.0018630702,0.023873124,0.114029005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937888,0.0014513716,0.0004099542,0.0012897139,0.0023098928,0.00075032195],"domain_scores_gemma":[0.9870422,0.0047297813,0.00064469624,0.004078894,0.0030117899,0.00049265905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00684044,0.001109836,0.0011382223,0.0020038853,0.004562407,0.0056293225,0.0027065615,0.003357362,0.027155234],"category_scores_gemma":[0.021675058,0.00125102,0.0028954176,0.001093185,0.008473521,0.015282762,0.007405544,0.008406457,0.009361336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059583,0.000021472086,0.0006628034,0.0001593367,0.000020248463,0.00020143083,0.00091348053,0.0005695636,0.0012676187,0.95360506,0.023320615,0.019198865],"study_design_scores_gemma":[0.000023802051,0.000036291476,0.0002893518,0.00021640654,0.000048176018,0.0004954041,0.00025113666,0.0042536603,0.0059978906,0.5400499,0.44824192,0.000096015814],"about_ca_topic_score_codex":0.0054956744,"about_ca_topic_score_gemma":0.005459391,"teacher_disagreement_score":0.027155234,"about_ca_system_score_codex":0.0028764738,"about_ca_system_score_gemma":0.0047354745,"threshold_uncertainty_score":0.09084326},"labels":[],"label_agreement":null},{"id":"W6967393897","doi":"10.4230/lipics.approx/random.2024.36","title":"On the Houdré-Tetali Conjecture About an Isoperimetric Constant of Graphs","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Isoperimetric inequality; Conjecture; Counterexample; Constant (computer programming); Logarithm; Eigenvalues and eigenvectors","score_opus":0.038046834047651995,"score_gpt":0.3205532384181279,"score_spread":0.2825064043704759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967393897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6026363,0.0036240697,0.2192939,0.020376058,0.00070587295,0.00010065227,0.00055212446,0.0008324849,0.15187857],"genre_scores_gemma":[0.96803844,0.0012746868,0.018988807,0.001958917,0.0008363069,0.00011330797,0.00027120087,0.00024979573,0.008268517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973373,0.0005855027,0.000100777776,0.00080284395,0.0007652828,0.00040825998],"domain_scores_gemma":[0.964648,0.027119566,0.0017342503,0.0029961357,0.0016997997,0.0018021539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031067745,0.0008879208,0.001002918,0.0032666575,0.0023699033,0.0038946208,0.0022828465,0.0025606505,0.008083033],"category_scores_gemma":[0.035624065,0.0007586227,0.00103698,0.0026040236,0.0067044096,0.011709448,0.0038806335,0.006367902,0.0012713748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014203919,0.000048900678,0.0014210099,0.000104332285,0.000016948543,0.00012061219,0.00042108912,0.0045440886,0.0027877877,0.974797,0.004679871,0.010916307],"study_design_scores_gemma":[0.000032120155,0.000032119544,0.0013507353,0.000034472258,0.000016026272,0.00022741624,0.00017390243,0.023348127,0.0017506139,0.96913034,0.0038701023,0.000034004162],"about_ca_topic_score_codex":0.0018380824,"about_ca_topic_score_gemma":0.00080882857,"teacher_disagreement_score":0.008083033,"about_ca_system_score_codex":0.0023955295,"about_ca_system_score_gemma":0.0005073966,"threshold_uncertainty_score":0.027040482},"labels":[],"label_agreement":null},{"id":"W6967458180","doi":"10.4230/lipics.approx/random.2023.14","title":"Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Steiner tree problem; Partition (number theory); Constant (computer programming); Randomized algorithm; Generalization; Approximation algorithm; Graph; Set (abstract data type); Network planning and design; Undirected graph","score_opus":0.0399989508806633,"score_gpt":0.2908798143270963,"score_spread":0.250880863446433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967458180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025419584,0.00086799084,0.9543445,0.0012729063,0.00013783535,0.00041155177,0.00080040004,0.0019565998,0.0147887105],"genre_scores_gemma":[0.24992959,0.00086148526,0.73543286,0.0004895178,0.00014515994,0.0009112076,0.0019878559,0.00055636384,0.009685972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828917,0.00044210217,0.000094719304,0.0005606317,0.00036245512,0.0002508528],"domain_scores_gemma":[0.99736744,0.0015752652,0.0002463019,0.00055725686,0.00015701851,0.000096622796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013657205,0.0018210158,0.0012525247,0.0009535771,0.0010450707,0.002218408,0.0029873264,0.0019061374,0.013735484],"category_scores_gemma":[0.005786506,0.0011116168,0.0017061651,0.0023422719,0.0012880475,0.0049464814,0.002311656,0.0023420178,0.0019415248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039561902,0.00027416524,0.0007198941,0.0008166544,0.00011999092,0.00016243676,0.0002450989,0.6053223,0.0030186852,0.19376735,0.0225737,0.17258404],"study_design_scores_gemma":[0.00019662699,0.00007415747,0.00017556897,0.00006483742,0.000038132024,0.00012516968,0.00005896998,0.7265521,0.0011984941,0.26299357,0.008499606,0.000022852553],"about_ca_topic_score_codex":0.0035787956,"about_ca_topic_score_gemma":0.0059267106,"teacher_disagreement_score":0.013735484,"about_ca_system_score_codex":0.0033102413,"about_ca_system_score_gemma":0.0026616089,"threshold_uncertainty_score":0.045949757},"labels":[],"label_agreement":null},{"id":"W7076650340","doi":"10.4230/lipics.dna.31.2","title":"A Coupled Reconfiguration Mechanism That Enables Powerful, Pseudoknot-Robust DNA Strand Displacement Devices with 2-Stranded Inputs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"DNA; Control reconfiguration; Set (abstract data type); Abstraction; Displacement (psychology); Mechanism (biology); Double strand; DNA computing","score_opus":0.014497686267377193,"score_gpt":0.22739219413989512,"score_spread":0.21289450787251793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7076650340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60630995,0.0030708949,0.3460203,0.00076461094,0.0011849294,0.00025508006,0.00029174163,0.0044707977,0.0376317],"genre_scores_gemma":[0.9612127,0.00041057242,0.03289537,0.00023258915,0.000040096515,0.00009403951,0.000079146776,0.00007669976,0.0049587586],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997136,0.000030312305,0.000020579319,0.00009388536,0.00009425427,0.000047262132],"domain_scores_gemma":[0.9997453,0.00006319472,0.000057808353,0.00006048167,0.000027762078,0.000045467383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019898893,0.00041384736,0.00032285086,0.0002883927,0.00022566192,0.0005950505,0.000881896,0.000527706,0.0026665563],"category_scores_gemma":[0.0005865375,0.0003098356,0.00034577085,0.00022884594,0.00054507836,0.0008219535,0.00086190243,0.00047259126,0.00061084493],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022158265,0.00009078345,0.00031198972,0.00029947498,0.00004939865,0.0005140761,0.00016691152,0.011792956,0.89972156,0.03830042,0.0014716551,0.047059182],"study_design_scores_gemma":[0.00014689159,0.0007963096,0.0010240007,0.0000458638,0.00006709184,0.0010376994,0.000054977387,0.15389773,0.7882046,0.013598549,0.0409742,0.00015209217],"about_ca_topic_score_codex":0.00019872727,"about_ca_topic_score_gemma":0.0003267484,"teacher_disagreement_score":0.0026665563,"about_ca_system_score_codex":0.00028037213,"about_ca_system_score_gemma":0.00012838947,"threshold_uncertainty_score":0.00892055},"labels":[],"label_agreement":null},{"id":"W7078732059","doi":"10.4230/lipics.wads.2025.23","title":"Novel Complexity Results for Temporal Separators with Deadlines","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Bounded function; Vertex (graph theory); Separator (oil production); Time complexity; Dominating set; Treewidth; Pathwidth","score_opus":0.03046444565270152,"score_gpt":0.27609433348599827,"score_spread":0.24562988783329676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7078732059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067994446,0.0016012338,0.9046977,0.0041432204,0.0003073302,0.00029176098,0.0017723646,0.0023879139,0.01680396],"genre_scores_gemma":[0.4825887,0.0015275892,0.49229458,0.0012010081,0.0007546291,0.0005902832,0.0038622878,0.001305201,0.015875733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953838,0.00074804714,0.00027510067,0.0012573561,0.0012888152,0.0010468679],"domain_scores_gemma":[0.98550177,0.009746311,0.0013289853,0.0019331996,0.00079134584,0.0006984152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031451883,0.0022367225,0.0015997613,0.0014988155,0.0014726395,0.00483744,0.0047182795,0.0021285992,0.015377415],"category_scores_gemma":[0.015011497,0.0009932346,0.0034715086,0.0025854327,0.0020386502,0.011805214,0.004942413,0.006338934,0.001841956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018413167,0.0007566631,0.0035175357,0.0015093382,0.00032477066,0.0005532171,0.00090155157,0.53131855,0.016071497,0.29066995,0.025680322,0.1268553],"study_design_scores_gemma":[0.00013245051,0.00012974582,0.00047422608,0.000061757666,0.00009198514,0.00026282892,0.00014640369,0.7938121,0.0034600964,0.1942398,0.007157934,0.000030687355],"about_ca_topic_score_codex":0.004417751,"about_ca_topic_score_gemma":0.0046412973,"teacher_disagreement_score":0.015377415,"about_ca_system_score_codex":0.004528421,"about_ca_system_score_gemma":0.0033390867,"threshold_uncertainty_score":0.051442564},"labels":[],"label_agreement":null},{"id":"W7078734648","doi":"10.4230/lipics.wads.2025.35","title":"Succinct Data Structures for Chordal Graph with Bounded Leafage or Vertex Leafage","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Bounded function; Vertex (graph theory); Interval graph; Upper and lower bounds; Treewidth; Graph","score_opus":0.026244362606584568,"score_gpt":0.277984685696413,"score_spread":0.2517403230898284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7078734648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030435745,0.002180642,0.93626547,0.003962849,0.00078714435,0.0006286942,0.004789778,0.009511282,0.011438376],"genre_scores_gemma":[0.39988318,0.0020566247,0.56214195,0.00475943,0.00074398046,0.0013117422,0.013086239,0.002557522,0.013459329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99423486,0.00072448683,0.0006630706,0.0008931619,0.002840805,0.0006436355],"domain_scores_gemma":[0.96839887,0.006905453,0.0018463733,0.018629989,0.003581299,0.0006380582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026576663,0.0014925409,0.002048162,0.0022428243,0.0016808282,0.003454323,0.0047142664,0.0015650726,0.0120620895],"category_scores_gemma":[0.021959618,0.0011369258,0.0016233766,0.0042575635,0.0022953541,0.020967554,0.007328875,0.0054266886,0.0049767694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021684382,0.0006258179,0.0038780547,0.0014692451,0.0001638865,0.0004716642,0.00097237393,0.05260646,0.030953443,0.42273468,0.085196234,0.39875975],"study_design_scores_gemma":[0.0003987625,0.00089496776,0.0009961171,0.00046672797,0.00021553176,0.0010188551,0.0005114988,0.23119414,0.06425265,0.5847478,0.114999704,0.00030327457],"about_ca_topic_score_codex":0.002973299,"about_ca_topic_score_gemma":0.0049421764,"teacher_disagreement_score":0.0120620895,"about_ca_system_score_codex":0.0034078783,"about_ca_system_score_gemma":0.0038101098,"threshold_uncertainty_score":0.04035175},"labels":[],"label_agreement":null},{"id":"W7081624911","doi":"10.4230/lipics.approx/random.2025.29","title":"A Simplified Reduction for Error Correcting Matrix Multiplication Algorithms","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matrix multiplication; Matrix (chemical analysis); Reduction (mathematics); Fraction (chemistry); Simple (philosophy); DFT matrix; Prime (order theory); Product (mathematics); Multiplication (music)","score_opus":0.019861532557185178,"score_gpt":0.3007861290329098,"score_spread":0.2809245964757246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081624911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034323197,0.0004028584,0.95247257,0.0008350429,0.00022174028,0.00017159764,0.00027586104,0.003204917,0.00809214],"genre_scores_gemma":[0.43212348,0.00038653988,0.55148613,0.0005782515,0.00044457128,0.00033028534,0.0009548496,0.0010362427,0.012659683],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931306,0.00112509,0.0003459198,0.000933788,0.003603902,0.00086063886],"domain_scores_gemma":[0.9886748,0.0041246335,0.00045650284,0.00484159,0.0016910268,0.00021151328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019684865,0.0013490398,0.0012400356,0.0010892235,0.0014162827,0.0021709804,0.0027796202,0.0013535377,0.004794896],"category_scores_gemma":[0.014294721,0.00060116546,0.0014655741,0.0015735114,0.0019035474,0.0039874082,0.0028479425,0.0038456917,0.0027816643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012041505,0.0004284099,0.0013898312,0.00055573997,0.00014576122,0.0005363729,0.00073480944,0.29453796,0.04157892,0.2813627,0.024329323,0.353196],"study_design_scores_gemma":[0.0001258615,0.00023411721,0.00031616873,0.000056161716,0.00008294387,0.00046749506,0.00008218452,0.6965963,0.0344599,0.2529545,0.014562013,0.00006235452],"about_ca_topic_score_codex":0.0024269728,"about_ca_topic_score_gemma":0.0022505415,"teacher_disagreement_score":0.004794896,"about_ca_system_score_codex":0.0018059158,"about_ca_system_score_gemma":0.0025330298,"threshold_uncertainty_score":0.016040504},"labels":[],"label_agreement":null},{"id":"W7081631891","doi":"10.4230/lipics.approx/random.2025.58","title":"Equality Is Far Weaker Than Constant-Cost Communication","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Protocol (science); Communications protocol; Randomized response; Randomized algorithm; Key (lock)","score_opus":0.02211886976845145,"score_gpt":0.2782121212068231,"score_spread":0.25609325143837164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081631891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13478029,0.002302915,0.68929154,0.032236755,0.0008926234,0.00036496946,0.001526669,0.0022776076,0.13632661],"genre_scores_gemma":[0.88912094,0.0014008639,0.07459153,0.006019978,0.0008242667,0.0006438559,0.0009573865,0.00094135565,0.025499716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9753552,0.0068740863,0.0015263377,0.0068465066,0.0058630793,0.0035347766],"domain_scores_gemma":[0.9018986,0.0694014,0.004044359,0.019364664,0.0031887118,0.0021021988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008204217,0.0012194709,0.0029623148,0.00097120134,0.0042719464,0.006740305,0.005301231,0.0057970523,0.021833658],"category_scores_gemma":[0.05451531,0.0015815211,0.002726428,0.0017311597,0.010668006,0.03446499,0.012423182,0.013855691,0.0044299928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044352753,0.000119808705,0.0005841123,0.0005728217,0.00005599732,0.00014590655,0.0003146647,0.011363676,0.0038346136,0.95984733,0.0065995604,0.016117971],"study_design_scores_gemma":[0.000094146926,0.00010697024,0.0003263704,0.000071846014,0.000062968575,0.00025447807,0.00013645829,0.037635047,0.0051252567,0.94760823,0.00852177,0.000056369572],"about_ca_topic_score_codex":0.0018916262,"about_ca_topic_score_gemma":0.0012353108,"teacher_disagreement_score":0.021833658,"about_ca_system_score_codex":0.0040770266,"about_ca_system_score_gemma":0.0034783946,"threshold_uncertainty_score":0.07304084},"labels":[],"label_agreement":null},{"id":"W7081637209","doi":"10.4230/lipics.approx/random.2025.14","title":"Improved Lower Bounds on Multiflow-Multicut Gaps","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Class (philosophy); Planar; Set (abstract data type); Value (mathematics); Maximum flow problem","score_opus":0.008668657313475093,"score_gpt":0.2444832486576264,"score_spread":0.2358145913441513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081637209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12479017,0.02267772,0.7359476,0.008522685,0.0011414912,0.0003946562,0.004416683,0.0035742687,0.09853476],"genre_scores_gemma":[0.72042805,0.009369965,0.24139847,0.0028740296,0.0018773074,0.00086439773,0.0036972724,0.0023116372,0.017178899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932227,0.0011570136,0.00022476389,0.0015143629,0.0019751072,0.0019061255],"domain_scores_gemma":[0.97203034,0.020841423,0.0016194138,0.0024612495,0.0016090657,0.0014385587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050587095,0.0037419011,0.0034945651,0.0046168286,0.0026505461,0.005725155,0.007170928,0.0031623107,0.018161967],"category_scores_gemma":[0.028184772,0.0014974609,0.003078765,0.004432755,0.0030635989,0.014248099,0.008314449,0.009685416,0.0031687717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018591931,0.00073034526,0.0045386045,0.0025293997,0.00031236804,0.0007007701,0.0009760753,0.24932908,0.014261817,0.52439284,0.050912924,0.14945662],"study_design_scores_gemma":[0.00011990186,0.00029914654,0.0017261687,0.0004993037,0.00021272122,0.0008796716,0.00036374183,0.40571287,0.008676163,0.55526865,0.026130991,0.00011071853],"about_ca_topic_score_codex":0.001891124,"about_ca_topic_score_gemma":0.0024972777,"teacher_disagreement_score":0.018161967,"about_ca_system_score_codex":0.004483334,"about_ca_system_score_gemma":0.001919011,"threshold_uncertainty_score":0.060757875},"labels":[],"label_agreement":null},{"id":"W7082444139","doi":"10.4230/oasics.spacechi.2025.20","title":"Navigating Exoplanetary Systems in Augmented Reality: Preliminary Insights on ExoAR","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Exoplanet; Visualization; Curiosity; Limiting; Space exploration; Data visualization; Kepler; Augmented reality","score_opus":0.01646173903099922,"score_gpt":0.26373281318009184,"score_spread":0.2472710741490926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7082444139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92451876,0.0010034075,0.055387717,0.0007002784,0.00004718112,0.00029095332,0.000530379,0.000688853,0.016832497],"genre_scores_gemma":[0.9422569,0.0010923856,0.0499096,0.00019096892,0.000028185143,0.00016489875,0.00045335203,0.0001841418,0.0057195527],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991886,0.0003802242,0.000042322183,0.00012183598,0.00016768849,0.000099343895],"domain_scores_gemma":[0.99672514,0.00242669,0.00011648273,0.00021762274,0.00039581716,0.00011839912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017845036,0.00061704946,0.00035313753,0.00045837997,0.00043089132,0.001395513,0.00062958634,0.0005882798,0.0060665663],"category_scores_gemma":[0.004889274,0.00026742747,0.0005096394,0.00032545417,0.0007701211,0.0022860419,0.0016576881,0.0006319417,0.0007244912],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029337588,0.0021482022,0.06121469,0.0049931076,0.00019441538,0.005240428,0.24575295,0.012857428,0.18322463,0.010088132,0.00882867,0.46252352],"study_design_scores_gemma":[0.00042083577,0.015662089,0.26596376,0.002483219,0.00081447745,0.008648766,0.19290978,0.122457065,0.11818305,0.010277232,0.26132753,0.0008521986],"about_ca_topic_score_codex":0.0020065678,"about_ca_topic_score_gemma":0.004265074,"teacher_disagreement_score":0.0060665663,"about_ca_system_score_codex":0.00025227692,"about_ca_system_score_gemma":0.00031033673,"threshold_uncertainty_score":0.020294666},"labels":[],"label_agreement":null},{"id":"W7084387776","doi":"10.4230/artifacts.24666","title":"KaMinPar","year":2025,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Bacterial Genetics and Biotechnology","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Partition (number theory); Speedup; Graph; Graph partition","score_opus":0.005440651133032692,"score_gpt":0.23423479217040824,"score_spread":0.22879414103737555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084387776","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028604154,0.0016378555,0.5895547,0.0011071838,0.00041855327,0.0004778422,0.010852093,0.16303767,0.20430988],"genre_scores_gemma":[0.20702375,0.0015521694,0.6193229,0.0011146646,0.00016776023,0.00086885534,0.036585927,0.03396115,0.09940281],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995975,0.00005321229,0.000015040741,0.00014053387,0.00011619563,0.000077586184],"domain_scores_gemma":[0.99956816,0.00012707723,0.000027852566,0.00015667391,0.0000775757,0.00004257963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004364097,0.0017306661,0.0008462552,0.0011029856,0.0010663957,0.0018228333,0.002063956,0.0010882118,0.05322435],"category_scores_gemma":[0.0022098622,0.00063028425,0.00090940035,0.001092955,0.0005735773,0.0027794722,0.0022237287,0.0012480916,0.027528856],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008474159,0.0003684138,0.0017108365,0.0017924882,0.00018263095,0.00028533122,0.00027427502,0.04857785,0.030668259,0.11251963,0.38262188,0.420151],"study_design_scores_gemma":[0.0003575692,0.00024260157,0.0011027249,0.00017919308,0.00009336815,0.0006627493,0.0002218898,0.39752686,0.044418313,0.12053072,0.43457016,0.0000938836],"about_ca_topic_score_codex":0.001375931,"about_ca_topic_score_gemma":0.0036155547,"teacher_disagreement_score":0.05322435,"about_ca_system_score_codex":0.00081016193,"about_ca_system_score_gemma":0.0009533755,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W7084402895","doi":"10.4230/lipics.esa.2025.38","title":"Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Plasmonic and Surface Plasmon Research","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tuple; Function (biology); Graph; Enhanced Data Rates for GSM Evolution; Undirected graph; Decomposition; Topology (electrical circuits); Connectivity","score_opus":0.01396891266407011,"score_gpt":0.271548692569085,"score_spread":0.25757977990501485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084402895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008004262,0.00022908101,0.9879902,0.00022032941,0.000030275323,0.0000433111,0.000106531945,0.0003005168,0.003075375],"genre_scores_gemma":[0.4988047,0.00077783584,0.49405438,0.0004916756,0.00010227722,0.00038713706,0.00080915616,0.00034911686,0.004223642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726886,0.0009639674,0.00010406281,0.00056803663,0.0007840722,0.00031106165],"domain_scores_gemma":[0.99548435,0.002622864,0.0004687561,0.0006417685,0.00048860715,0.0002937264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003466623,0.0022380906,0.0013697343,0.0008751792,0.00062121014,0.0017644496,0.0019328707,0.0013302541,0.0050235735],"category_scores_gemma":[0.010809088,0.0011501614,0.0014223041,0.0012142631,0.0014325891,0.0038467643,0.0026690315,0.003194303,0.0007342006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023398675,0.00012888228,0.00041831323,0.00030045555,0.00009002945,0.000117700365,0.00016674568,0.7653931,0.0057798396,0.18620889,0.0046242485,0.036537863],"study_design_scores_gemma":[0.000031725653,0.00011506745,0.000070196256,0.000031808235,0.000019186396,0.000062746854,0.000025118628,0.89677566,0.00094941707,0.09994923,0.0019609255,0.000008939027],"about_ca_topic_score_codex":0.0015742225,"about_ca_topic_score_gemma":0.002174897,"teacher_disagreement_score":0.0050235735,"about_ca_system_score_codex":0.001894531,"about_ca_system_score_gemma":0.0016141635,"threshold_uncertainty_score":0.018333435},"labels":[],"label_agreement":null},{"id":"W7106788651","doi":"10.4230/lipics.gd.2025","title":"LIPIcs, Volume 357, GD 2025, Complete Volume","year":2025,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"","score_opus":0.018163559139602464,"score_gpt":0.2640134278780731,"score_spread":0.24584986873847062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106788651","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052824186,0.0023546184,0.010453301,0.0013739758,0.003975384,0.00015127586,0.020884072,0.010959003,0.9493201],"genre_scores_gemma":[0.0015932821,0.0013516645,0.0033589758,0.00033485936,0.0006028952,0.000089337474,0.013960767,0.006668012,0.9720401],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903345,0.000065082895,0.000045941084,0.00016072417,0.0006047911,0.000090059264],"domain_scores_gemma":[0.9991824,0.00013150282,0.00003772847,0.000121521916,0.000271192,0.0002555573],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00073959975,0.0025447938,0.0014438624,0.003955137,0.0011192668,0.007522779,0.0018751222,0.0015861425,0.700886],"category_scores_gemma":[0.0034043675,0.0007648264,0.00077617134,0.0036387534,0.0007216907,0.0052281544,0.0028820594,0.0021319634,0.69584006],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000346278,0.000015741896,0.000026632677,0.0001463013,0.000003736369,0.000010554327,0.000010247883,0.00019726667,0.00058920536,0.005758471,0.95034003,0.042867143],"study_design_scores_gemma":[0.0000104417895,0.000009559873,0.00010567833,0.00005683482,0.0000033667525,0.00003315762,0.000016504657,0.00032932972,0.0005646746,0.005281224,0.9935812,0.000008183819],"about_ca_topic_score_codex":0.004541759,"about_ca_topic_score_gemma":0.0075115724,"teacher_disagreement_score":0.299114,"about_ca_system_score_codex":0.0025248218,"about_ca_system_score_gemma":0.002318414,"threshold_uncertainty_score":0.4266498},"labels":[],"label_agreement":null},{"id":"W7106804950","doi":"10.4230/lipics.gd.2025.34","title":"Layered Polyline Drawings of Planar Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Planar; Book embedding; Planar graph; Planar straight-line graph; Graph; Vertex (graph theory); Outerplanar graph","score_opus":0.00862720144262005,"score_gpt":0.2555538395783557,"score_spread":0.24692663813573565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106804950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0507583,0.00040320153,0.92706656,0.00026362026,0.00007595907,0.00006696387,0.0008285815,0.0019002404,0.0186367],"genre_scores_gemma":[0.4477263,0.0011309106,0.53467816,0.00016691753,0.000105564,0.00020547355,0.0024116314,0.00055964594,0.013015484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991893,0.00014074602,0.000050481758,0.00019573212,0.00031244097,0.00011131155],"domain_scores_gemma":[0.9985713,0.0003319048,0.00021575615,0.0005613506,0.00019632254,0.0001234305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028560235,0.0008157961,0.0004771472,0.000691973,0.00041810318,0.0018138239,0.0015061091,0.000805304,0.010763486],"category_scores_gemma":[0.0029780013,0.00080305064,0.0005991751,0.0013041197,0.000871614,0.0029848733,0.0019504757,0.0015888988,0.0024108056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003649317,0.000108282125,0.0017084606,0.0005341578,0.00008294072,0.0006425255,0.00055478903,0.251553,0.0477113,0.4037601,0.02391204,0.26906744],"study_design_scores_gemma":[0.00010091314,0.00022303525,0.001738967,0.00016642049,0.000063389845,0.00095584564,0.00022470568,0.5184621,0.034680113,0.36054188,0.082744904,0.000097806034],"about_ca_topic_score_codex":0.0007953004,"about_ca_topic_score_gemma":0.0015782289,"teacher_disagreement_score":0.010763486,"about_ca_system_score_codex":0.00074611005,"about_ca_system_score_gemma":0.00024947073,"threshold_uncertainty_score":0.036007464},"labels":[],"label_agreement":null},{"id":"W7106806343","doi":"10.4230/lipics.gd.2025.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.02358150356367914,"score_gpt":0.20934650921269696,"score_spread":0.18576500564901782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106806343","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006614506,0.0047206967,0.0016255421,0.016632192,0.2733466,0.0008055959,0.007884469,0.0021447705,0.6921788],"genre_scores_gemma":[0.0017419748,0.002300361,0.00052105123,0.0021351895,0.04622373,0.0002655493,0.0028455567,0.00091881934,0.94304776],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991831,0.000052675838,0.00007743918,0.00015832022,0.00039348903,0.00013486712],"domain_scores_gemma":[0.99463046,0.000449254,0.00025427225,0.00025798992,0.0021850816,0.0022228642],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001279385,0.0015659132,0.0015215593,0.0022789985,0.0017894283,0.009958579,0.0015444527,0.0030927968,0.84719014],"category_scores_gemma":[0.0060174125,0.0005742537,0.00083125365,0.0017520313,0.00048165224,0.003885196,0.001816198,0.0027611759,0.84447557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036988502,0.000033549546,0.000048131944,0.00014926778,0.0000020543062,0.000020289415,0.00000404683,0.00003722276,0.00022065632,0.00035530824,0.9661649,0.032927565],"study_design_scores_gemma":[0.000032456683,0.000034211753,0.00056663656,0.00016197667,0.0000034492327,0.000051427574,0.000037763617,0.00013035089,0.00017701552,0.0007990609,0.99799323,0.000012482333],"about_ca_topic_score_codex":0.0012674907,"about_ca_topic_score_gemma":0.0024234762,"teacher_disagreement_score":0.84719014,"about_ca_system_score_codex":0.0014418818,"about_ca_system_score_gemma":0.0019842065,"threshold_uncertainty_score":0.21796465},"labels":[],"label_agreement":null},{"id":"W7107853480","doi":"10.4230/lipics.isaac.2025.49","title":"Maximizing Social Welfare Among EF1 Allocations at the Presence of Two Types of Agents","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constant (computer programming); Expected utility hypothesis; Function (biology); Social Welfare; Social welfare function; Transferable utility","score_opus":0.027448889132929914,"score_gpt":0.2640014466067061,"score_spread":0.23655255747377618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7107853480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16702461,0.00028106925,0.82129526,0.00073148333,0.000044751818,0.00014133657,0.0001825243,0.00028868095,0.010010334],"genre_scores_gemma":[0.8098624,0.0001837906,0.18163083,0.00017448021,0.000056876896,0.00027788684,0.00023478834,0.00014449835,0.007434475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960064,0.0021251384,0.00011716564,0.00054715574,0.00046295606,0.0007412226],"domain_scores_gemma":[0.9936593,0.004559582,0.00045452634,0.00055964186,0.00036955954,0.00039743198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058922223,0.0015914373,0.0024060807,0.001218914,0.0014334073,0.0027898136,0.0030520817,0.0028112505,0.0038696926],"category_scores_gemma":[0.017533863,0.000645969,0.0011271407,0.0016666988,0.0023093908,0.0041460902,0.0027497748,0.0017431953,0.0007666474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051276974,0.00018789682,0.0017617797,0.00016437596,0.00010289259,0.00020716724,0.00033412335,0.7402361,0.0018163755,0.21984255,0.0023624809,0.032471467],"study_design_scores_gemma":[0.0000324316,0.00004027188,0.00015975666,0.000015507872,0.000013723695,0.000045012042,0.00005844623,0.8519642,0.0005864209,0.14649503,0.0005789008,0.000010257402],"about_ca_topic_score_codex":0.0028763232,"about_ca_topic_score_gemma":0.0018387721,"teacher_disagreement_score":0.0058922223,"about_ca_system_score_codex":0.0030057658,"about_ca_system_score_gemma":0.0017382966,"threshold_uncertainty_score":0.031161368},"labels":[],"label_agreement":null},{"id":"W7109943489","doi":"10.4230/lipics.disc.2025.3","title":"An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Nvidia","keywords":"Upper and lower bounds; Bounded function; Asynchronous communication; Communication complexity; Binary logarithm; Value (mathematics); Leader election; Key (lock); Time complexity","score_opus":0.010093199235443285,"score_gpt":0.2679484564725383,"score_spread":0.257855257237095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109943489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14766696,0.0030684944,0.7915364,0.010184048,0.0005849793,0.00040258793,0.00104939,0.0035072628,0.041999865],"genre_scores_gemma":[0.82503724,0.001111419,0.15326695,0.0016026214,0.0005539351,0.000670252,0.0011747722,0.0012733748,0.015309446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931636,0.001665477,0.00023800609,0.0012574191,0.0017324927,0.0019431624],"domain_scores_gemma":[0.95834374,0.03231544,0.0016396436,0.0048902305,0.001327163,0.0014838119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040458,0.0016090752,0.00168677,0.0011601058,0.0018075936,0.004890998,0.0042577717,0.00189207,0.01140266],"category_scores_gemma":[0.026859663,0.00063076866,0.0022402052,0.001443057,0.0031603994,0.012428004,0.004473293,0.0060644015,0.0026281832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003992397,0.0012052394,0.008767878,0.0014796407,0.00042500685,0.00069708657,0.0013073409,0.37145293,0.04674827,0.37553132,0.037013713,0.15137926],"study_design_scores_gemma":[0.00016525951,0.00028395085,0.00088119035,0.00006820987,0.00010555408,0.00019901014,0.00012207153,0.728507,0.010999396,0.25399977,0.004614222,0.00005437418],"about_ca_topic_score_codex":0.0015539763,"about_ca_topic_score_gemma":0.0019713673,"teacher_disagreement_score":0.01140266,"about_ca_system_score_codex":0.0034277595,"about_ca_system_score_gemma":0.0033433756,"threshold_uncertainty_score":0.03814572},"labels":[],"label_agreement":null},{"id":"W7109950510","doi":"10.4230/lipics.icalp.2025.28","title":"Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tensor (intrinsic definition); Decomposition; Deterministic algorithm; Rank (graph theory); Cluster analysis; Time complexity; State (computer science); Randomized algorithm","score_opus":0.015887207734168993,"score_gpt":0.2990740121710311,"score_spread":0.28318680443686206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109950510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036756024,0.000848013,0.91725624,0.0029745467,0.00031632945,0.00038537057,0.002240465,0.023863558,0.015359443],"genre_scores_gemma":[0.31203517,0.00030737033,0.6697902,0.0011364106,0.00025099158,0.00049372273,0.005048871,0.0021133565,0.00882389],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995407,0.0005609412,0.00029762962,0.0015110599,0.0011445087,0.0010789926],"domain_scores_gemma":[0.99176216,0.0028054027,0.0005935646,0.0036011229,0.0008844496,0.00035320924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002312469,0.0022335704,0.0020910506,0.0011799729,0.0019338166,0.0036056393,0.0038167904,0.0022399824,0.0122234365],"category_scores_gemma":[0.0087542925,0.0009652007,0.002901248,0.0023466216,0.0016733977,0.0067519,0.0032946246,0.003666005,0.00707254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024699627,0.0010875503,0.004807548,0.001171054,0.0003440953,0.00048878475,0.0005895813,0.16618112,0.04646801,0.12740791,0.106180556,0.54280376],"study_design_scores_gemma":[0.00040703797,0.00020800471,0.0007768274,0.00006328522,0.00017193537,0.00052220863,0.0001442664,0.8192951,0.021316081,0.13841748,0.018585736,0.000092044764],"about_ca_topic_score_codex":0.006731509,"about_ca_topic_score_gemma":0.0095083425,"teacher_disagreement_score":0.0122234365,"about_ca_system_score_codex":0.0045915945,"about_ca_system_score_gemma":0.0064789713,"threshold_uncertainty_score":0.04089141},"labels":[],"label_agreement":null},{"id":"W7109951950","doi":"10.4230/lipics.socg.2025.63","title":"The Maximum Clique Problem in a Disk Graph Made Easy","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique graph; Block graph; Unit disk graph; Split graph; Clique problem; Perfect graph; Circle graph; Independent set; Time complexity","score_opus":0.0075087614687796905,"score_gpt":0.25114617129617944,"score_spread":0.24363740982739976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109951950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18380842,0.0020487804,0.7372825,0.0060086087,0.00045064677,0.00071766163,0.005769239,0.002293745,0.06162035],"genre_scores_gemma":[0.5431082,0.0015160666,0.42156553,0.00086561445,0.0004484866,0.0005999439,0.007845117,0.000778375,0.023272673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983525,0.00042704903,0.00005727066,0.00062668603,0.00028464748,0.0002518249],"domain_scores_gemma":[0.9967925,0.0018693734,0.0002605338,0.00058323285,0.000252826,0.00024147014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007355469,0.0009185125,0.0011355581,0.0008845541,0.0025081434,0.0019694946,0.00189801,0.0014873821,0.00964988],"category_scores_gemma":[0.0046822317,0.00077625155,0.0016451699,0.0021220844,0.0013241601,0.0050349715,0.0018562963,0.0019274977,0.0017481544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010885522,0.00056557043,0.002319801,0.0015741006,0.00041778063,0.0013042075,0.0011321009,0.18059435,0.021375263,0.5282374,0.09004241,0.17134859],"study_design_scores_gemma":[0.00023807597,0.00014472588,0.0016869201,0.0000973571,0.00011473878,0.0006416243,0.0004989018,0.33289474,0.0070236237,0.5943302,0.062261015,0.0000680308],"about_ca_topic_score_codex":0.0047930554,"about_ca_topic_score_gemma":0.006017575,"teacher_disagreement_score":0.00964988,"about_ca_system_score_codex":0.0014148813,"about_ca_system_score_gemma":0.0013015759,"threshold_uncertainty_score":0.032282054},"labels":[],"label_agreement":null},{"id":"W7109952297","doi":"10.4230/lipics.sat.2025.32","title":"Efficient Certified Reasoning for Binarized Neural Networks","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; Vetenskapsrådet; National Supercomputing Centre Singapore; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Speedup; Soundness; Scalability; Robustness (evolution); Benchmark (surveying); Artificial neural network; Formal verification; Pipeline (software)","score_opus":0.011078407872012327,"score_gpt":0.2723201104293548,"score_spread":0.26124170255734247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109952297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021190953,0.00031296938,0.96059287,0.0009870584,0.00014558842,0.0002516159,0.00073472585,0.011273879,0.004510306],"genre_scores_gemma":[0.3833543,0.00043763543,0.60497606,0.0011233862,0.00009313283,0.00039802075,0.002180848,0.0024111327,0.005025515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99120504,0.002275681,0.0006002523,0.0014994513,0.003558357,0.00086109614],"domain_scores_gemma":[0.98203903,0.0110009005,0.0010123713,0.0029834525,0.0026830428,0.0002811444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043672477,0.0015854585,0.0010257458,0.0016242376,0.0013046787,0.003892875,0.0044051665,0.0020893228,0.010787371],"category_scores_gemma":[0.032730278,0.001292304,0.003540136,0.0008942168,0.0034035475,0.0067429584,0.0046992865,0.003822408,0.0016595972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007807456,0.00029746396,0.0046751215,0.0016803436,0.00033728287,0.0010545973,0.00061206776,0.4827873,0.028829135,0.27244037,0.013755263,0.1927504],"study_design_scores_gemma":[0.000097294695,0.00005144624,0.0001749435,0.00012453359,0.000090518675,0.0001465138,0.00008767842,0.8291045,0.02252753,0.14068875,0.0068634977,0.00004280087],"about_ca_topic_score_codex":0.011627227,"about_ca_topic_score_gemma":0.024454648,"teacher_disagreement_score":0.011627227,"about_ca_system_score_codex":0.0040937113,"about_ca_system_score_gemma":0.0075761112,"threshold_uncertainty_score":0.036087334},"labels":[],"label_agreement":null},{"id":"W7109957065","doi":"10.4230/lipics.itcs.2025.43","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Upper and lower bounds; Minimum cut; Graph; Streaming algorithm; Time complexity; Space (punctuation); Data stream mining; Cut; Matching (statistics)","score_opus":0.03389015576445151,"score_gpt":0.26518836974327176,"score_spread":0.23129821397882025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109957065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15543674,0.0011334956,0.82967716,0.0022498493,0.00011195754,0.0003584295,0.0015842125,0.0031230538,0.006325128],"genre_scores_gemma":[0.5228822,0.0008801105,0.46684274,0.00034313905,0.0001591506,0.0005611523,0.0029613602,0.0006202925,0.004749907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696904,0.00064587843,0.00025985582,0.0008777745,0.0008622301,0.00038525218],"domain_scores_gemma":[0.9877446,0.008972505,0.0007634215,0.001389339,0.0007078712,0.00042218843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023619158,0.0013375984,0.0016708975,0.00092686294,0.0010837843,0.0037049516,0.0029919997,0.0020799786,0.0065808943],"category_scores_gemma":[0.016729448,0.00075216923,0.001560242,0.0021219796,0.0012970626,0.0076979776,0.0024944262,0.0029524711,0.0010983481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016848816,0.0004256868,0.003774285,0.0010149569,0.00019881547,0.00035420826,0.0006337639,0.72894746,0.014136792,0.07892165,0.00823579,0.16167176],"study_design_scores_gemma":[0.00008422963,0.00008404917,0.00029429185,0.000024847232,0.00002930387,0.0001247913,0.00011328575,0.90448594,0.0044991923,0.08886652,0.0013784181,0.000015088512],"about_ca_topic_score_codex":0.0026570016,"about_ca_topic_score_gemma":0.0034663263,"teacher_disagreement_score":0.0065808943,"about_ca_system_score_codex":0.0019772623,"about_ca_system_score_gemma":0.0017642599,"threshold_uncertainty_score":0.022015274},"labels":[],"label_agreement":null},{"id":"W7109957739","doi":"10.4230/oasics.saia.2024.12","title":"A View on Vulnerabilites: The Security Challenges of XAI (Academic Track)","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Adversarial system; Transparency (behavior); Perspective (graphical); Evasion (ethics); Government (linguistics)","score_opus":0.017866769969852286,"score_gpt":0.2996563220959894,"score_spread":0.2817895521261371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109957739","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013152435,0.09530274,0.37625998,0.46769258,0.005094734,0.0000790693,0.0005360027,0.0011524222,0.040730074],"genre_scores_gemma":[0.55048543,0.1521976,0.17716579,0.055388972,0.019154623,0.0004666429,0.00097062613,0.0009544609,0.0432159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944112,0.001926143,0.00027897058,0.0009753879,0.0020193383,0.00038893163],"domain_scores_gemma":[0.9733619,0.019135326,0.0012259316,0.0031621156,0.0024218736,0.00069290935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012871651,0.0009524989,0.00092581083,0.0029286444,0.0023459096,0.008704293,0.0020656087,0.006337663,0.006868122],"category_scores_gemma":[0.031152982,0.0007590475,0.0011403185,0.0021354205,0.012001181,0.020182014,0.005712834,0.01643721,0.0021672177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000594245,0.00003303616,0.0013375003,0.00028929184,0.000052819487,0.00017365284,0.0007738105,0.0057096076,0.00059661095,0.84021986,0.039777476,0.110976964],"study_design_scores_gemma":[0.0000072537487,0.000057413818,0.0009085234,0.00071983814,0.000024841782,0.00045176654,0.00040887826,0.019123906,0.00143751,0.83274543,0.14404434,0.00007029016],"about_ca_topic_score_codex":0.001750355,"about_ca_topic_score_gemma":0.0010089653,"teacher_disagreement_score":0.012871651,"about_ca_system_score_codex":0.0039256327,"about_ca_system_score_gemma":0.0016190136,"threshold_uncertainty_score":0.06807262},"labels":[],"label_agreement":null},{"id":"W7109962221","doi":"10.4230/lipics.icalp.2025.125","title":"Unbalanced Random Matching Markets with Partial Preferences","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Matching (statistics); Upper and lower bounds; Rank (graph theory); Stability (learning theory); Work (physics); Line (geometry)","score_opus":0.01564197783520071,"score_gpt":0.22603273638888216,"score_spread":0.21039075855368145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109962221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36385706,0.0011324512,0.61013764,0.0030696206,0.00009291285,0.00031777436,0.0009187905,0.00036155537,0.020112213],"genre_scores_gemma":[0.96308964,0.00063853787,0.02967067,0.0006377479,0.00018965504,0.00027707327,0.00035097933,0.00006321759,0.005082361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589527,0.0017900812,0.00018793393,0.0007143321,0.00071129814,0.0007011613],"domain_scores_gemma":[0.96630514,0.018924467,0.0077396166,0.003485562,0.002053168,0.0014919674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074489927,0.0006738732,0.0020177893,0.0013984399,0.0015451816,0.0033218546,0.00219438,0.0025128222,0.008737372],"category_scores_gemma":[0.041379232,0.00078858295,0.0011304402,0.0015954222,0.002864255,0.009535343,0.0026128364,0.0026364543,0.0010070163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050102477,0.00012393265,0.003184448,0.0002018003,0.0000956022,0.00031072748,0.00029246797,0.081099674,0.0031673943,0.8924076,0.0031679124,0.015447369],"study_design_scores_gemma":[0.00012731763,0.0001365015,0.0010469288,0.000024533521,0.000025398673,0.00019372931,0.000112072965,0.3849064,0.0009231676,0.61054367,0.0019185845,0.000041714346],"about_ca_topic_score_codex":0.0009416838,"about_ca_topic_score_gemma":0.0007885093,"teacher_disagreement_score":0.008737372,"about_ca_system_score_codex":0.001666246,"about_ca_system_score_gemma":0.001010582,"threshold_uncertainty_score":0.039394498},"labels":[],"label_agreement":null},{"id":"W7109965980","doi":"10.4230/lipics.socg.2025.27","title":"Computing Oriented Spanners and Their Dilation","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Dilation (metric space); Metric space; Graph; Bounded function; Euclidean space; Spanner; Euclidean geometry","score_opus":0.0074592806182025954,"score_gpt":0.24557980452111358,"score_spread":0.238120523902911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109965980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3977111,0.00055661367,0.5909615,0.00023266206,0.0000797812,0.00011875183,0.0008874771,0.002607321,0.006844689],"genre_scores_gemma":[0.6132945,0.00032868207,0.3790518,0.0001372929,0.00008621694,0.00016667698,0.00272877,0.00031829657,0.0038878126],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917287,0.00008563861,0.000072837705,0.00028138768,0.0002445452,0.00014266167],"domain_scores_gemma":[0.9988643,0.00033995873,0.00019059719,0.00031634857,0.00015634095,0.00013242192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004056192,0.00075208175,0.0008435393,0.0011709281,0.00043065601,0.0010259061,0.00092474365,0.00064951245,0.003203316],"category_scores_gemma":[0.0034471455,0.0003989236,0.00061839976,0.00159494,0.00071884284,0.0032365231,0.0019007925,0.0006168672,0.0011743105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013859149,0.00025796395,0.01301367,0.00057347794,0.00018454375,0.0007328602,0.0010911569,0.26768923,0.07689872,0.11200791,0.01394291,0.51222163],"study_design_scores_gemma":[0.000110656736,0.000489552,0.0033815657,0.000058616595,0.0000666233,0.00076358067,0.0005125055,0.77120364,0.03491819,0.17455225,0.013883007,0.000059799168],"about_ca_topic_score_codex":0.0009948176,"about_ca_topic_score_gemma":0.0014985879,"teacher_disagreement_score":0.003203316,"about_ca_system_score_codex":0.0006062568,"about_ca_system_score_gemma":0.00045255004,"threshold_uncertainty_score":0.01071614},"labels":[],"label_agreement":null},{"id":"W7109966539","doi":"10.4230/lipics.socg.2025.53","title":"A PTAS for TSP with Neighbourhoods over Parallel Line Segments","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Neighbourhood (mathematics); Line segment; Approximation algorithm; Euclidean geometry; Line (geometry); Euclidean distance; Point (geometry)","score_opus":0.011387866767055601,"score_gpt":0.2773204266513546,"score_spread":0.265932559884299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109966539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03039192,0.0005282548,0.95772666,0.0007575265,0.00016338106,0.00016076189,0.0003720201,0.0013081477,0.008591385],"genre_scores_gemma":[0.27516487,0.0007271516,0.7119152,0.00024312908,0.0001658254,0.00027848713,0.0010065866,0.0004105964,0.010088099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991629,0.0001631839,0.000047343074,0.0003070947,0.00021278727,0.000106763364],"domain_scores_gemma":[0.99911803,0.00035438425,0.000106319436,0.00022300785,0.00009478846,0.00010335245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006889221,0.0009158201,0.0010921968,0.00061295286,0.0008418101,0.0013637273,0.0021427763,0.0014313918,0.0085385805],"category_scores_gemma":[0.0041730157,0.00048028052,0.0016458852,0.0014511545,0.00080231176,0.0029862102,0.0020277752,0.0025944717,0.0018848617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004929352,0.00022654969,0.001296992,0.0003790225,0.000074771815,0.00028028816,0.00032204454,0.7302574,0.00532399,0.09593445,0.015760483,0.1496511],"study_design_scores_gemma":[0.00005604296,0.000116744864,0.00013573338,0.000024856039,0.000019010009,0.00017847586,0.000045495046,0.9429771,0.0008554252,0.047787283,0.0077893035,0.000014546735],"about_ca_topic_score_codex":0.0049721105,"about_ca_topic_score_gemma":0.0039850585,"teacher_disagreement_score":0.0085385805,"about_ca_system_score_codex":0.001701994,"about_ca_system_score_gemma":0.0012729409,"threshold_uncertainty_score":0.028564394},"labels":[],"label_agreement":null},{"id":"W7109970811","doi":"10.4230/lipics.itcs.2025.32","title":"Succinct Fermion Data Structures","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"U.S. Department of Energy","keywords":"Quantum computer; Qubit; Fermion; Overhead (engineering); Space (punctuation); Homogeneous space; Quantum; Time complexity","score_opus":0.018284661414837894,"score_gpt":0.2880888042983047,"score_spread":0.26980414288346677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109970811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042402457,0.00050719635,0.9205863,0.0027272282,0.00025204328,0.00027846658,0.006123102,0.00928457,0.017838601],"genre_scores_gemma":[0.4902857,0.00051279203,0.4810904,0.0012325537,0.00016906732,0.0010314491,0.008622253,0.0015877825,0.015467954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975237,0.00056259637,0.0004094053,0.00039014997,0.00079683284,0.00031724005],"domain_scores_gemma":[0.9933569,0.001849833,0.00035715237,0.0035411792,0.00069438765,0.00020053041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022450471,0.00094183633,0.0010014839,0.0012342399,0.0017783974,0.005253982,0.0032058263,0.0018092644,0.011130906],"category_scores_gemma":[0.00834473,0.0008226991,0.0013428254,0.002317587,0.0023474144,0.011274559,0.0041724946,0.0030383754,0.0025839133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004341028,0.00014964168,0.0011177784,0.00028541088,0.000027445694,0.00014844319,0.00050763646,0.039600104,0.004282219,0.8422542,0.023073785,0.08811932],"study_design_scores_gemma":[0.000091560665,0.00009372124,0.0001389561,0.00010719287,0.00002922249,0.00012857969,0.000152684,0.13191746,0.014930762,0.802729,0.04962074,0.00006010986],"about_ca_topic_score_codex":0.0022712597,"about_ca_topic_score_gemma":0.004585509,"teacher_disagreement_score":0.011130906,"about_ca_system_score_codex":0.00269967,"about_ca_system_score_gemma":0.0029961686,"threshold_uncertainty_score":0.03723657},"labels":[],"label_agreement":null},{"id":"W7109976180","doi":"10.4230/lipics.icalp.2025.135","title":"Deterministic Independent Sets in the Semi-Streaming Model","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independent set; Randomized algorithm; Set (abstract data type); Deterministic algorithm; Graph; Simple (philosophy)","score_opus":0.021156863291202654,"score_gpt":0.2862342634690988,"score_spread":0.26507740017789616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109976180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06359271,0.0008298439,0.9247036,0.002165687,0.00014018282,0.00024347546,0.0011268326,0.00069139816,0.006506306],"genre_scores_gemma":[0.69184667,0.0015966707,0.29154015,0.00085664087,0.00069882383,0.00072101766,0.0022222803,0.0002900641,0.010227589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937224,0.002215863,0.00034787535,0.0016090441,0.001403632,0.0007011209],"domain_scores_gemma":[0.9760342,0.015754804,0.0016748754,0.0043797386,0.0012524251,0.0009039567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042614588,0.0011954774,0.0022863147,0.0010762387,0.0013161214,0.0028763905,0.0038962713,0.0020219542,0.004951074],"category_scores_gemma":[0.017001176,0.00092358317,0.001984756,0.0024021456,0.0027439857,0.008872391,0.0031060216,0.0038453373,0.0011254782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077830435,0.00031998864,0.0015871292,0.00050360925,0.00016802807,0.00044555817,0.0003798818,0.3715225,0.006489112,0.57287824,0.007861203,0.037066452],"study_design_scores_gemma":[0.00006895843,0.000081760074,0.00022243267,0.000018499297,0.000025471269,0.00017899406,0.000042615568,0.6335657,0.001507361,0.3618117,0.0024510676,0.000025493508],"about_ca_topic_score_codex":0.0018248681,"about_ca_topic_score_gemma":0.0015452588,"teacher_disagreement_score":0.004951074,"about_ca_system_score_codex":0.0022986126,"about_ca_system_score_gemma":0.0017236351,"threshold_uncertainty_score":0.022537053},"labels":[],"label_agreement":null},{"id":"W7109980574","doi":"10.4230/lipics.itcs.2025.67","title":"Error-Correcting Graph Codes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Line graph; Null graph; Voltage graph; Butterfly graph; Hamming graph; Hamming code; Block graph; Linear code; Graph property; Block code","score_opus":0.019195820346420592,"score_gpt":0.31439216607789056,"score_spread":0.29519634573146997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109980574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053436518,0.0040242,0.90175605,0.0016880357,0.000896621,0.00019967882,0.0006953157,0.0016714167,0.03563222],"genre_scores_gemma":[0.6044688,0.00495355,0.35969523,0.00154645,0.00044751936,0.00024291653,0.0011400827,0.0004086042,0.027096862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987692,0.00020374809,0.00005350228,0.00031051997,0.00048817374,0.00017487131],"domain_scores_gemma":[0.99685043,0.001038194,0.00031538427,0.001010181,0.0006715979,0.0001141327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060438557,0.0007131535,0.0005907777,0.0010180871,0.0009136952,0.0010914078,0.00130786,0.0011243831,0.0035170873],"category_scores_gemma":[0.0046228827,0.00023899475,0.00047419252,0.0013552351,0.0016423082,0.0016733698,0.0016013896,0.0015386055,0.0014648555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016892541,0.000075574564,0.0012842672,0.00054998684,0.00006215877,0.00032588065,0.0002886211,0.07380008,0.019573985,0.74268776,0.010044295,0.15113841],"study_design_scores_gemma":[0.000076775366,0.00019984179,0.0008812641,0.00023441885,0.00009440137,0.0016222768,0.00013227618,0.1945839,0.052783135,0.6330144,0.116275996,0.00010131372],"about_ca_topic_score_codex":0.0012860647,"about_ca_topic_score_gemma":0.0014228657,"teacher_disagreement_score":0.0035170873,"about_ca_system_score_codex":0.0009545862,"about_ca_system_score_gemma":0.0010728172,"threshold_uncertainty_score":0.011765838},"labels":[],"label_agreement":null},{"id":"W7109983441","doi":"10.4230/lipics.concur.2025.36","title":"Explainability is a Game for Probabilistic Bisimilarity Distances","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; State (computer science); Markov chain; Markov process; Markov decision process; Exponential function; Upper and lower bounds; Sequential game","score_opus":0.02050632036176338,"score_gpt":0.2980518053021301,"score_spread":0.27754548494036674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109983441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049072664,0.00010667435,0.9404729,0.0021002262,0.00004283333,0.000166479,0.00019490224,0.00029767916,0.0075456807],"genre_scores_gemma":[0.7212654,0.00024308739,0.2727266,0.00056953245,0.00007725961,0.00044401656,0.00027408352,0.00020337828,0.004196566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948665,0.002313375,0.00030325406,0.0010417537,0.0009692014,0.0005058869],"domain_scores_gemma":[0.97452193,0.02131388,0.0009654309,0.0017267701,0.00085511646,0.0006169172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044317427,0.0009324373,0.0009721123,0.0010904418,0.0015854624,0.0028581931,0.0018391256,0.003045836,0.00534479],"category_scores_gemma":[0.0270496,0.0007011817,0.0019744865,0.0008496949,0.0052711135,0.007865365,0.003349282,0.0048283422,0.000439485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006969187,0.00004538095,0.0005607093,0.0000729347,0.000033690732,0.0001206706,0.00047515534,0.045731016,0.0014500668,0.9411138,0.00067485677,0.009651844],"study_design_scores_gemma":[0.000022187083,0.00002819213,0.0001344249,0.000015172961,0.000021252465,0.00005555646,0.000070716334,0.13791142,0.00086388964,0.8592512,0.0016026781,0.000023433378],"about_ca_topic_score_codex":0.0031400213,"about_ca_topic_score_gemma":0.0027897975,"teacher_disagreement_score":0.00534479,"about_ca_system_score_codex":0.0029994023,"about_ca_system_score_gemma":0.002136515,"threshold_uncertainty_score":0.02343756},"labels":[],"label_agreement":null},{"id":"W7109987506","doi":"10.4230/lipics.icdt.2025.30","title":"An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Leibniz-Gemeinschaft; University of Toronto; Austrian Science Fund","keywords":"Binary decision diagram; Branching (polymer chemistry); Bounding overwatch; Focus (optics); Binary number; Boolean function; Branching process; Propositional formula","score_opus":0.02417305238824984,"score_gpt":0.3103360934267998,"score_spread":0.28616304103854995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109987506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01709821,0.0007717365,0.9668394,0.0042653107,0.00020601977,0.00015093182,0.00065926573,0.002524757,0.0074843583],"genre_scores_gemma":[0.41860607,0.0013702483,0.55920666,0.003627635,0.0011445672,0.00092047,0.0018421657,0.0017923039,0.01148994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98594904,0.0041486192,0.00054598216,0.004081168,0.0035288206,0.0017464298],"domain_scores_gemma":[0.92278737,0.05920541,0.002687511,0.010064475,0.003251087,0.002004059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011306902,0.0030669633,0.003897721,0.0034042913,0.0025783768,0.008284046,0.0068934304,0.0037433254,0.009635045],"category_scores_gemma":[0.06685082,0.0015667933,0.006192682,0.0038182775,0.0063332412,0.016412128,0.007900475,0.017262617,0.0022867976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069799303,0.00039303993,0.0028171109,0.0005987334,0.00023021342,0.00022096882,0.00059104135,0.116722435,0.0048366757,0.76096976,0.01882048,0.093101524],"study_design_scores_gemma":[0.00004509072,0.00007030719,0.00023509716,0.000074143994,0.000105416155,0.00012265431,0.00005350332,0.5030086,0.0021888884,0.49024335,0.0037944154,0.000058522543],"about_ca_topic_score_codex":0.0045831613,"about_ca_topic_score_gemma":0.0050780443,"teacher_disagreement_score":0.011306902,"about_ca_system_score_codex":0.008598394,"about_ca_system_score_gemma":0.0064650853,"threshold_uncertainty_score":0.062385976},"labels":[],"label_agreement":null},{"id":"W7109999228","doi":"10.4230/lipics.disc.2025.55","title":"Brief Announcement: Concurrent Double-Ended Priority Queues","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Priority inheritance; Priority queue; Priority ceiling protocol; Queue; Priority inversion; Multilevel queue","score_opus":0.01507876169370958,"score_gpt":0.28471995167040764,"score_spread":0.26964118997669806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109999228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012734343,0.014383572,0.6452271,0.04015678,0.18980257,0.0009650349,0.0013560874,0.010354706,0.08501987],"genre_scores_gemma":[0.24307384,0.025748214,0.22325076,0.018647922,0.097532794,0.0009745179,0.0054292926,0.0033539985,0.38198867],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997062,0.0004621143,0.00026072658,0.00050423935,0.001275166,0.00043576502],"domain_scores_gemma":[0.99393046,0.0013426559,0.00019194919,0.0005849362,0.0029122178,0.0010377299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006031907,0.00080367265,0.00055673777,0.0007740459,0.0015752302,0.004793402,0.0023023908,0.0028655014,0.029859185],"category_scores_gemma":[0.01048482,0.000967733,0.00059146114,0.0014962401,0.0009916017,0.0062298155,0.0019086893,0.003990686,0.010393011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012327981,0.00020732178,0.00069354154,0.0007639594,0.00004657668,0.0006099558,0.0004357838,0.0024562543,0.013390034,0.22116327,0.50434846,0.25465202],"study_design_scores_gemma":[0.00023058944,0.00041017926,0.00024708573,0.00012568019,0.000046145866,0.0004375001,0.00008444933,0.009749731,0.010851382,0.026919596,0.95080984,0.00008780161],"about_ca_topic_score_codex":0.0020843847,"about_ca_topic_score_gemma":0.0015997734,"teacher_disagreement_score":0.029859185,"about_ca_system_score_codex":0.0017395505,"about_ca_system_score_gemma":0.0026289457,"threshold_uncertainty_score":0.09988892},"labels":[],"label_agreement":null},{"id":"W7110000962","doi":"10.4230/lipics.ccc.2025.21","title":"Reconstruction of Depth 3 Arithmetic Circuits with Top Fan-In 3","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Electronic circuit; Polynomial; Context (archaeology); Bounded function; Arithmetic circuit complexity; Constant (computer programming); Time complexity; Boolean circuit","score_opus":0.01237422835916938,"score_gpt":0.24770829661888488,"score_spread":0.2353340682597155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110000962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5289472,0.0005722724,0.44678882,0.0017523908,0.00008585739,0.00020604704,0.00091891584,0.004127848,0.016600695],"genre_scores_gemma":[0.9379511,0.00019735859,0.055612765,0.00043973138,0.000043374275,0.000075923905,0.0008052549,0.0002261597,0.0046482556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862874,0.00021597155,0.000073754716,0.0002678541,0.0004676023,0.0003460427],"domain_scores_gemma":[0.99463886,0.0031681075,0.0005848571,0.001035796,0.0003805193,0.00019184928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081689487,0.00061571505,0.0007395251,0.00051624177,0.00072966603,0.0022413032,0.0010505589,0.0010004586,0.007451744],"category_scores_gemma":[0.0075715855,0.00049362733,0.0013709827,0.0005566658,0.0015002142,0.0039111306,0.002297171,0.002275614,0.000956544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020030353,0.00031536305,0.013092628,0.0008315317,0.00014915284,0.0010169371,0.0012288159,0.11904735,0.057038397,0.5842403,0.009336016,0.2117005],"study_design_scores_gemma":[0.00020668173,0.0003371801,0.0019629775,0.000116527655,0.00015530392,0.00081095076,0.00033485173,0.33211207,0.06383927,0.5899262,0.010103159,0.000094846786],"about_ca_topic_score_codex":0.0016970291,"about_ca_topic_score_gemma":0.0024073445,"teacher_disagreement_score":0.007451744,"about_ca_system_score_codex":0.0016947679,"about_ca_system_score_gemma":0.0016554625,"threshold_uncertainty_score":0.02492857},"labels":[],"label_agreement":null},{"id":"W7110004160","doi":"10.4230/lipics.mfcs.2025.27","title":"Cops and Robbers for Graphs on Surfaces with Crossings","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Vertex (graph theory); Graph; 1-planar graph; Combinatorial game theory; Class (philosophy); Finite set; Pathwidth","score_opus":0.008104777419133605,"score_gpt":0.2520444242275468,"score_spread":0.2439396468084132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110004160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3548339,0.0029046778,0.5384982,0.0028292723,0.00030850075,0.00041772044,0.0013529452,0.00092024484,0.09793451],"genre_scores_gemma":[0.8785711,0.0016994315,0.096983634,0.00077385904,0.00021952977,0.00045267268,0.0010096101,0.0006641599,0.019625936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854726,0.0004906404,0.00007110832,0.00042404328,0.00021501601,0.00025204872],"domain_scores_gemma":[0.9940848,0.0032808203,0.0012415983,0.0005208283,0.00019648948,0.00067559653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008709241,0.0013915674,0.0008462217,0.0018429514,0.0016759305,0.003013707,0.0016992568,0.0018295366,0.011782427],"category_scores_gemma":[0.0068894033,0.00059340434,0.0010508057,0.0015764056,0.003500575,0.004376091,0.0020342835,0.0021696948,0.0014545982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018038726,0.00011358159,0.0023164258,0.0002448288,0.00004211631,0.00050906505,0.0011769958,0.06498628,0.004570222,0.8948258,0.0066346754,0.024399666],"study_design_scores_gemma":[0.00003630019,0.00013201892,0.0020814256,0.00007761304,0.000036653273,0.0005971193,0.00051700097,0.11483453,0.001256065,0.8526191,0.027741771,0.000070407674],"about_ca_topic_score_codex":0.0024789257,"about_ca_topic_score_gemma":0.002561078,"teacher_disagreement_score":0.011782427,"about_ca_system_score_codex":0.0017963185,"about_ca_system_score_gemma":0.00063141884,"threshold_uncertainty_score":0.039416194},"labels":[],"label_agreement":null},{"id":"W7110020821","doi":"10.4230/lipics.cpm.2025.19","title":"The Trie Measure, Revisited","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Trie; Cardinality (data modeling); Monotone polygon; Encoding (memory); Binary number; Integer (computer science); Sequence (biology); Binary logarithm; Focus (optics)","score_opus":0.00988895079960905,"score_gpt":0.2593516950114112,"score_spread":0.24946274421180215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110020821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12708662,0.006560079,0.80568796,0.003461874,0.0004620747,0.00018354558,0.0007879106,0.0010642643,0.054705583],"genre_scores_gemma":[0.59934294,0.003162441,0.37132296,0.0010346284,0.0006912128,0.00039766077,0.0009990229,0.0009376001,0.022111552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689543,0.00095841364,0.00018743589,0.0007522948,0.0008473722,0.00035909915],"domain_scores_gemma":[0.99117064,0.005664043,0.0008005166,0.0012680981,0.0006926249,0.00040404266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021784552,0.0011749913,0.0015391199,0.0017208584,0.0014374919,0.0032793419,0.002894907,0.002197575,0.00799174],"category_scores_gemma":[0.017219111,0.00072446704,0.0012858289,0.003551878,0.0034911016,0.010474402,0.0027384132,0.0039574103,0.0013005226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017545851,0.00010721616,0.0008106785,0.00032655033,0.000061585095,0.00013154237,0.00038603434,0.054762047,0.0042954865,0.8748402,0.0064108456,0.057692472],"study_design_scores_gemma":[0.000053004496,0.000294236,0.00042706204,0.00007919247,0.000066305176,0.00051362603,0.00024986826,0.24817272,0.006202139,0.72516173,0.018717134,0.00006292699],"about_ca_topic_score_codex":0.0013945379,"about_ca_topic_score_gemma":0.0011560621,"teacher_disagreement_score":0.00799174,"about_ca_system_score_codex":0.0025859172,"about_ca_system_score_gemma":0.0014156481,"threshold_uncertainty_score":0.026735008},"labels":[],"label_agreement":null},{"id":"W7110023545","doi":"10.4230/lipics.itcs.2025.19","title":"Differential Privacy and Sublinear Time Are Incompatible Sometimes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Sublinear function; Differential privacy; Simple (philosophy); Graph; Differential (mechanical device)","score_opus":0.01297844764835011,"score_gpt":0.2597744655268951,"score_spread":0.246796017878545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110023545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03255252,0.00303681,0.9108169,0.025852809,0.0005195181,0.00011797639,0.00074446003,0.0010538241,0.025305206],"genre_scores_gemma":[0.66484386,0.004226399,0.29787177,0.01091816,0.001908111,0.00090740307,0.0010361198,0.0013976337,0.016890552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9708279,0.0083417585,0.0016074522,0.007990352,0.008132731,0.003099917],"domain_scores_gemma":[0.87588733,0.08522675,0.004427678,0.027475612,0.004476116,0.002506505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0149255665,0.001597348,0.0028482527,0.0013641956,0.0022736758,0.010115428,0.0044223,0.004450268,0.0076163574],"category_scores_gemma":[0.067265496,0.0013796083,0.0024274555,0.0030958254,0.012244314,0.030778117,0.010423093,0.018125586,0.0024426524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004904967,0.00008334997,0.00060573145,0.00022432924,0.000055321518,0.00006512459,0.00028854373,0.0095248865,0.0014754114,0.9656144,0.004113435,0.017458905],"study_design_scores_gemma":[0.00003912463,0.000039137652,0.00012758317,0.0000294689,0.000018345687,0.00009976914,0.000054824824,0.028819395,0.0017471055,0.96419543,0.004815194,0.000014551923],"about_ca_topic_score_codex":0.00069169607,"about_ca_topic_score_gemma":0.00057029614,"teacher_disagreement_score":0.0149255665,"about_ca_system_score_codex":0.005477653,"about_ca_system_score_gemma":0.0040390883,"threshold_uncertainty_score":0.07893491},"labels":[],"label_agreement":null},{"id":"W7110023578","doi":"10.4230/lipics.icdt.2025.25","title":"Optimal Oblivious Algorithms for Multi-Way Joins","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Cloud computing; Matching (statistics); Upload; Logarithm; Cryptography; Join (topology); Computational complexity theory; Computation","score_opus":0.030582534926643958,"score_gpt":0.3035335577761135,"score_spread":0.27295102284946954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110023578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044167083,0.00028748607,0.94809735,0.00060820504,0.000048327827,0.00016642273,0.00012283021,0.0021042551,0.0043978947],"genre_scores_gemma":[0.60683167,0.00030516987,0.3861155,0.0004184808,0.000102052385,0.00039918677,0.00039313405,0.0005041908,0.0049306178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948756,0.0011270067,0.00038641543,0.0009063089,0.001999496,0.00070521235],"domain_scores_gemma":[0.99150616,0.0038874804,0.0007047855,0.0032595384,0.0003976746,0.000244338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034069684,0.00072161714,0.0011609736,0.00082535075,0.001812708,0.003215671,0.0026652517,0.0015298876,0.0038717205],"category_scores_gemma":[0.009886434,0.0007617497,0.0013779872,0.001359812,0.0030643912,0.007799535,0.0052782013,0.0039477292,0.0014868412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022087,0.00052187144,0.001725988,0.00051840313,0.00016581094,0.00017464923,0.0010121949,0.19846565,0.042036224,0.5726723,0.007350168,0.17314807],"study_design_scores_gemma":[0.00019537439,0.00019244742,0.00019349954,0.00003466848,0.00004982743,0.00014347557,0.00009726502,0.5066649,0.029166231,0.45858142,0.004635865,0.000045049903],"about_ca_topic_score_codex":0.00050740724,"about_ca_topic_score_gemma":0.00076395634,"teacher_disagreement_score":0.0038717205,"about_ca_system_score_codex":0.0021073623,"about_ca_system_score_gemma":0.002686682,"threshold_uncertainty_score":0.018018007},"labels":[],"label_agreement":null},{"id":"W7110032274","doi":"10.4230/lipics.itc.2025.2","title":"Powerful Primitives in the Bounded Quantum Storage Model","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Learning with errors; Encryption; Construct (python library); Bounded function; Quantum; Key (lock); Transmission (telecommunications); Quantum computer; Quantum cryptography","score_opus":0.013171682550288534,"score_gpt":0.27099156165774485,"score_spread":0.2578198791074563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110032274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08990511,0.00044562167,0.8806049,0.0030705289,0.00012498525,0.00014861856,0.00039138453,0.0010267559,0.02428216],"genre_scores_gemma":[0.9095372,0.00040610557,0.07907204,0.00038870823,0.00016545689,0.00034040908,0.00017918328,0.00016502322,0.0097458875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975343,0.00070040626,0.00011445863,0.00037541316,0.00088239805,0.0003929755],"domain_scores_gemma":[0.99384046,0.0029949162,0.00045305086,0.0021574947,0.00032533857,0.00022870046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022080222,0.00054383604,0.00093441806,0.0007259799,0.0013240745,0.0028397904,0.002149974,0.0016927505,0.005631264],"category_scores_gemma":[0.006014102,0.0005416173,0.0009766681,0.0009370352,0.0053193937,0.0103596365,0.0054088878,0.0039545977,0.0009174944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073505165,0.000016221227,0.000053686723,0.000037629903,0.000006251396,0.000053854823,0.00011601941,0.010130479,0.0021515475,0.98385197,0.00052171486,0.0029872502],"study_design_scores_gemma":[0.00005280741,0.00006172239,0.000055317418,0.000022484386,0.00001402985,0.00009726663,0.000041296076,0.10926311,0.005160514,0.88056904,0.004634843,0.000027496477],"about_ca_topic_score_codex":0.00075406965,"about_ca_topic_score_gemma":0.0004439737,"teacher_disagreement_score":0.005631264,"about_ca_system_score_codex":0.0018401097,"about_ca_system_score_gemma":0.0016825132,"threshold_uncertainty_score":0.018838465},"labels":[],"label_agreement":null},{"id":"W7110035064","doi":"10.4230/lipics.csl.2025.48","title":"Quantum and Classical Markovian Graphical Causal Models and Their Identification","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Government of Canada; John Templeton Foundation","keywords":"Categorical variable; Probabilistic logic; Subcategory; Causal structure; Markov process; Causal model; Hidden variable theory; Formalism (music); Quantum","score_opus":0.01186097664327536,"score_gpt":0.2550134408095874,"score_spread":0.243152464166312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110035064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013987537,0.0006165784,0.95952994,0.0026180588,0.00013571861,0.000051069022,0.00041786116,0.00027903877,0.022364233],"genre_scores_gemma":[0.6803718,0.0010378887,0.30389404,0.0014940482,0.00036840062,0.0004036799,0.00070619315,0.00020585279,0.011517996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571615,0.0020436698,0.00022219068,0.00079761643,0.00084325025,0.00037714894],"domain_scores_gemma":[0.99325776,0.003805166,0.00078923337,0.0011369042,0.0006136525,0.00039715393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004576511,0.0006185233,0.0008427331,0.00284575,0.0016920883,0.0036391097,0.0019554892,0.002772907,0.008287259],"category_scores_gemma":[0.009614254,0.00066484004,0.0020970122,0.0021470492,0.006990626,0.008420929,0.004593497,0.0035855456,0.0007621592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019719453,0.0000022393194,0.000051527684,0.000006982591,0.000002971492,0.000011140148,0.000058798778,0.00063975726,0.000041535197,0.9980525,0.00012835475,0.0010021253],"study_design_scores_gemma":[0.0000023881391,0.0000030200827,0.00006124902,0.000008743101,0.000004589306,0.00002533976,0.000022252994,0.007457038,0.00006419564,0.99003243,0.0023128213,0.000005920867],"about_ca_topic_score_codex":0.003294888,"about_ca_topic_score_gemma":0.0024711862,"teacher_disagreement_score":0.008287259,"about_ca_system_score_codex":0.0027712898,"about_ca_system_score_gemma":0.0018031346,"threshold_uncertainty_score":0.02772361},"labels":[],"label_agreement":null},{"id":"W7110046025","doi":"10.4230/lipics.approx/random.2025.18","title":"A Randomized Rounding Approach for DAG Edge Deletion","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Bipartite graph; Directed acyclic graph; Vertex (graph theory); Directed graph; Complete bipartite graph; Graph; Enhanced Data Rates for GSM Evolution; Set (abstract data type)","score_opus":0.02299139336251356,"score_gpt":0.2822831772117847,"score_spread":0.25929178384927115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110046025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033203036,0.0006879002,0.9538949,0.0012559767,0.00037169398,0.00023812221,0.000626489,0.002279283,0.0074426755],"genre_scores_gemma":[0.3876764,0.0004917365,0.60127914,0.0013282535,0.00033200003,0.0005554286,0.0013943792,0.00058412534,0.006358633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961139,0.0016984378,0.00016726082,0.00086785486,0.00065830775,0.00049409043],"domain_scores_gemma":[0.99270827,0.0043075797,0.00054381264,0.0016491432,0.0005072001,0.0002840921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031333757,0.001413206,0.0017634814,0.000848183,0.0012019651,0.0018887968,0.002913382,0.0015380217,0.00555932],"category_scores_gemma":[0.014214846,0.0007360122,0.0013424687,0.0017685655,0.0012060566,0.0032581822,0.0024466258,0.004183932,0.0016867651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013344391,0.0005063199,0.0016880655,0.00033858602,0.0001322016,0.0002899262,0.00027309224,0.6910345,0.0067694993,0.08693741,0.019764986,0.190931],"study_design_scores_gemma":[0.00020467317,0.0001734438,0.00023377418,0.00003943732,0.000034086468,0.00017977465,0.00009445817,0.9097515,0.0028889265,0.081035,0.0053233476,0.0000415361],"about_ca_topic_score_codex":0.0026607318,"about_ca_topic_score_gemma":0.0031039375,"teacher_disagreement_score":0.00555932,"about_ca_system_score_codex":0.0016350338,"about_ca_system_score_gemma":0.002303379,"threshold_uncertainty_score":0.018597782},"labels":[],"label_agreement":null},{"id":"W7110046292","doi":"10.4230/lipics.itcs.2025.11","title":"Rank Lower Bounds on Non-Local Quantum Computation","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Agence Nationale de la Recherche; Innovation, Science and Economic Development Canada","keywords":"Upper and lower bounds; Quantum entanglement; Rank (graph theory); Communication complexity; Quantum information science; Bounding overwatch; Randomness; Quantum; Function (biology); Quantum information","score_opus":0.006805257372883821,"score_gpt":0.2554954907077905,"score_spread":0.24869023333490667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110046292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17865577,0.0033173054,0.71211624,0.0052659344,0.00030791375,0.00020138721,0.000944099,0.0014217257,0.09776966],"genre_scores_gemma":[0.9304746,0.0016175885,0.053877056,0.0004897608,0.00059931027,0.00030756518,0.0005855585,0.00040882,0.0116397515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99383754,0.0017242245,0.00022439015,0.00080587243,0.0023426495,0.0010653601],"domain_scores_gemma":[0.96733564,0.022277512,0.0015697773,0.0055147344,0.0020706535,0.0012317043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038029314,0.0016519356,0.0013379769,0.0021766785,0.0018612443,0.0043149544,0.0024411564,0.0018097959,0.00844161],"category_scores_gemma":[0.024168937,0.000603456,0.0013663755,0.0018927653,0.0056355805,0.009390576,0.0051690233,0.00749901,0.0017216187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016129886,0.00007396789,0.00043696887,0.0001572122,0.00002534628,0.000081827064,0.00021010931,0.043409213,0.0030205506,0.9364877,0.0030437256,0.012892021],"study_design_scores_gemma":[0.000020010491,0.000075049255,0.00023391501,0.000033723696,0.000019329207,0.000062344654,0.00004346178,0.18454671,0.0035676404,0.8091146,0.0022443456,0.000038892176],"about_ca_topic_score_codex":0.00088665436,"about_ca_topic_score_gemma":0.0009417978,"teacher_disagreement_score":0.00844161,"about_ca_system_score_codex":0.0030562368,"about_ca_system_score_gemma":0.0018882467,"threshold_uncertainty_score":0.028239965},"labels":[],"label_agreement":null},{"id":"W7110048490","doi":"10.4230/lipics.cp.2025.17","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National University of Singapore","keywords":"Trap (plumbing); Fixed point; Set (abstract data type); Probabilistic logic; Scalability; Enumeration; State space; Dynamical systems theory","score_opus":0.009202968421726498,"score_gpt":0.23954454680366546,"score_spread":0.23034157838193897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110048490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068189085,0.0012859374,0.92343205,0.001013548,0.00008438556,0.00014872986,0.0010572774,0.0019084301,0.0028806324],"genre_scores_gemma":[0.48590645,0.0007261297,0.5078661,0.0002915493,0.00010105266,0.00030371404,0.0024739152,0.00048685784,0.001844177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557257,0.0015825074,0.00030879374,0.00097205426,0.0012341847,0.0003298331],"domain_scores_gemma":[0.9791555,0.01580254,0.0016258872,0.0016594989,0.0011933286,0.0005634021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037709358,0.0012380506,0.0019463365,0.0027466998,0.0010588503,0.0039863023,0.002709009,0.0016921398,0.0035820024],"category_scores_gemma":[0.033070773,0.0007317973,0.0015932528,0.0025514744,0.0014606168,0.007710467,0.0030722984,0.0026848924,0.00054629496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044580727,0.00022803943,0.0080636665,0.00078746444,0.00017537076,0.00018090811,0.00051087345,0.5976925,0.004281854,0.12894051,0.006584543,0.25210845],"study_design_scores_gemma":[0.000015915122,0.000025325677,0.00025159054,0.000030838353,0.00001913793,0.000048617392,0.00005059335,0.91874605,0.0009817536,0.07885266,0.00096645515,0.000011121443],"about_ca_topic_score_codex":0.004593153,"about_ca_topic_score_gemma":0.0075382423,"teacher_disagreement_score":0.004593153,"about_ca_system_score_codex":0.0026381,"about_ca_system_score_gemma":0.0021618037,"threshold_uncertainty_score":0.01994282},"labels":[],"label_agreement":null},{"id":"W7110076330","doi":"10.4230/lipics.aft.2025.30","title":"Ticket to Ride: Locally Steered Source Routing for the Lightning Network","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Traverse; Ticket; Relay; Train; Routing (electronic design automation); Overhead (engineering); Channel (broadcasting); Landmark; Latency (audio)","score_opus":0.0069853999229418165,"score_gpt":0.2272152971059407,"score_spread":0.2202298971829989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110076330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09230962,0.00072843354,0.8949964,0.0004399603,0.00017559124,0.00015308872,0.0002443357,0.0048659868,0.006086552],"genre_scores_gemma":[0.8812372,0.00027435547,0.11441951,0.0001668832,0.00005417899,0.000094667805,0.0003138956,0.00012726778,0.0033119807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958616,0.0001009562,0.000020165873,0.000081684564,0.00013316119,0.00007797325],"domain_scores_gemma":[0.9991966,0.00022249449,0.000105424515,0.0003092641,0.00009210227,0.00007420131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078709796,0.00035657763,0.0006242111,0.0004953293,0.0006482784,0.00086955674,0.00123314,0.0005634524,0.002355184],"category_scores_gemma":[0.001992373,0.00014231224,0.00027723343,0.00042791935,0.0008010902,0.0016930609,0.0020156137,0.00079945975,0.0005383454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012845156,0.00018655579,0.0025305736,0.000335843,0.0001100378,0.00075279555,0.0008583317,0.3132747,0.061076883,0.08277083,0.0177287,0.5190903],"study_design_scores_gemma":[0.00008960736,0.00049550465,0.0004495689,0.000038238853,0.00002973323,0.0004992384,0.00026108322,0.9207418,0.018664286,0.042101886,0.016566727,0.00006228136],"about_ca_topic_score_codex":0.0012322981,"about_ca_topic_score_gemma":0.0019196403,"teacher_disagreement_score":0.002355184,"about_ca_system_score_codex":0.0006283347,"about_ca_system_score_gemma":0.0006359611,"threshold_uncertainty_score":0.0078789},"labels":[],"label_agreement":null},{"id":"W7110111634","doi":"10.4230/lipics.socg.2025.52","title":"Uniform Bounds on Product Sylvester-Gallai Configurations","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Product (mathematics); Bounded function; Extension (predicate logic); Algebraically closed field; Degree (music); Homogeneous; Scalar (mathematics); Polynomial","score_opus":0.015473343887221776,"score_gpt":0.273397003867277,"score_spread":0.25792365998005523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110111634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.574034,0.0022128455,0.33193928,0.0027595386,0.00022873854,0.00023576047,0.0017772382,0.002171629,0.08464085],"genre_scores_gemma":[0.9622191,0.0005272965,0.027429849,0.00049564923,0.00019789295,0.00027304093,0.0010432563,0.00031496852,0.007498927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617934,0.0007594445,0.0002034381,0.0011221727,0.00081978756,0.0009158614],"domain_scores_gemma":[0.98279446,0.011915163,0.0011575536,0.002177946,0.00082475814,0.0011300459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002315937,0.0011298561,0.0015395515,0.002185983,0.002416974,0.0037451822,0.0027933908,0.0013825025,0.01962277],"category_scores_gemma":[0.017730145,0.000989353,0.001210717,0.001963408,0.0042351675,0.011776411,0.0072713876,0.0040339394,0.0020952108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060993497,0.000103652805,0.0039485395,0.0002612971,0.000056020363,0.00031628195,0.00047148153,0.020838775,0.004893936,0.94354475,0.0045253676,0.020429881],"study_design_scores_gemma":[0.000087583896,0.00022230638,0.0012477437,0.00007645667,0.00007719034,0.00042315785,0.00011728507,0.06161132,0.007134979,0.9222939,0.0066357795,0.000072273564],"about_ca_topic_score_codex":0.00049488357,"about_ca_topic_score_gemma":0.0006906182,"teacher_disagreement_score":0.01962277,"about_ca_system_score_codex":0.002496735,"about_ca_system_score_gemma":0.0007535388,"threshold_uncertainty_score":0.06564474},"labels":[],"label_agreement":null},{"id":"W7110121538","doi":"10.4230/lipics.wads.2025.8","title":"Tight Bounds on the Number of Closest Pairs in Vertical Slabs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; Fonds De La Recherche Scientifique - FNRS; Institute for Information and Communications Technology Promotion; National Science Foundation","keywords":"Hyperplane; Sequence (biology); Set (abstract data type); Point (geometry); Upper and lower bounds","score_opus":0.012313831353453888,"score_gpt":0.27683690768450436,"score_spread":0.2645230763310505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110121538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41785637,0.009448091,0.51724243,0.008846185,0.0005122485,0.0006767754,0.016565097,0.009036128,0.019816725],"genre_scores_gemma":[0.69116354,0.002282132,0.28098255,0.0011269642,0.00052461005,0.0006999081,0.014601337,0.0015589927,0.007059989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97963655,0.0024822978,0.002073365,0.0043067206,0.007432842,0.004068255],"domain_scores_gemma":[0.93295634,0.040152665,0.005695006,0.015220792,0.0028857058,0.003089422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072930367,0.0031123636,0.0058523077,0.0039839516,0.0034994008,0.007661806,0.010614967,0.003152804,0.010761283],"category_scores_gemma":[0.05893777,0.0028717606,0.0032215698,0.009465032,0.003788215,0.021682221,0.013441338,0.005498242,0.003743263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0151270665,0.0024854867,0.0411388,0.0041411268,0.0011674989,0.0009773801,0.0041621285,0.38532633,0.08471099,0.1033759,0.055337835,0.30204955],"study_design_scores_gemma":[0.000783016,0.00088898075,0.006159755,0.00034049203,0.00048183886,0.0014976957,0.0010183199,0.7762934,0.03295842,0.16334383,0.016062867,0.00017136477],"about_ca_topic_score_codex":0.004958004,"about_ca_topic_score_gemma":0.00855065,"teacher_disagreement_score":0.010761283,"about_ca_system_score_codex":0.0042276713,"about_ca_system_score_gemma":0.0046845074,"threshold_uncertainty_score":0.03856969},"labels":[],"label_agreement":null},{"id":"W7110127072","doi":"10.4230/lipics.esa.2025.44","title":"Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; European Commission","keywords":"Steiner tree problem; Vertex (graph theory); Upper and lower bounds; Graph; Connectivity; Vertex connectivity; Set (abstract data type); Spanning tree; Terminal (telecommunication)","score_opus":0.014488975413341154,"score_gpt":0.27196938662608927,"score_spread":0.2574804112127481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110127072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20303342,0.0005878411,0.7853176,0.00076363474,0.00009304102,0.00016337291,0.0010123659,0.0029763035,0.0060523404],"genre_scores_gemma":[0.68003756,0.00021678797,0.31582364,0.0002057583,0.00006644985,0.00021588223,0.0009828757,0.000205968,0.0022450837],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876934,0.00025130186,0.00008727301,0.00031458534,0.0004057723,0.0001716831],"domain_scores_gemma":[0.99582374,0.0015167317,0.0005589298,0.0016010813,0.00030074394,0.00019880728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006485772,0.00061140413,0.0009184417,0.00076411944,0.0010349551,0.0013068041,0.001521168,0.0012118483,0.002656415],"category_scores_gemma":[0.0049925204,0.0004408632,0.00046172622,0.0011675229,0.0011054445,0.0034477846,0.0020830224,0.0015531841,0.0006632904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027234457,0.0002788429,0.0021597014,0.00057866186,0.000067153574,0.0003361562,0.00083728053,0.28606725,0.12419504,0.21818532,0.0109387925,0.3536323],"study_design_scores_gemma":[0.00020552128,0.0007468171,0.00080869184,0.00007662621,0.00004773632,0.00039571724,0.00016754701,0.7542213,0.04771314,0.18543854,0.010100039,0.0000783215],"about_ca_topic_score_codex":0.00078207004,"about_ca_topic_score_gemma":0.0010132833,"teacher_disagreement_score":0.002656415,"about_ca_system_score_codex":0.0018139078,"about_ca_system_score_gemma":0.0008325093,"threshold_uncertainty_score":0.013160825},"labels":[],"label_agreement":null},{"id":"W7110163560","doi":"10.4230/lipics.wads.2025.27","title":"A QPTAS for Facility Location on Unit Disk Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Facility location problem; Vertex (graph theory); Unit disk graph; Approximation algorithm; Euclidean distance; Set (abstract data type); Unit disk; Enhanced Data Rates for GSM Evolution; Graph; 1-center problem","score_opus":0.027500906135042524,"score_gpt":0.26832047376776164,"score_spread":0.2408195676327191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110163560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06923729,0.0035327396,0.89783347,0.0039861463,0.00047521834,0.00041419922,0.0025538101,0.0013576201,0.020609472],"genre_scores_gemma":[0.698228,0.0020864895,0.28445584,0.0011520223,0.00034892288,0.00053424644,0.0024571095,0.00032423314,0.0104131345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869376,0.00040757557,0.000042531712,0.0003427123,0.00018131892,0.00033219],"domain_scores_gemma":[0.99638534,0.0027293833,0.00022154438,0.00023509441,0.00019191088,0.0002367296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013092651,0.0018477478,0.0023288867,0.00063969666,0.0007048028,0.0022546763,0.0030267038,0.0027919791,0.0068397764],"category_scores_gemma":[0.005919938,0.0008298066,0.0011431598,0.0020317915,0.0012418358,0.0031518617,0.0020384523,0.0036920863,0.0007589531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023007757,0.0001452331,0.00047668128,0.0003588368,0.00006789816,0.000152486,0.000104921106,0.9276669,0.00047316216,0.03688622,0.010258792,0.023178734],"study_design_scores_gemma":[0.00008128419,0.00005311783,0.000095190575,0.000030360474,0.000020209169,0.000056098954,0.00004897389,0.96527016,0.00015426074,0.0321101,0.002072635,0.0000075396397],"about_ca_topic_score_codex":0.011116461,"about_ca_topic_score_gemma":0.008262302,"teacher_disagreement_score":0.011116461,"about_ca_system_score_codex":0.0032764846,"about_ca_system_score_gemma":0.0027746733,"threshold_uncertainty_score":0.023772657},"labels":[],"label_agreement":null},{"id":"W7110165342","doi":"10.4230/lipics.cpm.2025.11","title":"On Palindromic Periodicities","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Palindrome; Prefix; Palindromic sequence; Word (group theory); Sequence (biology)","score_opus":0.006257707685843562,"score_gpt":0.24302485724839054,"score_spread":0.236767149562547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110165342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7516774,0.0038058527,0.15481979,0.0007765798,0.00033521524,0.00010915957,0.00040177332,0.00029086033,0.0877833],"genre_scores_gemma":[0.9552875,0.0011527675,0.033453353,0.00018381169,0.00043482322,0.00016633818,0.00033143896,0.00006326975,0.008926772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907035,0.00014415148,0.0001030326,0.00038483972,0.00017373997,0.0001239333],"domain_scores_gemma":[0.9975103,0.0014180614,0.00037617894,0.00030000985,0.00021190602,0.00018352269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007699784,0.00061486533,0.00054762803,0.0016187832,0.0013290505,0.0012084473,0.00056704757,0.000662585,0.0045526116],"category_scores_gemma":[0.0028485532,0.00032301032,0.00042435477,0.001258788,0.003354692,0.003137613,0.0012398255,0.00093649334,0.0008244967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017725903,0.000060160222,0.0018878803,0.00023215577,0.000016052223,0.0010032578,0.0015282347,0.0028752412,0.016075036,0.94129467,0.0007645284,0.034085564],"study_design_scores_gemma":[0.000028797953,0.00026612313,0.0019982052,0.00007641479,0.00002536275,0.0011750954,0.00053892273,0.010252752,0.0064727585,0.96684283,0.012282528,0.00004021147],"about_ca_topic_score_codex":0.00027362068,"about_ca_topic_score_gemma":0.00024713107,"teacher_disagreement_score":0.0045526116,"about_ca_system_score_codex":0.00059121253,"about_ca_system_score_gemma":0.00026945295,"threshold_uncertainty_score":0.01523},"labels":[],"label_agreement":null},{"id":"W7110182728","doi":"10.4230/lipics.socg.2025.76","title":"A Note on the No-(d+2)-On-a-Sphere Problem","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Cube (algebra); Construct (python library); Upper and lower bounds; Fixed point; Dimension (graph theory)","score_opus":0.02982649432739289,"score_gpt":0.31478797367448874,"score_spread":0.28496147934709587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110182728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11052213,0.005524511,0.7224347,0.020195665,0.0021757146,0.00026279167,0.0020368868,0.0014666026,0.13538104],"genre_scores_gemma":[0.3828422,0.005217767,0.540355,0.005397024,0.0019764523,0.0010541762,0.004146156,0.0011075385,0.057903595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765295,0.0008504482,0.00011845386,0.00053253176,0.0005437042,0.00030187645],"domain_scores_gemma":[0.99207205,0.0052307043,0.00021497588,0.0014788843,0.00032640155,0.0006769676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027916182,0.0019163479,0.002850517,0.0013025643,0.00214052,0.0026718776,0.004405041,0.0023008971,0.009649315],"category_scores_gemma":[0.010475925,0.0008606796,0.0025434897,0.0021780222,0.0038791094,0.0077567366,0.007646381,0.007906817,0.0026343975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006184422,0.00024455888,0.0013613952,0.00069179793,0.00011188299,0.0002987669,0.00044902848,0.045143943,0.004842291,0.80510956,0.056714635,0.084413685],"study_design_scores_gemma":[0.00018035922,0.00014849477,0.00072463776,0.00008671145,0.00005376001,0.00032269946,0.0001821627,0.105989315,0.0029026975,0.85782033,0.03152656,0.00006219557],"about_ca_topic_score_codex":0.0032034866,"about_ca_topic_score_gemma":0.0031537018,"teacher_disagreement_score":0.009649315,"about_ca_system_score_codex":0.0019185434,"about_ca_system_score_gemma":0.0014497862,"threshold_uncertainty_score":0.032280147},"labels":[],"label_agreement":null},{"id":"W7110184166","doi":"10.4230/lipics.disc.2025.58","title":"Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Broadcasting (networking); Node (physics); Gossip; Constant (computer programming); Radio networks; Scheme (mathematics); Asymptotically optimal algorithm; Radio broadcasting","score_opus":0.01384619250655066,"score_gpt":0.27325991403683453,"score_spread":0.25941372153028386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110184166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015093679,0.0063281995,0.94717735,0.010043982,0.0045293043,0.00016716095,0.00028956684,0.0010503635,0.015320341],"genre_scores_gemma":[0.31140104,0.015789157,0.6232144,0.003672689,0.011018498,0.0007130589,0.0011467821,0.0008924455,0.032151826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821556,0.0006936538,0.00011143099,0.00031247066,0.0004531982,0.00021385663],"domain_scores_gemma":[0.99248546,0.005157071,0.00043736288,0.00076363544,0.0008514859,0.00030491155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029078491,0.00097400433,0.00083028397,0.0010075715,0.0012787367,0.002227795,0.0016685065,0.0021181027,0.0065227835],"category_scores_gemma":[0.016537558,0.00078924414,0.0010450016,0.0020191667,0.0021523384,0.006543696,0.0014156422,0.0046591684,0.002582955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052457536,0.000117190546,0.0006845956,0.0008384582,0.000049318955,0.0001273627,0.00049021543,0.033097796,0.010811978,0.7204035,0.05363193,0.17922309],"study_design_scores_gemma":[0.0001764325,0.0007962822,0.00072867895,0.00021693972,0.00013148702,0.00049050857,0.00018345848,0.19719933,0.0119842505,0.56891966,0.2189797,0.00019317152],"about_ca_topic_score_codex":0.0011647309,"about_ca_topic_score_gemma":0.00077892875,"teacher_disagreement_score":0.0065227835,"about_ca_system_score_codex":0.0024029799,"about_ca_system_score_gemma":0.0011180366,"threshold_uncertainty_score":0.021820843},"labels":[],"label_agreement":null},{"id":"W7110189454","doi":"10.4230/lipics.socg.2025.19","title":"Polychromatic Coloring of Tuples in Hypergraphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hypergraph; Tuple; Set (abstract data type); Constant (computer programming); Characterization (materials science)","score_opus":0.012267265345861035,"score_gpt":0.292994078523558,"score_spread":0.280726813177697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110189454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22465816,0.0017318191,0.74211824,0.0013288262,0.00023558701,0.00025679125,0.0024532455,0.0017651343,0.025452193],"genre_scores_gemma":[0.7137991,0.0012662287,0.27111697,0.00078399514,0.0003188216,0.00035304204,0.0025730508,0.0004778062,0.009310901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975636,0.00076427107,0.00013321047,0.00070886343,0.00043027944,0.00039980165],"domain_scores_gemma":[0.9918522,0.003783607,0.0009936169,0.0018621647,0.0008636373,0.0006446953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012441154,0.0007910015,0.0007565226,0.0013882417,0.0015169069,0.002838501,0.0011275972,0.0009130621,0.0058842925],"category_scores_gemma":[0.006868665,0.0010397007,0.0009642315,0.0023845853,0.001743347,0.0045201294,0.001684702,0.0021816315,0.0009804099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009082689,0.000309174,0.01071647,0.00075048435,0.0001936023,0.0011709221,0.0019341564,0.09537442,0.037828207,0.6968847,0.022906529,0.13102303],"study_design_scores_gemma":[0.00008391801,0.0001570812,0.003931591,0.00012110128,0.00008017217,0.0013672797,0.0006288961,0.17323017,0.014820129,0.7759077,0.029577507,0.000094574614],"about_ca_topic_score_codex":0.0022708552,"about_ca_topic_score_gemma":0.0023042755,"teacher_disagreement_score":0.0058842925,"about_ca_system_score_codex":0.0020769078,"about_ca_system_score_gemma":0.00095227745,"threshold_uncertainty_score":0.01968491},"labels":[],"label_agreement":null},{"id":"W7110192836","doi":"10.4230/lipics.mfcs.2025.85","title":"Cutoff Theorems for the Equivalence of Parameterized Quantum Circuits","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Parameterized complexity; Equivalence (formal languages); Modulo; Electronic circuit; Quantum gate; Quantum circuit; Quantum algorithm; Probabilistic logic; Quantum; Formal equivalence checking","score_opus":0.014438882305444956,"score_gpt":0.2711900122484945,"score_spread":0.25675112994304955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110192836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06641605,0.00021393468,0.92382526,0.00060922414,0.0000479704,0.0001783272,0.00029270336,0.001061334,0.0073551876],"genre_scores_gemma":[0.7489876,0.00033835915,0.24402845,0.00062881614,0.00016186817,0.0005690993,0.000992328,0.0005378139,0.0037556763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98942345,0.002930344,0.00094629254,0.0026400993,0.0029954142,0.0010643969],"domain_scores_gemma":[0.9470828,0.039931905,0.0019356789,0.008334562,0.0020773518,0.00063764077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068141734,0.0009414573,0.0014475121,0.0019094234,0.0016683127,0.0043812986,0.0034820738,0.0019149939,0.0075131548],"category_scores_gemma":[0.039127257,0.0008422615,0.0028125085,0.0018926933,0.0059936275,0.012998328,0.005078213,0.008016774,0.0007084936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019378851,0.00016482873,0.00120765,0.00011817438,0.000047209272,0.00012453012,0.00037304015,0.030172214,0.0040338817,0.9221909,0.0011846229,0.0401892],"study_design_scores_gemma":[0.00005368381,0.00004931309,0.00023726038,0.000021312419,0.000021637721,0.000052405478,0.000035831486,0.097954564,0.0038607381,0.8964791,0.0012130962,0.000021220345],"about_ca_topic_score_codex":0.0014828673,"about_ca_topic_score_gemma":0.0011468388,"teacher_disagreement_score":0.0075131548,"about_ca_system_score_codex":0.0044646696,"about_ca_system_score_gemma":0.0022448483,"threshold_uncertainty_score":0.036037207},"labels":[],"label_agreement":null},{"id":"W7110198478","doi":"10.4230/lipics.itcs.2025.89","title":"Optimal Communication Complexity of Chained Index","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"String (physics); Generalization; Upper and lower bounds; Index (typography); Position (finance); Value (mathematics)","score_opus":0.02479467919637605,"score_gpt":0.27863430581502757,"score_spread":0.2538396266186515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110198478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4237282,0.0033462197,0.5137674,0.009028798,0.000500482,0.0006805749,0.0053791134,0.0033150094,0.04025427],"genre_scores_gemma":[0.8478982,0.0010211263,0.13087115,0.0010420987,0.00041807207,0.00059150363,0.0041586314,0.0010290742,0.012970142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99322,0.0016716566,0.00036325844,0.0017124645,0.0013389478,0.0016936245],"domain_scores_gemma":[0.96189916,0.028657913,0.0019793415,0.0042642653,0.0014702604,0.0017289942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003920944,0.0020775008,0.003130306,0.0011152299,0.0018904597,0.0045635593,0.006548491,0.0035093396,0.014980351],"category_scores_gemma":[0.030541878,0.0011643564,0.001689499,0.003130553,0.0025256262,0.012722636,0.005503057,0.004454696,0.0020122104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036682084,0.00089365145,0.0036259806,0.0014004847,0.00022579753,0.0006301598,0.0010752209,0.65426075,0.0067574023,0.1961238,0.034345444,0.096993096],"study_design_scores_gemma":[0.00021625645,0.00014942407,0.00024448137,0.00004631216,0.000039836825,0.00013221698,0.00010201417,0.8124862,0.0018377365,0.18265358,0.0020625764,0.00002932236],"about_ca_topic_score_codex":0.004264499,"about_ca_topic_score_gemma":0.0032374908,"teacher_disagreement_score":0.014980351,"about_ca_system_score_codex":0.0052549215,"about_ca_system_score_gemma":0.0039832424,"threshold_uncertainty_score":0.050114274},"labels":[],"label_agreement":null},{"id":"W7110209134","doi":"10.4230/lipics.approx/random.2025.1","title":"Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Bounded function; Travelling salesman problem; Hamiltonian path; Treewidth; Dimension (graph theory); Path (computing); Graph","score_opus":0.01875167200096725,"score_gpt":0.2838451202113926,"score_spread":0.26509344821042535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110209134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15563138,0.006005253,0.8050879,0.00277159,0.0004311172,0.00029018935,0.0014886365,0.0029859939,0.025307925],"genre_scores_gemma":[0.5668187,0.0025493875,0.41483137,0.00088426116,0.000277203,0.00031080627,0.0030671498,0.00053749385,0.010723701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727374,0.00063310063,0.00017479777,0.00050366274,0.0008500374,0.0005646885],"domain_scores_gemma":[0.9957229,0.0019097439,0.00034956704,0.0012559482,0.0003742022,0.0003875688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021957073,0.001885909,0.0017293091,0.0013908864,0.0010655985,0.00302661,0.0039441064,0.0017568266,0.0075227506],"category_scores_gemma":[0.011699029,0.00045294387,0.0016735275,0.0031422894,0.0009945296,0.008677852,0.0032217414,0.0029135454,0.0015007914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015812685,0.00044628474,0.0035850836,0.00092110765,0.00021614469,0.00036237773,0.0008885305,0.35515478,0.007076728,0.30072376,0.025859712,0.3031842],"study_design_scores_gemma":[0.00012558553,0.00022746716,0.00074641354,0.00008190005,0.00009790969,0.00037335022,0.00026177563,0.78314847,0.0021274844,0.19816446,0.014603272,0.000041916508],"about_ca_topic_score_codex":0.0054579363,"about_ca_topic_score_gemma":0.00562431,"teacher_disagreement_score":0.0075227506,"about_ca_system_score_codex":0.003918816,"about_ca_system_score_gemma":0.0019623935,"threshold_uncertainty_score":0.028433084},"labels":[],"label_agreement":null},{"id":"W7110215014","doi":"10.4230/lipics.stacs.2025.64","title":"Cluster Editing on Cographs and Related Classes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Time complexity; Permutation (music); Upper and lower bounds; Connected component; Computational complexity theory; Cograph","score_opus":0.010841416548416588,"score_gpt":0.28794879680089236,"score_spread":0.2771073802524758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110215014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23443843,0.0015476693,0.7120156,0.0038599067,0.00031928584,0.000649098,0.0039983136,0.0037922806,0.03937941],"genre_scores_gemma":[0.69480884,0.0015202286,0.2677998,0.0013216935,0.0006871804,0.000538248,0.0067333956,0.0009596547,0.025630947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971636,0.00037629,0.00012041239,0.0013291227,0.000531518,0.00047905263],"domain_scores_gemma":[0.9905019,0.0049116346,0.00099495,0.0021524066,0.0007084591,0.00073066336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012419434,0.0010410408,0.0013136094,0.0018702407,0.003234659,0.0034463217,0.002842019,0.0020009018,0.009127474],"category_scores_gemma":[0.008436296,0.0006033271,0.0015628611,0.0035199195,0.0022659549,0.007839876,0.002734846,0.0025494036,0.0011472125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033448942,0.0002906237,0.0028815628,0.0006210364,0.00008233922,0.0005109831,0.0012189355,0.07990434,0.0050466866,0.762904,0.02510935,0.12109559],"study_design_scores_gemma":[0.00006369855,0.000051196203,0.0013928184,0.000047977795,0.00004109833,0.0005449722,0.00029967228,0.14213659,0.0026965593,0.8206153,0.032062996,0.000047136098],"about_ca_topic_score_codex":0.005447012,"about_ca_topic_score_gemma":0.004323409,"teacher_disagreement_score":0.009127474,"about_ca_system_score_codex":0.0036577643,"about_ca_system_score_gemma":0.0016784342,"threshold_uncertainty_score":0.030534446},"labels":[],"label_agreement":null},{"id":"W7110230378","doi":"10.4230/lipics.aft.2025.20","title":"Selfish Mining Under General Stochastic Rewards","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"National Science Foundation","keywords":"Incentive; Function (biology); Profitability index; Block (permutation group theory); Set (abstract data type); Database transaction; Transaction cost","score_opus":0.009262618082973512,"score_gpt":0.2572371241605682,"score_spread":0.2479745060775947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110230378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3735308,0.00078154105,0.5989285,0.0022614135,0.00011325543,0.0002169087,0.0008619742,0.00071494695,0.022590704],"genre_scores_gemma":[0.98020536,0.00030381835,0.011397634,0.0001339475,0.000040194715,0.00010895017,0.00009843456,0.00006575629,0.0076459153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978904,0.0007344965,0.00010475647,0.00042155746,0.00034988357,0.000498879],"domain_scores_gemma":[0.9875804,0.0074852156,0.0023967314,0.00087644625,0.00085595227,0.00080512173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033698988,0.0010753671,0.0014559369,0.0008612682,0.0006838216,0.0022616673,0.0015784866,0.0017719902,0.0046870024],"category_scores_gemma":[0.019663086,0.00058622094,0.0010626465,0.0004877304,0.0021662381,0.0031466538,0.0019997794,0.002020844,0.0006577853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019403716,0.00007907593,0.0024682612,0.00011302598,0.000056761095,0.0003994762,0.0002121148,0.6024007,0.0026891967,0.38465795,0.0017163383,0.005013049],"study_design_scores_gemma":[0.00003120574,0.000040469276,0.00040184124,0.000012616184,0.000013120057,0.000057496007,0.00004803302,0.9165818,0.00020171402,0.08213353,0.00045619637,0.000022053138],"about_ca_topic_score_codex":0.005269403,"about_ca_topic_score_gemma":0.003912725,"teacher_disagreement_score":0.005269403,"about_ca_system_score_codex":0.0023891747,"about_ca_system_score_gemma":0.0019043963,"threshold_uncertainty_score":0.017821908},"labels":[],"label_agreement":null},{"id":"W7110237132","doi":"10.4230/lipics.icalp.2025.72","title":"k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; McGill University","funders":"","keywords":"Chordal graph; Split graph; Interval graph; Finite set; Maximal independent set; Distance-hereditary graph; Induced subgraph; Indifference graph; Block graph","score_opus":0.019879752102609588,"score_gpt":0.270310551007324,"score_spread":0.2504307989047144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110237132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9484158,0.00022003429,0.038292892,0.00047350125,0.000024746965,0.000044666624,0.0007775661,0.00021219841,0.011538542],"genre_scores_gemma":[0.9861463,0.00013911014,0.010156054,0.0001193379,0.000025682652,0.000048147074,0.0011073025,0.000045329263,0.0022128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897075,0.000102546335,0.000091935966,0.00040932366,0.00018045305,0.00024501415],"domain_scores_gemma":[0.99469525,0.0028106328,0.0009676143,0.00078563695,0.0002829669,0.0004579373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051972654,0.00045259533,0.00071351306,0.0008085053,0.0012756998,0.0021784387,0.001271261,0.00072606636,0.0032362447],"category_scores_gemma":[0.003709612,0.00055685977,0.0012101515,0.0008124189,0.0018415792,0.0032180515,0.0015102949,0.0013604122,0.00034379208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024343473,0.0005868665,0.061704233,0.00096077094,0.0003368465,0.0030860717,0.0028809633,0.046278846,0.057225432,0.7354971,0.00874311,0.080265366],"study_design_scores_gemma":[0.00020343187,0.00027586662,0.017777758,0.000116956086,0.00015997609,0.0039920765,0.0012861913,0.06989778,0.020690918,0.8723278,0.01318553,0.00008567877],"about_ca_topic_score_codex":0.00075989106,"about_ca_topic_score_gemma":0.0010158704,"teacher_disagreement_score":0.0032362447,"about_ca_system_score_codex":0.0010396948,"about_ca_system_score_gemma":0.00048085497,"threshold_uncertainty_score":0.01082629},"labels":[],"label_agreement":null},{"id":"W7110237504","doi":"10.4230/lipics.sat.2025.31","title":"On Top-Down Pseudo-Boolean Model Counting","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Supercomputing Centre Singapore; National University of Singapore; Natural Science Foundation of Jilin Province","keywords":"Variable (mathematics); Heuristic; Succinctness; Natural number; Boolean data type; Decision model; Counting problem","score_opus":0.014797032479863376,"score_gpt":0.26863978398109745,"score_spread":0.2538427515012341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110237504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016879536,0.00068572606,0.9731557,0.00069176,0.0000891969,0.00021281368,0.00036132053,0.003833839,0.00409005],"genre_scores_gemma":[0.21874611,0.000457991,0.77430856,0.0009375009,0.000083988845,0.00038353534,0.0010381822,0.0007060823,0.0033380939],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946108,0.002081845,0.00024543173,0.00070522365,0.0019339564,0.0004227621],"domain_scores_gemma":[0.9850251,0.010268533,0.00068842625,0.0022353511,0.0014808956,0.0003016077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035666735,0.0013065943,0.001581055,0.0019021147,0.00086927385,0.0025529223,0.0031928304,0.0013138565,0.009258092],"category_scores_gemma":[0.025871182,0.0007879069,0.0013758831,0.0023226088,0.001479256,0.005804221,0.002738645,0.0029790748,0.0017650108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007307627,0.0002966163,0.0032722806,0.0007096047,0.00013058956,0.00024611858,0.00022174462,0.24661094,0.008239936,0.14732538,0.0135378055,0.57867813],"study_design_scores_gemma":[0.00005848027,0.00009746474,0.00019785299,0.000052495965,0.000040759904,0.000130245,0.000036790298,0.92472124,0.004287437,0.06609476,0.0042595463,0.000022908804],"about_ca_topic_score_codex":0.00618734,"about_ca_topic_score_gemma":0.012005037,"teacher_disagreement_score":0.009258092,"about_ca_system_score_codex":0.0020517695,"about_ca_system_score_gemma":0.005959258,"threshold_uncertainty_score":0.030971408},"labels":[],"label_agreement":null},{"id":"W7110276226","doi":"10.4230/lipics.approx/random.2025.22","title":"Directed Buy-At-Bulk Spanners","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; National Science Foundation","keywords":"Sublinear function; Approximation algorithm; Randomized algorithm; Enhanced Data Rates for GSM Evolution; Online algorithm; Terminal (telecommunication); Spanner; Time complexity","score_opus":0.011666012322819446,"score_gpt":0.2558468628575314,"score_spread":0.24418085053471195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110276226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045636266,0.00059064775,0.9353905,0.0009334641,0.00015708673,0.000332476,0.0007819359,0.0009852672,0.015192421],"genre_scores_gemma":[0.3915701,0.0006313913,0.5818751,0.000684164,0.00017422829,0.0004977109,0.0020520927,0.0004926847,0.022022579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987764,0.00033457062,0.00006168511,0.00044170945,0.00020721587,0.00017843986],"domain_scores_gemma":[0.9978011,0.0010362775,0.00025833392,0.00051998004,0.00015716937,0.00022709183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013519814,0.0014420424,0.0015504129,0.00061651453,0.00073977455,0.001649996,0.0022991868,0.0018319417,0.017207237],"category_scores_gemma":[0.0047031622,0.000620171,0.0011669903,0.0013660393,0.0009031593,0.0046913936,0.0022704655,0.0021645061,0.0025692706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074663776,0.00055942236,0.0016087315,0.0007585938,0.00015610577,0.00047432486,0.00037655197,0.41580066,0.010067202,0.3059285,0.021298245,0.24222496],"study_design_scores_gemma":[0.00010137583,0.0002512234,0.00023391774,0.000051105177,0.00003792743,0.00026745573,0.00012459062,0.65760183,0.0050319177,0.32326537,0.013002497,0.000030828433],"about_ca_topic_score_codex":0.0009188219,"about_ca_topic_score_gemma":0.0018019464,"teacher_disagreement_score":0.017207237,"about_ca_system_score_codex":0.0010050117,"about_ca_system_score_gemma":0.00086083956,"threshold_uncertainty_score":0.05756396},"labels":[],"label_agreement":null},{"id":"W7110327960","doi":"10.4230/lipics.approx/random.2025.42","title":"On the Spectral Expansion of Monotone Subsets of the Hypercube","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Upper and lower bounds; Hypercube; Spectral properties; Spectral gap; Mixing (physics)","score_opus":0.03513197230663311,"score_gpt":0.32015924855122824,"score_spread":0.2850272762445951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110327960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44272628,0.0008905871,0.52856356,0.0015017539,0.00008606229,0.00008659619,0.00035834842,0.00020670623,0.025580006],"genre_scores_gemma":[0.93525815,0.00065034593,0.058211386,0.00051971583,0.0001517412,0.00023218515,0.00038347676,0.00013340803,0.004459533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990398,0.00045300636,0.000025407633,0.0001633092,0.00018168747,0.00013675218],"domain_scores_gemma":[0.99201244,0.0063293334,0.0005500242,0.00037311527,0.00035568853,0.00037937157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015081752,0.0005482255,0.0006548142,0.0012493719,0.00070979993,0.0011877974,0.0010769679,0.0008262305,0.005078454],"category_scores_gemma":[0.010666702,0.00042880667,0.00064716843,0.0008099623,0.0021914511,0.0032338751,0.0019537068,0.001687819,0.00042870082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000122185,0.000039344894,0.0012263696,0.00010171796,0.000018475115,0.00013617573,0.00033171003,0.035645038,0.005367027,0.94674516,0.0013264556,0.008940286],"study_design_scores_gemma":[0.000025808578,0.00005544411,0.00076863886,0.000039065013,0.00000930368,0.00012784541,0.00012643069,0.3083591,0.0018710104,0.687232,0.001369414,0.000015890866],"about_ca_topic_score_codex":0.00090425037,"about_ca_topic_score_gemma":0.0006813584,"teacher_disagreement_score":0.005078454,"about_ca_system_score_codex":0.001057423,"about_ca_system_score_gemma":0.00034636504,"threshold_uncertainty_score":0.016989172},"labels":[],"label_agreement":null},{"id":"W7110328884","doi":"10.4230/lipics.esa.2025.67","title":"Compact Representation of Semilinear and Terrain-Like Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds De La Recherche Scientifique - FNRS; McGill University","keywords":"Bipartite graph; Bounded function; Indifference graph; Complete bipartite graph; 1-planar graph; Intersection graph; Chordal graph; Simple (philosophy); Intersection (aeronautics)","score_opus":0.013114473344465449,"score_gpt":0.28407635634429196,"score_spread":0.2709618829998265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110328884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71094435,0.0007327572,0.2611519,0.0003506185,0.0000434053,0.00006362187,0.00065524114,0.00048031844,0.02557782],"genre_scores_gemma":[0.9638193,0.00022800973,0.032042943,0.000066911205,0.000030429226,0.000047487167,0.0005887162,0.000040207473,0.0031359338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997713,0.000038176506,0.000009860265,0.000054668842,0.00008013217,0.00004587057],"domain_scores_gemma":[0.9993943,0.0001645315,0.00015096762,0.00015014091,0.00007847597,0.00006161993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097301454,0.00024113047,0.00023266308,0.0007457432,0.00036055633,0.0009466615,0.0005686,0.00036867734,0.0035324825],"category_scores_gemma":[0.0009220668,0.0002189624,0.0002584947,0.000909516,0.0006858341,0.0019875283,0.0008588446,0.00058884,0.00039237735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002573564,0.000070554874,0.002723889,0.00022243006,0.000026740126,0.00068106706,0.0011282515,0.06174943,0.028612792,0.82925874,0.002803237,0.07246546],"study_design_scores_gemma":[0.00004411742,0.00019958112,0.0042045377,0.000060169812,0.0000203311,0.001261119,0.00090950326,0.316363,0.013615501,0.6395401,0.023736272,0.000045755838],"about_ca_topic_score_codex":0.00079605484,"about_ca_topic_score_gemma":0.0008897315,"teacher_disagreement_score":0.0035324825,"about_ca_system_score_codex":0.00053339254,"about_ca_system_score_gemma":0.00013225847,"threshold_uncertainty_score":0.0118172765},"labels":[],"label_agreement":null},{"id":"W7110338092","doi":"10.4230/lipics.esa.2025.75","title":"An Improved Bound for Plane Covering Paths","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Agence Nationale de la Recherche; National Science Foundation","keywords":"Path (computing); Plane (geometry); Upper and lower bounds; Point (geometry); Set (abstract data type); Simple (philosophy)","score_opus":0.009719720804736804,"score_gpt":0.2711440292397116,"score_spread":0.2614243084349748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110338092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08899309,0.0074342466,0.8105661,0.0030738427,0.00071142474,0.00036278125,0.002475569,0.0049444516,0.08143848],"genre_scores_gemma":[0.43041536,0.004853092,0.53578246,0.001114047,0.0007558268,0.0006434918,0.0040882765,0.0017411178,0.020606376],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566627,0.00047384427,0.00019240951,0.00081674865,0.0016965456,0.0011541571],"domain_scores_gemma":[0.9922667,0.0042734873,0.00037198587,0.0016280016,0.001037661,0.00042220016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019301937,0.0020253237,0.0016340836,0.0030968294,0.0017623244,0.0037979793,0.0033886284,0.002025985,0.022366414],"category_scores_gemma":[0.015581643,0.0009756316,0.0023181997,0.0042020404,0.0022283695,0.010170315,0.0055116573,0.0048691635,0.0053983983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018612468,0.0004693352,0.006383753,0.0014514936,0.00023228036,0.00086218683,0.00103873,0.20021096,0.038433924,0.26775363,0.06851052,0.41279197],"study_design_scores_gemma":[0.0001361673,0.0005116923,0.0032015482,0.0003449795,0.00028691025,0.0013311807,0.0003417332,0.6005782,0.017082572,0.2918651,0.08418187,0.00013805347],"about_ca_topic_score_codex":0.0052575795,"about_ca_topic_score_gemma":0.0049003735,"teacher_disagreement_score":0.022366414,"about_ca_system_score_codex":0.002945814,"about_ca_system_score_gemma":0.0016113289,"threshold_uncertainty_score":0.07482308},"labels":[],"label_agreement":null},{"id":"W7110343338","doi":"10.4230/lipics.concur.2025.19","title":"Time for Timed Monitorability","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Nondeterministic algorithm; Undecidable problem; Decidability; Automaton; Property (philosophy); Model checking; Finite-state machine; Temporal logic","score_opus":0.015610811169329131,"score_gpt":0.3057536024058803,"score_spread":0.2901427912365512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110343338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01799921,0.0017629577,0.9395356,0.0037962112,0.0005180032,0.00028730324,0.0006909812,0.0019067081,0.03350311],"genre_scores_gemma":[0.5561797,0.00221988,0.4116675,0.0019301749,0.00094871665,0.0017865335,0.0013755808,0.0014807452,0.022411276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99170494,0.0017329882,0.00076928677,0.0029613343,0.002035401,0.0007960486],"domain_scores_gemma":[0.9791845,0.013797248,0.0014071487,0.0033682552,0.0016633914,0.00057942735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044239406,0.0014639853,0.0012446074,0.0013702889,0.0019303702,0.0054505616,0.0018637283,0.0021960386,0.015518444],"category_scores_gemma":[0.028828284,0.00096104667,0.0035807467,0.0011875067,0.005685411,0.009696546,0.004496038,0.006254143,0.0022848882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112454734,0.000029702462,0.00035608248,0.00018991012,0.00003462497,0.0001543106,0.00035472878,0.0090084495,0.0027870198,0.9731767,0.001581554,0.012214467],"study_design_scores_gemma":[0.000062364226,0.000043261145,0.000104806415,0.00006935458,0.000039188515,0.00012519759,0.000048058984,0.030779766,0.0027057063,0.954016,0.011981146,0.000025190171],"about_ca_topic_score_codex":0.0025413458,"about_ca_topic_score_gemma":0.001814253,"teacher_disagreement_score":0.015518444,"about_ca_system_score_codex":0.0038376332,"about_ca_system_score_gemma":0.0027881109,"threshold_uncertainty_score":0.051914394},"labels":[],"label_agreement":null},{"id":"W7110347528","doi":"10.4230/lipics.socg.2025.69","title":"Computing Betti Tables and Minimal Presentations of Zero-Dimensional Persistent Homology","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Sherbrooke","funders":"Engineering and Physical Sciences Research Council; University of Oxford; National Science Foundation","keywords":"Betti number; Persistent homology; Topological data analysis; Homology (biology); Simplicial homology; Simplicial complex; Singular homology; Bottleneck","score_opus":0.014067612155145789,"score_gpt":0.2670925453594432,"score_spread":0.2530249332042974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110347528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7032005,0.0008568817,0.27724192,0.000833652,0.00011041772,0.00008589243,0.00575086,0.0036938565,0.008225959],"genre_scores_gemma":[0.9252689,0.00026991733,0.06290468,0.000100410536,0.00010662948,0.00006930299,0.00674146,0.00036205945,0.004176613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900913,0.00011377421,0.00009470503,0.00030720272,0.00031113057,0.0001640328],"domain_scores_gemma":[0.99631613,0.0017295281,0.0004031933,0.0007680738,0.00035888504,0.0004241636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010281968,0.0006582641,0.0010108863,0.0030909288,0.00082298176,0.0043561114,0.0018286565,0.00081662333,0.0087184785],"category_scores_gemma":[0.009604733,0.00052657997,0.00094065926,0.002686467,0.0012426316,0.009745542,0.003161645,0.0013854324,0.0016477666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083570526,0.00026693734,0.03404558,0.0009416073,0.00021191618,0.0006988008,0.002667901,0.06806469,0.020384979,0.5470108,0.019518336,0.30535284],"study_design_scores_gemma":[0.000025154515,0.00007055068,0.0029883594,0.00005032374,0.000035490302,0.00021185953,0.00031044477,0.08885466,0.006634033,0.89647126,0.004299966,0.00004796931],"about_ca_topic_score_codex":0.0010132992,"about_ca_topic_score_gemma":0.001622542,"teacher_disagreement_score":0.0087184785,"about_ca_system_score_codex":0.0011687807,"about_ca_system_score_gemma":0.00070562714,"threshold_uncertainty_score":0.029166281},"labels":[],"label_agreement":null},{"id":"W7110382014","doi":"10.4230/lipics.itcs.2025.20","title":"Estimating Euclidean Distance to Linearity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Estimator; Function (biology); Oracle; Euclidean distance; Linearity; Upper and lower bounds; Euclidean geometry","score_opus":0.01426574667479549,"score_gpt":0.28729682927286787,"score_spread":0.2730310825980724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110382014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12674621,0.0022748776,0.86075664,0.0023091247,0.00013721755,0.00010208847,0.0007534807,0.00082366803,0.006096708],"genre_scores_gemma":[0.8394385,0.0009965017,0.1526889,0.00053820125,0.00034018853,0.00026624833,0.0017999285,0.00021879323,0.0037126096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993343,0.0028040814,0.00038837444,0.0015343683,0.0013156278,0.0006145316],"domain_scores_gemma":[0.95393145,0.0359708,0.0020038735,0.004662048,0.0025514446,0.0008803474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054950044,0.0010513464,0.0018229601,0.0014031183,0.00065891247,0.0024831838,0.0027080148,0.0015860881,0.0036369872],"category_scores_gemma":[0.06801004,0.00063161954,0.00095601927,0.0016420215,0.0024471448,0.0066812336,0.004411131,0.0034809075,0.0011710426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021073967,0.00031541314,0.016899565,0.0007409436,0.00028043985,0.00023071608,0.0005298948,0.57656926,0.007141539,0.21236344,0.0129215745,0.16989975],"study_design_scores_gemma":[0.000038492544,0.00015649422,0.0017743243,0.000055507557,0.00002544289,0.00013705039,0.00009841384,0.87141633,0.003398841,0.12120864,0.0016478852,0.000042673484],"about_ca_topic_score_codex":0.0025530949,"about_ca_topic_score_gemma":0.0017782433,"teacher_disagreement_score":0.0054950044,"about_ca_system_score_codex":0.0025742438,"about_ca_system_score_gemma":0.0014728599,"threshold_uncertainty_score":0.029060662},"labels":[],"label_agreement":null},{"id":"W7110393708","doi":"10.4230/lipics.stacs.2025.60","title":"Modular Counting CSP: Reductions and Algorithms","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Constraint satisfaction problem; Automorphism; Prime (order theory); Counting problem; Modular design; Focus (optics); Binary number; Binary tree","score_opus":0.0078069332054348396,"score_gpt":0.24956541262937426,"score_spread":0.2417584794239394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110393708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02451978,0.0009942048,0.93019086,0.002913532,0.00024013084,0.00037340893,0.0007884953,0.0018491625,0.038130417],"genre_scores_gemma":[0.26633778,0.0014389633,0.7044376,0.001192975,0.0007287647,0.0008290852,0.0030132872,0.0012355754,0.020785922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970722,0.0009197199,0.00014549654,0.0006300151,0.00088820443,0.00034428242],"domain_scores_gemma":[0.9949845,0.003114208,0.00026096284,0.0011037241,0.00034311262,0.00019351506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002040204,0.0014422628,0.0012807363,0.0015361579,0.0013895709,0.0033654831,0.0035173781,0.0015475397,0.011149391],"category_scores_gemma":[0.011010055,0.000735495,0.0027793306,0.003156526,0.0020585095,0.005823879,0.0049454696,0.0056184484,0.0026876787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014383985,0.00023058259,0.00042635578,0.00033452286,0.000049143753,0.00012183432,0.0002730844,0.044593673,0.002004588,0.7917893,0.019211227,0.14082175],"study_design_scores_gemma":[0.000052768868,0.000022539787,0.00013212644,0.000038266397,0.000029801417,0.00011649571,0.00005508643,0.12951656,0.0015070713,0.85926586,0.009243675,0.000019760697],"about_ca_topic_score_codex":0.002317211,"about_ca_topic_score_gemma":0.0029616966,"teacher_disagreement_score":0.011149391,"about_ca_system_score_codex":0.003128442,"about_ca_system_score_gemma":0.0025645238,"threshold_uncertainty_score":0.03729838},"labels":[],"label_agreement":null},{"id":"W7110396286","doi":"10.4230/lipics.itcs.2025.33","title":"Bosonic Quantum Computational Complexity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Quantum Information and Matter, California Institute of Technology; Agence Nationale de la Recherche; National Science Foundation","keywords":"Quantum computer; Quantum complexity theory; Quantum algorithm; Quantum; Upper and lower bounds; Adiabatic quantum computation; Complexity class; Quantum information; Observable; Hilbert space","score_opus":0.015383896801927179,"score_gpt":0.2703875122554101,"score_spread":0.2550036154534829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110396286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08113412,0.009120923,0.74446785,0.022160497,0.000728859,0.0002124137,0.0012760633,0.00046509315,0.14043409],"genre_scores_gemma":[0.8258763,0.005518415,0.14121684,0.0022952482,0.0020892275,0.0005195041,0.0012887546,0.00023885397,0.020956846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975504,0.0005887264,0.0001364275,0.00056629145,0.00090451323,0.0002536471],"domain_scores_gemma":[0.9935237,0.0045031765,0.00022679991,0.00096453645,0.0005687646,0.00021303564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001946104,0.0005918753,0.0007964134,0.000984076,0.0013527727,0.0044072038,0.0012480791,0.0014253781,0.007133192],"category_scores_gemma":[0.0074822735,0.00038556432,0.0013288347,0.0011283198,0.0047035194,0.0075595407,0.0029709607,0.0051167235,0.00077325775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007020904,0.0000070186275,0.00008296305,0.00004688526,0.0000047573544,0.000008630623,0.000043343665,0.0022178735,0.00016426215,0.9915337,0.0011069619,0.0047766557],"study_design_scores_gemma":[0.0000036472227,0.00000467765,0.000073011826,0.000008875537,0.0000023052442,0.000015938589,0.000012170204,0.0140628675,0.00015320488,0.9814123,0.0042466563,0.0000043800283],"about_ca_topic_score_codex":0.001233664,"about_ca_topic_score_gemma":0.0007087782,"teacher_disagreement_score":0.007133192,"about_ca_system_score_codex":0.0031768838,"about_ca_system_score_gemma":0.0014218545,"threshold_uncertainty_score":0.023862898},"labels":[],"label_agreement":null},{"id":"W7110402696","doi":"10.4230/lipics.socg.2025.20","title":"Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Trafikverket; Vetenskapsrådet; National Science Foundation","keywords":"Boundary (topology); Simple polygon; Polygon (computer graphics); Visibility polygon; Piecewise linear function; Merge (version control); Time complexity; Simple (philosophy); Piecewise","score_opus":0.009852901843521469,"score_gpt":0.2450447533529187,"score_spread":0.23519185150939723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110402696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03574586,0.0029126063,0.91982853,0.0030000329,0.0002507373,0.0005253051,0.0018021144,0.0073416075,0.028593164],"genre_scores_gemma":[0.22946708,0.0016337693,0.74769217,0.0007283681,0.00028595031,0.0006353534,0.00470303,0.0014927409,0.013361621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998111,0.00029833373,0.0001120463,0.0005452346,0.00036581504,0.00056760135],"domain_scores_gemma":[0.996323,0.0024241859,0.00025075156,0.000640058,0.00021140242,0.00015061826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001157831,0.0026259592,0.0022577215,0.0013272283,0.002072757,0.0034007565,0.0051051294,0.0030173582,0.017723983],"category_scores_gemma":[0.0061567635,0.0010753364,0.0027730877,0.0035690456,0.0015788422,0.0068332492,0.0032735674,0.003856891,0.004295752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005903977,0.0008402819,0.0010595615,0.0015894431,0.00015712378,0.00034971832,0.00070852455,0.43292412,0.0046876906,0.17219132,0.076254115,0.30864775],"study_design_scores_gemma":[0.00028254028,0.00009263313,0.00032245886,0.000066409,0.00006802237,0.0003069399,0.0003310517,0.6896376,0.002080643,0.28771436,0.01905687,0.00004034249],"about_ca_topic_score_codex":0.008607207,"about_ca_topic_score_gemma":0.012025375,"teacher_disagreement_score":0.017723983,"about_ca_system_score_codex":0.0031171902,"about_ca_system_score_gemma":0.002856033,"threshold_uncertainty_score":0.059292614},"labels":[],"label_agreement":null},{"id":"W7110406114","doi":"10.4230/lipics.aft.2025.19","title":"Two-Tier Black-Box Blockchains and Application to Instant Layer-1 Payments","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Purdue University; National Science Foundation","keywords":"Liveness; Reputation; Hash function; Blockchain; Database transaction; Payment; Byzantine fault tolerance; Cryptography; Gas meter prover","score_opus":0.00716331538222529,"score_gpt":0.262070683163895,"score_spread":0.25490736778166967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110406114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087046795,0.000610187,0.88627106,0.0008080867,0.0002217805,0.00023941342,0.00020788662,0.0020348511,0.022559926],"genre_scores_gemma":[0.8276285,0.0004768712,0.15665598,0.00009790311,0.000046694826,0.00011609529,0.000114678194,0.00011638508,0.014746939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993506,0.00016884532,0.000041814914,0.000109363056,0.00021473964,0.000114563954],"domain_scores_gemma":[0.9989028,0.0003366996,0.00009469441,0.00035718488,0.00016175934,0.00014688505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159111,0.00032736702,0.00043278764,0.00031284898,0.00079881784,0.0018915047,0.00095675956,0.0010819229,0.008808227],"category_scores_gemma":[0.002892274,0.0003024522,0.00046042108,0.0005579564,0.0010196661,0.002130495,0.0021011033,0.0012559994,0.0010864446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062501786,0.00016982635,0.0013673052,0.00019924581,0.000049022183,0.0008177597,0.00055630837,0.38162374,0.02122984,0.48347118,0.0035787171,0.10631207],"study_design_scores_gemma":[0.000061133505,0.000077997756,0.00028282544,0.000032916778,0.000016257454,0.00015331093,0.00006210535,0.85266215,0.0058476287,0.12776121,0.013014507,0.000027929926],"about_ca_topic_score_codex":0.002080138,"about_ca_topic_score_gemma":0.0023249767,"teacher_disagreement_score":0.008808227,"about_ca_system_score_codex":0.00089681835,"about_ca_system_score_gemma":0.0010003395,"threshold_uncertainty_score":0.02946645},"labels":[],"label_agreement":null},{"id":"W7110406314","doi":"10.4230/lipics.icalp.2025.37","title":"Satisfiability of Commutative vs. Non-Commutative CSPs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; UK Research and Innovation","keywords":"Satisfiability; Boolean satisfiability problem; Constraint satisfaction problem; Hilbert space; Commutative property; Maximum satisfiability problem; Dimension (graph theory)","score_opus":0.011625649098114992,"score_gpt":0.31388914808129603,"score_spread":0.30226349898318106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110406314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57454115,0.0025085064,0.38600913,0.007414099,0.00021399296,0.00024028058,0.0011500655,0.000957821,0.026965005],"genre_scores_gemma":[0.9508301,0.0006576402,0.044126853,0.00050994364,0.00021020338,0.00012468589,0.0007003416,0.00009302063,0.0027472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563307,0.0015800204,0.00036209731,0.00086170674,0.0010818748,0.00048125596],"domain_scores_gemma":[0.97837436,0.017009493,0.0013105304,0.0014151818,0.0012089185,0.00068152684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004355677,0.00046160872,0.0007325023,0.00071427744,0.0010997353,0.002521988,0.001426764,0.000943679,0.0029168038],"category_scores_gemma":[0.018378695,0.0006210713,0.0014318363,0.0012050816,0.0032348684,0.0077038812,0.002608687,0.0034652785,0.000270433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028715204,0.0001455711,0.002264925,0.000336069,0.00012145117,0.00071067415,0.0010677174,0.040468466,0.005093822,0.9244668,0.0023648147,0.022672424],"study_design_scores_gemma":[0.000099159406,0.000039164428,0.00054379535,0.000023397035,0.00006361672,0.00023678782,0.00027668916,0.12324058,0.0053766244,0.86777145,0.0023010916,0.000027648117],"about_ca_topic_score_codex":0.0033034333,"about_ca_topic_score_gemma":0.0023804135,"teacher_disagreement_score":0.004355677,"about_ca_system_score_codex":0.0015107603,"about_ca_system_score_gemma":0.0018192581,"threshold_uncertainty_score":0.023035347},"labels":[],"label_agreement":null},{"id":"W7110410286","doi":"10.4230/lipics.approx/random.2025.40","title":"Sublinear Space Graph Algorithms in the Continual Release Model","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Sublinear function; Differential privacy; Vertex (graph theory); Graph; Logarithm; Leverage (statistics); Graph property; Upper and lower bounds","score_opus":0.02049912437843991,"score_gpt":0.2819945060479404,"score_spread":0.2614953816695005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110410286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07146208,0.0011032701,0.90359896,0.0060765822,0.00019643761,0.0003811343,0.0014426329,0.0047926516,0.010946182],"genre_scores_gemma":[0.6107404,0.0009045205,0.3724637,0.0017922423,0.00037782802,0.0006284217,0.0020065904,0.0011531288,0.009933167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936888,0.001612686,0.0003351843,0.0015121787,0.001962529,0.0008886262],"domain_scores_gemma":[0.9763432,0.012617935,0.0014773007,0.007650859,0.0011059623,0.0008047543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004592139,0.002025343,0.0020198673,0.00097139337,0.0012087834,0.0038200154,0.0048100655,0.0023959342,0.0082205795],"category_scores_gemma":[0.02242645,0.00087486184,0.0019048569,0.0022472013,0.0025935746,0.015000241,0.0062796935,0.007489469,0.0025673234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031299791,0.0008940152,0.0033776206,0.00084483525,0.0002115616,0.00034202015,0.0009778778,0.45520353,0.012862644,0.32632768,0.020994423,0.17483383],"study_design_scores_gemma":[0.0001913112,0.00015687024,0.00027751963,0.000038232152,0.00004079498,0.00015340844,0.000121795725,0.689496,0.004993906,0.30155617,0.0029465281,0.000027523352],"about_ca_topic_score_codex":0.0017194754,"about_ca_topic_score_gemma":0.0031921733,"teacher_disagreement_score":0.0082205795,"about_ca_system_score_codex":0.003428835,"about_ca_system_score_gemma":0.0032086603,"threshold_uncertainty_score":0.02750057},"labels":[],"label_agreement":null},{"id":"W7110418722","doi":"10.4230/lipics.icalp.2025.10","title":"On the Complexity of Telephone Broadcasting from Cacti to Bounded Pathwidth Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Bounded function; Pathwidth; Vertex (graph theory); Cactus; Simple (philosophy); Indifference graph; Broadcasting (networking); Clique-sum","score_opus":0.038594561658899726,"score_gpt":0.26846180345618703,"score_spread":0.2298672417972873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110418722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7252734,0.006223626,0.18375818,0.020547131,0.0003840328,0.0005974857,0.007878377,0.0027122684,0.052625574],"genre_scores_gemma":[0.91733897,0.0033883294,0.059355017,0.0021986705,0.0006004628,0.00050247926,0.0066342605,0.0008210332,0.009160826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974445,0.0006888006,0.00009934685,0.0006161386,0.0005195607,0.000631487],"domain_scores_gemma":[0.9603639,0.03388836,0.0016563849,0.0018120146,0.0011501746,0.0011291385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774942,0.0015430194,0.0021678065,0.0012504522,0.0023719324,0.004602939,0.0036608814,0.0030578848,0.011803278],"category_scores_gemma":[0.022632191,0.0009013295,0.001776761,0.00281847,0.0028499353,0.009166483,0.0030594158,0.005065972,0.001148284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022556158,0.0006129069,0.008052481,0.0018869414,0.00027396335,0.00086922763,0.0027805786,0.6122133,0.008171722,0.22425365,0.065456875,0.07317282],"study_design_scores_gemma":[0.00026778443,0.000093130235,0.0020305146,0.0001028148,0.00010833805,0.0004152301,0.00051571603,0.64178514,0.0016972363,0.3474812,0.0054458138,0.000057194553],"about_ca_topic_score_codex":0.01916095,"about_ca_topic_score_gemma":0.013452787,"teacher_disagreement_score":0.01916095,"about_ca_system_score_codex":0.006277361,"about_ca_system_score_gemma":0.0032510816,"threshold_uncertainty_score":0.045545697},"labels":[],"label_agreement":null},{"id":"W7110422314","doi":"10.4230/lipics.wads.2025.42","title":"The Parameterized Landscape of Labeled Graph Contractions","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Treewidth; Graph; Degeneracy (biology); Contraction (grammar); Computational complexity theory; Upper and lower bounds","score_opus":0.012420816385483684,"score_gpt":0.2946825092797038,"score_spread":0.2822616928942201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110422314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48436156,0.0010405829,0.4844436,0.007564646,0.00008101868,0.00023915584,0.0014517764,0.0010951457,0.019722637],"genre_scores_gemma":[0.8637109,0.0006896736,0.1259115,0.00094444246,0.000174484,0.00048464126,0.0020700095,0.0007471447,0.0052672857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922105,0.0032650083,0.00037211186,0.0021070407,0.0014190282,0.0006262954],"domain_scores_gemma":[0.9579055,0.029532813,0.0031529346,0.0066643376,0.0012196723,0.0015247249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042827916,0.0010578175,0.0019013481,0.0009166861,0.0019084131,0.004616837,0.003790161,0.0031836121,0.007710696],"category_scores_gemma":[0.039133407,0.001074896,0.0019248548,0.0022788025,0.004251015,0.015064164,0.0041684923,0.0048933956,0.0007076403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001020273,0.0003566141,0.005864542,0.00069921906,0.0002158668,0.00059241644,0.0012202478,0.3476869,0.01124833,0.5593244,0.007873743,0.06389754],"study_design_scores_gemma":[0.00011703257,0.00010176629,0.0008790993,0.000050802584,0.000044104763,0.000353492,0.00027842683,0.37910998,0.0023655933,0.6122378,0.0044246954,0.000037251888],"about_ca_topic_score_codex":0.0012401732,"about_ca_topic_score_gemma":0.0012611115,"teacher_disagreement_score":0.007710696,"about_ca_system_score_codex":0.0031332627,"about_ca_system_score_gemma":0.0016975276,"threshold_uncertainty_score":0.025794864},"labels":[],"label_agreement":null},{"id":"W7110448534","doi":"10.4230/lipics.tqc.2025.8","title":"Self-Testing in the Compiled Setting via Tilted-CHSH Inequalities","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; HORIZON EUROPE Framework Programme; European Commission","keywords":"Inequality; International comparisons; Context (archaeology); Term (time); Linear inequality","score_opus":0.015925200414967294,"score_gpt":0.26137567154417535,"score_spread":0.24545047112920806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110448534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3404343,0.0007551739,0.55353266,0.005860654,0.00062127976,0.00014565834,0.0011181058,0.001781157,0.09575087],"genre_scores_gemma":[0.95622784,0.00023358234,0.029795226,0.001026736,0.00065372983,0.0001567399,0.0005080964,0.00047890013,0.010919202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951892,0.0016381961,0.00021136292,0.00076795387,0.001034379,0.0011587993],"domain_scores_gemma":[0.9799873,0.013984521,0.000988669,0.002707854,0.0012564656,0.0010751651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004029007,0.0012010434,0.0020741748,0.0026352322,0.0019623104,0.004416866,0.0022340775,0.0019766216,0.013356293],"category_scores_gemma":[0.02310508,0.00063982105,0.0016194684,0.0018344189,0.0059080604,0.008344171,0.0064851562,0.005005912,0.0013445811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103700564,0.00002845376,0.00046644118,0.00005576919,0.000014921356,0.00011660602,0.00012865853,0.0037852642,0.00046266723,0.98816085,0.0020655002,0.0046111476],"study_design_scores_gemma":[0.000022058326,0.000012497377,0.00010256799,0.000012457085,0.000008156431,0.000027913713,0.000016516244,0.02592388,0.000386312,0.97319895,0.00027821,0.0000104036],"about_ca_topic_score_codex":0.001522128,"about_ca_topic_score_gemma":0.0016440996,"teacher_disagreement_score":0.013356293,"about_ca_system_score_codex":0.0023048916,"about_ca_system_score_gemma":0.0016992568,"threshold_uncertainty_score":0.04468125},"labels":[],"label_agreement":null},{"id":"W7111085514","doi":"10.4230/lipics.fsttcs.2025.40","title":"Improved Upper Bounds on Multiflow-Multicut Gaps in Cactus Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Upper and lower bounds; Rounding; Graph; Cactus; Set (abstract data type); Path (computing); Graph theory","score_opus":0.010337931241448365,"score_gpt":0.2653205778688018,"score_spread":0.2549826466273534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111085514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3358881,0.016506445,0.5527926,0.004812644,0.00062008144,0.00040687484,0.002370309,0.004319571,0.08228342],"genre_scores_gemma":[0.83723295,0.0030413775,0.14917997,0.0009351081,0.00045665217,0.0003413293,0.001311479,0.0007872079,0.0067140106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964623,0.000585708,0.00012465224,0.0006607121,0.0010507592,0.001115966],"domain_scores_gemma":[0.9866941,0.008810353,0.0009958177,0.0016722133,0.0009240429,0.00090348447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027455704,0.002333589,0.0019917502,0.0031059447,0.0021420605,0.0041728118,0.0042992774,0.0018075334,0.0090368325],"category_scores_gemma":[0.015085985,0.0010091268,0.0013061123,0.0032718065,0.0021178569,0.008606552,0.0054144985,0.004717187,0.0013094455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015720612,0.00053031923,0.0037177345,0.0013942848,0.00015273252,0.00048777132,0.0008628232,0.4822039,0.014988919,0.3215988,0.024304044,0.14818661],"study_design_scores_gemma":[0.00008420741,0.0002793401,0.0016394521,0.00028785464,0.00009241885,0.0004673857,0.00034645933,0.6715586,0.010992477,0.30094078,0.013221364,0.00008969493],"about_ca_topic_score_codex":0.0026736849,"about_ca_topic_score_gemma":0.0037347388,"teacher_disagreement_score":0.0090368325,"about_ca_system_score_codex":0.0038047943,"about_ca_system_score_gemma":0.0017073131,"threshold_uncertainty_score":0.030231237},"labels":[],"label_agreement":null},{"id":"W875360987","doi":"10.4230/dagrep.3.2.1","title":"Fault Prediction, Localization, and Repair (Dagstuhl Seminar 13061)","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität des Saarlandes; University College London; Case Western Reserve University; Institut national de recherche en informatique et en automatique (INRIA); Universidade do Porto; University of Waterloo; Oregon State University","keywords":"Debugging; Computer science; Program slicing; Program comprehension; Redundancy (engineering); Software engineering; Symbolic execution; Software bug; Software; Programming language; Machine learning; Software system; Operating system","score_opus":0.008543873323558932,"score_gpt":0.23112702938986382,"score_spread":0.22258315606630488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W875360987","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033627473,0.08770308,0.20271678,0.0646494,0.07868088,0.00094669533,0.014137509,0.021118505,0.4964196],"genre_scores_gemma":[0.075543664,0.035353955,0.08310582,0.004934965,0.013597654,0.0010308004,0.0132804345,0.007935822,0.76521695],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860567,0.0002811944,0.00007139748,0.00039959955,0.00034072663,0.00030147136],"domain_scores_gemma":[0.99914956,0.00024061583,0.00004139505,0.00010128686,0.00017303955,0.00029401996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018393762,0.0026893406,0.001794798,0.0018321745,0.0008906565,0.0038821024,0.0011653756,0.002635573,0.1414248],"category_scores_gemma":[0.0027864603,0.0012306613,0.0013524629,0.0014992396,0.00071650546,0.0028697446,0.0035444484,0.004390773,0.12104617],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000658474,0.0004137368,0.00021323054,0.00054348336,0.000062042265,0.0003555312,0.00016494315,0.0035791376,0.007715032,0.024502197,0.64298046,0.3188117],"study_design_scores_gemma":[0.00029697278,0.00047247802,0.0022229943,0.0006109485,0.00005946376,0.00043582954,0.00011266786,0.00971581,0.0050837677,0.05533289,0.9255715,0.00008480457],"about_ca_topic_score_codex":0.00078439526,"about_ca_topic_score_gemma":0.0014010378,"teacher_disagreement_score":0.1414248,"about_ca_system_score_codex":0.0017538738,"about_ca_system_score_gemma":0.001107311,"threshold_uncertainty_score":0.47311312},"labels":[],"label_agreement":null}]}